Struct NodeHierarchy

pub struct NodeHierarchy {
    pub internal: Vec<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: Vec<Node>

Implementations

impl NodeHierarchy

pub const fn new(data: Vec<Node>) -> Self

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

pub fn subtree_len(&self, parent_id: NodeId) -> usize

Returns the number of all subtree items - runtime O(1)

pub fn get_index_in_parent(&self, node_id: NodeId) -> usize

Returns the index in the parent node of a certain NodeId (starts at 0, i.e. the first node has the index of 0).

Trait Implementations

impl Clone for NodeHierarchy

fn clone(&self) -> NodeHierarchy

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeHierarchy

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

Formats the value using the given formatter.

impl Default for NodeHierarchy

fn default() -> NodeHierarchy

Returns the “default value” for a type.

impl Hash for NodeHierarchy

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 Index<NodeId> for NodeHierarchy

type Output = Node

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl IndexMut<NodeId> for NodeHierarchy

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

Performs the mutable indexing (container[index]) operation.

impl PartialEq for NodeHierarchy

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

impl StructuralPartialEq for NodeHierarchy