|
|
Scala 2.3.3
|
abstract
class
PriorityQueueProxy
[A]
extends scala.collection.mutable.PriorityQueue[A]
with scala.SeqProxy[A]
with scala.ScalaObject
Ordered[T] class.| Constructor Summary | |
def
this
()(view$0: (A) => scala.Ordered[A])
|
|
| Def Summary | |
override
|
def
++=
(it: scala.Iterator[A])
: scala.Unit
Adds all elements provided by an iterator into the priority queue. |
override
|
def
++=
(iter: scala.Iterable[A])
: scala.Unit
Adds all elements provided by an Iterable object
into the priority queue.
|
override
|
def
+=
(elem: A)
: scala.Unit
Inserts a single element into the priority queue. |
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.PriorityQueue[A]
This method clones the priority queue. |
override
|
def
dequeue
: A
Returns the element with the highest priority in the queue, and removes this element from the queue. |
override
|
def
elements
: scala.Iterator[A]
Creates a new iterator over all elements contained in this object. |
override
|
def
enqueue
(elems: A*)
: scala.Unit
Adds all elements to the queue. |
override
|
def
isEmpty
: scala.Boolean
Checks if the queue is empty. |
override
|
def
length
: scala.Int
Returns the length of this priority queue. |
override
|
def
max
: A
Returns the element with the highest priority in the queue, or throws an error if there is no element contained in the queue. |
abstract
|
def
self
: scala.collection.mutable.PriorityQueue[A]
|
override
|
def
toQueue
: scala.collection.mutable.Queue[A]
Returns a regular queue containing the same elements. |
| Def inherited from scala.collection.mutable.PriorityQueue[A] | |
| + , +, ++, ++, ++=, ++=, +=, +=, clear, clone, dequeue, elements, enqueue, equals, fixDown, fixUp, hashCode, isEmpty, max, toQueue, toString |
| Def inherited from scala.SeqProxy[A] | |
| concat , contains, copyToArray, drop, dropWhile, filter, flatMap, isDefinedAt, isEmpty, lastIndexOf, length, map, reverse, self, slice, take, takeWhile, toArray |
| Constructor Detail |
| Def Detail |
override
def
++=
(it: scala.Iterator[A]): scala.Unit
it - an iterator
override
def
++=
(iter: scala.Iterable[A]): scala.Unit
Iterable object
into the priority queue.iter - an iterable object
override
def
+=
(elem: A): scala.Unit
elem - the element to insert
override
def
clear
: scala.Unit
override
def
clone
: scala.collection.mutable.PriorityQueue[A]
override
def
dequeue
: A
override
def
elements
: scala.Iterator[A]
override
def
enqueue
(elems: A*): scala.Unit
elems - the elements to add.
override
def
isEmpty
: scala.Boolean
override
def
length
: scala.Int
override
def
max
: A
abstract
def
self
: scala.collection.mutable.PriorityQueue[A]
override
def
toQueue
: scala.collection.mutable.Queue[A]