Struct NodeDataContainer

pub struct NodeDataContainer<T> {
    pub internal: Vec<T>,
}

Fields

internal: Vec<T>

Implementations

impl<T> NodeDataContainer<T>

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

pub fn is_empty(&self) -> bool

pub fn as_ref<'a>(&'a self) -> NodeDataContainerRef<'a, T>

pub fn as_ref_mut<'a>(&'a mut self) -> NodeDataContainerRefMut<'a, T>

pub fn len(&self) -> usize

Trait Implementations

impl<T: Clone> Clone for NodeDataContainer<T>

fn clone(&self) -> NodeDataContainer<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for NodeDataContainer<T>

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

Formats the value using the given formatter.

impl<T> Default for NodeDataContainer<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> From<Vec<T>> for NodeDataContainer<T>

fn from(v: Vec<T>) -> NodeDataContainer<T>

Converts to this type from the input type.

impl<T: Hash> Hash for NodeDataContainer<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<T: Ord> Ord for NodeDataContainer<T>

fn cmp(&self, other: &NodeDataContainer<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<T: PartialEq> PartialEq for NodeDataContainer<T>

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

fn partial_cmp(&self, other: &NodeDataContainer<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<T: Eq> Eq for NodeDataContainer<T>

impl<T> StructuralPartialEq for NodeDataContainer<T>