object
ApplicativeLaws
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
-
def
applicativeLaws[M[_], T, U, V](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arbMt: Arbitrary[T], arbMts: Arbitrary[Seq[T]], arbMu: Arbitrary[U], arbFn: Arbitrary[(T) ⇒ U], arbJoinFn: Arbitrary[(T, U) ⇒ V]): Prop
-
def
applyLaw[M[_], T, U](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arb: Arbitrary[T], arbFn: Arbitrary[(T) ⇒ U]): Prop
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
joinLaw[M[_], T, U](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arb1: Arbitrary[T], arb2: Arbitrary[U]): Prop
-
def
joinWithLaw[M[_], T, U, V](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arbT: Arbitrary[T], arbU: Arbitrary[U], arbJoinFn: Arbitrary[(T, U) ⇒ V]): Prop
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
sequenceLaw[M[_], T](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arb: Arbitrary[Seq[T]]): Prop
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Basic Applicative laws, useful for testing any app.