Class

matryoshka.patterns

DiffInstances0

Related Doc: package patterns

Permalink

sealed abstract class DiffInstances0 extends AnyRef

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DiffInstances0
  2. AnyRef
  3. Any
Implicitly
  1. by toIdOps
  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. def ana[T[_[_]], F[_]](f: (DiffInstances0) ⇒ F[DiffInstances0])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  5. def anaM[T[_[_]], M[_], F[_]](f: (DiffInstances0) ⇒ M[F[DiffInstances0]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  6. def apo[T[_[_]], F[_]](f: (DiffInstances0) ⇒ F[\/[T[F], DiffInstances0]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  7. def apoM[T[_[_]], M[_], F[_]](f: (DiffInstances0) ⇒ M[F[\/[T[F], DiffInstances0]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. def attributeAna[F[_]](ψ: (DiffInstances0) ⇒ F[DiffInstances0])(implicit arg0: Functor[F]): Cofree[F, DiffInstances0]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  10. def attributeAnaM[M[_], F[_]](ψ: (DiffInstances0) ⇒ M[F[DiffInstances0]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[Cofree[F, DiffInstances0]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  11. def chrono[F[_], B](g: (F[Cofree[F, B]]) ⇒ B, f: (DiffInstances0) ⇒ F[Free[F, DiffInstances0]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  12. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def codyna[F[_], B](φ: (F[B]) ⇒ B, ψ: (DiffInstances0) ⇒ F[Free[F, DiffInstances0]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  14. def codynaM[M[_], F[_], B](φ: (F[B]) ⇒ M[B], ψ: (DiffInstances0) ⇒ M[F[Free[F, DiffInstances0]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  15. def coelgot[F[_], B](φ: ((DiffInstances0, F[B])) ⇒ B, ψ: (DiffInstances0) ⇒ F[DiffInstances0])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  16. def coelgotM[M[_]]: IdOps.CoelgotMPartiallyApplied[M]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  17. def dyna[F[_], B](φ: (F[Cofree[F, B]]) ⇒ B, ψ: (DiffInstances0) ⇒ F[DiffInstances0])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  18. def elgot[F[_], B](φ: (F[B]) ⇒ B, ψ: (DiffInstances0) ⇒ \/[B, F[DiffInstances0]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  19. def elgotAna[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (DiffInstances0) ⇒ M[F[DiffInstances0]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  20. def elgotApo[T[_[_]], F[_]](f: (DiffInstances0) ⇒ \/[T[F], F[DiffInstances0]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  21. final def eq(arg0: AnyRef): Boolean

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  24. def freeAna[F[_], B](ψ: (DiffInstances0) ⇒ \/[B, F[DiffInstances0]])(implicit arg0: Functor[F]): Free[F, B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  25. implicit def functor[T[_[_]], F[_]](implicit arg0: Functor[F]): Functor[[γ]Diff[T, F, γ]]

    Permalink
  26. def futu[T[_[_]], F[_]](f: (DiffInstances0) ⇒ F[Free[F, DiffInstances0]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  27. def futuM[T[_[_]], M[_], F[_]](f: (DiffInstances0) ⇒ M[F[Free[F, DiffInstances0]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  28. def gana[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (DiffInstances0) ⇒ F[M[DiffInstances0]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  29. def ganaM[T[_[_]], M[_], N[_], F[_]](k: DistributiveLaw[M, F], f: (DiffInstances0) ⇒ N[F[M[DiffInstances0]]])(implicit arg0: Monad[M], arg1: Traverse[M], arg2: Monad[N], arg3: Traverse[F], T: Corecursive[T]): N[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  30. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  31. def ghylo[W[_], M[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ B, g: (DiffInstances0) ⇒ F[M[DiffInstances0]])(implicit arg0: Comonad[W], arg1: Monad[M], arg2: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  32. def ghyloM[W[_], M[_], N[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ N[B], g: (DiffInstances0) ⇒ N[F[M[DiffInstances0]]])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], arg3: Traverse[M], arg4: Monad[N], arg5: Traverse[F]): N[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  33. def gpostpro[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], e: ~>[F, F], g: (DiffInstances0) ⇒ F[M[DiffInstances0]])(implicit arg0: Recursive[T], arg1: Monad[M], arg2: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  34. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  35. def hylo[F[_], B](f: (F[B]) ⇒ B, g: (DiffInstances0) ⇒ F[DiffInstances0])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  36. def hyloM[M[_], F[_], B](f: (F[B]) ⇒ M[B], g: (DiffInstances0) ⇒ M[F[DiffInstances0]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  37. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  38. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  39. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  40. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  41. def postpro[T[_[_]], F[_]](e: ~>[F, F], g: (DiffInstances0) ⇒ F[DiffInstances0])(implicit arg0: Recursive[T], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from DiffInstances0 to IdOps[DiffInstances0] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps
  42. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toIdOps from DiffInstances0 to IdOps[DiffInstances0]

Ungrouped