Struct RevsetImpl

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

Implementations

impl<I: AsCompositeIndex + Clone> RevsetImpl<I>

pub fn iter_graph_impl( &self, skip_transitive_edges: bool, ) -> impl Iterator<Item = Result<GraphNode<CommitId>, RevsetEvaluationError>> + use<I>

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 + Clone> Revset for RevsetImpl<I>

fn iter<'a>( &self, ) -> Box<dyn Iterator<Item = Result<CommitId, RevsetEvaluationError>> + 'a>

where Self: 'a,

Iterate in topological order with children before parents.

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

where Self: 'a,

Iterates commit/change id pairs in topological order.

fn iter_graph<'a>( &self, ) -> Box<dyn Iterator<Item = Result<GraphNode<CommitId>, RevsetEvaluationError>> + 'a>

where Self: 'a,

fn is_empty(&self) -> bool

Returns true if iterator will emit no commit nor error.

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

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.

fn containing_fn<'a>(&self) -> Box<RevsetContainingFn<'a>>

where Self: 'a,

Returns a closure that checks if a commit is contained within the revset.