pub struct LazyAncestors<G: Graph + Clone> { /* private fields */ }
Expand description
Lazy ancestors set, backed by AncestorsIterator
Implementations§
Source§impl<G: Graph + Clone> LazyAncestors<G>
impl<G: Graph + Clone> LazyAncestors<G>
pub fn new( graph: G, initrevs: impl IntoIterator<Item = Revision>, stoprev: Revision, inclusive: bool, ) -> Result<Self, GraphError>
pub fn contains(&mut self, rev: Revision) -> Result<bool, GraphError>
pub fn is_empty(&self) -> bool
pub fn iter(&self) -> AncestorsIterator<G> ⓘ
Auto Trait Implementations§
impl<G> Freeze for LazyAncestors<G>where
G: Freeze,
impl<G> RefUnwindSafe for LazyAncestors<G>where
G: RefUnwindSafe,
impl<G> Send for LazyAncestors<G>where
G: Send,
impl<G> Sync for LazyAncestors<G>where
G: Sync,
impl<G> Unpin for LazyAncestors<G>where
G: Unpin,
impl<G> UnwindSafe for LazyAncestors<G>where
G: UnwindSafe,
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