Struct algebraics::interval_arithmetic::DyadicFractionInterval

source · [−]

pub struct DyadicFractionInterval { /* private fields */ }

Expand description

convert to a tuple (self.lower_bound_numer, self.upper_bound_numer, self.log2_denom)

use instead of .eq() since .eq() wouldn’t have well defined results in all cases

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

Auto Trait Implementations

impl RefUnwindSafe for DyadicFractionInterval

impl Send for DyadicFractionInterval

impl Sync for DyadicFractionInterval

impl Unpin for DyadicFractionInterval

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T> ToString for T where
T: Display + ?Sized,

source

default fn to_string(&self) -> String

Converts the given value to a String. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct algebraics::interval_arithmetic::DyadicFractionInterval

Implementations

impl DyadicFractionInterval

pub fn new( lower_bound_numer: BigInt, upper_bound_numer: BigInt, log2_denom: usize) -> Self

pub fn from_ratio_range( lower_bound: Ratio<BigInt>, upper_bound: Ratio<BigInt>, log2_denom: usize) -> Self

pub fn from_ratio(ratio: Ratio<BigInt>, log2_denom: usize) -> Self

pub fn from_int(value: BigInt, log2_denom: usize) -> Self

pub fn from_int_range( lower_bound: BigInt, upper_bound: BigInt, log2_denom: usize) -> Self

pub fn from_dyadic_fraction(numer: BigInt, log2_denom: usize) -> Self

pub fn zero(log2_denom: usize) -> Self

pub fn one(log2_denom: usize) -> Self

pub fn negative_one(log2_denom: usize) -> Self

pub fn set_zero(&mut self)

pub fn set_one(&mut self)

pub fn set_negative_one(&mut self)

pub fn into_ratio_range(self) -> (Ratio<BigInt>, Ratio<BigInt>)

pub fn to_ratio_range(&self) -> (Ratio<BigInt>, Ratio<BigInt>)

pub fn into_lower_bound(self) -> Ratio<BigInt>

pub fn into_upper_bound(self) -> Ratio<BigInt>

pub fn lower_bound(&self) -> Ratio<BigInt>

pub fn upper_bound(&self) -> Ratio<BigInt>

pub fn log2_denom(&self) -> usize

pub fn lower_bound_numer(&self) -> &BigInt

pub fn upper_bound_numer(&self) -> &BigInt

pub fn destructure(self) -> (BigInt, BigInt, usize)

pub fn set_to_lower_bound(&mut self)

pub fn set_to_upper_bound(&mut self)

pub fn set_lower_bound_numer(&mut self, lower_bound_numer: BigInt)

pub fn set_upper_bound_numer(&mut self, upper_bound_numer: BigInt)

pub fn set_lower_bound_to_zero(&mut self)

pub fn set_upper_bound_to_zero(&mut self)

pub fn convert_log2_denom(&mut self, log2_denom: usize)

pub fn into_converted_log2_denom(self, log2_denom: usize) -> Self

pub fn to_converted_log2_denom(&self, log2_denom: usize) -> Self

pub fn checked_recip(&self) -> Option<Self>

pub fn recip(&self) -> Self

pub fn into_square(self) -> Self

pub fn square_assign(&mut self)

pub fn square(&self) -> Self

pub fn sqrt_assign(&mut self)

pub fn into_sqrt(self) -> Self

pub fn sqrt(&self) -> Self

pub fn contains_zero(&self) -> bool

pub fn into_arithmetic_geometric_mean(self, rhs: Self) -> Self

pub fn arithmetic_geometric_mean(&self, rhs: &Self) -> Self

pub fn sqrt_2(log2_denom: usize) -> Self

pub fn natural_log_of_2(log2_denom: usize) -> Self

pub fn log(&self) -> Self

pub fn into_exp(self) -> Self

pub fn exp(&self) -> Self

pub fn is_same(&self, rhs: &Self) -> bool

pub fn abs_assign(&mut self)

pub fn into_abs(self) -> Self

pub fn abs(&self) -> Self

pub fn floor_assign(&mut self, new_log2_denom: usize)

pub fn into_floor(self, new_log2_denom: usize) -> Self

pub fn floor(&self, new_log2_denom: usize) -> Self

pub fn ceil_assign(&mut self, new_log2_denom: usize)

pub fn into_ceil(self, new_log2_denom: usize) -> Self

pub fn ceil(&self, new_log2_denom: usize) -> Self

Trait Implementations

impl Add<&'_ BigInt> for DyadicFractionInterval

type Output = DyadicFractionInterval

fn add(self, rhs: &BigInt) -> DyadicFractionInterval

impl Add<&'_ BigUint> for DyadicFractionInterval

type Output = DyadicFractionInterval

fn add(self, rhs: &BigUint) -> DyadicFractionInterval

impl Add<&'_ DyadicFractionInterval> for DyadicFractionInterval

type Output = DyadicFractionInterval

fn add(self, rhs: &DyadicFractionInterval) -> DyadicFractionInterval

impl Add<&'_ Ratio<BigInt>> for DyadicFractionInterval

type Output = DyadicFractionInterval

fn add(self, rhs: &Ratio<BigInt>) -> DyadicFractionInterval

impl Add<&'_ Ratio<BigUint>> for DyadicFractionInterval

type Output = DyadicFractionInterval

fn add(self, rhs: &Ratio<BigUint>) -> DyadicFractionInterval

impl Add<&'_ Ratio<i128>> for DyadicFractionInterval

type Output = DyadicFractionInterval

fn add(self, rhs: &Ratio<i128>) -> DyadicFractionInterval

impl Add<&'_ Ratio<i16>> for DyadicFractionInterval

pub fn new(
lower_bound_numer: BigInt,
upper_bound_numer: BigInt,
log2_denom: usize
) -> Self

pub fn from_ratio_range(
lower_bound: Ratio<BigInt>,
upper_bound: Ratio<BigInt>,
log2_denom: usize
) -> Self

pub fn from_int_range(
lower_bound: BigInt,
upper_bound: BigInt,
log2_denom: usize
) -> Self

pub fn destructure(self) -> (BigInt, BigInt, usize )