trait
EnumeratorT[E, F[_]] extends AnyRef
Abstract Value Members
-
abstract
def
apply[A]: (StepT[E, F, A]) ⇒ IterateeT[E, F, A]
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
#::(e: ⇒ E)(implicit F: Monad[F]): EnumeratorT[E, F]
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
bindM[B, G[_]](f: (E) ⇒ G[EnumeratorT[B, F]])(implicit F: Monad[F], G: Monad[G]): F[G[EnumeratorT[B, F]]]
-
def
clone(): AnyRef
-
def
collect[B](pf: PartialFunction[E, B])(implicit monad: Monad[F]): EnumeratorT[B, F]
-
def
cross[E2](e2: EnumeratorT[E2, F])(implicit M: Monad[F]): EnumeratorT[(E, E2), F]
-
def
drainTo[M[_]](implicit M: Monad[F], P: PlusEmpty[M], Z: Applicative[M]): F[M[E]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
flatMap[B](f: (E) ⇒ EnumeratorT[B, F])(implicit M1: Monad[F]): EnumeratorT[B, F]
-
def
flatten[B, G[_]](implicit ev: =:=[E, G[B]], MO: |>=|[F, G]): EnumeratorT[B, F]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[B](f: (E) ⇒ B)(implicit ev: Monad[F]): EnumeratorT[B, F]
-
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
reduced[B](b: B)(f: (B, E) ⇒ B)(implicit M: Monad[F]): EnumeratorT[B, F]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
uniq(implicit ord: Order[E], M: Monad[F]): EnumeratorT[E, F]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zipWithIndex(implicit M: Monad[F]): EnumeratorT[(E, Long), F]
Inherited from AnyRef
Inherited from Any
