Struct ContentIndex 

pub struct ContentIndex { /* private fields */ }

Per-root overlay: relative path → unique sorted trigrams.

Implementations

impl ContentIndex

pub fn new() -> Self

pub fn clear(&mut self)

pub fn is_complete(&self) -> bool

pub fn mark_complete(&mut self)

pub fn indexed_len(&self) -> usize

pub fn skipped_len(&self) -> usize

pub fn upsert(&mut self, root: &Path, rel: &str, size: u64)

Re-read rel under root and replace its posting.

pub fn remove(&mut self, rel: &str)

pub fn remove_tree(&mut self, rel: &str)

Drop rel and every descendant (rel/…).

pub fn may_match(&self, rel: &str, required: &[u32]) -> bool

true when rel might contain every required trigram.

Unknown paths (not yet filled, read error, symlink, too large) return true so a partial overlay never hides a match. Binary paths return false — the grep engine would skip them too.

Trait Implementations

impl Debug for ContentIndex

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

Formats the value using the given formatter.

impl Default for ContentIndex

fn default() -> Self

Returns the “default value” for a type.