com.twitter.algebird

BaseProperties

object BaseProperties

Base properties useful for all tests using Algebird's typeclasses.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BaseProperties
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class DefaultHigherEq[M[_]] extends HigherEq[M]

  2. trait HigherEq[M[_]] extends AnyRef

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. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def commutativeMonoidLaws[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop

  7. def commutativeMonoidLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop

  8. def commutativeSemigroupLaws[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop

  9. def commutativeSemigroupLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop

  10. def defaultEq[T](t0: T, t1: T): Boolean

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

    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  13. def fieldLaws[T](implicit arg0: Field[T], arg1: Arbitrary[T]): Prop

  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes
    AnyRef → Any

  16. def groupLaws[T](implicit arg0: Group[T], arg1: Arbitrary[T]): Prop

  17. def groupLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Group[T], arg1: Arbitrary[T]): Prop

  18. def hasAdditiveInverses[T](implicit arg0: Group[T], arg1: Arbitrary[T]): Prop

  19. def hasAdditiveInversesDifferentTypes[T, U <: T](implicit arg0: Group[T], arg1: Arbitrary[U]): Prop

  20. def hasMultiplicativeInverse[T](implicit arg0: Field[T], arg1: Arbitrary[T]): Prop

  21. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  22. def isAssociative[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop

  23. def isAssociativeDifferentTypes[T, U <: T](implicit arg0: Semigroup[T], arg1: Arbitrary[U]): Prop

  24. def isAssociativeEq[T, U <: T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[U]): Prop

  25. def isCommutative[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop

  26. def isCommutativeEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop

  27. def isDistributive[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

  28. def isDistributiveDifferentTypes[T, U <: T](implicit arg0: Ring[T], arg1: Arbitrary[U]): Prop

  29. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  30. def isNonZero[V](v: V)(implicit arg0: Semigroup[V]): Boolean

  31. def isNonZeroWorksMonoid[T](implicit arg0: Monoid[T], arg1: Arbitrary[T], arg2: Equiv[T]): Prop

  32. def isNonZeroWorksRing[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

  33. def monoidLaws[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop

  34. def monoidLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop

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

    Definition Classes
    AnyRef

  36. final def notify(): Unit

    Definition Classes
    AnyRef

  37. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  38. def pseudoRingLaws[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

  39. def ringLaws[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

  40. def semigroupLaws[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop

  41. def semigroupLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop

  42. def semigroupLawsEquiv[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T], arg2: Equiv[T]): Prop

  43. def semigroupSumWorks[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T], arg2: Equiv[T]): Prop

  44. def semiringLaws[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

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

    Definition Classes
    AnyRef

  46. def timesIsAssociative[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

  47. def toString(): String

    Definition Classes
    AnyRef → Any

  48. def validOne[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

  49. def validZero[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop

  50. def validZeroEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop

  51. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  54. def weakZero[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop

  55. def weakZeroDifferentTypes[T, U <: T](implicit arg0: Monoid[T], arg1: Arbitrary[U]): Prop

  56. def zeroAnnihilates[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop

Inherited from AnyRef

Inherited from Any

Ungrouped