Approximate

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def boundsContain(v: N): Boolean

def canEqual(arg0: Any): Boolean

def clone(): AnyRef

def contains(v: N): ApproximateBoolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

val estimate: N

def finalize(): Unit

final def getClass(): java.lang.Class[_]

def hashCode(): Int

def isExact: Boolean

final def isInstanceOf[T0]: Boolean

def isOne: Boolean

def isZero: Boolean

val max: N

val min: N

final def ne(arg0: AnyRef): Boolean

def negate: Approximate[N]

final def notify(): Unit

final def notifyAll(): Unit

implicit val numeric: Numeric[N]

val probWithinBounds: Double

def productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withMax(m: N): Approximate[N]

def withMin(m: N): Approximate[N]

def ~(v: N): Boolean

def productElements: Iterator[Any]