Struct ProllyKey 

pub struct ProllyKey(pub [u8; 16]);

A 16-byte Prolly tree key - the unit the chunker and tree operate on.

This is a newtype over [u8; 16] with custom Serde impls that emit the value as a CBOR byte string (major type 2) per SPEC §4.3. The default serde derive would emit a CBOR array of sixteen u8 integers, which is incorrect for the mnem canonical form.

All four stable IDs (NodeId, EdgeId, ChangeId, OperationId) convert into ProllyKey via From. Construct raw keys with ProllyKey::new or the tuple literal ProllyKey([u8; 16]).

Tuple Fields

0: [u8; 16]

Implementations

impl ProllyKey

pub const fn new(bytes: [u8; 16]) -> Self

Wrap raw bytes.

pub const fn as_bytes(&self) -> &[u8; 16]

Borrow the underlying bytes.

pub const fn into_bytes(self) -> [u8; 16]

Extract the underlying bytes.

Trait Implementations

impl Clone for ProllyKey

fn clone(&self) -> ProllyKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProllyKey

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

Formats the value using the given formatter.

impl Default for ProllyKey

fn default() -> ProllyKey

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ProllyKey

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl From<StableId<ChangeTag>> for ProllyKey

fn from(v: ChangeId) -> Self

Converts to this type from the input type.

impl From<StableId<EdgeTag>> for ProllyKey

fn from(v: EdgeId) -> Self

Converts to this type from the input type.

impl From<StableId<NodeTag>> for ProllyKey

fn from(v: NodeId) -> Self

Converts to this type from the input type.

impl Hash for ProllyKey

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

fn cmp(&self, other: &ProllyKey) -> 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 ProllyKey

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

fn partial_cmp(&self, other: &ProllyKey) -> 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 Serialize for ProllyKey

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl Copy for ProllyKey

impl Eq for ProllyKey

impl StructuralPartialEq for ProllyKey