Struct NodeHierarchyRef 

pub struct NodeHierarchyRef<'a> {
    pub internal: &'a [Node],
}

The hierarchy of nodes is stored separately from the actual node content in order to save on memory, since the hierarchy can be re-used across several DOM trees even if the content changes.

Fields

internal: &'a [Node]

Implementations

impl<'a> NodeHierarchyRef<'a>

pub fn from_slice(data: &'a [Node]) -> NodeHierarchyRef<'a>

pub fn len(&self) -> usize

pub fn get(&self, id: NodeId) -> Option<&Node>

pub fn linear_iter(&self) -> LinearIterator

pub fn get_parents_sorted_by_depth(&self) -> NodeDepths

Returns the (depth, NodeId) of all parent nodes (i.e. nodes that have a first_child), in depth sorted order, (i.e. NodeId(0) with a depth of 0) is the first element.

Runtime: O(n) max

Trait Implementations

impl<'a> Debug for NodeHierarchyRef<'a>

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

Formats the value using the given formatter.

impl<'a> Hash for NodeHierarchyRef<'a>

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<'a> Index<NodeId> for NodeHierarchyRef<'a>

type Output = Node

The returned type after indexing.

fn index(&self, node_id: NodeId) -> &Node

Performs the indexing (container[index]) operation.

impl<'a> PartialEq for NodeHierarchyRef<'a>

fn eq(&self, other: &NodeHierarchyRef<'a>) -> 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<'a> Eq for NodeHierarchyRef<'a>

impl<'a> StructuralPartialEq for NodeHierarchyRef<'a>