Struct PersistenceProgram 

pub struct PersistenceProgram { /* private fields */ }

Exact H0 and H1 program compiled over sparse graph atoms.

Implementations

impl PersistenceProgram

pub fn kill_h1_before( &self, target: IntervalGroupId, target_scale: f64, budget: InterventionBudget, ) -> Result<H1Intervention, Error>

Find an independent-weight edit that shortens one finite H1 class space.

The target must satisfy birth < target_scale < death. The candidate lowers every edge above target_scale in every declared destroyer triangle. Optimal is relative to the same reduction and critical-pair certificate. It is not a global inverse persistence claim across unrelated pairings.

impl PersistenceProgram

pub fn compile( input: &SparseDistanceMatrix, params: &RipsParams, limits: CertificateLimits, ) -> Result<Self>

Compile a compositional H0 and H1 program.

Each cyclic atom receives its own reduction certificate. Graphs without a useful split remain one exact atom.

impl PersistenceProgram

pub fn into_diagram_state(self) -> ProgramDiagramState

Move a compiled program into stateful diagram evaluation.

impl PersistenceProgram

pub fn result(&self) -> &ExplainedDiagram

Exact current result.

pub fn summary(&self) -> ProgramSummary

Program decomposition and guard counts.

pub fn atoms(&self) -> &[ProgramAtomInfo]

All structural atoms, including bridge atoms.

pub fn checkpoint(&self) -> ProgramCheckpoint

Capture the current state for later restore or branching.

pub fn restore(&mut self, checkpoint: &ProgramCheckpoint)

Replace this program with a captured state.

pub fn advance_batch( &mut self, updates: &[SparseDistanceMatrix], ) -> Result<Vec<ProgramUpdate>>

Advance an ordered batch atomically.

If one update fails, the program is left unchanged.

pub fn advance_batch_with( &mut self, updates: &[SparseDistanceMatrix], correspondence_mode: CorrespondenceMode, ) -> Result<Vec<ProgramUpdate>>

Advance an ordered batch atomically with correspondence control.

pub fn branch( &self, alternatives: &[SparseDistanceMatrix], ) -> Result<Vec<ProgramBranch>>

Advance independent alternatives from the current state.

Output order matches input order. The program is left unchanged. With more than one configured thread, alternatives run concurrently.

pub fn branch_with( &self, alternatives: &[SparseDistanceMatrix], correspondence_mode: CorrespondenceMode, ) -> Result<Vec<ProgramBranch>>

Advance independent alternatives with correspondence control.

pub fn evaluate_diagram( &self, updated: &SparseDistanceMatrix, ) -> Result<ProgramEvaluation>

Evaluate only the diagram while every touched certificate remains valid.

pub fn advance( &mut self, updated: &SparseDistanceMatrix, ) -> Result<ProgramUpdate>

Advance to new weights with exact class correspondence.

pub fn advance_with( &mut self, updated: &SparseDistanceMatrix, correspondence_mode: CorrespondenceMode, ) -> Result<ProgramUpdate>

Advance with explicit control over cross-state class correspondence.

Trait Implementations

impl Clone for PersistenceProgram

fn clone(&self) -> PersistenceProgram

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PersistenceProgram

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

Formats the value using the given formatter.