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]], B: Monoid[B], CogenA: Cogen[A], CogenB: Cogen[B], EqB: Eq[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
-
-
def
nonEmptyTraverse[G[_], A, B, C, M, X[_], Y[_]](implicit arg0: Applicative[G], arg1: Arbitrary[A], arg2: Arbitrary[B], arg3: Arbitrary[C], arg4: Arbitrary[M], arg5: Applicative[X], arg6: Applicative[Y], ArbFA: Arbitrary[F[A]], ArbXB: Arbitrary[X[B]], ArbYB: Arbitrary[Y[B]], ArbYC: Arbitrary[Y[C]], ArbFB: Arbitrary[F[B]], ArbFGA: Arbitrary[F[G[A]]], ArbGB: Arbitrary[G[B]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenM: Cogen[M], M: Monoid[M], MB: Monoid[B], EqFA: Eq[F[A]], EqFC: Eq[F[C]], EqG: Eq[G[Unit]], EqM: Eq[M], EqA: Eq[A], EqB: Eq[B], EqXYFC: Eq[X[Y[F[C]]]], EqXFB: Eq[X[F[B]]], EqYFB: Eq[Y[F[B]]], EqOptionA: Eq[Option[A]]): RuleSet
-
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], EqOptionA: Eq[Option[A]], MonoidB: Monoid[B]): RuleSet
-
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: Applicative[X], arg5: Applicative[Y], ArbFA: Arbitrary[F[A]], ArbXB: Arbitrary[X[B]], ArbYB: Arbitrary[Y[B]], ArbYC: Arbitrary[Y[C]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenM: Cogen[M], M: Monoid[M], EqFA: Eq[F[A]], EqFC: Eq[F[C]], EqM: Eq[M], EqXYFC: Eq[X[Y[F[C]]]], EqXFB: Eq[X[F[B]]], EqYFB: Eq[Y[F[B]]], EqOptionA: Eq[Option[A]]): RuleSet
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit