Struct IdentitySchema 

pub struct IdentitySchema {}

A KeySchema that does not reorder the keys. This is useful for keys that are already ordered in the desired way. This is the default ordering.

Trait Implementations

impl Clone for IdentitySchema

fn clone(&self) -> IdentitySchema

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IdentitySchema

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

Formats the value using the given formatter.

impl<const KEY_LEN: usize> KeySchema<KEY_LEN> for IdentitySchema

const SEGMENT_PERM: &'static [usize]

Order of segments from key layout to tree layout.

const KEY_TO_TREE: [usize; KEY_LEN]

Maps each key index to its position in the tree view.

const TREE_TO_KEY: [usize; KEY_LEN]

Maps each tree index to its position in the key view.

type Segmentation = SingleSegmentation

The segmentation this ordering operates over.

fn tree_ordered(key: &[u8; KEY_LEN]) -> [u8; KEY_LEN]

Reorders the key from the shared key ordering to the tree ordering.

fn key_ordered(tree_key: &[u8; KEY_LEN]) -> [u8; KEY_LEN]

Reorders the key from the tree ordering to the shared key ordering.

fn segment_of_tree_depth(at_depth: usize) -> usize

Return the segment index for the byte at at_depth in tree ordering.

fn same_segment_tree(a: usize, b: usize) -> bool

Return true if the tree-ordered bytes at a and b belong to the same logical segment.

impl Copy for IdentitySchema