pub struct Graph<'s, D, G> { /* private fields */ }Expand description
Full indirect closure of a historical catalog, including null references. Backlinks do not recurse or create reference-counted ownership cycles.
Implementations§
Source§impl<'s, D: Copy + Eq, G: Copy + Eq> Graph<'s, D, G>
impl<'s, D: Copy + Eq, G: Copy + Eq> Graph<'s, D, G>
Auto Trait Implementations§
impl<'s, D, G> !Freeze for Graph<'s, D, G>
impl<'s, D, G> !RefUnwindSafe for Graph<'s, D, G>
impl<'s, D, G> !Send for Graph<'s, D, G>
impl<'s, D, G> !Sync for Graph<'s, D, G>
impl<'s, D, G> !UnwindSafe for Graph<'s, D, G>
impl<'s, D, G> Forget for Graph<'s, D, G>
impl<'s, D, G> Unpin for Graph<'s, D, G>
impl<'s, D, G> UnsafeUnpin for Graph<'s, D, G>
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