Struct incrementalmerkletree::Level
source · pub struct Level(/* private fields */);
Expand description
A type-safe wrapper for indexing into “levels” of a binary tree, such that
nodes at level 0
are leaves, nodes at level 1
are parents of nodes at
level 0
, and so forth. This type is capable of representing levels in
trees containing up to 2^255 leaves.
Implementations§
Trait Implementations§
source§impl Ord for Level
impl Ord for Level
source§impl PartialEq for Level
impl PartialEq for Level
source§impl PartialOrd for Level
impl PartialOrd for Level
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Copy for Level
impl Eq for Level
impl StructuralPartialEq for Level
Auto Trait Implementations§
impl Freeze for Level
impl RefUnwindSafe for Level
impl Send for Level
impl Sync for Level
impl Unpin for Level
impl UnwindSafe for Level
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