Object/Class

org.scalacheck

Prop

Related Docs: class Prop | package scalacheck

Permalink

object Prop extends Serializable

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Prop
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. case class Arg[+T](label: String, arg: T, shrinks: Int, origArg: T, prettyArg: Pretty, prettyOrigArg: Pretty) extends Product with Serializable

    Permalink

    A property argument

  2. sealed case class Exception(e: Throwable) extends Status with Product with Serializable

    Permalink

    Evaluating the property raised an exception

  3. class ExtendedAny[T] extends AnyRef

    Permalink

    A collection of property operators on Any values.

    A collection of property operators on Any values. Import Prop.AnyOperators to make the operators available.

  4. class ExtendedBoolean extends AnyRef

    Permalink

    A collection of property operators on Boolean values.

    A collection of property operators on Boolean values. Import Prop.propBoolean to make the operators available. The availability of this class as an implicit via #BooleanOperators will be removed in 1.15.0.

  5. case class Result(status: Status, args: List[Arg[Any]] = Nil, collected: Set[Any] = Set.empty, labels: Set[String] = Set.empty) extends Product with Serializable

    Permalink

    The result of evaluating a property

  6. sealed trait Status extends AnyRef

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. def =?[T](x: T, y: T)(implicit pp: (T) ⇒ Pretty): Prop

    Permalink

    Create a property that compares two values.

    Create a property that compares two values. If the values aren't equal, the property will fail and report that second value doesn't match the expected (first) value.

  5. def ?=[T](x: T, y: T)(implicit pp: (T) ⇒ Pretty): Prop

    Permalink

    Create a property that compares two values.

    Create a property that compares two values. If the values aren't equal, the property will fail and report that first value doesn't match the expected (second) value.

  6. implicit def AnyOperators[T](x: ⇒ T)(implicit ev: (T) ⇒ Pretty): ExtendedAny[T]

    Permalink

    Implicit method that makes a number of property operators on values of type Any available in the current scope.

    Implicit method that makes a number of property operators on values of type Any available in the current scope. See Prop.ExtendedAny for documentation on the operators.

  7. object False extends Status with Product with Serializable

    Permalink

    The property was false

  8. object Proof extends Status with Product with Serializable

    Permalink

    The property was proved

  9. object True extends Status with Product with Serializable

    Permalink

    The property was true

  10. object Undecided extends Status with Product with Serializable

    Permalink

    The property could not be falsified or proved

  11. def all(ps: Prop*): Prop

    Permalink

    Combines properties into one, which is true if and only if all the properties are true

  12. def apply(b: Boolean): Prop

    Permalink

    Create a property from a boolean value

  13. def apply(r: Result): Prop

    Permalink

    Create a property that returns the given result

  14. def apply(f: (Parameters) ⇒ Result): Prop

    Permalink

    Create a new property from the given function.

  15. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  16. def atLeastOne(ps: Prop*): Prop

    Permalink

    Combines properties into one, which is true if at least one of the properties is true

  17. def classify(c: ⇒ Boolean, ifTrue: Any, ifFalse: Any)(prop: Prop): Prop

    Permalink

    Collect data for presentation in test report

  18. def classify(c: ⇒ Boolean, ifTrue: Any)(prop: Prop): Prop

    Permalink

    Collect data for presentation in test report

  19. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  20. def collect[T](t: T)(prop: Prop): Prop

    Permalink

    Collect data for presentation in test report

  21. def collect[T, P](f: (T) ⇒ P)(implicit ev: (P) ⇒ Prop): (T) ⇒ Prop

    Permalink

    Collect data for presentation in test report

  22. def delay(p: ⇒ Prop): Prop

    Permalink

    Wraps a property to delay its evaluation.

    Wraps a property to delay its evaluation. The given parameter is evaluated each time the wrapper property is evaluated.

  23. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  24. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  25. def exception(e: Throwable): Prop

    Permalink

    A property that denotes an exception

  26. lazy val exception: Prop

    Permalink

    A property that denotes an exception

  27. def exists[A, P](g: Gen[A])(f: (A) ⇒ P)(implicit pv: (P) ⇒ Prop, pp: (A) ⇒ Pretty): Prop

    Permalink

    Existential quantifier for an explicit generator.

  28. def exists[A, P](f: (A) ⇒ P)(implicit pv: (P) ⇒ Prop, pp: (A) ⇒ Pretty, aa: Arbitrary[A]): Prop

    Permalink

    Existential quantifier for an explicit generator.

  29. lazy val falsified: Prop

    Permalink

    A property that always is false

  30. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  31. def forAll[A1, A2, A3, A4, A5, A6, A7, A8, P](f: (A1, A2, A3, A4, A5, A6, A7, A8) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], s2: Shrink[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], s3: Shrink[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], s4: Shrink[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], s5: Shrink[A5], pp5: (A5) ⇒ Pretty, a6: Arbitrary[A6], s6: Shrink[A6], pp6: (A6) ⇒ Pretty, a7: Arbitrary[A7], s7: Shrink[A7], pp7: (A7) ⇒ Pretty, a8: Arbitrary[A8], s8: Shrink[A8], pp8: (A8) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  32. def forAll[A1, A2, A3, A4, A5, A6, A7, P](f: (A1, A2, A3, A4, A5, A6, A7) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], s2: Shrink[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], s3: Shrink[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], s4: Shrink[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], s5: Shrink[A5], pp5: (A5) ⇒ Pretty, a6: Arbitrary[A6], s6: Shrink[A6], pp6: (A6) ⇒ Pretty, a7: Arbitrary[A7], s7: Shrink[A7], pp7: (A7) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  33. def forAll[A1, A2, A3, A4, A5, A6, P](f: (A1, A2, A3, A4, A5, A6) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], s2: Shrink[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], s3: Shrink[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], s4: Shrink[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], s5: Shrink[A5], pp5: (A5) ⇒ Pretty, a6: Arbitrary[A6], s6: Shrink[A6], pp6: (A6) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  34. def forAll[A1, A2, A3, A4, A5, P](f: (A1, A2, A3, A4, A5) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], s2: Shrink[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], s3: Shrink[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], s4: Shrink[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], s5: Shrink[A5], pp5: (A5) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  35. def forAll[A1, A2, A3, A4, P](f: (A1, A2, A3, A4) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], s2: Shrink[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], s3: Shrink[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], s4: Shrink[A4], pp4: (A4) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  36. def forAll[A1, A2, A3, P](f: (A1, A2, A3) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], s2: Shrink[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], s3: Shrink[A3], pp3: (A3) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  37. def forAll[A1, A2, P](f: (A1, A2) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], s2: Shrink[A2], pp2: (A2) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  38. def forAll[A1, P](f: (A1) ⇒ P)(implicit p: (P) ⇒ Prop, a1: Arbitrary[A1], s1: Shrink[A1], pp1: (A1) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  39. def forAll[T1, T2, T3, T4, T5, T6, T7, T8, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5], g6: Gen[T6], g7: Gen[T7], g8: Gen[T8])(f: (T1, T2, T3, T4, T5, T6, T7, T8) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty, s2: Shrink[T2], pp2: (T2) ⇒ Pretty, s3: Shrink[T3], pp3: (T3) ⇒ Pretty, s4: Shrink[T4], pp4: (T4) ⇒ Pretty, s5: Shrink[T5], pp5: (T5) ⇒ Pretty, s6: Shrink[T6], pp6: (T6) ⇒ Pretty, s7: Shrink[T7], pp7: (T7) ⇒ Pretty, s8: Shrink[T8], pp8: (T8) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for eight explicit generators.

    Universal quantifier for eight explicit generators. Shrinks failed arguments with the default shrink function for the type

  40. def forAll[T1, T2, T3, T4, T5, T6, T7, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5], g6: Gen[T6], g7: Gen[T7])(f: (T1, T2, T3, T4, T5, T6, T7) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty, s2: Shrink[T2], pp2: (T2) ⇒ Pretty, s3: Shrink[T3], pp3: (T3) ⇒ Pretty, s4: Shrink[T4], pp4: (T4) ⇒ Pretty, s5: Shrink[T5], pp5: (T5) ⇒ Pretty, s6: Shrink[T6], pp6: (T6) ⇒ Pretty, s7: Shrink[T7], pp7: (T7) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for seven explicit generators.

    Universal quantifier for seven explicit generators. Shrinks failed arguments with the default shrink function for the type

  41. def forAll[T1, T2, T3, T4, T5, T6, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5], g6: Gen[T6])(f: (T1, T2, T3, T4, T5, T6) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty, s2: Shrink[T2], pp2: (T2) ⇒ Pretty, s3: Shrink[T3], pp3: (T3) ⇒ Pretty, s4: Shrink[T4], pp4: (T4) ⇒ Pretty, s5: Shrink[T5], pp5: (T5) ⇒ Pretty, s6: Shrink[T6], pp6: (T6) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for six explicit generators.

    Universal quantifier for six explicit generators. Shrinks failed arguments with the default shrink function for the type

  42. def forAll[T1, T2, T3, T4, T5, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5])(f: (T1, T2, T3, T4, T5) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty, s2: Shrink[T2], pp2: (T2) ⇒ Pretty, s3: Shrink[T3], pp3: (T3) ⇒ Pretty, s4: Shrink[T4], pp4: (T4) ⇒ Pretty, s5: Shrink[T5], pp5: (T5) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for five explicit generators.

    Universal quantifier for five explicit generators. Shrinks failed arguments with the default shrink function for the type

  43. def forAll[T1, T2, T3, T4, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4])(f: (T1, T2, T3, T4) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty, s2: Shrink[T2], pp2: (T2) ⇒ Pretty, s3: Shrink[T3], pp3: (T3) ⇒ Pretty, s4: Shrink[T4], pp4: (T4) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for four explicit generators.

    Universal quantifier for four explicit generators. Shrinks failed arguments with the default shrink function for the type

  44. def forAll[T1, T2, T3, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3])(f: (T1, T2, T3) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty, s2: Shrink[T2], pp2: (T2) ⇒ Pretty, s3: Shrink[T3], pp3: (T3) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for three explicit generators.

    Universal quantifier for three explicit generators. Shrinks failed arguments with the default shrink function for the type

  45. def forAll[T1, T2, P](g1: Gen[T1], g2: Gen[T2])(f: (T1, T2) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty, s2: Shrink[T2], pp2: (T2) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for two explicit generators.

    Universal quantifier for two explicit generators. Shrinks failed arguments with the default shrink function for the type

  46. def forAll[T1, P](g1: Gen[T1])(f: (T1) ⇒ P)(implicit p: (P) ⇒ Prop, s1: Shrink[T1], pp1: (T1) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for an explicit generator.

    Universal quantifier for an explicit generator. Shrinks failed arguments with the default shrink function for the type

  47. def forAllNoShrink[A1, A2, A3, A4, A5, A6, A7, A8, P](f: (A1, A2, A3, A4, A5, A6, A7, A8) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], pp5: (A5) ⇒ Pretty, a6: Arbitrary[A6], pp6: (A6) ⇒ Pretty, a7: Arbitrary[A7], pp7: (A7) ⇒ Pretty, a8: Arbitrary[A8], pp8: (A8) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  48. def forAllNoShrink[A1, A2, A3, A4, A5, A6, A7, P](f: (A1, A2, A3, A4, A5, A6, A7) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], pp5: (A5) ⇒ Pretty, a6: Arbitrary[A6], pp6: (A6) ⇒ Pretty, a7: Arbitrary[A7], pp7: (A7) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  49. def forAllNoShrink[A1, A2, A3, A4, A5, A6, P](f: (A1, A2, A3, A4, A5, A6) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], pp5: (A5) ⇒ Pretty, a6: Arbitrary[A6], pp6: (A6) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  50. def forAllNoShrink[A1, A2, A3, A4, A5, P](f: (A1, A2, A3, A4, A5) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], pp4: (A4) ⇒ Pretty, a5: Arbitrary[A5], pp5: (A5) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  51. def forAllNoShrink[A1, A2, A3, A4, P](f: (A1, A2, A3, A4) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], pp3: (A3) ⇒ Pretty, a4: Arbitrary[A4], pp4: (A4) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  52. def forAllNoShrink[A1, A2, A3, P](f: (A1, A2, A3) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], pp2: (A2) ⇒ Pretty, a3: Arbitrary[A3], pp3: (A3) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  53. def forAllNoShrink[A1, A2, P](f: (A1, A2) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty, a2: Arbitrary[A2], pp2: (A2) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  54. def forAllNoShrink[A1, P](f: (A1) ⇒ P)(implicit pv: (P) ⇒ Prop, a1: Arbitrary[A1], pp1: (A1) ⇒ Pretty): Prop

    Permalink

    Converts a function into a universally quantified property

  55. def forAllNoShrink[T1, T2, T3, T4, T5, T6, T7, T8, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5], g6: Gen[T6], g7: Gen[T7], g8: Gen[T8])(f: (T1, T2, T3, T4, T5, T6, T7, T8) ⇒ P)(implicit p: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty, pp2: (T2) ⇒ Pretty, pp3: (T3) ⇒ Pretty, pp4: (T4) ⇒ Pretty, pp5: (T5) ⇒ Pretty, pp6: (T6) ⇒ Pretty, pp7: (T7) ⇒ Pretty, pp8: (T8) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for eight explicit generators.

    Universal quantifier for eight explicit generators. Does not shrink failed test cases.

  56. def forAllNoShrink[T1, T2, T3, T4, T5, T6, T7, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5], g6: Gen[T6], g7: Gen[T7])(f: (T1, T2, T3, T4, T5, T6, T7) ⇒ P)(implicit p: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty, pp2: (T2) ⇒ Pretty, pp3: (T3) ⇒ Pretty, pp4: (T4) ⇒ Pretty, pp5: (T5) ⇒ Pretty, pp6: (T6) ⇒ Pretty, pp7: (T7) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for seven explicit generators.

    Universal quantifier for seven explicit generators. Does not shrink failed test cases.

  57. def forAllNoShrink[T1, T2, T3, T4, T5, T6, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5], g6: Gen[T6])(f: (T1, T2, T3, T4, T5, T6) ⇒ P)(implicit p: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty, pp2: (T2) ⇒ Pretty, pp3: (T3) ⇒ Pretty, pp4: (T4) ⇒ Pretty, pp5: (T5) ⇒ Pretty, pp6: (T6) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for six explicit generators.

    Universal quantifier for six explicit generators. Does not shrink failed test cases.

  58. def forAllNoShrink[T1, T2, T3, T4, T5, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4], g5: Gen[T5])(f: (T1, T2, T3, T4, T5) ⇒ P)(implicit p: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty, pp2: (T2) ⇒ Pretty, pp3: (T3) ⇒ Pretty, pp4: (T4) ⇒ Pretty, pp5: (T5) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for five explicit generators.

    Universal quantifier for five explicit generators. Does not shrink failed test cases.

  59. def forAllNoShrink[T1, T2, T3, T4, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3], g4: Gen[T4])(f: (T1, T2, T3, T4) ⇒ P)(implicit p: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty, pp2: (T2) ⇒ Pretty, pp3: (T3) ⇒ Pretty, pp4: (T4) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for four explicit generators.

    Universal quantifier for four explicit generators. Does not shrink failed test cases.

  60. def forAllNoShrink[T1, T2, T3, P](g1: Gen[T1], g2: Gen[T2], g3: Gen[T3])(f: (T1, T2, T3) ⇒ P)(implicit p: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty, pp2: (T2) ⇒ Pretty, pp3: (T3) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for three explicit generators.

    Universal quantifier for three explicit generators. Does not shrink failed test cases.

  61. def forAllNoShrink[T1, T2, P](g1: Gen[T1], g2: Gen[T2])(f: (T1, T2) ⇒ P)(implicit p: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty, pp2: (T2) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for two explicit generators.

    Universal quantifier for two explicit generators. Does not shrink failed test cases.

  62. def forAllNoShrink[T1, P](g1: Gen[T1])(f: (T1) ⇒ P)(implicit pv: (P) ⇒ Prop, pp1: (T1) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for an explicit generator.

    Universal quantifier for an explicit generator. Does not shrink failed test cases.

  63. def forAllShrink[T, P](g: Gen[T], shrink: (T) ⇒ Stream[T])(f: (T) ⇒ P)(implicit pv: (P) ⇒ Prop, pp: (T) ⇒ Pretty): Prop

    Permalink

    Universal quantifier for an explicit generator.

    Universal quantifier for an explicit generator. Shrinks failed arguments with the given shrink function

  64. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  65. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  66. def iff[T](x: T, f: PartialFunction[T, Prop]): Prop

    Permalink

    Property holds only if the given partial function is defined at x, and returns a property that holds

  67. def imply[T](x: T, f: PartialFunction[T, Prop]): Prop

    Permalink

    Implication with several conditions

  68. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  69. def lzy(p: ⇒ Prop): Prop

    Permalink

    Wraps a property lazily.

    Wraps a property lazily. The given parameter is only evaluated once, and not until the wrapper property is evaluated.

  70. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  71. def noneFailing[T](gs: Seq[Gen[T]]): Prop

    Permalink

    A property that holds iff none of the given generators fails generating a value

  72. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  73. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  74. lazy val passed: Prop

    Permalink

    A property that always is passed

  75. implicit def propBoolean(b: Boolean): Prop

    Permalink

    Implicit conversion of Boolean values to Prop values.

  76. def protect(p: ⇒ Prop): Prop

    Permalink

    Wraps and protects a property, delaying its evaluation and turning exceptions into test failures.

  77. lazy val proved: Prop

    Permalink

    A property that always is proved

  78. def secure[P](p: ⇒ P)(implicit ev: (P) ⇒ Prop): Prop

    Permalink

    Wraps and protects a property, turning exceptions thrown by the property into test failures.

  79. def sizedProp(f: (Int) ⇒ Prop): Prop

    Permalink

    A property that depends on the generator size

  80. def slideSeed(prms: Parameters): Parameters

    Permalink

  81. def someFailing[T](gs: Seq[Gen[T]]): Prop

    Permalink

    A property that holds if at least one of the given generators fails generating a value

  82. def startSeed(prms: Parameters): (Parameters, Seed)

    Permalink

    This handles situations where we have a starting seed in our parameters.

    This handles situations where we have a starting seed in our parameters.

    If we do, then we remove it from parameters and return it. If not, we create a new random seed. The new parameters from this method should be used with all the generation that this prop needs itself.

    Note that if this Prop needs to evaluate other Props (e.g. in forAll), you should make sure *not* to use the parameters returned from this method. We need for all Props evaluated by this one to behave deterministically if this Prop was given a seed. In that case you should use slideSeed to update the parameters.

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

    Permalink
    Definition Classes
    AnyRef

  84. def throws[T <: Throwable](c: Class[T])(x: ⇒ Any): Boolean

    Permalink

    Returns true if the given statement throws an exception of the specified type

  85. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  86. lazy val undecided: Prop

    Permalink

    A property that never is proved or falsified

  87. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  89. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  90. def within(maximumMs: Long)(wrappedProp: ⇒ Prop): Prop

    Permalink

    Ensures that the property expression passed in completes within the given space of time.

Deprecated Value Members

  1. implicit def BooleanOperators(b: ⇒ Boolean): ExtendedBoolean

    Permalink

    Implicit method that makes a number of property operators on boolean values available in the current scope.

    Implicit method that makes a number of property operators on boolean values available in the current scope. See Prop.ExtendedBoolean for documentation on the operators.

    Annotations
    @deprecated
    Deprecated

    (Since version 1.14.1) Please import Prop.propBoolean instead

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped