class AsyncDataChunkerEnumerator[T, F[_]] extends EnumeratorT[DataChunk, F]
Creates an Enumerator with a given count for Empty -> Cont applications.
When the count is met it returns the Cont for the next Enumeration step.
Note: Call via eval only.
- Alphabetic
- By Inheritance
- AsyncDataChunkerEnumerator
- EnumeratorT
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new AsyncDataChunkerEnumerator(chunker: DataChunker[T], contOnCont: Int = 5)(implicit F: Monad[F])
- contOnCont
INFINITE_RETRIES (-1) for keep on trying, the default is 5 (as exposed by the implicit enumerator readableByteChannelEnumerator)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def #::(e: DataChunk)(implicit F: Monad[F]): EnumeratorT[DataChunk, F]
- Definition Classes
- EnumeratorT
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[A]: (StepT[DataChunk, F, A]) => IterateeT[DataChunk, F, A]
- Definition Classes
- AsyncDataChunkerEnumerator → EnumeratorT
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bindM[B, G[_]](f: (DataChunk) => G[EnumeratorT[B, F]])(implicit F: Monad[F], G: Monad[G]): F[G[EnumeratorT[B, F]]]
- Definition Classes
- EnumeratorT
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def collect[B](pf: PartialFunction[DataChunk, B])(implicit monad: Monad[F]): EnumeratorT[B, F]
- Definition Classes
- EnumeratorT
- def cross[E2](e2: EnumeratorT[E2, F])(implicit M: Monad[F]): EnumeratorT[(DataChunk, E2), F]
- Definition Classes
- EnumeratorT
- def drainTo[M[_]](implicit M: Monad[F], P: PlusEmpty[M], Z: Applicative[M]): F[M[DataChunk]]
- Definition Classes
- EnumeratorT
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def flatMap[B](f: (DataChunk) => EnumeratorT[B, F])(implicit M1: Monad[F]): EnumeratorT[B, F]
- Definition Classes
- EnumeratorT
- def flatten[B](implicit ev: ===[DataChunk, F[B]], F: Monad[F]): EnumeratorT[B, F]
- Definition Classes
- EnumeratorT
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[B](f: (DataChunk) => B)(implicit ev: Monad[F]): EnumeratorT[B, F]
- Definition Classes
- EnumeratorT
- def mapE[I](et: EnumerateeT[DataChunk, I, F])(implicit M: Monad[F]): EnumeratorT[I, F]
- Definition Classes
- EnumeratorT
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def reduced[B](b: B)(f: (B, DataChunk) => B)(implicit M: Monad[F]): EnumeratorT[B, F]
- Definition Classes
- EnumeratorT
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def uniq(implicit ord: Order[DataChunk], M: Monad[F]): EnumeratorT[DataChunk, F]
- Definition Classes
- EnumeratorT
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def zipWithIndex(implicit M: Monad[F]): EnumeratorT[(DataChunk, Long), F]
- Definition Classes
- EnumeratorT