object Cofree extends CofreeInstances with CofreeFunctions
- Source
- Cofree.scala
- Alphabetic
- By Inheritance
- Cofree
- CofreeFunctions
- CofreeInstances
- CofreeInstances0
- CofreeInstances1
- CofreeInstances2
- CofreeInstances3
- CofreeInstances4
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[S[_], A](h: A, t: S[Cofree[S, A]]): Cofree[S, A]
- def applyT[S[_], A](a: A, tf: Free[Function0, S[Cofree[S, A]]])(implicit T: Functor[[a]Free[Function0, a]]): Cofree[S, A]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
implicit
def
cofreeBind[F[_]](implicit arg0: Plus[F], arg1: Functor[F]): Bind[[α]Cofree[F, α]]
- Definition Classes
- CofreeInstances2
-
implicit
def
cofreeComonad[S[_]](implicit arg0: Functor[S]): Comonad[[x]Cofree[S, x]]
- Definition Classes
- CofreeInstances
-
implicit
def
cofreeEqual[A, F[_]](implicit A: Equal[A], F: ~>[Equal, [α]Equal[F[α]]]): Equal[Cofree[F, A]]
- Definition Classes
- CofreeInstances0
-
implicit
def
cofreeFoldable[F[_]](implicit arg0: Foldable[F]): Foldable1[[α]Cofree[F, α]]
low priority
Foldable1
instancelow priority
Foldable1
instance- Definition Classes
- CofreeInstances4
-
implicit
def
cofreeFoldable1[F[_]](implicit arg0: Foldable1[F]): Foldable1[[α]Cofree[F, α]]
high priority
Foldable1
instance.high priority
Foldable1
instance. more efficient- Definition Classes
- CofreeInstances2
-
implicit
def
cofreeMonad[F[_]](implicit arg0: PlusEmpty[F], arg1: Functor[F]): Monad[[α]Cofree[F, α]]
- Definition Classes
- CofreeInstances0
-
implicit
def
cofreeTraverse[F[_]](implicit arg0: Traverse[F]): Traverse1[[α]Cofree[F, α]]
low priority
Traverse1
instancelow priority
Traverse1
instance- Definition Classes
- CofreeInstances3
-
implicit
def
cofreeTraverse1[F[_]](implicit arg0: Traverse1[F]): Traverse1[[α]Cofree[F, α]]
high priority
Traverse1
instance.high priority
Traverse1
instance. more efficient- Definition Classes
- CofreeInstances1
-
implicit
def
cofreeZipApplicative[F[_]](implicit arg0: Applicative[F]): Applicative[[α]AnyRef { ... /* 2 definitions in type refinement */ }]
- Definition Classes
- CofreeInstances0
-
implicit
def
cofreeZipApply[F[_]](implicit arg0: Apply[F]): Apply[[α]AnyRef { ... /* 2 definitions in type refinement */ }]
- Definition Classes
- CofreeInstances1
-
implicit
def
cofreeZipEqual[A, F[_]](implicit A: Equal[A], F: ~>[Equal, [α]Equal[F[α]]]): Equal[CofreeZip[F, A]]
- Definition Classes
- CofreeInstances0
-
implicit
def
cofreeZipFunctor[F[_]](implicit arg0: Functor[F]): Functor[[α]AnyRef { ... /* 2 definitions in type refinement */ }]
- Definition Classes
- CofreeInstances3
- def delay[S[_], A](h: A, t: ⇒ S[Cofree[S, A]]): Cofree[S, A]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
mapUnfold[F[_], W[_], A](z: W[A])(f: ~>[W, F])(implicit W: Comonad[W]): Cofree[F, A]
- Definition Classes
- CofreeFunctions
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def unapply[S[_], A](c: Cofree[S, A]): Option[(A, S[Cofree[S, A]])]
-
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
-
def
unfoldC[F[_], A](a: A)(f: (A) ⇒ F[A])(implicit F: Functor[F]): Cofree[F, A]
Cofree corecursion.
Cofree corecursion.
- Definition Classes
- CofreeFunctions
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )