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

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

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



1. Alphabetic
2. By Inheritance

1. Queue
2. DefaultSerializable
3. Serializable
4. StrictOptimizedSeqOps
5. StrictOptimizedLinearSeqOps
6. StrictOptimizedSeqOps
7. StrictOptimizedIterableOps
8. LinearSeq
9. LinearSeqOps
10. LinearSeq
11. LinearSeqOps
12. AbstractSeq
13. Seq
14. SeqOps
15. Iterable
16. AbstractSeq
17. Seq
18. Equals
19. SeqOps
20. PartialFunction
21. Function1
22. AbstractIterable
23. Iterable
24. IterableFactoryDefaults
25. IterableOps
26. IterableOnceOps
27. IterableOnce
28. AnyRef
29. Any

1. by UnliftOps
2. by iterableOnceExtensionMethods
3. by any2stringadd
4. by StringFormat
5. by Ensuring
6. by ArrowAssoc

1. Public
2. Protected

1.  new Queue(in: List[A], out: List[A])

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 +:[B >: A](elem: B): Queue[B]
7.  def ->[B](y: B): (Queue[A], B)
8.  final def :+[B >: A](elem: B): Queue[B]
9.  final def :++[B >: A](suffix: IterableOnce[B]): Queue[B]
10.  final def ==(arg0: Any): Boolean
11.  final def addString(b: mutable.StringBuilder): b.type
12.  final def addString(b: mutable.StringBuilder, sep: String): b.type
13.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type
14.  def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
15.  def andThen[C](k: (A) => C): PartialFunction[Int, C]
16.  def appended[B >: A](elem: B): Queue[B]
17.  def appendedAll[B >: A](that: IterableOnce[B]): Queue[B]
18.  def apply(n: Int): A
19.  def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
20.  final def asInstanceOf[T0]: T0
21.  def canEqual(that: Any): Boolean
22.  def className: String
23.  def clone(): AnyRef
24.  final def coll: Queue.this.type
25.  def collect[B](pf: PartialFunction[A, B]): Queue[B]
26.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
27.  def combinations(n: Int): Iterator[Queue[A]]
28.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
29.  def compose[A](g: (A) => Int): (A) => A
30.  final def concat[B >: A](suffix: IterableOnce[B]): Queue[B]
31.  def contains[A1 >: A](elem: A1): Boolean
32.  def containsSlice[B >: A](that: collection.Seq[B]): Boolean
33.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
34.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
35.  def copyToArray[B >: A](xs: Array[B]): Int
36.  def corresponds[B](that: collection.Seq[B])(p: (A, B) => Boolean): Boolean
37.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
38.  def count(p: (A) => Boolean): Int
39.  def dequeue: (A, Queue[A])
40.  def dequeueOption: Option[(A, Queue[A])]
41.  def diff[B >: A](that: collection.Seq[B]): Queue[A]
42.  def distinct: Queue[A]
43.  def distinctBy[B](f: (A) => B): Queue[A]
44.  def drop(n: Int): Queue[A]
45.  def dropRight(n: Int): Queue[A]
46.  def dropWhile(p: (A) => Boolean): Queue[A]
47.  def elementWise: ElementWiseExtractor[Int, A]
48.  def empty: Queue[A]
49.  def endsWith[B >: A](that: collection.Iterable[B]): Boolean
50.  def enqueue[B >: A](elem: B): Queue[B]
51.  def enqueueAll[B >: A](iter: collection.Iterable[B]): Queue[B]
52.  def ensuring(cond: (Queue[A]) => Boolean, msg: => Any): Queue[A]
53.  def ensuring(cond: (Queue[A]) => Boolean): Queue[A]
54.  def ensuring(cond: Boolean, msg: => Any): Queue[A]
55.  def ensuring(cond: Boolean): Queue[A]
56.  final def eq(arg0: AnyRef): Boolean
57.  def equals(o: Any): Boolean
58.  def exists(p: (A) => Boolean): Boolean
59.  def filter(pred: (A) => Boolean): Queue[A]
60.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): Queue[A]
61.  def filterNot(pred: (A) => Boolean): Queue[A]
62.  def finalize(): Unit
63.  def find(p: (A) => Boolean): Option[A]
64.  def findLast(p: (A) => Boolean): Option[A]
65.  def flatMap[B](f: (A) => IterableOnce[B]): Queue[B]
66.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Queue[B]
67.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
68.  def foldLeft[B](z: B)(op: (B, A) => B): B
69.  def foldRight[B](z: B)(op: (A, B) => B): B
70.  def forall(p: (A) => Boolean): Boolean
71.  def foreach[U](f: (A) => U): Unit
72.  def fromSpecific(coll: IterableOnce[A]): Queue[A]
73.  def front: A
74.  final def getClass(): Class[_ <: AnyRef]
75.  def groupBy[K](f: (A) => K): Map[K, Queue[A]]
76.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Queue[B]]
77.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
78.  def grouped(size: Int): Iterator[Queue[A]]
79.  def hashCode(): Int
80.  def head: A
81.  def headOption: Option[A]
82.  val in: List[A]
83.  def indexOf[B >: A](elem: B): Int
84.  def indexOf[B >: A](elem: B, from: Int): Int
85.  def indexOfSlice[B >: A](that: collection.Seq[B]): Int
86.  def indexOfSlice[B >: A](that: collection.Seq[B], from: Int): Int
87.  def indexWhere(p: (A) => Boolean, from: Int): Int
88.  def indexWhere(p: (A) => Boolean): Int
89.  def indices: Range
90.  def init: Queue[A]
91.  def inits: Iterator[Queue[A]]
92.  def intersect[B >: A](that: collection.Seq[B]): Queue[A]
93.  def isDefinedAt(x: Int): Boolean
94.  def isEmpty: Boolean
95.  final def isInstanceOf[T0]: Boolean
96.  def isTraversableAgain: Boolean
97.  def iterableFactory: SeqFactory[Queue]
98.  def iterator: Iterator[A]
99.  def knownSize: Int
100.  def last: A
101.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
102.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
103.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
104.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
105.  def lastIndexWhere(p: (A) => Boolean): Int
106.  def lastOption: Option[A]
107.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, Queue.this.type]
108.  def length: Int
109.  def lengthCompare(that: collection.Iterable[_]): Int
110.  def lengthCompare(len: Int): Int
111.  final def lengthIs: SizeCompareOps
112.  def lift: (Int) => Option[A]
113.  def map[B](f: (A) => B): Queue[B]
114.  def max[B >: A](implicit ord: math.Ordering[B]): A
115.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
116.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
117.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
118.  def min[B >: A](implicit ord: math.Ordering[B]): A
119.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
120.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
121.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
122.  final def mkString: String
123.  final def mkString(sep: String): String
124.  final def mkString(start: String, sep: String, end: String): String
125.  final def ne(arg0: AnyRef): Boolean
126.  def newSpecificBuilder: Builder[A, Queue[A]]
127.  def nonEmpty: Boolean
128.  final def notify(): Unit
129.  final def notifyAll(): Unit
130.  def occCounts[B](sq: collection.Seq[B]): mutable.Map[B, Int]
131.  def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
132.  val out: List[A]
133.  def padTo[B >: A](len: Int, elem: B): Queue[B]
134.  def partition(p: (A) => Boolean): (Queue[A], Queue[A])
135.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Queue[A1], Queue[A2])
136.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): Queue[B]
137.  def permutations: Iterator[Queue[A]]
138.  def prepended[B >: A](elem: B): Queue[B]
139.  def prependedAll[B >: A](prefix: IterableOnce[B]): Queue[B]
140.  def product[B >: A](implicit num: math.Numeric[B]): B
141.  def reduce[B >: A](op: (B, B) => B): B
142.  def reduceLeft[B >: A](op: (B, A) => B): B
143.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
144.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
145.  def reduceRight[B >: A](op: (A, B) => B): B
146.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
147.  def reverse: Queue[A]
148.  def reverseIterator: Iterator[A]
149.  def reversed: collection.Iterable[A]
150.  def runWith[U](action: (A) => U): (Int) => Boolean
151.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
152.  def scan[B >: A](z: B)(op: (B, B) => B): Queue[B]
153.  def scanLeft[B](z: B)(op: (B, A) => B): Queue[B]
154.  def scanRight[B](z: B)(op: (A, B) => B): Queue[B]
155.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
156.  def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
157.  def segmentLength(p: (A) => Boolean, from: Int): Int
158.  final def segmentLength(p: (A) => Boolean): Int
159.  final def size: Int
160.  final def sizeCompare(that: collection.Iterable[_]): Int
161.  final def sizeCompare(otherSize: Int): Int
162.  final def sizeIs: SizeCompareOps
163.  def slice(from: Int, until: Int): Queue[A]
164.  def sliding(size: Int, step: Int): Iterator[Queue[A]]
165.  def sliding(size: Int): Iterator[Queue[A]]
166.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): Queue[A]
167.  def sortWith(lt: (A, A) => Boolean): Queue[A]
168.  def sorted[B >: A](implicit ord: Ordering[B]): Queue[A]
169.  def span(p: (A) => Boolean): (Queue[A], Queue[A])
170.  def splitAt(n: Int): (Queue[A], Queue[A])
171.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
172.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
173.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
174.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
175.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
176.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
177.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
178.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
179.  def stringPrefix: String
180.  def sum[B >: A](implicit num: math.Numeric[B]): B
181.  final def synchronized[T0](arg0: => T0): T0
182.  def tail: Queue[A]
183.  def tails: Iterator[Queue[A]]
184.  def take(n: Int): Queue[A]
185.  def takeRight(n: Int): Queue[A]
186.  def takeWhile(p: (A) => Boolean): Queue[A]
187.  def tapEach[U](f: (A) => U): Queue[A]
188.  def to[C1](factory: Factory[A, C1]): C1
189.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
190.  final def toBuffer[B >: A]: Buffer[B]
191.  def toIndexedSeq: IndexedSeq[A]
192.  def toList: List[A]
193.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
194.  final def toSeq: Queue.this.type
195.  def toSet[B >: A]: Set[B]
196.  def toString(): String
197.  def toVector: Vector[A]
198.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Queue[Queue[B]]
199.  def unapply(a: Int): Option[A]
200.  def unlift: PartialFunction[Int, B]
201.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Queue[A1], Queue[A2])
202.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Queue[A1], Queue[A2], Queue[A3])
203.  def updated[B >: A](index: Int, elem: B): Queue[B]
204.  def view: SeqView[A]
205.  final def wait(): Unit
206.  final def wait(arg0: Long, arg1: Int): Unit
207.  final def wait(arg0: Long): Unit
208.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]Queue[_]]
209.  def writeReplace(): AnyRef
210.  def zip[B](that: IterableOnce[B]): Queue[(A, B)]
211.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Queue[(A1, B)]
212.  def zipWithIndex: Queue[(A, Int)]

1.  def /:[B](z: B)(op: (B, A) => B): B
2.  final def /:[B](z: B)(op: (B, A) => B): B
3.  def :\[B](z: B)(op: (A, B) => B): B
4.  final def :\[B](z: B)(op: (A, B) => B): B
5.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
6.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
7.  def companion: IterableFactory[[_]Queue[_]]
8.  def copyToBuffer(dest: Buffer[A]): Unit
9.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
10.  def count(f: (A) => Boolean): Int
11.  final def enqueue[B >: A](iter: collection.Iterable[B]): Queue[B]
12.  def exists(f: (A) => Boolean): Boolean
13.  def filter(f: (A) => Boolean): Iterator[A]
14.  def find(p: (A) => Boolean): Option[A]
15.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
16.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
17.  def foldLeft[B](z: B)(op: (B, A) => B): B
18.  def foldRight[B](z: B)(op: (A, B) => B): B
19.  def forall(f: (A) => Boolean): Boolean
20.  def foreach[U](f: (A) => U): Unit
21.  def formatted(fmtstr: String): String
22.  def hasDefiniteSize: Boolean
23.  def isEmpty: Boolean
24.  def map[B](f: (A) => B): IterableOnce[B]
25.  def max(implicit ord: math.Ordering[A]): A
26.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
27.  def min(implicit ord: math.Ordering[A]): A
28.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
29.  def mkString: String
30.  def mkString(sep: String): String
31.  def mkString(start: String, sep: String, end: String): String
32.  def nonEmpty: Boolean
33.  final def prefixLength(p: (A) => Boolean): Int
34.  def product(implicit num: math.Numeric[A]): A
35.  def reduce(f: (A, A) => A): A
36.  def reduceLeft(f: (A, A) => A): A
37.  def reduceLeftOption(f: (A, A) => A): Option[A]
38.  def reduceOption(f: (A, A) => A): Option[A]
39.  def reduceRight(f: (A, A) => A): A
40.  def reduceRightOption(f: (A, A) => A): Option[A]
41.  final def repr: Queue[A]
42.  def reverseMap[B](f: (A) => B): Queue[B]
43.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
44.  def seq: Queue.this.type
45.  def size: Int
46.  def sum(implicit num: math.Numeric[A]): A
47.  def to[C1](factory: Factory[A, C1]): C1
48.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
49.  def toBuffer[B >: A]: Buffer[B]
50.  def toIndexedSeq: collection.IndexedSeq[A]
51.  final def toIterable: collection.Iterable[A]
52.  final def toIterable: Queue.this.type
53.  def toIterator: Iterator[A]
54.  final def toIterator: Iterator[A]
55.  def toList: List[A]
56.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
57.  def toSeq: Seq[A]
58.  def toSet[B >: A]: Set[B]
59.  def toStream: Stream[A]
60.  final def toStream: Stream[A]
61.  final def toTraversable: collection.Traversable[A]
62.  final def toTraversable: collection.Traversable[A]
63.  def toVector: Vector[A]
64.  final def union[B >: A](that: collection.Seq[B]): Queue[B]
65.  def view(from: Int, until: Int): View[A]
66.  def withFilter(f: (A) => Boolean): Iterator[A]
67.  def →[B](y: B): (Queue[A], B)

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