Object

japgolly.microlibs.recursion

RecursionFn

Related Doc: package recursion

Permalink

object RecursionFn

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RecursionFn
  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. def ana[F[_], A](coalg: FCoalgebra[F, A])(implicit F: Functor[F]): (A) ⇒ Fix[F]

    Permalink
  5. def anaM[M[_], F[_], A](coalg: FCoalgebraM[M, F, A])(implicit M: Monad[M], F: Traverse[F]): (A) ⇒ M[Fix[F]]

    Permalink
  6. def apo[F[_], A](coalg: RCoalgebra[F, A])(implicit F: Functor[F]): (A) ⇒ Fix[F]

    Permalink

    ana that can branch / short-circuit

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def cata[F[_], A](alg: FAlgebra[F, A])(implicit F: Functor[F]): (Fix[F]) ⇒ A

    Permalink
  9. def cataM[M[_], F[_], A](alg: FAlgebraM[M, F, A])(implicit M: Monad[M], F: Traverse[F]): (Fix[F]) ⇒ M[A]

    Permalink
  10. def chrono[F[_], A, B](coalg: CVCoalgebra[F, A], alg: CVAlgebra[F, B])(implicit F: Functor[F]): (A) ⇒ B

    Permalink

    hylo of futu into histo

  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. def coelgot[F[_], A, B](coalg: FCoalgebra[F, A], elalg: (A, () ⇒ F[B]) ⇒ B)(implicit F: Functor[F]): (A) ⇒ B

    Permalink

    hylo that can short-circuit on reduction

  13. def elgot[F[_], A, B](elcoalg: (A) ⇒ Either[B, F[A]], alg: FAlgebra[F, B])(implicit F: Functor[F]): (A) ⇒ B

    Permalink

    hylo that can short-circuit on construction

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def futu[F[_], A](coalg: CVCoalgebra[F, A])(implicit F: Functor[F]): (A) ⇒ Fix[F]

    Permalink

    ana that can build multiple levels in a single pass

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  20. def histo[F[_], A](alg: CVAlgebra[F, A])(implicit F: Functor[F]): (Fix[F]) ⇒ A

    Permalink

    cata that retains values of all previous (i.e.

    cata that retains values of all previous (i.e. child) steps

  21. def hylo[F[_], A, B](coalg: FCoalgebra[F, A], alg: FAlgebra[F, B])(implicit F: Functor[F]): (A) ⇒ B

    Permalink

    ana with immediate cata

  22. def hyloM[M[_], F[_], A, B](coalg: FCoalgebraM[M, F, A], alg: FAlgebraM[M, F, B])(implicit M: Monad[M], F: Traverse[F]): (A) ⇒ M[B]

    Permalink
  23. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  24. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  27. def para[F[_], A](alg: RAlgebra[F, A])(implicit F: Functor[F]): (Fix[F]) ⇒ A

    Permalink

    cata that has access to current subtree (Fix[F]) as well as that subtree's folded result (A)

  28. def postpro[F[_], A](coalg: FCoalgebra[F, A], pro: ~>[F, F])(implicit F: Functor[F]): (A) ⇒ Fix[F]

    Permalink

    ana that creates a structure, transforming each new child (i.e.

    ana that creates a structure, transforming each new child (i.e. the entire structure as exists at the end of a pass). Top-most structure (i.e. the end result) is not transformed. Inside to outside.

  29. def prepro[F[_], A](pre: ~>[F, F], alg: FAlgebra[F, A])(implicit F: Functor[F]): (Fix[F]) ⇒ A

    Permalink

    cata that transforms children before folding.

    cata that transforms children before folding. Top-most structure (i.e. the input) is not transformed. Outside to inside.

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

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped