Object

qq.droste

kernel

Related Doc: package droste

Permalink

object kernel

Fundamental recursion schemes implemented in terms of functions and nothing else.

Linear Supertypes
Ordering
  1. Grouped
  2. Alphabetic
  3. By Inheritance
Inherited
  1. kernel
  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. final def asInstanceOf[T0]: T0

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

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hylo[F[_], A, B](algebra: (F[B]) ⇒ B, coalgebra: (A) ⇒ F[A]): (A) ⇒ B

    Permalink

    [use case] Build a hylomorphism by recursively unfolding with coalgebra and refolding with algebra.

    [use case]

    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
    

    Full Signature

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

  12. def hyloC[F[_], G[_], A, B](algebra: (F[G[B]]) ⇒ B, coalgebra: (A) ⇒ F[G[A]]): (A) ⇒ B

    Permalink

    [use case] Convenience to build a hylomorphism for the composed functor F[G[_]].

    [use case]

    Convenience to build a hylomorphism for the composed functor F[G[_]].

    This is strictly for convenience and just delegates to hylo with the types set properly.

    Full Signature

    def hyloC[F[_], G[_], A, B](algebra: (F[G[B]]) ⇒ B, coalgebra: (A) ⇒ F[G[A]])(implicit arg0: Functor[F], arg1: Functor[G]): (A) ⇒ B

  13. def hyloM[M[_], F[_], A, B](algebra: (F[B]) ⇒ M[B], coalgebra: (A) ⇒ M[F[A]]): (A) ⇒ M[B]

    Permalink

    [use case] Build a monadic hylomorphism

    [use case]

    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
    

    Full Signature

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

  14. def hyloMC[M[_], F[_], G[_], A, B](algebra: (F[G[B]]) ⇒ M[B], coalgebra: (A) ⇒ M[F[G[A]]]): (A) ⇒ M[B]

    Permalink

    [use case] Convenience to build a monadic hylomorphism for the composed functor F[G[_]].

    [use case]

    Convenience to build a monadic hylomorphism for the composed functor F[G[_]].

    Full Signature

    def hyloMC[M[_], F[_], G[_], A, B](algebra: (F[G[B]]) ⇒ M[B], coalgebra: (A) ⇒ M[F[G[A]]])(implicit arg0: Monad[M], arg1: Traverse[F], arg2: Traverse[G]): (A) ⇒ M[B]

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  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. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

refolds

Ungrouped