Boolean

equal

bool equal(interval<T> a, interval<T> b)

[source]

Details

Returns true if intervals $a$ and $b$ are equal.

FP32±0 ulpsFP64±0 ulps

$=: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\underline{a} = \underline{b} \land \bar{a} = \bar{b}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a = b$
$0$	$1$	$0$
$1$	$0$	$0$
$1$	$1$	$1$

---

subset

bool subset(interval<T> a, interval<T> b)

[source]

Details

Returns true if $a$ is a subset of $b$.

FP32±0 ulpsFP64±0 ulps

$\subseteq: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\underline{b} \leq \underline{a} \land \bar{a} \leq \bar{b}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a \subseteq b$
$0$	$1$	$0$
$1$	$0$	$1$
$1$	$1$	$1$

---

interior

bool interior(interval<T> a, interval<T> b)

[source]

Details

Returns true if $a$ is in the interior of $b$.

FP32±0 ulpsFP64±0 ulps

$\mathrm{interior}: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\underline{b} < \underline{a} \land \bar{a} < \bar{b}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a \subset b$
$0$	$1$	$0$
$1$	$0$	$1$
$1$	$1$	$1$

---

disjoint

bool disjoint(interval<T> a, interval<T> b)

[source]

Details

Returns true if intervals $a$ and $b$ are disjoint.

FP32±0 ulpsFP64±0 ulps

$\mathrm{disjoint}: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\bar{a} < \underline{b} \lor \bar{b} < \underline{a}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a \cap b = \emptyset$
$0$	$1$	$1$
$1$	$0$	$1$
$1$	$1$	$1$

---

less

bool less(interval<T> a, interval<T> b)

[source]

Details

Returns true if $a \leq b$.

FP32±0 ulpsFP64±0 ulps

$\leq: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\underline{a} \leq \underline{b} \land \bar{a} \leq \bar{b}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a \leq b$
$0$	$1$	$0$
$1$	$0$	$0$
$1$	$1$	$1$

---

precedes

bool precedes(interval<T> a, interval<T> b)

[source]

Details

Returns true if $a$ precedes $b$.

FP32±0 ulpsFP64±0 ulps

$\preceq: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\bar{a} \leq \underline{b}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a \preceq b$
$0$	$1$	$1$
$1$	$0$	$1$
$1$	$1$	$1$

---

empty

bool empty(interval<T> x)

[source]

Details

Returns true if interval $x$ is empty.

FP32±0 ulpsFP64±0 ulps

$\mathrm{isEmpty}: \mathbb{IR} \rightarrow \mathbb{B}$

---

entire

bool entire(interval<T> x)

[source]

Details

Returns true if interval $x$ is entire (covers all values).

FP32±0 ulpsFP64±0 ulps

$\mathrm{isEntire}: \mathbb{IR} \rightarrow \mathbb{B}$

---

just_zero

bool just_zero(interval<T> x)

[source]

Details

Returns true if interval $x$ is exactly zero.

FP32±0 ulpsFP64±0 ulps

$\mathrm{justZero}: \mathbb{IR} \rightarrow \mathbb{B}$

---

contains

bool contains(interval<T> x, T y)

[source]

Details

Returns true if interval $x$ contains value $y$.

FP32±0 ulpsFP64±0 ulps

$\mathrm{contains}: \mathbb{IR}\times\mathbb{R} \rightarrow \mathbb{B}$

---

bounded

bool bounded(interval<T> x)

[source]

Details

Returns true if interval $x$ is bounded.

FP32±0 ulpsFP64±0 ulps

$\mathrm{bounded}: \mathbb{IR} \rightarrow \mathbb{B}$

---

isfinite

bool isfinite(interval<T> x)

[source]

Details

Returns true if interval $x$ is finite.

FP32±0 ulpsFP64±0 ulps

$\mathrm{isfinite}: \mathbb{IR} \rightarrow \mathbb{B}$

---

strict_less_or_both_inf

bool strict_less_or_both_inf(T x, T y)

[source]

Details

Returns true if $x < y$ or both are infinite.

FP32±0 ulpsFP64±0 ulps

$\mathrm{strictLessOrBothInf}: \mathbb{R}\times\mathbb{R} \rightarrow \mathbb{B}$

---

strict_less

bool strict_less(interval<T> a, interval<T> b)

[source]

Details

Returns true if $a \lt b$.

FP32±0 ulpsFP64±0 ulps

$\lt: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\underline{a} < \underline{b} \land \bar{a} < \bar{b}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a < b$
$0$	$1$	$0$
$1$	$0$	$0$
$1$	$1$	$1$

---

strict_precedes

bool strict_precedes(interval<T> a, interval<T> b)

[source]

Details

Returns true if $a$ strictly precedes $b$.

FP32±0 ulpsFP64±0 ulps

$\prec: \mathbb{IR}\times\mathbb{IR} \rightarrow \mathbb{B}$

For $a, b\neq \emptyset$:

$\bar{a} < \underline{b}$.

Otherwise:

$a = \emptyset$	$b = \emptyset$	$a \prec b$
$0$	$1$	$1$
$1$	$0$	$1$
$1$	$1$	$1$

---

isinf

bool isinf(interval<T> x)

[source]

Details

Returns true if interval $x$ is infinite.

FP32±0 ulpsFP64±0 ulps

$\mathrm{isinf}: \mathbb{IR} \rightarrow \mathbb{B}$

---

isnai

bool isnai(interval<T> x)

[source]

Details

Returns true if interval $x$ is Not an Interval (NAI).

FP32±0 ulpsFP64±0 ulps

$\mathrm{isnai}: \mathbb{IR} \rightarrow \mathbb{B}$

---

is_member

bool is_member(T x, interval<T> y)

[source]

Details

Returns true if $x \in y$.

FP32±0 ulpsFP64±0 ulps

$\in: \mathbb{R}\times\mathbb{IR} \rightarrow \mathbb{B}$

---

is_singleton

bool is_singleton(interval<T> x)

[source]

Details

Returns true if interval $x$ is a singleton.

FP32±0 ulpsFP64±0 ulps

$\mathrm{isSingleton}: \mathbb{IR} \rightarrow \mathbb{B}$

---

is_common_interval

bool is_common_interval(interval<T> x)

[source]

Details

Returns true if interval $x$ is a common interval.

FP32±0 ulpsFP64±0 ulps

$\mathrm{isCommonInterval}: \mathbb{IR} \rightarrow \mathbb{B}$

---

isnormal

bool isnormal(interval<T> x)

[source]

Details

Returns true if interval $x$ is normal.

FP32±0 ulpsFP64±0 ulps

$\mathrm{isnormal}: \mathbb{IR} \rightarrow \mathbb{B}$

---

is_atomic

bool is_atomic(interval<T> x)

[source]

Details

Returns true if interval $x$ is atomic.

FP32±0 ulpsFP64±0 ulps

$\mathrm{isAtomic}: \mathbb{IR} \rightarrow \mathbb{B}$

---

isnan

bool isnan(interval<T> x)

[source]

Details

FP32±0 ulpsFP64±0 ulps

$\mathrm{isnan}: \mathbb{IR} \rightarrow \mathbb{B}$

---