Enum Tree 

pub enum Tree {
    Add(Vec<Self>),
    Mul(Vec<Self>),
    Num(Rational),
    Sym(Symbol),
}

Non-binary algebraic expression tree up to symbolic Multivector expressions.

Unifies and simplifies following implementations due to being an intermediate and recursive data structure:

• impl Display for Multivector
• impl Octal for Multivector

Convert from:

• Tree::from(Multivector) or Tree::with_factorization(v, true)
• Tree::from(Factorization)
• Tree::from(Polynomial)
• Tree::from(Monomial)
• Tree::from(Rational)
• Tree::from(Symbol)

Convert to:

• Multivector::try_from(tree) where Error = Symbol indicates that Symbol is not part of the Algebra. This is due Tree and Symbol being non-generic and hence agnostic of the Algebra.

Variants

Add(Vec<Self>)

Sum of subtrees.

Mul(Vec<Self>)

Product of subtrees.

Num(Rational)

Rational leaf node.

Sym(Symbol)

Symbolic leaf node.

Implementations

impl Tree

pub const ZERO: Self

The zero constant.

pub const ONE: Self

The one constant.

pub fn with_factorization<B: Algebra>(v: Multivector<B>, signed: bool) -> Self

Performs factorization on v and creates tree.

Optionally, the GCDs are signed comprising the factored predominant sign.

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Tree

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

Formats the value using the given formatter.

impl Default for Tree

fn default() -> Self

Returns the “default value” for a type.

impl From<Factorization> for Tree

fn from(f: Factorization) -> Self

Converts to this type from the input type.

impl From<Monomial> for Tree

fn from(m: Monomial) -> Self

Converts to this type from the input type.

impl<B: Algebra> From<Multivector<B>> for Tree

fn from(v: Multivector<B>) -> Self

Converts to this type from the input type.

impl From<Polynomial> for Tree

fn from(p: Polynomial) -> Self

Converts to this type from the input type.

impl From<Rational> for Tree

fn from(r: Rational) -> Self

Converts to this type from the input type.

impl From<Symbol> for Tree

fn from(s: Symbol) -> Self

Converts to this type from the input type.

impl Ord for Tree

fn cmp(&self, other: &Tree) -> 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 PartialEq for Tree

fn eq(&self, other: &Tree) -> 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 PartialOrd for Tree

fn partial_cmp(&self, other: &Tree) -> 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<B: Algebra> TryFrom<Tree> for Multivector<B>

type Error = Symbol

The type returned in the event of a conversion error.

fn try_from(tree: Tree) -> Result<Self, Self::Error>

Performs the conversion.

impl Eq for Tree

impl StructuralPartialEq for Tree