object
BaseProperties
Type Members
-
-
trait
HigherEq[M[_]] extends AnyRef
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
commutativeMonoidLaws[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop
-
def
commutativeMonoidLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop
-
def
commutativeSemigroupLaws[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop
-
def
commutativeSemigroupLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop
-
def
defaultEq[T](t0: T, t1: T): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
fieldLaws[T](implicit arg0: Field[T], arg1: Arbitrary[T]): Prop
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
groupLaws[T](implicit arg0: Group[T], arg1: Arbitrary[T]): Prop
-
def
groupLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Group[T], arg1: Arbitrary[T]): Prop
-
def
hasAdditiveInverses[T](implicit arg0: Group[T], arg1: Arbitrary[T]): Prop
-
def
hasAdditiveInversesDifferentTypes[T, U <: T](implicit arg0: Group[T], arg1: Arbitrary[U]): Prop
-
def
hasMultiplicativeInverse[T](implicit arg0: Field[T], arg1: Arbitrary[T]): Prop
-
def
hashCode(): Int
-
def
isAssociative[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop
-
def
isAssociativeDifferentTypes[T, U <: T](implicit arg0: Semigroup[T], arg1: Arbitrary[U]): Prop
-
def
isAssociativeEq[T, U <: T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[U]): Prop
-
def
isCommutative[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop
-
def
isCommutativeEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop
-
def
isDistributive[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
-
def
isDistributiveDifferentTypes[T, U <: T](implicit arg0: Ring[T], arg1: Arbitrary[U]): Prop
-
final
def
isInstanceOf[T0]: Boolean
-
def
isNonZero[V](v: V)(implicit arg0: Semigroup[V]): Boolean
-
def
isNonZeroWorksMonoid[T](implicit arg0: Monoid[T], arg1: Arbitrary[T], arg2: Equiv[T]): Prop
-
def
isNonZeroWorksRing[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
-
def
monoidLaws[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop
-
def
monoidLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
pseudoRingLaws[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
-
def
ringLaws[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
-
def
semigroupLaws[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop
-
def
semigroupLawsEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Semigroup[T], arg1: Arbitrary[T]): Prop
-
def
semigroupLawsEquiv[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T], arg2: Equiv[T]): Prop
-
def
semigroupSumWorks[T](implicit arg0: Semigroup[T], arg1: Arbitrary[T], arg2: Equiv[T]): Prop
-
def
semiringLaws[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
timesIsAssociative[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
-
def
toString(): String
-
def
validOne[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
-
def
validZero[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop
-
def
validZeroEq[T](eqfn: (T, T) ⇒ Boolean)(implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
weakZero[T](implicit arg0: Monoid[T], arg1: Arbitrary[T]): Prop
-
def
weakZeroDifferentTypes[T, U <: T](implicit arg0: Monoid[T], arg1: Arbitrary[U]): Prop
-
def
zeroAnnihilates[T](implicit arg0: Ring[T], arg1: Arbitrary[T]): Prop
Inherited from AnyRef
Inherited from Any
Base properties useful for all tests using Algebird's typeclasses.