NumericInstances

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

    

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

    

13. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

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

    

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

    

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

    

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

    

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

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

    

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

    

    Definition Classes

    AnyRef

22. final def notify(): Unit

    

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

25. def toString(): String

    

    Definition Classes

    AnyRef → Any

26. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )