Struct jj_lib::default_index_store::CompositeIndex

pub struct CompositeIndex<'a>(_);

Implementations

impl<'a> CompositeIndex<'a>

pub fn num_commits(&self) -> u32

pub fn stats(&self) -> IndexStats

pub fn entry_by_pos(&self, pos: IndexPosition) -> IndexEntry<'a>

pub fn commit_id_to_pos(&self, commit_id: &CommitId) -> Option<IndexPosition>

pub fn entry_by_id(&self, commit_id: &CommitId) -> Option<IndexEntry<'a>>

pub fn walk_revs( &self, wanted: &[IndexPosition], unwanted: &[IndexPosition] ) -> RevWalk<'a>

Trait Implementations

impl<'a> Clone for CompositeIndex<'a>

fn clone(&self) -> CompositeIndex<'a>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'index> IdIndexSource<IndexPosition> for CompositeIndex<'index>

type Entry = IndexEntry<'index>

fn entry_at(&self, pointer: &IndexPosition) -> Self::Entry

impl Index for CompositeIndex<'_>

fn shortest_unique_commit_id_prefix_len(&self, commit_id: &CommitId) -> usize

Suppose the given commit_id exists, returns the minimum prefix length to disambiguate it. The length to be returned is a number of hexadecimal digits.

If the given commit_id doesn’t exist, this will return the prefix length that never matches with any commit ids.

fn topo_order( &self, input: &mut dyn Iterator<Item = &CommitId> ) -> Vec<CommitId>

Parents before children

fn resolve_prefix(&self, prefix: &HexPrefix) -> PrefixResolution<CommitId>

fn has_id(&self, commit_id: &CommitId) -> bool

fn is_ancestor(&self, ancestor_id: &CommitId, descendant_id: &CommitId) -> bool

fn common_ancestors( &self, set1: &[CommitId], set2: &[CommitId] ) -> Vec<CommitId>

fn heads( &self, candidate_ids: &mut dyn Iterator<Item = &CommitId> ) -> Vec<CommitId>

fn evaluate_revset<'index>( &'index self, expression: &ResolvedExpression, store: &Arc<Store> ) -> Result<Box<dyn Revset<'index> + 'index>, RevsetEvaluationError>

impl<'a> Copy for CompositeIndex<'a>