Struct sc_client_api::light::ChangesProof

pub struct ChangesProof<Header: HeaderT> {
    pub max_block: Header::Number,
    pub proof: Vec<Vec<u8>>,
    pub roots: BTreeMap<Header::Number, Header::Hash>,
    pub roots_proof: StorageProof,
}

Key changes read proof.

Fields

max_block: Header::Number

Max block that has been used in changes query.

proof: Vec<Vec<u8>>

All touched nodes of all changes tries.

roots: BTreeMap<Header::Number, Header::Hash>

All changes tries roots that have been touched AND are missing from the requester’ node. It is a map of block number => changes trie root.

roots_proof: StorageProof

The proofs for all changes tries roots that have been touched AND are missing from the requester’ node. It is a map of CHT number => proof.

Trait Implementations

impl<Header: Debug + HeaderT> Debug for ChangesProof<Header> where
    Header::Number: Debug,
    Header::Number: Debug,
    Header::Hash: Debug, 

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

Formats the value using the given formatter.

impl<Header: PartialEq + HeaderT> PartialEq<ChangesProof<Header>> for ChangesProof<Header> where
    Header::Number: PartialEq,
    Header::Number: PartialEq,
    Header::Hash: PartialEq, 

fn eq(&self, other: &ChangesProof<Header>) -> bool

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

fn ne(&self, other: &ChangesProof<Header>) -> bool

This method tests for !=.

impl<Header: Eq + HeaderT> Eq for ChangesProof<Header> where
    Header::Number: Eq,
    Header::Number: Eq,
    Header::Hash: Eq, 

impl<Header: HeaderT> StructuralEq for ChangesProof<Header>

impl<Header: HeaderT> StructuralPartialEq for ChangesProof<Header>