Struct NodesUtils

pub struct NodesUtils { /* private fields */ }

Expand description

MMR nodes & size -related utilities.

Implementations§

§

impl NodesUtils

pub fn new(no_of_leaves: u64) -> NodesUtils

Create new instance of MMR nodes utilities for given number of leaves.

pub fn number_of_peaks(&self) -> u64

Calculate number of peaks in the MMR.

pub fn number_of_leaves(&self) -> u64

Return the number of leaves in the MMR.

pub fn size(&self) -> u64

Calculate the total size of MMR (number of nodes).

pub fn leaf_index_that_added_node(node_index: u64) -> u64

Calculate LeafIndex for the leaf that added node_index to the MMR.

pub fn leaf_index_to_leaf_node_index(leaf_index: u64) -> u64

Translate a LeafIndex to its leaf NodeIndex.

pub fn right_branch_ending_in_leaf(leaf_index: u64) -> Vec<u64>

Starting from any leaf index, get the sequence of positions of the nodes added to the mmr when this leaf was added (inclusive of the leaf’s position itself). That is, all of these nodes are right children of their respective parents.

pub fn node_temp_offchain_key<H>( prefix: &[u8], pos: u64, parent_hash: <H as Header>::Hash, ) -> Vec<u8> ⓘ
where H: Header,

Build offchain key from parent_hash of block that originally added node pos to MMR.

This combination makes the offchain (key,value) entry resilient to chain forks.

pub fn node_canon_offchain_key(prefix: &[u8], pos: u64) -> Vec<u8> ⓘ

Build canonical offchain key for node pos in MMR.

Used for nodes added by now finalized blocks. Never read keys using node_canon_offchain_key unless you sure that there’s no node_offchain_key key in the storage.

Auto Trait Implementations§

§

Struct NodesUtilsCopy item path

Implementations§

impl NodesUtils

pub fn new(no_of_leaves: u64) -> NodesUtils

pub fn number_of_peaks(&self) -> u64

pub fn number_of_leaves(&self) -> u64

pub fn size(&self) -> u64

pub fn leaf_index_that_added_node(node_index: u64) -> u64

pub fn leaf_index_to_leaf_node_index(leaf_index: u64) -> u64

pub fn right_branch_ending_in_leaf(leaf_index: u64) -> Vec<u64>

pub fn node_temp_offchain_key<H>( prefix: &[u8], pos: u64, parent_hash: <H as Header>::Hash, ) -> Vec<u8> ⓘwhere H: Header,

pub fn node_canon_offchain_key(prefix: &[u8], pos: u64) -> Vec<u8> ⓘ

Auto Trait Implementations§

impl Freeze for NodesUtils

impl RefUnwindSafe for NodesUtils

impl Send for NodesUtils

impl Sync for NodesUtils

impl Unpin for NodesUtils

impl UnwindSafe for NodesUtils

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CheckedConversion for T

fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,

fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<T, U> IntoKey<U> for Twhere U: FromKey<T>,

fn into_key(self) -> U

impl<Src, Dest> IntoTuple<Dest> for Srcwhere Dest: FromTuple<Src>,

fn into_tuple(self) -> Dest

impl<T> IsType<T> for T

fn from_ref(t: &T) -> &T

fn into_ref(&self) -> &T

fn from_mut(t: &mut T) -> &mut T

fn into_mut(&mut self) -> &mut T

impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,

fn from_ref(outer: &Outer) -> &T

fn from_mut(outer: &mut Outer) -> &mut T

impl<T> Pointable for T

const ALIGN: usize

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

impl<T> SaturatedConversion for T

fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,

fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T, U> TryIntoKey<U> for Twhere U: TryFromKey<T>,

type Error = <U as TryFromKey<T>>::Error

fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>

impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,

fn unchecked_into(self) -> T

impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,

fn unique_saturated_into(self) -> T

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

fn vzip(self) -> V

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

Struct NodesUtils

pub fn node_temp_offchain_key<H>( prefix: &[u8], pos: u64, parent_hash: <H as Header>::Hash, ) -> Vec<u8> ⓘ
where H: Header,

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn checked_from<T>(t: T) -> Option<Self>
where Self: TryFrom<T>,

fn checked_into<T>(self) -> Option<T>
where Self: TryInto<T>,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T, U> IntoKey<U> for T
where U: FromKey<T>,

impl<Src, Dest> IntoTuple<Dest> for Src
where Dest: FromTuple<Src>,

impl<T, Outer> IsWrappedBy<Outer> for T
where Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,

fn saturated_from<T>(t: T) -> Self
where Self: UniqueSaturatedFrom<T>,

fn saturated_into<T>(self) -> T
where Self: UniqueSaturatedInto<T>,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<T, U> TryIntoKey<U> for T
where U: TryFromKey<T>,

impl<S, T> UncheckedInto<T> for S
where T: UncheckedFrom<S>,

impl<T, S> UniqueSaturatedInto<T> for S
where T: Bounded, S: TryInto<T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

impl<T> ErasedDestructor for T
where T: 'static,

impl<T> MaybeRefUnwindSafe for T
where T: RefUnwindSafe,