Struct IncrementalEngine 

pub struct IncrementalEngine<K, V> { /* private fields */ }

A dependency-light incremental query engine.

Implementations

impl<K, V> IncrementalEngine<K, V>

where K: Ord + Clone,

pub fn new() -> Self

Creates an empty incremental query engine.

pub fn register_query(&mut self, key: K, query: Query<K, V>)

Registers or replaces a query callback for key.

pub fn register_fn<F>(&mut self, key: K, query: F)

where F: for<'a> Fn(&K, &mut QueryFrame<'a, K, V>) -> QueryResult<K, V> + Send + Sync + 'static,

Registers a query callback function for key.

pub fn remove_query(&mut self, key: &K) -> bool

Removes a query and marks its dependents dirty.

pub fn invalidate(&mut self, key: &K) -> Revision

Advances an external observation stamp and invalidates reverse dependents.

pub fn source_revision(&self, key: &K) -> Revision

Returns the current external observation revision for key.

pub fn dirty_keys(&self) -> Vec<K>

Returns dirty memo keys in deterministic order.

pub fn memo_revision(&self, key: &K) -> Option<Revision>

Returns the current memo revision for key, when present.

pub fn memo_fingerprint(&self, key: &K) -> Option<ValueFingerprint>

Returns the current memo fingerprint for key, when present.

impl<K, V> IncrementalEngine<K, V>

where K: Ord + Clone, V: Clone + FingerprintValue,

pub fn verify(&mut self, key: K) -> QueryResult<K, V>

Verifies a root query using unbounded budgets.

pub fn verify_with_budgets( &mut self, key: K, budgets: QueryBudgets, ) -> QueryResult<K, V>

Verifies a root query using explicit budgets.

pub fn resume( &mut self, token: ContinuationToken, budgets: QueryBudgets, ) -> QueryResult<K, V>

Resumes the root query represented by a continuation token.

pub fn verify_many<I>(&mut self, keys: I) -> QueryResult<K, Vec<(K, V)>>

where I: IntoIterator<Item = K>,

Verifies roots in stable key order using unbounded budgets.

pub fn verify_many_with_budgets<I>( &mut self, keys: I, budgets: QueryBudgets, ) -> QueryResult<K, Vec<(K, V)>>

where I: IntoIterator<Item = K>,

Verifies roots in stable key order using explicit budgets for each root.

impl<K, V> IncrementalEngine<K, V>

where K: Ord + Clone, V: Clone + FingerprintValue,

pub fn snapshot<I>( &mut self, roots: I, budgets: SnapshotBudgets, ) -> QueryResult<K, GraphSnapshot<K, V>>

where I: IntoIterator<Item = K>,

Exports memo graph state reachable from roots.

pub fn restore_snapshot( &mut self, snapshot: GraphSnapshot<K, V>, ) -> Result<RestoreReport, SnapshotError<K>>

Restores memo graph state and rebuilds reverse dependency edges.

Trait Implementations

impl<K, V> Default for IncrementalEngine<K, V>

where K: Ord + Clone,

fn default() -> Self

Returns the “default value” for a type.