scalaz.iteratee

IterateeT

sealed abstract class IterateeT[E, F[_], A] extends AnyRef

A data sink.

Represents a value of type F[StepT[E, F, A]]

E

The type of the input data (mnemonic: Element type)

F

The type constructor representing an effect. The type constructor scalaz.Id is used to model pure computations, and is fixed as such in the type alias scalaz.iteratee.Iteratee.

A

The type of the calculated result

Source
IterateeT.scala
See also

scalaz.iteratee.StepT

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IterateeT
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IterateeT()

Abstract Value Members

  1. abstract def value: F[StepT[E, F, A]]

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def %=[O](e: EnumerateeT[O, E, F])(implicit m: Monad[F]): IterateeT[O, F, A]

  5. def &=(e: EnumeratorT[E, F])(implicit F: Bind[F]): IterateeT[E, F, A]

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  8. def >>==[EE, AA](f: (StepT[E, F, A]) ⇒ IterateeT[EE, F, AA])(implicit F: Bind[F]): IterateeT[EE, F, AA]

    Combine this Iteratee with an Enumerator-like function.

    Combine this Iteratee with an Enumerator-like function.

    Often used in combination with the implicit views such as enumStream and enumIterator, for example:

    head[Unit, Int, Id] >>== Stream.continually(1) // enumStream(Stream.continually(1))
    f

    An Enumerator-like function. If the type parameters EE and BB are chosen to be E and B respectively, the type of f is equivalent to EnumeratorT[E, F, A].

  9. def advance[EE, AA, G[_]](f: (StepT[E, F, A]) ⇒ IterateeT[EE, G, AA])(implicit MO: |>=|[G, F]): IterateeT[EE, G, AA]

    A generalization of >>== that allows a step function which returns its result in a different, "bigger" monad.

    A generalization of >>== that allows a step function which returns its result in a different, "bigger" monad. The monad for G must perform all the effects of F as part of its evaluation; in the trivial case, of course F and G will have the same monad.

  10. def advanceT[EE, AA, G[_]](f: (StepT[E, F, A]) ⇒ G[StepT[EE, F, AA]])(implicit MO: |>=|[G, F]): G[StepT[EE, F, AA]]

  11. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  12. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def contramap[EE](f: (EE) ⇒ E)(implicit F: Monad[F]): IterateeT[EE, F, A]

  14. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def flatMap[B](f: (A) ⇒ IterateeT[E, F, B])(implicit F: Monad[F]): IterateeT[E, F, B]

  18. def foldT[Z](cont: ((Input[E]) ⇒ IterateeT[E, F, A]) ⇒ F[Z], done: (⇒ A, ⇒ Input[E]) ⇒ F[Z])(implicit F: Bind[F]): F[Z]

  19. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  20. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  21. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  22. def joinI[I, B](implicit outer: =:=[IterateeT[E, F, A], IterateeT[E, F, StepT[I, F, B]]], M: Monad[F]): IterateeT[E, F, B]

  23. def map[B](f: (A) ⇒ B)(implicit F: Monad[F]): IterateeT[E, F, B]

  24. def mapI[G[_]](f: ~>[F, G])(implicit F: Functor[F]): IterateeT[E, G, A]

  25. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  28. def run(implicit F: Monad[F]): F[A]

    Run this iteratee

  29. def sequenceI(implicit m: Monad[F]): EnumerateeT[E, A, F]

    Feeds input elements to this iteratee until it is done, feeds the produced value to the inner iteratee.

    Feeds input elements to this iteratee until it is done, feeds the produced value to the inner iteratee. Then this iteratee will start over, looping until the inner iteratee is done.

  30. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  31. def toString(): String

    Definition Classes
    AnyRef → Any
  32. def up[G[_]](implicit G: Applicative[G], F: Comonad[F]): IterateeT[E, G, A]

  33. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. def zip[B](other: IterateeT[E, F, B])(implicit F: Monad[F]): IterateeT[E, F, (A, B)]

Inherited from AnyRef

Inherited from Any

Ungrouped