Packages

class PQueue[T <: PQItem] extends ReArray[T] with Serializable

The PQueue class provides a simple linear implementation for priority queues. Once bug in scala 2.8 if fixed, may wish to switch to logarithmic implementation in scala.collection.mutable.PriorityQueue.

Linear Supertypes
ReArray[T], Serializable, IndexedSeq[T], IndexedSeqOps[T, IndexedSeq, IndexedSeq[T]], IndexedSeq[T], IndexedSeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]], AbstractSeq[T], Seq[T], SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]], Cloneable[IndexedSeq[T]], Cloneable, Iterable[T], AbstractSeq[T], Seq[T], Equals, SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]], PartialFunction[Int, T], (Int) => T, AbstractIterable[T], Iterable[T], IterableFactoryDefaults[T, [x]IndexedSeq[x]], IterableOps[T, [_]IndexedSeq[_], IndexedSeq[T]], IterableOnceOps[T, [_]IndexedSeq[_], IndexedSeq[T]], IterableOnce[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PQueue
  2. ReArray
  3. Serializable
  4. IndexedSeq
  5. IndexedSeqOps
  6. IndexedSeq
  7. IndexedSeqOps
  8. AbstractSeq
  9. Seq
  10. SeqOps
  11. Cloneable
  12. Cloneable
  13. Iterable
  14. AbstractSeq
  15. Seq
  16. Equals
  17. SeqOps
  18. PartialFunction
  19. Function1
  20. AbstractIterable
  21. Iterable
  22. IterableFactoryDefaults
  23. IterableOps
  24. IterableOnceOps
  25. IterableOnce
  26. AnyRef
  27. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new PQueue()(implicit arg0: ClassTag[T])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. final def ++:[B >: T](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  5. final def +:[B >: T](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  6. final def :+[B >: T](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. final def :++[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def add(item: T): Unit

    Add an item to the priority queue ordered by 'actTime'.

    Add an item to the priority queue ordered by 'actTime'.

    item

    the item to add

  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. def andThen[C](k: PartialFunction[T, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  14. def andThen[C](k: (T) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  15. def appended[B >: T](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  16. def appendedAll[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  17. def apply(): Array[T]

    Return the internal array of the ReArray.

    Return the internal array of the ReArray.

    Definition Classes
    ReArray
  18. def apply(i: Int): T

    Return the element at the 'i'-th index position.

    Return the element at the 'i'-th index position.

    i

    the index position

    Definition Classes
    ReArray → SeqOps → Function1
  19. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  20. var array: Array[T]

    Set the internal array of ReArray.

    Set the internal array of ReArray.

    Attributes
    protected
    Definition Classes
    ReArray
  21. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  22. def canEqual(that: Any): Boolean
    Definition Classes
    Seq → Equals
  23. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  24. def clear(): Unit

    Clear the ReArray.

    Clear the ReArray.

    Definition Classes
    ReArray
  25. def clone(): IndexedSeq[T]
    Definition Classes
    SeqOps → Cloneable → AnyRef
  26. final def coll: PQueue.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  27. def collect[B](pf: PartialFunction[T, B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  28. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    IterableOnceOps
  29. def combinations(n: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    SeqOps
  30. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, T]
    Definition Classes
    PartialFunction
  31. def compose[A](g: (A) => Int): (A) => T
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  32. final def concat[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  33. def contains[A1 >: T](elem: A1): Boolean
    Definition Classes
    SeqOps
  34. def containsSlice[B >: T](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  35. def copy(m: Int, n: Int, len: Int): Unit

    Move parts of the array.

    Move parts of the array.

    m

    the source position

    n

    the destination position

    len

    the number of elements

    Attributes
    protected
    Definition Classes
    ReArray
  36. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int

    Fill the given array 'xs' with at most 'len' elements of 'this' traversable starting at position 'start'.

    Fill the given array 'xs' with at most 'len' elements of 'this' traversable starting at position 'start'. Copying will stop once either the end of the current traversable is reached or 'len' elements have been copied or the end of the array is reached.

    xs

    the array to fill

    start

    starting index

    len

    number of elements to copy

    Definition Classes
    ReArray → IterableOnceOps
  37. def copyToArray[B >: T](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  38. def copyToArray[B >: T](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  39. def corresponds[B](that: Seq[B])(p: (T, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  40. def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  41. def count(p: (T) => Boolean): Int
    Definition Classes
    IterableOnceOps
  42. def dequeue(): T

    Remove and return the first item (least 'actTime') from the priority queue.

  43. def diff[B >: T](that: Seq[B]): IndexedSeq[T]
    Definition Classes
    SeqOps
  44. def distinct: IndexedSeq[T]
    Definition Classes
    SeqOps
  45. def distinctBy[B](f: (T) => B): IndexedSeq[T]
    Definition Classes
    SeqOps
  46. def drop(n: Int): IndexedSeq[T]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  47. def dropRight(n: Int): IndexedSeq[T]
    Definition Classes
    IndexedSeqOps → IterableOps
  48. def dropWhile(p: (T) => Boolean): IndexedSeq[T]
    Definition Classes
    IterableOps → IterableOnceOps
  49. def elementWise: ElementWiseExtractor[Int, T]
    Definition Classes
    PartialFunction
  50. def empty: IndexedSeq[T]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  51. def endsWith[B >: T](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  52. def ensureSize(n: Int): Unit

    Ensure that the internal array has at least 'n' cells.

    Ensure that the internal array has at least 'n' cells.

    n

    the number of cells

    Attributes
    protected
    Definition Classes
    ReArray
  53. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  54. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  55. def exists(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  56. def expand(sz: Int): Unit

    Expand the array to make sure it has the required size.

    Expand the array to make sure it has the required size.

    sz

    the new size requirement of the array

    Definition Classes
    ReArray
  57. def filter(pred: (T) => Boolean): IndexedSeq[T]
    Definition Classes
    IterableOps → IterableOnceOps
  58. def filterNot(pred: (T) => Boolean): IndexedSeq[T]
    Definition Classes
    IterableOps → IterableOnceOps
  59. def find(p: (T) => Boolean): Option[T]
    Definition Classes
    IterableOnceOps
  60. def findLast(p: (T) => Boolean): Option[T]
    Definition Classes
    SeqOps
  61. def flatMap[B](f: (T) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  62. def flatten[B](implicit asIterable: (T) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  63. def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  64. def foldLeft[B](z: B)(op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  65. def foldRight[B](z: B)(op: (T, B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  66. def forall(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  67. def foreach[U](f: (T) => U): Unit

    Iterate over the ReArray element by element.

    Iterate over the ReArray element by element.

    f

    the function to apply

    Definition Classes
    ReArray → IterableOnceOps
  68. def fromSpecific(coll: IterableOnce[T]): IndexedSeq[T]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  69. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  70. def groupBy[K](f: (T) => K): Map[K, IndexedSeq[T]]
    Definition Classes
    IterableOps
  71. def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, IndexedSeq[B]]
    Definition Classes
    IterableOps
  72. def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  73. def grouped(size: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableOps
  74. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  75. def head: T
    Definition Classes
    IndexedSeqOps → IterableOps
  76. def headOption: Option[T]
    Definition Classes
    IndexedSeqOps → IterableOps
  77. def indexOf[B >: T](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  78. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  79. def indexOfSlice[B >: T](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  80. def indexOfSlice[B >: T](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  81. def indexWhere(p: (T) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  82. def indexWhere(p: (T) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  83. def indices: Range
    Definition Classes
    SeqOps
  84. def init: IndexedSeq[T]
    Definition Classes
    IterableOps
  85. def initialSize: Int

    Return the initial size of the ReArray.

    Return the initial size of the ReArray.

    Attributes
    protected
    Definition Classes
    ReArray
  86. def inits: Iterator[IndexedSeq[T]]
    Definition Classes
    IterableOps
  87. def intersect(b: ReArray[T]): ReArray[T]

    Intersect 'this' ReArray with ReArray 'b'.

    Intersect 'this' ReArray with ReArray 'b'.

    b

    the ReArray to intersect with

    Definition Classes
    ReArray
  88. def intersect[B >: T](that: Seq[B]): IndexedSeq[T]
    Definition Classes
    SeqOps
  89. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  90. def isEmpty: Boolean

    Indicate whether the priority queue is empty.

    Indicate whether the priority queue is empty.

    Definition Classes
    PQueue → SeqOps → IterableOnceOps
  91. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  92. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  93. def iterableFactory: SeqFactory[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  94. def iterator: Iterator[T]
    Definition Classes
    IndexedSeqOps → IterableOnce
  95. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  96. def last: T
    Definition Classes
    IndexedSeqOps → IterableOps
  97. def lastIndexOf[B >: T](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  98. def lastIndexOfSlice[B >: T](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  99. def lastIndexOfSlice[B >: T](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  100. def lastIndexWhere(p: (T) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  101. def lastIndexWhere(p: (T) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  102. def lastOption: Option[T]
    Definition Classes
    IterableOps
  103. def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, PQueue.this.type]
    Definition Classes
    Iterable
  104. def length: Int

    Return the length of 'this' ReArray.

    Return the length of 'this' ReArray.

    Definition Classes
    ReArray → SeqOps
  105. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  106. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  107. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  108. def lift: (Int) => Option[T]
    Definition Classes
    PartialFunction
  109. def map[B](f: (T) => B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  110. def mapInPlace(f: (T) => T): PQueue.this.type
    Definition Classes
    IndexedSeqOps
  111. def max[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  112. def maxBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  113. def maxByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  114. def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  115. def min[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  116. def minBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  117. def minByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  118. def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  119. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  120. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  121. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  122. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  123. def newSpecificBuilder: Builder[T, IndexedSeq[T]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  124. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  125. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  126. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  127. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  128. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  129. def padTo[B >: T](len: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  130. def partition(p: (T) => Boolean): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    IterableOps
  131. def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  132. def patch[B >: T](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
    Definition Classes
    SeqOps
  133. def permutations: Iterator[IndexedSeq[T]]
    Definition Classes
    SeqOps
  134. def prepended[B >: T](elem: B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  135. def prependedAll[B >: T](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  136. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  137. def reduce[B >: T](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  138. def reduceLeft[B >: T](op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  139. def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
    Definition Classes
    IterableOnceOps
  140. def reduceOption[B >: T](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  141. def reduceRight[B >: T](op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  142. def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  143. def reduceToSize(sz: Int): Unit

    Remove elements of this array at indices after 'sz'.

    Remove elements of this array at indices after 'sz'.

    sz

    the index position

    Definition Classes
    ReArray
  144. def rem(item: T): Boolean

    Remove the specific item from the priority queue.

    Remove the specific item from the priority queue.

    item

    the item to remove

  145. def reverse: IndexedSeq[T]
    Definition Classes
    IndexedSeqOps → SeqOps
  146. def reverseIterator: Iterator[T]
    Definition Classes
    IndexedSeqOps → SeqOps
  147. def reversed: Iterable[T]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  148. def runWith[U](action: (T) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  149. def sameElements[B >: T](that: IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  150. def scan[B >: T](z: B)(op: (B, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  151. def scanLeft[B](z: B)(op: (B, T) => B): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  152. def scanRight[B](z: B)(op: (T, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  153. def search[B >: T](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  154. def search[B >: T](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  155. def segmentLength(p: (T) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  156. final def segmentLength(p: (T) => Boolean): Int
    Definition Classes
    SeqOps
  157. def shiftLeft(i: Int): Unit

    Remove one element at the specified index position and shift the rest of the elements in the array one position to the left.

    Remove one element at the specified index position and shift the rest of the elements in the array one position to the left.

    i

    the index of the element to be removed

    Definition Classes
    ReArray
  158. def shiftLeft2(i: Int): Unit

    Remove two elements starting at the specified index position and shift the rest of the elements in the array two positions to the left.

    Remove two elements starting at the specified index position and shift the rest of the elements in the array two positions to the left.

    i

    the index of the element to be removed

    Definition Classes
    ReArray
  159. def shiftRight(i: Int): Unit

    Shift the elements by one position to the right starting at the index 'i'.

    Shift the elements by one position to the right starting at the index 'i'. This will also automatically expand the array. The value will be repeated at 'i' and 'i+1' positions.

    i

    the index position to start the shift

    Definition Classes
    ReArray
  160. def shiftRight2(i: Int): Unit

    Shift the elements by two positions to the right starting at the index 'i'.

    Shift the elements by two positions to the right starting at the index 'i'. This will also automatically expand the array. The value will be repeated at 'i', 'i+1' and 'i+2' positions.

    i

    the index position to start the shift

    Definition Classes
    ReArray
  161. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  162. var size0: Int

    Set the size of ReArray.

    Set the size of ReArray.

    Attributes
    protected
    Definition Classes
    ReArray
  163. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  164. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  165. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  166. def slice(from: Int, until: Int): IndexedSeq[T]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  167. def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableOps
  168. def sliding(size: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableOps
  169. def sortBy[B](f: (T) => B)(implicit ord: Ordering[B]): IndexedSeq[T]
    Definition Classes
    SeqOps
  170. def sortInPlace[B >: T]()(implicit ord: Ordering[B]): PQueue.this.type
    Definition Classes
    IndexedSeqOps
  171. def sortInPlaceBy[B](f: (T) => B)(implicit ord: Ordering[B]): PQueue.this.type
    Definition Classes
    IndexedSeqOps
  172. def sortInPlaceWith(lt: (T, T) => Boolean): PQueue.this.type
    Definition Classes
    IndexedSeqOps
  173. def sortWith(lt: (T, T) => Boolean): IndexedSeq[T]
    Definition Classes
    SeqOps
  174. def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]
    Definition Classes
    SeqOps
  175. def span(p: (T) => Boolean): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    IterableOps → IterableOnceOps
  176. def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    IterableOps → IterableOnceOps
  177. def startsWith[B >: T](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  178. def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  179. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  180. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  181. def swap(i: Int, j: Int): Unit

    Swap two elements of this array.

    Swap two elements of this array.

    i

    the first element

    j

    the second element

    Attributes
    protected
    Definition Classes
    ReArray
  182. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  183. def tail: IndexedSeq[T]
    Definition Classes
    IterableOps
  184. def tails: Iterator[IndexedSeq[T]]
    Definition Classes
    IterableOps
  185. def take(n: Int): IndexedSeq[T]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  186. def takeRight(n: Int): IndexedSeq[T]
    Definition Classes
    IndexedSeqOps → IterableOps
  187. def takeWhile(p: (T) => Boolean): IndexedSeq[T]
    Definition Classes
    IterableOps → IterableOnceOps
  188. def tapEach[U](f: (T) => U): IndexedSeq[T]
    Definition Classes
    IterableOps → IterableOnceOps
  189. def to[C1](factory: Factory[T, C1]): C1
    Definition Classes
    IterableOnceOps
  190. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  191. final def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  192. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    IterableOnceOps
  193. final def toIterable: PQueue.this.type
    Definition Classes
    Iterable → IterableOps
  194. def toList: List[T]
    Definition Classes
    IterableOnceOps
  195. def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  196. def toSeq: Seq[T]
    Definition Classes
    IterableOnceOps
  197. def toSet[B >: T]: Set[B]
    Definition Classes
    IterableOnceOps
  198. def toString(): String

    Show the contents of the priority queue.

    Show the contents of the priority queue.

    Definition Classes
    PQueue → ReArray → Seq → Function1 → Iterable → AnyRef → Any
  199. def toVector: Vector[T]
    Definition Classes
    IterableOnceOps
  200. def transpose[B](implicit asIterable: (T) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    IterableOps
  201. def unapply(a: Int): Option[T]
    Definition Classes
    PartialFunction
  202. def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  203. def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    IterableOps
  204. def update(idx: Int, elem: T): Unit

    Set 'this' array's element at the 'i'- th index position.

    Set 'this' array's element at the 'i'- th index position.

    idx

    the given index

    elem

    the value to assign

    Definition Classes
    ReArray → SeqOps
  205. def updated[B >: T](index: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  206. def view: IndexedSeqView[T]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  207. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  208. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  209. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  210. def withFilter(p: (T) => Boolean): WithFilter[T, [_]IndexedSeq[_]]
    Definition Classes
    IterableOps
  211. def zip[B](that: IterableOnce[B]): IndexedSeq[(T, B)]
    Definition Classes
    IterableOps
  212. def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
    Definition Classes
    IterableOps
  213. def zipWithIndex: IndexedSeq[(T, Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

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

    (Since version 2.13.0) Use foldLeft instead of /:

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

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, T) => 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.

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

    (Since version 2.13.0) Use iterableFactory instead

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

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

  6. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  7. 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)

  8. final def prefixLength(p: (T) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  9. final def repr: IndexedSeq[T]
    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

  10. def reverseMap[B](f: (T) => B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  11. def seq: PQueue.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

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

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

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

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

  14. final def toTraversable: Traversable[T]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  15. final def transform(f: (T) => T): PQueue.this.type
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapInPlace on an IndexedSeq instead

  16. final def union[B >: T](that: Seq[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  17. def view(from: Int, until: Int): IndexedSeqView[T]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

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

Inherited from ReArray[T]

Inherited from Serializable

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, IndexedSeq, IndexedSeq[T]]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from AbstractSeq[T]

Inherited from Seq[T]

Inherited from SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from Cloneable[IndexedSeq[T]]

Inherited from Cloneable

Inherited from Iterable[T]

Inherited from AbstractSeq[T]

Inherited from Seq[T]

Inherited from Equals

Inherited from SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from PartialFunction[Int, T]

Inherited from (Int) => T

Inherited from AbstractIterable[T]

Inherited from Iterable[T]

Inherited from IterableFactoryDefaults[T, [x]IndexedSeq[x]]

Inherited from IterableOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from IterableOnceOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from IterableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped