scheme

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def ana[F[_], A, R](coalgebra: Coalgebra[F, A])(implicit arg0: Functor[F], embed: Embed[F, R]): (A) ⇒ R

   

   Definition Classes

   SchemeConvenientPorcelain

5. def anaM[M[_], F[_], A, R](coalgebraM: CoalgebraM[M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F], embed: Embed[F, R]): (A) ⇒ M[R]

   

   Definition Classes

   SchemeConvenientPorcelain

6. def apply[PatR[_[_]]](implicit ev: Solve[PatR]): SchemePartialBasis[PatR, PatF]

   

   Convenience to specify the base constructor "shape" (such as Fix or Cofree[?[_], Int]) for recursion.

   Convenience to specify the base constructor "shape" (such as Fix or Cofree[?[_], Int]) for recursion.

   This helps to guide Scala's type inference so all of the type parameters for the various recursion scheme methods don't have to be provided.

   Definition Classes

   SchemeConvenientPorcelain

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def cata[F[_], R, B](algebra: Algebra[F, B])(implicit arg0: Functor[F], project: Project[F, R]): (R) ⇒ B

   

   Definition Classes

   SchemeConvenientPorcelain

9. def cataM[M[_], F[_], R, B](algebraM: AlgebraM[M, F, B])(implicit arg0: Monad[M], arg1: Traverse[F], project: Project[F, R]): (R) ⇒ M[B]

   

   Definition Classes

   SchemeConvenientPorcelain

10. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

14. def gana[F[_], A, S, R](scattered: Scattered[F, A, S])(implicit arg0: Functor[F], embed: Embed[F, R]): (A) ⇒ R

    

    Definition Classes

    SchemeGeneralizedPorcelain

15. def gana[F[_], A, S, R](coalgebra: GCoalgebra[F, A, S])(scatter: Scatter[F, A, S])(implicit arg0: Functor[F], embed: Embed[F, R]): (A) ⇒ R

    

    Definition Classes

    SchemeGeneralizedPlumbing

16. def ganaM[M[_], F[_], A, S, R](scattered: Scattered[M, F, A, S])(implicit arg0: Monad[M], arg1: Traverse[F], embed: Embed[F, R]): (A) ⇒ M[R]

    

    Definition Classes

    SchemeGeneralizedPorcelain

17. def ganaM[M[_], F[_], A, S, R](coalgebra: GCoalgebraM[M, F, A, S])(scatter: Scatter[F, A, S])(implicit arg0: Monad[M], arg1: Traverse[F], embed: Embed[F, R]): (A) ⇒ M[R]

    

    Definition Classes

    SchemeGeneralizedPlumbing

18. def gcata[F[_], R, S, B](gathered: Gathered[F, S, B])(implicit arg0: Functor[F], project: Project[F, R]): (R) ⇒ B

    

    Definition Classes

    SchemeGeneralizedPorcelain

19. def gcata[F[_], R, S, B](galgebra: GAlgebra[F, S, B])(gather: Gather[F, S, B])(implicit arg0: Functor[F], project: Project[F, R]): (R) ⇒ B

    

    Definition Classes

    SchemeGeneralizedPlumbing

20. def gcataM[M[_], F[_], R, S, B](gathered: Gathered[M, F, S, B])(implicit arg0: Monad[M], arg1: Traverse[F], project: Project[F, R]): (R) ⇒ M[B]

    

    Definition Classes

    SchemeGeneralizedPorcelain

21. def gcataM[M[_], F[_], R, S, B](algebra: GAlgebraM[M, F, S, B])(gather: Gather[F, S, B])(implicit arg0: Monad[M], arg1: Traverse[F], project: Project[F, R]): (R) ⇒ M[B]

    

    Definition Classes

    SchemeGeneralizedPlumbing

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

    

    Definition Classes

    AnyRef → Any

23. def ghylo[F[_], A, SA, SB, B](gathered: Gathered[F, SB, B], scattered: Scattered[F, A, SA])(implicit arg0: Functor[F]): (A) ⇒ B

    

    Definition Classes

    SchemeGeneralizedPorcelain

24. def ghylo[F[_], A, SA, SB, B](algebra: GAlgebra[F, SB, B], coalgebra: GCoalgebra[F, A, SA])(gather: Gather[F, SB, B], scatter: Scatter[F, A, SA])(implicit arg0: Functor[F]): (A) ⇒ B

    

    Definition Classes

    SchemeGeneralizedPlumbing

25. def ghyloM[M[_], F[_], A, SA, SB, B](gathered: Gathered[M, F, SB, B], scattered: Scattered[M, F, A, SA])(implicit arg0: Monad[M], arg1: Traverse[F]): (A) ⇒ M[B]

    

    Definition Classes

    SchemeGeneralizedPorcelain

26. def ghyloM[M[_], F[_], A, SA, SB, B](algebra: GAlgebraM[M, F, SB, B], coalgebra: GCoalgebraM[M, F, A, SA])(gather: Gather[F, SB, B], scatter: Scatter[F, A, SA])(implicit arg0: Monad[M], arg1: Traverse[F]): (A) ⇒ M[B]

    

    Definition Classes

    SchemeGeneralizedPlumbing

27. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

28. def hylo[F[_], A, B](algebra: Algebra[F, B], coalgebra: Coalgebra[F, A])(implicit arg0: Functor[F]): (A) ⇒ B

    

    Build a hylomorphism by recursively unfolding with coalgebra and refolding with algebra.

    Build a hylomorphism by recursively unfolding with coalgebra and refolding with algebra.

                     hylo
             A ---------------> B
             |                  ^
     co-     |                  |
    algebra  |                  | algebra
             |                  |
             v                  |
            F[A] ------------> F[B]
                   map hylo
    

    Definition Classes

    SchemeHyloPorcelain

29. def hyloM[M[_], F[_], A, B](algebra: AlgebraM[M, F, B], coalgebra: CoalgebraM[M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F]): (A) ⇒ M[B]

    

    Build a monadic hylomorphism

    Build a monadic hylomorphism

                    hyloM
             A ---------------> M[B]
             |                  ^
     co-     |                  |
    algebraM |                  | flatMap f
             |                  |
             v                  |
          M[F[A]] ---------> M[F[M[B]]]
                  map hyloM
    
    with f:
    
    F[M[B]] -----> M[F[B]] ----------> M[B]
          sequence          flatMap
                            algebraM
    

    Definition Classes

    SchemeHyloPorcelain

30. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

32. final def notify(): Unit

    

    Definition Classes

    AnyRef

33. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

35. def toString(): String

    

    Definition Classes

    AnyRef → Any

36. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

37. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39. object zoo extends Zoo

    

    A petting zoo for wild and exotic animals we keep separate from the regulars in scheme.

    A petting zoo for wild and exotic animals we keep separate from the regulars in scheme. For their safety and yours.