pub struct GraphComponents { /* private fields */ }Expand description
Every component of one selected topology, and which one each node belongs to.
Both views come from one walk, so a component’s members and a node’s component can never disagree.
Implementations§
Source§impl GraphComponents
impl GraphComponents
Sourcepub fn components(&self) -> &[GraphComponent]
pub fn components(&self) -> &[GraphComponent]
Every component, in smallest-member order, which is also identity order.
Sourcepub fn component(&self, id: GraphComponentId) -> Option<&GraphComponent>
pub fn component(&self, id: GraphComponentId) -> Option<&GraphComponent>
The component one identity names, if this result holds it.
Sourcepub fn component_of(&self, node: GraphNodeId) -> Option<GraphComponentId>
pub fn component_of(&self, node: GraphNodeId) -> Option<GraphComponentId>
The component one node belongs to, if this result holds that node.
Auto Trait Implementations§
impl Freeze for GraphComponents
impl RefUnwindSafe for GraphComponents
impl Send for GraphComponents
impl Sync for GraphComponents
impl Unpin for GraphComponents
impl UnsafeUnpin for GraphComponents
impl UnwindSafe for GraphComponents
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