#[repr(C)]pub struct Path<const MAX_DEPTH: usize> {
pub proof: [Node; MAX_DEPTH],
pub leaf: Node,
pub index: u32,
pub _padding: u32,
}
Expand description
Represents a proof to perform a Merkle tree operation on the leaf at index
Fields§
§proof: [Node; MAX_DEPTH]
§leaf: Node
§index: u32
§_padding: u32
Trait Implementations§
impl<const MAX_DEPTH: usize> Copy for Path<MAX_DEPTH>
impl<const MAX_DEPTH: usize> Eq for Path<MAX_DEPTH>
impl<const MAX_DEPTH: usize> StructuralPartialEq for Path<MAX_DEPTH>
Auto Trait Implementations§
impl<const MAX_DEPTH: usize> Freeze for Path<MAX_DEPTH>
impl<const MAX_DEPTH: usize> RefUnwindSafe for Path<MAX_DEPTH>
impl<const MAX_DEPTH: usize> Send for Path<MAX_DEPTH>
impl<const MAX_DEPTH: usize> Sync for Path<MAX_DEPTH>
impl<const MAX_DEPTH: usize> Unpin for Path<MAX_DEPTH>
impl<const MAX_DEPTH: usize> UnwindSafe for Path<MAX_DEPTH>
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more