Object

eu.timepit.refined.scalacheck

numeric

Related Doc: package scalacheck

Permalink

object numeric

Module that provides Arbitrary instances and generators for numeric predicates.

Source
numeric.scala
Linear Supertypes
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

    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. final def asInstanceOf[T0]: T0

    Permalink
    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]]

    Permalink

    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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]

    Permalink
    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]]]

    Permalink
  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]]]

    Permalink
  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]]]

    Permalink
  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]]]

    Permalink
  15. def hashCode(): Int

    Permalink
    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]]]

    Permalink
  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]]]

    Permalink
  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]]]

    Permalink
  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]]]

    Permalink
  20. final def isInstanceOf[T0]: Boolean

    Permalink
    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]]]

    Permalink
  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]]]

    Permalink
  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]]]

    Permalink
  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]]]

    Permalink
  25. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  29. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  30. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped