in scala.collection.mutable
trait QueueProxy

`abstract trait` QueueProxy [A]
  `extends` scala.collection.mutable.Queue[A]
  `with` scala.SeqProxy[A]
  `with` scala.ScalaObject

  `Queue` objects implement data structures that allow to insert and retrieve elements in a first-in-first-out (FIFO) manner.

Author:
  Matthias Zenger
Version:
  1.1, 03/05/2004

Def Summary
`override` | `def` ++= (it: scala.Iterator[A]) : scala.Unit Adds all elements provided by an iterator at the end of the queue. The elements are prepended in the order they are given out by the iterator.
`override` | `def` ++= (iter: scala.Iterable[A]) : scala.Unit Adds all elements provided by an `Iterable` object at the end of the queue. The elements are prepended in the order they are given out by the iterator.
`override` | `def` += (elem: A) : scala.Unit Inserts a single element at the end of the queue.
`override` | `def` apply (n: scala.Int) : A Access element number `n`.
`override` | `def` clear : scala.Unit Removes all elements from the queue. After this operation is completed, the queue will be empty.
`override` | `def` clone : scala.collection.mutable.Queue[A] This method clones the queue.
`override` | `def` dequeue : A Returns the first element in the queue, and removes this element from the queue.
`override` | `def` elements : scala.Iterator[A] Returns an iterator over all elements on the queue.
`override` | `def` enqueue (elems: A*) : scala.Unit Adds all elements to the queue.
`override` | `def` front : A Returns the first element in the queue, or throws an error if there is no element contained in the queue.
`override` | `def` isEmpty : scala.Boolean Checks if the queue is empty.
`override` | `def` length : scala.Int Returns the length of this queue.
`abstract` | `def` self : scala.collection.mutable.Queue[A]

Def inherited from scala.collection.mutable.Queue[A]
++= , ++=, +=, clear, clone, dequeue, dequeueAll, dequeueFirst, enqueue, equals, extractFirst, front, hashCode, isEmpty, toString

Def inherited from scala.SeqProxy[A]
apply , copyToArray, drop, indexOf, isDefinedAt, lastIndexOf, length, self, subseq, take

Def Detail

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

  Adds all elements provided by an iterator at the end of the queue. The elements are prepended in the order they are given out by the iterator.

Parameters:
  `iter -` an iterator

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

  Adds all elements provided by an `Iterable` object at the end of the queue. The elements are prepended in the order they are given out by the iterator.

Parameters:
  `iter -` an iterable object

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

  Inserts a single element at the end of the queue.

Parameters:
  `elem -` the element to insert

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

  Access element number `n`.

Returns:
  the element at index `n`.

`override def` clear : scala.Unit

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

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

  This method clones the queue.

Returns:
  a queue with the same elements.

`override def` dequeue : A

  Returns the first element in the queue, and removes this element from the queue.

Returns:
  the first element of the queue.

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

  Returns an iterator over all elements on the queue.

Returns:
  an iterator over all queue elements.

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

  Adds all elements to the queue.

Parameters:
  `elems -` the elements to add.

`override def` front : A

  Returns the first element in the queue, or throws an error if there is no element contained in the queue.

Returns:
  the first element.

`override def` isEmpty : scala.Boolean

  Checks if the queue is empty.

Returns:
  true, iff there is no element in the queue.

`override def` length : scala.Int

  Returns the length of this queue.

`abstract def` self : scala.collection.mutable.Queue[A]