pub struct GraphIndex<'a> { /* private fields */ }Implementations§
Source§impl<'a> GraphIndex<'a>
impl<'a> GraphIndex<'a>
pub fn build(graph: &'a Graph) -> Self
pub fn node(&self, id: &str) -> Option<&'a Node>
pub fn is_kind(&self, id: &str, kind: Kind) -> bool
pub fn incoming(&self, id: &str) -> impl Iterator<Item = &'a Edge> + '_
pub fn outgoing(&self, id: &str) -> impl Iterator<Item = &'a Edge> + '_
pub fn has_outgoing(&self, from: &str, relation: &str, to: &str) -> bool
pub fn source_of(&self, node_id: &str) -> Option<String>
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for GraphIndex<'a>
impl<'a> RefUnwindSafe for GraphIndex<'a>
impl<'a> Send for GraphIndex<'a>
impl<'a> Sync for GraphIndex<'a>
impl<'a> Unpin for GraphIndex<'a>
impl<'a> UnsafeUnpin for GraphIndex<'a>
impl<'a> UnwindSafe for GraphIndex<'a>
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