Enum BinaryNode

pub enum BinaryNode {
    Atomic,
    Binary {
        lhs: Arc<BinaryNode>,
        rhs: Arc<BinaryNode>,
    },
}

A element in full binary tree Can be a atom or a node

Variants

Atomic

A atom in full binary tree

Binary

A node in full binary tree

Fields

lhs: Arc<BinaryNode>

left hand side leaf

rhs: Arc<BinaryNode>

right hand side leaf

Implementations

impl BinaryNode

pub fn as_rpn(&self) -> ReversePolishNotation

Convert a full binary tree to reverse polish notation

impl BinaryNode

pub fn as_expression<V, O>( &self, values: Vec<V>, actions: Vec<O>, ) -> Arc<ExpressionNode<V, O>>

Make the binary tree into an expression tree

impl BinaryNode

pub fn atomic() -> Arc<Self>

Arguments

• lhs:
• rhs:

returns: Arc

pub fn binary(lhs: &Arc<Self>, rhs: &Arc<Self>) -> Arc<Self>

Arguments

• lhs:
• rhs:

returns: Arc

pub fn nodes(&self) -> usize

Count nodes in a full binary tree

Trait Implementations

impl Clone for BinaryNode

fn clone(&self) -> BinaryNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BinaryNode

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

Formats the value using the given formatter.

impl Default for BinaryNode

fn default() -> Self

Returns the “default value” for a type.

impl Hash for BinaryNode

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for BinaryNode

fn eq(&self, other: &BinaryNode) -> bool

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

const 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 Eq for BinaryNode

impl StructuralPartialEq for BinaryNode