Object

eu.timepit.refined.scalacheck

numeric

Related Doc: package scalacheck

Permalink

object numeric

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

Type Members

  1. trait Bounded[T] 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. object Bounded

    Permalink
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. 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.

  7. def clone(): AnyRef

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  12. implicit def greaterArbitraryNat[F[_, _], T, N <: Nat](implicit arg0: RefType[F], arg1: Choose[T], bounded: Bounded[T], nt: Numeric[T], tn: ToInt[N]): Arbitrary[F[T, Greater[N]]]

    Permalink
  13. implicit def greaterArbitraryWit[F[_, _], T, N <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], bounded: Bounded[T], wn: Aux[N]): Arbitrary[F[T, Greater[N]]]

    Permalink
  14. 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
  15. 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
  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  17. 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
  18. implicit def intervalClosedOpenArbitrary[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, ClosedOpen[L, H]]]

    Permalink
  19. implicit def intervalOpenArbitrary[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, Open[L, H]]]

    Permalink
  20. implicit def intervalOpenClosedArbitrary[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, OpenClosed[L, H]]]

    Permalink
  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  22. implicit def lessArbitraryNat[F[_, _], T, N <: Nat](implicit arg0: RefType[F], arg1: Choose[T], bounded: Bounded[T], nt: Numeric[T], tn: ToInt[N]): Arbitrary[F[T, Less[N]]]

    Permalink
  23. implicit def lessArbitraryWit[F[_, _], T, N <: T](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], bounded: Bounded[T], wn: Aux[N]): Arbitrary[F[T, Less[N]]]

    Permalink
  24. 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
  25. 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
  26. final def ne(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped