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§
source§impl HashingStrategy
impl HashingStrategy
sourcepub fn new(hasher: CryptoHasher, prefix: Vec<u8>, postfix: Vec<u8>) -> Self
pub fn new(hasher: CryptoHasher, prefix: Vec<u8>, postfix: Vec<u8>) -> Self
Creates a new unbounded hashing strategy.
sourcepub fn hasher(&self) -> &CryptoHasher
pub fn hasher(&self) -> &CryptoHasher
Returns the supported crypto hasher.
Trait Implementations§
source§impl Debug for HashingStrategy
impl Debug for HashingStrategy
source§impl<'de> Deserialize<'de> for HashingStrategy
impl<'de> Deserialize<'de> for HashingStrategy
source§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
source§impl JsonSchema for HashingStrategy
impl JsonSchema for HashingStrategy
source§fn schema_name() -> String
fn schema_name() -> String
The name of the generated JSON Schema. Read more
source§fn schema_id() -> Cow<'static, str>
fn schema_id() -> Cow<'static, str>
Returns a string that uniquely identifies the schema produced by this type. Read more
source§fn json_schema(gen: &mut SchemaGenerator) -> Schema
fn json_schema(gen: &mut SchemaGenerator) -> Schema
Generates a JSON Schema for this type. Read more
§fn is_referenceable() -> bool
fn is_referenceable() -> bool
Whether JSON Schemas generated for this type should be re-used where possible using the
$ref
keyword. Read moresource§impl Ord for HashingStrategy
impl Ord for HashingStrategy
source§fn cmp(&self, other: &HashingStrategy) -> Ordering
fn cmp(&self, other: &HashingStrategy) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq for HashingStrategy
impl PartialEq for HashingStrategy
source§fn eq(&self, other: &HashingStrategy) -> bool
fn eq(&self, other: &HashingStrategy) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd for HashingStrategy
impl PartialOrd for HashingStrategy
source§fn partial_cmp(&self, other: &HashingStrategy) -> Option<Ordering>
fn partial_cmp(&self, other: &HashingStrategy) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl Serialize for HashingStrategy
impl Serialize for HashingStrategy
impl Eq for HashingStrategy
impl StructuralPartialEq for HashingStrategy
Auto Trait Implementations§
impl Freeze for HashingStrategy
impl RefUnwindSafe for HashingStrategy
impl Send for HashingStrategy
impl Sync for HashingStrategy
impl Unpin for HashingStrategy
impl UnwindSafe for HashingStrategy
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more