Struct ink_metadata::layout::HashLayout

pub struct HashLayout<F: Form = MetaForm> { /* private fields */ }

A hashing layout potentially hitting all cells of the storage.

Every hashing layout has an offset and a strategy to compute its keys.

Implementations

impl HashLayout

pub fn new<K, L>(offset: K, strategy: HashingStrategy, layout: L) -> Selfwhere
    K: Into<LayoutKey>,
    L: Into<Layout>,

Creates a new unbounded layout.

impl<F> HashLayout<F>where
    F: Form,

pub fn offset(&self) -> &LayoutKey

Returns the key offset used by the strategy.

pub fn strategy(&self) -> &HashingStrategy

Returns the hashing strategy to layout the underlying elements.

pub fn layout(&self) -> &Layout<F>

Returns the storage layout of the unbounded layout elements.

Trait Implementations

impl<F: Debug + Form> Debug for HashLayout<F>

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

Formats the value using the given formatter.

impl<'de, F: Form> Deserialize<'de> for HashLayout<F>where
    F::Type: DeserializeOwned,
    F::String: DeserializeOwned,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
    __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<F: Form> From<HashLayout<F>> for Layout<F>

fn from(original: HashLayout<F>) -> Layout<F>

Converts to this type from the input type.

impl IntoPortable for HashLayout

type Output = HashLayout<PortableForm>

The portable version of Self.

fn into_portable(self, registry: &mut Registry) -> Self::Output

Convert self to the portable form by using the registry for caching.

impl<F: Ord + Form> Ord for HashLayout<F>

fn cmp(&self, other: &HashLayout<F>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<F: PartialEq + Form> PartialEq<HashLayout<F>> for HashLayout<F>

fn eq(&self, other: &HashLayout<F>) -> bool

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

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

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

impl<F: PartialOrd + Form> PartialOrd<HashLayout<F>> for HashLayout<F>

fn partial_cmp(&self, other: &HashLayout<F>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<F: Form> Serialize for HashLayout<F>where
    F::Type: Serialize,
    F::String: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where
    __S: Serializer,

Serialize this value into the given Serde serializer.

impl<F: Eq + Form> Eq for HashLayout<F>

impl<F: Form> StructuralEq for HashLayout<F>

impl<F: Form> StructuralPartialEq for HashLayout<F>