Struct jj_lib::default_index::revset_engine::RevsetImpl

pub struct RevsetImpl<I> { /* private fields */ }

Implementations

impl<I: AsCompositeIndex> RevsetImpl<I>

pub fn iter_graph_impl(&self) -> RevsetGraphIterator<'_, '_>

Trait Implementations

impl<I> Debug for RevsetImpl<I>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<I: AsCompositeIndex> Revset for RevsetImpl<I>

fn iter(&self) -> Box<dyn Iterator<Item = CommitId> + '_>

Iterate in topological order with children before parents.

fn commit_change_ids( &self ) -> Box<dyn Iterator<Item = (CommitId, ChangeId)> + '_>

Iterates commit/change id pairs in topological order.

fn iter_graph( &self ) -> Box<dyn Iterator<Item = (CommitId, Vec<RevsetGraphEdge>)> + '_>

fn is_empty(&self) -> bool

fn count_estimate(&self) -> (usize, Option<usize>)

Inclusive lower bound and, optionally, inclusive upper bound of how many commits are in the revset. The implementation can use its discretion as to how much effort should be put into the estimation, and how accurate the resulting estimate should be.