implicit final class InvariantOps[R, E, A0, A, B] extends AnyVal
- Self Type
- InvariantOps[R, E, A0, A, B]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- InvariantOps
- AnyVal
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- Any
- final def ##(): Int
- Definition Classes
- Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def drop(n: Long): ZSink[R, E, A0, A, B]
Drops the first
nelements from the sink. - def dropWhile(pred: (A) => Boolean): ZSink[R, E, A0, A, B]
Drops all elements entering the sink for as long as the specified predicate evaluates to
true. - def filter(f: (A) => Boolean): ZSink[R, E, A0, A, B]
Filters the inputs fed to this sink.
- def filterM[R1 <: R, E1 >: E](f: (A) => ZIO[R1, E1, Boolean]): ZSink[R1, E1, A0, A, B]
Effectfully filters the inputs fed to this sink.
- def filterNot(f: (A) => Boolean): ZSink[R, E, A0, A, B]
Filters this sink by the specified predicate, dropping all elements for which the predicate evaluates to true.
- def filterNotM[R1 <: R, E1 >: E](f: (A) => ZIO[R1, E1, Boolean]): ZSink[R1, E1, A0, A, B]
Effectfully filters this sink by the specified predicate, dropping all elements for which the predicate evaluates to true.
- def getClass(): Class[_ <: AnyVal]
- Definition Classes
- AnyVal → Any
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def keyed[K](f: (A) => K): ZSink[R, E, (K, Chunk[A0]), A, Map[K, B]]
Runs
nsinks in parallel, wherenis the number of possible keys generated byf. - def toString(): String
- Definition Classes
- Any