object LazyList extends SeqFactory[LazyList]
This object provides a set of operations to create LazyList
values.
- Annotations
- @SerialVersionUID()
- Source
- LazyList.scala
- Alphabetic
- By Inheritance
- LazyList
- SeqFactory
- IterableFactory
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- final class Deferrer[A] extends AnyVal
- final class SerializationProxy[A] extends Serializable
This serialization proxy is used for LazyLists which start with a sequence of evaluated cons cells.
This serialization proxy is used for LazyLists which start with a sequence of evaluated cons cells. The forced sequence is serialized in a compact, sequential format, followed by the unevaluated tail, which uses standard Java serialization to store the complete structure of unevaluated thunks. This allows the serialization of long evaluated lazy lists without exhausting the stack through recursive serialization of cons cells.
- Annotations
- @SerialVersionUID()
Value Members
- final def !=(arg0: Any): Boolean
Test two objects for inequality.
Test two objects for inequality.
- returns
true
if !(this == that), false otherwise.
- Definition Classes
- AnyRef → Any
- final def ##: Int
Equivalent to
x.hashCode
except for boxed numeric types andnull
.Equivalent to
x.hashCode
except for boxed numeric types andnull
. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. Fornull
returns a hashcode wherenull.hashCode
throws aNullPointerException
.- returns
a hash value consistent with ==
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
The expression
x == that
is equivalent toif (x eq null) that eq null else x.equals(that)
.The expression
x == that
is equivalent toif (x eq null) that eq null else x.equals(that)
.- returns
true
if the receiver object is equivalent to the argument;false
otherwise.
- Definition Classes
- AnyRef → Any
- def apply[A](elems: A*): LazyList[A]
Creates a lazy list with the specified elements.
Creates a lazy list with the specified elements.
- A
the type of the lazy list's elements
- elems
the elements of the created lazy list
- returns
a new lazy list with elements
elems
- Definition Classes
- IterableFactory
- final def asInstanceOf[T0]: T0
Forces the compiler to treat the receiver object as having type
T0
, even though doing so may violate type safety.Forces the compiler to treat the receiver object as having type
T0
, even though doing so may violate type safety.This method is useful when you believe you have type information the compiler doesn't, and it also isn't possible to check the type at runtime. In such situations, skipping type safety is the only option.
It is platform dependent whether
asInstanceOf
has any effect at runtime. It might do a runtime type test on the erasure ofT0
, insert a conversion (such as boxing/unboxing), fill in a default value, or do nothing at all.In particular,
asInstanceOf
is not a type test. It does **not** mean:this match { case x: T0 => x case _ => throw ClassCastException("...")
Use pattern matching or isInstanceOf for type testing instead.
Situations where
asInstanceOf
is useful:- when flow analysis fails to deduce
T0
automatically - when down-casting a type parameter or an abstract type member (which cannot be checked at runtime due to type erasure) If there is any doubt and you are able to type test instead, you should do so.
Be careful of using
asInstanceOf
whenT0
is a primitive type. WhenT0
is primitive,asInstanceOf
may insert a conversion instead of a type test. If your intent is to convert, use atoT
method (x.toChar
,x.toByte
, etc.).- returns
the receiver object.
- Definition Classes
- Any
- Exceptions thrown
ClassCastException
if the receiver is not an instance of the erasure ofT0
, if that can be checked on this platform
- when flow analysis fails to deduce
- def clone(): AnyRef
Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the
clone
method is platform dependent.- returns
a copy of the receiver object.
- def concat[A](xss: collection.Iterable[A]*): LazyList[A]
Concatenates all argument collections into a single lazy list.
Concatenates all argument collections into a single lazy list.
- xss
the collections that are to be concatenated.
- returns
the concatenation of all the collections.
- Definition Classes
- LazyList → IterableFactory
- def continually[A](elem: => A): LazyList[A]
Create an infinite LazyList containing the given element expression (which is computed for each occurrence).
Create an infinite LazyList containing the given element expression (which is computed for each occurrence).
- elem
the element composing the resulting LazyList
- returns
the LazyList containing an infinite number of elem
- def empty[A]: LazyList[A]
An empty collection
An empty collection
- A
the type of the lazy list's elements
- Definition Classes
- LazyList → IterableFactory
- final def eq(arg0: AnyRef): Boolean
Tests whether the argument (
that
) is a reference to the receiver object (this
).Tests whether the argument (
that
) is a reference to the receiver object (this
).The
eq
method implements an equivalence relation on non-null instances ofAnyRef
, and has three additional properties:- It is consistent: for any non-null instances
x
andy
of typeAnyRef
, multiple invocations ofx.eq(y)
consistently returnstrue
or consistently returnsfalse
. - For any non-null instance
x
of typeAnyRef
,x.eq(null)
andnull.eq(x)
returnsfalse
. null.eq(null)
returnstrue
.
When overriding the
equals
orhashCode
methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2
), they should be equal to each other (o1 == o2
) and they should hash to the same value (o1.hashCode == o2.hashCode
).- returns
true
if the argument is a reference to the receiver object;false
otherwise.
- Definition Classes
- AnyRef
- It is consistent: for any non-null instances
- def equals(arg0: AnyRef): Boolean
The equality method for reference types.
- def fill[A](n: Int)(elem: => A): LazyList[A]
Produces a lazy list containing the results of some element computation a number of times.
Produces a lazy list containing the results of some element computation a number of times.
- n
the number of elements contained in the lazy list.
- elem
the element computation
- returns
A lazy list that contains the results of
n
evaluations ofelem
.
- Definition Classes
- LazyList → IterableFactory
- def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): LazyList[LazyList[LazyList[LazyList[LazyList[A]]]]]
Produces a five-dimensional lazy list containing the results of some element computation a number of times.
Produces a five-dimensional lazy list 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 lazy list 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): LazyList[LazyList[LazyList[LazyList[A]]]]
Produces a four-dimensional lazy list containing the results of some element computation a number of times.
Produces a four-dimensional lazy list 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 lazy list 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): LazyList[LazyList[LazyList[A]]]
Produces a three-dimensional lazy list containing the results of some element computation a number of times.
Produces a three-dimensional lazy list 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 lazy list that contains the results of
n1 x n2 x n3
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def fill[A](n1: Int, n2: Int)(elem: => A): LazyList[LazyList[A]]
Produces a two-dimensional lazy list containing the results of some element computation a number of times.
Produces a two-dimensional lazy list 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 lazy list that contains the results of
n1 x n2
evaluations ofelem
.
- Definition Classes
- IterableFactory
- def finalize(): Unit
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the
finalize
method is invoked, as well as the interaction betweenfinalize
and non-local returns and exceptions, are all platform dependent.- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- Note
not specified by SLS as a member of AnyRef
- def from(start: Int): LazyList[Int]
Create an infinite LazyList starting at
start
and incrementing by1
.Create an infinite LazyList starting at
start
and incrementing by1
.- start
the start value of the LazyList
- returns
the LazyList starting at value
start
.
- def from(start: Int, step: Int): LazyList[Int]
Create an infinite LazyList starting at
start
and incrementing by stepstep
.Create an infinite LazyList starting at
start
and incrementing by stepstep
.- start
the start value of the LazyList
- step
the increment value of the LazyList
- returns
the LazyList starting at value
start
.
- def from[A](coll: IterableOnce[A]): LazyList[A]
Creates a target lazy list from an existing source collection
Creates a target lazy list from an existing source collection
- A
the type of the collection’s elements
- returns
a new lazy list with the elements of
source
- Definition Classes
- LazyList → IterableFactory
- final def getClass(): Class[_ <: AnyRef]
Returns the runtime class representation of the object.
- def hashCode(): Int
The hashCode method for reference types.
- final def isInstanceOf[T0]: Boolean
Test whether the dynamic type of the receiver object has the same erasure as
T0
.Test whether the dynamic type of the receiver object has the same erasure as
T0
.Depending on what
T0
is, the test is done in one of the below ways:T0
is a non-parameterized class type, e.g.BigDecimal
: this method returnstrue
if the value of the receiver object is aBigDecimal
or a subtype ofBigDecimal
.T0
is a parameterized class type, e.g.List[Int]
: this method returnstrue
if the value of the receiver object is someList[X]
for anyX
. For example,List(1, 2, 3).isInstanceOf[List[String]]
will return true.T0
is some singleton typex.type
or literalx
: this method returnsthis.eq(x)
. For example,x.isInstanceOf[1]
is equivalent tox.eq(1)
T0
is an intersectionX with Y
orX & Y: this method is equivalent to
x.isInstanceOf[X] && x.isInstanceOf[Y]T0
is a unionX | Y
: this method is equivalent tox.isInstanceOf[X] || x.isInstanceOf[Y]
T0
is a type parameter or an abstract type member: this method is equivalent toisInstanceOf[U]
whereU
isT0
's upper bound,Any
ifT0
is unbounded. For example,x.isInstanceOf[A]
whereA
is an unbounded type parameter will return true for any value ofx
.
This is exactly equivalent to the type pattern
_: T0
- returns
true
if the receiver object is an instance of erasure of typeT0
;false
otherwise.
- Definition Classes
- Any
- Note
due to the unexpectedness of
List(1, 2, 3).isInstanceOf[List[String]]
returning true andx.isInstanceOf[A]
whereA
is a type parameter or abstract member returning true, these forms issue a warning.
- implicit def iterableFactory[A]: Factory[A, LazyList[A]]
- Definition Classes
- IterableFactory
- def iterate[A](start: => A)(f: (A) => A): LazyList[A]
An infinite LazyList that repeatedly applies a given function to a start value.
An infinite LazyList that repeatedly applies a given function to a start value.
- start
the start value of the LazyList
- f
the function that's repeatedly applied
- returns
the LazyList returning the infinite sequence of values
start, f(start), f(f(start)), ...
- def iterate[A](start: A, len: Int)(f: (A) => A): LazyList[A]
Produces a lazy list containing repeated applications of a function to a start value.
Produces a lazy list containing repeated applications of a function to a start value.
- start
the start value of the lazy list
- len
the number of elements contained in the lazy list
- f
the function that's repeatedly applied
- returns
a lazy list with
len
values in the sequencestart, f(start), f(f(start)), ...
- Definition Classes
- IterableFactory
- final def ne(arg0: AnyRef): Boolean
Equivalent to
!(this eq that)
.Equivalent to
!(this eq that)
.- returns
true
if the argument is not a reference to the receiver object;false
otherwise.
- Definition Classes
- AnyRef
- def newBuilder[A]: Builder[A, LazyList[A]]
The builder returned by this method only evaluates elements of collections added to it as needed.
The builder returned by this method only evaluates elements of collections added to it as needed.
- A
the type of the lazy list’s elements
- returns
A builder for
LazyList
objects.
- Definition Classes
- LazyList → IterableFactory
- final def notify(): Unit
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of AnyRef
- final def notifyAll(): Unit
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Annotations
- @native()
- Note
not specified by SLS as a member of AnyRef
- def range[A](start: A, end: A, step: A)(implicit arg0: Integral[A]): LazyList[A]
Produces a lazy list containing equally spaced values in some integer interval.
Produces a lazy list containing equally spaced values in some integer interval.
- start
the start value of the lazy list
- end
the end value of the lazy list (the first value NOT contained)
- step
the difference between successive elements of the lazy list (must be positive or negative)
- returns
a lazy list with values
start, start + step, ...
up to, but excludingend
- Definition Classes
- IterableFactory
- def range[A](start: A, end: A)(implicit arg0: Integral[A]): LazyList[A]
Produces a lazy list containing a sequence of increasing of integers.
Produces a lazy list containing a sequence of increasing of integers.
- start
the first element of the lazy list
- end
the end value of the lazy list (the first value NOT contained)
- returns
a lazy list with values
start, start + 1, ..., end - 1
- Definition Classes
- IterableFactory
- final def synchronized[T0](arg0: => T0): T0
Executes the code in
body
with an exclusive lock onthis
.Executes the code in
body
with an exclusive lock onthis
.- returns
the result of
body
- Definition Classes
- AnyRef
- def tabulate[A](n: Int)(f: (Int) => A): LazyList[A]
Produces a lazy list containing values of a given function over a range of integer values starting from 0.
Produces a lazy list containing values of a given function over a range of integer values starting from 0.
- n
The number of elements in the lazy list
- f
The function computing element values
- returns
A lazy list consisting of elements
f(0), ..., f(n -1)
- Definition Classes
- LazyList → IterableFactory
- def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) => A): LazyList[LazyList[LazyList[LazyList[LazyList[A]]]]]
Produces a five-dimensional lazy list containing values of a given function over ranges of integer values starting from 0.
Produces a five-dimensional lazy list 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 lazy list 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): LazyList[LazyList[LazyList[LazyList[A]]]]
Produces a four-dimensional lazy list containing values of a given function over ranges of integer values starting from 0.
Produces a four-dimensional lazy list 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 lazy list 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): LazyList[LazyList[LazyList[A]]]
Produces a three-dimensional lazy list containing values of a given function over ranges of integer values starting from 0.
Produces a three-dimensional lazy list 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 lazy list 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): LazyList[LazyList[A]]
Produces a two-dimensional lazy list containing values of a given function over ranges of integer values starting from 0.
Produces a two-dimensional lazy list 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 lazy list consisting of elements
f(i1, i2)
for0 <= i1 < n1
and0 <= i2 < n2
.
- Definition Classes
- IterableFactory
- implicit def toDeferrer[A](l: => LazyList[A]): Deferrer[A]
- def toString(): String
Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
- returns
a String representation of the object.
- Definition Classes
- AnyRef → Any
- final def unapplySeq[A](x: LazyList[A]): UnapplySeqWrapper[A]
- Definition Classes
- SeqFactory
- def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): LazyList[A]
Produces a lazy list that uses a function
f
to produce elements of typeA
and update an internal state of typeS
.Produces a lazy list 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 lazy list that produces elements using
f
untilf
returnsNone
- Definition Classes
- LazyList → IterableFactory
- final def wait(): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- Note
not specified by SLS as a member of AnyRef
- final def wait(arg0: Long, arg1: Int): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- Note
not specified by SLS as a member of AnyRef
- final def wait(arg0: Long): Unit
See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.
- object #::
- object cons
An alternative way of building and matching lazy lists using LazyList.cons(hd, tl).
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
.