in scala.collection.mutable
class StackProxy

mixin abstract `class` StackProxy [ A ]
  `extends` scala.collection.mutable.Stack[A]
  `with` scala.SeqProxy[A]
  `with` scala.ScalaObject

  A stack implements a data structure which allows to store and retrieve objects in a last-in-first-out (LIFO) fashion.

author:
  Matthias Zenger
version:
  1.0, 10/05/2004

Def Summary
`override` | `def` ++= ( it : scala.Iterator[A] ) : scala.Unit Pushes all elements provided by an iterator on top of the stack. The elements are pushed in the order they are given out by the iterator.
`override` | `def` ++= ( iter : scala.Iterable[A] ) : scala.Unit Pushes all elements provided by an `Iterable` object on top of the stack. The elements are pushed in the order they are given out by the iterator.
`override` | `def` += ( elem : A ) : scala.Unit Pushes a single element on top of the stack.
`override` | `def` apply ( n : scala.Int ) : A Access element number `n`.
`override` | `def` clear : scala.Unit Removes all elements from the stack. After this operation completed, the stack will be empty.
`override` | `def` clone : scala.collection.mutable.Stack[A] This method clones the stack.
`override` | `def` elements : scala.Iterator[A] Returns an iterator over all elements on the stack. This iterator is stable with respect to state changes in the stack object; i.e. such changes will not be reflected in the iterator. The iterator issues elements in the order they were inserted into the stack (FIFO order).
`override` | `def` isEmpty : scala.Boolean Checks if the stack is empty.
`override` | `def` length : scala.Int Returns the length of this stack.
`override` | `def` pop : A Removes the top element from the stack.
`override` | `def` push ( elems : A* ) : scala.Unit Pushes a sequence of elements on top of the stack. The first element is pushed first, etc.
| `def` self : scala.collection.mutable.Stack[A]
`override` | `def` toList : scala.List[A] Creates a list of all stack elements in FIFO order.
`override` | `def` top : A Returns the top element of the stack. This method will not remove the element from the stack. An error is signaled if there is no element on the stack.

Def Detail

override `def` ++= ( it : scala.Iterator[A] ) : scala.Unit

  Pushes all elements provided by an iterator on top of the stack. The elements are pushed in the order they are given out by the iterator.

param:
  iter an iterator

override `def` ++= ( iter : scala.Iterable[A] ) : scala.Unit

  Pushes all elements provided by an `Iterable` object on top of the stack. The elements are pushed in the order they are given out by the iterator.

param:
  iter an iterable object

override `def` += ( elem : A ) : scala.Unit

  Pushes a single element on top of the stack.

param:
  elem the element to push onto the stack

override `def` apply ( n : scala.Int ) : A

  Access element number `n`.

return:
  the element at index `n`.

override `def` clear : scala.Unit

  Removes all elements from the stack. After this operation completed, the stack will be empty.

override `def` clone : scala.collection.mutable.Stack[A]

  This method clones the stack.

return:
  a stack with the same elements.

override `def` elements : scala.Iterator[A]

  Returns an iterator over all elements on the stack. This iterator is stable with respect to state changes in the stack object; i.e. such changes will not be reflected in the iterator. The iterator issues elements in the order they were inserted into the stack (FIFO order).

return:
  an iterator over all stack elements.

override `def` isEmpty : scala.Boolean

  Checks if the stack is empty.

return:
  true, iff there is no element on the stack

override `def` length : scala.Int

  Returns the length of this stack.

override `def` pop : A

  Removes the top element from the stack.

override `def` push ( elems : A* ) : scala.Unit

  Pushes a sequence of elements on top of the stack. The first element is pushed first, etc.

param:
  elems a sequence of elements

`def` self : scala.collection.mutable.Stack[A]

override `def` toList : scala.List[A]

  Creates a list of all stack elements in FIFO order.

return:
  the created list.

override `def` top : A

  Returns the top element of the stack. This method will not remove the element from the stack. An error is signaled if there is no element on the stack.

return:
  the top element