Struct GraphIndexPrefixAdapter 

pub struct GraphIndexPrefixAdapter<I: IndexLike> { /* private fields */ }

An adapter that prefixes/un-prefixes every key passed through to a wrapped index. Mirrors GraphIndexPrefixAdapter.

Implementations

impl<I: IndexLike> GraphIndexPrefixAdapter<I>

pub fn new(inner: I, prefix: IndexKey, missing_key_length: usize) -> Self

Trait Implementations

impl<I: IndexLike> IndexLike for GraphIndexPrefixAdapter<I>

fn key_count(&self) -> Result<usize, IndexError>

Number of present keys in the index.

fn node_ref_lists(&self) -> Result<usize, IndexError>

Number of parallel reference lists per node.

fn iter_all(&self) -> Result<Vec<IndexEntry>, IndexError>

Iterate every present entry.

fn iter(&self, keys: &[IndexKey]) -> Result<Vec<IndexEntry>, IndexError>

Iterate present entries restricted to keys.

fn iter_prefix( &self, prefixes: &[KeyPrefix], ) -> Result<Vec<IndexEntry>, IndexError>

Iterate present entries whose keys match one of prefixes.

fn external_refs( &self, _ref_list_num: usize, ) -> Result<HashSet<IndexKey>, IndexError>

Set of reference keys at ref_list_num not present in the index.

fn validate(&self) -> Result<(), IndexError>

Best-effort validation walk.

fn clear_cache(&self)

Optional cache-clear hook. Default no-op.

fn find_ancestors( &self, search_keys: &[IndexKey], ref_list_num: usize, parent_map: &mut HashMap<IndexKey, Vec<IndexKey>>, missing_keys: &mut HashSet<IndexKey>, ) -> Result<HashSet<IndexKey>, IndexError>

One step of the ancestry walk used by CombinedGraphIndex::find_ancestry. Looks up each key in the index, populating parent_map[key] = parent_keys for each found entry and adding the unfound keys to missing_keys. Returns the parent keys that aren’t already in parent_map, ready to feed into the next iteration.