Struct tree_index::Proof

pub struct Proof<'a> { /* fields omitted */ }

A merkle proof for an index.

Merkle trees are proven by checking the parent hashes.

Implementations

impl<'a> Proof<'a>

pub fn new(index: u64, verified_by: u64, nodes: &'a [u64]) -> Self

Create a new instance.

Examples

let nodes = vec![];
let _proof = Proof::new(0, 0, &nodes);

pub fn index(&self) -> u64

Get the index which was used to verify this node.

Examples

let nodes = vec![];
let proof = Proof::new(0, 0, &nodes);
assert_eq!(proof.index(), 0);

pub fn verified_by(&self) -> u64

Get the index for the node which verifies the input index.

Examples

let nodes = vec![];
let proof = Proof::new(0, 0, &nodes);
assert_eq!(proof.verified_by(), 0);

pub fn nodes(&self) -> &[u64]

Merkle proof for the index you pass, written in flat-tree notation.

Examples

let nodes = vec![];
let proof = Proof::new(0, 0, &nodes);
assert_eq!(proof.nodes().len(), 0);

Trait Implementations

impl<'a> Debug for Proof<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq<Proof<'a>> for Proof<'a>

fn eq(&self, other: &Proof<'a>) -> bool

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

fn ne(&self, other: &Proof<'a>) -> bool

This method tests for !=.

impl<'a> StructuralPartialEq for Proof<'a>