in scala/collection/mutable
class SynchronizedQueue

class SynchronizedQueue[A]()
extends Queue[A]
with ScalaObject

This is a synchronized version of the Queue[T] class. It implements a data structure that allows one to insert and retrieve elements in a first-in-first-out (FIFO) manner.
Author:
Matthias Zenger
Version:
1.0, 03/05/2004

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

isEmpty

  override def isEmpty: Boolean
Checks if the queue is empty.
Returns:
true, iff there is no element in the queue.

+=

  override def +=(elem: A): Unit
Inserts a single element at the end of the queue.
Parameters:
elem - the element to insert

++=

  override def ++=(iter: Iterable[A]): 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 ++=(it: Iterator[A]): 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:
it - an iterator

enqueue

  override def enqueue(elems: A*): Unit
Adds all elements to the queue.
Parameters:
elems - the elements to add.

dequeue

  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.

front

  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.

clear

  override def clear: Unit
Removes all elements from the queue. After this operation is completed, the queue will be empty.

equals

  override def equals(that: Any): Boolean
Checks if two queues are structurally identical.
Returns:
true, iff both queues contain the same sequence of elements.

hashCode

  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.
Returns:
never.

toString

  override def toString(): String
Returns a textual representation of a queue as a string.
Returns:
the string representation of this queue.