Struct NodeHierarchyRefMut

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

Fields

internal: &'a mut [Node]

Implementations

impl<'a> NodeHierarchyRefMut<'a>

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

Trait Implementations

impl<'a> Debug for NodeHierarchyRefMut<'a>

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

Formats the value using the given formatter.

impl<'a> Hash for NodeHierarchyRefMut<'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 NodeHierarchyRefMut<'a>

type Output = Node

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a> IndexMut<NodeId> for NodeHierarchyRefMut<'a>

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

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

impl<'a> PartialEq for NodeHierarchyRefMut<'a>

fn eq(&self, other: &NodeHierarchyRefMut<'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 NodeHierarchyRefMut<'a>

impl<'a> StructuralPartialEq for NodeHierarchyRefMut<'a>