core/spire.math/Algebraic/Expr/ConstantLong

ConstantLong

@SerialVersionUID(0L) case
class ConstantLong(value: Long) extends Constant[Long]
trait Product
trait Equals
class Constant[Long]
class Expr
trait Serializable
class Object
trait Matchable
class Any

Value members

Concrete methods

def flagBits: Int
def signum: Int
def toBigDecimal(digits: Int): BigDecimal

Inherited methods

def bfmssBound: BitBound

Returns the BFMSS separation bound.

Returns the BFMSS separation bound.

Inherited from
Expr
def children: List[Expr]
Inherited from
Constant
def degreeBound: Long

Returns a bound on the degree of this expression.

Returns a bound on the degree of this expression.

Inherited from
Expr
def flags: Flags

A set of flags we can quickly compute for an Algebraic expression.

A set of flags we can quickly compute for an Algebraic expression.

Note

we have to do this round-about trip between flagsBits and flags because of

Inherited from
Expr
def getBound(zbf: ZeroBoundFunction): Bound

Returns the bound for zbf, using a cached value if it is available.

Returns the bound for zbf, using a cached value if it is available.

Inherited from
Expr
def liYapBound: BitBound

Returns the Li & Yap separation bound.

Returns the Li & Yap separation bound.

Inherited from
Expr
def lowerBound: BitBound

Returns a lower bound on the absolute value of this expression as a bit bound.

Returns a lower bound on the absolute value of this expression as a bit bound.

TODO: We could do better here wrt to addition (need a fastSignum: Option[Int])

Inherited from
Expr
def productElementNames: Iterator[String]
Inherited from
Product
def productIterator: Iterator[Any]
Inherited from
Product
def separationBound: BitBound

Returns a separation bound for this expression as a bit bound. A separation bound is a lower-bound on the value of this expression that is only valid if this expression is not 0. This bound can thus be used to determine if this value is actually 0 and, if not, the sign, by simply approximating the expression with enough accuracy that it falls on one side or the other of the separation bound.

Returns a separation bound for this expression as a bit bound. A separation bound is a lower-bound on the value of this expression that is only valid if this expression is not 0. This bound can thus be used to determine if this value is actually 0 and, if not, the sign, by simply approximating the expression with enough accuracy that it falls on one side or the other of the separation bound.

Inherited from
Expr