|
Scala
1.2.0.1 |
|||
Queue[T]
class. It
implements a data structure that allows one to insert and retrieve
elements in a first-in-first-out (FIFO) manner.
Method Summary | |
override
|
def ++=(iter: Iterable[A]): Unit
Adds all elements provided by an Iterable object
at the end of the queue.
|
override
|
def ++=(it: Iterator[A]): Unit
Adds all elements provided by an iterator at the end of the queue. |
override
|
def +=(elem: A): Unit
Inserts a single element at the end of the queue. |
override
|
def clear: Unit
Removes all elements from the queue. |
override
|
def dequeue: A
Returns the first element in the queue, and removes this element from the queue. |
override
|
def enqueue(elems: A*): Unit
Adds all elements to the queue. |
override
|
def equals(that: Any): Boolean
Checks if two queues are structurally identical. |
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 hashCode(): Int
The hashCode method always yields an error, since it is not safe to use mutable queues as keys in hash tables. |
override
|
def isEmpty: Boolean
Checks if the queue is empty. |
override
|
def toString(): String
Returns a textual representation of a queue as a string. |
Methods inherited from java/lang/Object-class |
eq, finalize, getClass, notify, notifyAll, synchronized, wait, wait, wait |
Methods inherited from scala/Any-class |
!=, ==, asInstanceOf, isInstanceOf, match |
Methods inherited from scala/Iterable-class |
/:, :\, exists, find, foldLeft, foldRight, forall, foreach, sameElements |
Methods inherited from scala/Seq-class |
copyToArray, drop, indexOf, isDefinedAt, lastIndexOf, subseq, take |
Methods inherited from scala/collection/mutable/MutableList-class |
appendElem, apply, elements, first, get, last, len, length, prependElem, reset, stringPrefix, toList |
Methods inherited from scala/collection/mutable/Queue-class |
clone, dequeueAll, dequeueFirst |
Method Detail |
override def isEmpty: Boolean
override def +=(elem: A): Unit
elem
-
the element to insert
override def ++=(iter: Iterable[A]): Unit
Iterable
object
at the end of the queue. The elements are prepended in the order they
are given out by the iterator.
iter
-
an iterable object
override def ++=(it: Iterator[A]): Unit
it
-
an iterator
override def enqueue(elems: A*): Unit
elems
-
the elements to add.
override def dequeue: A
override def front: A
override def clear: Unit
override def equals(that: Any): Boolean
override def hashCode(): Int
override def toString(): String
|
Scala
1.2.0.1 |
|||