Type Members
-
sealed
class
LiftToIterateePartiallyApplied[E] extends AnyRef
-
final
type
M[f[_]] = MonadError[f, Throwable]
-
sealed
class
PerformPartiallyApplied[E] extends AnyRef
Abstract Value Members
-
abstract
def
F: M[Task]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
collect[O, I](pf: PartialFunction[O, I]): Enumeratee[Task, O, I]
-
final
def
consume[E]: Iteratee[Task, E, Vector[E]]
-
final
def
consumeIn[E, C[_]](implicit C: Applicative[C], M: MonoidK[C]): Iteratee[Task, E, C[E]]
-
final
def
cont[E, A](ifInput: (NonEmptyList[E]) ⇒ Iteratee[Task, E, A], ifEnd: Task[A]): Iteratee[Task, E, A]
-
final
def
cross[E1, E2](e2: Enumerator[Task, E2]): Enumeratee[Task, E1, (E1, E2)]
-
final
def
done[E, A](value: A): Iteratee[Task, E, A]
-
final
def
drop[E](n: Long): Enumeratee[Task, E, E]
-
final
def
dropI[E](n: Int): Iteratee[Task, E, Unit]
-
final
def
dropWhile[E](p: (E) ⇒ Boolean): Enumeratee[Task, E, E]
-
final
def
dropWhileI[E](p: (E) ⇒ Boolean): Iteratee[Task, E, Unit]
-
final
def
dropWhileM[E](p: (E) ⇒ Task[Boolean]): Enumeratee[Task, E, E]
-
final
def
empty[E]: Enumerator[Task, E]
-
final
def
enumEither[E](either: Either[Throwable, E]): Enumerator[Task, E]
-
final
def
enumIndexedSeq[E](es: IndexedSeq[E], min: Int, max: Int): Enumerator[Task, E]
-
final
def
enumIterable[E](es: Iterable[E], chunkSize: Int): Enumerator[Task, E]
-
final
def
enumList[E](es: List[E]): Enumerator[Task, E]
-
final
def
enumOne[E](e: E): Enumerator[Task, E]
-
final
def
enumStream[E](es: Stream[E], chunkSize: Int): Enumerator[Task, E]
-
final
def
enumVector[E](es: Vector[E]): Enumerator[Task, E]
-
final
def
enumerate[E](xs: E*): Enumerator[Task, E]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
final
def
failEnumerator[E](t: Throwable): Enumerator[Task, E]
-
final
def
failIteratee[E, A](t: Throwable): Iteratee[Task, E, A]
-
final
def
filter[E](p: (E) ⇒ Boolean): Enumeratee[Task, E, E]
-
final
def
filterM[E](p: (E) ⇒ Task[Boolean]): Enumeratee[Task, E, E]
-
def
finalize(): Unit
-
final
def
flatMap[O, I](f: (O) ⇒ Enumerator[Task, I]): Enumeratee[Task, O, I]
-
final
def
flatMapM[O, I](f: (O) ⇒ Task[I]): Enumeratee[Task, O, I]
-
final
def
fold[E, A](init: A)(f: (A, E) ⇒ A): Iteratee[Task, E, A]
-
final
def
foldM[E, A](init: A)(f: (A, E) ⇒ Task[A]): Iteratee[Task, E, A]
-
final
def
foldMap[E, A](f: (E) ⇒ A)(implicit A: Monoid[A]): Iteratee[Task, E, A]
-
final
def
foldMapM[E, A](f: (E) ⇒ Task[A])(implicit A: Monoid[A]): Iteratee[Task, E, A]
-
final
def
foldMapMOption[E, A](f: (E) ⇒ Task[A])(implicit A: Semigroup[A]): Iteratee[Task, E, Option[A]]
-
final
def
foldMapOption[E, A](f: (E) ⇒ A)(implicit A: Semigroup[A]): Iteratee[Task, E, Option[A]]
-
final
def
foreach[E](f: (E) ⇒ Unit): Iteratee[Task, E, Unit]
-
final
def
foreachM[A](f: (A) ⇒ Task[Unit]): Iteratee[Task, A, Unit]
-
final
def
generateM[E](f: Task[Option[E]]): Enumerator[Task, E]
-
final
def
getClass(): Class[_]
-
final
def
grouped[E](n: Int): Enumeratee[Task, E, Vector[E]]
-
def
hashCode(): Int
-
final
def
head[E]: Iteratee[Task, E, Option[E]]
-
final
def
identityIteratee[E]: Iteratee[Task, E, Unit]
-
final
def
injectValue[E](e: E): Enumeratee[Task, E, E]
-
final
def
injectValues[E](es: Seq[E]): Enumeratee[Task, E, E]
-
final
def
intersperse[E](delim: E): Enumeratee[Task, E, E]
-
final
def
isEnd[E]: Iteratee[Task, E, Boolean]
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
iterate[E](init: E)(f: (E) ⇒ E): Enumerator[Task, E]
-
final
def
iterateM[E](init: E)(f: (E) ⇒ Task[E]): Enumerator[Task, E]
-
final
def
iterateUntil[E](init: E)(f: (E) ⇒ Option[E]): Enumerator[Task, E]
-
final
def
iterateUntilM[E](init: E)(f: (E) ⇒ Task[Option[E]]): Enumerator[Task, E]
-
final
def
last[E]: Iteratee[Task, E, Option[E]]
-
final
def
length[E]: Iteratee[Task, E, Long]
-
final
def
liftToEnumerator[E](fe: Task[E]): Enumerator[Task, E]
-
-
final
def
map[O, I](f: (O) ⇒ I): Enumeratee[Task, O, I]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
peek[E]: Iteratee[Task, E, Option[E]]
-
-
final
def
remainderWithResult[O, R, I](iteratee: Iteratee[Task, O, R])(f: (R, O) ⇒ I): Enumeratee[Task, O, I]
-
final
def
remainderWithResultM[O, R, I](iteratee: Iteratee[Task, O, R])(f: (R, O) ⇒ Task[I]): Enumeratee[Task, O, I]
-
final
def
repeat[E](e: E): Enumerator[Task, E]
-
final
def
reversed[E]: Iteratee[Task, E, List[E]]
-
final
def
scan[O, I](init: I)(f: (I, O) ⇒ I): Enumeratee[Task, O, I]
-
final
def
scanM[O, I](init: I)(f: (I, O) ⇒ Task[I]): Enumeratee[Task, O, I]
-
final
def
sequenceI[O, I](iteratee: Iteratee[Task, O, I]): Enumeratee[Task, O, I]
-
final
def
splitOn[E](p: (E) ⇒ Boolean): Enumeratee[Task, E, Vector[E]]
-
final
def
sum[E](implicit E: Monoid[E]): Iteratee[Task, E, E]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
final
def
take[E](n: Long): Enumeratee[Task, E, E]
-
final
def
takeI[E](n: Int): Iteratee[Task, E, Vector[E]]
-
final
def
takeWhile[E](p: (E) ⇒ Boolean): Enumeratee[Task, E, E]
-
final
def
takeWhileI[E](p: (E) ⇒ Boolean): Iteratee[Task, E, Vector[E]]
-
final
def
takeWhileM[E](p: (E) ⇒ Task[Boolean]): Enumeratee[Task, E, E]
-
def
toString(): String
-
final
def
uniq[E](implicit E: Eq[E]): Enumeratee[Task, E, E]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
zipWithIndex[E]: Enumeratee[Task, E, (E, Long)]
Inherited from AnyRef
Inherited from Any
