Struct MissingAncestors

pub struct MissingAncestors<G: Graph> { /* private fields */ }

Implementations

impl<G: Graph> MissingAncestors<G>

pub fn new(graph: G, bases: impl IntoIterator<Item = Revision>) -> Self

pub fn has_bases(&self) -> bool

pub fn get_bases<'a>(&'a self) -> &'a HashSet<Revision>

Return a reference to current bases.

This is useful in unit tests, but also setdiscovery.py does read the bases attribute of a ancestor.missingancestors instance.

pub fn bases_heads(&self) -> Result<HashSet<Revision>, GraphError>

Computes the relative heads of current bases.

The object is still usable after this.

pub fn into_bases_heads(self) -> Result<HashSet<Revision>, GraphError>

Consumes the object and returns the relative heads of its bases.

pub fn add_bases(&mut self, new_bases: impl IntoIterator<Item = Revision>)

Add some revisions to self.bases

Takes care of keeping self.max_base up to date.

pub fn remove_ancestors_from( &mut self, revs: &mut HashSet<Revision>, ) -> Result<(), GraphError>

Remove all ancestors of self.bases from the revs set (in place)

pub fn missing_ancestors( &mut self, revs: impl IntoIterator<Item = Revision>, ) -> Result<Vec<Revision>, GraphError>

Return all the ancestors of revs that are not ancestors of self.bases

This may include elements from revs.

Equivalent to the revset (::revs - ::self.bases). Revs are returned in revision number order, which is a topological order.