Struct Equipartition

pub struct Equipartition<const N: usize> { /* private fields */ }

Finite, uniformly partitioned interval.

Implementations

impl<const N: usize> Equipartition<N>

pub fn new(lb: f64, ub: f64) -> Equipartition<N>

pub fn from_interval<I: Into<Interval>>(d: I) -> Equipartition<N>

pub fn n_partitions(&self) -> usize

pub fn partition_width(&self) -> f64

pub fn centres(&self) -> [f64; N]

pub fn edges(&self) -> [f64; N]

pub fn to_partition(&self, val: f64) -> usize

Trait Implementations

impl<const N: usize> Clone for Equipartition<N>

fn clone(&self) -> Equipartition<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Debug for Equipartition<N>

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

Formats the value using the given formatter.

impl<const N: usize> Display for Equipartition<N>

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

Formats the value using the given formatter.

impl<const N: usize> FiniteSpace for Equipartition<N>

fn to_ordinal(&self) -> Range<Self::Value>

impl<const N: usize> OrderedSpace for Equipartition<N>

fn min(&self) -> Option<usize>

Returns the value of the space’s minimum value, if it exists.

fn max(&self) -> Option<usize>

Returns the value of the dimension’s supremum, if it exists.

fn inf(&self) -> Option<Self::Value>

Return the infimum of the space.

fn sup(&self) -> Option<Self::Value>

Returns the supremum of the space.

fn is_lower_bounded(&self) -> bool

Returns true iff self has a well-defined infimum.

fn is_upper_bounded(&self) -> bool

Returns true iff self has a well-defined supremum.

fn is_bounded(&self) -> bool

Returns true iff self has a well-defined minimum and maximum.

impl<const N: usize, const M: usize> PartialEq<Equipartition<M>> for Equipartition<N>

fn eq(&self, other: &Equipartition<M>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<const N: usize> Space for Equipartition<N>

const DIM: usize = 1usize

The dimensionality of the space.

type Value = usize

The data representation of elements of the space.

fn card(&self) -> Card

Return the number of elements in the set comprising the space.

fn contains(&self, val: &usize) -> bool

Returns true iff val is contained within the space.

impl<const N: usize> Copy for Equipartition<N>