case class Approximate[N](min: N, estimate: N, max: N, probWithinBounds: Double)(implicit numeric: Numeric[N]) extends ApproximateSet[N] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Approximate
- Serializable
- Product
- Equals
- ApproximateSet
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new Approximate(min: N, estimate: N, max: N, probWithinBounds: Double)(implicit numeric: Numeric[N])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def *(right: Approximate[N]): Approximate[N]
This is not distributive, because: a*(b+c) has two probability multiplications while (a*b + a*b) has three Some kind of general formula solver could possibly make this distributive, but in the mean time, it's only a group
- def +(right: Approximate[N]): Approximate[N]
- def -(right: Approximate[N]): Approximate[N]
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def boundsContain(v: N): Boolean
Is this value contained within the bounds? Contract is: Prob(boundsContain(estimate)) >= probWithinBounds
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def contains(v: N): ApproximateBoolean
- Definition Classes
- Approximate → ApproximateSet
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val estimate: N
- 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()
- def isExact: Boolean
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isOne: Boolean
- def isZero: Boolean
- val max: N
- val min: N
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def negate: Approximate[N]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- implicit val numeric: Numeric[N]
- val probWithinBounds: Double
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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()
- def withMax(m: N): Approximate[N]
- def withMin(m: N): Approximate[N]
- def ~(v: N): Boolean
This is so you can do: val x = Approximate(1.0, 1.1, 1.2, 0.99) and then x ~ 1.05 returns true