trait Diffable[F[_]] extends Serializable
- Self Type
- Diffable[F]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Diffable
- Serializable
- Serializable
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
- abstract def diffImpl[T[_[_]]](l: T[F], r: T[F])(implicit arg0: BirecursiveT[T]): slamdata.Predef.Option[DiffT[T, F]]
-
abstract
def
getClass(): Class[_]
- Definition Classes
- Any
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
##(): Int
- Definition Classes
- Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
diffTraverse[T[_[_]], G[_]](left: G[T[F]], right: G[T[F]])(implicit arg0: BirecursiveT[T], arg1: Traverse[G], FF: Functor[F], FoldF: Foldable[F], FM: Merge[F]): G[DiffT[T, F]]
Useful when a case class has a
List[A]
that isn’t the finalA
.Useful when a case class has a
List[A]
that isn’t the finalA
. 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 useSimilar
rather thanLocallyDifferent
. -
def
equals(arg0: Any): Boolean
- Definition Classes
- Any
-
def
hashCode(): Int
- Definition Classes
- Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def localDiff[T[_[_]]](left: F[T[F]], right: F[T[F]])(implicit arg0: BirecursiveT[T], FT: Traverse[F], FM: Merge[F]): DiffT[T, F]
-
def
toString(): String
- Definition Classes
- Any