Enum PartialTreeLeaf 

pub enum PartialTreeLeaf {
    Visible {
        entry: TreeEntry,
        salt: [u8; 32],
    },
    Redacted {
        leaf_hash: ContentHash,
    },
}

One leaf of a PartialTree: either fully visible (carrying its entry and salt, so its leaf hash is recomputable) or redacted to an opaque 32-byte leaf hash (salt, name, and target all withheld).

Variants

Visible

Fields

entry: TreeEntry

salt: [u8; 32]

Redacted

Fields

leaf_hash: ContentHash

Implementations

impl PartialTreeLeaf

pub fn leaf_hash(&self) -> ContentHash

The leaf hash this leaf contributes to the Merkle root.

pub fn is_redacted(&self) -> bool

Trait Implementations

impl Clone for PartialTreeLeaf

fn clone(&self) -> PartialTreeLeaf

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PartialTreeLeaf

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

Formats the value using the given formatter.

impl Eq for PartialTreeLeaf

impl PartialEq for PartialTreeLeaf

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PartialTreeLeaf