Struct fj_kernel::algorithms::approx::path::RangeOnPath
source · pub struct RangeOnPath {
pub boundary: [Point<1>; 2],
}Expand description
The range on which a path should be approximated
Fields§
§boundary: [Point<1>; 2]The boundary of the range
Implementations§
source§impl RangeOnPath
impl RangeOnPath
Trait Implementations§
source§impl Clone for RangeOnPath
impl Clone for RangeOnPath
source§fn clone(&self) -> RangeOnPath
fn clone(&self) -> RangeOnPath
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for RangeOnPath
impl Debug for RangeOnPath
source§impl Ord for RangeOnPath
impl Ord for RangeOnPath
source§fn cmp(&self, other: &RangeOnPath) -> Ordering
fn cmp(&self, other: &RangeOnPath) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq<RangeOnPath> for RangeOnPath
impl PartialEq<RangeOnPath> for RangeOnPath
source§fn eq(&self, other: &RangeOnPath) -> bool
fn eq(&self, other: &RangeOnPath) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl PartialOrd<RangeOnPath> for RangeOnPath
impl PartialOrd<RangeOnPath> for RangeOnPath
source§fn partial_cmp(&self, other: &RangeOnPath) -> Option<Ordering>
fn partial_cmp(&self, other: &RangeOnPath) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self and other) and is used by the <=
operator. Read moreimpl Copy for RangeOnPath
impl Eq for RangeOnPath
impl StructuralEq for RangeOnPath
impl StructuralPartialEq for RangeOnPath
Auto Trait Implementations§
impl RefUnwindSafe for RangeOnPath
impl Send for RangeOnPath
impl Sync for RangeOnPath
impl Unpin for RangeOnPath
impl UnwindSafe for RangeOnPath
Blanket Implementations§
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.