Trait/Object

matryoshka.patterns

Diffable

Related Docs: object Diffable | package patterns

Permalink

trait Diffable[F[_]] extends Serializable

Self Type
Diffable[F]
Linear Supertypes
Serializable, Serializable, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Diffable
  2. Serializable
  3. Serializable
  4. Any
Implicitly
  1. by toIdOps
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def diffImpl[T[_[_]]](l: T[F], r: T[F])(implicit arg0: Recursive[T], arg1: Corecursive[T]): Option[DiffT[T, F]]

    Permalink

  2. abstract def getClass(): Class[_]

    Permalink
    Definition Classes
    Any

Concrete Value Members

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

    Permalink
    Definition Classes
    Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    Any

  4. def ana[T[_[_]], F[_]](f: (Diffable[F]) ⇒ F[Diffable[F]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  5. def anaM[T[_[_]], M[_], F[_]](f: (Diffable[F]) ⇒ M[F[Diffable[F]]])(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 Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  6. def apo[T[_[_]], F[_]](f: (Diffable[F]) ⇒ F[\/[T[F], Diffable[F]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  7. def apoM[T[_[_]], M[_], F[_]](f: (Diffable[F]) ⇒ M[F[\/[T[F], Diffable[F]]]])(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 Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  9. def attributeAna[F[_]](ψ: (Diffable[F]) ⇒ F[Diffable[F]])(implicit arg0: Functor[F]): Cofree[F, Diffable[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  10. def attributeAnaM[M[_], F[_]](ψ: (Diffable[F]) ⇒ M[F[Diffable[F]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[Cofree[F, Diffable[F]]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  11. def chrono[F[_], B](g: (F[Cofree[F, B]]) ⇒ B, f: (Diffable[F]) ⇒ F[Free[F, Diffable[F]]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  12. def codyna[F[_], B](φ: (F[B]) ⇒ B, ψ: (Diffable[F]) ⇒ F[Free[F, Diffable[F]]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  13. def codynaM[M[_], F[_], B](φ: (F[B]) ⇒ M[B], ψ: (Diffable[F]) ⇒ M[F[Free[F, Diffable[F]]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  14. def coelgot[F[_], B](φ: ((Diffable[F], F[B])) ⇒ B, ψ: (Diffable[F]) ⇒ F[Diffable[F]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  15. def coelgotM[M[_]]: IdOps.CoelgotMPartiallyApplied[M]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  16. def diffTraverse[T[_[_]], G[_]](left: G[T[F]], right: G[T[F]])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: Traverse[G], FF: Functor[F], FoldF: Foldable[F], FM: Merge[F]): G[DiffT[T, F]]

    Permalink

    Useful when a case class has a List[A] that isn’t the final A.

    Useful when a case class has a List[A] that isn’t the final A. This is because the normal comparison just walks over the children of the functor, so if the lists are different lengths, the default behavior will be confusing. Currently also useful when the only list _is_ the final parameter, because it allows you to explicitly use Similar rather than LocallyDifferent.

  17. def dyna[F[_], B](φ: (F[Cofree[F, B]]) ⇒ B, ψ: (Diffable[F]) ⇒ F[Diffable[F]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  18. def elgot[F[_], B](φ: (F[B]) ⇒ B, ψ: (Diffable[F]) ⇒ \/[B, F[Diffable[F]]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  19. def elgotAna[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (Diffable[F]) ⇒ M[F[Diffable[F]]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  20. def elgotApo[T[_[_]], F[_]](f: (Diffable[F]) ⇒ \/[T[F], F[Diffable[F]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  21. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    Any

  22. def freeAna[F[_], B](ψ: (Diffable[F]) ⇒ \/[B, F[Diffable[F]]])(implicit arg0: Functor[F]): Free[F, B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  23. def futu[T[_[_]], F[_]](f: (Diffable[F]) ⇒ F[Free[F, Diffable[F]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  24. def futuM[T[_[_]], M[_], F[_]](f: (Diffable[F]) ⇒ M[F[Free[F, Diffable[F]]]])(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 Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  25. def gana[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (Diffable[F]) ⇒ F[M[Diffable[F]]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  26. def ganaM[T[_[_]], M[_], N[_], F[_]](k: DistributiveLaw[M, F], f: (Diffable[F]) ⇒ N[F[M[Diffable[F]]]])(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 Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  27. def ghylo[W[_], M[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ B, g: (Diffable[F]) ⇒ F[M[Diffable[F]]])(implicit arg0: Comonad[W], arg1: Monad[M], arg2: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  28. def ghyloM[W[_], M[_], N[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ N[B], g: (Diffable[F]) ⇒ N[F[M[Diffable[F]]]])(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 Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  29. def gpostpro[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], e: ~>[F, F], g: (Diffable[F]) ⇒ F[M[Diffable[F]]])(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 Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  30. def hashCode(): Int

    Permalink
    Definition Classes
    Any

  31. def hylo[F[_], B](f: (F[B]) ⇒ B, g: (Diffable[F]) ⇒ F[Diffable[F]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  32. def hyloM[M[_], F[_], B](f: (F[B]) ⇒ M[B], g: (Diffable[F]) ⇒ M[F[Diffable[F]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  33. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  34. def localDiff[T[_[_]]](left: F[T[F]], right: F[T[F]])(implicit arg0: Recursive[T], arg1: Corecursive[T], FT: Traverse[F], FM: Merge[F]): DiffT[T, F]

    Permalink

  35. def postpro[T[_[_]], F[_]](e: ~>[F, F], g: (Diffable[F]) ⇒ F[Diffable[F]])(implicit arg0: Recursive[T], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Diffable[F] to IdOps[Diffable[F]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  36. def toString(): String

    Permalink
    Definition Classes
    Any

Inherited from Serializable

Inherited from Serializable

Inherited from Any

Inherited by implicit conversion toIdOps from Diffable[F] to IdOps[Diffable[F]]

Ungrouped