Struct CompactDom 

pub struct CompactDom {
    pub node_hierarchy: NodeHierarchy,
    pub node_data: NodeDataContainer<NodeData>,
    pub root: NodeId,
}

Same as Dom, but arena-based for more efficient memory layout and faster traversal.

Fields

node_hierarchy: NodeHierarchy

The arena containing the hierarchical relationships (parent, child, sibling) of all nodes.

node_data: NodeDataContainer<NodeData>

The arena containing the actual data (NodeData) for each node.

root: NodeId

The ID of the root node of the DOM tree.

Implementations

impl CompactDom

pub fn len(&self) -> usize

Returns the number of nodes in this DOM.

Trait Implementations

impl Debug for CompactDom

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

Formats the value using the given formatter.

impl From<Dom> for CompactDom

fn from(dom: Dom) -> Self

Converts to this type from the input type.

impl PartialEq for CompactDom

fn eq(&self, other: &CompactDom) -> 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 PartialOrd for CompactDom

fn partial_cmp(&self, other: &CompactDom) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for CompactDom

impl StructuralPartialEq for CompactDom