pub enum HashTree<'a> {
Empty,
Fork(Box<(HashTree<'a>, HashTree<'a>)>),
Labeled(&'a [u8], Box<HashTree<'a>>),
Leaf(Cow<'a, [u8]>),
Pruned(Hash),
}
Expand description
HashTree as defined in the interfaces spec.
Variants§
Empty
No child nodes; a proof of absence.
Fork(Box<(HashTree<'a>, HashTree<'a>)>)
Left and right child branches.
Labeled(&'a [u8], Box<HashTree<'a>>)
A labeled child node.
Leaf(Cow<'a, [u8]>)
A leaf node containing a value or hash.
Pruned(Hash)
A branch that has been removed from this view of the tree, but is not necessarily absent.
Implementations§
Trait Implementations§
Source§impl Serialize for HashTree<'_>
impl Serialize for HashTree<'_>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
Serialize this value into the given Serde serializer. Read more
Auto Trait Implementations§
impl<'a> Freeze for HashTree<'a>
impl<'a> RefUnwindSafe for HashTree<'a>
impl<'a> Send for HashTree<'a>
impl<'a> Sync for HashTree<'a>
impl<'a> Unpin for HashTree<'a>
impl<'a> UnwindSafe for HashTree<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more