Struct AumHash 

pub struct AumHash(pub [u8; 32]);

A BLAKE2s-256 hash of an AUM’s canonical serialization. Identifies an AUM and links the chain (PrevAUMHash). Text form is RFC4648 standard base32, no padding (Go AUMHash.MarshalText).

Ord/PartialOrd order by the raw 32 bytes — used to key the sync store (a BTreeMap, since the crate is no_std) and already relied on by [pick_next_aum]’s lowest-hash fork tiebreak.

Tuple Fields

0: [u8; 32]

Implementations

impl AumHash

pub fn from_base32(text: &str) -> Option<AumHash>

Decode an AumHash from its base32 (no-pad, RFC4648 standard alphabet) text form, as found in TkaInfo.head. Returns None if the text is not exactly 32 decoded bytes.

pub fn to_base32(&self) -> String

Encode this hash as base32 (no-pad, standard alphabet) — the wire/text form.

Trait Implementations

impl Clone for AumHash

fn clone(&self) -> AumHash

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for AumHash

impl Debug for AumHash

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

Formats the value using the given formatter.

impl Eq for AumHash

impl Hash for AumHash

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

where __H: Hasher,

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 Ord for AumHash

fn cmp(&self, other: &AumHash) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for AumHash

fn eq(&self, other: &AumHash) -> 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 PartialOrd for AumHash

fn partial_cmp(&self, other: &AumHash) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for AumHash