Struct NoteId 

pub struct NoteId(/* private fields */);

A lexicographically sortable note identifier (fixed-width base32, 26 chars).

The 128-bit value uses Lamport depth in the high 64 bits and a content hash in the low 64 bits. The ID is assigned once and never recomputed. Fixed-width encoding makes string order identical to numeric Lamport order.

Implementations

impl NoteId

pub const ENCODED_LEN: usize = 26

pub fn allocate(previous_tip: Option<&Self>, content: &str) -> Self

Allocate the next ID after previous_tip for content.

pub fn tip<'a>(ids: impl IntoIterator<Item = &'a Self>) -> Option<Self>

Return the Lamport tip from an iterator of existing note IDs.

pub fn as_str(&self) -> &str

pub fn depth(&self) -> u64

pub fn hash(&self) -> u64

Trait Implementations

impl AsRef<str> for NoteId

fn as_ref(&self) -> &str

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for NoteId

fn clone(&self) -> NoteId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NoteId

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for NoteId

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for NoteId

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

Formats the value using the given formatter.

impl Eq for NoteId

impl FromStr for NoteId

type Err = NoteIdError

The associated error which can be returned from parsing.

fn from_str(value: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl Hash for NoteId

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 NoteId

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

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

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for NoteId