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, Serializable, IndexedSeq[T], IndexedSeqLike[T, IndexedSeq[T]], IndexedSeq[T], IndexedSeqLike[T, IndexedSeq[T]], AbstractSeq[T], Seq[T], SeqLike[T, Seq[T]], Cloneable[Seq[T]], Cloneable, Cloneable, Iterable[T], Traversable[T], Mutable, AbstractSeq[T], Seq[T], SeqLike[T, IndexedSeq[T]], GenSeq[T], GenSeqLike[T, IndexedSeq[T]], PartialFunction[Int, T], (Int) ⇒ T, AbstractIterable[T], Iterable[T], IterableLike[T, IndexedSeq[T]], Equals, GenIterable[T], GenIterableLike[T, IndexedSeq[T]], AbstractTraversable[T], Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, IndexedSeq], TraversableLike[T, IndexedSeq[T]], GenTraversableLike[T, IndexedSeq[T]], Parallelizable[T, ParSeq[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, IndexedSeq[T]], HasNewBuilder[T, scala.collection.mutable.IndexedSeq[T] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PQueue
  2. ReArray
  3. Serializable
  4. Serializable
  5. IndexedSeq
  6. IndexedSeqLike
  7. IndexedSeq
  8. IndexedSeqLike
  9. AbstractSeq
  10. Seq
  11. SeqLike
  12. Cloneable
  13. Cloneable
  14. Cloneable
  15. Iterable
  16. Traversable
  17. Mutable
  18. AbstractSeq
  19. Seq
  20. SeqLike
  21. GenSeq
  22. GenSeqLike
  23. PartialFunction
  24. Function1
  25. AbstractIterable
  26. Iterable
  27. IterableLike
  28. Equals
  29. GenIterable
  30. GenIterableLike
  31. AbstractTraversable
  32. Traversable
  33. GenTraversable
  34. GenericTraversableTemplate
  35. TraversableLike
  36. GenTraversableLike
  37. Parallelizable
  38. TraversableOnce
  39. GenTraversableOnce
  40. FilterMonadic
  41. HasNewBuilder
  42. AnyRef
  43. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = IndexedSeq[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. 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 ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike
  6. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  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. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  15. def apply(): Array[T]

    Return the internal array of the ReArray.

    Return the internal array of the ReArray.

    Definition Classes
    ReArray
  16. 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 → SeqLike → GenSeqLike → Function1
  17. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  18. var array: Array[T]

    Set the internal array of ReArray.

    Set the internal array of ReArray.

    Attributes
    protected
    Definition Classes
    ReArray
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  21. def clear(): Unit

    Clear the ReArray.

    Clear the ReArray.

    Definition Classes
    ReArray
  22. def clone(): Seq[T]
    Definition Classes
    Cloneable → AnyRef
  23. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  25. def combinations(n: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    SeqLike
  26. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  27. def compose[A](g: (A) ⇒ Int): (A) ⇒ T
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def contains[A1 >: T](elem: A1): Boolean
    Definition Classes
    SeqLike
  29. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  30. 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
  31. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

    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 → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  35. def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  36. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def dequeue(): T

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

  38. def diff[B >: T](that: GenSeq[B]): IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  39. def distinct: IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  40. def drop(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  41. def dropRight(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike
  42. def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  43. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  44. 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
  45. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  46. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  47. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. 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
  49. def filter(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def filterNot(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  53. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  54. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  57. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  58. 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 → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  59. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  60. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  61. def groupBy[K](f: (T) ⇒ K): Map[K, IndexedSeq[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def grouped(size: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableLike
  63. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  64. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  65. def head: T
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  66. def headOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  68. def indexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  69. def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  70. def indexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  71. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  72. def indexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  73. def indices: Range
    Definition Classes
    SeqLike
  74. def init: IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def initialSize: Int

    Return the initial size of the ReArray.

    Return the initial size of the ReArray.

    Attributes
    protected
    Definition Classes
    ReArray
  76. def inits: Iterator[IndexedSeq[T]]
    Definition Classes
    TraversableLike
  77. 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
  78. def intersect[B >: T](that: GenSeq[B]): IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  79. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  80. def isEmpty: Boolean

    Indicate whether the priority queue is empty.

    Indicate whether the priority queue is empty.

    Definition Classes
    PQueue → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  81. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  82. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  83. def iterator: Iterator[T]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  84. def last: T
    Definition Classes
    TraversableLike → GenTraversableLike
  85. def lastIndexOf[B >: T](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  86. def lastIndexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  87. def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  88. def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  89. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  90. def lastIndexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  91. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  92. def length: Int

    Return the length of 'this' ReArray.

    Return the length of 'this' ReArray.

    Definition Classes
    ReArray → SeqLike → GenSeqLike
  93. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  94. def lift: (Int) ⇒ Option[T]
    Definition Classes
    PartialFunction
  95. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  96. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  104. def newBuilder: Builder[T, IndexedSeq[T]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  105. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  107. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  108. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  109. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  110. def par: ParSeq[T]
    Definition Classes
    Parallelizable
  111. def parCombiner: Combiner[T, ParSeq[T]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → SeqLike → TraversableLike → Parallelizable
  112. def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  113. def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  114. def permutations: Iterator[IndexedSeq[T]]
    Definition Classes
    SeqLike
  115. def prefixLength(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  116. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  119. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  122. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. 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
  124. 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

  125. def repr: IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def reverse: IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  127. def reverseIterator: Iterator[T]
    Definition Classes
    SeqLike
  128. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  129. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  130. def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  131. def sameElements[B >: T](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  132. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], 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.

  135. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  136. def seq: IndexedSeq[T]
    Definition Classes
    IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  137. 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
  138. 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
  139. 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
  140. 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
  141. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  142. var size0: Int

    Set the size of ReArray.

    Set the size of ReArray.

    Attributes
    protected
    Definition Classes
    ReArray
  143. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  144. def slice(from: Int, until: Int): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  145. def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableLike
  146. def sliding(size: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableLike
  147. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]
    Definition Classes
    SeqLike
  148. def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    SeqLike
  149. def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]
    Definition Classes
    SeqLike
  150. def span(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  151. def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  153. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  154. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  155. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. 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
  157. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  158. def tail: IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  159. def tails: Iterator[IndexedSeq[T]]
    Definition Classes
    TraversableLike
  160. def take(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  161. def takeRight(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike
  162. def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  163. def thisCollection: IndexedSeq[T]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  164. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  165. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toBuffer[A1 >: T]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  167. def toCollection(repr: IndexedSeq[T]): IndexedSeq[T]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  168. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toIterable: Iterable[T]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  170. def toIterator: Iterator[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  171. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def toSeq: Seq[T]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  174. def toSet[B >: T]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toStream: Stream[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  176. def toString(): String

    Show the contents of the priority queue.

    Show the contents of the priority queue.

    Definition Classes
    PQueue → ReArray → SeqLike → Function1 → TraversableLike → AnyRef → Any
  177. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  178. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. def transform(f: (T) ⇒ T): PQueue.this.type
    Definition Classes
    SeqLike
  180. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  181. def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  182. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    GenericTraversableTemplate
  183. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    GenericTraversableTemplate
  184. 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 → IndexedSeqLike → SeqLike
  185. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  186. def view(from: Int, until: Int): IndexedSeqView[T, IndexedSeq[T]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  187. def view: IndexedSeqView[T, IndexedSeq[T]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  188. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  189. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  190. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  191. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, IndexedSeq[T]]
    Definition Classes
    TraversableLike → FilterMonadic
  192. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  193. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  194. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[IndexedSeq[T], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  3. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from ReArray[T]

Inherited from Serializable

Inherited from Serializable

Inherited from IndexedSeq[T]

Inherited from IndexedSeqLike[T, IndexedSeq[T]]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqLike[T, IndexedSeq[T]]

Inherited from AbstractSeq[T]

Inherited from Seq[T]

Inherited from SeqLike[T, Seq[T]]

Inherited from Cloneable[Seq[T]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Iterable[T]

Inherited from Traversable[T]

Inherited from Mutable

Inherited from AbstractSeq[T]

Inherited from Seq[T]

Inherited from SeqLike[T, IndexedSeq[T]]

Inherited from GenSeq[T]

Inherited from GenSeqLike[T, IndexedSeq[T]]

Inherited from PartialFunction[Int, T]

Inherited from (Int) ⇒ T

Inherited from AbstractIterable[T]

Inherited from Iterable[T]

Inherited from IterableLike[T, IndexedSeq[T]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, IndexedSeq[T]]

Inherited from AbstractTraversable[T]

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, IndexedSeq]

Inherited from TraversableLike[T, IndexedSeq[T]]

Inherited from GenTraversableLike[T, IndexedSeq[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, IndexedSeq[T]]

Inherited from HasNewBuilder[T, scala.collection.mutable.IndexedSeq[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped