Scala Standard Library 2.13.15 - scala.collection.immutable.LazyList (original) (raw)

final class LazyList[+A] extends AbstractSeq[A] with LinearSeq[A] with LinearSeqOps[A, LazyList, LazyList[A]] with IterableFactoryDefaults[A, LazyList] with Serializable

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. LazyList
2. Serializable
3. LinearSeq
4. LinearSeqOps
5. LinearSeq
6. LinearSeqOps
7. AbstractSeq
8. Seq
9. SeqOps
10. Iterable
11. AbstractSeq
12. Seq
13. Equals
14. SeqOps
15. PartialFunction
16. Function1
17. AbstractIterable
18. Iterable
19. IterableFactoryDefaults
20. IterableOps
21. IterableOnceOps
22. IterableOnce
23. AnyRef
24. Any

Implicitly

1. by UnliftOps

2. by iterableOnceExtensionMethods

3. by toDeferrer

4. by any2stringadd

5. by StringFormat

6. by Ensuring

7. by ArrowAssoc

8. Hide All

9. Show All

Visibility

1. Public
2. Protected

Value Members

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

Deprecated Value Members

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

Inherited from java.io.Serializable

Inherited from LinearSeq[A]

Inherited from LinearSeqOps[A, [X]LazyList[X], LazyList[A]]

Inherited from collection.LinearSeq[A]

Inherited from collection.LinearSeqOps[A, [X]LazyList[X], LazyList[A]]

Inherited from AbstractSeq[A]

Inherited from Seq[A]

Inherited from SeqOps[A, [_]LazyList[_], LazyList[A]]

Inherited from Iterable[A]

Inherited from collection.AbstractSeq[A]

Inherited from collection.Seq[A]

Inherited from Equals

Inherited from collection.SeqOps[A, [_]LazyList[_], LazyList[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) => A

Inherited from AbstractIterable[A]

Inherited from collection.Iterable[A]

Inherited from IterableFactoryDefaults[A, [x]LazyList[x]]

Inherited from IterableOps[A, [_]LazyList[_], LazyList[A]]

Inherited from IterableOnceOps[A, [_]LazyList[_], LazyList[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromLazyList[A] to UnliftOps[Int, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromLazyList[A] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion toDeferrer fromLazyList[A] to Deferrer[A]

Inherited by implicit conversion any2stringadd fromLazyList[A] to any2stringadd[LazyList[A]]

Inherited by implicit conversion StringFormat fromLazyList[A] to StringFormat[LazyList[A]]

Inherited by implicit conversion Ensuring fromLazyList[A] to Ensuring[LazyList[A]]

Inherited by implicit conversion ArrowAssoc fromLazyList[A] to ArrowAssoc[LazyList[A]]

Ungrouped