Packages

object numeric

Module that provides Arbitrary instances and generators for numeric predicates.

Source
numeric.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. numeric
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def chooseRefinedNum[F[_, _], T, P](min: F[T, P], max: F[T, P])(implicit arg0: Numeric[T], arg1: Choose[T], rt: RefType[F], v: Validate[T, P]): Gen[F[T, P]]

    A generator that generates a random value in the given (inclusive) range that satisfies the predicate P.

    A generator that generates a random value in the given (inclusive) range that satisfies the predicate P. If the range is invalid, the generator will not generate any value.

    This is like ScalaCheck's Gen.chooseNum but for refined types.

  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  11. implicit def greaterArbitraryNat[F[_, _], T, N <: Nat](implicit arg0: RefType[F], arg1: Choose[T], arg2: Adjacent[T], bounded: Bounded[T], nt: Numeric[T], tn: ToInt[N]): Arbitrary[F[T, Greater[N]]]
  12. implicit def greaterArbitraryWit[F[_, _], T, N <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], bounded: Bounded[T], wn: Aux[N]): Arbitrary[F[T, Greater[N]]]
  13. implicit def greaterEqualArbitraryNat[F[_, _], T, N <: Nat](implicit arg0: RefType[F], arg1: Choose[T], bounded: Bounded[T], nt: Numeric[T], tn: ToInt[N]): Arbitrary[F[T, GreaterEqual[N]]]
  14. implicit def greaterEqualArbitraryWit[F[_, _], T, N <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], bounded: Bounded[T], wn: Aux[N]): Arbitrary[F[T, GreaterEqual[N]]]
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  16. implicit def intervalClosedArbitrary[F[_, _], T, L <: T, H <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], wl: Aux[L], wh: Aux[H]): Arbitrary[F[T, Closed[L, H]]]
  17. implicit def intervalClosedOpenArbitrary[F[_, _], T, L <: T, H <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], wl: Aux[L], wh: Aux[H]): Arbitrary[F[T, ClosedOpen[L, H]]]
  18. implicit def intervalOpenArbitrary[F[_, _], T, L <: T, H <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], wl: Aux[L], wh: Aux[H]): Arbitrary[F[T, Open[L, H]]]
  19. implicit def intervalOpenClosedArbitrary[F[_, _], T, L <: T, H <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], wl: Aux[L], wh: Aux[H]): Arbitrary[F[T, OpenClosed[L, H]]]
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. implicit def lessArbitraryNat[F[_, _], T, N <: Nat](implicit arg0: RefType[F], arg1: Choose[T], arg2: Adjacent[T], bounded: Bounded[T], nt: Numeric[T], tn: ToInt[N]): Arbitrary[F[T, Less[N]]]
  22. implicit def lessArbitraryWit[F[_, _], T, N <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], bounded: Bounded[T], wn: Aux[N]): Arbitrary[F[T, Less[N]]]
  23. implicit def lessEqualArbitraryNat[F[_, _], T, N <: Nat](implicit arg0: RefType[F], arg1: Choose[T], bounded: Bounded[T], nt: Numeric[T], tn: ToInt[N]): Arbitrary[F[T, LessEqual[N]]]
  24. implicit def lessEqualArbitraryWit[F[_, _], T, N <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], bounded: Bounded[T], wn: Aux[N]): Arbitrary[F[T, LessEqual[N]]]
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. final def notify(): Unit
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. def toString(): String
    Definition Classes
    AnyRef → Any
  30. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped