NumericInstances

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 greaterArbitrary[F[_, _], T, N](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], max: Max[T], wn: WitnessAs[N, T]): Arbitrary[F[T, Greater[N]]]

14. implicit def greaterEqualArbitrary[F[_, _], T, N](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], max: Max[T], wn: WitnessAs[N, T]): Arbitrary[F[T, GreaterEqual[N]]]

15. def hashCode(): Int

    Definition Classes

    AnyRef → Any

16. implicit def intervalClosedArbitrary[F[_, _], T, L, H](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], wl: WitnessAs[L, T], wh: WitnessAs[H, T]): Arbitrary[F[T, Closed[L, H]]]

17. implicit def intervalClosedOpenArbitrary[F[_, _], T, L, H](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], wl: WitnessAs[L, T], wh: WitnessAs[H, T]): Arbitrary[F[T, ClosedOpen[L, H]]]

18. implicit def intervalOpenArbitrary[F[_, _], T, L, H](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], wl: WitnessAs[L, T], wh: WitnessAs[H, T]): Arbitrary[F[T, Open[L, H]]]

19. implicit def intervalOpenClosedArbitrary[F[_, _], T, L, H](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], wl: WitnessAs[L, T], wh: WitnessAs[H, T]): Arbitrary[F[T, OpenClosed[L, H]]]

20. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

21. implicit def lessArbitrary[F[_, _], T, N](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], arg3: Adjacent[T], min: Min[T], wn: WitnessAs[N, T]): Arbitrary[F[T, Less[N]]]

22. implicit def lessEqualArbitrary[F[_, _], T, N](implicit arg0: RefType[F], arg1: Numeric[T], arg2: Choose[T], min: Min[T], wn: WitnessAs[N, T]): Arbitrary[F[T, LessEqual[N]]]

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

    Definition Classes

    AnyRef

24. final def notify(): Unit

    Definition Classes

    AnyRef

25. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

27. def toString(): String

    Definition Classes

    AnyRef → Any

28. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )