Struct fj_kernel::algorithms::approx::edge::HalfEdgeApprox
source · pub struct HalfEdgeApprox {
pub first: ApproxPoint<2>,
pub curve_approx: CurveApprox,
}Expand description
An approximation of an HalfEdge
Fields§
§first: ApproxPoint<2>The point that approximates the first vertex of the curve
curve_approx: CurveApproxThe approximation of the edge’s curve
Implementations§
source§impl HalfEdgeApprox
impl HalfEdgeApprox
sourcepub fn points(&self) -> Vec<ApproxPoint<2>>
pub fn points(&self) -> Vec<ApproxPoint<2>>
Compute the points that approximate the edge
Examples found in repository?
src/algorithms/approx/cycle.rs (line 46)
42 43 44 45 46 47 48 49 50 51 52 53 54
pub fn points(&self) -> Vec<ApproxPoint<2>> {
let mut points = Vec::new();
for approx in &self.half_edges {
points.extend(approx.points());
}
if let Some(point) = points.first() {
points.push(point.clone());
}
points
}Trait Implementations§
source§impl Debug for HalfEdgeApprox
impl Debug for HalfEdgeApprox
source§impl Hash for HalfEdgeApprox
impl Hash for HalfEdgeApprox
source§impl Ord for HalfEdgeApprox
impl Ord for HalfEdgeApprox
source§fn cmp(&self, other: &HalfEdgeApprox) -> Ordering
fn cmp(&self, other: &HalfEdgeApprox) -> 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<HalfEdgeApprox> for HalfEdgeApprox
impl PartialEq<HalfEdgeApprox> for HalfEdgeApprox
source§fn eq(&self, other: &HalfEdgeApprox) -> bool
fn eq(&self, other: &HalfEdgeApprox) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl PartialOrd<HalfEdgeApprox> for HalfEdgeApprox
impl PartialOrd<HalfEdgeApprox> for HalfEdgeApprox
source§fn partial_cmp(&self, other: &HalfEdgeApprox) -> Option<Ordering>
fn partial_cmp(&self, other: &HalfEdgeApprox) -> 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 Eq for HalfEdgeApprox
impl StructuralEq for HalfEdgeApprox
impl StructuralPartialEq for HalfEdgeApprox
Auto Trait Implementations§
impl !RefUnwindSafe for HalfEdgeApprox
impl !Send for HalfEdgeApprox
impl !Sync for HalfEdgeApprox
impl Unpin for HalfEdgeApprox
impl !UnwindSafe for HalfEdgeApprox
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.