Struct CompositeAccelerator 

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

Implementations

impl<S> CompositeAccelerator<S>

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

pub fn build_or_rebuild( base_map: &ProximityMap<S>, current_map: &ProximityMap<S>, base: CompositeBase<S>, config: CompositeAcceleratorConfig, limits: CompositeBuildLimits, rebuild: CompositeRebuildOptions, ) -> Result<CompositeBuildOrRebuildOutcome<S>, Error>

Build a bounded composite, or synchronously replace it with a full current-source accelerator using the base accelerator’s configuration.

pub fn build( base_map: &ProximityMap<S>, current_map: &ProximityMap<S>, base: CompositeBase<S>, config: CompositeAcceleratorConfig, limits: CompositeBuildLimits, ) -> Result<CompositeBuildOutcome<S>, Error>

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

pub fn manifest_cid(&self) -> &Cid

pub fn current_source_descriptor(&self) -> &Cid

pub fn base_source_descriptor(&self) -> &Cid

pub fn base_kind(&self) -> CompositeBaseKind

pub fn delta_count(&self) -> u64

pub fn shadow_count(&self) -> u64

pub fn config(&self) -> &CompositeAcceleratorConfig

pub fn build_stats(&self) -> &CompositeBuildStats

impl<S> CompositeAccelerator<S>

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

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

Prove a source-bound base-plus-delta execution and its committed child plan.