The type implementing this traversable
A class supporting filtered operations .
o != arg0
is the same as !(o == (arg0))
.
o != arg0
is the same as !(o == (arg0))
.
the object to compare against this object for dis-equality .
false
if the receiver object is equivalent to the argument; true
otherwise.
Add two or more elements to this set .
Add two or more elements to this set .
the first element .
Adds all elements provided by a TraversableOnce
object
into the priority queue.
Adds all elements provided by a TraversableOnce
object
into the priority queue.
a traversable object .
a new priority queue containing elements of both xs
and this
.
[use case] Concatenates this priority queue with the elements of a traversable collection .
Concatenates this priority queue with the elements of a traversable collection .
the traversable to append .
a new priority queue which contains all elements of this priority queue
followed by all elements of that
.
Concatenates this priority queue with the elements of a traversable collection .
Concatenates this priority queue with the elements of a traversable collection .
the element type of the returned collection .
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.
the traversable to append .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
which contains all elements of this priority queue
followed by all elements of that
.
Adds all elements provided by an iterator into the priority queue .
Adds all elements provided by an iterator into the priority queue .
an iterator@return the priority queue itself .
[use case] Prepends an element to this priority queue
Prepends an element to this priority queue
the prepended element
a new priority queue consisting of elem
followed
by all elements of this priority queue.
Prepends an element to this priority queue
Prepends an element to this priority queue
the element type of the returned priority queue .
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.
the prepended element
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
consisting of elem
followed
by all elements of this priority queue.
Inserts a single element into the priority queue .
Inserts a single element into the priority queue .
the element to insert@return this priority queue .
adds two or more elements to this priority queue .
adds two or more elements to this priority queue .
the first element to add .
the second element to add .
the remaining elements to add .
the priority queue itself
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
.
the result type of the binary operator .
the start value .
the binary operator .
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, x_{1}), x_{2}), ..., x_{n})
where x,,1,,, ..., x,,n,,
are the elements of this priority queue.
[use case] Appends an element to this priority queue
Appends an element to this priority queue
the appended element
a new priority queue consisting of
all elements of this priority queue followed by elem
.
Appends an element to this priority queue
Appends an element to this priority queue
the element type of the returned priority queue .
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.
the appended element
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
consisting of
all elements of this priority queue followed by elem
.
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
.
the result type of the binary operator .
the start value
the binary operator
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(x_{1}, op(x_{2}, ... op(x_{n}, z)...))
where x,,1,,, ..., x,,n,,
are the elements of this priority queue.
o == arg0
is the same as if (o eq null) arg0 eq null else o.equals(arg0)
.
o == arg0
is the same as if (o eq null) arg0 eq null else o.equals(arg0)
.
the object to compare against this object for equality .
true
if the receiver object is equivalent to the argument; false
otherwise.
o == arg0
is the same as o.equals(arg0)
.
o == arg0
is the same as o.equals(arg0)
.
the object to compare against this object for equality .
true
if the receiver object is equivalent to the argument; false
otherwise.
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.
the string builder to which elements are appended .
the string builder b
to which elements were appended.
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
.
the string builder to which elements are appended .
the separator string .
the string builder b
to which elements were appended.
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
.
the string builder to which elements are appended .
the starting string .
the separator string .
the ending string .
the string builder b
to which elements were appended.
Composes this partial function with a transformation function that gets applied to results of this partial function .
Composes this partial function with a transformation function that gets applied to results of this partial function .
the result type of the transformation function .
the transformation function
a partial function with the same domain as this partial function, which maps
arguments x
to k(this(x))
.
Selects an element by its index in the priority queue .
Selects an element by its index in the priority queue .
The index to select .
the element of this priority queue at index idx
, where 0
indicates the first element.
This method is used to cast the receiver object to be of type T0
.
This method is used to 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 expression1.asInstanceOf[String]
will throw a ClassCastException
at runtime, while the expressionList(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 typed.
the receiver object .
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 .
The object with which this priority queue should be compared
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.
Removes all elements from the queue .
Removes all elements from the queue . After this operation is completed, the queue will be empty.
This method clones the priority queue .
This method clones the priority queue .
a priority queue with the same elements .
[use case] Builds a new collection by applying a partial function to all elements of this priority queue on which the function is defined .
Builds a new collection by applying a partial function to all elements of this priority queue on which the function is defined .
the element type of the returned collection .
the partial function which filters and maps the priority queue .
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.
Builds a new collection by applying a partial function to all elements of this priority queue on which the function is defined .
Builds a new collection by applying a partial function to all elements of this priority queue on which the function is defined .
the element type of the returned collection .
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.
the partial function which filters and maps the priority queue .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
resulting from applying the partial function
pf
to each element on which it is defined and collecting the results.
The order of the elements is preserved.
The factory companion object that builds instances of class PriorityQueue .
The factory companion object that builds instances of class PriorityQueue .
(f compose g)(x) == f(g(x))
(f compose g)(x) == f(g(x))
Tests whether this priority queue contains a given value as an element .
Tests whether this priority queue contains a given value as an element .
the element to test .
true
if this priority queue has an element that is
is equal (wrt ==
) to elem
, false
otherwise.
Tests whether this priority queue contains a given sequence as a slice .
Tests whether this priority queue contains a given sequence as a slice .
the sequence to test
true
if this priority queue contains a slice with the same elements
as that
, otherwise false
.
[use case] Copies elements of this priority queue to an array .
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.
the array to fill .
the starting index .
the maximal number of elements to copy .
Copies elements of this priority queue to an array .
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.
the type of the elements of the array .
the array to fill .
the starting index .
the maximal number of elements to copy .
[use case] Copies values of this priority queue to an array .
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.
the array to fill .
Copies values of this priority queue to an array .
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.
the type of the elements of the array .
the array to fill .
[use case] Copies values of this priority queue to an array .
Copies values of this priority queue to an array.
Fills the given array xs
with values of this priority queue, after skipping start
values.
Copying will stop once either the end of the current priority queue is reached,
or the end of the array is reached.
the array to fill .
the starting index .
Copies values of this priority queue to an array .
Copies values of this priority queue to an array.
Fills the given array xs
with values of this priority queue, after skipping start
values.
Copying will stop once either the end of the current priority queue is reached,
or the end of the array is reached.
the type of the elements of the array .
the array to fill .
the starting index .
Copies all elements of this priority queue to a buffer .
Copies all elements of this priority queue to a buffer .
The buffer to which elements are copied .
Tests whether every element of this priority queue relates to the corresponding element of another sequence by satisfying a test predicate .
Tests whether every element of this priority queue relates to the corresponding element of another sequence by satisfying a test predicate .
the type of the elements of that
the other sequence
the test predicate, which relates elements from both sequences
true
if both sequences have the same length and
p(x, y)
is true
for all corresponding elements x
of this priority queue
and y
of that
, otherwise false
.
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 .
the predicate used to test elements .
the number of elements satisfying the predicate p
.
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 .
the element with the highest priority .
[use case] Computes the multiset difference between this priority queue and another sequence .
Computes the multiset difference between this priority queue and another sequence .
the sequence of elements to remove
a new priority queue which contains all elements of this priority queue
except some of occurrences of elements that also appear in that
.
If an element value x
appears
n times in that
, then the first n occurrences of x
will not form
part of the result, but any following occurrences will.
Computes the multiset difference between this priority queue and another sequence .
Computes the multiset difference between this priority queue and another sequence .
the element type of the returned priority queue .
the sequence of elements to remove
a new collection of type That
which contains all elements of this priority queue
except some of occurrences of elements that also appear in that
.
If an element value x
appears
n times in that
, then the first n occurrences of x
will not form
part of the result, but any following occurrences will.
Builds a new priority queue from this priority queue without any duplicate elements .
Builds a new priority queue from this priority queue without any duplicate elements .
A new priority queue which contains the first occurrence of every element of this priority queue .
Selects all elements except first n ones.
Selects all elements except first n ones.
the number of elements to drop from this priority queue .
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.
Selects all elements except last n ones.
Selects all elements except last n ones.
The number of elements to take
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.
Drops longest prefix of elements that satisfy a predicate .
Drops longest prefix of elements that satisfy a predicate .
The predicate used to test elements .
the longest suffix of this priority queue whose first element
does not satisfy the predicate p
.
use iterator' instead
Tests whether this priority queue ends with the given sequence .
Tests whether this priority queue ends with the given sequence .
the sequence to test
true
if this priority queue has that
as a suffix, false
otherwise.
Adds all elements to the queue .
Adds all elements to the queue .
the elements to add .
This method is used to test whether the argument (arg0
) is a reference to the
receiver object (this
).
This method is used to test whether the argument (arg0
) is a reference to the
receiver object (this
).
The eq
method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on
non-null instances of AnyRef
:
* It is reflexive: for any non-null instance x
of type AnyRef
, x.eq(x)
returns true
.
* It is symmetric: for any non-null instances x
and y
of type AnyRef
, x.eq(y)
returns true
if and
only if y.eq(x)
returns true
.
* It is transitive: for any non-null instances x
, y
, and z
of type AnyRef
if x.eq(y)
returns true
and y.eq(z)
returns true
, then x.eq(z)
returns true
.
Additionally, the eq
method has three other 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
).
the object to compare against this object for reference equality .
true
if the argument is a reference to the receiver object; false
otherwise.
This method is used to compare the receiver object (this
) with the argument object (arg0
) for equivalence.
This method is used to compare the receiver object (this
) with the argument object (arg0
) for equivalence.
The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation 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 often necessary to override hashCode
to ensure that objects
that are "equal" (o1.equals(o2)
returns true
) hash to the same
scala.Int
(o1.hashCode.equals(o2.hashCode)
).
true
if the receiver object is equivalent to the argument; false
otherwise.
Tests whether every element of this priority queue relates to the corresponding element of another sequence by satisfying a test predicate .
Tests whether every element of this priority queue relates to the corresponding element of another sequence by satisfying a test predicate .
the type of the elements of that
the other sequence
true
if both sequences have the same length and
p(x, y)
is true
for all corresponding elements x
of this priority queue
and y
of that
, otherwise false
.
use corresponds
instead
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 .
the predicate used to test elements .
true
if the given predicate p
holds for some of the elements
of this priority queue, otherwise false
.
Selects all elements of this priority queue which satisfy a predicate .
Selects all elements of this priority queue which satisfy a predicate .
the predicate used to test elements .
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.
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 .
the predicate used to test elements .
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.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .
The details of when and if the finalize
method are 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 .
Finds the first element of the priority queue satisfying a predicate, if any .
the predicate used to test elements .
an option value containing the first element in the priority queue
that satisfies p
, or None
if none exists.
Returns index of the first element satisfying a predicate, or -1
.
Returns index of the first element satisfying a predicate, or -1
.
Returns index of the last element satisfying a predicate, or -1 .
Returns index of the last element satisfying a predicate, or -1 .
use lastIndexWhere
instead
use head' instead
None
if iterable is empty.
[use case] Builds a new collection by applying a function to all elements of this priority queue and concatenating the results .
Builds a new collection by applying a function to all elements of this priority queue and concatenating the results .
the element type of the returned collection .
the function to apply to each element .
a new priority queue resulting from applying the given collection-valued function
f
to each element of this priority queue and concatenating the results.
Builds a new collection by applying a function to all elements of this priority queue and concatenating the results .
Builds a new collection by applying a function to all elements of this priority queue and concatenating the results .
the element type of the returned collection .
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.
the function to apply to each element .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
resulting from applying the given collection-valued function
f
to each element of this priority queue and concatenating the results.
[use case] Converts this priority queue of traversable collections into a priority queue in which all element collections are concatenated .
Converts this priority queue of traversable collections into a priority queue in which all element collections are concatenated .
the type of the elements of each traversable collection .
a new priority queue resulting from concatenating all element priority queues .
Converts this priority queue of traversable collections into a priority queue in which all element collections are concatenated .
Converts this priority queue of traversable collections into a priority queue in which all element collections are concatenated .
the type of the elements of each traversable collection .
an implicit conversion which asserts that the element type of this
priority queue is a Traversable
.
a new priority queue resulting from concatenating all element priority queues .
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 .
the result type of the binary operator .
the start value .
the binary operator .
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, x_{1}), x_{2}, ..., x_{n})
where x,,1,,, ..., x,,n,,
are the elements of this priority queue.
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 .
the result type of the binary operator .
the start value .
the binary operator .
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(x_{1}, op(x_{2}, ... op(x_{n}, z)...))
where x,,1,,, ..., x,,n,,
are the elements of this priority queue.
Tests whether a predicate holds for all elements of this priority queue .
Tests whether a predicate holds for all elements of this priority queue .
the predicate used to test elements .
true
if the given predicate p
holds for all elements
of this priority queue, otherwise false
.
[use case] Applies a function f
to all elements of this priority queue.
Applies a function f
to all elements of this priority queue.
the function that is applied for its side-effect to every element.
The result of function f
is discarded.
Applies a function f
to 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.
the type parameter describing the result of function f
.
This result will always be ignored. Typically U
is Unit
,
but this is not necessary.
the function that is applied for its side-effect to every element.
The result of function f
is discarded.
The generic builder that builds instances of PriorityQueue at arbitrary element types .
The generic builder that builds instances of PriorityQueue at arbitrary element types .
Returns a representation that corresponds to the dynamic class of the receiver object .
Returns a representation that corresponds to the dynamic class of the receiver object .
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object .
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.
the type of keys returned by the discriminator function .
the discriminator function .
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
.
Partitions elements in fixed size priority queues .
Partitions elements in fixed size priority queues .
the number of elements per group
An iterator producing priority queues of size size
, except the
last will be truncated if the elements don't divide evenly.
Iterator#grouped
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.
true
if this collection is known to have finite size, false
otherwise.
Returns a hash code value for the object .
Returns 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.
the hash code value for the object .
Selects the first element of this priority queue .
Selects the first element of this priority queue .
the first element of this priority queue .
Optionally selects the first element .
Optionally selects the first element .
the first element of this priority queue if it is nonempty, None
if it is empty.
[use case] Finds index of first occurrence of some value in this priority queue after or at some start index .
Finds index of first occurrence of some value in this priority queue after or at some start index .
the element value to search for .
the start index
the index >= from
of the first element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
Finds index of first occurrence of some value in this priority queue after or at some start index .
Finds index of first occurrence of some value in this priority queue after or at some start index .
the type of the element elem
.
the element value to search for .
the start index
the index >= from
of the first element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
[use case] Finds index of first occurrence of some value in this priority queue .
Finds index of first occurrence of some value in this priority queue .
the element value to search for .
the index of the first element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
Finds index of first occurrence of some value in this priority queue .
Finds index of first occurrence of some value in this priority queue .
the type of the element elem
.
the element value to search for .
the index of the first element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
Finds first index after or at a start index where this priority queue contains a given sequence as a slice .
Finds first index after or at a start index where this priority queue contains a given sequence as a slice .
the sequence to test
the start index
the first index >= from
such that the elements of this priority queue starting at this index
match the elements of sequence that
, or -1
of no such subsequence exists.
Finds first index where this priority queue contains a given sequence as a slice .
Finds first index where this priority queue contains a given sequence as a slice .
the sequence to test
the first index such that the elements of this priority queue starting at this index
match the elements of sequence that
, or -1
of no such subsequence exists.
Finds index of the first element satisfying some predicate after or at some start index .
Finds index of the first element satisfying some predicate after or at some start index .
the predicate used to test elements .
the start index
the index >= from
of the first element of this priority queue that satisfies the predicate p
,
or -1
, if none exists.
Finds index of first element satisfying some predicate .
Finds index of first element satisfying some predicate .
the predicate used to test elements .
the index of the first element of this priority queue that satisfies the predicate p
,
or -1
, if none exists.
Produces the range of all indices of this sequence .
Produces the range of all indices of this sequence .
a Range
value from 0
to one less than the length of this priority queue.
Selects all elements except the last .
Selects all elements except the last .
a priority queue consisting of all elements of this priority queue except the last one .
[use case] Computes the multiset intersection between this priority queue and another sequence .
Computes the multiset intersection between this priority queue and another sequence .
the sequence of elements to intersect with .
a new priority queue which contains all elements of this priority queue
which also appear in that
.
If an element value x
appears
n times in that
, then the first n occurrences of x
will be retained
in the result, but any following occurrences will be omitted.
Computes the multiset intersection between this priority queue and another sequence .
Computes the multiset intersection between this priority queue and another sequence .
the element type of the returned priority queue .
the sequence of elements to intersect with .
a new collection of type That
which contains all elements of this priority queue
which also appear in that
.
If an element value x
appears
n times in that
, then the first n occurrences of x
will be retained
in the result, but any following occurrences will be omitted.
Tests whether this priority queue contains given index .
Tests whether this priority queue contains given index .
The implementations of methods apply
and isDefinedAt
turn a Seq[A]
into
a PartialFunction[Int, A]
.
the index to test
true
if this priority queue contains an element at position idx
, false
otherwise.
Checks if the queue is empty .
Checks if the queue is empty .
true, iff there is no element in the queue .
This method is used to test whether the dynamic type of the receiver object is T0
.
This method is used to test whether the dynamic type of the receiver object is T0
.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.
true
if the receiver object is an instance of erasure of type T0
; false
otherwise.
Tests whether this priority queue can be repeatedly traversed .
Tests whether this priority queue can be repeatedly traversed .
true
Creates a new iterator over all elements contained in this object .
Creates a new iterator over all elements contained in this object .
the new iterator
Selects the last element .
Selects the last element .
the first element of this priority queue .
[use case] Finds index of last occurrence of some value in this priority queue before or at a given end index .
Finds index of last occurrence of some value in this priority queue before or at a given end index .
the element value to search for .
the end index .
the index <= end
of the last element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
Finds index of last occurrence of some value in this priority queue before or at a given end index .
Finds index of last occurrence of some value in this priority queue before or at a given end index .
the type of the element elem
.
the element value to search for .
the end index .
the index <= end
of the last element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
[use case] Finds index of last occurrence of some value in this priority queue .
Finds index of last occurrence of some value in this priority queue .
the element value to search for .
the index of the last element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
Finds index of last occurrence of some value in this priority queue .
Finds index of last occurrence of some value in this priority queue .
the type of the element elem
.
the element value to search for .
the index of the last element of this priority queue that is equal (wrt ==
)
to elem
, or -1
, if none exists.
Finds last index before or at a given end index where this priority queue contains a given sequence as a slice .
Finds last index before or at a given end index where this priority queue contains a given sequence as a slice .
the sequence to test
the end index
the last index <= end
such that the elements of this priority queue starting at this index
match the elements of sequence that
, or -1
of no such subsequence exists.
Finds last index where this priority queue contains a given sequence as a slice .
Finds last index where this priority queue contains a given sequence as a slice .
the sequence to test
the last index such that the elements of this priority queue starting a this index
match the elements of sequence that
, or -1
of no such subsequence exists.
Finds index of last element satisfying some predicate before or at given end index .
Finds index of last element satisfying some predicate before or at given end index .
the predicate used to test elements .
the index <= end
of the last element of this priority queue that satisfies the predicate p
,
or -1
, if none exists.
Finds index of last element satisfying some predicate .
Finds index of last element satisfying some predicate .
the predicate used to test elements .
the index of the last element of this priority queue that satisfies the predicate p
,
or -1
, if none exists.
Optionally selects the last element .
Optionally selects the last element .
the last element of this priority queue$ if it is nonempty, None
if it is empty.
Returns the length of this priority queue .
Returns the length of this priority queue . @return the number of elements in this priority queue.
Compares the length of this priority queue to a test value .
Compares the length of this priority queue to a test value .
the test value that gets compared with the length .
A value x
where
x < 0 if this.length < len
x == 0 if this.length == len
x > 0 if this.length > len
The method as implemented here does not call length
directly; its running time
is O(length min len)
instead of O(length)
. The method should be overwritten
if computing length
is cheap.
Turns this partial function into an plain function returning an Option
result.
Turns this partial function into an plain function returning an Option
result.
a function that takes an argument x
to Some(this(x))
if this
is defined for x
, and to None
otherwise.
[use case] Builds a new collection by applying a function to all elements of this priority queue .
Builds a new collection by applying a function to all elements of this priority queue .
the element type of the returned collection .
the function to apply to each element .
a new priority queue resulting from applying the given function
f
to each element of this priority queue and collecting the results.
Builds a new collection by applying a function to all elements of this priority queue .
Builds a new collection by applying a function to all elements of this priority queue .
the element type of the returned collection .
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.
the function to apply to each element .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
resulting from applying the given function
f
to each element of this priority queue and collecting the results.
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 .
the type of collection returned by f
.
the transformation function .
a new builder which is the same as the current builder except that a transformation function is applied to this builder's result .
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 .
the element with the highest priority .
[use case] Finds the largest element .
Finds the largest element .
the largest element of this priority queue .
Finds the largest element .
Finds the largest element .
The type over which the ordering is defined .
An ordering to be used for comparing elements .
the largest element of this priority queue with respect to the ordering cmp
.
[use case] Finds the smallest element .
Finds the smallest element .
the smallest element of this priority queue
Finds the smallest element .
Finds the smallest element .
The type over which the ordering is defined .
An ordering to be used for comparing elements .
the smallest element of this priority queue with respect to the ordering cmp
.
Displays all elements of this priority queue in a string .
Displays all elements of this priority queue in a string .
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.
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 .
the separator string .
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
.
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 .
the starting string .
the separator string .
the ending string .
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
.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
the object to compare against this object for reference dis-equality .
false
if the argument is not a reference to the receiver object; true
otherwise.
The builder that builds instances of type PriorityQueue[A]
The builder that builds instances of type PriorityQueue[A]
Tests whether the priority queue is not empty .
Tests whether the priority queue is not empty .
true
if the priority queue contains at least one element, false
otherwise.
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 .
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 .
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined .
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined .
the argument type of the fallback function
the result type of the fallback function
the fallback function
a partial function which has as domain the union of the domains
of this partial function and that
. The resulting partial function
takes x
to this(x)
where this
is defined, and to that(x)
where it is not.
[use case] Appends an element value to this priority queue until a given target length is reached .
Appends an element value to this priority queue until a given target length is reached .
the target length
the padding value
a new priority queue consisting of
all elements of this priority queue followed by the minimal number of occurrences of elem
so
that the resulting priority queue has a length of at least len
.
Appends an element value to this priority queue until a given target length is reached .
Appends an element value to this priority queue until a given target length is reached .
the element type of the returned priority queue .
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.
the target length
the padding value
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
consisting of
all elements of this priority queue followed by the minimal number of occurrences of elem
so
that the resulting collection has a length of at least len
.
Partitions this priority queue in two priority queues according to a predicate .
Partitions this priority queue in two priority queues according to a predicate .
the predicate on which to partition .
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.
[use case] Produces a new priority queue where a slice of elements in this priority queue is replaced by another sequence .
Produces a new priority queue where a slice of elements in this priority queue is replaced by another sequence .
the index of the first replaced element
the number of elements to drop in the original priority queue
a new priority queue consisting of all elements of this priority queue
except that replaced
elements starting from from
are replaced
by patch
.
Produces a new priority queue where a slice of elements in this priority queue is replaced by another sequence .
Produces a new priority queue where a slice of elements in this priority queue is replaced by another sequence .
the element type of the returned priority queue .
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.
the index of the first replaced element
the replacement sequence
the number of elements to drop in the original priority queue
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new priority queue consisting of all elements of this priority queue
except that replaced
elements starting from from
are replaced
by patch
.
Returns the length of the longest prefix whose elements all satisfy some predicate .
Returns the length of the longest prefix whose elements all satisfy some predicate .
the predicate used to test elements .
the length of the longest prefix of this priority queue
such that every element of the segment satisfies the predicate p
.
[use case] Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
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
.
Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
the result type of the *
operator.
an implicit parameter defining a set of numeric operations
which includes the *
operator to be used in forming the product.
the product of all elements of this priority queue with respect to the *
operator in num
.
returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection .
returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection .
use view' instead
Applies a binary operator to all elements of this priority queue, going left to right .
Applies a binary operator to all elements of this priority queue, going left to right .
the result type of the binary operator .
the binary operator .
the result of inserting op
between consecutive elements of this priority queue,
going left to right:
op(...(op(x_{1}, x_{2}), ... ) , x_{n})
where x,,1,,, ..., x,,n,,
are the elements of this priority queue.
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 .
the result type of the binary operator .
the binary operator .
an option value containing the result of reduceLeft(op)
is this priority queue is nonempty,
None
otherwise.
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 .
the result type of the binary operator .
the binary operator .
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,,1,,, ..., x,,n,,
are the elements of this priority queue.
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 .
the result type of the binary operator .
the binary operator .
an option value containing the result of reduceRight(op)
is this priority queue is nonempty,
None
otherwise.
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.
Produces a collection from the added elements .
Produces a collection from the added elements . The builder's contents are undefined after this operation.
a collection containing the elements added to this builder .
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.
A reversed priority queue .
An iterator yielding elements in reversed order .
An iterator yielding elements in reversed order .
Note: xs.reverseIterator
is the same as xs.reverse.iterator
but might be more efficient.
an iterator yielding the elements of this priority queue in reversed order
[use case] Builds a new collection by applying a function to all elements of this priority queue and collecting the results in reversed order .
Builds a new collection by applying a function to all elements of this priority queue and collecting the results in reversed order .
the element type of the returned collection .
Note: xs.reverseMap(f)
is the same as xs.reverse.map(f)
but might be more efficient.
the function to apply to each element .
a new priority queue resulting from applying the given function
f
to each element of this priority queue and collecting the results in reversed order.
Builds a new collection by applying a function to all elements of this priority queue and collecting the results in reversed order .
Builds a new collection by applying a function to all elements of this priority queue and collecting the results in reversed order .
Note: xs.reverseMap(f)
is the same as xs.reverse.map(f)
but might be more efficient.
the element type of the returned collection .
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.
the function to apply to each element .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
resulting from applying the given function
f
to each element of this priority queue and collecting the results in reversed order.
use reverseIterator' instead
[use case] Checks if the other iterable collection contains the same elements in the same order as this priority queue .
Checks if the other iterable collection contains the same elements in the same order as this priority queue .
the collection to compare with .
true
, if both collections contain the same elements in the same order, false
otherwise.
Checks if the other iterable collection contains the same elements in the same order as this priority queue .
Checks if the other iterable collection contains the same elements in the same order as this priority queue .
the type of the elements of collection that
.
the collection to compare with .
true
, if both collections contain the same elements in the same order, false
otherwise.
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 .
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
collection with intermediate results
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 type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
collection with intermediate results
Computes length of longest segment whose elements all satisfy some predicate .
Computes length of longest segment whose elements all satisfy some predicate .
the predicate used to test elements .
the index where the search starts .
the length of the longest segment of this priority queue starting from index from
such that every element of the segment satisfies the predicate p
.
The size of this priority queue, equivalent to length
.
The size of this priority queue, equivalent to length
.
the number of elements in this priority queue .
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.
the hint how many elements will be added .
Selects an interval of elements .
Selects an interval of elements .
Note: c.slice(from, to)
is equivalent to (but possibly more efficient than)
c.drop(from).take(to - from)
the index of the first returned element in this priority queue .
the index one past the last returned element in this priority queue .
a priority queue containing the elements starting at index from
and extending up to (but not including) index until
of this priority queue.
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 . )
the number of elements per group
An iterator producing priority queues of size size
, except the
last will be truncated if the elements don't divide evenly.
Iterator#sliding
Sorts this PriorityQueue according to the Ordering which results from transforming an implicitly given Ordering with a transformation function .
Sorts this PriorityQueue according to the Ordering which results from transforming an implicitly given Ordering with a transformation function .
the target type of the transformation f
, and the type where
the ordering ord
is defined.
the transformation function mapping elements
to some other domain B
.
the ordering assumed on domain B
.
a priority queue consisting of the elements of this priority queue
sorted according to the ordering where x < y
if
ord.lt(f(x), f(y))
.
scala . math.Ordering
Sorts this priority queue according to a comparison function .
Sorts this priority queue according to a comparison function .
The sort is stable. That is, elements that are equal wrt lt
appear in the
same order in the sorted sequence as in the original.
the comparison function which tests whether its first argument precedes its second argument in the desired ordering .
a priority queue consisting of the elements of this priority queue
sorted according to the comparison function lt
.
Sorts this priority queue according to an Ordering .
Sorts this priority queue according to an Ordering .
The sort is stable. That is, elements that are equal wrt lt
appear in the
same order in the sorted sequence as in the original.
the ordering to be used to compare elements .
a priority queue consisting of the elements of this priority queue
sorted according to the ordering ord
.
scala . math.Ordering
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.
the test predicate
a pair consisting of the longest prefix of this priority queue whose
elements all satisfy p
, and the rest of this priority queue.
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)
.
the position at which to split .
a pair of priority queues consisting of the first n
elements of this priority queue, and the other elements.
Tests whether this priority queue starts with the given sequence .
Tests whether this priority queue starts with the given sequence .
the sequence to test
true
if this collection has that
as a prefix, false
otherwise.
Tests whether this priority queue contains the given sequence at a given index .
Tests whether this priority queue contains the given sequence at a given index .
If the both the receiver object, this and the argument, that are infinite sequences this method may not terminate.
the sequence to test
the index where the sequence is searched .
true
if the sequence that
is contained in this priority queue at index offset
,
otherwise false
.
Defines the prefix of this object's toString
representation.
Defines the prefix of this object's toString
representation.
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.
[use case] Sums up the elements of this collection .
Sums up the elements of this collection .
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
.
Sums up the elements of this collection .
Sums up the elements of this collection .
the result type of the +
operator.
an implicit parameter defining a set of numeric operations
which includes the +
operator to be used in forming the sum.
the sum of all elements of this priority queue with respect to the +
operator in num
.
Selects all elements except the first .
Selects all elements except the first .
a priority queue consisting of all elements of this priority queue except the first one .
Selects first n elements.
Selects first n elements.
Tt number of elements to take from this priority queue .
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.
Selects last n elements.
Selects last n elements.
the number of elements to take
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.
Takes longest prefix of elements that satisfy a predicate .
Takes longest prefix of elements that satisfy a predicate .
The predicate used to test elements .
the longest prefix of this priority queue whose elements all satisfy
the predicate p
.
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.
[use case] Converts this priority queue to an array .
Converts this priority queue to an array .
an array containing all elements of this priority queue.
A ClassManifest
must be available for the element type of this priority queue.
Converts this priority queue to an array .
Converts this priority queue to an array .
the type of the elements of the array. A ClassManifest
for this type must
be available.
an array containing all elements of this priority queue .
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.
Converts this priority queue to an indexed sequence .
Converts this priority queue to an indexed sequence .
an indexed sequence containing all elements of this priority queue .
Converts this priority queue to an iterable collection .
Converts this priority queue to an iterable collection .
an Iterable
containing all elements of this priority queue.
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.
an Iterator containing all elements of this priority queue .
Converts this priority queue to a list .
Converts this priority queue to a list .
a list containing all elements of this priority queue .
Converts this priority queue to a map .
Converts this priority queue to a map . This method is unavailable unless the elements are members of Tuple2, each ((K, V)) 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.
a map containing all elements of this priority queue .
Returns a regular queue containing the same elements .
Returns a regular queue containing the same elements .
Converts this priority queue to a sequence .
Converts this priority queue to a sequence .
Overridden for efficiency.@return a sequence containing all elements of this priority queue.
Converts this priority queue to a set .
Converts this priority queue to a set .
a set containing all elements of this priority queue .
Converts this priority queue to a stream .
Converts this priority queue to a stream .
a stream containing all elements of this priority queue .
Returns a string representation of the object .
Returns a string representation of the object .
The default representation is platform dependent.
a string representation of the object .
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.
a Traversable containing all elements of this priority queue .
Transposes this priority queue of traversable collections into a priority queue of priority queues .
Transposes this priority queue of traversable collections into a priority queue of priority queues .
the type of the elements of each traversable collection .
an implicit conversion which asserts that the element type of this
priority queue is a Traversable
.
a two-dimensional priority queue of priority queues which has as nth row the nth column of this priority queue.
[use case] Produces a new sequence which contains all elements of this priority queue and also all elements of a given sequence .
Produces a new sequence which contains all elements of this priority queue and also all elements of
a given sequence. xs union ys
is equivalent to xs ++ ys
.
the sequence to add .
a new priority queue which contains all elements of this priority queue
followed by all elements of that
.
Produces a new sequence which contains all elements of this priority queue and also all elements of a given sequence .
Produces a new sequence which contains all elements of this priority queue and also all elements of
a given sequence. xs union ys
is equivalent to xs ++ ys
.
Another way to express this
is that xs union ys
computes the order-presevring multi-set union of xs
and ys
.
union
is hence a counter-part of diff
and intersect
which also work on multi-sets.
the element type of the returned priority queue .
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.
the sequence to add .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
which contains all elements of this priority queue
followed by all elements of that
.
Converts this priority queue of pairs into two collections of the first and second halfs of each pair .
Converts this priority queue of pairs into two collections of the first and second halfs of each pair .
an implicit conversion which asserts that the element type of this priority queue is a pair .
a pair priority queues, containing the first, respectively second half of each element pair of this priority queue .
Replaces element at given index with a new value .
Replaces element at given index with a new value .
[use case] A copy of this priority queue with one single replaced element .
A copy of this priority queue with one single replaced element .
the position of the replacement
the replacing element
a copy of this priority queue with the element at position index
replaced by elem
.
A copy of this priority queue with one single replaced element .
A copy of this priority queue with one single replaced element .
the element type of the returned priority queue .
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.
the position of the replacement
the replacing element
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new priority queue which is a copy of this priority queue with the element at position
index replaced by
elem.
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)
the index of the first element of the view
the index of the element following the view
a non-strict view of a slice of this priority queue, starting at index from
and extending up to (but not including) index until
.
Creates a non-strict view of this priority queue .
Creates a non-strict view of this priority queue .
a non-strict view of this priority queue .
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.
the predicate used to test elements .
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
.
[use case] Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs .
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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
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
.
Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs .
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.
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A
).
the type of the second half of the returned pairs
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 (A1, B)
being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]
.
is found.
The iterable providing the second half of each result pair
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type (A1, B)
.
a new collection of type That
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
.
[use case] Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs .
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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
the element to be used to fill up the result if this priority queue is shorter than that
.
the element to be used to fill up the result if that
is shorter than this priority queue.
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.
Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs .
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.
the iterable providing the second half of each result pair
the element to be used to fill up the result if this priority queue is shorter than that
.
the element to be used to fill up the result if that
is shorter than this priority queue.
a new collection of type That
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.
[use case] Zips this priority queue with its indices .
Zips this priority queue with its indices .
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))
Zips this priority queue with its indices .
Zips this priority queue with its indices .
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A
).
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 (A1, Int)
being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]
.
is found.
A new collection of type That
containing pairs consisting of all elements of this
priority queue paired with their index. Indices start at 0
.
This class servers as a proxy for priority queues. The elements of the queue have to be ordered in terms of the
Ordered[T]
class.version
1 . 0, 03/05/2004
since
1
authors:
Matthias Zenger