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. type Self = CircularQueue[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 ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike
  6. def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. 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

  8. def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  9. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  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, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def apply(n: Int): A
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  15. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  16. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  17. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  18. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  19. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  20. def combinations(n: Int): Iterator[CircularQueue[A]]
    Definition Classes
    SeqLike
  21. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    LinearSeqOptimized → SeqLike
  22. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  23. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  24. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  27. final def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
    Definition Classes
    LinearSeqLike → SeqLike → GenSeqLike
    Annotations
    @tailrec()
  28. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def dequeue(): A

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

  30. def dequeueOrNull(): A

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

  31. def diff[B >: A](that: GenSeq[B]): CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  32. def distinct: CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  33. def drop(n: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  34. def dropRight(n: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike
  35. def dropWhile(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  37. 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

  38. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  39. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  40. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  41. def filter(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def filterNot(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  43. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  44. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  45. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → TraversableOnce → GenTraversableOnce
  47. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  48. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  49. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  50. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  51. def groupBy[K](f: (A) ⇒ K): Map[K, CircularQueue[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def grouped(size: Int): Iterator[CircularQueue[A]]
    Definition Classes
    IterableLike
  53. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  54. def hashCode(): Int
    Definition Classes
    LinearSeqLike → GenSeqLike → AnyRef → Any
  55. def head: A
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  56. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  58. def indexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  59. def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  60. def indexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  61. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  62. def indexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  63. def indices: Range
    Definition Classes
    SeqLike
  64. def init: CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def inits: Iterator[CircularQueue[A]]
    Definition Classes
    TraversableLike
  66. def intersect[B >: A](that: GenSeq[B]): CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  67. def isDefinedAt(x: Int): Boolean
    Definition Classes
    LinearSeqOptimized → GenSeqLike
  68. 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
  69. def isFull: Boolean

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

  70. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  71. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  72. def iterator: Iterator[A]
    Definition Classes
    LinearSeqLike → IterableLike → GenIterableLike
  73. def last: A
    Definition Classes
    LinearSeqOptimized → TraversableLike → GenTraversableLike
  74. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  75. def lastIndexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  76. def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  77. def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  78. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  79. def lastIndexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  80. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def length: Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  82. def lengthCompare(len: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike
  83. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  84. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  92. def newBuilder: Builder[A, CircularQueue[A]]

    FIX - TBD

    FIX - TBD

    Attributes
    protected[this]
    Definition Classes
    CircularQueue → TraversableLike → HasNewBuilder
  93. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  95. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  96. def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  97. def par: ParSeq[A]
    Definition Classes
    Parallelizable
  98. def parCombiner: Combiner[A, ParSeq[A]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  99. def partition(p: (A) ⇒ Boolean): (CircularQueue[A], CircularQueue[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  101. def permutations: Iterator[CircularQueue[A]]
    Definition Classes
    SeqLike
  102. def prefixLength(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  103. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → TraversableOnce
  106. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  109. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def repr: CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def reverse: CircularQueue[A]
    Definition Classes
    SeqLike → GenSeqLike
  112. def reverseIterator: Iterator[A]
    Definition Classes
    SeqLike
  113. def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  114. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  115. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    LinearSeqOptimized → IterableLike → GenIterableLike
  116. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  117. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  118. 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.

  119. def segmentLength(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    LinearSeqOptimized → SeqLike → GenSeqLike
  120. 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
  121. 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
  122. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  123. def slice(from: Int, until: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  124. def sliding(size: Int, step: Int): Iterator[CircularQueue[A]]
    Definition Classes
    IterableLike
  125. def sliding(size: Int): Iterator[CircularQueue[A]]
    Definition Classes
    IterableLike
  126. def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): CircularQueue[A]
    Definition Classes
    SeqLike
  127. def sortWith(lt: (A, A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    SeqLike
  128. def sorted[B >: A](implicit ord: Ordering[B]): CircularQueue[A]
    Definition Classes
    SeqLike
  129. def span(p: (A) ⇒ Boolean): (CircularQueue[A], CircularQueue[A])
    Definition Classes
    LinearSeqOptimized → TraversableLike → GenTraversableLike
  130. def splitAt(n: Int): (CircularQueue[A], CircularQueue[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  131. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  132. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  133. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  136. def tail: CircularQueue[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  137. def tails: Iterator[CircularQueue[A]]
    Definition Classes
    LinearSeqOptimized → TraversableLike
  138. def take(n: Int): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  139. def takeRight(n: Int): CircularQueue[A]
    Definition Classes
    IterableLike
  140. def takeWhile(p: (A) ⇒ Boolean): CircularQueue[A]
    Definition Classes
    LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  141. def thisCollection: LinearSeq[A]
    Attributes
    protected[this]
    Definition Classes
    LinearSeqLike → SeqLike → IterableLike → TraversableLike
  142. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  143. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def toCollection(repr: CircularQueue[A]): LinearSeq[A]
    Attributes
    protected[this]
    Definition Classes
    LinearSeqLike → SeqLike → IterableLike → TraversableLike
  146. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  148. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  149. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. def toSeq: Seq[A]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  152. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  153. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  154. 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
  155. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  156. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  158. def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[CircularQueue[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  159. def view(from: Int, until: Int): SeqView[A, CircularQueue[A]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  160. def view: SeqView[A, CircularQueue[A]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  161. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  162. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  163. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  164. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, CircularQueue[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  165. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[CircularQueue[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  166. 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
  167. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[CircularQueue[A], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

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

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (A, 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 LinearSeqOptimized[A, CircularQueue[A]]

Inherited from LinearSeqLike[A, CircularQueue[A]]

Inherited from SeqLike[A, CircularQueue[A]]

Inherited from GenSeqLike[A, CircularQueue[A]]

Inherited from IterableLike[A, CircularQueue[A]]

Inherited from GenIterableLike[A, CircularQueue[A]]

Inherited from TraversableLike[A, CircularQueue[A]]

Inherited from GenTraversableLike[A, CircularQueue[A]]

Inherited from Parallelizable[A, ParSeq[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, CircularQueue[A]]

Inherited from HasNewBuilder[A, CircularQueue[A]]

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped