SpreadPrefixKeyMapper

Struct SpreadPrefixKeyMapper 

Source
pub struct SpreadPrefixKeyMapper;
Expand description

A DatabaseKeyMapper tailored for databases which cannot tolerate long common prefixes among keys (for performance reasons). In other words, it spreads the keys “evenly” (i.e. pseudo-randomly) across the key space. For context: our use-case for this is the Jellyfish Merkle Tree.

This implementation is the actual, protocol-enforced one, to be used in public Radix networks.

This implementation achieves the prefix-spreading by adding a hash prefix (shortened hash for performance reasons, but still hard to crack) to:

  • the ReNode part of DB Partition key
  • the Map key and Sorted key flavors of SubstateKey

Trait Implementations§

Source§

impl DatabaseKeyMapper for SpreadPrefixKeyMapper

Source§

fn to_db_node_key(node_id: &NodeId) -> DbNodeKey

Converts the given Node ID to the database Node key.
Source§

fn from_db_node_key(db_node_key: &DbNodeKey) -> NodeId

Converts the database Node key back to ReNode ID.
Source§

fn to_db_partition_num(partition_num: PartitionNumber) -> DbPartitionNum

Converts the given Partition number to the database Partition number.
Source§

fn from_db_partition_num(db_partition_num: DbPartitionNum) -> PartitionNumber

Converts the database Partition number back to a Partition number.
Source§

fn field_to_db_sort_key(fields_key: &FieldKey) -> DbSortKey

Source§

fn field_from_db_sort_key(db_sort_key: &DbSortKey) -> FieldKey

Source§

fn map_to_db_sort_key(map_key: &MapKey) -> DbSortKey

Source§

fn map_from_db_sort_key(db_sort_key: &DbSortKey) -> MapKey

Source§

fn sorted_to_db_sort_key(sorted_key: &SortedKey) -> DbSortKey

Source§

fn sorted_from_db_sort_key(db_sort_key: &DbSortKey) -> SortedKey

Source§

fn to_db_partition_key( node_id: &NodeId, partition_num: PartitionNumber, ) -> DbPartitionKey

Converts the given Node ID and Partition number to the database partition’s key.
Source§

fn from_db_partition_key( partition_key: &DbPartitionKey, ) -> (NodeId, PartitionNumber)

Converts database partition’s key back to ReNode ID and Partition number.
Source§

fn to_db_sort_key(key: &SubstateKey) -> DbSortKey

Converts the given SubstateKey to the database’s sort key. This is a convenience method, which simply unwraps the SubstateKey and maps any specific type found inside (see *_to_db_sort_key() family).
Source§

fn to_db_sort_key_from_ref(key: SubstateKeyRef<'_>) -> DbSortKey

Converts the given SubstateKeyRef to the database’s sort key. This is a convenience method, which simply unwraps the SubstateKeyRef and maps any specific type found inside (see *_to_db_sort_key() family).
Source§

fn from_db_sort_key<K: SubstateKeyContent>( db_sort_key: &DbSortKey, ) -> SubstateKey

Converts the given database’s sort key to a SubstateKey. This is a convenience method, which simply wraps the type-specific result of an appropriate *_from_db_sort_key() method into a SubstateKey. Read more
Source§

fn from_db_sort_key_to_inner<K: SubstateKeyContent>( db_sort_key: &DbSortKey, ) -> K

Examples Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<U> As for U

Source§

fn as_<T>(self) -> T
where T: CastFrom<U>,

Casts self to type T. The semantics of numeric casting with the as operator are followed, so <T as As>::as_::<U> can be used in the same way as T as U for numeric conversions. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T, U> ContextualTryInto<U> for T
where U: ContextualTryFrom<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<X, Y> LabelledResolve<Y> for X
where Y: LabelledResolveFrom<X>,

Source§

fn labelled_resolve( self, resolver: &impl LabelResolver<<Y as LabelledResolvable>::ResolverOutput>, ) -> Y

Source§

impl<X, Y> Resolve<Y> for X
where Y: ResolveFrom<X>,

Source§

fn resolve(self) -> Y

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.