Struct NodeTuple 

pub struct NodeTuple(/* private fields */);

Implementations

impl NodeTuple

pub fn len(&self) -> usize

Returns the number of elements in the collection.

pub fn is_empty(&self) -> bool

Returns true if the collection contains no elements.

pub fn iter(&self) -> impl Iterator<Item = &NodeId>

Iterates over the collection.

pub fn new() -> Self

Creates a new, empty collection.

impl NodeTuple

pub fn get(&self, index: usize) -> Option<NodeId>

pub fn push(&mut self, node_id: NodeId) -> Result<(), InsertErrorKind>

pub fn add_at( &mut self, index: u8, node_id: NodeId, ) -> Result<(), InsertErrorKind>

pub fn to_vec(&self) -> Vec<NodeId>

pub fn from_vec(vec: Vec<NodeId>) -> Self

Trait Implementations

impl Clone for NodeTuple

fn clone(&self) -> NodeTuple

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeTuple

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

Formats the value using the given formatter.

impl Default for NodeTuple

fn default() -> NodeTuple

Returns the “default value” for a type.

impl Hash for NodeTuple

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 IntoIterator for NodeTuple

type Item = NodeId

The type of the elements being iterated over.

type IntoIter = <Vec<NodeId> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for NodeTuple

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

impl StructuralPartialEq for NodeTuple