trait ReducibleTests[F[_]] extends FoldableTests[F]
Type Members
- class DefaultRuleSet extends RuleSet with HasOneParent
- trait HasOneParent extends AnyRef
- trait RuleSet extends AnyRef
- class SimpleRuleSet extends DefaultRuleSet
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def emptyRuleSet: RuleSet
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- def foldable[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], ArbFA: Arbitrary[F[A]], A: CommutativeMonoid[A], B: CommutativeMonoid[B], CogenA: Cogen[A], CogenB: Cogen[B], EqA: Eq[A], EqFA: Eq[F[A]], EqB: Eq[B], EqOptionB: Eq[Option[B]], EqOptionA: Eq[Option[A]]): RuleSet
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def reducible[G[_], A, B](implicit arg0: Applicative[G], arg1: Arbitrary[A], arg2: Arbitrary[B], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFGA: Arbitrary[F[G[A]]], ArbGB: Arbitrary[G[B]], CogenA: Cogen[A], CogenB: Cogen[B], EqG: Eq[G[Unit]], EqA: Eq[A], EqB: Eq[B], EqFA: Eq[F[A]], EqOptionA: Eq[Option[A]], MonoidA: CommutativeMonoid[A], MonoidB: CommutativeMonoid[B]): RuleSet
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- def unorderedFoldable[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], ArbFA: Arbitrary[F[A]], ArbF: Arbitrary[(A) => B], CogenA: Cogen[A], A: CommutativeMonoid[A], B: CommutativeMonoid[B], EqFA: Eq[A], EqFB: Eq[B]): RuleSet
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit