object Recursion
- Alphabetic
- By Inheritance
- Recursion
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def ana[F[_], A](coalg: FCoalgebra[F, A])(a: A)(implicit F: Functor[F]): Fix[F]
- def anaM[M[_], F[_], A](coalg: FCoalgebraM[M, F, A])(a: A)(implicit M: Monad[M], F: Traverse[F]): M[Fix[F]]
-
def
apo[F[_], A](coalg: RCoalgebra[F, A])(a: A)(implicit F: Functor[F]): Fix[F]
ana that can branch / short-circuit
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def cata[F[_], A](alg: FAlgebra[F, A])(f: Fix[F])(implicit F: Functor[F]): A
- def cataM[M[_], F[_], A](alg: FAlgebraM[M, F, A])(f: Fix[F])(implicit M: Monad[M], F: Traverse[F]): M[A]
-
def
chrono[F[_], A, B](coalg: CVCoalgebra[F, A], alg: CVAlgebra[F, B])(a: A)(implicit F: Functor[F]): B
hylo of futu into histo
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
coelgot[F[_], A, B](coalg: FCoalgebra[F, A], elalg: (A, () ⇒ F[B]) ⇒ B)(a: A)(implicit F: Functor[F]): B
hylo that can short-circuit on reduction
-
def
elgot[F[_], A, B](elcoalg: (A) ⇒ Either[B, F[A]], alg: FAlgebra[F, B])(a: A)(implicit F: Functor[F]): B
hylo that can short-circuit on construction
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
futu[F[_], A](coalg: CVCoalgebra[F, A])(a: A)(implicit F: Functor[F]): Fix[F]
ana that can build multiple levels in a single pass
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
histo[F[_], A](alg: CVAlgebra[F, A])(f: Fix[F])(implicit F: Functor[F]): A
cata that retains values of all previous (i.e.
cata that retains values of all previous (i.e. child) steps
-
def
hylo[F[_], A, B](coalg: FCoalgebra[F, A], alg: FAlgebra[F, B])(a: A)(implicit F: Functor[F]): B
ana with immediate cata
- def hyloM[M[_], F[_], A, B](coalg: FCoalgebraM[M, F, A], alg: FAlgebraM[M, F, B])(a: A)(implicit M: Monad[M], F: Traverse[F]): M[B]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
para[F[_], A](alg: RAlgebra[F, A])(f: Fix[F])(implicit F: Functor[F]): A
cata that has access to current subtree (Fix[F]) as well as that subtree's folded result (A)
-
def
postpro[F[_], A](coalg: FCoalgebra[F, A], pro: ~>[F, F])(a: A)(implicit F: Functor[F]): Fix[F]
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.
-
def
prepro[F[_], A](pre: ~>[F, F], alg: FAlgebra[F, A])(f: Fix[F])(implicit F: Functor[F]): A
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.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()