Struct intrusive_containers::linked_list::NodeImpl

pub struct NodeImpl<T, L> {
    pub link: L,
    pub val: T,
}

Fields

link
val

Trait Implementations

impl<T: Hash, L> Hash for NodeImpl<T, L>

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher

impl<T: PartialEq, L> PartialEq for NodeImpl<T, L>

fn eq(&self, other: &NodeImpl<T, L>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<T: Eq, L> Eq for NodeImpl<T, L>

impl<T: PartialOrd, L> PartialOrd for NodeImpl<T, L>

fn partial_cmp(&self, other: &NodeImpl<T, L>) -> Option<Ordering>

fn lt(&self, other: &Rhs) -> bool

fn le(&self, other: &Rhs) -> bool

fn gt(&self, other: &Rhs) -> bool

fn ge(&self, other: &Rhs) -> bool

impl<T: Ord, L> Ord for NodeImpl<T, L>

fn cmp(&self, other: &NodeImpl<T, L>) -> Ordering

Derived Implementations

impl<T: Debug, L: Debug> Debug for NodeImpl<T, L> where L: Debug, T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result

impl<T: Default, L: Default> Default for NodeImpl<T, L> where L: Default, T: Default

fn default() -> NodeImpl<T, L>

impl<T: Clone, L: Clone> Clone for NodeImpl<T, L> where L: Clone, T: Clone

fn clone(&self) -> NodeImpl<T, L>

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