Struct StreamingFactorGraph 

pub struct StreamingFactorGraph { /* private fields */ }

Memory-efficient factor graph for very large models.

Uses streaming computation and doesn’t hold all factors in memory.

Implementations

impl StreamingFactorGraph

pub fn new() -> Self

Create a new streaming factor graph.

pub fn with_pool(pool: Arc<FactorPool>) -> Self

Create with a custom memory pool.

pub fn add_variable(&mut self, name: String, domain: String, cardinality: usize)

Add a variable.

pub fn add_factor<F>(&mut self, generator: F)

where F: Fn() -> Result<Factor> + Send + Sync + 'static,

Add a factor generator.

pub fn stream_factors(&self) -> impl Iterator<Item = Result<Factor>> + '_

Stream factors one at a time for memory-efficient processing.

pub fn streaming_product(&self) -> Result<Factor>

Compute the product of all factors using streaming.

Memory efficient but may be slower than batch computation.

pub fn num_variables(&self) -> usize

Number of variables.

pub fn num_factors(&self) -> usize

Number of factors.

Trait Implementations

impl Default for StreamingFactorGraph

fn default() -> Self

Returns the “default value” for a type.