Struct cfx_storage::TrieProof

pub struct TrieProof { /* private fields */ }

Implementations

impl TrieProof

pub const MAX_NODES: usize = 1_000usize

pub fn new(nodes: Vec<TrieProofNode>) -> Result<Self>

Makes sure that the proof nodes are valid and connected at the time of creation.

pub fn get_merkle_root(&self) -> &MerkleHash

pub fn is_valid_kv( &self, key: &[u8], value: Option<&[u8]>, root: &MerkleHash ) -> bool

Verify that the trie root has value under key. Use None for exclusion proofs (i.e. there is no value under key).

pub fn if_proves_key(&self, key: &[u8]) -> (bool, Option<&TrieProofNode>)

Check if the key can be proved. The only reason of inability to prove a key is missing nodes.

pub fn get_value(&self, key: &[u8], root: &MerkleHash) -> (bool, Option<&[u8]>)

Get the value under key starting from root.

pub fn is_valid_node_merkle( &self, key: &[u8], node_merkle: &MptValue<MerkleHash>, root: &MerkleHash ) -> bool

Verify that the trie root has a node with node_merkle under key. If node_merkle is None, then it must prove that the trie does not contain key. If node_merkle is Tombstone, then it must prove that the trie contains a tombstone value under key. If node_merkle is Some(hash), then it must prove that the trie contains a node under key whose node merkle equals hash.

pub fn number_nodes(&self) -> usize

pub fn number_leaf_nodes(&self) -> u32

pub fn get_proof_nodes(&self) -> &Vec<TrieProofNode>

pub fn into_proof_nodes(self) -> Vec<TrieProofNode>

pub fn compute_snapshot_mpt_path_for_proof( &self, key: &[u8] ) -> Vec<(CompressedPathRaw, u8, &VanillaTrieNode<MerkleHash>)>

Returns the (snapshot_mpt_key, child_index, trie_node) along the proof path of key.

Trait Implementations

impl Clone for TrieProof

fn clone(&self) -> TrieProof

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TrieProof

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

Formats the value using the given formatter.

impl Decodable for TrieProof

fn decode(rlp: &Rlp<'_>) -> Result<Self, DecoderError>

Decode a value from RLP bytes

impl Default for TrieProof

fn default() -> TrieProof

Returns the “default value” for a type.

impl<'a> Deserialize<'a> for TrieProof

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'a>,

Deserialize this value from the given Serde deserializer.

impl Encodable for TrieProof

fn rlp_append(&self, s: &mut RlpStream)

Append a value to the stream

fn rlp_bytes(&self) -> Vec<u8>

Get rlp-encoded bytes for this instance

impl PartialEq for TrieProof

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Serialize for TrieProof

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TrieProof