Struct NodeKey

pub struct NodeKey<V> {
    pub level: Level,
    pub coordinates: V,
}

Uniquely identifies a node slot in the Tree.

Fields

level: Level

coordinates: V

Implementations

impl<V> NodeKey<V>

pub fn new(level: Level, coordinates: V) -> Self

Trait Implementations

impl<V: Clone> Clone for NodeKey<V>

fn clone(&self) -> NodeKey<V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for NodeKey<V>

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

Formats the value using the given formatter.

impl<V: Hash> Hash for NodeKey<V>

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<V: PartialEq> PartialEq for NodeKey<V>

fn eq(&self, other: &NodeKey<V>) -> 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<V: Copy> Copy for NodeKey<V>

impl<V: Eq> Eq for NodeKey<V>

impl<V> StructuralPartialEq for NodeKey<V>