[−][src]Struct graphstack::GraphStack
Implementations
impl<T> GraphStack<T>
[src]
pub fn new() -> Self
[src]
pub fn push(&mut self, value: T, ancestors: &[usize]) -> usize
[src]
Adds an element to the graph-stack and returns an item-id for it.
This id
can later be used to add ancestors for this item.
pub fn add_ancestors(&mut self, id: usize, ancestors: &[usize])
[src]
pub fn stacks(&self, start_item: usize) -> Stacks<'_, T>ⓘ
[src]
Build an iterator over the stacks encoded by this GraphStack.
A start_item
is required because there may be multiple top items.
Auto Trait Implementations
impl<T> RefUnwindSafe for GraphStack<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for GraphStack<T> where
T: Send,
T: Send,
impl<T> Sync for GraphStack<T> where
T: Sync,
T: Sync,
impl<T> Unpin for GraphStack<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for GraphStack<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,