trait NumericInstances extends AnyRef
Ordering
- Alphabetic
- By Inheritance
Inherited
- NumericInstances
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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.chooseNumbut for refined types. - def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- 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]]]
- 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]]]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- 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]]]
- 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]]]
- 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]]]
- 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]]]
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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]]]
- 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]]]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()