Struct reference_trie::ExtensionLayout
source · pub struct ExtensionLayout;
Expand description
Trie layout using extension nodes.
Trait Implementations§
source§impl Clone for ExtensionLayout
impl Clone for ExtensionLayout
source§fn clone(&self) -> ExtensionLayout
fn clone(&self) -> ExtensionLayout
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Default for ExtensionLayout
impl Default for ExtensionLayout
source§fn default() -> ExtensionLayout
fn default() -> ExtensionLayout
Returns the “default value” for a type. Read more
source§impl TrieConfiguration for ExtensionLayout
impl TrieConfiguration for ExtensionLayout
source§fn trie_build<DB, I, A, B>(db: &mut DB, input: I) -> <Self::Hash as Hasher>::Outwhere
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>::Outwhere 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.
source§fn trie_root<I, A, B>(input: I) -> <Self::Hash as Hasher>::Outwhere
I: IntoIterator<Item = (A, B)>,
A: AsRef<[u8]> + Ord,
B: AsRef<[u8]>,
fn trie_root<I, A, B>(input: I) -> <Self::Hash as Hasher>::Outwhere I: IntoIterator<Item = (A, B)>, A: AsRef<[u8]> + Ord, B: AsRef<[u8]>,
Determines a trie root given its ordered contents, closed form.
source§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]>,
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.
source§fn 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).
source§fn ordered_trie_root<I, A>(input: I) -> <Self::Hash as Hasher>::Outwhere
I: IntoIterator<Item = A>,
A: AsRef<[u8]>,
fn ordered_trie_root<I, A>(input: I) -> <Self::Hash as Hasher>::Outwhere 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).source§impl TrieLayout for ExtensionLayout
impl TrieLayout for ExtensionLayout
source§const 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.
source§const ALLOW_EMPTY: bool = false
const ALLOW_EMPTY: bool = false
If true, the trie will allow empty values into
TrieDBMut
source§const 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.
§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).