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

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

  32. def dequeueOrNull(): A

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

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

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

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

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

    FIX - TBD

    FIX - TBD

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

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

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