scalaz

Cofree

object Cofree extends CofreeInstances

Source
Cofree.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Cofree
  2. CofreeInstances
  3. CofreeInstances0
  4. CofreeInstances1
  5. CofreeInstances2
  6. CofreeInstances3
  7. CofreeInstances4
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def apply[S[_], A](h: A, t: S[Cofree[S, A]]): Cofree[S, A]

  7. def applyT[S[_], A](a: A, tf: Free[Function0, S[Cofree[S, A]]])(implicit T: Functor[[a]Free[Function0, a]]): Cofree[S, A]

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. implicit def cofreeBind[F[_]](implicit arg0: Plus[F], arg1: Functor[F]): Bind[[β$4$]Cofree[F, β$4$]]

    Definition Classes
    CofreeInstances2
  11. implicit def cofreeComonad[S[_]](implicit arg0: Functor[S]): Comonad[[β$9$]Cofree[S, β$9$]]

    Definition Classes
    CofreeInstances
  12. implicit def cofreeFoldable[F[_]](implicit arg0: Foldable[F]): Foldable1[[β$0$]Cofree[F, β$0$]]

    low priority Foldable1 instance

    low priority Foldable1 instance

    Definition Classes
    CofreeInstances4
  13. 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
  14. implicit def cofreeMonad[F[_]](implicit arg0: PlusEmpty[F], arg1: Functor[F]): Monad[[β$8$]Cofree[F, β$8$]]

    Definition Classes
    CofreeInstances0
  15. implicit def cofreeTraverse[F[_]](implicit arg0: Traverse[F]): Traverse1[[β$1$]Cofree[F, β$1$]]

    low priority Traverse1 instance

    low priority Traverse1 instance

    Definition Classes
    CofreeInstances3
  16. 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
  17. implicit def cofreeZipApplicative[F[_]](implicit arg0: Applicative[F]): Applicative[[β$7$]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes
    CofreeInstances0
  18. implicit def cofreeZipApply[F[_]](implicit arg0: Apply[F]): Apply[[β$6$]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes
    CofreeInstances1
  19. implicit def cofreeZipFunctor[F[_]](implicit arg0: Functor[F]): Functor[[β$2$]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes
    CofreeInstances3
  20. def delay[S[_], A](h: A, t: ⇒ S[Cofree[S, A]]): Cofree[S, A]

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

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

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

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

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

    Definition Classes
    AnyRef → Any
  26. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  27. def mapUnfold[F[_], W[_], A](z: W[A])(f: ~>[W, F])(implicit W: Comonad[W]): Cofree[F, A]

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

    Definition Classes
    AnyRef
  29. final def notify(): Unit

    Definition Classes
    AnyRef
  30. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  31. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  32. def toString(): String

    Definition Classes
    AnyRef → Any
  33. def unapply[S[_], A](c: Cofree[S, A]): Option[(A, S[Cofree[S, A]])]

  34. 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]

  35. def unfoldC[F[_], A](a: A)(f: (A) ⇒ F[A])(implicit F: Functor[F]): Cofree[F, A]

    Cofree corecursion.

  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( ... )

Inherited from CofreeInstances

Inherited from CofreeInstances0

Inherited from CofreeInstances1

Inherited from CofreeInstances2

Inherited from CofreeInstances3

Inherited from CofreeInstances4

Inherited from AnyRef

Inherited from Any

Ungrouped