Struct ink_metadata::layout::HashLayout
source · [−]Expand description
A hashing layout potentially hitting all cells of the storage.
Every hashing layout has an offset and a strategy to compute its keys.
Implementations
Trait Implementations
impl<'de, F: Form> Deserialize<'de> for HashLayout<F> where
F::Type: DeserializeOwned,
F::String: DeserializeOwned,
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>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Performs the conversion.
type Output = HashLayout<PortableForm>
type Output = HashLayout<PortableForm>
The portable version of Self
.
Convert self
to the portable form by using the registry for caching.
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more