core/spire.math.interval/ValueBound

ValueBound

object ValueBound

Companion object for open/closed bounds, used to construct intervals from a set of bounds.

In the comments, we write

  • [v, (v or ?v when the bound is interpreted as a lower bound,
  • v], v), v? when the bound is interpreted as an upper bound.

The symbols [], (), ? correspond to closed, open or unknown bounds.

Companion
class
trait Sum
trait Mirror
class Object
trait Matchable
class Any

Type members

Inherited types

type MirroredElemLabels <: Tuple

The names of the product elements

The names of the product elements

Inherited from
Mirror
type MirroredLabel <: String

The name of the type

The name of the type

Inherited from
Mirror

Value members

Concrete methods

def unapply[A](b: Bound[A]): Option[A]
@inline
def union2[A : Order](v1: ValueBound[A], v2: ValueBound[A]): Interval[A]

Returns the interval containing the two given bounds.

Returns the interval containing the two given bounds.

@inline
def union3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

@inline
def union3_1approx2[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a.

@inline
def union3_1approx2_2approx3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a === v3.a.

@inline
def union3_1approx2_2less3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a < v3.a.

@inline
def union3_1less2[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a < v2.a.

@inline
def union3_1less2_2approx3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a < v2.a === v3.a.

@inline
def union4[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

@inline
def union4_1approx2[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a.

@inline
def union4_1approx2_2approx3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a == v3.a.

@inline
def union4_1approx2_2approx3_3less4[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a === v3.a < v4.a.

@inline
def union4_1approx2_2less3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a < v3.a.

@inline
def union4_1approx2_2less3_3approx4[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a === v2.a < v3.a === v4.a.

@inline
def union4_1less2[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds. * Assumption: v1.a < v2.a.

Returns the interval which contains all the given bounds. * Assumption: v1.a < v2.a.

@inline
def union4_1less2_1less3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a < v2.a and v1.a < v3.a (i.e. v1 is the minimum of all).

@inline
def union4_1less2_2approx3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a < v2.a === v3.a.

@inline
def union4_1less2_2approx3_3approx4[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a < v2.a === v3.a === v4.a.

@inline
def union4_1less3_2less3[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a < v3.a and v2.a < v3.a (i.e. v3 is the maximum of all).

@inline
def union4_1less3_2less3_3approx4[A : Order](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A]): Interval[A]

Returns the interval which contains all the given bounds.

Returns the interval which contains all the given bounds.

Assumption: v1.a < v3.a === v4.a and v2.a < v3.a === v4.a.