Struct dynamic_list::Node

pub struct Node<V, N = Empty> { /* private fields */ }

Implementations

impl<V, N> Node<V, N>

pub const fn value(&self) -> &V

pub fn value_mut(&mut self) -> &mut V

pub const fn next(&self) -> &N

pub fn next_mut(&mut self) -> &mut N

Trait Implementations

impl<V, U: Unsigned, B: Bit> Index<UInt<U, B>> for Node<V>where UInt<U, B>: NonZero,

type Output<'a> = Empty where Self: 'a

fn index(&self) -> Self::Output<'_>

impl<V, U, B, N> Index<UInt<U, B>> for Node<V, N>where U: Unsigned, B: Bit, N: NotEmpty + Index<Sub1<UInt<U, B>>>, UInt<U, B>: NonZero + Sub<B1>,

type Output<'a> = <N as Index<<UInt<U, B> as Sub<B1>>::Output>>::Output<'a> where Self: 'a

fn index(&self) -> Self::Output<'_>

impl<V, N> Index<UTerm> for Node<V, N>

type Output<'a> = &'a V where Self: 'a

fn index(&self) -> Self::Output<'_>

impl<V, N: Size> Size for Node<V, N>

const SIZE: usize = _

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<V> NotEmpty for Node<V>

impl<V, N: NotEmpty> NotEmpty for Node<V, N>