Struct CanvasIndexedGraph 

pub struct CanvasIndexedGraph<'a> { /* private fields */ }

Implementations

impl<'a> CanvasIndexedGraph<'a>

pub fn new(document: &'a CanvasDocument, index: &'a CanvasGraphIndex) -> Self

pub fn document(&self) -> &'a CanvasDocument

pub fn index(&self) -> &'a CanvasGraphIndex

pub fn node(&self, id: &NodeId) -> Option<&'a CanvasNode>

pub fn edge(&self, id: &EdgeId) -> Option<&'a CanvasEdge>

pub fn endpoint_node(&self, endpoint: &CanvasEndpoint) -> Option<&'a CanvasNode>

pub fn endpoint_handle( &self, endpoint: &CanvasEndpoint, ) -> Option<&'a CanvasHandle>

pub fn outgoing_edges<'q>( &'q self, node_id: &'q NodeId, ) -> impl Iterator<Item = &'a CanvasEdge> + 'q

where 'a: 'q,

pub fn incoming_edges<'q>( &'q self, node_id: &'q NodeId, ) -> impl Iterator<Item = &'a CanvasEdge> + 'q

where 'a: 'q,

pub fn incident_edges<'q>( &'q self, node_id: &'q NodeId, ) -> impl Iterator<Item = &'a CanvasEdge> + 'q

where 'a: 'q,

pub fn edges_for_node<'q>( &'q self, node_id: &'q NodeId, direction: CanvasEdgeDirection, ) -> Box<dyn Iterator<Item = &'a CanvasEdge> + 'q>

where 'a: 'q,

pub fn edges_between<'q>( &'q self, source: &'q NodeId, target: &'q NodeId, ) -> impl Iterator<Item = &'a CanvasEdge> + 'q

where 'a: 'q,

pub fn has_edge_between(&self, source: &NodeId, target: &NodeId) -> bool

pub fn neighbor_node_ids<'q>( &'q self, node_id: &'q NodeId, direction: CanvasEdgeDirection, ) -> Box<dyn Iterator<Item = &'a NodeId> + 'q>

where 'a: 'q,

pub fn incident_edge_count(&self, node_id: &NodeId) -> usize

Trait Implementations

impl<'a> Clone for CanvasIndexedGraph<'a>

fn clone(&self) -> CanvasIndexedGraph<'a>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a> Copy for CanvasIndexedGraph<'a>

impl<'a> Debug for CanvasIndexedGraph<'a>

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

Formats the value using the given formatter.