pub struct Hmac<T>(/* private fields */)
where
T: Hash;
Expand description
A hash computed from a RFC 2104 HMAC. Parameterized by the underlying hash function.
Trait Implementations§
§impl<T> Hash for Hmac<T>where
T: Hash,
impl<T> Hash for Hmac<T>where
T: Hash,
§type Engine = HmacEngine<T>
type Engine = HmacEngine<T>
A hashing engine which bytes can be serialized into. It is expected
to implement the
io::Write
trait, and to never return errors under
any conditions.§fn from_engine(e: HmacEngine<T>) -> Hmac<T>
fn from_engine(e: HmacEngine<T>) -> Hmac<T>
Produces a hash from the current state of a given engine.
§fn into_inner(self) -> <Hmac<T> as Hash>::Inner
fn into_inner(self) -> <Hmac<T> as Hash>::Inner
Unwraps the hash and returns the underlying byte array.
§fn as_inner(&self) -> &<Hmac<T> as Hash>::Inner
fn as_inner(&self) -> &<Hmac<T> as Hash>::Inner
Unwraps the hash and returns a reference to the underlying byte array.
§fn from_inner(inner: <T as Hash>::Inner) -> Hmac<T>
fn from_inner(inner: <T as Hash>::Inner) -> Hmac<T>
Constructs a hash from the underlying byte array.
§const DISPLAY_BACKWARD: bool = false
const DISPLAY_BACKWARD: bool = false
Flag indicating whether user-visible serializations of this hash
should be backward. For some reason Satoshi decided this should be
true for
Sha256dHash
, so here we are.§impl<T> Ord for Hmac<T>
impl<T> Ord for Hmac<T>
§impl<T> PartialOrd for Hmac<T>where
T: PartialOrd + Hash,
impl<T> PartialOrd for Hmac<T>where
T: PartialOrd + Hash,
impl<T> Copy for Hmac<T>
impl<T> Eq for Hmac<T>
impl<T> StructuralPartialEq for Hmac<T>where
T: Hash,
Auto Trait Implementations§
impl<T> Freeze for Hmac<T>where
T: Freeze,
impl<T> RefUnwindSafe for Hmac<T>where
T: RefUnwindSafe,
impl<T> Send for Hmac<T>where
T: Send,
impl<T> Sync for Hmac<T>where
T: Sync,
impl<T> Unpin for Hmac<T>where
T: Unpin,
impl<T> UnwindSafe for Hmac<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> FromHex for Twhere
T: Hash,
impl<T> FromHex for Twhere
T: Hash,
§fn from_byte_iter<I>(iter: I) -> Result<T, Error>
fn from_byte_iter<I>(iter: I) -> Result<T, Error>
Produces an object from a byte iterator.
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T
in a tonic::Request