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>),
NodeList(Vec<Node<Ns, Tag, Leaf, Att, Val>>),
Fragment(Vec<Node<Ns, Tag, Leaf, Att, Val>>),
Leaf(Leaf),
}
Expand description
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
NodeList(Vec<Node<Ns, Tag, Leaf, Att, Val>>)
A node containing nodes, this will be unrolled together with the rest of the children of the node
Fragment(Vec<Node<Ns, Tag, Leaf, Att, Val>>)
A document fragment node, will be created using fragment node and attached to the dom
Leaf(Leaf)
A Leaf node
Implementations§
source§impl<Ns, Tag, Leaf, Att, Val> Node<Ns, Tag, Leaf, Att, Val>
impl<Ns, Tag, Leaf, Att, Val> Node<Ns, Tag, Leaf, Att, Val>
sourcepub fn take_element(self) -> Option<Element<Ns, Tag, Leaf, Att, Val>>
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
sourcepub fn leaf(&self) -> Option<&Leaf>
pub fn leaf(&self) -> Option<&Leaf>
returns a reference to the Leaf if the node is a Leaf variant
sourcepub fn is_element(&self) -> bool
pub fn is_element(&self) -> bool
returns true if the node is an element variant
sourcepub fn is_fragment(&self) -> bool
pub fn is_fragment(&self) -> bool
returns true if the Node is a fragment variant
sourcepub fn element_mut(&mut self) -> Option<&mut Element<Ns, Tag, Leaf, Att, Val>>
pub fn 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
sourcepub fn element_ref(&self) -> Option<&Element<Ns, Tag, Leaf, Att, Val>>
pub fn element_ref(&self) -> Option<&Element<Ns, Tag, Leaf, Att, Val>>
returns a reference to the element if this is an element node
sourcepub fn with_children(
self,
children: impl IntoIterator<Item = Node<Ns, Tag, Leaf, Att, Val>>
) -> Self
pub fn with_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
sourcepub fn add_children(
&mut self,
children: impl IntoIterator<Item = Node<Ns, Tag, Leaf, Att, Val>>
) -> Result<(), Error>
pub fn add_children( &mut self, children: impl IntoIterator<Item = Node<Ns, Tag, Leaf, Att, Val>> ) -> Result<(), Error>
add children but not consume self
sourcepub fn with_attributes(
self,
attributes: impl IntoIterator<Item = Attribute<Ns, Att, Val>>
) -> Self
pub fn with_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
sourcepub fn add_attributes(
&mut self,
attributes: impl IntoIterator<Item = Attribute<Ns, Att, Val>>
) -> Result<(), Error>
pub fn add_attributes( &mut self, attributes: impl IntoIterator<Item = Attribute<Ns, Att, Val>> ) -> Result<(), Error>
add attributes using a mutable reference to self
sourcepub fn attributes(&self) -> Option<&[Attribute<Ns, Att, Val>]>
pub fn attributes(&self) -> Option<&[Attribute<Ns, Att, Val>]>
get the attributes of this node returns None if it is a text node
sourcepub fn tag(&self) -> Option<&Tag>
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
sourcepub fn children(&self) -> &[Node<Ns, Tag, Leaf, Att, Val>]
pub fn children(&self) -> &[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
sourcepub fn children_count(&self) -> usize
pub fn children_count(&self) -> usize
Return the count of the children of this node
sourcepub fn children_mut(&mut self) -> Option<&mut [Node<Ns, Tag, Leaf, Att, Val>]>
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
sourcepub fn swap_remove_child(
&mut self,
index: usize
) -> Node<Ns, Tag, Leaf, Att, Val>
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
sourcepub fn swap_children(&mut self, a: usize, b: usize)
pub fn swap_children(&mut self, a: usize, b: usize)
sourcepub fn node_count(&self) -> usize
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.
sourcepub fn descendant_node_count(&self) -> usize
pub fn descendant_node_count(&self) -> usize
only count the descendant node
sourcepub fn set_attributes(
&mut self,
attributes: impl IntoIterator<Item = Attribute<Ns, Att, Val>>
) -> Result<(), Error>
pub fn set_attributes( &mut self, attributes: impl IntoIterator<Item = Attribute<Ns, Att, Val>> ) -> Result<(), Error>
remove the existing attributes and set with the new value
sourcepub fn merge_attributes(
self,
attributes: impl IntoIterator<Item = Attribute<Ns, Att, Val>>
) -> Self
pub fn merge_attributes( self, attributes: impl IntoIterator<Item = Attribute<Ns, Att, Val>> ) -> Self
merge to existing attributes if the attribute name already exist