Packages

c

scalation.util

CircularQueue

class CircularQueue[A] extends LinearSeqOptimized[A, CircularQueue[A]]

The CircularQueue provides a circular queue that can be used to store the latest 'cap' elements.

Linear Supertypes
LinearSeqOptimized[A, CircularQueue[A]], LinearSeqLike[A, CircularQueue[A]], SeqLike[A, CircularQueue[A]], GenSeqLike[A, CircularQueue[A]], IterableLike[A, CircularQueue[A]], GenIterableLike[A, CircularQueue[A]], TraversableLike[A, CircularQueue[A]], GenTraversableLike[A, CircularQueue[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, CircularQueue[A]], HasNewBuilder[A, CircularQueue[A]], Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CircularQueue
  2. LinearSeqOptimized
  3. LinearSeqLike
  4. SeqLike
  5. GenSeqLike
  6. IterableLike
  7. GenIterableLike
  8. TraversableLike
  9. GenTraversableLike
  10. Parallelizable
  11. TraversableOnce
  12. GenTraversableOnce
  13. FilterMonadic
  14. HasNewBuilder
  15. Equals
  16. AnyRef
  17. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new CircularQueue(cap: Int)(implicit arg0: ClassTag[A])

    cap

    the capacity or maximum number of elements that can be stored

Type Members

  1. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike
  3. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike
  4. def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  5. def +=(elem: A): CircularQueue.this.type

    Add element 'elem' to the front of 'this' circular queue, overwriting the oldest element when queue is full.

    Add element 'elem' to the front of 'this' circular queue, overwriting the oldest element when queue is full.

    elem

    the element to add

  6. def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  7. def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  8. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def apply(n: Int): A
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  14. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  15. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  16. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  17. def combinations(n: Int): Iterator[CircularQueue[A]]
    Definition Classes
    SeqLike
  18. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    LinearSeqOptimized → SeqLike
  19. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  20. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  24. final def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
    Definition Classes
    LinearSeqLike → SeqLike → GenSeqLike
    Annotations
    @tailrec()
  25. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def dequeue(): A

    Remove the oldest element from the rear of 'this' circular queue, throwing an exception when the queue is empty

  27. def dequeueOrNull(): A

    Remove the oldest element from the rear of 'this' circular queue, returning null when the queue is empty.

  28. def diff[B >: A](that: GenSeq[B]): CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  29. def distinct: CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  30. def drop(n: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  31. def dropRight(n: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike
  32. def dropWhile(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  33. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  34. def enqueue(elem: A): CircularQueue.this.type

    Add element 'elem' to the front of 'this' circular queue, throwing an exeception when the queue is full.

    Add element 'elem' to the front of 'this' circular queue, throwing an exeception when the queue is full.

    elem

    the element to add

  35. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  36. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  37. def filter(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def filterNot(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  39. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  41. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → TraversableOnce → GenTraversableOnce
  43. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  44. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  45. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  46. def groupBy[K](f: (A) ⇒ K): Map[K, CircularQueue[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def grouped(size: Int): Iterator[CircularQueue[A]]
    Definition Classes
    IterableLike
  48. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  49. def hashCode(): Int
    Definition Classes
    LinearSeqLike → GenSeqLike → AnyRef → Any
  50. def head: A
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  51. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  53. def indexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  54. def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  55. def indexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  56. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  57. def indexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  58. def indices: Range
    Definition Classes
    SeqLike
  59. def init: CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def inits: Iterator[CircularQueue[A]]
    Definition Classes
    TraversableLike
  61. def intersect[B >: A](that: GenSeq[B]): CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  62. def isDefinedAt(x: Int): Boolean
    Definition Classes
    LinearSeqOptimized → GenSeqLike
  63. def isEmpty: Boolean

    Return whether the queue is empty (i.e., has no element).

    Return whether the queue is empty (i.e., has no element).

    Definition Classes
    CircularQueue → LinearSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  64. def isFull: Boolean

    Return whether the queue is full (i.e., no space left for new elements).

  65. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  66. def iterator: Iterator[A]
    Definition Classes
    LinearSeqLike → IterableLike → GenIterableLike
  67. def last: A
    Definition Classes
    LinearSeqOptimized → TraversableLike → GenTraversableLike
  68. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  69. def lastIndexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  70. def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  71. def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  72. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  73. def lastIndexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  74. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def length: Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  76. def lengthCompare(len: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike
  77. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  78. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  87. def par: ParSeq[A]
    Definition Classes
    Parallelizable
  88. def partition(p: (A) ⇒ Boolean): (CircularQueue[A], CircularQueue[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  90. def permutations: Iterator[CircularQueue[A]]
    Definition Classes
    SeqLike
  91. def prefixLength(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  92. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → TraversableOnce
  95. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  98. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def repr: CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def reverse: CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  101. def reverseIterator: Iterator[A]
    Definition Classes
    SeqLike
  102. def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  103. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    LinearSeqOptimized → IterableLike → GenIterableLike
  104. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[CircularQueue[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 segmentLength(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  108. def seq: LinearSeq[A]

    Return the queue storage array as a sequence.

    Return the queue storage array as a sequence.

    Definition Classes
    CircularQueue → LinearSeqLike → GenSeqLike → Parallelizable → TraversableOnce → GenTraversableOnce
  109. def size: Int

    Return the current size of the queue (number of elements contained).

    Return the current size of the queue (number of elements contained).

    Definition Classes
    CircularQueue → SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  110. def slice(from: Int, until: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  111. def sliding(size: Int, step: Int): Iterator[CircularQueue[A]]
    Definition Classes
    IterableLike
  112. def sliding(size: Int): Iterator[CircularQueue[A]]
    Definition Classes
    IterableLike
  113. def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): CircularQueue[A]
    Definition Classes
    SeqLike
  114. def sortWith(lt: (A, A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    SeqLike
  115. def sorted[B >: A](implicit ord: Ordering[B]): CircularQueue[A]
    Definition Classes
    SeqLike
  116. def span(p: (A) ⇒ Boolean): (CircularQueue[A], CircularQueue[A])
    Definition Classes
    LinearSeqOptimized → TraversableLike → GenTraversableLike
  117. def splitAt(n: Int): (CircularQueue[A], CircularQueue[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  119. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  120. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def tail: CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def tails: Iterator[CircularQueue[A]]
    Definition Classes
    TraversableLike
  124. def take(n: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  125. def takeRight(n: Int): CircularQueue[A]
    Definition Classes
    IterableLike
  126. def takeWhile(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  127. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  128. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  132. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  133. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def toSeq: Seq[A]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  136. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  138. def toString(): String

    Convert 'this' circular queue into a string.

    Convert 'this' circular queue into a string. FIX - also print empty slot

    Definition Classes
    CircularQueue → SeqLike → TraversableLike → AnyRef → Any
  139. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  140. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  142. def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  143. def view(from: Int, until: Int): SeqView[A, CircularQueue[A]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  144. def view: SeqView[A, CircularQueue[A]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  145. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, CircularQueue[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  146. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[CircularQueue[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  147. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[CircularQueue[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  148. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[CircularQueue[A], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike