Struct ink_metadata::layout::HashingStrategy
source · [−]pub struct HashingStrategy { /* private fields */ }
Expand description
The unbounded hashing strategy.
The offset key is used as another postfix for the computation.
So the actual formula is: hasher(prefix + encoded(key) + offset + postfix)
Where +
in this contexts means append of the byte slices.
Implementations
Creates a new unbounded hashing strategy.
Returns the supported crypto hasher.
Returns the optional prefix to the computed hash.
Trait Implementations
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
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