Enum Node 

pub enum Node<P: Primitive> {
    Map(HashMap<String, Node<P>>),
    Sequence(Vec<Node<P>>),
    Leaf(P),
}

Represents a single Node. We transform input structures into Node trees in order to recursively diff them

Variants

Map(HashMap<String, Node<P>>)

Sequence(Vec<Node<P>>)

Leaf(P)

Trait Implementations

impl<P: Clone + Primitive> Clone for Node<P>

fn clone(&self) -> Node<P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Debug + Primitive> Debug for Node<P>

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

Formats the value using the given formatter.

impl<P: PartialEq + Primitive> PartialEq for Node<P>

fn eq(&self, other: &Node<P>) -> 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<P: Eq + Primitive> Eq for Node<P>

impl<P: Primitive> StructuralPartialEq for Node<P>