Struct reference_trie::ExtensionLayout
source · [−]pub struct ExtensionLayout;
Expand description
Trie layout using extension nodes.
Trait Implementations
sourceimpl Clone for ExtensionLayout
impl Clone for ExtensionLayout
sourcefn clone(&self) -> ExtensionLayout
fn clone(&self) -> ExtensionLayout
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl Default for ExtensionLayout
impl Default for ExtensionLayout
sourcefn default() -> ExtensionLayout
fn default() -> ExtensionLayout
Returns the “default value” for a type. Read more
sourceimpl TrieConfiguration for ExtensionLayout
impl TrieConfiguration for ExtensionLayout
sourcefn trie_build<DB, I, A, B>(db: &mut DB, input: I) -> <Self::Hash as Hasher>::Out where
DB: HashDB<Self::Hash, Vec<u8, Global>>,
I: IntoIterator<Item = (A, B)>,
A: AsRef<[u8]> + Ord,
B: AsRef<[u8]>,
fn trie_build<DB, I, A, B>(db: &mut DB, input: I) -> <Self::Hash as Hasher>::Out where
DB: HashDB<Self::Hash, Vec<u8, Global>>,
I: IntoIterator<Item = (A, B)>,
A: AsRef<[u8]> + Ord,
B: AsRef<[u8]>,
Operation to build a trie db from its ordered iterator over its key/values.
sourcefn trie_root<I, A, B>(input: I) -> <Self::Hash as Hasher>::Out where
I: IntoIterator<Item = (A, B)>,
A: AsRef<[u8]> + Ord,
B: AsRef<[u8]>,
fn trie_root<I, A, B>(input: I) -> <Self::Hash as Hasher>::Out where
I: IntoIterator<Item = (A, B)>,
A: AsRef<[u8]> + Ord,
B: AsRef<[u8]>,
Determines a trie root given its ordered contents, closed form.
sourcefn trie_root_unhashed<I, A, B>(input: I) -> Vec<u8, Global> where
I: IntoIterator<Item = (A, B)>,
A: AsRef<[u8]> + Ord,
B: AsRef<[u8]>,
fn trie_root_unhashed<I, A, B>(input: I) -> Vec<u8, Global> where
I: IntoIterator<Item = (A, B)>,
A: AsRef<[u8]> + Ord,
B: AsRef<[u8]>,
Determines a trie root node’s data given its ordered contents, closed form.
sourcefn encode_index(input: u32) -> Vec<u8, Global>
fn encode_index(input: u32) -> Vec<u8, Global>
Encoding of index as a key (when reusing general trie for indexed trie). Read more
sourcefn ordered_trie_root<I, A>(input: I) -> <Self::Hash as Hasher>::Out where
I: IntoIterator<Item = A>,
A: AsRef<[u8]>,
fn ordered_trie_root<I, A>(input: I) -> <Self::Hash as Hasher>::Out where
I: IntoIterator<Item = A>,
A: AsRef<[u8]>,
A trie root formed from the items, with keys attached according to their
compact-encoded index (using parity-codec
crate). Read more
sourceimpl TrieLayout for ExtensionLayout
impl TrieLayout for ExtensionLayout
sourceconst USE_EXTENSION: bool = true
const USE_EXTENSION: bool = true
If true, the trie will use extension nodes and no partial in branch, if false the trie will only use branch and node with partials in both. Read more
sourceconst ALLOW_EMPTY: bool = false
const ALLOW_EMPTY: bool = false
If true, the trie will allow empty values into TrieDBMut
sourceconst MAX_INLINE_VALUE: Option<u32> = None
const MAX_INLINE_VALUE: Option<u32> = None
Threshold above which an external node should be use to store a node value. Read more
type Hash = KeccakHasher
type Hash = KeccakHasher
Hasher to use for this trie.
type Codec = ReferenceNodeCodec<KeccakHasher>
type Codec = ReferenceNodeCodec<KeccakHasher>
Codec to use (needs to match hasher and nibble ops).
Auto Trait Implementations
impl RefUnwindSafe for ExtensionLayout
impl Send for ExtensionLayout
impl Sync for ExtensionLayout
impl Unpin for ExtensionLayout
impl UnwindSafe for ExtensionLayout
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more