Packages

c

zio.stream.ZSink

InvariantOps

implicit final class InvariantOps[R, E, A0, A, B] extends AnyVal

Self Type
InvariantOps[R, E, A0, A, B]
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InvariantOps
  2. AnyVal
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new InvariantOps(sink: ZSink[R, E, A0, A, B])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    Any
  2. final def ##(): Int
    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def drop(n: Long): ZSink[R, E, A0, A, B]

    Drops the first n elements from the sink.

  6. 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.

  7. def filter(f: (A) => Boolean): ZSink[R, E, A0, A, B]

    Filters the inputs fed to this sink.

  8. 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.

  9. 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.

  10. 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.

  11. def getClass(): Class[_ <: AnyVal]
    Definition Classes
    AnyVal → Any
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. def keyed[K](f: (A) => K): ZSink[R, E, (K, Chunk[A0]), A, Map[K, B]]

    Runs n sinks in parallel, where n is the number of possible keys generated by f.

  14. def toString(): String
    Definition Classes
    Any

Inherited from AnyVal

Inherited from Any

Ungrouped