Struct Tower

pub struct Tower<T> { /* private fields */ }

The radicals adjoined so far.

Implementations

impl<T: Arith> Tower<T>

pub fn new() -> Self

An empty tower: values are plain T.

pub fn depth(&self) -> usize

Number of radicals adjoined.

pub fn value(&self, value: T) -> Nested<T>

A plain value.

pub fn from_f64(&self, value: f64) -> Nested<T>

The value of a finite f64 (see Arith::from_f64).

pub fn sqrt(&mut self, radicand: &Nested<T>) -> Result<Nested<T>, ExactError>

Adjoin sqrt(radicand) and return it as a value.

The radicand must not be negative. That is not checked here, since the interval tier may be unable to tell; Tower::sign of any value involving a negative radicand returns None, which the exact tier reports as ExactError::Undefined.

Errors

ExactError::TooDeep beyond MAX_DEPTH radicals.

Panics

If radicand came from a different tower (its level exceeds this tower’s depth).

pub fn add(&self, x: &Nested<T>, y: &Nested<T>) -> Nested<T>

x + y.

pub fn sub(&self, x: &Nested<T>, y: &Nested<T>) -> Nested<T>

x - y.

pub fn neg(&self, x: &Nested<T>) -> Nested<T>

-x.

pub fn mul(&self, x: &Nested<T>, y: &Nested<T>) -> Nested<T>

x * y.

pub fn sign(&self, x: &Nested<T>) -> Option<Sign>

The sign of x, or None when T cannot decide or a radicand involved is negative.

Approximate arithmetics first evaluate x numerically through Arith::sqrt_enclosure; that decides whenever x is visibly away from zero. Otherwise, and always for exact arithmetics, signs are decided by case analysis on the coefficients.

pub fn cmp(&self, x: &Nested<T>, y: &Nested<T>) -> Option<Sign>

The sign of x - y.

Trait Implementations

impl<T: Clone> Clone for Tower<T>

fn clone(&self) -> Tower<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for Tower<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Default> Default for Tower<T>

fn default() -> Tower<T>

Returns the “default value” for a type.