object DeprecatedEqInstances
- Annotations
- @deprecated
- Deprecated
(Since version 2.0) These instances are questionable and can lead to false positives. For the sake of compatibility, they haven't been removed, but they should be considered to be deprecated, and we put them in a lower implicit scope priority.
- Source
- Eq.scala
- Alphabetic
- By Inheritance
- DeprecatedEqInstances
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- implicit def catsLawsEqForAndThen[A, B](implicit A: Arbitrary[A], B: kernel.Eq[B]): kernel.Eq[AndThen[A, B]]
Eq[AndThen]instance, built by piggybacking on catsLawsEqForFn1. - implicit def catsLawsEqForBand[A](implicit arbAA: Arbitrary[(A, A)], eqSA: kernel.Eq[kernel.Semigroup[A]], eqA: kernel.Eq[A]): kernel.Eq[Band[A]]
- implicit def catsLawsEqForCommutativeSemigroup[A](implicit arbAA: Arbitrary[(A, A)], eqA: kernel.Eq[A]): kernel.Eq[CommutativeSemigroup[A]]
- implicit def catsLawsEqForEq[A](implicit arbA: Arbitrary[(A, A)]): kernel.Eq[kernel.Eq[A]]
- implicit def catsLawsEqForEquiv[A](implicit arbA: Arbitrary[(A, A)]): kernel.Eq[Equiv[A]]
- implicit def catsLawsEqForFn2[A, B, C](implicit A: Arbitrary[A], B: Arbitrary[B], C: kernel.Eq[C]): kernel.Eq[(A, B) => C]
Create an approximation of Eq[(A, B) => C] by generating random values for A and B and comparing the application of the two functions.
- implicit def catsLawsEqForGroup[A](implicit arbAA: Arbitrary[(A, A)], eqMA: kernel.Eq[kernel.Monoid[A]], eqA: kernel.Eq[A]): kernel.Eq[kernel.Group[A]]
- implicit def catsLawsEqForHash[A](implicit arbA: Arbitrary[A]): kernel.Eq[kernel.Hash[A]]
Creates an approximation of
Eq[Hash[A]]by generating 100 values for A and comparing the application of the two hash functions. - implicit def catsLawsEqForOrder[A](implicit arbA: Arbitrary[(A, A)]): kernel.Eq[kernel.Order[A]]
- implicit def catsLawsEqForOrdering[A](implicit arbA: Arbitrary[(A, A)]): kernel.Eq[Ordering[A]]
- implicit def catsLawsEqForPartialOrder[A](implicit arbA: Arbitrary[(A, A)], optIntEq: kernel.Eq[Option[Int]]): kernel.Eq[kernel.PartialOrder[A]]
- implicit def catsLawsEqForPartialOrdering[A](implicit arbA: Arbitrary[(A, A)], optIntEq: kernel.Eq[Option[Int]]): kernel.Eq[PartialOrdering[A]]
- implicit def catsLawsEqForSemigroup[A](implicit arbAA: Arbitrary[(A, A)], eqA: kernel.Eq[A]): kernel.Eq[kernel.Semigroup[A]]
Create an approximation of
Eq[Semigroup[A]]by generating values for A and comparing the application of the two combine functions. - implicit def catsLawsEqForShow[A](implicit arg0: Arbitrary[A]): kernel.Eq[Show[A]]
Create an approximation of
Eq[Show[A]]by using catsLawsEqForFn1[A, String] - def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def sampledEq[A, B, C](samples: Int)(f: (A, B) => C)(implicit arg0: Arbitrary[B], arg1: kernel.Eq[C]): kernel.Eq[A]
Create an approximate Eq instance for some type A, by comparing the behavior of
f(x, b)andf(y, b)across manybsamples. - final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
Deprecated Value Members
- implicit def catsLawsEqForFn1[A, B](implicit A: Arbitrary[A], B: kernel.Eq[B]): kernel.Eq[(A) => B]
Create an approximation of Eq[A => B] by generating random values for A and comparing the application of the two functions.
Create an approximation of Eq[A => B] by generating random values for A and comparing the application of the two functions.
- Annotations
- @deprecated
- Deprecated
(Since version 1.7) This instance is problematic and will most likely be removed in a future version of Cats. Use catsLawsEqForFn1Exhaustive instead. See https://github.com/typelevel/cats/pull/2577 for more information.