Packages

object Cofree extends CofreeInstances

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Cofree
  2. CofreeInstances
  3. CofreeInstances0
  4. CofreeInstances1
  5. CofreeInstances2
  6. CofreeInstances3
  7. CofreeInstances4
  8. CofreeInstancesVersionSpecific
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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 apply[S[_], A](h: A, t: S[Cofree[S, A]]): Cofree[S, A]
  5. def applyT[S[_], A](a: A, tf: Free[Function0, S[Cofree[S, A]]])(implicit T: Functor[[a]Free[Function0, a]]): Cofree[S, A]
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  8. implicit def cofreeBind[F[_]](implicit arg0: Plus[F], arg1: Functor[F]): Bind[[β$4$]Cofree[F, β$4$]]
    Definition Classes
    CofreeInstances2
  9. implicit def cofreeComonad[S[_]](implicit arg0: Functor[S]): Comonad[[β$9$]Cofree[S, β$9$]]
    Definition Classes
    CofreeInstances
  10. implicit def cofreeFoldable[F[_]](implicit arg0: Foldable[F]): Foldable1[[β$0$]Cofree[F, β$0$]]

    low priority Foldable1 instance

    low priority Foldable1 instance

    Definition Classes
    CofreeInstances4
  11. implicit def cofreeFoldable1[F[_]](implicit arg0: Foldable1[F]): Foldable1[[β$3$]Cofree[F, β$3$]]

    high priority Foldable1 instance.

    high priority Foldable1 instance. more efficient

    Definition Classes
    CofreeInstances2
  12. implicit def cofreeMonad[F[_]](implicit arg0: PlusEmpty[F], arg1: Functor[F]): Monad[[β$8$]Cofree[F, β$8$]]
    Definition Classes
    CofreeInstances0
  13. implicit def cofreeTraverse[F[_]](implicit arg0: Traverse[F]): Traverse1[[β$1$]Cofree[F, β$1$]]

    low priority Traverse1 instance

    low priority Traverse1 instance

    Definition Classes
    CofreeInstances3
  14. implicit def cofreeTraverse1[F[_]](implicit arg0: Traverse1[F]): Traverse1[[β$5$]Cofree[F, β$5$]]

    high priority Traverse1 instance.

    high priority Traverse1 instance. more efficient

    Definition Classes
    CofreeInstances1
  15. implicit def cofreeZipApplicative[F[_]](implicit arg0: Applicative[F]): Applicative[[β$7$]TagModule.@@[Cofree[F, β$7$], Tags.Zip]]
    Definition Classes
    CofreeInstances0
  16. implicit def cofreeZipApply[F[_]](implicit arg0: Apply[F]): Apply[[β$6$]TagModule.@@[Cofree[F, β$6$], Tags.Zip]]
    Definition Classes
    CofreeInstances1
  17. implicit def cofreeZipFunctor[F[_]](implicit arg0: Functor[F]): Functor[[β$2$]TagModule.@@[Cofree[F, β$2$], Tags.Zip]]
    Definition Classes
    CofreeInstances3
  18. def delay[S[_], A](h: A, t: ⇒ S[Cofree[S, A]]): Cofree[S, A]
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  23. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. def mapUnfold[F[_], W[_], A](z: W[A])(f: ~>[W, F])(implicit W: Comonad[W]): Cofree[F, A]
  26. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  27. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  28. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  29. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. def unapply[S[_], A](c: Cofree[S, A]): Option[(A, S[Cofree[S, A]])]
  32. def unfold[F[_], A, B](b: B)(f: (B) ⇒ (A, F[B]))(implicit F: Functor[F], T: Functor[[a]Free[Function0, a]]): Cofree[F, A]
  33. def unfoldC[F[_], A](a: A)(f: (A) ⇒ F[A])(implicit F: Functor[F]): Cofree[F, A]

    Cofree corecursion.

  34. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from CofreeInstances

Inherited from CofreeInstances0

Inherited from CofreeInstances1

Inherited from CofreeInstances2

Inherited from CofreeInstances3

Inherited from CofreeInstances4

Inherited from CofreeInstancesVersionSpecific

Inherited from AnyRef

Inherited from Any

Ungrouped