Struct NodeEncoder 

pub struct NodeEncoder { /* private fields */ }

Walks a normalised tree and feeds it to a StableHasher in a form that does not change when the code around it does.

Every variant is written as its own name rather than its position in the enum, so reordering NodeKind – or inserting a variant in the middle – leaves existing fingerprints alone. Every match here is exhaustive, so a new variant is a compile error rather than a silently unhashed field.

Children are written with their count in front, which is what stops [a, [b]] and [[a], b] from hashing alike.

Implementations

impl NodeEncoder

pub const fn new() -> Self

pub fn encode(&mut self, node: &NormalizedNode)

Absorb a whole tree.

pub const fn finish(&self) -> u64

The fingerprint of everything absorbed so far.

Trait Implementations

impl Default for NodeEncoder

fn default() -> Self

Returns the “default value” for a type.