scala.collection.mutable.PriorityQueue

Instance Constructors

new PriorityQueue()(implicit ord: Ordering[A])

ord
implicit ordering used to compare the elements of type A.

Type Members

type Self = PriorityQueue[A]

The type implementing this traversable
The type implementing this traversable

Attributes
protected
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

A class supporting filtered operations.

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Test two objects for inequality.
Test two objects for inequality.
returns
true if !(this == that), false otherwise.

Definition Classes
Any
final def ##(): Int

Equivalent to x.hashCode except for boxed numeric types and null.
Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.
returns
a hash value consistent with ==

Definition Classes
AnyRef → Any
def ++(xs: GenTraversableOnce[A]): PriorityQueue[A]

Adds all elements provided by a TraversableOnce object into the priority queue.
Adds all elements provided by a TraversableOnce object into the priority queue.
xs
a traversable object.
returns
a new priority queue containing elements of both xs and this.
def ++[B](that: GenTraversableOnce[B]): PriorityQueue[B]

[use case]
[use case]
B
the element type of the returned collection.
that
the traversable to append.
returns
a new priority queue which contains all elements of this priority queue followed by all elements of that.

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That

As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.
Example:
```
    scala> val x = List(1)
    x: List[Int] = List(1)

    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
```
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.
Since TraversableOnce has no ++ method, we have to implement that directly, but Traversable and down can use the overload.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the traversable to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this priority queue followed by all elements of that.

Definition Classes
TraversableLike
def ++:[B](that: TraversableOnce[B]): PriorityQueue[B]

[use case]
[use case]
B
the element type of the returned collection.
that
the traversable to append.
returns
a new priority queue which contains all elements of this priority queue followed by all elements of that.

Definition Classes
TraversableLike
def ++=(xs: TraversableOnce[A]): PriorityQueue.this.type

adds all elements produced by a TraversableOnce to this priority queue.
adds all elements produced by a TraversableOnce to this priority queue.
returns
the priority queue itself.

Definition Classes
Growable
def +=(elem: A): PriorityQueue.this.type

Inserts a single element into the priority queue.
Inserts a single element into the priority queue.
elem
the element to insert.
returns
this priority queue.

Definition Classes
PriorityQueue → Builder → Growable
def +=(elem1: A, elem2: A, elems: A*): PriorityQueue.this.type

adds two or more elements to this priority queue.
adds two or more elements to this priority queue.
elem1
the first element to add.
elem2
the second element to add.
elems
the remaining elements to add.
returns
the priority queue itself

Definition Classes
Growable
def /:[B](z: B)(op: (B, A) ⇒ B): B

Applies a binary operator to a start value and all elements of this priority queue, going left to right.
Applies a binary operator to a start value and all elements of this priority queue, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
```
     scala> val a = LinkedList(1,2,3,4)
     a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

     scala> val b = (5 /: a)(_+_)
     b: Int = 15

     scala> val c = (5 /: a)((x,y) => x + y)
     c: Int = 15
```
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this priority queue, going left to right with the start value z on the left:
```
            op(...op(op(z, x1), x2), ..., xn)
```
where x₁, ..., x_n are the elements of this priority queue.
Definition Classes
TraversableOnce → GenTraversableOnce
def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

A syntactic sugar for out of order folding.
A syntactic sugar for out of order folding. See fold.
Example:
```
     scala> val a = LinkedList(1,2,3,4)
     a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

     scala> val b = (a /:\ 5)(_+_)
     b: Int = 15
```
Definition Classes
GenTraversableOnce
def :\[B](z: B)(op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this priority queue and a start value, going right to left.
Applies a binary operator to all elements of this priority queue and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
```
     scala> val a = LinkedList(1,2,3,4)
     a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

     scala> val b = (a :\ 5)(_+_)
     b: Int = 15

     scala> val c = (a :\ 5)((x,y) => x + y)
     c: Int = 15
```
B
the result type of the binary operator.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this priority queue, going right to left with the start value z on the right:
```
            op(x1, op(x2, ... op(xn, z)...))
```
where x₁, ..., x_n are the elements of this priority queue.
Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Test two objects for equality.
Test two objects for equality. The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
returns
true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
Any
def addString(b: StringBuilder): StringBuilder

Appends all elements of this priority queue to a string builder.
Appends all elements of this priority queue to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this priority queue without any separator string.
Example:
```
     scala> val a = LinkedList(1,2,3,4)
     a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

     scala> val b = new StringBuilder()
     b: StringBuilder =

     scala> val h = a.addString(b)
     b: StringBuilder = 1234
```
b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

Appends all elements of this priority queue to a string builder using a separator string.
Appends all elements of this priority queue to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this priority queue, separated by the string sep.
Example:
```
     scala> val a = LinkedList(1,2,3,4)
     a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

     scala> val b = new StringBuilder()
     b: StringBuilder =

     scala> a.addString(b, ", ")
     res0: StringBuilder = 1, 2, 3, 4
```
b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.

Definition Classes
TraversableOnce
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Appends all elements of this priority queue to a string builder using start, end, and separator strings.
Appends all elements of this priority queue to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this priority queue are separated by the string sep.
Example:
```
     scala> val a = LinkedList(1,2,3,4)
     a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

     scala> val b = new StringBuilder()
     b: StringBuilder =

     scala> a.addString(b, "LinkedList(", ", ", ")")
     res1: StringBuilder = LinkedList(1, 2, 3, 4)
```
b
the string builder to which elements are appended.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.

Definition Classes
TraversableOnce
def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked an arbitrary number of times.
For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.
```
   pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
```
Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).
B
the type of accumulated results
z
the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)
seqop
an operator used to accumulate results within a partition
combop
an associative operator used to combine results from different partitions

Definition Classes
TraversableOnce → GenTraversableOnce
final def asInstanceOf[T0]: T0

Cast the receiver object to be of type T0.
Cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.
returns
the receiver object.

Definition Classes
Any
Exceptions thrown
ClassCastException
if the receiver object is not an instance of the erasure of type T0.
def canEqual(that: Any): Boolean

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
that
The object with which this priority queue should be compared
returns
true, if this priority queue can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

Definition Classes
IterableLike → Equals
def clear(): Unit

Removes all elements from the queue.
Removes all elements from the queue. After this operation is completed, the queue will be empty.

Definition Classes
PriorityQueue → Builder → Growable
def clone(): PriorityQueue[A]

This method clones the priority queue.
This method clones the priority queue.
returns
a priority queue with the same elements.

Definition Classes
PriorityQueue → AnyRef
def collect[B](pf: PartialFunction[A, B]): PriorityQueue[B]

[use case]
[use case]
B
the element type of the returned collection.
pf
the partial function which filters and maps the priority queue.
returns
a new priority queue resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

Finds the first element of the priority queue for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the priority queue for which the given partial function is defined, and applies the partial function to it.
pf
the partial function
returns
an option value containing pf applied to the first value for which it is defined, or None if none exists.
Definition Classes
TraversableOnce
Example:
1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
def companion: GenericCompanion[Iterable]

The factory companion object that builds instances of class PriorityQueue.
The factory companion object that builds instances of class PriorityQueue. (or its Iterable superclass where class PriorityQueue is not a Seq.)

Definition Classes
Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
def copyToArray(xs: Array[A], start: Int, len: Int): Unit

[use case]
[use case]
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray(xs: Array[A]): Unit

[use case]
[use case]
xs
the array to fill.

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray(xs: Array[A], start: Int): Unit

[use case]
[use case]
xs
the array to fill.
start
the starting index.

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: A](dest: Buffer[B]): Unit

Copies all elements of this priority queue to a buffer.
Copies all elements of this priority queue to a buffer.
dest
The buffer to which elements are copied.

Definition Classes
TraversableOnce
def count(p: (A) ⇒ Boolean): Int

Counts the number of elements in the priority queue which satisfy a predicate.
Counts the number of elements in the priority queue which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

Definition Classes
TraversableOnce → GenTraversableOnce
def dequeue(): A

Returns the element with the highest priority in the queue, and removes this element from the queue.
Returns the element with the highest priority in the queue, and removes this element from the queue.
returns
the element with the highest priority.

Exceptions thrown
Predef.NoSuchElementException
def dequeueAll[A1 >: A, That](implicit bf: scala.collection.generic.CanBuildFrom[_$1,A1,That] forSome { type _$1 }): That
def drop(n: Int): PriorityQueue[A]

Selects all elements except first n ones.
Selects all elements except first n ones.
n
the number of elements to drop from this priority queue.
returns
a priority queue consisting of all elements of this priority queue except the first n ones, or else the empty priority queue, if this priority queue has less than n elements.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def dropRight(n: Int): PriorityQueue[A]

Selects all elements except last n ones.
Selects all elements except last n ones.
n
The number of elements to take
returns
a priority queue consisting of all elements of this priority queue except the last n ones, or else the empty priority queue, if this priority queue has less than n elements.

Definition Classes
IterableLike
def dropWhile(p: (A) ⇒ Boolean): PriorityQueue[A]

Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
p
The predicate used to test elements.
returns
the longest suffix of this priority queue whose first element does not satisfy the predicate p.

Definition Classes
TraversableLike → GenTraversableLike
def enqueue(elems: A*): Unit

Adds all elements to the queue.
Adds all elements to the queue.
elems
the elements to add.
final def eq(arg0: AnyRef): Boolean

Tests whether the argument (arg0) is a reference to the receiver object (this).
Tests whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:
- It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
- For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
- null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
returns
true if the argument is a reference to the receiver object; false otherwise.

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

The equality method for reference types.
The equality method for reference types. Default implementation delegates to eq.
See also equals in Any.
returns
true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
AnyRef → Any
def exists(p: (A) ⇒ Boolean): Boolean

Tests whether a predicate holds for some of the elements of this priority queue.
Tests whether a predicate holds for some of the elements of this priority queue.
p
the predicate used to test elements.
returns
true if the given predicate p holds for some of the elements of this priority queue, otherwise false.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def filter(p: (A) ⇒ Boolean): PriorityQueue[A]

Selects all elements of this priority queue which satisfy a predicate.
Selects all elements of this priority queue which satisfy a predicate.
p
the predicate used to test elements.
returns
a new priority queue consisting of all elements of this priority queue that satisfy the given predicate p. The order of the elements is preserved.

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (A) ⇒ Boolean): PriorityQueue[A]

Selects all elements of this priority queue which do not satisfy a predicate.
Selects all elements of this priority queue which do not satisfy a predicate.
p
the predicate used to test elements.
returns
a new priority queue consisting of all elements of this priority queue that do not satisfy the given predicate p. The order of the elements is preserved.

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
Note
not specified by SLS as a member of AnyRef
def find(p: (A) ⇒ Boolean): Option[A]

Finds the first element of the priority queue satisfying a predicate, if any.
Finds the first element of the priority queue satisfying a predicate, if any.
p
the predicate used to test elements.
returns
an option value containing the first element in the priority queue that satisfies p, or None if none exists.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def fixDown(as: Array[AnyRef], m: Int, n: Int): Unit

Attributes
protected
def fixUp(as: Array[AnyRef], m: Int): Unit

Attributes
protected
def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): PriorityQueue[B]

[use case]
[use case]
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new priority queue resulting from applying the given collection-valued function f to each element of this priority queue and concatenating the results.

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

Folds the elements of this priority queue using the specified associative binary operator.
Folds the elements of this priority queue using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A1
a type parameter for the binary operator, a supertype of A.
z
a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)
op
a binary operator that must be associative
returns
the result of applying fold operator op between all the elements and z

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

Applies a binary operator to a start value and all elements of this priority queue, going left to right.
Applies a binary operator to a start value and all elements of this priority queue, going left to right.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this priority queue, going left to right with the start value z on the left:
```
            op(...op(z, x1), x2, ..., xn)
```
where x₁, ..., x_n are the elements of this priority queue.
Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this priority queue and a start value, going right to left.
Applies a binary operator to all elements of this priority queue and a start value, going right to left.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this priority queue, going right to left with the start value z on the right:
```
            op(x1, op(x2, ... op(xn, z)...))
```
where x₁, ..., x_n are the elements of this priority queue.
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (A) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this priority queue.
Tests whether a predicate holds for all elements of this priority queue.
p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this priority queue, otherwise false.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foreach(f: (A) ⇒ Unit): Unit

[use case]
[use case]
f
the function that is applied for its side-effect to every element. The result of function f is discarded.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
def genericBuilder[B]: Builder[B, Iterable[B]]

The generic builder that builds instances of PriorityQueue at arbitrary element types.
The generic builder that builds instances of PriorityQueue at arbitrary element types.

Definition Classes
GenericTraversableTemplate
def genericOrderedBuilder[B](implicit ord: Ordering[B]): Builder[B, PriorityQueue[B]]

Definition Classes
GenericOrderedTraversableTemplate
final def getClass(): Class[_]

A representation that corresponds to the dynamic class of the receiver object.
A representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
returns
a representation that corresponds to the dynamic class of the receiver object.

Definition Classes
AnyRef → Any
Note
not specified by SLS as a member of AnyRef
def groupBy[K](f: (A) ⇒ K): Map[K, PriorityQueue[A]]

Partitions this priority queue into a map of priority queues according to some discriminator function.
Partitions this priority queue into a map of priority queues according to some discriminator function.
Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new priority queue.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to priority queues such that the following invariant holds:
```
                (xs partition f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a priority queue of those elements x for which f(x) equals k.
Definition Classes
TraversableLike → GenTraversableLike
def grouped(size: Int): Iterator[PriorityQueue[A]]

Partitions elements in fixed size priority queues.
Partitions elements in fixed size priority queues.
size
the number of elements per group
returns
An iterator producing priority queues of size size, except the last will be truncated if the elements don't divide evenly.

Definition Classes
IterableLike
See also
Iterator#grouped
def hasDefiniteSize: Boolean

Tests whether this priority queue is known to have a finite size.
Tests whether this priority queue is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.
Note: many collection methods will not work on collections of infinite sizes.
returns
true if this collection is known to have finite size, false otherwise.

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int

The hashCode method always yields an error, since it is not safe to use mutable queues as keys in hash tables.
The hashCode method always yields an error, since it is not safe to use mutable queues as keys in hash tables.
returns
never.

Definition Classes
PriorityQueue → AnyRef → Any
def head: A

Returns the element with the highest priority in the queue, or throws an error if there is no element contained in the queue.
Returns the element with the highest priority in the queue, or throws an error if there is no element contained in the queue.
returns
the element with the highest priority.

Definition Classes
PriorityQueue → IterableLike → GenIterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
def headOption: Option[A]

Optionally selects the first element.
Optionally selects the first element.
returns
the first element of this priority queue if it is nonempty, None if it is empty.

Definition Classes
TraversableLike
def init: PriorityQueue[A]

Selects all elements except the last.
Selects all elements except the last.
returns
a priority queue consisting of all elements of this priority queue except the last one.

Definition Classes
TraversableLike
Exceptions thrown
`UnsupportedOperationException`
if the priority queue is empty.
def inits: Iterator[PriorityQueue[A]]

Iterates over the inits of this priority queue.
Iterates over the inits of this priority queue. The first value will be this priority queue and the final one will be an empty priority queue, with the intervening values the results of successive applications of init.
returns
an iterator over all the inits of this priority queue
Definition Classes
TraversableLike
Example:
1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
def isEmpty: Boolean

Tests whether the priority queue is empty.
Tests whether the priority queue is empty.
returns
true if the priority queue contains no elements, false otherwise.

Definition Classes
PriorityQueue → IterableLike → GenIterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Test whether the dynamic type of the receiver object is T0.
Test whether the dynamic type of the receiver object is T0.
Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.

Definition Classes
Any
final def isTraversableAgain: Boolean

Tests whether this priority queue can be repeatedly traversed.
Tests whether this priority queue can be repeatedly traversed.
returns
true

Definition Classes
GenTraversableLike → GenTraversableOnce
def iterator: Iterator[A]

Returns an iterator which yields all the elements of the priority queue in descending priority order.
Returns an iterator which yields all the elements of the priority queue in descending priority order.
returns
an iterator over all elements sorted in descending order.

Definition Classes
PriorityQueue → IterableLike → GenIterableLike
def last: A

Selects the last element.
Selects the last element.
returns
The last element of this priority queue.

Definition Classes
TraversableLike
Exceptions thrown
NoSuchElementException
If the priority queue is empty.
def lastOption: Option[A]

Optionally selects the last element.
Optionally selects the last element.
returns
the last element of this priority queue$ if it is nonempty, None if it is empty.

Definition Classes
TraversableLike
def length: Int
def map[B](f: (A) ⇒ B): PriorityQueue[B]

[use case]
[use case]
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new priority queue resulting from applying the given function f to each element of this priority queue and collecting the results.

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def mapResult[NewTo](f: (PriorityQueue[A]) ⇒ NewTo): Builder[A, NewTo]

Creates a new builder by applying a transformation function to the results of this builder.
Creates a new builder by applying a transformation function to the results of this builder.
NewTo
the type of collection returned by f.
f
the transformation function.
returns
a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

Definition Classes
Builder
def max: A

[use case]
[use case]
returns
the largest element of this priority queue.

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def min: A

[use case]
[use case]
returns
the smallest element of this priority queue

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Displays all elements of this priority queue in a string.
Displays all elements of this priority queue in a string.
returns
a string representation of this priority queue. In the resulting string the string representations (w.r.t. the method toString) of all elements of this priority queue follow each other without any separator string.

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Displays all elements of this priority queue in a string using a separator string.
Displays all elements of this priority queue in a string using a separator string.
sep
the separator string.
returns
a string representation of this priority queue. In the resulting string the string representations (w.r.t. the method toString) of all elements of this priority queue are separated by the string sep.
Definition Classes
TraversableOnce → GenTraversableOnce
Example:
1. List(1, 2, 3).mkString("|") = "1|2|3"
def mkString(start: String, sep: String, end: String): String

Displays all elements of this priority queue in a string using start, end, and separator strings.
Displays all elements of this priority queue in a string using start, end, and separator strings.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
a string representation of this priority queue. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this priority queue are separated by the string sep.
Definition Classes
TraversableOnce → GenTraversableOnce
Example:
1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
final def ne(arg0: AnyRef): Boolean

Equivalent to !(this eq that).
Equivalent to !(this eq that).
returns
true if the argument is not a reference to the receiver object; false otherwise.

Definition Classes
AnyRef
def newBuilder: PriorityQueue[A]

The builder that builds instances of type PriorityQueue[A]
The builder that builds instances of type PriorityQueue[A]

Attributes
protected[this]
Definition Classes
PriorityQueue → GenericTraversableTemplate → TraversableLike → HasNewBuilder
def nonEmpty: Boolean

Tests whether the priority queue is not empty.
Tests whether the priority queue is not empty.
returns
true if the priority queue contains at least one element, false otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note
not specified by SLS as a member of AnyRef
final def notifyAll(): Unit

Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note
not specified by SLS as a member of AnyRef
implicit val ord: Ordering[A]

implicit ordering used to compare the elements of type A.
implicit ordering used to compare the elements of type A.

Definition Classes
PriorityQueue → GenericOrderedTraversableTemplate
def orderedCompanion: scala.collection.mutable.PriorityQueue.type

Definition Classes
PriorityQueue → GenericOrderedTraversableTemplate
def par: ParIterable[A]

Returns a parallel implementation of this collection.
Returns a parallel implementation of this collection.
For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.
Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.
All parallel collections return a reference to themselves.
returns
a parallel implementation of this collection

Definition Classes
Parallelizable
def parCombiner: Combiner[A, ParIterable[A]]

The default par implementation uses the combiner provided by this method to create a new parallel collection.
The default par implementation uses the combiner provided by this method to create a new parallel collection.
returns
a combiner for the parallel collection of type ParRepr

Attributes
protected[this]
Definition Classes
Iterable → TraversableLike → Parallelizable
def partition(p: (A) ⇒ Boolean): (PriorityQueue[A], PriorityQueue[A])

Partitions this priority queue in two priority queues according to a predicate.
Partitions this priority queue in two priority queues according to a predicate.
p
the predicate on which to partition.
returns
a pair of priority queues: the first priority queue consists of all elements that satisfy the predicate p and the second priority queue consists of all elements that don't. The relative order of the elements in the resulting priority queues is the same as in the original priority queue.

Definition Classes
TraversableLike → GenTraversableLike
def product: A

[use case]
[use case]
returns
the product of all elements in this priority queue of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the priority queue and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

Definition Classes
TraversableOnce → GenTraversableOnce
def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

Reduces the elements of this priority queue using the specified associative binary operator.
Reduces the elements of this priority queue using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A1
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
The result of applying reduce operator op between all the elements if the priority queue is nonempty.

Definition Classes
TraversableOnce → GenTraversableOnce
Exceptions thrown
UnsupportedOperationException
if this priority queue is empty.
def reduceLeft[B >: A](op: (B, A) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this priority queue, going left to right.
Optionally applies a binary operator to all elements of this priority queue, going left to right.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this priority queue is nonempty, None otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

Reduces the elements of this priority queue, if any, using the specified associative binary operator.
Reduces the elements of this priority queue, if any, using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A1
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: A](op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this priority queue, going right to left.
Applies a binary operator to all elements of this priority queue, going right to left.
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this priority queue, going right to left:
```
            op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
```
where x₁, ..., x_n are the elements of this priority queue.
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
Exceptions thrown
`UnsupportedOperationException`
if this priority queue is empty.
def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this priority queue, going right to left.
Optionally applies a binary operator to all elements of this priority queue, going right to left.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this priority queue is nonempty, None otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: PriorityQueue[A]

The collection of type priority queue underlying this TraversableLike object.
The collection of type priority queue underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

Definition Classes
PriorityQueue → TraversableLike → GenTraversableLike
def result(): PriorityQueue[A]

Produces a collection from the added elements.
Produces a collection from the added elements. The builder's contents are undefined after this operation.
returns
a collection containing the elements added to this builder.

Definition Classes
PriorityQueue → Builder
def reverse: PriorityQueue[A]

Returns the reverse of this queue.
Returns the reverse of this queue. The priority queue that gets returned will have an inversed ordering - if for some elements x and y the original queue's ordering had compare returning an integer w, the new one will return -w, assuming the original ordering abides its contract.
Note that the order of the elements will be reversed unless the compare method returns 0. In this case, such elements will be subsequent, but their corresponding subinterval may be inappropriately reversed. However, due to the compare-equals contract, they will also be equal.
returns
A reversed priority queue.
def reverseIterator: Iterator[A]
def reversed: List[A]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sameElements(that: GenIterable[A]): Boolean

[use case]
[use case]
that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.

Definition Classes
IterableLike → GenIterableLike
def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[PriorityQueue[A], B, That]): That

Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element z may be applied more than once.
B
element type of the resulting collection
That
type of the resulting collection
z
neutral element for the operator op
op
the associative operator for the scan
cbf
combiner factory which provides a combiner
returns
a new priority queue containing the prefix scan of the elements in this priority queue

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That

Produces a collection containing cummulative results of applying the operator going left to right.
Produces a collection containing cummulative results of applying the operator going left to right.
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That

Produces a collection containing cummulative results of applying the operator going right to left.
Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.
Example:
```
   List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
```
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
def seq: Iterable[A]

A version of this collection with all of the operations implemented sequentially (i.
A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).
This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.
returns
a sequential view of the collection.

Definition Classes
Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int

The size of this priority queue.
The size of this priority queue.
returns
the number of elements in this priority queue.

Definition Classes
PriorityQueue → GenTraversableLike → TraversableOnce → GenTraversableOnce
def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.
Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed to be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.
coll
the collection which serves as a hint for the result's size.
delta
a correction to add to the coll.size to produce the size hint.

Definition Classes
Builder
def sizeHint(size: Int): Unit

Gives a hint how many elements are expected to be added when the next result is called.
Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.
size
the hint how many elements will be added.

Definition Classes
Builder
def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.
Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.
size
the hint how many elements will be added.
boundingColl
the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

Definition Classes
Builder
def slice(from: Int, until: Int): PriorityQueue[A]

Selects an interval of elements.
Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:
```
   from <= indexOf(x) < until
```
from
the lowest index to include from this priority queue.
until
the highest index to EXCLUDE from this priority queue.
returns
a priority queue containing the elements greater than or equal to index from extending up to (but not including) index until of this priority queue.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def sliding(size: Int, step: Int): Iterator[PriorityQueue[A]]

Definition Classes
IterableLike
def sliding(size: Int): Iterator[PriorityQueue[A]]

Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
size
the number of elements per group
returns
An iterator producing priority queues of size size, except the last and the only element will be truncated if there are fewer elements than size.

Definition Classes
IterableLike
See also
Iterator#sliding
def span(p: (A) ⇒ Boolean): (PriorityQueue[A], PriorityQueue[A])

Splits this priority queue into a prefix/suffix pair according to a predicate.
Splits this priority queue into a prefix/suffix pair according to a predicate.
Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.
p
the test predicate
returns
a pair consisting of the longest prefix of this priority queue whose elements all satisfy p, and the rest of this priority queue.

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (PriorityQueue[A], PriorityQueue[A])

Splits this priority queue into two at a given position.
Splits this priority queue into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
n
the position at which to split.
returns
a pair of priority queues consisting of the first n elements of this priority queue, and the other elements.

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
returns
a string representation which starts the result of toString applied to this priority queue. By default the string prefix is the simple name of the collection class priority queue.

Definition Classes
TraversableLike → GenTraversableLike
def sum: A

[use case]
[use case]
returns
the sum of all elements in this priority queue of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the priority queue and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: PriorityQueue[A]

Selects all elements except the first.
Selects all elements except the first.
returns
a priority queue consisting of all elements of this priority queue except the first one.

Definition Classes
TraversableLike → GenTraversableLike
Exceptions thrown
`UnsupportedOperationException`
if the priority queue is empty.
def tails: Iterator[PriorityQueue[A]]

Iterates over the tails of this priority queue.
Iterates over the tails of this priority queue. The first value will be this priority queue and the final one will be an empty priority queue, with the intervening values the results of successive applications of tail.
returns
an iterator over all the tails of this priority queue
Definition Classes
TraversableLike
Example:
1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
def take(n: Int): PriorityQueue[A]

Selects first n elements.
Selects first n elements.
n
Tt number of elements to take from this priority queue.
returns
a priority queue consisting only of the first n elements of this priority queue, or else the whole priority queue, if it has less than n elements.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def takeRight(n: Int): PriorityQueue[A]

Selects last n elements.
Selects last n elements.
n
the number of elements to take
returns
a priority queue consisting only of the last n elements of this priority queue, or else the whole priority queue, if it has less than n elements.

Definition Classes
IterableLike
def takeWhile(p: (A) ⇒ Boolean): PriorityQueue[A]

Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate.
p
The predicate used to test elements.
returns
the longest prefix of this priority queue whose elements all satisfy the predicate p.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def thisCollection: Iterable[A]

The underlying collection seen as an instance of PriorityQueue.
The underlying collection seen as an instance of PriorityQueue. By default this is implemented as the current collection object itself, but this can be overridden.

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toArray: Array[A]

[use case]
[use case]
returns
an array containing all elements of this priority queue. A ClassManifest must be available for the element type of this priority queue.

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: A]: Buffer[B]

Converts this priority queue to a mutable buffer.
Converts this priority queue to a mutable buffer.
returns
a buffer containing all elements of this priority queue.

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: PriorityQueue[A]): Iterable[A]

A conversion from collections of type Repr to PriorityQueue objects.
A conversion from collections of type Repr to PriorityQueue objects. By default this is implemented as just a cast, but this can be overridden.

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toIndexedSeq: IndexedSeq[A]

Converts this priority queue to an indexed sequence.
Converts this priority queue to an indexed sequence.
returns
an indexed sequence containing all elements of this priority queue.

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[A]

Converts this priority queue to an iterable collection.
Converts this priority queue to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).
returns
an Iterable containing all elements of this priority queue.

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[A]

Returns an Iterator over the elements in this priority queue.
Returns an Iterator over the elements in this priority queue. Will return the same Iterator if this instance is already an Iterator.
returns
an Iterator containing all elements of this priority queue.

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toList: List[A]

Converts this priority queue to a list.
Converts this priority queue to a list.
returns
a list containing all elements of this priority queue.

Definition Classes
PriorityQueue → TraversableOnce → GenTraversableOnce
def toMap[T, U]: Map[T, U]

[use case]
[use case]
returns
a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this priority queue.

Definition Classes
TraversableOnce → GenTraversableOnce
def toQueue: Queue[A]

Returns a regular queue containing the same elements.
def toSeq: Seq[A]

Converts this priority queue to a sequence.
Converts this priority queue to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.
returns
a sequence containing all elements of this priority queue.

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: A]: Set[B]

Converts this priority queue to a set.
Converts this priority queue to a set.
returns
a set containing all elements of this priority queue.

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[A]

Converts this priority queue to a stream.
Converts this priority queue to a stream.
returns
a stream containing all elements of this priority queue.

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toString(): String

Returns a textual representation of a queue as a string.
Returns a textual representation of a queue as a string.
returns
the string representation of this queue.

Definition Classes
PriorityQueue → TraversableLike → AnyRef → Any
def toTraversable: Traversable[A]

Converts this priority queue to an unspecified Traversable.
Converts this priority queue to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
returns
a Traversable containing all elements of this priority queue.

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

Converts this priority queue of pairs into two collections of the first and second half of each pair.
Converts this priority queue of pairs into two collections of the first and second half of each pair.
asPair
an implicit conversion which asserts that the element type of this priority queue is a pair.
returns
a pair priority queues, containing the first, respectively second half of each element pair of this priority queue.

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

Converts this priority queue of triples into three collections of the first, second, and third element of each triple.
Converts this priority queue of triples into three collections of the first, second, and third element of each triple.
asTriple
an implicit conversion which asserts that the element type of this priority queue is a triple.
returns
a triple priority queues, containing the first, second, respectively third member of each element triple of this priority queue.

Definition Classes
GenericTraversableTemplate
def view(from: Int, until: Int): IterableView[A, PriorityQueue[A]]

Creates a non-strict view of a slice of this priority queue.
Creates a non-strict view of a slice of this priority queue.
Note: the difference between view and slice is that view produces a view of the current priority queue, whereas slice produces a new priority queue.
Note: view(from, to) is equivalent to view.slice(from, to)
from
the index of the first element of the view
until
the index of the element following the view
returns
a non-strict view of a slice of this priority queue, starting at index from and extending up to (but not including) index until.

Definition Classes
IterableLike → TraversableLike
def view: IterableView[A, PriorityQueue[A]]

Creates a non-strict view of this priority queue.
Creates a non-strict view of this priority queue.
returns
a non-strict view of this priority queue.

Definition Classes
IterableLike → TraversableLike
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws()
def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, PriorityQueue[A]]

Creates a non-strict filter of this priority queue.
Creates a non-strict filter of this priority queue.
Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
p
the predicate used to test elements.
returns
an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this priority queue which satisfy the predicate p.

Definition Classes
TraversableLike → FilterMonadic
def zip[B](that: GenIterable[B]): PriorityQueue[(A, B)]

[use case]
[use case]
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
returns
a new priority queue containing pairs consisting of corresponding elements of this priority queue and that. The length of the returned collection is the minimum of the lengths of this priority queue and that.

Definition Classes
IterableLike → GenIterableLike
def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): PriorityQueue[(A, B)]

[use case]
[use case]
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this priority queue is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this priority queue.
returns
a new priority queue containing pairs consisting of corresponding elements of this priority queue and that. The length of the returned collection is the maximum of the lengths of this priority queue and that. If this priority queue is shorter than that, thisElem values are used to pad the result. If that is shorter than this priority queue, thatElem values are used to pad the result.

Definition Classes
IterableLike → GenIterableLike
def zipWithIndex: PriorityQueue[(A, Int)]

[use case]
[use case]
returns
A new priority queue containing pairs consisting of all elements of this priority queue paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

Definition Classes
IterableLike → GenIterableLike

Deprecated Value Members

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.
Returns the element with the highest priority in the queue, or throws an error if there is no element contained in the queue.
returns
the element with the highest priority.

Annotations
@deprecated
Deprecated
(Since version 2.9.0) Use head instead.

PriorityQueue

class PriorityQueue[A] extends AbstractIterable[A] with Iterable[A] with GenericOrderedTraversableTemplate[A, PriorityQueue] with IterableLike[A, PriorityQueue[A]] with Growable[A] with Builder[A, PriorityQueue[A]] with Serializable

Instance Constructors

new PriorityQueue()(implicit ord: Ordering[A])

Type Members

type Self = PriorityQueue[A]

class WithFilter extends FilterMonadic[A, Repr]

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(xs: GenTraversableOnce[A]): PriorityQueue[A]

def ++[B](that: GenTraversableOnce[B]): PriorityQueue[B]

def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That

def ++:[B](that: TraversableOnce[B]): PriorityQueue[B]

def ++=(xs: TraversableOnce[A]): PriorityQueue.this.type

def +=(elem: A): PriorityQueue.this.type

def +=(elem1: A, elem2: A, elems: A*): PriorityQueue.this.type

def /:[B](z: B)(op: (B, A) ⇒ B): B

def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

def :\[B](z: B)(op: (A, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): PriorityQueue[A]

def collect[B](pf: PartialFunction[A, B]): PriorityQueue[B]

def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

def companion: GenericCompanion[Iterable]

def copyToArray(xs: Array[A], start: Int, len: Int): Unit

def copyToArray(xs: Array[A]): Unit

def copyToArray(xs: Array[A], start: Int): Unit

def copyToBuffer[B >: A](dest: Buffer[B]): Unit

def count(p: (A) ⇒ Boolean): Int

def dequeue(): A

def dequeueAll[A1 >: A, That](implicit bf: scala.collection.generic.CanBuildFrom[_$1,A1,That] forSome { type _$1 }): That

def drop(n: Int): PriorityQueue[A]

def dropRight(n: Int): PriorityQueue[A]

def dropWhile(p: (A) ⇒ Boolean): PriorityQueue[A]

def enqueue(elems: A*): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (A) ⇒ Boolean): Boolean

def filter(p: (A) ⇒ Boolean): PriorityQueue[A]

def filterNot(p: (A) ⇒ Boolean): PriorityQueue[A]

def finalize(): Unit

def find(p: (A) ⇒ Boolean): Option[A]

def fixDown(as: Array[AnyRef], m: Int, n: Int): Unit

def fixUp(as: Array[AnyRef], m: Int): Unit

def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): PriorityQueue[B]

def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

def foldRight[B](z: B)(op: (A, B) ⇒ B): B

def forall(p: (A) ⇒ Boolean): Boolean

def foreach(f: (A) ⇒ Unit): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

def genericOrderedBuilder[B](implicit ord: Ordering[B]): Builder[B, PriorityQueue[B]]

final def getClass(): Class[_]

def groupBy[K](f: (A) ⇒ K): Map[K, PriorityQueue[A]]

def grouped(size: Int): Iterator[PriorityQueue[A]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: A

def headOption: Option[A]

def init: PriorityQueue[A]

def inits: Iterator[PriorityQueue[A]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[A]

def last: A

def lastOption: Option[A]

def length: Int

def map[B](f: (A) ⇒ B): PriorityQueue[B]

def mapResult[NewTo](f: (PriorityQueue[A]) ⇒ NewTo): Builder[A, NewTo]