PriorityQueueProxy

Test two objects for inequality.

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.

Adds all elements provided by a TraversableOnce object into the priority queue.

Returns a new priority queue containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the priority queue is the most specific superclass encompassing the element types of the two operands.

Example:

scala> val a = LinkedList(1)
a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

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

scala> val c = a ++ b
c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

scala> val d = LinkedList('a')
d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)

scala> val e = c ++ d
e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)

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.

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)

Adds all elements provided by an iterator into the priority queue.

Inserts a single element into the priority queue.

adds two or more elements to this priority queue.

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

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

Test two objects for equality. The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

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

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

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)

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).

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.

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

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

This method clones the priority queue.

Builds a new collection by applying a partial function to all elements of this priority queue on which the function is defined.

Finds the first element of the priority queue for which the given partial function is defined, and applies the partial function to it.

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

Copies elements of this priority queue to an array. Fills the given array xs with at most len elements of this priority queue, starting at position start. Copying will stop once either the end of the current priority queue is reached, or the end of the array is reached, or len elements have been copied.

Copies values of this priority queue to an array. Fills the given array xs with values of this priority queue. Copying will stop once either the end of the current priority queue is reached, or the end of the array is reached.

Copies values of this priority queue to an array. Fills the given array xs with values of this priority queue, beginning at index start. Copying will stop once either the end of the current priority queue is reached, or the end of the array is reached.

Copies all elements of this priority queue to a buffer.

Counts the number of elements in the priority queue which satisfy a predicate.

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

Selects all elements except first n ones.

Selects all elements except last n ones.

Drops longest prefix of elements that satisfy a predicate.

Adds all elements to the queue.

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).

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

• It is reflexive: for any instance x of type Any, x.equals(x) should return true.
• It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
• It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Tests whether a predicate holds for some of the elements of this priority queue.

Selects all elements of this priority queue which satisfy a predicate.

Selects all elements of this priority queue which do not satisfy a predicate.

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.

Finds the first element of the priority queue satisfying a predicate, if any.

Builds a new collection by applying a function to all elements of this priority queue and using the elements of the resulting collections.

For example:

def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

The type of the resulting collection is guided by the static type of priority queue. This might cause unexpected results sometimes. For example:

// lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

// lettersOf will return a Set[Char], not a Seq
def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)

// xs will be a an Iterable[Int]
val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)

// ys will be a Map[Int, Int]
val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)

Converts this priority queue of traversable collections into a priority queue formed by the elements of these traversable collections.

The resulting collection's type will be guided by the static type of priority queue. For example:

val xs = List(Set(1, 2, 3), Set(1, 2, 3))
// xs == List(1, 2, 3, 1, 2, 3)

val ys = Set(List(1, 2, 3), List(3, 2, 1))
// ys == Set(1, 2, 3)

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.

Applies a binary operator to a start value and all elements of this priority queue, going left to right.

Applies a binary operator to all elements of this priority queue and a start value, going right to left.

Tests whether a predicate holds for all elements of this priority queue.

Applies a function f to all elements of this priority queue.

Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

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

A representation that corresponds to the dynamic class of the receiver object.

The nature of the representation is platform dependent.

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.

Partitions elements in fixed size priority queues.

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.

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

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

Optionally selects the first element.

Selects all elements except the last.

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.

Checks if the queue is empty.

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.

Tests whether this priority queue can be repeatedly traversed.

Creates a new iterator over all elements contained in this object.

Selects the last element.

Optionally selects the last element.

Returns the length of this priority queue.

Builds a new collection by applying a function to all elements of this priority queue.

Creates a new builder by applying a transformation function to the results of this builder.

Finds the largest element.

Finds the smallest element.

Displays all elements of this priority queue in a 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 start, end, and separator strings.

Equivalent to !(this eq that).

The builder that builds instances of type PriorityQueue[A]

Tests whether the priority queue is not empty.

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

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

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.

The default par implementation uses the combiner provided by this method to create a new parallel collection.

Partitions this priority queue in two priority queues according to a predicate.

Multiplies up the elements of this collection.

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.

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.

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.

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.

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.

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

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 an iterator which yields all the elements in the reverse order than that returned by the method iterator.

Note: The order of elements returned is undefined.

Checks if the other iterable collection contains the same elements in the same order as this priority queue.

Computes a prefix scan of the elements of the collection.

Note: The neutral element z may be applied more than once.

Produces a collection containing cumulative results of applying the operator going left to right.

Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.

Example:

List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

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.

The size of this priority queue.

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.

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.

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.

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.

Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:

from <= indexOf(x) < until

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.)

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.

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).

Defines the prefix of this object's toString representation.

Sums up the elements of this collection.

Selects all elements except the first.

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.

Selects first n elements.

Selects last n elements.

Takes longest prefix of elements that satisfy a predicate.

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.

Converts this priority queue into another by copying all elements.

Converts this priority queue to an array.

Converts this priority queue to a mutable buffer.

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

Converts this priority queue to an indexed sequence.

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 Iterator over the elements in this priority queue. Will return the same Iterator if this instance is already an Iterator.

Converts this priority queue to a list.

Note: the order of elements is undefined.

Converts this priority queue to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

Returns a regular queue containing the same elements.

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.

Converts this priority queue to a set.

Converts this priority queue to a stream.

Returns a string representation of the object.

The default representation is platform dependent.

Converts this priority queue to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

Converts this priority queue to a Vector.

Transposes this priority queue of traversable collections into a priority queue of priority queues.

Converts this priority queue of pairs into two collections of the first and second half of each pair.

Converts this priority queue of triples into three collections of the first, second, and third element of each triple.

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)

Creates a non-strict view 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.

Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

Zips this priority queue with its indices.

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

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