Cofree

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[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. implicit def cofreeBind[F[_]](implicit arg0: Plus[F], arg1: Functor[F]): Bind[[α]Cofree[F, α]]

   

   Definition Classes

   CofreeInstances2

9. implicit def cofreeComonad[S[_]](implicit arg0: Functor[S]): Comonad[[x]Cofree[S, x]]

   

   Definition Classes

   CofreeInstances

10. implicit def cofreeEqual[A, F[_]](implicit A: Equal[A], F: ~>[Equal, [α]Equal[F[α]]]): Equal[Cofree[F, A]]

    

    Definition Classes

    CofreeInstances0

11. implicit def cofreeFoldable[F[_]](implicit arg0: Foldable[F]): Foldable1[[α]Cofree[F, α]]

    

    low priority Foldable1 instance

    low priority Foldable1 instance

    Definition Classes

    CofreeInstances4

12. implicit def cofreeFoldable1[F[_]](implicit arg0: Foldable1[F]): Foldable1[[α]Cofree[F, α]]

    

    high priority Foldable1 instance.

    high priority Foldable1 instance. more efficient

    Definition Classes

    CofreeInstances2

13. implicit def cofreeMonad[F[_]](implicit arg0: PlusEmpty[F], arg1: Functor[F]): Monad[[α]Cofree[F, α]]

    

    Definition Classes

    CofreeInstances0

14. implicit def cofreeTraverse[F[_]](implicit arg0: Traverse[F]): Traverse1[[α]Cofree[F, α]]

    

    low priority Traverse1 instance

    low priority Traverse1 instance

    Definition Classes

    CofreeInstances3

15. implicit def cofreeTraverse1[F[_]](implicit arg0: Traverse1[F]): Traverse1[[α]Cofree[F, α]]

    

    high priority Traverse1 instance.

    high priority Traverse1 instance. more efficient

    Definition Classes

    CofreeInstances1

16. implicit def cofreeZipApplicative[F[_]](implicit arg0: Applicative[F]): Applicative[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    

    Definition Classes

    CofreeInstances0

17. implicit def cofreeZipApply[F[_]](implicit arg0: Apply[F]): Apply[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    

    Definition Classes

    CofreeInstances1

18. implicit def cofreeZipEqual[A, F[_]](implicit A: Equal[A], F: ~>[Equal, [α]Equal[F[α]]]): Equal[CofreeZip[F, A]]

    

    Definition Classes

    CofreeInstances0

19. implicit def cofreeZipFunctor[F[_]](implicit arg0: Functor[F]): Functor[[α]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]

    

    Definition Classes

    CofreeFunctions

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]

    

    Definition Classes

    CofreeFunctions

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

    

    Cofree corecursion.

    Cofree corecursion.

    Definition Classes

    CofreeFunctions

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