Scala Library Documentation
|
|
abstract
class
PriorityQueueProxy[A](implicit
view$1 : (A) => Ordered[A])
extends
PriorityQueue[A] with
SeqProxy[A]Ordered[T]
class.Values and Variables inherited from ResizableArray | |
initialSize, array |
Method Summary | |
override def
|
++=
(iter : Iterable[A]) : Unit
Adds all elements provided by an
Iterable object
into the priority queue. |
override def
|
++=
(it : Iterator[A]) : Unit
Adds all elements provided by an iterator into the priority queue.
|
override def
|
+=
(elem : A) : Unit
Inserts a single element into the priority queue.
|
override def
|
clear
: Unit
Removes all elements from the queue. After this operation is completed,
the queue will be empty.
|
override def
|
clone
: 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
|
drop
(from : Int) : RandomAccessSeq[A]
Returns this sequence without its
n first elements
If this sequence has less than n elements, the empty
sequence is returned. (non-strict) |
override def
|
elements
: Iterator[A]
Creates a new iterator over all elements contained in this
object.
|
override def
|
enqueue
(elems : A*) : Unit
Adds all elements to the queue.
|
override def
|
isEmpty
: Boolean
Checks if the queue is empty.
|
override def
|
length
: 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 : PriorityQueue[A] |
override def
|
slice
(from : Int, until : Int) : RandomAccessSeq[A]
A sub-sequence of
len elements
starting at index from (non-strict) |
override def
|
take
(until : Int) : RandomAccessSeq[A]
Returns a sequence consisting only over the first
n
elements of this sequence, or else the whole sequence, if it has less
than n elements. (non-strict) |
override def
|
toQueue
: Queue[A]
Returns a regular queue containing the same elements.
|
Methods inherited from SeqProxy | |
apply, concat, isDefinedAt, lastIndexOf, map, flatMap, filter, takeWhile, dropWhile, reverse, contains, toArray, copyToArray |
Methods inherited from IterableProxy | |
foreach, forall, exists, find, findIndexOf, indexOf, foldLeft, foldRight, /:, :\, reduceLeft, reduceRight, sameElements, copyToBuffer, toList, mkString, addString |
Methods inherited from Proxy | |
hashCode, equals, toString |
Methods inherited from PriorityQueue | |
fixUp, fixDown, +, +=, +, ++, ++ |
Methods inherited from ResizableArray | |
size0, size0_=, reduceToSize, ensureSize, swap, copy |
Methods inherited from RandomAccessSeq | |
projection, patch, ++, toStream, safeIs |
Methods inherited from Seq | |
lengthCompare, size, last, lastOption, headOption, subseq, equalsWith, startsWith, endsWith, indexOf, containsSlice |
Methods inherited from Collection | |
stringPrefix |
Methods inherited from Iterable | |
partition, mkString, mkString, addString, hasDefiniteSize |
Methods inherited from PartialFunction | |
orElse, andThen |
Methods inherited from Function1 | |
compose |
Methods inherited from AnyRef | |
getClass, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized |
Methods inherited from Any | |
==, !=, isInstanceOf, asInstanceOf |
Method Details |
abstract
def
self : PriorityQueue[A]
override
def
length : Int
override
def
isEmpty : Boolean
elem -
the element to insertIterable
object
into the priority queue.iter -
an iterable objectit -
an iteratorelems -
the elements to add.override
def
dequeue : A
override
def
max : A
override
def
clear : Unit
override
def
take(until : Int) : RandomAccessSeq[A]
n
elements of this sequence, or else the whole sequence, if it has less
than n
elements. (non-strict)n -
the number of elements to takeoverride
def
drop(from : Int) : RandomAccessSeq[A]
n
first elements
If this sequence has less than n
elements, the empty
sequence is returned. (non-strict)n -
the number of elements to dropoverride
def
slice(from : Int, until : Int) : RandomAccessSeq[A]
len
elements
starting at index from
(non-strict)from -
The index of the first element of the sliceuntil -
The index of the element following the sliceIndexOutOfBoundsException -
if from < 0
or length < from + len
override
def
clone : PriorityQueue[A]
Scala Library Documentation
|
|