package recursion
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- recursion
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
sealed abstract
class
AtomOrComposite[A] extends AnyRef
Useful for situations where composite items need to be wrapped when nested, but not at the top level.
Useful for situations where composite items need to be wrapped when nested, but not at the top level.
Allows "2 * (1 + 1)" instead of "(2 * (1 + 1))".
-
type
CVAlgebra[F[_], A] = (F[Cofree[F, A]]) ⇒ A
Course-of-values algebra
-
type
CVCoalgebra[F[_], A] = (A) ⇒ F[Free[F, A]]
Course-of-values co-algebra
- type FAlgebra[F[_], A] = (F[A]) ⇒ A
- type FAlgebraM[M[_], F[_], A] = (F[A]) ⇒ M[A]
- final class FAlgebraOps[F[_], A] extends AnyVal
- type FCoalgebra[F[_], A] = (A) ⇒ F[A]
- type FCoalgebraM[M[_], F[_], A] = (A) ⇒ M[F[A]]
- final class FCoalgebraOps[F[_], A] extends AnyVal
- type Fix[F[_]] = recursion.FixModule.Fix[F]
- sealed trait FixModule extends AnyRef
-
implicit final
class
FixOps[F[_]] extends AnyVal
- Annotations
- @inline()
- type RAlgebra[F[_], A] = (F[(Fix[F], A)]) ⇒ A
- type RCoalgebra[F[_], A] = (A) ⇒ F[Either[Fix[F], A]]
Value Members
- val Fix: FixModule
-
implicit
def
fAlgebraOps[F[_], A](self: (F[A]) ⇒ A): FAlgebraOps[F, A]
- Annotations
- @inline()
-
implicit
def
fCoalgebraOps[F[_], A](self: (A) ⇒ F[A]): FCoalgebraOps[F, A]
- Annotations
- @inline()
- object AtomOrComposite
-
object
EasyRecursion
Beginner-friendly.
Beginner-friendly. No Greek.
- object Recursion
- object RecursionFn