Struct Stratification 

pub struct Stratification {
    pub strata: Vec<Stratum>,
    pub predicate_stratum: BTreeMap<PredicateSymbol, usize>,
}

Stratification of a Datalog¬ program.

Fields

strata: Vec<Stratum>

Strata ordered by ascending index. Stratum k must be evaluated to a fixed point before stratum k+1.

predicate_stratum: BTreeMap<PredicateSymbol, usize>

Map from predicate to its stratum index. context-aware rolls up the underlying (predicate, head-graph-class) dependency nodes by taking the maximum stratum across head-graph classes of the same predicate — so a producer that emits facts in more than one graph class is scheduled late enough for every downstream consumer.

Implementations

impl Stratification

pub fn stratum_of(&self, predicate: &PredicateSymbol) -> Option<usize>

Returns the stratum index for a predicate, or None if the predicate does not appear in the program (pure EDB predicates not derived by any rule).

Trait Implementations

impl Clone for Stratification

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Stratification

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

Formats the value using the given formatter.

impl Eq for Stratification

impl PartialEq for Stratification

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Stratification