Struct scrypto_test::prelude::SpreadPrefixKeyMapper

pub struct SpreadPrefixKeyMapper;

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

impl DatabaseKeyMapper for SpreadPrefixKeyMapper

fn to_db_node_key(node_id: &NodeId) -> Vec<u8>

Converts the given Node ID to the database Node key.

fn from_db_node_key(db_node_key: &Vec<u8>) -> NodeId

Converts the database Node key back to ReNode ID.

fn to_db_partition_num(partition_num: PartitionNumber) -> u8

Converts the given Partition number to the database Partition number.

fn from_db_partition_num(db_partition_num: u8) -> PartitionNumber

Converts the database Partition number back to a Partition number.

fn field_to_db_sort_key(fields_key: &u8) -> DbSortKey

fn field_from_db_sort_key(db_sort_key: &DbSortKey) -> u8

fn map_to_db_sort_key(map_key: &Vec<u8>) -> DbSortKey

fn map_from_db_sort_key(db_sort_key: &DbSortKey) -> Vec<u8>

fn sorted_to_db_sort_key(sorted_key: &([u8; 2], Vec<u8>)) -> DbSortKey

fn sorted_from_db_sort_key(db_sort_key: &DbSortKey) -> ([u8; 2], Vec<u8>)

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.

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

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

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).

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

where K: SubstateKeyContent + 'static,

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.