Enum Tree

pub enum Tree {
    Name(String),
    Unary(UnaryOp, Box<Tree>),
    Binary(BinaryOp, Box<Tree>, Box<Tree>),
}

Parsed element showed in a tree in infix notation.

Variants

Name(String)

Unary(UnaryOp, Box<Tree>)

Binary(BinaryOp, Box<Tree>, Box<Tree>)

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a copy 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 Display for Tree

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

Show a tree as an infix expression.

Example:

use math_parse::*;
assert_eq!(
    format!("{}", MathParse::parse("(2+3)*2/5").unwrap().to_tree().unwrap()),
    "(((2 + 3) * 2) / 5)".to_string());

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 StructuralPartialEq for Tree