Trait Ruleset 

pub trait Ruleset<Q, A>: RawRuleset<Q, A>
where
    Q: RawState,
    Self::Rule: Instruction<Q, A, Head = Head<Q, A>, Tail = Tail<Q, A>>,
{
    // Required methods
    fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>;
    fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>;

    // Provided method
    fn find_head(&self, _: Head<&Q, &A>) -> Option<&Tail<Q, A>> { ... }
}

Required Methods

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

Provided Methods

fn find_head(&self, _: Head<&Q, &A>) -> Option<&Tail<Q, A>>

Implementations on Foreign Types

impl<I, Q, A> Ruleset<Q, A> for &[I]

where Q: RawState + PartialEq, A: PartialEq, I: Instruction<Q, A, Head = Head<Q, A>, Tail = Tail<Q, A>>,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<I, Q, A> Ruleset<Q, A> for &mut [I]

where Q: RawState + PartialEq, A: PartialEq, I: Instruction<Q, A, Head = Head<Q, A>, Tail = Tail<Q, A>>,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<I, Q, A> Ruleset<Q, A> for [I]

where Q: RawState + PartialEq, A: PartialEq, I: Instruction<Q, A, Head = Head<Q, A>, Tail = Tail<Q, A>>,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<I, Q, A> Ruleset<Q, A> for BTreeSet<I>

where Q: RawState + PartialEq, A: PartialEq, I: Instruction<Q, A, Head = Head<Q, A>, Tail = Tail<Q, A>>,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<I, Q, A> Ruleset<Q, A> for Vec<I>

where Q: RawState + PartialEq, A: PartialEq, I: Instruction<Q, A, Head = Head<Q, A>, Tail = Tail<Q, A>>,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<Q, A> Ruleset<Q, A> for BTreeMap<Head<Q, A>, Tail<Q, A>>

where Q: RawState + Ord, A: Ord,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<Q, A> Ruleset<Q, A> for HashMap<Head<Q, A>, Tail<Q, A>>

where Q: RawState + Eq + Hash, A: Eq + Hash,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<Q, A> Ruleset<Q, A> for HashSet<Rule<Q, A>>

where Q: RawState + Eq + Hash, A: Eq + Hash,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

impl<const N: usize, I, Q, A> Ruleset<Q, A> for [I; N]

where Q: RawState + PartialEq, A: PartialEq, I: Instruction<Q, A, Head = Head<Q, A>, Tail = Tail<Q, A>>,

fn get(&self, head: &Head<Q, A>) -> Option<&Tail<Q, A>>

fn find_tail(&self, state: State<&Q>, sym: &A) -> Option<&Tail<Q, A>>

Implementors