pub struct Range<T: RealField> {
pub min: T,
pub max: T,
}
Expand description
min/max range to check the joint position
Fields§
§min: T
§max: T
Implementations§
source§impl<T> Range<T>where
T: RealField,
impl<T> Range<T>where
T: RealField,
sourcepub fn new(min: T, max: T) -> Self
pub fn new(min: T, max: T) -> Self
Create new Range instance
In case min
is greater than max
, this function panics.
§Examples
let range = k::joint::Range::new(-1.0, 1.0);
// let range = k::joint::Range::new(1.0, -1.0); // panic
sourcepub fn is_valid(&self, val: T) -> bool
pub fn is_valid(&self, val: T) -> bool
Check if the value is in the range
true
means it is OK.
If the val is the same as the limit value (min
or max
), it returns true (valid).
§Examples
let range = k::joint::Range::new(-1.0, 1.0);
assert!(range.is_valid(0.0));
assert!(range.is_valid(1.0));
assert!(!range.is_valid(1.5));
Trait Implementations§
source§impl<T> From<RangeInclusive<T>> for Range<T>where
T: RealField,
impl<T> From<RangeInclusive<T>> for Range<T>where
T: RealField,
source§fn from(range: RangeInclusive<T>) -> Self
fn from(range: RangeInclusive<T>) -> Self
§Examples
let range : k::joint::Range<f64> = (-1.0..=1.0).into();
assert!(range.is_valid(0.0));
assert!(range.is_valid(1.0));
assert!(!range.is_valid(1.5));
impl<T: Copy + RealField> Copy for Range<T>
Auto Trait Implementations§
impl<T> Freeze for Range<T>where
T: Freeze,
impl<T> RefUnwindSafe for Range<T>where
T: RefUnwindSafe,
impl<T> Send for Range<T>
impl<T> Sync for Range<T>
impl<T> Unpin for Range<T>where
T: Unpin,
impl<T> UnwindSafe for Range<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<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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.