Struct ProximityMap 

pub struct ProximityMap<S: Store> { /* private fields */ }

Immutable exact-key directory plus deterministic ANN hierarchy.

Implementations

impl<S> ProximityMap<S>

where S: Store + Clone + Send + Sync, S::Error: Send + Sync,

pub fn build( store: S, config: ProximityConfig, records: impl IntoIterator<Item = ProximityRecord>, ) -> Result<Self, Error>

Build a canonical proximity map from logical records.

pub fn build_with_parallelism( store: S, config: ProximityConfig, records: impl IntoIterator<Item = ProximityRecord>, parallelism: BuildParallelism, ) -> Result<(Self, ProximityBuildStats), Error>

Build with an explicit runtime worker limit and canonical logical stats.

pub fn load(store: S, descriptor_cid: Cid) -> Result<Self, Error>

Load and locally validate a persisted proximity descriptor.

pub fn tree(&self) -> &ProximityTree

The immutable roots and shape configuration committed by this map.

pub fn clear_content_cache(&self) -> Result<(), Error>

Invalidate process-local decoded proximity objects after an external content sweep. This does not mutate or remove persisted content.

pub fn get(&self, key: &[u8]) -> Result<Option<ExactProximityRecord>, Error>

Exact key lookup through the authoritative ordered directory.

pub fn contains_key(&self, key: &[u8]) -> Result<bool, Error>

Exact key membership through the authoritative ordered directory.

pub fn rebuild_batch( &self, mutations: impl IntoIterator<Item = ProximityMutation>, ) -> Result<Self, Error>

Canonical full rebuild after applying a sorted-unique logical mutation batch.

pub fn mutate_batch( &self, mutations: impl IntoIterator<Item = ProximityMutation>, ) -> Result<(Self, ProximityMutationStats), Error>

Copy-on-write mutation with exact clean-rebuild CID equivalence.

pub fn search(&self, request: SearchRequest<'_>) -> Result<SearchResult, Error>

Deterministic global best-first search over the authoritative hierarchy.

pub fn verify(&self) -> Result<ProximityVerification, Error>

Traverse and validate the descriptor, directory, hierarchy, and routing invariants.

impl<S> ProximityMap<S>

where S: Store + Clone + Send + Sync, S::Error: Send + Sync,

pub fn prove_membership( &self, key: &[u8], ) -> Result<ProximityMembershipProof, Error>

Prove exact presence or absence without requiring the verifier’s store.

impl<S> ProximityMap<S>

where S: Store + Clone + Send + Sync, S::Error: Send + Sync,

pub fn prove_search( &self, request: SearchRequest<'_>, limits: &ContentGraphLimits, ) -> Result<ProximitySearchProof, Error>

Prove deterministic native execution. Auto is allowed when it resolves to the native map; explicit accelerator requests use their sidecars.

impl<S> ProximityMap<S>

where S: Store + Clone + Send + Sync, S::Error: Send + Sync,

pub fn prove_structure( &self, limits: &ContentGraphLimits, ) -> Result<ProximityStructuralProof, Error>

Capture the authenticated typed closure of this immutable snapshot.