Struct NodeDataContainerRef

pub struct NodeDataContainerRef<'a, T> {
    pub internal: &'a [T],
}

Fields

internal: &'a [T]

Implementations

impl<'a, T: Send + 'a> NodeDataContainerRef<'a, T>

pub fn transform_nodeid<U: Send, F>(&self, closure: F) -> NodeDataContainer<U>

where F: Fn(NodeId) -> U + Send + Sync,

pub fn transform_nodeid_multithreaded_optional<U: Send, F>( &self, closure: F, ) -> NodeDataContainer<U>

where F: Fn(NodeId) -> Option<U> + Send + Sync,

impl<'a, T: 'a> NodeDataContainerRef<'a, T>

pub fn get_extended_lifetime(&self, id: NodeId) -> Option<&'a T>

pub fn from_slice(data: &'a [T]) -> NodeDataContainerRef<'a, T>

pub fn len(&self) -> usize

pub fn transform_singlethread<U, F>(&self, closure: F) -> NodeDataContainer<U>

where F: FnMut(&T, NodeId) -> U,

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

pub fn iter(&self) -> Iter<'_, T>

pub fn linear_iter(&self) -> LinearIterator

impl<'a> NodeDataContainerRef<'a, NodeHierarchyItem>

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

Trait Implementations

impl<'a, T: Debug> Debug for NodeDataContainerRef<'a, T>

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

Formats the value using the given formatter.

impl<'a, T: Hash> Hash for NodeDataContainerRef<'a, T>

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, T> Index<NodeId> for NodeDataContainerRef<'a, T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a, T: Ord> Ord for NodeDataContainerRef<'a, T>

fn cmp(&self, other: &NodeDataContainerRef<'a, T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'a, T: PartialEq> PartialEq for NodeDataContainerRef<'a, T>

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

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

impl<'a, T> StructuralPartialEq for NodeDataContainerRef<'a, T>