eu.timepit.refined.scalacheck

NumericInstances

trait NumericInstances extends AnyRef

Source
numeric.scala
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NumericInstances
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

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

  8. def clone(): AnyRef

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

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

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

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

    Definition Classes
    AnyRef → Any
  13. 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]]]

  14. 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]]]

  15. 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]]]

  16. 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]]]

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  18. 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]]]

  19. 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]]]

  20. 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]]]

  21. 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]]]

  22. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  23. 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]]]

  24. 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]]]

  25. 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]]]

  26. 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]]]

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

    Definition Classes
    AnyRef
  28. final def notify(): Unit

    Definition Classes
    AnyRef
  29. final def notifyAll(): Unit

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

    Definition Classes
    AnyRef
  31. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped