Packages

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

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

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

A

type of the elements in this priority queue.

Version

1.0, 03/05/2004

Since

1

Linear Supertypes
Cloneable, Cloneable, Serializable, Serializable, Builder[A, PriorityQueue[A]], Growable[A], Clearable, GenericOrderedTraversableTemplate[A, PriorityQueue], AbstractIterable[A], Iterable[A], Traversable[A], Mutable, AbstractIterable[A], Iterable[A], IterableLike[A, PriorityQueue[A]], Equals, GenIterable[A], GenIterableLike[A, PriorityQueue[A]], AbstractTraversable[A], Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Iterable], TraversableLike[A, PriorityQueue[A]], GenTraversableLike[A, PriorityQueue[A]], Parallelizable[A, ParIterable[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, PriorityQueue[A]], HasNewBuilder[A, scalation.util.PriorityQueue[A] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PriorityQueue
  2. Cloneable
  3. Cloneable
  4. Serializable
  5. Serializable
  6. Builder
  7. Growable
  8. Clearable
  9. GenericOrderedTraversableTemplate
  10. AbstractIterable
  11. Iterable
  12. Traversable
  13. Mutable
  14. AbstractIterable
  15. Iterable
  16. IterableLike
  17. Equals
  18. GenIterable
  19. GenIterableLike
  20. AbstractTraversable
  21. Traversable
  22. GenTraversable
  23. GenericTraversableTemplate
  24. TraversableLike
  25. GenTraversableLike
  26. Parallelizable
  27. TraversableOnce
  28. GenTraversableOnce
  29. FilterMonadic
  30. HasNewBuilder
  31. AnyRef
  32. Any
  1. Hide All
  2. Show All
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]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. 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.

  4. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++=(xs: TraversableOnce[A]): PriorityQueue.this.type
    Definition Classes
    Growable
  8. 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
    PriorityQueue → Builder → Growable
  9. def +=(elem1: A, elem2: A, elems: A*): PriorityQueue.this.type
    Definition Classes
    Growable
  10. def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  11. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  16. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  18. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  19. 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 → Growable → Clearable
  20. 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
  21. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  22. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  23. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  24. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  25. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  28. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. 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

  30. 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 java.util.NoSuchElementException

    returns

    the element with the highest priority.

  31. def dequeueAll[A1 >: A, That](implicit bf: CanBuildFrom[_, A1, That]): That

    Returns all elements in the queue, and removes them from the queue.

  32. def drop(n: Int): PriorityQueue[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  33. def dropRight(n: Int): PriorityQueue[A]
    Definition Classes
    IterableLike
  34. def dropWhile(p: (A) ⇒ Boolean): PriorityQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def enqueue(elems: A*): Unit

    Adds all elements to the queue.

    Adds all elements to the queue.

    elems

    the elements to add.

  36. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  38. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  39. def filter(p: (A) ⇒ Boolean): PriorityQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def filterNot(p: (A) ⇒ Boolean): PriorityQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  42. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def fixDown(as: Array[AnyRef], m: Int, n: Int): Unit

    Re-establish the heap order from position 'm' down the tree to 'n'.

    Re-establish the heap order from position 'm' down the tree to 'n'.

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

    Re-establish the heap order from position 'm' up the tree to the root.

    Re-establish the heap order from position 'm' up the tree to the root.

    Attributes
    protected
  45. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  46. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  47. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  50. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  52. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  53. def genericOrderedBuilder[B](implicit ord: Ordering[B]): Builder[B, PriorityQueue[B]]
    Definition Classes
    GenericOrderedTraversableTemplate
  54. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  55. def groupBy[K](f: (A) ⇒ K): Map[K, PriorityQueue[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def grouped(size: Int): Iterator[PriorityQueue[A]]
    Definition Classes
    IterableLike
  57. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  58. 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
  59. 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 → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  60. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  61. 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

  62. def init: PriorityQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def inits: Iterator[PriorityQueue[A]]
    Definition Classes
    TraversableLike
  64. def isEmpty: Boolean

    Determine whether the priority is empty.

    Determine whether the priority is empty.

    Definition Classes
    PriorityQueue → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  65. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  66. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  67. 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 → IterableLike → GenIterableLike
  68. def last: A
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def length: Int

    Returns the adjusted length.

  71. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  72. def mapResult[NewTo](f: (PriorityQueue[A]) ⇒ NewTo): Builder[A, NewTo]
    Definition Classes
    Builder
  73. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  81. def newBuilder: PriorityQueue[A]
    Attributes
    protected[this]
    Definition Classes
    PriorityQueue → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  82. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. final def notify(): Unit
    Definition Classes
    AnyRef
  84. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  85. implicit val ord: Ordering[A]
    Definition Classes
    PriorityQueue → GenericOrderedTraversableTemplate
  86. def orderedCompanion: PriorityQueue.type

    Definition Classes
    PriorityQueue → GenericOrderedTraversableTemplate
  87. def par: ParIterable[A]
    Definition Classes
    Parallelizable
  88. def parCombiner: Combiner[A, ParIterable[A]]
    Attributes
    protected[this]
    Definition Classes
    Iterable → TraversableLike → Parallelizable
  89. def partition(p: (A) ⇒ Boolean): (PriorityQueue[A], PriorityQueue[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  90. def printInOrder(): Unit

    Print the priority queue in order.

  91. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce
  94. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  97. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def repr: PriorityQueue[A]

    Returns the representation.

    Returns the representation.

    Definition Classes
    PriorityQueue → TraversableLike → GenTraversableLike
  99. def result(): PriorityQueue[A]

    Returns this priority queue.

    Returns this priority queue.

    Definition Classes
    PriorityQueue → Builder
  100. 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.

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

  102. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  103. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  104. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[PriorityQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  107. def seq: Iterable[A]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  108. def size: Int

    Returns the size.

    Returns the size.

    Definition Classes
    PriorityQueue → GenTraversableLike → TraversableOnce → GenTraversableOnce
  109. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  110. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  111. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  112. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  113. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  114. def slice(from: Int, until: Int): PriorityQueue[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  115. def sliding(size: Int, step: Int): Iterator[PriorityQueue[A]]
    Definition Classes
    IterableLike
  116. def sliding(size: Int): Iterator[PriorityQueue[A]]
    Definition Classes
    IterableLike
  117. def span(p: (A) ⇒ Boolean): (PriorityQueue[A], PriorityQueue[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def splitAt(n: Int): (PriorityQueue[A], PriorityQueue[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  119. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  122. def tail: PriorityQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def tails: Iterator[PriorityQueue[A]]
    Definition Classes
    TraversableLike
  124. def take(n: Int): PriorityQueue[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  125. def takeRight(n: Int): PriorityQueue[A]
    Definition Classes
    IterableLike
  126. def takeWhile(p: (A) ⇒ Boolean): PriorityQueue[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  127. def thisCollection: Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  128. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  129. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def toCollection(repr: PriorityQueue[A]): Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  132. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  134. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  135. 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 → TraversableOnce → GenTraversableOnce
  136. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. 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.

  138. def toSeq: Seq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  141. 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 → TraversableLike → AnyRef → Any
  142. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  143. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  145. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  146. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  147. def view(from: Int, until: Int): IterableView[A, PriorityQueue[A]]
    Definition Classes
    IterableLike → TraversableLike
  148. def view: IterableView[A, PriorityQueue[A]]
    Definition Classes
    IterableLike → TraversableLike
  149. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  150. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  151. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  152. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, PriorityQueue[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  153. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[PriorityQueue[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  154. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[PriorityQueue[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  155. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[PriorityQueue[A], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Inherited from Cloneable

Inherited from Cloneable

Inherited from Serializable

Inherited from Serializable

Inherited from Builder[A, PriorityQueue[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from GenericOrderedTraversableTemplate[A, PriorityQueue]

Inherited from AbstractIterable[A]

Inherited from Iterable[A]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from AbstractIterable[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 AbstractTraversable[A]

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, scalation.util.PriorityQueue[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped