Enum mt_dom::Node

pub enum Node<NS, TAG, LEAF, ATT, VAL> where
    NS: PartialEq + Clone + Debug,
    TAG: PartialEq + Debug,
    LEAF: PartialEq + Clone + Debug,
    ATT: PartialEq + Clone + Debug,
    VAL: PartialEq + Clone + Debug,  {
    Element(Element<NS, TAG, LEAF, ATT, VAL>),
    Leaf(LEAF),
}

represents a node in a virtual dom A node could be an element which can contain one or more children of nodes. A node could also be just a text node which contains a string

Much of the types are Generics

NS - is the type for the namespace, this will be &’static str when used in html based virtual dom implementation TAG - is the type for the element tag, this will be &’static str when used in html based virtual dom impmenentation ATT - is the type for the attribute name, this will be &’static str when used in html based virtual dom implementation VAL - is the type for the value of the attribute, this will be String, f64, or just another generics that suits the implementing library which used mt-dom for just dom-diffing purposes

Variants

Element(Element<NS, TAG, LEAF, ATT, VAL>)

Element variant of a virtual node

Leaf(LEAF)

A Leaf node

Implementations

impl<NS, TAG, LEAF, ATT, VAL> Node<NS, TAG, LEAF, ATT, VAL> where
    NS: PartialEq + Clone + Debug,
    TAG: PartialEq + Debug,
    LEAF: PartialEq + Clone + Debug,
    ATT: PartialEq + Clone + Debug,
    VAL: PartialEq + Clone + Debug, 

pub fn take_element(self) -> Option<Element<NS, TAG, LEAF, ATT, VAL>>

consume self and return the element if it is an element variant None if it is a text node

pub fn as_element_mut(
    &mut self
) -> Option<&mut Element<NS, TAG, LEAF, ATT, VAL>>

Get a mutable reference to the element, if this node is an element node

pub fn as_element_ref(&self) -> Option<&Element<NS, TAG, LEAF, ATT, VAL>>

returns a reference to the element if this is an element node

pub fn add_children(
    self,
    children: impl IntoIterator<Item = Node<NS, TAG, LEAF, ATT, VAL>>
) -> Self

Consume a mutable self and add a children to this node it if is an element will have no effect if it is a text node. This is used in building the nodes in a builder pattern

pub fn add_children_ref_mut(
    &mut self,
    children: impl IntoIterator<Item = Node<NS, TAG, LEAF, ATT, VAL>>
)

add children but not consume self

pub fn add_attributes(
    self,
    attributes: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>
) -> Self

add attributes to the node and returns itself this is used in view building

pub fn add_attributes_ref_mut(
    &mut self,
    attributes: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>
)

add attributes using a mutable reference to self

pub fn get_attributes(&self) -> Option<&[Attribute<NS, ATT, VAL>]>

get the attributes of this node returns None if it is a text node

pub fn tag(&self) -> Option<&TAG>

returns the tag of this node if it is an element otherwise None if it is a text node

pub fn get_children(&self) -> Option<&[Node<NS, TAG, LEAF, ATT, VAL>]>

return the children of this node if it is an element returns None if it is a text node

pub fn get_children_count(&self) -> usize

Return the count of the children of this node

pub fn children_mut(&mut self) -> Option<&mut [Node<NS, TAG, LEAF, ATT, VAL>]>

return the children of this node if it is an element returns None if it is a text node

pub fn swap_remove_child(
    &mut self,
    index: usize
) -> Node<NS, TAG, LEAF, ATT, VAL>

Removes an child node from this element and returns it.

The removed child is replaced by the last child of the element’s children.

Panics

Panics if this is a text node

pub fn swap_children(&mut self, a: usize, b: usize)

Swaps the 2 child node in this element

Arguments

• a - The index of the first child node
• b - The index of the second child node

Panics

Panics if both a and b are out of bounds Panics if this is a text node

pub fn node_count(&self) -> usize

Returns the total number of nodes on this node tree, that is counting the direct and indirect child nodes of this node.

pub fn descendant_node_count(&self) -> usize

only count the descendant node

pub fn set_attributes_ref_mut(
    &mut self,
    attributes: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>
)

remove the existing attributes and set with the new value

pub fn merge_attributes(
    self,
    attributes: impl IntoIterator<Item = Attribute<NS, ATT, VAL>>
) -> Self

merge to existing attributes if the attribute name already exist

pub fn get_attribute_value(&self, name: &ATT) -> Option<Vec<&VAL>>

returh the attribute values of this node which match the attribute name name

Trait Implementations

impl<NS: Clone, TAG: Clone, LEAF: Clone, ATT: Clone, VAL: Clone> Clone for Node<NS, TAG, LEAF, ATT, VAL> where
    NS: PartialEq + Clone + Debug,
    TAG: PartialEq + Debug,
    LEAF: PartialEq + Clone + Debug,
    ATT: PartialEq + Clone + Debug,
    VAL: PartialEq + Clone + Debug, 

fn clone(&self) -> Node<NS, TAG, LEAF, ATT, VAL>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<NS: Debug, TAG: Debug, LEAF: Debug, ATT: Debug, VAL: Debug> Debug for Node<NS, TAG, LEAF, ATT, VAL> where
    NS: PartialEq + Clone + Debug,
    TAG: PartialEq + Debug,
    LEAF: PartialEq + Clone + Debug,
    ATT: PartialEq + Clone + Debug,
    VAL: PartialEq + Clone + Debug, 

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

Formats the value using the given formatter.

impl<NS: PartialEq, TAG: PartialEq, LEAF: PartialEq, ATT: PartialEq, VAL: PartialEq> PartialEq<Node<NS, TAG, LEAF, ATT, VAL>> for Node<NS, TAG, LEAF, ATT, VAL> where
    NS: PartialEq + Clone + Debug,
    TAG: PartialEq + Debug,
    LEAF: PartialEq + Clone + Debug,
    ATT: PartialEq + Clone + Debug,
    VAL: PartialEq + Clone + Debug, 

fn eq(&self, other: &Node<NS, TAG, LEAF, ATT, VAL>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Node<NS, TAG, LEAF, ATT, VAL>) -> bool

This method tests for !=.

impl<NS, TAG, LEAF, ATT, VAL> StructuralPartialEq for Node<NS, TAG, LEAF, ATT, VAL> where
    NS: PartialEq + Clone + Debug,
    TAG: PartialEq + Debug,
    LEAF: PartialEq + Clone + Debug,
    ATT: PartialEq + Clone + Debug,
    VAL: PartialEq + Clone + Debug,