GenT

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def ensure(p: (A) ⇒ Boolean): GenT[A]

Discards the generator if the generated value does not satisfy the predicate.

final def eq(arg0: AnyRef): Boolean

def filter(p: (A) ⇒ Boolean): GenT[A]

Generates a value that satisfies a predicate.

def flatMap[B](f: (A) ⇒ GenT[B]): GenT[B]

def forAll: PropertyT[A]

def forAllWithLog(f: (A) ⇒ Log): PropertyT[A]

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

def lift: PropertyT[A]

def list(range: Range[Int]): GenT[List[A]]

Generates a list using a 'Range' to determine the length.

def log(name: Name): PropertyT[A]

*******************************************************************

def map[B](f: (A) ⇒ B): GenT[B]

def mapTree[B](f: (Tree[(Seed, Option[A])]) ⇒ Tree[(Seed, Option[B])]): GenT[B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def option: GenT[Option[A]]

Generates a 'None' some of the time.

def prune: GenT[A]

Throw away a generator's shrink tree.

def resize(size: Size): GenT[A]

Override the size parameter.

val run: (Size, Seed) ⇒ Tree[(Seed, Option[A])]

def scale(f: (Size) ⇒ Size): GenT[A]

Adjust the size parameter by transforming it with the given function.

def shrink(f: (A) ⇒ List[A]): GenT[A]

Apply a shrinking function to a generator.

def small: GenT[A]

Make a generator smaller by scaling its size parameter.

final def synchronized[T0](arg0: ⇒ T0): T0

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def withFilter(p: (A) ⇒ Boolean): GenT[A]

Generates a value that satisfies a predicate.

def finalize(): Unit