Struct StratifiedProgram 

pub struct StratifiedProgram<'p> { /* private fields */ }

A program that has been successfully stratified.

Contains the original program and the computed strata. This structure is used to guide the execution order of the IR.

Stratification ensures that if a predicate p depends negatively on q, then q is evaluated in an earlier stratum than p. This allows for the correct evaluation of negation and aggregation (semi-naive evaluation).

Implementations

impl<'p> StratifiedProgram<'p>

pub fn arena(&'p self) -> &'p Arena

Returns the AST Arena containing the program data.

pub fn extensional_preds(&'p self) -> PredicateSet

Returns predicates for extensional DB (stored facts).

pub fn intensional_preds(&'p self) -> PredicateSet

Returns predicates for intensional DB (derived rules).

pub fn rules( &'p self, sym: PredicateIndex, ) -> impl Iterator<Item = &'p Clause<'p>>

Maps predicates of intensional DB to their defining rules.

pub fn strata(&'p self) -> Vec<PredicateSet>

Returns an iterator of strata, in dependency order. Each stratum is a set of mutually recursive predicates that can be evaluated together.

pub fn pred_to_index(&'p self, sym: PredicateIndex) -> Option<usize>

Returns the stratum index for a given predicate symbol. Returns None if the predicate is not part of the stratified program (e.g. it’s EDB).

Trait Implementations

impl<'p> Clone for StratifiedProgram<'p>

fn clone(&self) -> StratifiedProgram<'p>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'p> Debug for StratifiedProgram<'p>

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

Formats the value using the given formatter.