Struct RelationGraph 

pub struct RelationGraph { /* private fields */ }

Implementations

impl RelationGraph

pub fn insert_symbol(&mut self, identity: SymbolIdentity) -> NodeId

pub fn pin_symbol(&mut self, identity: SymbolIdentity) -> NodeId

pub fn pin(&mut self, node_id: NodeId) -> bool

pub fn unpin(&mut self, node_id: NodeId) -> bool

pub fn anchors(&self) -> &[NodeId]

pub fn is_anchor(&self, node_id: NodeId) -> bool

pub fn contains(&self, node_id: NodeId) -> bool

pub fn node(&self, node_id: NodeId) -> Option<&GraphNode>

pub fn node_mut(&mut self, node_id: NodeId) -> Option<&mut GraphNode>

pub fn nodes_named(&self, symbol: &str, kind: HierarchyKind) -> Vec<NodeId>

pub fn resolve_id(&self, node_id: NodeId) -> Option<NodeId>

pub fn resolve_symbol( &mut self, node_id: NodeId, identity: SymbolIdentity, ) -> Option<NodeId>

pub fn replace_branch_neighbors( &mut self, node_id: NodeId, direction: HierarchyDirection, children: Vec<SymbolIdentity>, ) -> Option<Vec<NodeId>>

pub fn clear_branch( &mut self, node_id: NodeId, direction: HierarchyDirection, ) -> bool

pub fn visible_graph(&self) -> VisibleGraph

pub fn known_graph(&self) -> VisibleGraph

Returns every relation currently known from an anchor, including cached branches that are collapsed in the canvas. Orphaned storage left behind after unpinning or clearing a branch is intentionally excluded.

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

Trait Implementations

impl Debug for RelationGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RelationGraph

fn default() -> RelationGraph

Returns the “default value” for a type.