Object

io.iteratee.Enumerator

StackUnsafe

Related Doc: package Enumerator

Permalink

object StackUnsafe

Enumerators that rely on F to provide stack safety.

These implementations will generally be more efficient than the default ones, but will not be stack safe unless recursive monadic binding in F is stack safe.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StackUnsafe
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def enumStream[F[_], E](xs: Stream[E], chunkSize: Int = defaultChunkSize)(implicit arg0: Monad[F]): Enumerator[F, E]

    Permalink

    An enumerator that produces values from a stream.

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def generateM[F[_], E](f: F[Option[E]])(implicit F: Monad[F]): Enumerator[F, E]

    Permalink

    An enumerator that returns the result of an effectful operation until None is generated.

    An enumerator that returns the result of an effectful operation until None is generated.

    Note that this implementation will only be stack safe if recursive monadic binding in F is stack safe.

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

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

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

    Permalink
    Definition Classes
    Any
  14. def iterate[F[_], E](init: E)(f: (E) ⇒ E)(implicit F: Monad[F]): Enumerator[F, E]

    Permalink

    An enumerator that iteratively performs an operation and returns the results.

    An enumerator that iteratively performs an operation and returns the results.

    Note that this implementation will only be stack safe if recursive monadic binding in F is stack safe.

  15. def iterateM[F[_], E](init: E)(f: (E) ⇒ F[E])(implicit F: Monad[F]): Enumerator[F, E]

    Permalink

    An enumerator that iteratively performs an effectful operation and returns the results.

    An enumerator that iteratively performs an effectful operation and returns the results.

    Note that this implementation will only be stack safe if recursive monadic binding in F is stack safe.

  16. def iterateUntil[F[_], E](init: E)(f: (E) ⇒ Option[E])(implicit F: Monad[F]): Enumerator[F, E]

    Permalink

    An enumerator that iteratively performs an operation until None is generated and returns the results.

    An enumerator that iteratively performs an operation until None is generated and returns the results.

    Note that this implementation will only be stack safe if recursive monadic binding in F is stack safe.

  17. def iterateUntilM[F[_], E](init: E)(f: (E) ⇒ F[Option[E]])(implicit F: Monad[F]): Enumerator[F, E]

    Permalink

    An enumerator that iteratively performs an effectful operation until None is generated and returns the results.

    An enumerator that iteratively performs an effectful operation until None is generated and returns the results.

    Note that this implementation will only be stack safe if recursive monadic binding in F is stack safe.

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

    Permalink
    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. final def repeat[F[_], E](e: E)(implicit F: Monad[F]): Enumerator[F, E]

    Permalink

    An enumerator that repeats the given value indefinitely.

    An enumerator that repeats the given value indefinitely.

    Note that this implementation will only be stack safe if recursive monadic binding in F is stack safe.

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

    Permalink
    Definition Classes
    AnyRef
  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  24. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped