eq

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. implicit def catsLawsEqForAndThen[A, B](implicit A: Arbitrary[A], B: Eq[B]): Eq[AndThen[A, B]]

   

   Eq[AndThen] instance, built by piggybacking on catsLawsEqForFn1.

6. implicit def catsLawsEqForBand[A](implicit arbAA: Arbitrary[(A, A)], eqSA: Eq[kernel.Semigroup[A]], eqA: Eq[A]): Eq[Band[A]]

   

7. implicit def catsLawsEqForBoundedSemilattice[A](implicit eqSA: Eq[Semilattice[A]], eqCA: Eq[CommutativeMonoid[A]], eqA: Eq[A]): Eq[BoundedSemilattice[A]]

   

8. implicit def catsLawsEqForCommutativeGroup[A](implicit eqMA: Eq[CommutativeMonoid[A]], eqGA: Eq[kernel.Group[A]], eqA: Eq[A]): Eq[CommutativeGroup[A]]

   

9. implicit def catsLawsEqForCommutativeMonoid[A](implicit eqSA: Eq[CommutativeSemigroup[A]], eqMA: Eq[kernel.Monoid[A]], eqA: Eq[A]): Eq[CommutativeMonoid[A]]

   

10. implicit def catsLawsEqForCommutativeSemigroup[A](implicit arbAA: Arbitrary[(A, A)], eqA: Eq[A]): Eq[CommutativeSemigroup[A]]

    

11. implicit def catsLawsEqForEq[A](implicit arbA: Arbitrary[(A, A)]): Eq[Eq[A]]

    

12. implicit def catsLawsEqForEquiv[A](implicit arbA: Arbitrary[(A, A)]): Eq[Equiv[A]]

    

13. implicit def catsLawsEqForFn1[A, B](implicit A: Arbitrary[A], B: Eq[B]): Eq[(A) ⇒ B]

    

    Create an approximation of Eq[A => B] by generating 100 values for A and comparing the application of the two functions.

14. implicit def catsLawsEqForFn2[A, B, C](implicit A: Arbitrary[A], B: Arbitrary[B], C: Eq[C]): Eq[(A, B) ⇒ C]

    

    Create an approximation of Eq[(A, B) => C] by generating 100 values for A and B and comparing the application of the two functions.

15. implicit def catsLawsEqForGroup[A](implicit arbAA: Arbitrary[(A, A)], eqMA: Eq[kernel.Monoid[A]], eqA: Eq[A]): Eq[kernel.Group[A]]

    

16. implicit def catsLawsEqForHash[A](implicit arbA: Arbitrary[A]): 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.

17. implicit def catsLawsEqForMonoid[A](implicit eqSA: Eq[kernel.Semigroup[A]], eqA: Eq[A]): Eq[kernel.Monoid[A]]

    

18. implicit def catsLawsEqForOrder[A](implicit arbA: Arbitrary[(A, A)]): Eq[kernel.Order[A]]

    

19. implicit def catsLawsEqForOrdering[A](implicit arbA: Arbitrary[(A, A)]): Eq[Ordering[A]]

    

20. implicit def catsLawsEqForPartialOrder[A](implicit arbA: Arbitrary[(A, A)], optIntEq: Eq[Option[Int]]): Eq[kernel.PartialOrder[A]]

    

21. implicit def catsLawsEqForPartialOrdering[A](implicit arbA: Arbitrary[(A, A)], optIntEq: Eq[Option[Int]]): Eq[PartialOrdering[A]]

    

22. implicit def catsLawsEqForRepresentableStore[F[_], S, A](implicit arg0: Representable[F], eqFA: Eq[F[A]], eqS: Eq[S]): Eq[RepresentableStore[F, S, A]]

    

23. implicit def catsLawsEqForSemigroup[A](implicit arbAA: Arbitrary[(A, A)], eqA: Eq[A]): 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.

24. implicit def catsLawsEqForSemilattice[A](implicit eqBA: Eq[Band[A]], eqCA: Eq[CommutativeSemigroup[A]], eqA: Eq[A]): Eq[Semilattice[A]]

    

25. implicit def catsLawsEqForShow[A](implicit arg0: Arbitrary[A]): Eq[Show[A]]

    

    Create an approximation of Eq[Show[A]] by using catsLawsEqForFn1[A, String]

26. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

28. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

29. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

30. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

31. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

32. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

33. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

34. final def notify(): Unit

    

    Definition Classes

    AnyRef

35. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

36. def sampledEq[A, B, C](samples: Int)(f: (A, B) ⇒ C)(implicit arg0: Arbitrary[B], arg1: Eq[C]): Eq[A]

    

    Create an approximate Eq instance for some type A, by comparing the behavior of f(x, b) and f(y, b) across many b samples.

37. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

38. def toString(): String

    

    Definition Classes

    AnyRef → Any

39. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

40. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

41. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )