Struct pallet_mmr_primitives::Compact[−][src]

pub struct Compact<H, T> {
    pub tuple: T,
    // some fields omitted
}

Expand description

A composition of multiple leaf elements with compact form representation.

When composing together multiple LeafDataProviders you will end up with a tuple of LeafData that each element provides.

However this will cause the leaves to have significant size, while for some use cases it will be enough to prove only one element of the tuple. That’s the rationale for Compact struct. We wrap each element of the tuple into DataOrHash and each tuple element is hashed first before constructing the final hash of the entire tuple. This allows you to replace tuple elements you don’t care about with their hashes.

Fields

tuple: T

Internal tuple representation.

Implementations

impl<H, T> Compact<H, T>

pub fn new(tuple: T) -> Self

Create a new Compact wrapper for a tuple.

Trait Implementations

impl<H: Clone, T: Clone> Clone for Compact<H, T>

fn clone(&self) -> Compact<H, T>

Returns a copy of the value. Read more

1.0.0[src]

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

Performs copy-assignment from source. Read more

impl<H, T> Debug for Compact<H, T> where
    H: Debug,
    T: Debug,

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

Formats the value using the given formatter. Read more

impl<H, T: Decode> Decode for Compact<H, T>

fn decode<I: Input>(value: &mut I) -> Result<Self, Error>

Attempt to deserialise the value from input.

fn skip<I>(input: &mut I) -> Result<(), Error> where
    I: Input,

Attempt to skip the encoded value from input. Read more

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type. Read more

impl<H, T> Deref for Compact<H, T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<H, A> FullLeaf for Compact<H, (DataOrHash<H, A>,)> where
    H: Hash,
    A: FullLeaf,

FullLeaf implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F, compact: bool) -> R

Encode the leaf either in it’s full or compact form. Read more

impl<H, A, B> FullLeaf for Compact<H, (DataOrHash<H, A>, DataOrHash<H, B>)> where
    H: Hash,
    A: FullLeaf,
    B: FullLeaf,

FullLeaf implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F, compact: bool) -> R

Encode the leaf either in it’s full or compact form. Read more

impl<H, A, B, C> FullLeaf for Compact<H, (DataOrHash<H, A>, DataOrHash<H, B>, DataOrHash<H, C>)> where
    H: Hash,
    A: FullLeaf,
    B: FullLeaf,
    C: FullLeaf,

FullLeaf implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F, compact: bool) -> R

Encode the leaf either in it’s full or compact form. Read more

impl<H, A, B, C, D> FullLeaf for Compact<H, (DataOrHash<H, A>, DataOrHash<H, B>, DataOrHash<H, C>, DataOrHash<H, D>)> where
    H: Hash,
    A: FullLeaf,
    B: FullLeaf,
    C: FullLeaf,
    D: FullLeaf,

FullLeaf implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F, compact: bool) -> R

Encode the leaf either in it’s full or compact form. Read more

impl<H, A, B, C, D, E> FullLeaf for Compact<H, (DataOrHash<H, A>, DataOrHash<H, B>, DataOrHash<H, C>, DataOrHash<H, D>, DataOrHash<H, E>)> where
    H: Hash,
    A: FullLeaf,
    B: FullLeaf,
    C: FullLeaf,
    D: FullLeaf,
    E: FullLeaf,

FullLeaf implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F, compact: bool) -> R

Encode the leaf either in it’s full or compact form. Read more

impl<H, A> LeafDataProvider for Compact<H, (A,)> where
    H: Hash,
    A: LeafDataProvider,

LeafDataProvider implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

This provides a compact-form encoding for tuples wrapped in Compact.

type LeafData = Compact<H, (DataOrHash<H, A::LeafData>,)>

A type that should end up in the leaf of MMR.

fn leaf_data() -> Self::LeafData

The method to return leaf data that should be placed in the leaf node appended MMR at this block. Read more

impl<H, A, B> LeafDataProvider for Compact<H, (A, B)> where
    H: Hash,
    A: LeafDataProvider,
    B: LeafDataProvider,

LeafDataProvider implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

This provides a compact-form encoding for tuples wrapped in Compact.

type LeafData = Compact<H, (DataOrHash<H, A::LeafData>, DataOrHash<H, B::LeafData>)>

A type that should end up in the leaf of MMR.

fn leaf_data() -> Self::LeafData

The method to return leaf data that should be placed in the leaf node appended MMR at this block. Read more

impl<H, A, B, C> LeafDataProvider for Compact<H, (A, B, C)> where
    H: Hash,
    A: LeafDataProvider,
    B: LeafDataProvider,
    C: LeafDataProvider,

LeafDataProvider implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

This provides a compact-form encoding for tuples wrapped in Compact.

type LeafData = Compact<H, (DataOrHash<H, A::LeafData>, DataOrHash<H, B::LeafData>, DataOrHash<H, C::LeafData>)>

A type that should end up in the leaf of MMR.

fn leaf_data() -> Self::LeafData

The method to return leaf data that should be placed in the leaf node appended MMR at this block. Read more

impl<H, A, B, C, D> LeafDataProvider for Compact<H, (A, B, C, D)> where
    H: Hash,
    A: LeafDataProvider,
    B: LeafDataProvider,
    C: LeafDataProvider,
    D: LeafDataProvider,

LeafDataProvider implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

This provides a compact-form encoding for tuples wrapped in Compact.

type LeafData = Compact<H, (DataOrHash<H, A::LeafData>, DataOrHash<H, B::LeafData>, DataOrHash<H, C::LeafData>, DataOrHash<H, D::LeafData>)>

A type that should end up in the leaf of MMR.

fn leaf_data() -> Self::LeafData

The method to return leaf data that should be placed in the leaf node appended MMR at this block. Read more

impl<H, A, B, C, D, E> LeafDataProvider for Compact<H, (A, B, C, D, E)> where
    H: Hash,
    A: LeafDataProvider,
    B: LeafDataProvider,
    C: LeafDataProvider,
    D: LeafDataProvider,
    E: LeafDataProvider,

LeafDataProvider implementation for Compact<H, (DataOrHash<H, Tuple>, ...)>

This provides a compact-form encoding for tuples wrapped in Compact.

type LeafData = Compact<H, (DataOrHash<H, A::LeafData>, DataOrHash<H, B::LeafData>, DataOrHash<H, C::LeafData>, DataOrHash<H, D::LeafData>, DataOrHash<H, E::LeafData>)>

A type that should end up in the leaf of MMR.

fn leaf_data() -> Self::LeafData

The method to return leaf data that should be placed in the leaf node appended MMR at this block. Read more

impl<H: PartialEq, T: PartialEq> PartialEq<Compact<H, T>> for Compact<H, T>

fn eq(&self, other: &Compact<H, T>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

fn ne(&self, other: &Compact<H, T>) -> bool

This method tests for !=.

impl<H, T> StructuralPartialEq for Compact<H, T>

Auto Trait Implementations

impl<H, T> RefUnwindSafe for Compact<H, T> where
    H: RefUnwindSafe,
    T: RefUnwindSafe,

impl<H, T> Send for Compact<H, T> where
    H: Send,
    T: Send,

impl<H, T> Sync for Compact<H, T> where
    H: Sync,
    T: Sync,

impl<H, T> Unpin for Compact<H, T> where
    H: Unpin,
    T: Unpin,

impl<H, T> UnwindSafe for Compact<H, T> where
    H: UnwindSafe,
    T: UnwindSafe,

Blanket Implementations

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

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

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

Mutably borrows from an owned value. Read more

impl<T> CheckedConversion for T

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

Convert from a value of T into an equivalent instance of Option<Self>. Read more

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

Consume self to return Some equivalent value of Option<T>. Read more

impl<T> DecodeAll for T where
    T: Decode,

pub fn decode_all(input: &[u8]) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more

impl<T> DecodeLimit for T where
    T: Decode,

pub fn decode_all_with_depth_limit(limit: u32, input: &[u8]) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more

pub fn decode_with_depth_limit(limit: u32, input: &[u8]) -> Result<T, Error>

Decode Self with the given maximum recursion depth. Read more

impl<T> Downcast for T where
    T: Any,

pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read more

pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more

pub fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s. Read more

pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s. Read more

impl<T> DowncastSync for T where
    T: Any + Send + Sync,

pub fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more

impl<T> DynClone for T where
    T: Clone,

pub fn __clone_box(&self, Private) -> *mut ()

impl<T> From<T> for T

pub fn from(t: T) -> T

Performs the conversion.

impl<T> Instrument for T

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

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

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

pub fn into(self) -> U

Performs the conversion.

impl<T> IsType<T> for T

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

Cast reference.

pub fn into_ref(&self) -> &T

Cast reference.

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

Cast mutable reference.

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

Cast mutable reference.

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

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

Get a reference to the inner from the outer.

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

Get a mutable reference to the inner from the outer.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> SaturatedConversion for T

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

Convert from a value of T into an equivalent instance of Self. Read more

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

Consume self to return an equivalent value of T. Read more

impl<T> ToOwned for T where
    T: Clone,

type Owned = T

The resulting type after obtaining ownership.

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

pub fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

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

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

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

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

The type returned in the event of a conversion error.

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

Performs the conversion.

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

pub fn unchecked_into(self) -> T

The counterpart to unchecked_from.

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

pub fn unique_saturated_into(self) -> T

Consume self to return an equivalent value of T.

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

pub fn vzip(self) -> V

impl<T> MaybeDebug for T where
    T: Debug,

impl<T> MaybeDebug for T where
    T: Debug,

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