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

final class LazyZip3[+El1, +El2, +El3, C1] extends AnyRef

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. LazyZip3
2. AnyRef
3. Any

Implicitly

1. by lazyZip3ToIterable

2. by any2stringadd

3. by StringFormat

4. by Ensuring

5. by ArrowAssoc

6. Hide All

7. Show All

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]): View[B]
5.  def ->[B](y: B): (LazyZip3[El1, El2, El3, C1], B)
6.  final def ==(arg0: Any): Boolean
7.  final def addString(b: mutable.StringBuilder): b.type
8.  final def addString(b: mutable.StringBuilder, sep: String): b.type
9.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type
10.  final def asInstanceOf[T0]: T0
11.  def clone(): AnyRef
12.  def collect[B](pf: PartialFunction[(El1, El2, El3), B]): View[B]
13.  def collectFirst[B](pf: PartialFunction[(El1, El2, El3), B]): Option[B]
14.  def concat[B >: A](suffix: IterableOnce[B]): View[B]
15.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
16.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
17.  def copyToArray[B >: A](xs: Array[B]): Int
18.  def corresponds[B](that: IterableOnce[B])(p: ((El1, El2, El3), B) => Boolean): Boolean
19.  def count(p: ((El1, El2, El3)) => Boolean): Int
20.  def drop(n: Int): View[(El1, El2, El3)]
21.  def dropRight(n: Int): View[(El1, El2, El3)]
22.  def dropWhile(p: ((El1, El2, El3)) => Boolean): View[(El1, El2, El3)]
23.  def empty: View[(El1, El2, El3)]
24.  def ensuring(cond: (LazyZip3[El1, El2, El3, C1]) => Boolean, msg: => Any): LazyZip3[El1, El2, El3, C1]
25.  def ensuring(cond: (LazyZip3[El1, El2, El3, C1]) => Boolean): LazyZip3[El1, El2, El3, C1]
26.  def ensuring(cond: Boolean, msg: => Any): LazyZip3[El1, El2, El3, C1]
27.  def ensuring(cond: Boolean): LazyZip3[El1, El2, El3, C1]
28.  final def eq(arg0: AnyRef): Boolean
29.  def equals(arg0: AnyRef): Boolean
30.  def exists(p: (El1, El2, El3) => Boolean): Boolean
31.  def filter[C](p: (El1, El2, El3) => Boolean)(implicit bf: BuildFrom[C1, (El1, El2, El3), C]): C
32.  def filterNot(pred: ((El1, El2, El3)) => Boolean): View[(El1, El2, El3)]
33.  def finalize(): Unit
34.  def find(p: ((El1, El2, El3)) => Boolean): Option[(El1, El2, El3)]
35.  def flatMap[B, C](f: (El1, El2, El3) => Iterable[B])(implicit bf: BuildFrom[C1, B, C]): C
36.  def flatten[B](implicit asIterable: ((El1, El2, El3)) => IterableOnce[B]): View[B]
37.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
38.  def foldLeft[B](z: B)(op: (B, (El1, El2, El3)) => B): B
39.  def foldRight[B](z: B)(op: ((El1, El2, El3), B) => B): B
40.  def forall(p: (El1, El2, El3) => Boolean): Boolean
41.  def foreach[U](f: (El1, El2, El3) => U): Unit
42.  final def getClass(): Class[_ <: AnyRef]
43.  def groupBy[K](f: ((El1, El2, El3)) => K): immutable.Map[K, View[(El1, El2, El3)]]
44.  def groupMap[K, B](key: ((El1, El2, El3)) => K)(f: ((El1, El2, El3)) => B): immutable.Map[K, View[B]]
45.  def groupMapReduce[K, B](key: ((El1, El2, El3)) => K)(f: ((El1, El2, El3)) => B)(reduce: (B, B) => B): immutable.Map[K, B]
46.  def grouped(size: Int): Iterator[View[(El1, El2, El3)]]
47.  def hashCode(): Int
48.  def head: (El1, El2, El3)
49.  def headOption: Option[(El1, El2, El3)]
50.  def init: View[(El1, El2, El3)]
51.  def inits: Iterator[View[(El1, El2, El3)]]
52.  def isEmpty: Boolean
53.  final def isInstanceOf[T0]: Boolean
54.  def isTraversableAgain: Boolean
55.  def iterableFactory: IterableFactory[View]
56.  def iterator: Iterator[(El1, El2, El3)]
57.  def knownSize: Int
58.  def last: (El1, El2, El3)
59.  def lastOption: Option[(El1, El2, El3)]
60.  def lazyZip[B](that: Iterable[B]): LazyZip4[El1, El2, El3, B, C1]
61.  def map[B, C](f: (El1, El2, El3) => B)(implicit bf: BuildFrom[C1, B, C]): C
62.  def max[B >: A](implicit ord: math.Ordering[B]): (El1, El2, El3)
63.  def maxBy[B](f: ((El1, El2, El3)) => B)(implicit ord: math.Ordering[B]): (El1, El2, El3)
64.  def maxByOption[B](f: ((El1, El2, El3)) => B)(implicit ord: math.Ordering[B]): Option[(El1, El2, El3)]
65.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[(El1, El2, El3)]
66.  def min[B >: A](implicit ord: math.Ordering[B]): (El1, El2, El3)
67.  def minBy[B](f: ((El1, El2, El3)) => B)(implicit ord: math.Ordering[B]): (El1, El2, El3)
68.  def minByOption[B](f: ((El1, El2, El3)) => B)(implicit ord: math.Ordering[B]): Option[(El1, El2, El3)]
69.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[(El1, El2, El3)]
70.  final def mkString: String
71.  final def mkString(sep: String): String
72.  final def mkString(start: String, sep: String, end: String): String
73.  final def ne(arg0: AnyRef): Boolean
74.  def nonEmpty: Boolean
75.  final def notify(): Unit
76.  final def notifyAll(): Unit
77.  def partition(p: ((El1, El2, El3)) => Boolean): (View[(El1, El2, El3)], View[(El1, El2, El3)])
78.  def partitionMap[A1, A2](f: ((El1, El2, El3)) => Either[A1, A2]): (View[A1], View[A2])
79.  def product[B >: A](implicit num: math.Numeric[B]): B
80.  def reduce[B >: A](op: (B, B) => B): B
81.  def reduceLeft[B >: A](op: (B, (El1, El2, El3)) => B): B
82.  def reduceLeftOption[B >: A](op: (B, (El1, El2, El3)) => B): Option[B]
83.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
84.  def reduceRight[B >: A](op: ((El1, El2, El3), B) => B): B
85.  def reduceRightOption[B >: A](op: ((El1, El2, El3), B) => B): Option[B]
86.  def scan[B >: A](z: B)(op: (B, B) => B): View[B]
87.  def scanLeft[B](z: B)(op: (B, (El1, El2, El3)) => B): View[B]
88.  def scanRight[B](z: B)(op: ((El1, El2, El3), B) => B): View[B]
89.  def size: Int
90.  def sizeCompare(that: Iterable[_]): Int
91.  def sizeCompare(otherSize: Int): Int
92.  final def sizeIs: SizeCompareOps
93.  def slice(from: Int, until: Int): View[(El1, El2, El3)]
94.  def sliding(size: Int, step: Int): Iterator[View[(El1, El2, El3)]]
95.  def sliding(size: Int): Iterator[View[(El1, El2, El3)]]
96.  def span(p: ((El1, El2, El3)) => Boolean): (View[(El1, El2, El3)], View[(El1, El2, El3)])
97.  def splitAt(n: Int): (View[(El1, El2, El3)], View[(El1, El2, El3)])
98.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[(El1, El2, El3), S]): S
99.  def sum[B >: A](implicit num: math.Numeric[B]): B
100.  final def synchronized[T0](arg0: => T0): T0
101.  def tail: View[(El1, El2, El3)]
102.  def tails: Iterator[View[(El1, El2, El3)]]
103.  def take(n: Int): View[(El1, El2, El3)]
104.  def takeRight(n: Int): View[(El1, El2, El3)]
105.  def takeWhile(p: ((El1, El2, El3)) => Boolean): View[(El1, El2, El3)]
106.  def tapEach[U](f: ((El1, El2, El3)) => U): View[(El1, El2, El3)]
107.  def to[C1](factory: Factory[(El1, El2, El3), C1]): C1
108.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
109.  final def toBuffer[B >: A]: Buffer[B]
110.  def toIndexedSeq: immutable.IndexedSeq[(El1, El2, El3)]
111.  def toList: immutable.List[(El1, El2, El3)]
112.  def toMap[K, V](implicit ev: <:<[(El1, El2, El3), (K, V)]): immutable.Map[K, V]
113.  def toSeq: immutable.Seq[(El1, El2, El3)]
114.  def toSet[B >: A]: immutable.Set[B]
115.  def toString(): String
116.  def toVector: immutable.Vector[(El1, El2, El3)]
117.  def transpose[B](implicit asIterable: ((El1, El2, El3)) => Iterable[B]): View[View[B]]
118.  def unzip[A1, A2](implicit asPair: ((El1, El2, El3)) => (A1, A2)): (View[A1], View[A2])
119.  def unzip3[A1, A2, A3](implicit asTriple: ((El1, El2, El3)) => (A1, A2, A3)): (View[A1], View[A2], View[A3])
120.  def view: View[(El1, El2, El3)]
121.  final def wait(): Unit
122.  final def wait(arg0: Long, arg1: Int): Unit
123.  final def wait(arg0: Long): Unit
124.  def withFilter(p: ((El1, El2, El3)) => Boolean): WithFilter[(El1, El2, El3), [_]View[_]]
125.  def zip[B](that: IterableOnce[B]): View[((El1, El2, El3), B)]
126.  def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): View[(A1, B)]
127.  def zipWithIndex: View[((El1, El2, El3), Int)]

Shadowed Implicit Value Members

1.  def exists(p: ((El1, El2, El3)) => Boolean): Boolean
2.  def filter(pred: ((El1, El2, El3)) => Boolean): View[(El1, El2, El3)]
3.  def flatMap[B](f: ((El1, El2, El3)) => IterableOnce[B]): View[B]
4.  def forall(p: ((El1, El2, El3)) => Boolean): Boolean
5.  def foreach[U](f: ((El1, El2, El3)) => U): Unit
6.  def lazyZip[B]: ([B](that: Iterable[B]): scala.collection.LazyZip2[(El1, El2, El3),B,_1.type]) forSome {val _1: View[(El1, El2, El3)]}
7.  def map[B](f: ((El1, El2, El3)) => B): View[B]
8.  def toString(): String

Deprecated Value Members

1.  def ++:[B >: A](that: IterableOnce[B]): View[B]
2.  final def /:[B](z: B)(op: (B, (El1, El2, El3)) => B): B
3.  final def :\[B](z: B)(op: ((El1, El2, El3), B) => B): B
4.  def aggregate[B](z: => B)(seqop: (B, (El1, El2, El3)) => B, combop: (B, B) => B): B
5.  def companion: IterableFactory[[_]View[_]]
6.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
7.  def force: IndexedSeq[(El1, El2, El3)]
8.  def formatted(fmtstr: String): String
9.  def hasDefiniteSize: Boolean
10.  final def repr: View[(El1, El2, El3)]
11.  def seq: View[(El1, El2, El3)]
12.  final def toIterable: View[(El1, El2, El3)]
13.  final def toIterator: Iterator[(El1, El2, El3)]
14.  final def toStream: immutable.Stream[(El1, El2, El3)]
15.  final def toTraversable: Traversable[(El1, El2, El3)]
16.  def view(from: Int, until: Int): View[(El1, El2, El3)]
17.  def →[B](y: B): (LazyZip3[El1, El2, El3, C1], B)

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion lazyZip3ToIterable fromLazyZip3[El1, El2, El3, C1] to View[(El1, El2, El3)]

Inherited by implicit conversion any2stringadd fromLazyZip3[El1, El2, El3, C1] to any2stringadd[LazyZip3[El1, El2, El3, C1]]

Inherited by implicit conversion StringFormat fromLazyZip3[El1, El2, El3, C1] to StringFormat[LazyZip3[El1, El2, El3, C1]]

Inherited by implicit conversion Ensuring fromLazyZip3[El1, El2, El3, C1] to Ensuring[LazyZip3[El1, El2, El3, C1]]

Inherited by implicit conversion ArrowAssoc fromLazyZip3[El1, El2, El3, C1] to ArrowAssoc[LazyZip3[El1, El2, El3, C1]]

Ungrouped