Type Members
-
class
DefaultRuleSet extends RuleSet with HasOneParent
-
trait
HasOneParent extends AnyRef
-
trait
RuleSet extends AnyRef
-
class
SimpleRuleSet extends DefaultRuleSet
Abstract Value Members
-
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
-
-
-
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
-
def
functor[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
invariant[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traverse[A, B, C, M, X[_], Y[_]](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: Arbitrary[M], arg4: CommutativeApplicative[X], arg5: CommutativeApplicative[Y], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbXB: Arbitrary[X[B]], ArbXM: Arbitrary[X[M]], ArbYB: Arbitrary[Y[B]], ArbYC: Arbitrary[Y[C]], ArbYM: Arbitrary[Y[M]], ArbFXM: Arbitrary[F[X[M]]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenM: Cogen[M], M: CommutativeMonoid[M], MA: CommutativeMonoid[A], EqFA: Eq[F[A]], EqFC: Eq[F[C]], EqM: Eq[M], EqA: Eq[A], EqXYFC: Eq[X[Y[F[C]]]], EqXFB: Eq[X[F[B]]], EqYFB: Eq[Y[F[B]]], EqXFM: Eq[X[F[M]]], EqYFM: Eq[Y[F[M]]], EqOptionA: Eq[Option[A]]): RuleSet
-
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
-
def
unorderedTraverse[A, B, C, X[_], Y[_]](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: CommutativeApplicative[X], arg4: CommutativeApplicative[Y], ArbFA: Arbitrary[F[A]], ArbFXB: Arbitrary[F[X[B]]], ArbXB: Arbitrary[X[B]], ArbYB: Arbitrary[Y[B]], ArbYC: Arbitrary[Y[C]], CogenA: Cogen[A], CogenB: Cogen[B], Ca: CommutativeMonoid[A], Cb: CommutativeMonoid[B], EqA: Eq[A], EqB: Eq[B], EqXYFC: Eq[X[Y[F[C]]]], EqXFB: Eq[X[F[B]]], EqYFB: Eq[Y[F[B]]]): RuleSet
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit