subspace_test_runtime::mmr

Struct Compact

pub struct Compact<H, T> {
    pub tuple: T,
    /* private fields */
}

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) -> Compact<H, T>

Create a new Compact wrapper for a tuple.

Trait Implementations§

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

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

Returns a copy of the value. Read more

1.0.0 · Source§

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<(), Error>

Formats the value using the given formatter. Read more

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

fn decode<I>(value: &mut I) -> Result<Compact<H, T>, Error>
where I: Input,

Attempt to deserialise the value from input.

fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self>, ) -> Result<DecodeFinished, Error>
where I: Input,

Attempt to deserialize the value from input into a pre-allocated piece of memory. Read more

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) -> &<Compact<H, T> as Deref>::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>(&self, f: F, compact: bool) -> R
where F: FnOnce(&[u8]) -> R,

Encode the leaf either in its 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>(&self, f: F, compact: bool) -> R
where F: FnOnce(&[u8]) -> R,

Encode the leaf either in its 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>(&self, f: F, compact: bool) -> R
where F: FnOnce(&[u8]) -> R,

Encode the leaf either in its 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>(&self, f: F, compact: bool) -> R
where F: FnOnce(&[u8]) -> R,

Encode the leaf either in its 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>(&self, f: F, compact: bool) -> R
where F: FnOnce(&[u8]) -> R,

Encode the leaf either in its 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 as LeafDataProvider>::LeafData>,)>

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

fn leaf_data() -> <Compact<H, (A,)> as LeafDataProvider>::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 as LeafDataProvider>::LeafData>, DataOrHash<H, <B as LeafDataProvider>::LeafData>)>

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

fn leaf_data() -> <Compact<H, (A, B)> as LeafDataProvider>::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 as LeafDataProvider>::LeafData>, DataOrHash<H, <B as LeafDataProvider>::LeafData>, DataOrHash<H, <C as LeafDataProvider>::LeafData>)>

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

fn leaf_data() -> <Compact<H, (A, B, C)> as LeafDataProvider>::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 as LeafDataProvider>::LeafData>, DataOrHash<H, <B as LeafDataProvider>::LeafData>, DataOrHash<H, <C as LeafDataProvider>::LeafData>, DataOrHash<H, <D as LeafDataProvider>::LeafData>)>

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

fn leaf_data() -> <Compact<H, (A, B, C, D)> as LeafDataProvider>::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 as LeafDataProvider>::LeafData>, DataOrHash<H, <B as LeafDataProvider>::LeafData>, DataOrHash<H, <C as LeafDataProvider>::LeafData>, DataOrHash<H, <D as LeafDataProvider>::LeafData>, DataOrHash<H, <E as LeafDataProvider>::LeafData>)>

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

fn leaf_data() -> <Compact<H, (A, B, C, D, E)> as LeafDataProvider>::LeafData

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

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

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

Tests for self and other values to be equal, and is used by ==.

1.0.0 · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

Auto Trait Implementations§

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

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

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

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

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

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

Blanket Implementations§

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

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

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> CloneToUninit for T
where T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

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

Performs copy-assignment from self to dest. Read more

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

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

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

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

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

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

fn decode_with_depth_limit<I>(limit: u32, input: &mut I) -> Result<T, Error>
where I: Input,

Decode Self with the given maximum recursion depth and advance input by the number of bytes consumed. Read more

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

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

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

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>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> IntoEither for T

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 more

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

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

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

fn into_key(self) -> U

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

fn into_tuple(self) -> Dest

impl<T> IsType<T> for T

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

Cast reference.

fn into_ref(&self) -> &T

Cast reference.

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

Cast mutable reference.

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

Cast mutable reference.

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

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

Get a reference to the inner from the outer.

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

Get a mutable reference to the inner from the outer.

impl<T> Pointable for T

const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

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

Initializes a with the given initializer. Read more

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

Dereferences the given pointer. Read more

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

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

impl<P, T> Receiver for P
where P: Deref<Target = T> + ?Sized, T: ?Sized,

type Target = T

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

The target type on which the method may be called.

impl<T> Same 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.

fn to_owned(&self) -> T

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

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

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.

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.

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

Performs the conversion.

impl<T, U> TryIntoKey<U> for T
where 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 S
where T: UncheckedFrom<S>,

fn unchecked_into(self) -> T

The counterpart to unchecked_from.

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

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>,

fn vzip(self) -> V

impl<T> WithSubscriber for T

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

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more

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

impl<T> Formattable for T
where T: Deref, <T as Deref>::Target: Formattable,

impl<T> JsonSchemaMaybe for T

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

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

impl<T> MaybeSendSync for T

impl<T> Parsable for T
where T: Deref, <T as Deref>::Target: Parsable,