Struct HashedPartialTrie 

pub struct HashedPartialTrie { /* private fields */ }

A partial trie that lazily caches hashes for each node as needed. If you are doing frequent hashing of node, you probably want to use this Trie variant.

Trait Implementations

impl Clone for HashedPartialTrie

fn clone(&self) -> HashedPartialTrie

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HashedPartialTrie

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

Formats the value using the given formatter.

impl Default for HashedPartialTrie

fn default() -> HashedPartialTrie

Returns the “default value” for a type.

impl Deref for HashedPartialTrie

type Target = Node<HashedPartialTrie>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl DerefMut for HashedPartialTrie

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de> Deserialize<'de> for HashedPartialTrie

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<Node<HashedPartialTrie>> for HashedPartialTrie

fn from(v: Node<HashedPartialTrie>) -> Self

Converts to this type from the input type.

impl PartialEq for HashedPartialTrie

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialTrie for HashedPartialTrie

fn new(node: Node<Self>) -> Self

Creates a new partial trie from a node.

fn new_with_strategy(node: Node<Self>, strategy: OnOrphanedHashNode) -> Self

Creates a new partial trie from a node with a provided collapse strategy.

fn insert<K, V>(&mut self, k: K, v: V) -> TrieOpResult<()>

where K: Into<Nibbles>, V: Into<ValOrHash>,

Inserts a node into the trie.

fn extend<K, V, I>(&mut self, nodes: I) -> TrieOpResult<()>

where K: Into<Nibbles>, V: Into<ValOrHash>, I: IntoIterator<Item = (K, V)>,

Add more nodes to the trie through an iterator

fn get<K>(&self, k: K) -> Option<&[u8]>

where K: Into<Nibbles>,

Get a node if it exists in the trie.

fn delete<K>(&mut self, k: K) -> TrieOpResult<Option<Vec<u8>>>

where K: Into<Nibbles>,

Deletes a Leaf node or Branch value field if it exists.

fn hash(&self) -> H256

Get the hash for the node.

fn items(&self) -> impl Iterator<Item = (Nibbles, ValOrHash)>

Returns an iterator over the trie that returns all key/value pairs for every Leaf and Hash node.

fn keys(&self) -> impl Iterator<Item = Nibbles>

Returns an iterator over the trie that returns all keys for every Leaf and Hash node.

fn values(&self) -> impl Iterator<Item = ValOrHash>

Returns an iterator over the trie that returns all values for every Leaf and Hash node.

fn contains<K>(&self, k: K) -> bool

where K: Into<Nibbles>,

Returns true if the trie contains an element with the given key.

impl Serialize for HashedPartialTrie

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl TrieNodeIntern for HashedPartialTrie

fn hash_intern(&self) -> EncodedNode

Returns the hash of the rlp encoding of self.

impl<K, V> TryFromIterator<(K, V)> for HashedPartialTrie

where K: Into<Nibbles>, V: Into<ValOrHash>,

fn try_from_iter<T: IntoIterator<Item = (K, V)>>(nodes: T) -> TrieOpResult<Self>

Creates a value from an iterator within an allocator.

impl Eq for HashedPartialTrie