pub enum Bound<T> {
NoBound,
LowerBound(T),
UpperBound(T),
LowerAndUpperBound(T, T),
}Expand description
Variants§
NoBound
(-inf, +inf)
LowerBound(T)
(min, +inf)
UpperBound(T)
(-inf, max)
LowerAndUpperBound(T, T)
(min, max)
Implementations§
Source§impl<T> Bound<T>
impl<T> Bound<T>
Sourcepub fn contains(&self, value: &T) -> bool
pub fn contains(&self, value: &T) -> bool
Checks whether the given value is compatible with the bounds.
Sourcepub fn at_bound(&self, value: T) -> bool
pub fn at_bound(&self, value: T) -> bool
Checks if the given value is equal to one of the bounds.
TODO: his just does equality comparison right now, which probably needs to be improved to something with an epsilon (significant but not critical to most fits right now).
Sourcepub fn to_bounded(values: &[T], bounds: Option<&Vec<Self>>) -> DVector<T>
pub fn to_bounded(values: &[T], bounds: Option<&Vec<Self>>) -> DVector<T>
Converts an unbounded “external” parameter into a bounded “internal” one via the transform:
Upper and lower bounds:
x_\text{int} = \arcsin\left(2\frac{x_\text{ext} - x_\text{min}}{x_\text{max} - x_\text{min}} - 1\right)Upper bound only:
x_\text{int} = \sqrt{(x_\text{max} - x_\text{ext} + 1)^2 - 1}Lower bound only:
x_\text{int} = \sqrt{(x_\text{ext} - x_\text{min} + 1)^2 - 1}Sourcepub fn to_unbounded(values: &[T], bounds: Option<&Vec<Self>>) -> DVector<T>
pub fn to_unbounded(values: &[T], bounds: Option<&Vec<Self>>) -> DVector<T>
Converts a bounded “internal” parameter into an unbounded “external” one via the transform:
Upper and lower bounds:
x_\text{ext} = x_\text{min} + \left(\sin(x_\text{int}) + 1\right)\frac{x_\text{max} - x_\text{min}}{2}Upper bound only:
x_\text{ext} = x_\text{max} + 1 - \sqrt{x_\text{int}^2 + 1}Lower bound only:
x_\text{ext} = x_\text{min} - 1 + \sqrt{x_\text{int}^2 + 1}Trait Implementations§
Source§impl<'de, T> Deserialize<'de> for Bound<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Bound<T>where
T: Deserialize<'de>,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl<T: Copy> Copy for Bound<T>
Auto Trait Implementations§
impl<T> Freeze for Bound<T>where
T: Freeze,
impl<T> RefUnwindSafe for Bound<T>where
T: RefUnwindSafe,
impl<T> Send for Bound<T>where
T: Send,
impl<T> Sync for Bound<T>where
T: Sync,
impl<T> Unpin for Bound<T>where
T: Unpin,
impl<T> UnwindSafe for Bound<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit)Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.