A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/Queue.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.Queue

class Queue[A] extends ArrayDeque[A] with IndexedSeqOps[A, Queue, Queue[A]] with StrictOptimizedSeqOps[A, Queue, Queue[A]] with IterableFactoryDefaults[A, Queue] with ArrayDequeOps[A, Queue, Queue[A]] with Cloneable[Queue[A]] with DefaultSerializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Queue
  2. ArrayDeque
  3. DefaultSerializable
  4. Serializable
  5. ArrayDequeOps
  6. StrictOptimizedSeqOps
  7. StrictOptimizedIterableOps
  8. IndexedBuffer
  9. IndexedSeq
  10. IndexedSeqOps
  11. IndexedSeq
  12. IndexedSeqOps
  13. AbstractBuffer
  14. Buffer
  15. Shrinkable
  16. Growable
  17. Clearable
  18. AbstractSeq
  19. Seq
  20. SeqOps
  21. Cloneable
  22. Cloneable
  23. Iterable
  24. AbstractSeq
  25. Seq
  26. Equals
  27. SeqOps
  28. PartialFunction
  29. Function1
  30. AbstractIterable
  31. Iterable
  32. IterableFactoryDefaults
  33. IterableOps
  34. IterableOnceOps
  35. IterableOnce
  36. AnyRef
  37. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  def +(other: String): String
  4.  final def ++[B >: A](suffix: IterableOnce[B]): Queue[B]
  5.  final def ++:[B >: A](prefix: IterableOnce[B]): Queue[B]
  6.  final def ++=(xs: IterableOnce[A]): Queue.this.type
  7.  final def ++=:(elems: IterableOnce[A]): Queue.this.type
  8.  final def +:[B >: A](elem: B): Queue[B]
  9.  final def +=(elem: A): Queue.this.type
  10.  final def +=:(elem: A): Queue.this.type
  11.  final def --=(xs: IterableOnce[A]): Queue.this.type
  12.  final def -=(elem: A): Queue.this.type
  13.  def ->[B](y: B): (Queue[A], B)
  14.  final def :+[B >: A](elem: B): Queue[B]
  15.  final def :++[B >: A](suffix: IterableOnce[B]): Queue[B]
  16.  final def ==(arg0: Any): Boolean
  17.  def addAll(elems: IterableOnce[A]): Queue.this.type
  18.  def addOne(elem: A): Queue.this.type
  19.  final def addString(b: StringBuilder): b.type
  20.  final def addString(b: StringBuilder, sep: String): b.type
  21.  def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
  22.  def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
  23.  def andThen[C](k: (A) => C): PartialFunction[Int, C]
  24.  final def append(elem: A): Queue.this.type
  25.  final def appendAll(xs: IterableOnce[A]): Queue.this.type
  26.  def appended[B >: A](elem: B): Queue[B]
  27.  def appendedAll[B >: A](suffix: IterableOnce[B]): Queue[B]
  28.  def apply(idx: Int): A
  29.  def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
  30.  var array: Array[AnyRef]
  31.  final def asInstanceOf[T0]: T0
  32.  def canEqual(that: Any): Boolean
  33.  def className: String
  34.  def clear(): Unit
  35.  def clearAndShrink(size: Int = ArrayDeque.DefaultInitialSize): Queue.this.type
  36.  final def clone(): Queue[A]
  37.  final def coll: Queue.this.type
  38.  def collect[B](pf: PartialFunction[A, B]): Queue[B]
  39.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  40.  def combinations(n: Int): Iterator[Queue[A]]
  41.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
  42.  def compose[A](g: (A) => Int): (A) => A
  43.  final def concat[B >: A](suffix: IterableOnce[B]): Queue[B]
  44.  def contains[A1 >: A](elem: A1): Boolean
  45.  def containsSlice[B >: A](that: collection.Seq[B]): Boolean
  46.  def copySliceToArray(srcStart: Int, dest: Array[_], destStart: Int, maxItems: Int): dest.type
  47.  def copyToArray[B >: A](dest: Array[B], destStart: Int, len: Int): Int
  48.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
  49.  def copyToArray[B >: A](xs: Array[B]): Int
  50.  def corresponds[B](that: collection.Seq[B])(p: (A, B) => Boolean): Boolean
  51.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
  52.  def count(p: (A) => Boolean): Int
  53.  def dequeue(): A
  54.  def dequeueAll(p: (A) => Boolean): immutable.Seq[A]
  55.  def dequeueFirst(p: (A) => Boolean): Option[A]
  56.  def dequeueWhile(f: (A) => Boolean): collection.Seq[A]
  57.  def diff[B >: A](that: collection.Seq[B]): Queue[A]
  58.  def distinct: Queue[A]
  59.  def distinctBy[B](f: (A) => B): Queue[A]
  60.  def drop(n: Int): Queue[A]
  61.  def dropInPlace(n: Int): Queue.this.type
  62.  def dropRight(n: Int): Queue[A]
  63.  def dropRightInPlace(n: Int): Queue.this.type
  64.  def dropWhile(p: (A) => Boolean): Queue[A]
  65.  def dropWhileInPlace(p: (A) => Boolean): Queue.this.type
  66.  def elementWise: ElementWiseExtractor[Int, A]
  67.  def empty: Queue[A]
  68.  def endsWith[B >: A](that: collection.Iterable[B]): Boolean
  69.  def enqueue(elem1: A, elem2: A, elems: A*): Queue.this.type
  70.  def enqueue(elem: A): Queue.this.type
  71.  def enqueueAll(elems: IterableOnce[A]): Queue.this.type
  72.  def ensureSize(hint: Int): Unit
  73.  def ensuring(cond: (Queue[A]) => Boolean, msg: => Any): Queue[A]
  74.  def ensuring(cond: (Queue[A]) => Boolean): Queue[A]
  75.  def ensuring(cond: Boolean, msg: => Any): Queue[A]
  76.  def ensuring(cond: Boolean): Queue[A]
  77.  final def eq(arg0: AnyRef): Boolean
  78.  def equals(o: Any): Boolean
  79.  def exists(p: (A) => Boolean): Boolean
  80.  def filter(pred: (A) => Boolean): Queue[A]
  81.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): Queue[A]
  82.  def filterInPlace(p: (A) => Boolean): Queue.this.type
  83.  def filterNot(pred: (A) => Boolean): Queue[A]
  84.  def finalize(): Unit
  85.  def find(p: (A) => Boolean): Option[A]
  86.  def findLast(p: (A) => Boolean): Option[A]
  87.  def flatMap[B](f: (A) => IterableOnce[B]): Queue[B]
  88.  def flatMapInPlace(f: (A) => IterableOnce[A]): Queue.this.type
  89.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Queue[B]
  90.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  91.  def foldLeft[B](z: B)(op: (B, A) => B): B
  92.  def foldRight[B](z: B)(op: (A, B) => B): B
  93.  def forall(p: (A) => Boolean): Boolean
  94.  def foreach[U](f: (A) => U): Unit
  95.  def fromSpecific(coll: IterableOnce[A]): Queue[A]
  96.  final def front: A
  97.  final def getClass(): Class[_ <: AnyRef]
  98.  def groupBy[K](f: (A) => K): immutable.Map[K, Queue[A]]
  99.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, Queue[B]]
  100.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  101.  def grouped(n: Int): Iterator[Queue[A]]
  102.  def hashCode(): Int
  103.  def head: A
  104.  def headOption: Option[A]
  105.  def indexOf[B >: A](elem: B): Int
  106.  def indexOf[B >: A](elem: B, from: Int): Int
  107.  def indexOfSlice[B >: A](that: collection.Seq[B]): Int
  108.  def indexOfSlice[B >: A](that: collection.Seq[B], from: Int): Int
  109.  def indexWhere(p: (A) => Boolean): Int
  110.  def indexWhere(p: (A) => Boolean, from: Int): Int
  111.  def indices: immutable.Range
  112.  def init: Queue[A]
  113.  def inits: Iterator[Queue[A]]
  114.  def insert(idx: Int, elem: A): Unit
  115.  def insertAll(idx: Int, elems: IterableOnce[A]): Unit
  116.  def intersect[B >: A](that: collection.Seq[B]): Queue[A]
  117.  def isDefinedAt(idx: Int): Boolean
  118.  def isEmpty: Boolean
  119.  final def isInstanceOf[T0]: Boolean
  120.  def isTraversableAgain: Boolean
  121.  def iterableFactory: SeqFactory[Queue]
  122.  def iterator: Iterator[A]
  123.  def klone(): Queue[A]
  124.  def knownSize: Int
  125.  def last: A
  126.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
  127.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
  128.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
  129.  def lastIndexWhere(p: (A) => Boolean): Int
  130.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
  131.  def lastOption: Option[A]
  132.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, Queue.this.type]
  133.  def length: Int
  134.  final def lengthCompare(that: collection.Iterable[_]): Int
  135.  final def lengthCompare(len: Int): Int
  136.  final def lengthIs: SizeCompareOps
  137.  def lift: (Int) => Option[A]
  138.  def map[B](f: (A) => B): Queue[B]
  139.  def mapInPlace(f: (A) => A): Queue.this.type
  140.  def max[B >: A](implicit ord: math.Ordering[B]): A
  141.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  142.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  143.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  144.  def min[B >: A](implicit ord: math.Ordering[B]): A
  145.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  146.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  147.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  148.  final def mkString: String
  149.  final def mkString(sep: String): String
  150.  final def mkString(start: String, sep: String, end: String): String
  151.  final def ne(arg0: AnyRef): Boolean
  152.  def newSpecificBuilder: Builder[A, Queue[A]]
  153.  def nonEmpty: Boolean
  154.  final def notify(): Unit
  155.  final def notifyAll(): Unit
  156.  def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
  157.  def ofArray(array: Array[AnyRef], end: Int): Queue[A]
  158.  def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  159.  def padTo[B >: A](len: Int, elem: B): Queue[B]
  160.  def padToInPlace(len: Int, elem: A): Queue.this.type
  161.  def partition(p: (A) => Boolean): (Queue[A], Queue[A])
  162.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Queue[A1], Queue[A2])
  163.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): Queue[B]
  164.  def patchInPlace(from: Int, patch: IterableOnce[A], replaced: Int): Queue.this.type
  165.  def permutations: Iterator[Queue[A]]
  166.  def prepend(elem: A): Queue.this.type
  167.  def prependAll(elems: IterableOnce[A]): Queue.this.type
  168.  def prepended[B >: A](elem: B): Queue[B]
  169.  def prependedAll[B >: A](prefix: IterableOnce[B]): Queue[B]
  170.  def product[B >: A](implicit num: math.Numeric[B]): B
  171.  def reduce[B >: A](op: (B, B) => B): B
  172.  def reduceLeft[B >: A](op: (B, A) => B): B
  173.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  174.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  175.  def reduceRight[B >: A](op: (A, B) => B): B
  176.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  177.  def remove(idx: Int): A
  178.  def remove(idx: Int, count: Int): Unit
  179.  def removeAll(p: (A) => Boolean): immutable.Seq[A]
  180.  def removeAll(): immutable.Seq[A]
  181.  def removeAllReverse(): immutable.Seq[A]
  182.  def removeFirst(p: (A) => Boolean, from: Int = 0): Option[A]
  183.  def removeHead(resizeInternalRepr: Boolean = false): A
  184.  def removeHeadOption(resizeInternalRepr: Boolean = false): Option[A]
  185.  def removeHeadWhile(f: (A) => Boolean): immutable.Seq[A]
  186.  def removeLast(resizeInternalRepr: Boolean = false): A
  187.  def removeLastOption(resizeInternalRepr: Boolean = false): Option[A]
  188.  def removeLastWhile(f: (A) => Boolean): immutable.Seq[A]
  189.  final def requireBounds(idx: Int, until: Int = length): Unit
  190.  def reverse: Queue[A]
  191.  def reverseIterator: Iterator[A]
  192.  def reversed: collection.Iterable[A]
  193.  def runWith[U](action: (A) => U): (Int) => Boolean
  194.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  195.  def scan[B >: A](z: B)(op: (B, B) => B): Queue[B]
  196.  def scanLeft[B](z: B)(op: (B, A) => B): Queue[B]
  197.  def scanRight[B](z: B)(op: (A, B) => B): Queue[B]
  198.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
  199.  def search[B >: A](elem: B)(implicit ord: math.Ordering[B]): SearchResult
  200.  def segmentLength(p: (A) => Boolean, from: Int): Int
  201.  final def segmentLength(p: (A) => Boolean): Int
  202.  final def size: Int
  203.  final def sizeCompare(that: collection.Iterable[_]): Int
  204.  final def sizeCompare(otherSize: Int): Int
  205.  final def sizeIs: SizeCompareOps
  206.  def slice(from: Int, until: Int): Queue[A]
  207.  def sliceInPlace(start: Int, end: Int): Queue.this.type
  208.  def sliding(window: Int, step: Int): Iterator[Queue[A]]
  209.  def sliding(size: Int): Iterator[Queue[A]]
  210.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): Queue[A]
  211.  def sortInPlace[B >: A]()(implicit ord: Ordering[B]): Queue.this.type
  212.  def sortInPlaceBy[B](f: (A) => B)(implicit ord: Ordering[B]): Queue.this.type
  213.  def sortInPlaceWith(lt: (A, A) => Boolean): Queue.this.type
  214.  def sortWith(lt: (A, A) => Boolean): Queue[A]
  215.  def sorted[B >: A](implicit ord: Ordering[B]): Queue[A]
  216.  def span(p: (A) => Boolean): (Queue[A], Queue[A])
  217.  def splitAt(n: Int): (Queue[A], Queue[A])
  218.  def start_+(idx: Int): Int
  219.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
  220.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
  221.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
  222.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  223.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
  224.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
  225.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
  226.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
  227.  def stringPrefix: String
  228.  def subtractAll(xs: IterableOnce[A]): Queue.this.type
  229.  def subtractOne(elem: A): Queue.this.type
  230.  def sum[B >: A](implicit num: math.Numeric[B]): B
  231.  final def synchronized[T0](arg0: => T0): T0
  232.  def tail: Queue[A]
  233.  def tails: Iterator[Queue[A]]
  234.  def take(n: Int): Queue[A]
  235.  def takeInPlace(n: Int): Queue.this.type
  236.  def takeRight(n: Int): Queue[A]
  237.  def takeRightInPlace(n: Int): Queue.this.type
  238.  def takeWhile(p: (A) => Boolean): Queue[A]
  239.  def takeWhileInPlace(p: (A) => Boolean): Queue.this.type
  240.  def tapEach[U](f: (A) => U): Queue[A]
  241.  def to[C1](factory: Factory[A, C1]): C1
  242.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  243.  final def toBuffer[B >: A]: Buffer[B]
  244.  def toIndexedSeq: immutable.IndexedSeq[A]
  245.  def toList: immutable.List[A]
  246.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  247.  def toSeq: immutable.Seq[A]
  248.  def toSet[B >: A]: immutable.Set[B]
  249.  def toString(): String
  250.  def toVector: immutable.Vector[A]
  251.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Queue[Queue[B]]
  252.  def trimToSize(): Unit
  253.  def unapply(a: Int): Option[A]
  254.  def unlift: PartialFunction[Int, B]
  255.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Queue[A1], Queue[A2])
  256.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Queue[A1], Queue[A2], Queue[A3])
  257.  def update(idx: Int, elem: A): Unit
  258.  def updated[B >: A](index: Int, elem: B): Queue[B]
  259.  def view: IndexedSeqView[A]
  260.  final def wait(): Unit
  261.  final def wait(arg0: Long, arg1: Int): Unit
  262.  final def wait(arg0: Long): Unit
  263.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]Queue[_]]
  264.  def writeReplace(): AnyRef
  265.  def zip[B](that: IterableOnce[B]): Queue[(A, B)]
  266.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Queue[(A1, B)]
  267.  def zipWithIndex: Queue[(A, Int)]
Deprecated Value Members
  1.  final def +=(elem1: A, elem2: A, elems: A*): Queue.this.type
  2.  def -=(elem1: A, elem2: A, elems: A*): Queue.this.type
  3.  def /:[B](z: B)(op: (B, A) => B): B
  4.  final def /:[B](z: B)(op: (B, A) => B): B
  5.  def :\[B](z: B)(op: (A, B) => B): B
  6.  final def :\[B](z: B)(op: (A, B) => B): B
  7.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
  8.  final def append(elems: A*): Queue.this.type
  9.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
  10.  def companion: IterableFactory[[_]Queue[_]]
  11.  def copyToBuffer(dest: Buffer[A]): Unit
  12.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
  13.  def count(f: (A) => Boolean): Int
  14.  def exists(f: (A) => Boolean): Boolean
  15.  def filter(f: (A) => Boolean): Iterator[A]
  16.  def find(p: (A) => Boolean): Option[A]
  17.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
  18.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  19.  def foldLeft[B](z: B)(op: (B, A) => B): B
  20.  def foldRight[B](z: B)(op: (A, B) => B): B
  21.  def forall(f: (A) => Boolean): Boolean
  22.  def foreach[U](f: (A) => U): Unit
  23.  def formatted(fmtstr: String): String
  24.  def hasDefiniteSize: Boolean
  25.  def isEmpty: Boolean
  26.  def map[B](f: (A) => B): IterableOnce[B]
  27.  def max(implicit ord: math.Ordering[A]): A
  28.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  29.  def min(implicit ord: math.Ordering[A]): A
  30.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  31.  def mkString: String
  32.  def mkString(sep: String): String
  33.  def mkString(start: String, sep: String, end: String): String
  34.  def nonEmpty: Boolean
  35.  final def prefixLength(p: (A) => Boolean): Int
  36.  final def prepend(elems: A*): Queue.this.type
  37.  def product(implicit num: math.Numeric[A]): A
  38.  def reduce(f: (A, A) => A): A
  39.  def reduceLeft(f: (A, A) => A): A
  40.  def reduceLeftOption(f: (A, A) => A): Option[A]
  41.  def reduceOption(f: (A, A) => A): Option[A]
  42.  def reduceRight(f: (A, A) => A): A
  43.  def reduceRightOption(f: (A, A) => A): Option[A]
  44.  final def repr: Queue[A]
  45.  def reverseMap[B](f: (A) => B): Queue[B]
  46.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  47.  def seq: Queue.this.type
  48.  def size: Int
  49.  def sum(implicit num: math.Numeric[A]): A
  50.  def to[C1](factory: Factory[A, C1]): C1
  51.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  52.  def toBuffer[B >: A]: Buffer[B]
  53.  def toIndexedSeq: collection.IndexedSeq[A]
  54.  final def toIterable: collection.Iterable[A]
  55.  final def toIterable: Queue.this.type
  56.  def toIterator: Iterator[A]
  57.  final def toIterator: Iterator[A]
  58.  def toList: immutable.List[A]
  59.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  60.  def toSeq: immutable.Seq[A]
  61.  def toSet[B >: A]: immutable.Set[B]
  62.  def toStream: immutable.Stream[A]
  63.  final def toStream: immutable.Stream[A]
  64.  final def toTraversable: collection.Traversable[A]
  65.  final def toTraversable: collection.Traversable[A]
  66.  def toVector: immutable.Vector[A]
  67.  final def transform(f: (A) => A): Queue.this.type
  68.  def trimEnd(n: Int): Unit
  69.  def trimStart(n: Int): Unit
  70.  final def union[B >: A](that: collection.Seq[B]): Queue[B]
  71.  def view(from: Int, until: Int): IndexedSeqView[A]
  72.  def withFilter(f: (A) => Boolean): Iterator[A]
  73.  def →[B](y: B): (Queue[A], B)
Inherited from (Int) => A

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4