scala.collection.mutable

PriorityQueue

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

This class implements priority queues using a heap. To prioritize elements of type A there must be an implicit Ordering[A] available at creation.

A

type of the elements in this priority queue.

Annotations
@cloneable()
Source
PriorityQueue.scala
Version

1.0, 03/05/2004

Since

1

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. PriorityQueue
  2. Serializable
  3. Serializable
  4. Builder
  5. Growable
  6. GenericOrderedTraversableTemplate
  7. Iterable
  8. Iterable
  9. IterableLike
  10. Equals
  11. GenIterable
  12. GenIterableLike
  13. Traversable
  14. Mutable
  15. Traversable
  16. GenTraversable
  17. GenericTraversableTemplate
  18. TraversableLike
  19. GenTraversableLike
  20. Parallelizable
  21. TraversableOnce
  22. GenTraversableOnce
  23. FilterMonadic
  24. HasNewBuilder
  25. AnyRef
  26. Any
Visibility
  1. Public
  2. All

Instance Constructors

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

    ord

    implicit ordering used to compare the elements of type 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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

    true if !(this == that), false otherwise.

    Attributes
    final
    Definition Classes
    Any
  3. def ## (): Int

    Equivalent to x.hashCode except for boxed numeric types.

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

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def ++ (xs: TraversableOnce[A]): PriorityQueue[A]

    Annotations
    @bridge()
  5. def ++ (xs: GenTraversableOnce[A]): PriorityQueue[A]

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

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

    xs

    a traversable object.

    returns

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

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

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  7. def ++ [B] (that: GenTraversableOnce[B]): PriorityQueue[B]

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

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  8. def ++ [B >: A, That] (that: GenTraversableOnce[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 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
    TraversableLikeGenTraversableLike
  9. def ++: [B >: A, That] (that: Traversable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.

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

    [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. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Attributes
    abstract
    Definition Classes
    TraversableLike
  11. 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. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    That

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

    that

    the traversable to append.

    bf

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

    returns

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

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

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

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

    returns

    the priority queue itself.

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

    Inserts a single element into the priority queue.

    Inserts a single element into the priority queue.

    elem

    the element to insert.

    returns

    this priority queue.

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

    adds two or more elements to this priority queue.

    adds two or more elements to this priority queue.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the priority queue itself

    Definition Classes
    Growable
  15. 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, x,,1,,), x,,2,,), ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  16. def /:\ [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Definition Classes
    GenTraversableOnce
  17. 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(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  18. def == (arg0: AnyRef): Boolean

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

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  20. 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
  21. 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
  22. 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
  23. def aggregate [B] (z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

       pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
    

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  24. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  25. 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
  26. 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
    PriorityQueueBuilderGrowable
  27. def clone (): PriorityQueue[A]

    This method clones the priority queue.

    This method clones the priority queue.

    returns

    a priority queue with the same elements.

    Definition Classes
    PriorityQueue → AnyRef
  28. 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 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  29. 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 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
    TraversableLikeGenTraversableLike
  30. def collectFirst [B] (pf: PartialFunction[A, B]): Option[B]

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

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

    pf

    the partial function

    returns

    an option value containing pf applied to the first value for which it is defined, or None if none exists.

    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  31. def companion : GenericCompanion[Iterable]

    The factory companion object that builds instances of class PriorityQueue.

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

    Definition Classes
    IterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  32. 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
  33. 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  34. 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
    GenTraversableOnce
  35. 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
    TraversableOnceGenTraversableOnce
  36. 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, beginning at index start. Copying will stop once either the end of the current priority queue is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  37. 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, beginning at index start. Copying will stop once either the end of the current priority queue is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
  38. 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
  39. 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
    TraversableOnceGenTraversableOnce
  40. 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.

  41. def dequeueAll [A1 >: A, That] (implicit bf: scala.collection.generic.CanBuildFrom[_, A1, That]): That

  42. 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
    IterableLikeTraversableLikeGenTraversableLike
  43. def dropRight (n: Int): PriorityQueue[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    Definition Classes
    IterableLike
  44. 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
    TraversableLikeGenTraversableLike
  45. def enqueue (elems: A*): Unit

    Adds all elements to the queue.

    Adds all elements to the queue.

    elems

    the elements to add.

  46. def eq (arg0: AnyRef): Boolean

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

    • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
    • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
    • null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  47. def equals (arg0: Any): Boolean

    The equality method for reference types.

    The equality method for reference types. See equals in Any.

    returns

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

    Definition Classes
    AnyRef → Any
  48. 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  49. 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
    TraversableLikeGenTraversableLike
  50. 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
    TraversableLikeGenTraversableLike
  51. def finalize (): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  52. 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  53. def fixDown (as: Array[AnyRef], m: Int, n: Int): Unit

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

    Attributes
    protected
  55. def flatMap [B] (f: (A) ⇒ GenTraversableOnce[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 collection of type That resulting from applying the given collection-valued function f to each element of this priority queue and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  56. def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[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 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
    TraversableLikeGenTraversableLikeFilterMonadic
  57. 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
  58. def flatten [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[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
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  59. def fold [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this sequence using the specified associative binary operator.

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.

    z

    a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. Nil for list concatenation, 0 for addition, or 1 for multiplication)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  60. 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, x,,1,,), x,,2,,, ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  61. 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(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  62. 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  63. 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
  64. 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.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
  65. def genericBuilder [B] : Builder[B, Iterable[B]]

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

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

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

  67. def getClass (): java.lang.Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef → Any
  68. 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
    TraversableLikeGenTraversableLike
  69. def grouped (size: Int): Iterator[PriorityQueue[A]]

    Partitions elements in fixed size priority queues.

    Partitions elements in fixed size priority queues.

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableLike
    See also

    Iterator#grouped

  70. 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
    TraversableLikeTraversableOnceGenTraversableOnce
  71. def hashCode (): Int

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

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

    returns

    never.

    Definition Classes
    PriorityQueue → AnyRef → Any
  72. def head : A

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

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

    returns

    the element with the highest priority.

    Definition Classes
    PriorityQueueIterableLikeGenIterableLikeGenericTraversableTemplateTraversableLikeGenTraversableLike
  73. 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
  74. 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
  75. def inits : Iterator[PriorityQueue[A]]

    Iterates over the inits of this priority queue.

    Iterates over the inits of this priority queue. The first value will be this priority queue and the final one will be an empty priority queue, with the intervening values the results of successive applications of init.

    returns

    an iterator over all the inits of this priority queue

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  76. def isEmpty : Boolean

    Tests whether the priority queue is empty.

    Tests whether the priority queue is empty.

    returns

    true if the priority queue contains no elements, false otherwise.

    Definition Classes
    PriorityQueueIterableLikeGenIterableLikeGenericTraversableTemplateTraversableLikeTraversableOnceGenTraversableOnce
  77. def isInstanceOf [T0] : Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

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

    returns

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

    Attributes
    final
    Definition Classes
    Any
  78. 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
    GenTraversableLikeGenTraversableOnce
  79. def iterator : Iterator[A]

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

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

    returns

    an iterator over all elements sorted in descending order.

    Definition Classes
    PriorityQueueIterableLikeGenIterableLike
  80. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this priority queue.

    Definition Classes
    TraversableLike
  81. 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
  82. def length : Int

  83. 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 collection of type That resulting from applying the given function f to each element of this priority queue and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  84. 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 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
    TraversableLikeGenTraversableLikeFilterMonadic
  85. 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
  86. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  87. 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
    TraversableOnceGenTraversableOnce
  88. def maxBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  89. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  90. 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
    TraversableOnceGenTraversableOnce
  91. def minBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  92. 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
    TraversableOnceGenTraversableOnce
  93. 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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  94. 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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  95. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  96. def newBuilder : PriorityQueue[A]

    The builder that builds instances of type PriorityQueue[A]

    The builder that builds instances of type PriorityQueue[A]

    Attributes
    protected[this]
    Definition Classes
    PriorityQueueGenericTraversableTemplateTraversableLikeHasNewBuilder
  97. 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
    TraversableOnceGenTraversableOnce
  98. 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
  99. 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
  100. implicit val ord : Ordering[A]

    implicit ordering used to compare the elements of type A.

    implicit ordering used to compare the elements of type A.

    Attributes
    implicit
    Definition Classes
    PriorityQueueGenericOrderedTraversableTemplate
  101. def orderedCompanion : scala.collection.mutable.PriorityQueue.type

  102. def par : ParIterable[A]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

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

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    IterableTraversableLikeParallelizable
  104. 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
    TraversableLikeGenTraversableLike
  105. 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 of this priority queue with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  106. 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
    TraversableOnceGenTraversableOnce
  107. def reduce [A1 >: A] (op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this sequence using the specified associative binary operator.

    Reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the collection is nonempty.

    Definition Classes
    TraversableOnceGenTraversableOnce
  108. def reduceLeft [B >: A] (op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce
  109. 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
    TraversableOnceGenTraversableOnce
  110. def reduceOption [A1 >: A] (op: (A1, A1) ⇒ A1): Option[A1]

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  111. def reduceRight [B >: A] (op: (A, B) ⇒ B): B

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this priority queue, going right to left:

                op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this priority queue.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  112. 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
    TraversableOnceGenTraversableOnce
  113. 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
    PriorityQueueTraversableLikeGenTraversableLike
  114. 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
  115. 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.

  116. def reverseIterator : Iterator[A]

  117. def reversed : List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  118. def sameElements [B >: A] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  119. def sameElements (that: GenIterable[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
    GenIterableLike
  120. def sameElements [B >: A] (that: GenIterable[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
    IterableLikeGenIterableLike
  121. def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[PriorityQueue[A], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

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

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new priority queue containing the prefix scan of the elements in this priority queue

    Definition Classes
    TraversableLikeGenTraversableLike
  122. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  123. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That

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

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

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

    "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

  124. def seq : Iterable[A]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    Definition Classes
    IterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  125. def size : Int

    The size of this priority queue.

    The size of this priority queue.

    returns

    the number of elements in this priority queue.

    Definition Classes
    PriorityQueueGenTraversableLikeTraversableOnceGenTraversableOnce
  126. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

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

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

    coll

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

    delta

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

    Definition Classes
    Builder
  127. 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
  128. 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
  129. def slice (from: Int, until: Int): PriorityQueue[A]

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    
    from

    the lowest index to include from this priority queue.

    until

    the highest index to EXCLUDE from this priority queue.

    returns

    a priority queue containing the elements greater than or equal to index from extending up to (but not including) index until of this priority queue.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  130. def sliding [B >: A] (size: Int, step: Int): Iterator[PriorityQueue[A]]

    Definition Classes
    IterableLike
  131. 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

    Iterator#sliding

  132. 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
    TraversableLikeGenTraversableLike
  133. 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
    TraversableLikeGenTraversableLike
  134. 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
    TraversableLikeGenTraversableLike
  135. 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 of this priority queue with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  136. 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
    TraversableOnceGenTraversableOnce
  137. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  138. 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
    TraversableLikeGenTraversableLike
  139. def tails : Iterator[PriorityQueue[A]]

    Iterates over the tails of this priority queue.

    Iterates over the tails of this priority queue. The first value will be this priority queue and the final one will be an empty priority queue, with the intervening values the results of successive applications of tail.

    returns

    an iterator over all the tails of this priority queue

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  140. 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
    IterableLikeTraversableLikeGenTraversableLike
  141. 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
  142. 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
    IterableLikeTraversableLikeGenTraversableLike
  143. def thisCollection : Iterable[A]

    The underlying collection seen as an instance of PriorityQueue.

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

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  144. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  145. 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
    TraversableOnceGenTraversableOnce
  146. 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
    TraversableOnceGenTraversableOnce
  147. def toCollection (repr: PriorityQueue[A]): Iterable[A]

    A conversion from collections of type Repr to PriorityQueue objects.

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

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  148. 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
    TraversableOnceGenTraversableOnce
  149. 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
    IterableLikeTraversableOnceGenTraversableOnce
  150. 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
    TraversableLikeGenTraversableOnce
  151. 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
    PriorityQueueTraversableOnceGenTraversableOnce
  152. def toMap [T, U] : Map[T, U]

    [use case] Converts this priority queue to a map.

    [use case]

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

    returns

    a map containing all elements of this priority queue.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  153. 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 ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this priority queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  154. def toQueue : Queue[A]

    Returns a regular queue containing the same elements.

  155. def toSeq : Seq[A]

    Converts this priority queue to a sequence.

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

    returns

    a sequence containing all elements of this priority queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  156. 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
    TraversableOnceGenTraversableOnce
  157. 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
    IterableLikeTraversableLikeGenTraversableOnce
  158. def toString (): String

    Returns a textual representation of a queue as a string.

    Returns a textual representation of a queue as a string.

    returns

    the string representation of this queue.

    Definition Classes
    PriorityQueueTraversableLike → AnyRef → Any
  159. 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
    TraversableLikeTraversableOnceGenTraversableOnce
  160. def transpose [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[Traversable[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
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  161. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

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

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

    asPair

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

    returns

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

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

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

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

    returns

    a triple priority queues, containing the first, second, respectively third member of each element triple of this priority queue.

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

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

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

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

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

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

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

    Definition Classes
    IterableLikeTraversableLike
  164. def view : IterableView[A, PriorityQueue[A]]

    Creates a non-strict view of this priority queue.

    Creates a non-strict view of this priority queue.

    returns

    a non-strict view of this priority queue.

    Definition Classes
    IterableLikeTraversableLike
  165. def wait (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  168. 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
  169. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  170. def zip [B] (that: GenIterable[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 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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  171. def zip [A1 >: A, B, That] (that: GenIterable[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
    IterableLikeGenIterableLike
  172. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[PriorityQueue[A], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  173. 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.

    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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  174. def zipAll [B, A1 >: A, That] (that: GenIterable[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
    IterableLikeGenIterableLike
  175. 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 collection of type That containing pairs consisting of all elements of this priority queue paired with their index. Indices start at 0.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  176. 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
    IterableLikeGenIterableLike

Deprecated Value Members

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

    Annotations
    @deprecated
    Deprecated

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

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

    Annotations
    @deprecated
    Deprecated

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

  3. def elements : Iterator[A]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  4. def first : A

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  5. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  6. def max : A

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

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

    returns

    the element with the highest priority.

    Annotations
    @deprecated
    Deprecated

    Use head instead.

  7. def projection : IterableView[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
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

Inherited from Serializable

Inherited from Serializable

Inherited from Builder[A, PriorityQueue[A]]

Inherited from Growable[A]

Inherited from GenericOrderedTraversableTemplate[A, PriorityQueue]

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, PriorityQueue[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, PriorityQueue[A]]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Iterable]

Inherited from TraversableLike[A, PriorityQueue[A]]

Inherited from GenTraversableLike[A, PriorityQueue[A]]

Inherited from Parallelizable[A, ParIterable[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, PriorityQueue[A]]

Inherited from HasNewBuilder[A, PriorityQueue[A]]

Inherited from AnyRef

Inherited from Any