Struct WorkspaceCache 

pub struct WorkspaceCache { /* private fields */ }

Probabilistic workspace membership cache using bloom filter for fast rejection.

Provides 10x+ faster negative lookups for paths that are definitely NOT workspaces. Uses two-phase lookup:

1. Bloom filter check — fast rejection of non-members (zero false negatives)
2. HashSet confirmation — authoritative membership for bloom positives

Implementations

impl WorkspaceCache

pub fn new<I>(workspaces: I) -> WorkspaceCache

where I: IntoIterator<Item = PathBuf>,

Create a new workspace cache from a set of workspace paths.

pub fn empty() -> WorkspaceCache

Create an empty workspace cache.

pub fn contains(&self, path: &PathBuf) -> bool

Check if a path is a known workspace.

pub fn is_under_workspace(&self, path: &Path) -> Option<&PathBuf>

Check if a path is under any known workspace.

pub fn normalize(&mut self, path: &PathBuf) -> PathBuf

Get or compute normalized path, caching the result.

pub fn stats(&self) -> (u64, u64, u64)

Get lookup statistics: (total_lookups, bloom_rejections, exact_hits).

pub fn len(&self) -> usize

Get the number of workspaces in the cache.

pub fn is_empty(&self) -> bool

Check if the cache is empty.

Trait Implementations

impl Debug for WorkspaceCache

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

Formats the value using the given formatter.