Law1M

abstract def apply[F[+_], A](fa: F[A])(implicit arg0: CapsF[F], arg1: Caps[A]): URIO[R, TestResult]

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[CapsF1[x[+_]] <: CapsF[x[_]], Caps1[x] <: Caps[x], R1 <: R](that: Covariant[CapsF1, Caps1, R1]): Covariant[CapsF1, Caps1, R1]

Combine these laws with the specified laws to produce a set of laws that require both sets of laws to be satisfied.

final def ==(arg0: Any): Boolean

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def run[R1 <: R with TestConfig, F[+_], A](genF: GenF[R1, F], gen: Gen[R1, A])(implicit arg0: CapsF[F], arg1: Caps[A]): ZIO[R1, Nothing, TestResult]

Test that values of type F[+_] satisfy the laws using the specified function to construct a generator of F[A] values given a generator of A values.

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