Struct Identifier 

struct Identifier<'n, N: NormalizeEq> {
    hash: u64,
    node: &'n N,
}

Identifier that represents a TreeNode tree.

This identifier is designed to be efficient and “hash”, “accumulate”, “equal” and “have no collision (as low as possible)”

Fields

hash: u64

node: &'n N

Implementations

impl<'n, N> Identifier<'n, N>

where N: HashNode + NormalizeEq,

fn new(node: &'n N, random_state: &RandomState) -> Self

fn combine(self, other: Option<Self>) -> Self

Trait Implementations

impl<N: NormalizeEq> Clone for Identifier<'_, N>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'n, N: Debug + NormalizeEq> Debug for Identifier<'n, N>

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

Formats the value using the given formatter.

impl<N: NormalizeEq> Hash for Identifier<'_, N>

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<N: NormalizeEq> PartialEq for Identifier<'_, N>

fn eq(&self, other: &Self) -> 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<N: NormalizeEq> Copy for Identifier<'_, N>

impl<'n, N: Eq + NormalizeEq> Eq for Identifier<'n, N>