Enum libanu::pristine::Hash

pub enum Hash {
    None,
    Blake3([u8; 32]),
}

The external hash of changes.

Variants

None

None is the hash of the "null change", which introduced a single root vertex at the beginning of the repository.

Blake3([u8; 32])

Implementations

impl Hash

pub fn to_bytes(&self) -> [u8; 33]

pub fn from_bytes(s: &[u8]) -> Option<Self>

pub fn from_prefix(s: &str) -> Option<Self>

Trait Implementations

impl Base32 for Hash

fn to_base32(&self) -> String

Returns the base-32 representation of a hash.

fn from_base32(s: &[u8]) -> Option<Self>

Parses a base-32 string into a hash.

impl Clone for Hash

fn clone(&self) -> Hash

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Hash

impl Debug for Hash

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Hash

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Eq for Hash

impl FromStr for Hash

type Err = Error

The associated error which can be returned from parsing.

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

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

impl Hash for Hash

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, 

Feeds a slice of this type into the given Hasher.

impl Ord for Hash

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

This method returns an Ordering between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl PartialEq<Hash> for Hash

fn eq(&self, other: &Hash) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Hash) -> bool

This method tests for !=.

impl PartialOrd<Hash> for Hash

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

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl Representable for Hash

fn alignment() -> Alignment

Alignment of this type. Allowed values are 1, 2, 4 and 8.

fn onpage_size(&self) -> u16

How much space this value occupies on the page (not counting alignment padding).

unsafe fn write_value(&self, p: *mut u8)

Write this value to a u8 pointer, guaranteed to be a multiple of self.alignment().

unsafe fn read_value(p: *const u8) -> Self

Read value from an onpage pointer, guaranteed to be a multiple of self.alignment().

unsafe fn cmp_value<T>(&self, _: &T, x: Self) -> Ordering

Compare a value with an onpage value. The current transaction is sometimes helpful, for instance when the page only stores a pointer to another page.

type PageOffsets = Empty<u64>

An iterator over the offsets to pages contained in this value. Only values from this crate can generate non-empty iterators, but combined values (like tuples) must chain the iterators returned by method page_offsets.

fn page_offsets(&self) -> Self::PageOffsets

If this value is an offset to another page at offset offset, return Some(offset). Return None else.

unsafe fn skip(p: *mut u8) -> *mut u8

First pointer strictly after this value's pointer. The default implementation is basically p.offset(self.onpage_size() as isize), but their might be more efficient implementations in some cases.

fn drop_value<E, T, R>(&self, &mut MutTxn<E, T>, &mut R) -> Result<(), Error> where
    E: Borrow<Env>,
    R: Rng, 

How to free the pages used by this value. The default implementation doesn't do anything, which is fine for types stored directly on B tree pages.

impl Serialize for Hash

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

Serialize this value into the given Serde serializer.

impl StructuralEq for Hash

impl StructuralPartialEq for Hash