Packages

class PriorityQueue[A] extends AbstractIterable[A] with Iterable[A] with IterableOps[A, Iterable, PriorityQueue[A]] with StrictOptimizedIterableOps[A, Iterable, PriorityQueue[A]] with Builder[A, PriorityQueue[A]] with Cloneable[PriorityQueue[A]] with Growable[A] with Serializable

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

If multiple elements have the same priority in the ordering of this PriorityQueue, no guarantees are made regarding the order in which elements are returned by dequeue or dequeueAll. In particular, that means this class does not guarantee first in first out behaviour that may be incorrectly inferred from the Queue part of the name of this class.

Only the dequeue and dequeueAll methods will return elements in priority order (while removing elements from the heap). Standard collection methods including drop, iterator, and toString will remove or traverse the heap in whichever order seems most convenient.

Therefore, printing a PriorityQueue will not reveal the priority order of the elements, though the highest-priority element will be printed first. To print the elements in order, one must duplicate the PriorityQueue (by using clone, for instance) and then dequeue them:

A

type of the elements in this priority queue.

Example:

  1. val pq = collection.mutable.PriorityQueue(1, 2, 5, 3, 7)
println(pq)                  // elements probably not in order
println(pq.clone.dequeueAll) // prints ArraySeq(7, 5, 3, 2, 1)
Linear Supertypes
Serializable, Cloneable[PriorityQueue[A]], Cloneable, Builder[A, PriorityQueue[A]], Growable[A], Clearable, StrictOptimizedIterableOps[A, Iterable, PriorityQueue[A]], AbstractIterable[A], Iterable[A], AbstractIterable[A], Iterable[A], IterableFactoryDefaults[A, [x]Iterable[x]], IterableOps[A, [_]Iterable[_], PriorityQueue[A]], IterableOnceOps[A, [_]Iterable[_], PriorityQueue[A]], IterableOnce[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PriorityQueue
  2. Serializable
  3. Cloneable
  4. Cloneable
  5. Builder
  6. Growable
  7. Clearable
  8. StrictOptimizedIterableOps
  9. AbstractIterable
  10. Iterable
  11. AbstractIterable
  12. Iterable
  13. IterableFactoryDefaults
  14. IterableOps
  15. IterableOnceOps
  16. IterableOnce
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

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

    ord

    implicit ordering used to compare the elements of type A.

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def ++(xs: IterableOnce[A]): PriorityQueue[A]

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

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

    xs

    a iterable object.

    returns

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

  4. final def ++[B >: A](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. final def ++=(xs: IterableOnce[A]): PriorityQueue.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  6. final def +=(elem: A): PriorityQueue.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  7. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def addAll(xs: IterableOnce[A]): PriorityQueue.this.type

    Add all elements.

    Add all elements.

    Definition Classes
    PriorityQueue → Growable
  9. def addOne(elem: A): PriorityQueue.this.type

    Inserts a single element into the priority queue.

    Inserts a single element into the priority queue.

    elem

    the element to insert.

    returns

    this priority queue.

    Definition Classes
    PriorityQueue → Growable
  10. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def className: String
    Attributes
    protected[this]
    Definition Classes
    PriorityQueue → Iterable
  15. def clear(): Unit

    Removes all elements from the queue.

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

    Definition Classes
    PriorityQueue → Builder → Clearable
  16. 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 → Cloneable → AnyRef
  17. final def coll: PriorityQueue.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  18. def collect[B](pf: PartialFunction[A, B]): Iterable[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  19. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOnceOps
  20. def concat[B >: A](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  21. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    PriorityQueue → IterableOnceOps
  22. def copyToArray[B >: A](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  23. def copyToArray[B >: A](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  24. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  25. def count(p: (A) => Boolean): Int
    Definition Classes
    IterableOnceOps
  26. def decreaseKey(elem: A, upElem: A): Unit

    Since the element's priority is being decreased, move it to a lower priority position (toward the back).

    Since the element's priority is being decreased, move it to a lower priority position (toward the back).

    elem

    the element to reposition

    upElem

    the update version of the element to reposition

  27. 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. throws NoSuchElementException

    returns

    the element with the highest priority.

  28. def dequeueAll[A1 >: A]: Seq[A1]

    Returns and removes all the elements in the priority queue.

  29. def drop(n: Int): PriorityQueue[A]
    Definition Classes
    IterableOps → IterableOnceOps
  30. def dropRight(n: Int): PriorityQueue[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  31. def dropWhile(p: (A) => Boolean): PriorityQueue[A]
    Definition Classes
    IterableOps → IterableOnceOps
  32. def empty: PriorityQueue[A]
    Definition Classes
    PriorityQueue → IterableFactoryDefaults → IterableOps
  33. def enqueue(elems: A*): Unit

    Adds all elements to the queue.

    Adds all elements to the queue.

    elems

    the elements to add.

  34. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  36. def exists(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  37. def filter(pred: (A) => Boolean): PriorityQueue[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  38. def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): PriorityQueue[A]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  39. def filterNot(pred: (A) => Boolean): PriorityQueue[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  40. def find(p: (A) => Boolean): Option[A]
    Definition Classes
    IterableOnceOps
  41. def fixDown(as: Array[AnyRef], m: Int, n: Int): Boolean

    Make swaps going down the tree.

    Make swaps going down the tree. Returns true if any swaps were done (used in heapify).

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

    Make swaps going up the tree.

    Make swaps going up the tree.

    Attributes
    protected
  43. def flatMap[B](f: (A) => IterableOnce[B]): Iterable[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  44. def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Iterable[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  45. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  46. def foldLeft[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  47. def foldRight[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  48. def forall(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  49. def foreach[U](f: (A) => U): Unit
    Definition Classes
    IterableOnceOps
  50. def fromSpecific(coll: IterableOnce[A]): PriorityQueue[A]

    Make a priority from a collection type that is not eligible for EvidenceIterableFactoryDefaults since C != CC[A] (PriorityQueue[A] != Iterable[A])

    Make a priority from a collection type that is not eligible for EvidenceIterableFactoryDefaults since C != CC[A] (PriorityQueue[A] != Iterable[A])

    Attributes
    protected
    Definition Classes
    PriorityQueue → IterableFactoryDefaults → IterableOps
  51. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  52. def groupBy[K](f: (A) => K): Map[K, PriorityQueue[A]]
    Definition Classes
    IterableOps
  53. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  54. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  55. def grouped(size: Int): Iterator[PriorityQueue[A]]
    Definition Classes
    IterableOps
  56. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  57. def head: A

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

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

    returns

    the element with the highest priority.

    Definition Classes
    PriorityQueue → IterableOps
  58. def headOption: Option[A]
    Definition Classes
    IterableOps
  59. def increaseKey(elem: A, upElem: A): Unit

    Since the element's priority is being increased, move it to a higher priority position (toward the front).

    Since the element's priority is being increased, move it to a higher priority position (toward the front).

    elem

    the element to reposition

    upElem

    the update version of the element to reposition

  60. def init: PriorityQueue[A]
    Definition Classes
    IterableOps
  61. def inits: Iterator[PriorityQueue[A]]
    Definition Classes
    IterableOps
  62. def isEmpty: Boolean
    Definition Classes
    PriorityQueue → IterableOnceOps
  63. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  64. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  65. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → Iterable → IterableOps
  66. def iterator: Iterator[A]

    Returns an iterator which yields all the elements.

    Returns an iterator which yields all the elements. Note: The order of elements returned is undefined. If you want to traverse the elements in priority queue order, use clone().dequeueAll.iterator.

    returns

    an iterator over all the elements.

    Definition Classes
    PriorityQueue → IterableOnce
  67. def knownSize: Int
    Definition Classes
    PriorityQueue → Growable → IterableOnce
  68. def last: A
    Definition Classes
    IterableOps
  69. def lastOption: Option[A]
    Definition Classes
    IterableOps
  70. def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, PriorityQueue.this.type]
    Definition Classes
    Iterable
  71. def length: Int
  72. def map[B](f: (A) => B): Iterable[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  73. def mapInPlace(f: (A) => A): PriorityQueue.this.type
  74. def mapResult[NewTo](f: (PriorityQueue[A]) => NewTo): Builder[A, NewTo]
    Definition Classes
    Builder
  75. def max[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  76. def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  77. def maxByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  78. def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  79. def min[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  80. def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  81. def minByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  82. def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  83. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  84. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  85. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  86. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  87. def newSpecificBuilder: Builder[A, PriorityQueue[A]]
    Attributes
    protected
    Definition Classes
    PriorityQueue → IterableFactoryDefaults → IterableOps
  88. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  89. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  90. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  91. implicit val ord: Ordering[A]
  92. def partition(p: (A) => Boolean): (PriorityQueue[A], PriorityQueue[A])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  93. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  94. def printInOrder: Unit

    Print the elements in the priority queue in order.

  95. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  96. def reduce[B >: A](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  97. def reduceLeft[B >: A](op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  98. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
    Definition Classes
    IterableOnceOps
  99. def reduceOption[B >: A](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  100. def reduceRight[B >: A](op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  101. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  102. def result(): PriorityQueue[A]
    Definition Classes
    PriorityQueue → Builder
  103. def reverse: PriorityQueue[A]

    Returns the reverse of this priority queue.

    Returns the reverse of this priority queue. The new priority queue has the same elements as the original, but the opposite ordering. For example, the element with the highest priority in pq has the lowest priority in pq.reverse, and vice versa. Ties are handled arbitrarily. Elements with equal priority may or may not be reversed with respect to each other.

    returns

    the reversed priority queue.

  104. def reverseIterator: Iterator[A]

    Returns an iterator which yields all the elements in the reverse order than that returned by the method iterator.

    Returns an iterator which yields all the elements in the reverse order than that returned by the method iterator. Note: The order of elements returned is undefined.

    returns

    an iterator over all elements sorted in descending order.

  105. def reversed: Iterable[A]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  106. def scan[B >: A](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  107. def scanLeft[B](z: B)(op: (B, A) => B): Iterable[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  108. def scanRight[B](z: B)(op: (A, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  109. def size: Int
    Definition Classes
    PriorityQueue → IterableOnceOps
  110. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  111. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  112. final def sizeHint(coll: IterableOnce[_], delta: Int): Unit
    Definition Classes
    Builder
  113. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  114. final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
    Definition Classes
    Builder
  115. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  116. def slice(from: Int, until: Int): PriorityQueue[A]
    Definition Classes
    IterableOps → IterableOnceOps
  117. def sliding(size: Int, step: Int): Iterator[PriorityQueue[A]]
    Definition Classes
    IterableOps
  118. def sliding(size: Int): Iterator[PriorityQueue[A]]
    Definition Classes
    IterableOps
  119. def span(p: (A) => Boolean): (PriorityQueue[A], PriorityQueue[A])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  120. def splitAt(n: Int): (PriorityQueue[A], PriorityQueue[A])
    Definition Classes
    IterableOps → IterableOnceOps
  121. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
    Definition Classes
    IterableOnce
  122. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  123. final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  124. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  125. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  126. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  127. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  128. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
    Annotations
    @deprecatedOverriding()
  129. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  130. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  131. def tail: PriorityQueue[A]
    Definition Classes
    IterableOps
  132. def tails: Iterator[PriorityQueue[A]]
    Definition Classes
    IterableOps
  133. def take(n: Int): PriorityQueue[A]
    Definition Classes
    IterableOps → IterableOnceOps
  134. def takeRight(n: Int): PriorityQueue[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  135. def takeWhile(p: (A) => Boolean): PriorityQueue[A]
    Definition Classes
    IterableOps → IterableOnceOps
  136. def tapEach[U](f: (A) => U): PriorityQueue[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  137. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOnceOps
  138. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  139. final def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  140. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IterableOnceOps
  141. final def toIterable: PriorityQueue.this.type
    Definition Classes
    Iterable → IterableOps
  142. def toList: List[A]

    Converts this priority queue to a list.

    Converts this priority queue to a list. Note: the order of elements is undefined.

    returns

    a list containing all elements of this priority queue.

    Definition Classes
    PriorityQueue → IterableOnceOps
  143. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  144. def toQueue: Queue[A]

    Returns a regular queue containing the same elements.

    Returns a regular queue containing the same elements. Note: the order of elements is undefined.

  145. def toSeq: Seq[A]
    Definition Classes
    IterableOnceOps
  146. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOnceOps
  147. def toString(): String

    Returns a textual representation of a queue as a string.

    Returns a textual representation of a queue as a string.

    returns

    the string representation of this queue.

    Definition Classes
    PriorityQueue → Iterable → AnyRef → Any
  148. def toVector: Vector[A]
    Definition Classes
    IterableOnceOps
  149. def transpose[B](implicit asIterable: (A) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  150. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  151. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  152. def view: View[A]
    Definition Classes
    IterableOps
  153. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  154. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  155. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  156. def withFilter(p: (A) => Boolean): WithFilter[A, [_]Iterable[_]]
    Definition Classes
    IterableOps
  157. def writeReplace(): AnyRef
    Attributes
    protected[this]
  158. def zip[B](that: IterableOnce[B]): Iterable[(A, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  159. def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  160. def zipWithIndex: Iterable[(A, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps

Deprecated Value Members

  1. def ++:[B >: A](that: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. final def +=(elem1: A, elem2: A, elems: A*): PriorityQueue.this.type
    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= aka addAll instead of varargs +=; infix operations with an operand of multiple args will be deprecated

  3. final def /:[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  4. final def :\[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  5. def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  6. def companion: IterableFactory[[_]Iterable[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  7. final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  9. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  10. def orderedCompanion: PriorityQueue.type
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use PriorityQueue instead

  11. final def repr: PriorityQueue[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  12. def seq: PriorityQueue.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  13. final def toIterator: Iterator[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  14. final def toStream: Stream[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  15. final def toTraversable: Traversable[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  16. def view(from: Int, until: Int): View[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from Serializable

Inherited from Cloneable[PriorityQueue[A]]

Inherited from Cloneable

Inherited from Builder[A, PriorityQueue[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from StrictOptimizedIterableOps[A, Iterable, PriorityQueue[A]]

Inherited from AbstractIterable[A]

Inherited from Iterable[A]

Inherited from AbstractIterable[A]

Inherited from Iterable[A]

Inherited from IterableFactoryDefaults[A, [x]Iterable[x]]

Inherited from IterableOps[A, [_]Iterable[_], PriorityQueue[A]]

Inherited from IterableOnceOps[A, [_]Iterable[_], PriorityQueue[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped