Step

abstract def bind[B](f: (A) ⇒ F[Step[F, E, B]])(implicit M: Monad[F]): F[Step[F, E, B]]

Map a function returning a Step in a monadic context over the value of this Step and flatten the result.

abstract def contramap[E2](f: (E2) ⇒ E): Step[F, E2, A]

Map a function over the inputs of this Step.

abstract def feed(chunk: Seq[E]): F[Step[F, E, A]]

Feed a chunk (possibly empty) to this Step.

abstract def feedEl(e: E): F[Step[F, E, A]]

Feed a single element to this Step.

abstract def feedNonEmpty(chunk: Seq[E]): F[Step[F, E, A]]

Feed a chunk that is known to be non-empty to this Step.

abstract def fold[Z](ifCont: ((NonEmptyList[E]) ⇒ F[Step[F, E, A]]) ⇒ Z, ifDone: (A, List[E]) ⇒ Z): Z

Reduce this Step to a value using the given functions.

abstract def isDone: Boolean

abstract def map[B](f: (A) ⇒ B): Step[F, E, B]

Map a function over the value of this Step.

abstract def mapI[G[_]](f: FunctionK[F, G])(implicit arg0: Applicative[G]): Step[G, E, A]

Transform the context of this Step.

abstract def run: F[A]

Run this Step so that it produces a value in an effectful context.

abstract def zip[B](other: Step[F, E, B]): Step[F, E, (A, B)]

Zip this Step with another.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit