rsaeb 0.6.0

A no_std + alloc interpreter for A=B ordered rewrite programs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

use alloc::vec::Vec;

use crate::allocation::{AllocationContext, AllocationError, try_push};
use crate::inspect::{RuleCount, RulePosition, RuleRepeat};
use crate::rule::{ParsedRule, Rule};

#[derive(Debug, PartialEq, Eq, Default)]
pub(crate) struct RuleSet {
    rules: Vec<Rule>,
}

impl RuleSet {
    pub(crate) fn new() -> Self {
        Self::default()
    }

    /// Stores one parsed rule and assigns its program-local position.
    ///
    /// # Errors
    ///
    /// Returns `AllocationError` if the rule position cannot be represented or
    /// the rule table cannot grow.
    pub(crate) fn push_parsed_rule(&mut self, parsed: ParsedRule) -> Result<(), AllocationError> {
        let position = RulePosition::from_zero_based(self.rules.len()).ok_or_else(|| {
            AllocationError::capacity_overflow(AllocationContext::ProgramRuleTable)
        })?;

        let rule = Rule::from_parsed(parsed, position);

        try_push(&mut self.rules, rule, AllocationContext::ProgramRuleTable)?;
        Ok(())
    }

    pub(crate) fn rule_count(&self) -> RuleCount {
        RuleCount::new(self.rules.len())
    }

    pub(crate) fn once_rule_count(&self) -> RuleCount {
        RuleCount::new(
            self.rules
                .iter()
                .filter(|rule| rule.repeat() == RuleRepeat::Once)
                .count(),
        )
    }

    pub(crate) fn as_slice(&self) -> &[Rule] {
        &self.rules
    }
}