pub enum NodeData {
Vertex(VertexData),
Edge(Box<EdgeData>),
Face(Box<FaceData>),
Container,
}Expand description
What a topology node holds, beyond its children.
Stored inline in the node rather than in side tables keyed by handle: a traversal that has the node has the data, without a second lookup, and there is no way for the two to fall out of step.
Variants§
Vertex(VertexData)
A vertex.
Edge(Box<EdgeData>)
An edge.
Face(Box<FaceData>)
A face.
Container
A wire, shell, solid, compsolid or compound: structure, no geometry of its own.
Implementations§
Source§impl NodeData
impl NodeData
Sourcepub fn tolerance(&self) -> Option<Tolerance>
pub fn tolerance(&self) -> Option<Tolerance>
The tolerance this node carries, if it carries one.
Containers have none: a wire’s uncertainty is that of the edges in it, and inventing a separate number for it would be a second source of truth.
Sourcepub const fn as_vertex(&self) -> Option<&VertexData>
pub const fn as_vertex(&self) -> Option<&VertexData>
The vertex data, if this is a vertex.
Trait Implementations§
impl StructuralPartialEq for NodeData
Auto Trait Implementations§
impl Freeze for NodeData
impl RefUnwindSafe for NodeData
impl Send for NodeData
impl Sync for NodeData
impl Unpin for NodeData
impl UnsafeUnpin for NodeData
impl UnwindSafe for NodeData
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,
impl<T> Scalar for T
§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.