pub fn insert_hashed<S: ToString, T: UniqueHash>(
        &mut self,
        key: S,
        value: &T,
    ) -> Option<[u8; 32]> {
        self.0
            .insert(key.to_string().unique_hash(), value.unique_hash())
    }
/// Inserts the digest of `value` using the digest of `key` as the key.
///
/// If the digest of the key is not in the map, it returns None.
/// Otherwise, it updates the hashed value and returns the old digest.
Inserts the digest of `value` using the digest of `key` as the key.
If the digest of the key is not in the map, it returns None.
Otherwise, it updates the hashed value and returns the old digest.
Inserts the digest of ` value ` using the digest of ` key ` as the key . If the digest of the key is not in the map it returns None . Otherwise it updates the hashed value and returns the old digest .
pub fn insert_hashed<S: ToString, T: UniqueHash>(
        &mut self,
        key: S,
        value: &T,
    ) -> Option<[u8; 32]> {
        self.0
            .insert(key.to_string().unique_hash(), value.unique_hash())
    }
pub fn insert_hashed < S : ToString , T : UniqueHash > ( & mut self , key : S , value : & T , ) -> Option < [ u8 ; 32 ] > { self . 0 . insert ( key . to_string ( ) . unique_hash ( ) , value . unique_hash ( ) ) }
Inserts the digest of `value` using the digest of `key` as the key.
Inserts the digest of ` value ` using the digest of ` key ` as the key .
&mut self
key
S
value
&T
&mut self
key
S
value
&T