|
Scala 2.1.7
|
class
QueueProxy
[ A ]
extends
scala.collection.mutable.Queue[A] with
scala.SeqProxy[A] with
scala.ScalaObjectQueue
objects implement data structures that allow to
insert and retrieve elements in a first-in-first-out (FIFO) manner.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. |
def
self
: scala.collection.mutable.Queue[A]
|
Def Detail |
def
++=
( it : scala.Iterator[A] ) : scala.Unit
def
++=
( iter : scala.Iterable[A] ) : scala.Unit
Iterable
object
at the end of the queue. The elements are prepended in the order they
are given out by the iterator.def
+=
( elem : A ) : scala.Unit
def
apply
( n : scala.Int ) : A
n
.n
.def
clear
: scala.Unit
def
clone
: scala.collection.mutable.Queue[A]
def
dequeue
: A
def
elements
: scala.Iterator[A]
def
enqueue
( elems : A* ) : scala.Unit
def
front
: A
def
isEmpty
: scala.Boolean
def
length
: scala.Int
def
self
: scala.collection.mutable.Queue[A]