scala.collection.mutable

PriorityQueueProxy

class PriorityQueueProxy [A] extends PriorityQueue[A] with Proxy

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.

attributes: abstract
linear super types: Proxy, PriorityQueue[A], Builder[A, PriorityQueue[A]], Cloneable[PriorityQueue[A]], Growable[A], Seq[A], Seq[A], SeqLike[A, PriorityQueue[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, PriorityQueue[A]], Equals, Traversable[A], Mutable, Traversable[A], GenericTraversableTemplate[A, Seq], TraversableLike[A, PriorityQueue[A]], TraversableOnce[A], FilterMonadic[A, PriorityQueue[A]], HasNewBuilder[A, PriorityQueue[A]], AnyRef, Any
source: PriorityQueueProxy.scala
    version
  1. 1.0, 03/05/2004

    since
  1. 1

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. PriorityQueueProxy
  2. Proxy
  3. PriorityQueue
  4. Builder
  5. Cloneable
  6. Growable
  7. Seq
  8. Seq
  9. SeqLike
  10. PartialFunction
  11. Function1
  12. Iterable
  13. Iterable
  14. IterableLike
  15. Equals
  16. Traversable
  17. Mutable
  18. Traversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. TraversableOnce
  22. FilterMonadic
  23. HasNewBuilder
  24. AnyRef
  25. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new PriorityQueueProxy ()(implicit ord: Ordering[A])

Type Members

  1. type Self = PriorityQueue[A]

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

  1. def != (arg0: AnyRef) : Boolean

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

    false if the receiver object is equivalent to the argument; true otherwise.

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def + (elem1: A, elem2: A, elems: A*) : PriorityQueue[A]

    Add two or more elements to this set.

    Add two or more elements to this set.

    elem1

    the first element.

    definition classes: PriorityQueue
      deprecated:
    1. "Use ++= instead if you intend to add by side effect to an existing collection.\012".+("Use clone() ++=' if you intend to create a new collection.")

  7. def + (elem: A) : PriorityQueue[A]

    definition classes: PriorityQueue
      deprecated:
    1. "Use += instead if you intend to add by side effect to an existing collection.\012".+("Use clone() +=' if you intend to create a new collection.")

  8. def ++ (xs: TraversableOnce[A]) : PriorityQueue[A]

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

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

    xs

    a traversable object.

    returns

    a new priority queue containing elements of both xs and this.

    definition classes: PriorityQueue
  9. def ++ (that: TraversableOnce[A]) : PriorityQueue[A]

    [use case] Concatenates this priority queue with the elements of a traversable collection.

    [use case]

    Concatenates this priority queue with the elements of a traversable collection.

    that

    the traversable to append.

    returns

    a new priority queue which contains all elements of this priority queue followed by all elements of that.

    attributes: abstract
    definition classes: TraversableLike
  10. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    Concatenates this priority queue with the elements of a traversable collection.

    Concatenates this priority queue with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which contains all elements of this priority queue followed by all elements of that.

    definition classes: TraversableLike
  11. def ++= (it: TraversableOnce[A]) : PriorityQueueProxy.this.type

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

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

    it

    an [email protected] the priority queue itself.

    definition classes: PriorityQueueProxyGrowable
  12. def +: (elem: A) : PriorityQueue[A]

    [use case] Prepends an element to this priority queue

    [use case]

    Prepends an element to this priority queue

    elem

    the prepended element

    returns

    a new priority queue consisting of elem followed by all elements of this priority queue.

    attributes: abstract
    definition classes: SeqLike
  13. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    Prepends an element to this priority queue

    Prepends an element to this priority queue

    B

    the element type of the returned priority queue.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    elem

    the prepended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of elem followed by all elements of this priority queue.

    definition classes: SeqLike
  14. def += (elem: A) : PriorityQueueProxy.this.type

    Inserts a single element into the priority queue.

    Inserts a single element into the priority queue.

    elem

    the element to [email protected] this priority queue.

    definition classes: PriorityQueueProxyPriorityQueueBuilderGrowable
  15. def += (elem1: A, elem2: A, elems: A*) : PriorityQueueProxy.this.type

    adds two or more elements to this priority queue.

    adds two or more elements to this priority queue.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the priority queue itself

    definition classes: Growable
  16. def /: [B] (z: B)(op: (B, A) ⇒ B) : B

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

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

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this priority queue, going left to right with the start value z on the left: op(...op(op(z, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    definition classes: TraversableOnce
  17. def :+ (elem: A) : PriorityQueue[A]

    [use case] Appends an element to this priority queue

    [use case]

    Appends an element to this priority queue

    elem

    the appended element

    returns

    a new priority queue consisting of all elements of this priority queue followed by elem.

    attributes: abstract
    definition classes: SeqLike
  18. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    Appends an element to this priority queue

    Appends an element to this priority queue

    B

    the element type of the returned priority queue.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    elem

    the appended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of all elements of this priority queue followed by elem.

    definition classes: SeqLike
  19. def :\ [B] (z: B)(op: (A, B) ⇒ B) : B

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

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

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this priority queue, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    definition classes: TraversableOnce
  20. def == (arg0: AnyRef) : Boolean

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

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: AnyRef
  21. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: Any
  22. def addString (b: StringBuilder) : StringBuilder

    Appends all elements of this priority queue to a string builder.

    Appends all elements of this priority queue to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this priority queue without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  23. def addString (b: StringBuilder, sep: String) : StringBuilder

    Appends all elements of this priority queue to a string builder using a separator string.

    Appends all elements of this priority queue to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this priority queue, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  24. def addString (b: StringBuilder, start: String, sep: String, end: String) : StringBuilder

    Appends all elements of this priority queue to a string builder using start, end, and separator strings.

    Appends all elements of this priority queue to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this priority queue are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  25. def andThen [C] (k: (A) ⇒ C) : PartialFunction[Int, C]

    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.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    definition classes: PartialFunctionFunction1
  26. def apply (idx: Int) : A

    Selects an element by its index in the priority queue.

    Selects an element by its index in the priority queue.

    idx

    The index to select.

    returns

    the element of this priority queue at index idx, where 0 indicates the first element.

    definition classes: PriorityQueueSeqLikeFunction1
  27. def asInstanceOf [T0] : T0

    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.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  28. def canEqual (that: Any) : Boolean

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

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

    that

    The object with which this priority queue should be compared

    returns

    true, if this priority queue can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  29. def clear () : Unit

    Removes all elements from the queue.

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

    definition classes: PriorityQueueProxyPriorityQueueBuilderGrowable
  30. def clone () : PriorityQueue[A]

    This method clones the priority queue.

    This method clones the priority queue.

    returns

    a priority queue with the same elements.

    definition classes: PriorityQueueProxyPriorityQueueCloneable → AnyRef
  31. def collect [B] (pf: PartialFunction[A, B]) : PriorityQueue[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the priority queue.

    returns

    a new priority queue resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    attributes: abstract
    definition classes: TraversableLike
  32. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    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.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the priority queue.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    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.

    definition classes: TraversableLike
  33. def companion : GenericCompanion[Seq]

    The factory companion object that builds instances of class PriorityQueue.

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

    definition classes: SeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  34. def compose [A] (g: (A) ⇒ Int) : (A) ⇒ A

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  35. def contains (elem: Any) : Boolean

    Tests whether this priority queue contains a given value as an element.

    Tests whether this priority queue contains a given value as an element.

    elem

    the element to test.

    returns

    true if this priority queue has an element that is is equal (wrt ==) to elem, false otherwise.

    definition classes: SeqLike
  36. def containsSlice [B] (that: Seq[B]) : Boolean

    Tests whether this priority queue contains a given sequence as a slice.

    Tests whether this priority queue contains a given sequence as a slice.

    that

    the sequence to test

    returns

    true if this priority queue contains a slice with the same elements as that, otherwise false.

    definition classes: SeqLike
  37. def copyToArray (xs: Array[A], start: Int, len: Int) : Unit

    [use case] Copies elements of this priority queue to an array.

    [use case]

    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.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    attributes: abstract
    definition classes: TraversableLike
  38. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  39. def copyToArray (xs: Array[A]) : Unit

    [use case] Copies values of this priority queue to an array.

    [use case]

    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.

    xs

    the array to fill.

    attributes: abstract
    definition classes: TraversableOnce
  40. def copyToArray [B >: A] (xs: Array[B]) : Unit

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableOnce
  41. def copyToArray (xs: Array[A], start: Int) : Unit

    [use case] Copies values of this priority queue to an array.

    [use case]

    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.

    xs

    the array to fill.

    start

    the starting index.

    attributes: abstract
    definition classes: TraversableOnce
  42. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableOnce
  43. def copyToBuffer [B >: A] (dest: Buffer[B]) : Unit

    Copies all elements of this priority queue to a buffer.

    Copies all elements of this priority queue to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableOnce
  44. def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean) : Boolean

    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.

    B

    the type of the elements of that

    that

    the other sequence

    p

    the test predicate, which relates elements from both sequences

    returns

    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.

    definition classes: SeqLike
  45. def count (p: (A) ⇒ Boolean) : Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableOnce
  46. def dequeue () : A

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

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

    returns

    the element with the highest priority.

    definition classes: PriorityQueueProxyPriorityQueue
  47. def diff (that: Seq[A]) : PriorityQueue[A]

    [use case] Computes the multiset difference between this priority queue and another sequence.

    [use case]

    Computes the multiset difference between this priority queue and another sequence.

    that

    the sequence of elements to remove

    returns

    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.

    attributes: abstract
    definition classes: SeqLike
  48. def diff [B >: A] (that: Seq[B]) : PriorityQueue[A]

    Computes the multiset difference between this priority queue and another sequence.

    Computes the multiset difference between this priority queue and another sequence.

    B

    the element type of the returned priority queue.

    that

    the sequence of elements to remove

    returns

    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.

    definition classes: SeqLike
  49. def distinct : PriorityQueue[A]

    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.

    returns

    A new priority queue which contains the first occurrence of every element of this priority queue.

    definition classes: SeqLike
  50. def drop (n: Int) : PriorityQueue[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this priority queue.

    returns

    a priority queue consisting of all elements of this priority queue except the first n ones, or else the empty priority queue, if this priority queue has less than n elements.

    definition classes: TraversableLike
  51. def dropRight (n: Int) : PriorityQueue[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

    a priority queue consisting of all elements of this priority queue except the first n ones, or else the empty priority queue, if this priority queue has less than n elements.

    definition classes: IterableLike
  52. def dropWhile (p: (A) ⇒ Boolean) : PriorityQueue[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this priority queue whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  53. def elements : Iterator[A]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  54. def endsWith [B] (that: Seq[B]) : Boolean

    Tests whether this priority queue ends with the given sequence.

    Tests whether this priority queue ends with the given sequence.

    that

    the sequence to test

    returns

    true if this priority queue has that as a suffix, false otherwise.

    definition classes: SeqLike
  55. def enqueue (elems: A*) : Unit

    Adds all elements to the queue.

    Adds all elements to the queue.

    elems

    the elements to add.

    definition classes: PriorityQueueProxyPriorityQueue
  56. def eq (arg0: AnyRef) : Boolean

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

    arg0

    the object to compare against this object for reference equality.

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    attributes: final
    definition classes: AnyRef
  57. def equals (that: Any) : Boolean

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

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: Proxy → AnyRef → Any
  58. def equalsWith [B] (that: Seq[B])(f: (A, B) ⇒ Boolean) : Boolean

    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.

    B

    the type of the elements of that

    that

    the other sequence

    returns

    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.

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

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

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

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this priority queue, otherwise false.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  60. def filter (p: (A) ⇒ Boolean) : PriorityQueue[A]

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

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

    p

    the predicate used to test elements.

    returns

    a new priority queue consisting of all elements of this priority queue that satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  61. def filterNot (p: (A) ⇒ Boolean) : PriorityQueue[A]

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

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

    p

    the predicate used to test elements.

    returns

    a new priority queue consisting of all elements of this priority queue that do not satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  62. def finalize () : Unit

    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 finalizeand non-local returns and exceptions, are all platform dependent.

    attributes: protected[lang]
    definition classes: AnyRef
  63. def find (p: (A) ⇒ Boolean) : Option[A]

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

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

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the priority queue that satisfies p, or None if none exists.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  64. def findIndexOf (p: (A) ⇒ Boolean) : Int

    Returns index of the first element satisfying a predicate, or -1.

    Returns index of the first element satisfying a predicate, or -1.

    definition classes: SeqLike
  65. def findLastIndexOf (p: (A) ⇒ Boolean) : Int

    Returns index of the last element satisfying a predicate, or -1.

    Returns index of the last element satisfying a predicate, or -1.

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  66. def first : A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  67. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

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

    attributes: protected
    definition classes: PriorityQueue
  69. def fixUp (as: Array[AnyRef], m: Int) : Unit

    attributes: protected
    definition classes: PriorityQueue
  70. def flatMap [B] (f: (A) ⇒ Traversable[B]) : PriorityQueue[B]

    [use case] Builds a new collection by applying a function to all elements of this priority queue and concatenating the results.

    [use case]

    Builds a new collection by applying a function to all elements of this priority queue and concatenating the results.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new priority queue resulting from applying the given collection-valued function f to each element of this priority queue and concatenating the results.

    attributes: abstract
    definition classes: TraversableLike
  71. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    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.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    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.

    definition classes: TraversableLikeFilterMonadic
  72. def flatten [B] : PriorityQueue[B]

    [use case] Converts this priority queue of traversable collections into a priority queue in which all element collections are concatenated.

    [use case]

    Converts this priority queue of traversable collections into a priority queue in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

    a new priority queue resulting from concatenating all element priority queues.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  73. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Seq[B]

    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.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this priority queue is a Traversable.

    returns

    a new priority queue resulting from concatenating all element priority queues.

    definition classes: GenericTraversableTemplate
  74. def foldLeft [B] (z: B)(op: (B, A) ⇒ B) : B

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this priority queue, going left to right with the start value z on the left: op(...op(z, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    definition classes: TraversableOnce
  75. def foldRight [B] (z: B)(op: (A, B) ⇒ B) : B

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this priority queue, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    definition classes: IterableLikeTraversableOnce
  76. def forall (p: (A) ⇒ Boolean) : Boolean

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

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this priority queue, otherwise false.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  77. def foreach (f: (A) ⇒ Unit) : Unit

    [use case] Applies a function f to all elements of this priority queue.

    [use case]

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

    f

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

    attributes: abstract
    definition classes: IterableLike
  78. def foreach [U] (f: (A) ⇒ U) : Unit

    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.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

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

  79. def genericBuilder [B] : Builder[B, Seq[B]]

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

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

    definition classes: GenericTraversableTemplate
  80. def getClass () : java.lang.Class[_ <: java.lang.Object]

    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.

    returns

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

    attributes: final
    definition classes: AnyRef
  81. def groupBy [K] (f: (A) ⇒ K) : Map[K, PriorityQueue[A]]

    Partitions this priority queue into a map of priority queues according to some discriminator function.

    Partitions this priority queue into a map of priority queues according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new priority queue.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to priority queues such that the following invariant holds: (xs partition f)(k) = xs filter (x => f(x) == k) That is, every key k is bound to a priority queue of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  82. def grouped (size: Int) : Iterator[PriorityQueue[A]]

    Partitions elements in fixed size priority queues.

    Partitions elements in fixed size priority queues.

    size

    the number of elements per group

    returns

    An iterator producing priority queues of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableLike
      see also:
    1. Iterator#grouped

  83. def hasDefiniteSize : Boolean

    Tests whether this priority queue is known to have a finite size.

    Tests whether this priority queue is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

    true if this collection is known to have finite size, false otherwise.

    definition classes: TraversableLikeTraversableOnce
  84. def hashCode () : Int

    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.

    returns

    the hash code value for the object.

    definition classes: Proxy → AnyRef → Any
  85. def head : A

    Selects the first element of this priority queue.

    Selects the first element of this priority queue.

    returns

    the first element of this priority queue.

    definition classes: IterableLikeTraversableLike
  86. def headOption : Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    definition classes: TraversableLike
  87. def indexOf (elem: A, from: Int) : Int

    [use case] Finds index of first occurrence of some value in this priority queue after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this priority queue after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  88. def indexOf [B >: A] (elem: B, from: Int) : Int

    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.

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  89. def indexOf (elem: A) : Int

    [use case] Finds index of first occurrence of some value in this priority queue.

    [use case]

    Finds index of first occurrence of some value in this priority queue.

    elem

    the element value to search for.

    returns

    the index of the first element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  90. def indexOf [B >: A] (elem: B) : Int

    Finds index of first occurrence of some value in this priority queue.

    Finds index of first occurrence of some value in this priority queue.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the first element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  91. def indexOfSlice [B >: A] (that: Seq[B], from: Int) : Int

    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.

    that

    the sequence to test

    from

    the start index

    returns

    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.

    definition classes: SeqLike
  92. def indexOfSlice [B >: A] (that: Seq[B]) : Int

    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.

    that

    the sequence to test

    returns

    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.

    definition classes: SeqLike
  93. def indexWhere (p: (A) ⇒ Boolean, from: Int) : Int

    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.

    p

    the predicate used to test elements.

    from

    the start index

    returns

    the index >= from of the first element of this priority queue that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  94. def indexWhere (p: (A) ⇒ Boolean) : Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the first element of this priority queue that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  95. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this priority queue.

    definition classes: SeqLike
  96. def init : PriorityQueue[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    definition classes: TraversableLike
  97. def intersect (that: Seq[A]) : PriorityQueue[A]

    [use case] Computes the multiset intersection between this priority queue and another sequence.

    [use case]

    Computes the multiset intersection between this priority queue and another sequence.

    that

    the sequence of elements to intersect with.

    returns

    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.

    attributes: abstract
    definition classes: SeqLike
  98. def intersect [B >: A] (that: Seq[B]) : PriorityQueue[A]

    Computes the multiset intersection between this priority queue and another sequence.

    Computes the multiset intersection between this priority queue and another sequence.

    B

    the element type of the returned priority queue.

    that

    the sequence of elements to intersect with.

    returns

    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.

    definition classes: SeqLike
  99. def isDefinedAt (idx: Int) : Boolean

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

    idx

    the index to test

    returns

    true if this priority queue contains an element at position idx, false otherwise.

    definition classes: SeqLike
  100. def isEmpty : Boolean

    Checks if the queue is empty.

    Checks if the queue is empty.

    returns

    true, iff there is no element in the queue.

  101. def isInstanceOf [T0] : Boolean

    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.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    attributes: final
    definition classes: Any
  102. def isTraversableAgain : Boolean

    Tests whether this priority queue can be repeatedly traversed.

    Tests whether this priority queue can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  103. def iterator : Iterator[A]

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

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

    returns

    the new iterator

    definition classes: PriorityQueueProxyPriorityQueueIterableLike
  104. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this priority queue.

    definition classes: TraversableLike
  105. def lastIndexOf (elem: A, end: Int) : Int

    [use case] Finds index of last occurrence of some value in this priority queue before or at a given end index.

    [use case]

    Finds index of last occurrence of some value in this priority queue before or at a given end index.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  106. def lastIndexOf [B >: A] (elem: B, end: Int) : Int

    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.

    B

    the type of the element elem.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  107. def lastIndexOf (elem: A) : Int

    [use case] Finds index of last occurrence of some value in this priority queue.

    [use case]

    Finds index of last occurrence of some value in this priority queue.

    elem

    the element value to search for.

    returns

    the index of the last element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  108. def lastIndexOf [B >: A] (elem: B) : Int

    Finds index of last occurrence of some value in this priority queue.

    Finds index of last occurrence of some value in this priority queue.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the last element of this priority queue that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  109. def lastIndexOfSlice [B >: A] (that: Seq[B], end: Int) : Int

    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.

    that

    the sequence to test

    end

    the end index

    returns

    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.

    definition classes: SeqLike
  110. def lastIndexOfSlice [B >: A] (that: Seq[B]) : Int

    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.

    that

    the sequence to test

    returns

    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.

    definition classes: SeqLike
  111. def lastIndexWhere (p: (A) ⇒ Boolean, end: Int) : Int

    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.

    p

    the predicate used to test elements.

    returns

    the index <= end of the last element of this priority queue that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  112. def lastIndexWhere (p: (A) ⇒ Boolean) : Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the last element of this priority queue that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  113. def lastOption : Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    definition classes: TraversableLike
  114. def length : Int

    Returns the length of this priority queue.

    Returns the length of this priority [email protected] the number of elements in this priority queue.

    definition classes: PriorityQueueProxyPriorityQueueSeqLike
  115. def lengthCompare (len: Int) : Int

    Compares the length of this priority queue to a test value.

    Compares the length of this priority queue to a test value.

    len

    the test value that gets compared with the length.

    returns

    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.

    definition classes: SeqLike
  116. def lift : (Int) ⇒ Option[A]

    Turns this partial function into an plain function returning an Option result.

    Turns this partial function into an plain function returning an Option result.

    returns

    a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.

    definition classes: PartialFunction
  117. def map [B] (f: (A) ⇒ B) : PriorityQueue[B]

    [use case] Builds a new collection by applying a function to all elements of this priority queue.

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new priority queue resulting from applying the given function f to each element of this priority queue and collecting the results.

    attributes: abstract
    definition classes: TraversableLike
  118. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    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.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this priority queue and collecting the results.

    definition classes: TraversableLikeFilterMonadic
  119. def mapResult [NewTo] (f: (PriorityQueue[A]) ⇒ NewTo) : Builder[A, NewTo]

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

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

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    definition classes: Builder
  120. def max : A

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

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

    returns

    the element with the highest priority.

    definition classes: PriorityQueueProxyPriorityQueue
  121. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this priority queue.

    attributes: abstract
    definition classes: TraversableOnce
  122. def max [B >: A] (implicit cmp: Ordering[B]) : A

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this priority queue with respect to the ordering cmp.

    definition classes: TraversableOnce
  123. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this priority queue

    attributes: abstract
    definition classes: TraversableOnce
  124. def min [B >: A] (implicit cmp: Ordering[B]) : A

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this priority queue with respect to the ordering cmp.

    definition classes: TraversableOnce
  125. def mkString : String

    Displays all elements of this priority queue in a string.

    Displays all elements of this priority queue in a string.

    returns

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

    definition classes: TraversableOnce
  126. def mkString (sep: String) : String

    Displays all elements of this priority queue in a string using a separator string.

    Displays all elements of this priority queue in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this priority queue. In the resulting string the string representations (w.r.t. the method toString) of all elements of this priority queue are separated by the string sep.

    definition classes: TraversableOnce
  127. def mkString (start: String, sep: String, end: String) : String

    Displays all elements of this priority queue in a string using start, end, and separator strings.

    Displays all elements of this priority queue in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this priority queue. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this priority queue are separated by the string sep.

    definition classes: TraversableOnce
  128. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  129. def newBuilder : PriorityQueue[A]

    The builder that builds instances of type PriorityQueue[A]

    The builder that builds instances of type PriorityQueue[A]

    attributes: protected[this]
  130. def nonEmpty : Boolean

    Tests whether the priority queue is not empty.

    Tests whether the priority queue is not empty.

    returns

    true if the priority queue contains at least one element, false otherwise.

    definition classes: TraversableOnce
  131. def notify () : Unit

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

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

    attributes: final
    definition classes: AnyRef
  132. def notifyAll () : Unit

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

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

    attributes: final
    definition classes: AnyRef
  133. def orElse [A1 <: A, B1 >: B] (that: PartialFunction[A1, B1]) : PartialFunction[A1, B1]

    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.

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    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.

    definition classes: PartialFunction
  134. def padTo (len: Int, elem: A) : PriorityQueue[A]

    [use case] Appends an element value to this priority queue until a given target length is reached.

    [use case]

    Appends an element value to this priority queue until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

    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.

    attributes: abstract
    definition classes: SeqLike
  135. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    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.

    B

    the element type of the returned priority queue.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    len

    the target length

    elem

    the padding value

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    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.

    definition classes: SeqLike
  136. def partition (p: (A) ⇒ Boolean) : (PriorityQueue[A], PriorityQueue[A])

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

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

    p

    the predicate on which to partition.

    returns

    a pair of priority queues: the first priority queue consists of all elements that satisfy the predicate p and the second priority queue consists of all elements that don't. The relative order of the elements in the resulting priority queues is the same as in the original priority queue.

    definition classes: TraversableLike
  137. def patch (from: Int, that: Seq[A], replaced: Int) : PriorityQueue[A]

    [use case] Produces a new priority queue where a slice of elements in this priority queue is replaced by another sequence.

    [use case]

    Produces a new priority queue where a slice of elements in this priority queue is replaced by another sequence.

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original priority queue

    returns

    a new priority queue consisting of all elements of this priority queue except that replaced elements starting from from are replaced by patch.

    attributes: abstract
    definition classes: SeqLike
  138. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    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.

    B

    the element type of the returned priority queue.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original priority queue

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new priority queue consisting of all elements of this priority queue except that replaced elements starting from from are replaced by patch.

    definition classes: SeqLike
  139. def prefixLength (p: (A) ⇒ Boolean) : Int

    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.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this priority queue such that every element of the segment satisfies the predicate p.

    definition classes: SeqLike
  140. def product : A

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    attributes: abstract
    definition classes: TraversableOnce
  141. def product [B >: A] (implicit num: Numeric[B]) : B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this priority queue with respect to the * operator in num.

    definition classes: TraversableOnce
  142. def projection : SeqView[A, PriorityQueue[A]]

    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.

    definition classes: SeqLikeIterableLike
      deprecated:
    1. use view' instead

  143. def reduceLeft [B >: A] (op: (B, A) ⇒ B) : B

    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.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this priority queue, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    definition classes: TraversableOnce
  144. def reduceLeftOption [B >: A] (op: (B, A) ⇒ B) : Option[B]

    Optionally applies a binary operator to all elements of this priority queue, going left to right.

    Optionally applies a binary operator to all elements of this priority queue, going left to right.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this priority queue is nonempty, None otherwise.

    definition classes: TraversableOnce
  145. def reduceRight [B >: A] (op: (A, B) ⇒ B) : B

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this priority queue, going right to left: op(x1, op(x2, ..., op(xn-1, xn)...)) where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    definition classes: IterableLikeTraversableOnce
  146. def reduceRightOption [B >: A] (op: (A, B) ⇒ B) : Option[B]

    Optionally applies a binary operator to all elements of this priority queue, going right to left.

    Optionally applies a binary operator to all elements of this priority queue, going right to left.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this priority queue is nonempty, None otherwise.

    definition classes: TraversableOnce
  147. def repr : PriorityQueue[A]

    The collection of type priority queue underlying this TraversableLike object.

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

    definition classes: PriorityQueueTraversableLike
  148. def result () : PriorityQueue[A]

    Produces a collection from the added elements.

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

    returns

    a collection containing the elements added to this builder.

    definition classes: PriorityQueueBuilder
  149. def reverse : PriorityQueue[A]

    Returns the reverse of this queue.

    Returns the reverse of this queue. The priority queue that gets returned will have an inversed ordering - if for some elements x and y the original queue's ordering had compare returning an integer w, the new one will return -w, assuming the original ordering abides its contract.

    Note that the order of the elements will be reversed unless the compare method returns 0. In this case, such elements will be subsequent, but their corresponding subinterval may be inappropriately reversed. However, due to the compare-equals contract, they will also be equal.

    returns

    A reversed priority queue.

    definition classes: PriorityQueueSeqLike
  150. def reverseIterator : Iterator[A]

    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.

    returns

    an iterator yielding the elements of this priority queue in reversed order

    definition classes: PriorityQueueSeqLike
  151. def reverseMap [B] (f: (A) ⇒ B) : PriorityQueue[B]

    [use case] Builds a new collection by applying a function to all elements of this priority queue and collecting the results 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.

    B

    the element type of the returned collection.

    Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    f

    the function to apply to each element.

    returns

    a new priority queue resulting from applying the given function f to each element of this priority queue and collecting the results in reversed order.

    attributes: abstract
    definition classes: SeqLike
  152. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    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.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    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.

    definition classes: SeqLike
  153. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  154. def reversedElements : Iterator[A]

    definition classes: SeqLike
      deprecated:
    1. use reverseIterator' instead

  155. def sameElements (that: Iterable[A]) : Boolean

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

    [use case]

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

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    attributes: abstract
    definition classes: IterableLike
  156. def sameElements [B >: A] (that: Iterable[B]) : Boolean

    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.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    definition classes: IterableLike
  157. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  158. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  159. def segmentLength (p: (A) ⇒ Boolean, from: Int) : Int

    Computes length of longest segment whose elements all satisfy some predicate.

    Computes length of longest segment whose elements all satisfy some predicate.

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

    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.

    definition classes: SeqLike
  160. def self : PriorityQueue[A]

    attributes: abstract
    definition classes: PriorityQueueProxyProxy
  161. def size : Int

    The size of this priority queue, equivalent to length.

    The size of this priority queue, equivalent to length.

    returns

    the number of elements in this priority queue.

    definition classes: PriorityQueueSeqLikeTraversableOnce
  162. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int =0) : Unit

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

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

    coll

    the collection which serves as a hint for the result's size.

    delta

    a correction to add to the coll.size to produce the size hint.

    definition classes: Builder
  163. def sizeHint (size: Int) : Unit

    Gives a hint how many elements are expected to be added when the next result is called.

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

    size

    the hint how many elements will be added.

    definition classes: Builder
  164. def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]) : Unit

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

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

    size

    the hint how many elements will be added.

    boundingColl

    the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

    definition classes: Builder
  165. def slice (from: Int, until: Int) : PriorityQueue[A]

    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)

    from

    the index of the first returned element in this priority queue.

    until

    the index one past the last returned element in this priority queue.

    returns

    a priority queue containing the elements starting at index from and extending up to (but not including) index until of this priority queue.

    definition classes: IterableLikeTraversableLike
  166. def sliding [B >: A] (size: Int, step: Int) : Iterator[PriorityQueue[A]]

    definition classes: IterableLike
  167. def sliding [B >: A] (size: Int) : Iterator[PriorityQueue[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

    An iterator producing priority queues of size size, except the last and the only element will be truncated if there are fewer elements than size.

    definition classes: IterableLike
      see also:
    1. Iterator#sliding

  168. def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]) : PriorityQueue[A]

    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.

    B

    the target type of the transformation f, and the type where the ordering ord is defined.

    f

    the transformation function mapping elements to some other domain B.

    ord

    the ordering assumed on domain B.

    returns

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

    definition classes: SeqLike
      see also:
    1. scala.math.Ordering

  169. def sortWith (lt: (A, A) ⇒ Boolean) : PriorityQueue[A]

    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.

    lt

    the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

    returns

    a priority queue consisting of the elements of this priority queue sorted according to the comparison function lt.

    definition classes: SeqLike
  170. def sorted [B >: A] (implicit ord: Ordering[B]) : PriorityQueue[A]

    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.

    ord

    the ordering to be used to compare elements.

    returns

    a priority queue consisting of the elements of this priority queue sorted according to the ordering ord.

    definition classes: SeqLike
      see also:
    1. scala.math.Ordering

  171. def span (p: (A) ⇒ Boolean) : (PriorityQueue[A], PriorityQueue[A])

    Splits this priority queue into a prefix/suffix pair according to a predicate.

    Splits this priority queue into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this priority queue whose elements all satisfy p, and the rest of this priority queue.

    definition classes: TraversableLike
  172. def splitAt (n: Int) : (PriorityQueue[A], PriorityQueue[A])

    Splits this priority queue into two at a given position.

    Splits this priority queue into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

    a pair of priority queues consisting of the first n elements of this priority queue, and the other elements.

    definition classes: TraversableLike
  173. def startsWith [B] (that: Seq[B]) : Boolean

    Tests whether this priority queue starts with the given sequence.

    Tests whether this priority queue starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise.

    definition classes: SeqLike
  174. def startsWith [B] (that: Seq[B], offset: Int) : Boolean

    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.

    that

    the sequence to test

    offset

    the index where the sequence is searched.

    returns

    true if the sequence that is contained in this priority queue at index offset, otherwise false.

    definition classes: SeqLike
  175. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

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

    definition classes: TraversableLike
  176. def sum : A

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

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

    attributes: abstract
    definition classes: TraversableOnce
  177. def sum [B >: A] (implicit num: Numeric[B]) : B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this priority queue with respect to the + operator in num.

    definition classes: TraversableOnce
  178. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  179. def tail : PriorityQueue[A]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

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

    definition classes: TraversableLike
  180. def take (n: Int) : PriorityQueue[A]

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this priority queue.

    returns

    a priority queue consisting only of the first n elements of this priority queue, or else the whole priority queue, if it has less than n elements.

    definition classes: IterableLikeTraversableLike
  181. def takeRight (n: Int) : PriorityQueue[A]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

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

    definition classes: IterableLike
  182. def takeWhile (p: (A) ⇒ Boolean) : PriorityQueue[A]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this priority queue whose elements all satisfy the predicate p.

    definition classes: IterableLikeTraversableLike
  183. def thisCollection : Seq[A]

    The underlying collection seen as an instance of PriorityQueue.

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

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  184. def toArray : Array[A]

    [use case] Converts this priority queue to an array.

    [use case]

    Converts this priority queue to an array.

    returns

    an array containing all elements of this priority queue. A ClassManifest must be available for the element type of this priority queue.

    attributes: abstract
    definition classes: TraversableOnce
  185. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this priority queue to an array.

    Converts this priority queue to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this priority queue.

    definition classes: TraversableOnce
  186. def toBuffer [B >: A] : Buffer[B]

    Converts this priority queue to a mutable buffer.

    Converts this priority queue to a mutable buffer.

    returns

    a buffer containing all elements of this priority queue.

    definition classes: TraversableOnce
  187. def toCollection (repr: PriorityQueue[A]) : Seq[A]

    A conversion from collections of type Repr to PriorityQueue objects.

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

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  188. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this priority queue to an indexed sequence.

    Converts this priority queue to an indexed sequence.

    returns

    an indexed sequence containing all elements of this priority queue.

    definition classes: TraversableOnce
  189. def toIterable : Iterable[A]

    Converts this priority queue to an iterable collection.

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

    returns

    an Iterable containing all elements of this priority queue.

    definition classes: IterableLikeTraversableOnce
  190. def toIterator : Iterator[A]

    Returns an Iterator over the elements in this priority queue.

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

    returns

    an Iterator containing all elements of this priority queue.

    definition classes: TraversableLikeTraversableOnce
  191. def toList : List[A]

    Converts this priority queue to a list.

    Converts this priority queue to a list.

    returns

    a list containing all elements of this priority queue.

    definition classes: PriorityQueueTraversableOnce
  192. def toMap [T, U] (implicit ev: <:<[A, (T, U)]) : Map[T, U]

    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.

    returns

    a map containing all elements of this priority queue.

    definition classes: TraversableOnce
  193. def toQueue : Queue[A]

    Returns a regular queue containing the same elements.

    Returns a regular queue containing the same elements.

    definition classes: PriorityQueueProxyPriorityQueue
  194. def toSeq : Seq[A]

    Converts this priority queue to a sequence.

    Converts this priority queue to a sequence.

    Overridden for [email protected] a sequence containing all the elements of this priority queue.

    definition classes: SeqLikeIterableLikeTraversableOnce
  195. def toSet [B >: A] : Set[B]

    Converts this priority queue to a set.

    Converts this priority queue to a set.

    returns

    a set containing all elements of this priority queue.

    definition classes: TraversableOnce
  196. def toStream : Stream[A]

    Converts this priority queue to a stream.

    Converts this priority queue to a stream.

    returns

    a stream containing all elements of this priority queue.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  197. def toString () : String

    Returns a string representation of the object.

    Returns a string representation of the object.

    The default representation is platform dependent.

    returns

    a string representation of the object.

    definition classes: Proxy → AnyRef → Any
  198. def toTraversable : Traversable[A]

    Converts this priority queue to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this priority queue.

    definition classes: TraversableLikeTraversableOnce
  199. def transpose [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Seq[Seq[B]]

    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.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this priority queue is a Traversable.

    returns

    a two-dimensional priority queue of priority queues which has as nth row the nth column of this priority queue.

    definition classes: GenericTraversableTemplate
  200. def union (that: Seq[A]) : PriorityQueue[A]

    [use case] Produces a new sequence which contains all elements of this priority queue and also all elements of a given sequence.

    [use case]

    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.

    that

    the sequence to add.

    returns

    a new priority queue which contains all elements of this priority queue followed by all elements of that.

    attributes: abstract
    definition classes: SeqLike
  201. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : 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.

    B

    the element type of the returned priority queue.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the sequence to add.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which contains all elements of this priority queue followed by all elements of that.

    definition classes: SeqLike
  202. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)) : (Seq[A1], Seq[A2])

    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.

    asPair

    an implicit conversion which asserts that the element type of this priority queue is a pair.

    returns

    a pair priority queues, containing the first, respectively second half of each element pair of this priority queue.

    definition classes: GenericTraversableTemplate
  203. def update (idx: Int, elem: A) : Unit

    Replaces element at given index with a new value.

    Replaces element at given index with a new value.

    definition classes: PriorityQueueSeq
  204. def updated (index: Int, elem: A) : PriorityQueue[A]

    [use case] A copy of this priority queue with one single replaced element.

    [use case]

    A copy of this priority queue with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this priority queue with the element at position index replaced by elem.

    attributes: abstract
    definition classes: SeqLike
  205. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]) : That

    A copy of this priority queue with one single replaced element.

    A copy of this priority queue with one single replaced element.

    B

    the element type of the returned priority queue.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    index

    the position of the replacement

    elem

    the replacing element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new priority queue which is a copy of this priority queue with the element at position index replaced by elem.

    definition classes: SeqLike
  206. def view (from: Int, until: Int) : SeqView[A, PriorityQueue[A]]

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

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

    Note: the difference between view and slice is that view produces a view of the current priority queue, whereas slice produces a new priority queue.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this priority queue, starting at index from and extending up to (but not including) index until.

    definition classes: SeqLikeIterableLikeTraversableLike
  207. def view : SeqView[A, PriorityQueue[A]]

    Creates a non-strict view of this priority queue.

    Creates a non-strict view of this priority queue.

    returns

    a non-strict view of this priority queue.

    definition classes: SeqLikeIterableLikeTraversableLike
  208. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  209. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  210. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  211. def withFilter (p: (A) ⇒ Boolean) : FilterMonadic[A, PriorityQueue[A]]

    Creates a non-strict filter of this priority queue.

    Creates a non-strict filter of this priority queue.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this priority queue which satisfy the predicate p.

    definition classes: TraversableLikeFilterMonadic
  212. def zip [B] (that: Iterable[B]) : PriorityQueue[(A, B)]

    [use case] Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs.

    [use case]

    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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new priority queue containing pairs consisting of corresponding elements of this priority queue and that. The length of the returned collection is the minimum of the lengths of this priority queue and that.

    attributes: abstract
    definition classes: IterableLike
  213. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], (A1, B), That]) : 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.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

    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.

    definition classes: IterableLike
  214. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B) : PriorityQueue[(A, B)]

    [use case] Returns a priority queue formed from this priority queue and another iterable collection by combining corresponding elements in pairs.

    [use case]

    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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this priority queue is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this priority queue.

    returns

    a new priority queue containing pairs consisting of corresponding elements of this priority queue and that. The length of the returned collection is the maximum of the lengths of this priority queue and that. If this priority queue is shorter than that, thisElem values are used to pad the result. If that is shorter than this priority queue, thatElem values are used to pad the result.

    attributes: abstract
    definition classes: IterableLike
  215. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[PriorityQueue[A], (A1, B), That]) : 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 shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this priority queue is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this priority queue.

    returns

    a new 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.

    definition classes: IterableLike
  216. def zipWithIndex : PriorityQueue[(A, Int)]

    [use case] Zips this priority queue with its indices.

    [use case]

    Zips this priority queue with its indices.

    returns

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

    attributes: abstract
    definition classes: IterableLike
  217. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[PriorityQueue[A], (A1, Int), That]) : That

    Zips this priority queue with its indices.

    Zips this priority queue with its indices.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

    A new collection of type That containing pairs consisting of all elements of this priority queue paired with their index. Indices start at 0.

    definition classes: IterableLike

Inherited from Proxy

Inherited from PriorityQueue[A]

Inherited from Builder[A, PriorityQueue[A]]

Inherited from Cloneable[PriorityQueue[A]]

Inherited from Growable[A]

Inherited from Seq[A]

Inherited from Seq[A]

Inherited from SeqLike[A, PriorityQueue[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, PriorityQueue[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, Seq]

Inherited from TraversableLike[A, PriorityQueue[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, PriorityQueue[A]]

Inherited from HasNewBuilder[A, PriorityQueue[A]]

Inherited from AnyRef

Inherited from Any