diff options
author | michelou <michelou@epfl.ch> | 2005-05-26 14:39:47 +0000 |
---|---|---|
committer | michelou <michelou@epfl.ch> | 2005-05-26 14:39:47 +0000 |
commit | e39e84e8f240c24b3f89e230f1f67c12edc1c527 (patch) | |
tree | 25246c85d9e748a527a00dfaf7fa9b4223bf05a6 | |
parent | e389932a0948127ed9b34eb2c7c57aa9817a4368 (diff) | |
download | scala-e39e84e8f240c24b3f89e230f1f67c12edc1c527.tar.gz scala-e39e84e8f240c24b3f89e230f1f67c12edc1c527.tar.bz2 scala-e39e84e8f240c24b3f89e230f1f67c12edc1c527.zip |
- added overidden method 'stringPrefix'.
- changed indentation (4 -> 2).
-rw-r--r-- | sources/scala/collection/immutable/Stack.scala | 220 |
1 files changed, 113 insertions, 107 deletions
diff --git a/sources/scala/collection/immutable/Stack.scala b/sources/scala/collection/immutable/Stack.scala index 887c6b31b4..5869280353 100644 --- a/sources/scala/collection/immutable/Stack.scala +++ b/sources/scala/collection/immutable/Stack.scala @@ -1,6 +1,6 @@ /* __ *\ ** ________ ___ / / ___ Scala API ** -** / __/ __// _ | / / / _ | (c) 2003, LAMP/EPFL ** +** / __/ __// _ | / / / _ | (c) 2003-2005, LAMP/EPFL ** ** __\ \/ /__/ __ |/ /__/ __ | ** ** /____/\___/_/ |_/____/_/ | | ** ** |/ ** @@ -11,7 +11,7 @@ package scala.collection.immutable; object Stack { - def Empty[A] = new Stack[A]; + def Empty[A] = new Stack[A]; } /** This class implements immutable stacks using a list-based data @@ -24,109 +24,115 @@ object Stack { */ class Stack[+A] extends Seq[A] { - /** Checks if this stack is empty. - * - * @return true, iff there is no element on the stack. - */ - def isEmpty: Boolean = true; - - /** Returns the size of this stack. - * - * @return the stack size. - */ - def length: Int = 0; - - /** Push an element on the stack. - * - * @param elem the element to push on the stack. - * @return the stack with the new element on top. - */ - def +[B >: A](elem: B): Stack[B] = new Node(elem); - - /** Push all elements provided by the given iterable object onto - * the stack. The last element returned by the iterable object - * will be on top of the new stack. - * - * @param elems the iterable object. - * @return the stack with the new elements on top. - */ - def +[B >: A](elems: Iterable[B]): Stack[B] = { - var res: Stack[B] = this; - elems.elements.foreach { elem => res = res + elem; } - res; - } - - /** Push a sequence of elements onto the stack. The last element - * of the sequence will be on top of the new stack. - * - * @param elems the element sequence. - * @return the stack with the new elements on top. - */ - def push[B >: A](elems: B*): Stack[B] = this + elems; - - /** Returns the top element of the stack. An error is signaled if - * there is no element on the stack. - * - * @return the top element. - */ - def top: A = error("no element on stack"); - - /** Removes the top element from the stack. - * - * @return the new stack without the former top element. - */ - def pop: Stack[A] = error("no element on stack"); - - /** Returns the n-th element of this stack. The top element has index - * 0, elements below are indexed with increasing numbers. - * - * @param n the index number. - * @return the n-th element on the stack. - */ - def apply(n: Int): A = error("no element on stack"); - - /** Returns an iterator over all elements on the stack. The iterator - * issues elements in the reversed order they were inserted into the - * stack (LIFO order). - * - * @return an iterator over all stack elements. - */ - def elements: Iterator[A] = toList.elements; - - /** Creates a list of all stack elements in LIFO order. - * - * @return the created list. - */ - override def toList: List[A] = Nil; - - /** Compares this stack with the given object. - * - * @return true, iff the two stacks are equal; i.e. they contain the - * same elements in the same order. - */ - override def equals(obj: Any): Boolean = - if (obj.isInstanceOf[Stack[A]]) - toList.equals((obj.asInstanceOf[Stack[A]]).toList); - else - false; - - /** Returns the hash code for this stack. - * - * @return the hash code of the stack. - */ - override def hashCode(): Int = 0; - - // Here comes true magic: covariant lists with implicit tail references - - protected class Node[+B >: A](elem: B) extends Stack[B] { - override def isEmpty: Boolean = false; - override def length: Int = Stack.this.length + 1; - override def +[C >: B](elem: C): Stack[C] = new Node(elem); - override def +[C >: B](elems: Iterable[C]): Stack[C] = super.+(elems); - override def top: B = elem; - override def pop: Stack[B] = Stack.this; - override def apply(n: Int): B = if (n > 0) Stack.this(n - 1) else elem; - override def toList: List[B] = elem :: Stack.this.toList; - override def hashCode(): Int = elem.hashCode() + Stack.this.hashCode(); - } + /** Checks if this stack is empty. + * + * @return true, iff there is no element on the stack. + */ + def isEmpty: Boolean = true; + + /** Returns the size of this stack. + * + * @return the stack size. + */ + def length: Int = 0; + + /** Push an element on the stack. + * + * @param elem the element to push on the stack. + * @return the stack with the new element on top. + */ + def +[B >: A](elem: B): Stack[B] = new Node(elem); + + /** Push all elements provided by the given iterable object onto + * the stack. The last element returned by the iterable object + * will be on top of the new stack. + * + * @param elems the iterable object. + * @return the stack with the new elements on top. + */ + def +[B >: A](elems: Iterable[B]): Stack[B] = { + var res: Stack[B] = this; + elems.elements.foreach { elem => res = res + elem; } + res + } + + /** Push a sequence of elements onto the stack. The last element + * of the sequence will be on top of the new stack. + * + * @param elems the element sequence. + * @return the stack with the new elements on top. + */ + def push[B >: A](elems: B*): Stack[B] = this + elems; + + /** Returns the top element of the stack. An error is signaled if + * there is no element on the stack. + * + * @return the top element. + */ + def top: A = error("no element on stack"); + + /** Removes the top element from the stack. + * + * @return the new stack without the former top element. + */ + def pop: Stack[A] = error("no element on stack"); + + /** Returns the n-th element of this stack. The top element has index + * 0, elements below are indexed with increasing numbers. + * + * @param n the index number. + * @return the n-th element on the stack. + */ + def apply(n: Int): A = error("no element on stack"); + + /** Returns an iterator over all elements on the stack. The iterator + * issues elements in the reversed order they were inserted into the + * stack (LIFO order). + * + * @return an iterator over all stack elements. + */ + def elements: Iterator[A] = toList.elements; + + /** Creates a list of all stack elements in LIFO order. + * + * @return the created list. + */ + override def toList: List[A] = Nil; + + /** Compares this stack with the given object. + * + * @return true, iff the two stacks are equal; i.e. they contain the + * same elements in the same order. + */ + override def equals(obj: Any): Boolean = + if (obj.isInstanceOf[Stack[A]]) + toList.equals((obj.asInstanceOf[Stack[A]]).toList); + else + false; + + /** Returns the hash code for this stack. + * + * @return the hash code of the stack. + */ + override def hashCode(): Int = 0; + + /** + * Redefines the prefix of the string representation. + */ + override def stringPrefix: String = "Stack"; + + // Here comes true magic: covariant lists with implicit tail references + + protected class Node[+B >: A](elem: B) extends Stack[B] { + override def isEmpty: Boolean = false; + override def length: Int = Stack.this.length + 1; + override def +[C >: B](elem: C): Stack[C] = new Node(elem); + override def +[C >: B](elems: Iterable[C]): Stack[C] = super.+(elems); + override def top: B = elem; + override def pop: Stack[B] = Stack.this; + override def apply(n: Int): B = if (n > 0) Stack.this(n - 1) else elem; + override def toList: List[B] = elem :: Stack.this.toList; + override def hashCode(): Int = elem.hashCode() + Stack.this.hashCode(); + } + } |