Class

com.twitter.algebird.monad

FlatMappedState

Related Doc: package monad

Permalink

final case class FlatMappedState[S, F, T, U](start: StateWithError[S, F, T], fn: (T) ⇒ StateWithError[S, F, U]) extends StateWithError[S, F, U] with Product with Serializable

A Trampolining instance that should prevent stack overflow at the expense of performance

Source
StateWithError.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, StateWithError[S, F, U], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FlatMappedState
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. StateWithError
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new FlatMappedState(start: StateWithError[S, F, T], fn: (T) ⇒ StateWithError[S, F, U])

    Permalink

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. def apply(state: S): Either[F, (S, U)]

    Permalink
    Definition Classes
    StateWithError
  5. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def flatMap[F1 >: F, U](next: (U) ⇒ StateWithError[S, F1, U]): StateWithError[S, F1, U]

    Permalink
    Definition Classes
    StateWithError
  10. val fn: (T) ⇒ StateWithError[S, F, U]

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

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

    Permalink
    Definition Classes
    Any
  13. def join[F1 >: F, U](that: StateWithError[S, F1, U])(implicit sgf: Semigroup[F1], sgs: Semigroup[S]): StateWithError[S, F1, (U, U)]

    Permalink
    Definition Classes
    StateWithError
  14. def join[F1 >: F, U](that: StateWithError[S, F1, U], mergeErr: (F1, F1) ⇒ F1, mergeState: (S, S) ⇒ S): StateWithError[S, F1, (U, U)]

    Permalink
    Definition Classes
    StateWithError
  15. def map[U](fn: (U) ⇒ U): StateWithError[S, F, U]

    Permalink
    Definition Classes
    StateWithError
  16. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  19. def run(state: S): Either[F, (S, U)]

    Permalink
    Definition Classes
    FlatMappedStateStateWithError
  20. val start: StateWithError[S, F, T]

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

    Permalink
    Definition Classes
    AnyRef
  22. final def wait(): Unit

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from StateWithError[S, F, U]

Inherited from AnyRef

Inherited from Any

Ungrouped