trait _zip[A] extends AnyRef
Ordering
- Alphabetic
Inherited
- Stream._extend._zip
- scala.AnyRef
- scala.Any
- Hide All
- Show All
Visibility
- Public
- All
Method
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
unzip[B, C](implicit f: (A) ⇒ (B, C)): (Stream[B], Stream[C])
Unzips stream in two
Unzips stream in two
val pairs = ('a' to 'g').all.zipMap(_.upper).to[Idx] pairs.all.lp // Prints ~((a,A), (b,B), (c,C), (d,D), (e,E), (f,F), (g,G)) val (left, right) = pairs.all.unzip left.all.lp // Prints ~(a, b, c, d, e, f, g) right.all.lp // Prints ~(G, F, E, D, C, B, A)
- Definition Classes
- _zip
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
zip[B](that: ~[B]): ~[(A, B)]
Zip that
Zip that
Merges this and that streams, creating Tuples for corresponding elements
If that stream runs out of elements to merge, the rest of this stream will be discarded too
(1 to 100).all.zip('A' to 'D').lp // Prints ~((1,A), (2,B), (3,C), (4,D))
- Definition Classes
- _zip
-
def
zipAll[B](that: ~[B], thisDflt: Opt[A], thatDflt: Opt[B]): ~[(A, B)]
Merge stream
Merge stream
Merges this and that streams, creating Tuples for corresponding elements
('a' to 'f').all.zip('A' to 'H', '?', '?').lp // Output ~((a,A), (b,B), (c,C), (d,D), (e,E), (f,F), (?,G), (?,H))
- that
the stream to merge with this
- thisDflt
if this Stream has fewer elements, thisDflt will be used to fill the voids. Fails if thisDflt is required, but not available
- thatDflt
if that Stream has fewer elements, thatDflt will be used to fill the voids. Fails if thatDflt is required, but not available
- Definition Classes
- _zip
-
def
zipFoldAs[B](start: B)(f: Folding.As[B, A]): Stream[(A, B)]
Merges current folding value
Merges current folding value
(1 to 7).all.zipFoldAs(0L)(_ + _).tp // "Running Total" Output -- -- ? ? -- -- 1 1 2 3 3 6 4 10 5 15 6 21 7 28
- Definition Classes
- _zip
-
def
zipIdx(start: Int): ~[(Int, A)]
Merge index
-
def
zipIdx: ~[(Int, A)]
Merge index
-
def
zipMap[B](f: Mapping[A, B]): ~[(A, B)]
Merge property
-
def
zipNext: ~[(A, Opt[A])]
Merge with next
-
def
zipPrior: ~[(Opt[A], A)]
Merge with prior
Merge Interface