Skip to main content

Interval

Struct Interval 

Source
pub struct Interval { /* private fields */ }
Expand description

A closed interval [lo, hi] certainly containing a true real value.

Implementations§

Source§

impl Interval

Source

pub const fn point(value: f64) -> Self

The degenerate interval holding one exactly-represented value.

Source

pub fn new(lo: f64, hi: f64) -> Self

An interval from stated bounds. Panics if lo > hi or either is NaN, because such an “enclosure” encloses nothing.

Source

pub fn about(value: f64, radius: f64) -> Self

A value with a symmetric absolute uncertainty.

Source

pub const fn lo(&self) -> f64

The lower bound.

Source

pub const fn hi(&self) -> f64

The upper bound.

Source

pub fn width(&self) -> f64

The width of the enclosure.

Source

pub fn contains(&self, value: f64) -> bool

Whether the enclosure contains value.

Source

pub fn certain_sign(&self) -> Option<Sign>

The sign of the true value, where the bounds decide it: None means zero lies inside the enclosure and floating point genuinely cannot tell, which is an answer, not a failure.

Source

pub const fn neg(&self) -> Self

The negation, exact; negation never rounds.

Source

pub fn add(&self, other: &Self) -> Self

The sum.

Source

pub fn sub(&self, other: &Self) -> Self

The difference.

Source

pub fn mul(&self, other: &Self) -> Self

The product: the extremes over the four bound products, widened.

Source

pub fn square(&self) -> Self

The square, tighter than mul with itself, because a square cannot be negative even when the interval straddles zero.

Source

pub fn abs(&self) -> Self

The absolute value, exact.

Source

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

The square root, for enclosures of non-negative values. A lower bound pushed below zero by widening is clamped; the true value it encloses was non-negative. An interval entirely below zero has no real root and returns None.

Source

pub fn checked_div(&self, other: &Self) -> Option<Self>

The quotient, defined only when the divisor certainly excludes zero.

Trait Implementations§

Source§

impl Clone for Interval

Source§

fn clone(&self) -> Interval

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for Interval

Source§

impl Debug for Interval

Source§

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

Formats the value using the given formatter. Read more
Source§

impl PartialEq for Interval

Source§

fn eq(&self, other: &Interval) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for Interval

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

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

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

Source§

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> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

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

Source§

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)

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

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.