Enum RuleFormula 

#[non_exhaustive]
pub enum RuleFormula {
    Condition(RuleCondition),
    And(Box<RuleFormula>, Box<RuleFormula>),
    Or(Box<RuleFormula>, Box<RuleFormula>),
    Not(Box<RuleFormula>),
}

A typed boolean rule formula tree.

Formula nodes compose typed conditions directly. They are not serialized through an instruction stream and they do not require a runtime reducer.

Examples

use vyre_libs::rule::{RuleCondition, RuleFormula};

let formula = RuleFormula::and(
    RuleFormula::condition(RuleCondition::PatternExists { pattern_id: 0 }),
    RuleFormula::not(RuleFormula::condition(RuleCondition::LiteralFalse)),
);
let program = formula.to_program().expect("Fix: formula lowers");
assert!(program.has_buffer("verdicts"));

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Condition(RuleCondition)

Leaf condition.

And(Box<RuleFormula>, Box<RuleFormula>)

Logical conjunction.

Or(Box<RuleFormula>, Box<RuleFormula>)

Logical disjunction.

Not(Box<RuleFormula>)

Logical negation.

Implementations

impl RuleFormula

pub fn condition(condition: RuleCondition) -> Self

Create a leaf formula.

pub fn and(left: Self, right: Self) -> Self

Create a conjunction.

pub fn or(left: Self, right: Self) -> Self

Create a disjunction.

pub fn not_formula(formula: Self) -> Self

Create a negation.

pub fn not(formula: Self) -> Self

Create a negation.

pub fn to_program(&self) -> Result<Program, RuleBuildError>

Build a one-rule Program that stores the formula verdict at index 0.

Errors

Returns builder::RuleBuildError when the formula contains a condition the core builder cannot lower truthfully.

Examples

use vyre_libs::rule::{RuleCondition, RuleFormula};

let program = RuleFormula::condition(RuleCondition::LiteralTrue)
    .to_program()
    .expect("Fix: literal rule lowers");
assert!(program.has_buffer("rule_bitmaps"));
assert!(program.has_buffer("verdicts"));

pub fn try_to_program(&self) -> Result<Program, RuleBuildError>

Try to build a one-rule Program that stores the formula verdict at index 0.

Errors

Returns builder::RuleBuildError when the formula contains a condition the core builder cannot lower truthfully.

Trait Implementations

impl Clone for RuleFormula

fn clone(&self) -> RuleFormula

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RuleFormula

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

Formats the value using the given formatter.

impl Eq for RuleFormula

impl PartialEq for RuleFormula

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RuleFormula