Struct Rule 

pub struct Rule<Unbound, Bound> { /* private fields */ }

A human friendly-ish logical rule representation. Each rule represents an if-then statement (implication relationship). Statements in the rule may contain constants and/or variables. Constants are represented as Entity::Bound. Variables are represented as Entity::Unbound.

So that rules remain turing-incomplete, an invariant is upheld: Unbound entities may not exists in the then clause unless they exist also in the if_all clause.

Implementations

impl<'a, Unbound: Ord + Clone, Bound: Ord> Rule<Unbound, Bound>

pub fn create( if_all: Vec<[Entity<Unbound, Bound>; 4]>, then: Vec<[Entity<Unbound, Bound>; 4]>, ) -> Result<Self, InvalidRule<Unbound>>

This constructor ensures that any unbound element in then also exists somewhere in if_all. If this is not the case the rule is invalid and the function will return Err. Otherwise it will return Ok.

impl<'a, Unbound, Bound> Rule<Unbound, Bound>

pub fn iter_entities(&self) -> impl Iterator<Item = &Entity<Unbound, Bound>>

pub fn if_all(&self) -> &[[Entity<Unbound, Bound>; 4]]

pub fn then(&self) -> &[[Entity<Unbound, Bound>; 4]]

Trait Implementations

impl<Unbound: Clone, Bound: Clone> Clone for Rule<Unbound, Bound>

fn clone(&self) -> Rule<Unbound, Bound>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Unbound: Debug, Bound: Debug> Debug for Rule<Unbound, Bound>

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

Formats the value using the given formatter.

impl<Unbound: Ord, Bound: Ord> Ord for Rule<Unbound, Bound>

fn cmp(&self, other: &Rule<Unbound, Bound>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<Unbound: PartialEq, Bound: PartialEq> PartialEq for Rule<Unbound, Bound>

fn eq(&self, other: &Rule<Unbound, Bound>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Unbound: PartialOrd, Bound: PartialOrd> PartialOrd for Rule<Unbound, Bound>

fn partial_cmp(&self, other: &Rule<Unbound, Bound>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Unbound: Eq, Bound: Eq> Eq for Rule<Unbound, Bound>

impl<Unbound, Bound> StructuralPartialEq for Rule<Unbound, Bound>