object Queue extends StrictOptimizedSeqFactory[Queue]
This object provides a set of operations to create immutable.Queue
values.
- Annotations
- @SerialVersionUID()
- Source
- Queue.scala
- Alphabetic
- By Inheritance
- Queue
- StrictOptimizedSeqFactory
- SeqFactory
- IterableFactory
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- def apply[A](xs: A*): Queue[A]
Creates a immutable queue with the specified elements.
Creates a immutable queue with the specified elements.
- A
the type of the immutable queue's elements
- returns
a new immutable queue with elements
elems
- Definition Classes
- Queue → IterableFactory
- def concat[A](xss: collection.Iterable[A]*): Queue[A]
Concatenates all argument collections into a single immutable queue.
Concatenates all argument collections into a single immutable queue.
- xss
the collections that are to be concatenated.
- returns
the concatenation of all the collections.
- Definition Classes
- StrictOptimizedSeqFactory → IterableFactory
- def empty[A]: Queue[A]
An empty collection
An empty collection
- A
the type of the immutable queue's elements
- Definition Classes
- Queue → IterableFactory
- def fill[A](n: Int)(elem: => A): Queue[A]
Produces a immutable queue containing the results of some element computation a number of times.
Produces a immutable queue containing the results of some element computation a number of times.
- n
the number of elements contained in the immutable queue.
- elem
the element computation
- returns
A immutable queue that contains the results of
n
evaluations ofelem
.
- Definition Classes
- StrictOptimizedSeqFactory → IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): Queue[Queue[Queue[Queue[Queue[A]]]]]
Produces a five-dimensional immutable queue containing the results of some element computation a number of times.
Produces a five-dimensional immutable queue containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- n5
the number of elements in the 5th dimension
- elem
the element computation
- returns
A immutable queue that contains the results of
n1 x n2 x n3 x n4 x n5
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: => A): Queue[Queue[Queue[Queue[A]]]]
Produces a four-dimensional immutable queue containing the results of some element computation a number of times.
Produces a four-dimensional immutable queue containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- elem
the element computation
- returns
A immutable queue that contains the results of
n1 x n2 x n3 x n4
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int)(elem: => A): Queue[Queue[Queue[A]]]
Produces a three-dimensional immutable queue containing the results of some element computation a number of times.
Produces a three-dimensional immutable queue containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- elem
the element computation
- returns
A immutable queue that contains the results of
n1 x n2 x n3
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n1: Int, n2: Int)(elem: => A): Queue[Queue[A]]
Produces a two-dimensional immutable queue containing the results of some element computation a number of times.
Produces a two-dimensional immutable queue containing the results of some element computation a number of times.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- elem
the element computation
- returns
A immutable queue that contains the results of
n1 x n2
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def from[A](source: IterableOnce[A]): Queue[A]
Creates a target immutable queue from an existing source collection
Creates a target immutable queue from an existing source collection
- A
the type of the collection’s elements
- source
Source collection
- returns
a new immutable queue with the elements of
source
- Definition Classes
- Queue → IterableFactory
- implicit def iterableFactory[A]: Factory[A, Queue[A]]
- Definition Classes
- IterableFactory
- def iterate[A](start: A, len: Int)(f: (A) => A): Queue[A]
Produces a immutable queue containing repeated applications of a function to a start value.
Produces a immutable queue containing repeated applications of a function to a start value.
- start
the start value of the immutable queue
- len
the number of elements contained in the immutable queue
- f
the function that's repeatedly applied
- returns
a immutable queue with
len
values in the sequencestart, f(start), f(f(start)), ...
- Definition Classes
- IterableFactory
- def newBuilder[A]: Builder[A, Queue[A]]
- A
the type of the immutable queue’s elements
- returns
A builder for
immutable.Queue
objects.
- Definition Classes
- Queue → IterableFactory
- def range[A](start: A, end: A, step: A)(implicit arg0: Integral[A]): Queue[A]
Produces a immutable queue containing equally spaced values in some integer interval.
Produces a immutable queue containing equally spaced values in some integer interval.
- start
the start value of the immutable queue
- end
the end value of the immutable queue (the first value NOT contained)
- step
the difference between successive elements of the immutable queue (must be positive or negative)
- returns
a immutable queue with values
start, start + step, ...
up to, but excludingend
- Definition Classes
- IterableFactory
- def range[A](start: A, end: A)(implicit arg0: Integral[A]): Queue[A]
Produces a immutable queue containing a sequence of increasing of integers.
Produces a immutable queue containing a sequence of increasing of integers.
- start
the first element of the immutable queue
- end
the end value of the immutable queue (the first value NOT contained)
- returns
a immutable queue with values
start, start + 1, ..., end - 1
- Definition Classes
- IterableFactory
- def tabulate[A](n: Int)(f: (Int) => A): Queue[A]
Produces a immutable queue containing values of a given function over a range of integer values starting from 0.
Produces a immutable queue containing values of a given function over a range of integer values starting from 0.
- n
The number of elements in the immutable queue
- f
The function computing element values
- returns
A immutable queue consisting of elements
f(0), ..., f(n -1)
- Definition Classes
- StrictOptimizedSeqFactory → IterableFactory
- def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) => A): Queue[Queue[Queue[Queue[Queue[A]]]]]
Produces a five-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
Produces a five-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- n5
the number of elements in the 5th dimension
- f
The function computing element values
- returns
A immutable queue consisting of elements
f(i1, i2, i3, i4, i5)
for0 <= i1 < n1
,0 <= i2 < n2
,0 <= i3 < n3
,0 <= i4 < n4
, and0 <= i5 < n5
.
- Definition Classes
- IterableFactory
- def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) => A): Queue[Queue[Queue[Queue[A]]]]
Produces a four-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
Produces a four-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- n4
the number of elements in the 4th dimension
- f
The function computing element values
- returns
A immutable queue consisting of elements
f(i1, i2, i3, i4)
for0 <= i1 < n1
,0 <= i2 < n2
,0 <= i3 < n3
, and0 <= i4 < n4
.
- Definition Classes
- IterableFactory
- def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) => A): Queue[Queue[Queue[A]]]
Produces a three-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
Produces a three-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- n3
the number of elements in the 3rd dimension
- f
The function computing element values
- returns
A immutable queue consisting of elements
f(i1, i2, i3)
for0 <= i1 < n1
,0 <= i2 < n2
, and0 <= i3 < n3
.
- Definition Classes
- IterableFactory
- def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) => A): Queue[Queue[A]]
Produces a two-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
Produces a two-dimensional immutable queue containing values of a given function over ranges of integer values starting from 0.
- n1
the number of elements in the 1st dimension
- n2
the number of elements in the 2nd dimension
- f
The function computing element values
- returns
A immutable queue consisting of elements
f(i1, i2)
for0 <= i1 < n1
and0 <= i2 < n2
.
- Definition Classes
- IterableFactory
- final def unapplySeq[A](x: Queue[A]): UnapplySeqWrapper[A]
- Definition Classes
- SeqFactory
- def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): Queue[A]
Produces a immutable queue that uses a function
f
to produce elements of typeA
and update an internal state of typeS
.Produces a immutable queue that uses a function
f
to produce elements of typeA
and update an internal state of typeS
.- A
Type of the elements
- S
Type of the internal state
- init
State initial value
- f
Computes the next element (or returns
None
to signal the end of the collection)- returns
a immutable queue that produces elements using
f
untilf
returnsNone
- Definition Classes
- IterableFactory
This is the documentation for the Scala standard library.
Package structure
The scala package contains core types like
Int
,Float
,Array
orOption
which are accessible in all Scala compilation units without explicit qualification or imports.Notable packages include:
scala.collection
and its sub-packages contain Scala's collections frameworkscala.collection.immutable
- Immutable, sequential data-structures such asVector
,List
,Range
,HashMap
orHashSet
scala.collection.mutable
- Mutable, sequential data-structures such asArrayBuffer
,StringBuilder
,HashMap
orHashSet
scala.collection.concurrent
- Mutable, concurrent data-structures such asTrieMap
scala.concurrent
- Primitives for concurrent programming such asFutures
andPromises
scala.io
- Input and output operationsscala.math
- Basic math functions and additional numeric types likeBigInt
andBigDecimal
scala.sys
- Interaction with other processes and the operating systemscala.util.matching
- Regular expressionsOther packages exist. See the complete list on the right.
Additional parts of the standard library are shipped as separate libraries. These include:
scala.reflect
- Scala's reflection API (scala-reflect.jar)scala.xml
- XML parsing, manipulation, and serialization (scala-xml.jar)scala.collection.parallel
- Parallel collections (scala-parallel-collections.jar)scala.util.parsing
- Parser combinators (scala-parser-combinators.jar)scala.swing
- A convenient wrapper around Java's GUI framework called Swing (scala-swing.jar)Automatic imports
Identifiers in the scala package and the
scala.Predef
object are always in scope by default.Some of these identifiers are type aliases provided as shortcuts to commonly used classes. For example,
List
is an alias forscala.collection.immutable.List
.Other aliases refer to classes provided by the underlying platform. For example, on the JVM,
String
is an alias forjava.lang.String
.