Trait Hash

pub trait Hash<D: Digest>: Sized {
    // Required method
    fn hash(self) -> Output<D>;
}

Trait to compute a SHA-2 hash using the digest type D

Required Methods

fn hash(self) -> Output<D>

Compute the SHA-2 hash of this value

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<'a, D, K, V> Hash<D> for &'a BTreeMap<K, V>

where D: Digest, &'a K: Hash<D>, &'a V: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D, T> Hash<D> for &'a BinaryHeap<T>

where D: Digest, &'a T: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D, T> Hash<D> for &'a BTreeSet<T>

where D: Digest, &'a T: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D, T> Hash<D> for &'a LinkedList<T>

where D: Digest, &'a T: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D, T> Hash<D> for &'a VecDeque<T>

where D: Digest, &'a T: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D, T> Hash<D> for &'a Vec<T>

where D: Digest, &'a T: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest> Hash<D> for &'a str

fn hash(self) -> Output<D>

impl<'a, D: Digest> Hash<D> for &'a String

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0> Hash<D> for &'a (T0,)

where &'a T0: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1> Hash<D> for &'a (T0, T1)

where &'a T0: Hash<D>, &'a T1: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2> Hash<D> for &'a (T0, T1, T2)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3> Hash<D> for &'a (T0, T1, T2, T3)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4> Hash<D> for &'a (T0, T1, T2, T3, T4)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5> Hash<D> for &'a (T0, T1, T2, T3, T4, T5)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>, &'a T9: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>, &'a T9: Hash<D>, &'a T10: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>, &'a T9: Hash<D>, &'a T10: Hash<D>, &'a T11: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>, &'a T9: Hash<D>, &'a T10: Hash<D>, &'a T11: Hash<D>, &'a T12: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>, &'a T9: Hash<D>, &'a T10: Hash<D>, &'a T11: Hash<D>, &'a T12: Hash<D>, &'a T13: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>, &'a T9: Hash<D>, &'a T10: Hash<D>, &'a T11: Hash<D>, &'a T12: Hash<D>, &'a T13: Hash<D>, &'a T14: Hash<D>,

fn hash(self) -> Output<D>

impl<'a, D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Hash<D> for &'a (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)

where &'a T0: Hash<D>, &'a T1: Hash<D>, &'a T2: Hash<D>, &'a T3: Hash<D>, &'a T4: Hash<D>, &'a T5: Hash<D>, &'a T6: Hash<D>, &'a T7: Hash<D>, &'a T8: Hash<D>, &'a T9: Hash<D>, &'a T10: Hash<D>, &'a T11: Hash<D>, &'a T12: Hash<D>, &'a T13: Hash<D>, &'a T14: Hash<D>, &'a T15: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for bool

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for f32

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for f64

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for i8

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for i16

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for i32

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for i64

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for i128

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for isize

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for u8

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for u16

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for u32

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for u64

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for u128

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for ()

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for usize

fn hash(self) -> Output<D>

impl<D: Digest> Hash<D> for String

fn hash(self) -> Output<D>

impl<D: Digest, K: Hash<D>, V: Hash<D>> Hash<D> for BTreeMap<K, V>

fn hash(self) -> Output<D>

impl<D: Digest, T0> Hash<D> for (T0,)

where T0: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1> Hash<D> for (T0, T1)

where T0: Hash<D>, T1: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2> Hash<D> for (T0, T1, T2)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3> Hash<D> for (T0, T1, T2, T3)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4> Hash<D> for (T0, T1, T2, T3, T4)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5> Hash<D> for (T0, T1, T2, T3, T4, T5)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6> Hash<D> for (T0, T1, T2, T3, T4, T5, T6)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>, T9: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>, T9: Hash<D>, T10: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>, T9: Hash<D>, T10: Hash<D>, T11: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>, T9: Hash<D>, T10: Hash<D>, T11: Hash<D>, T12: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>, T9: Hash<D>, T10: Hash<D>, T11: Hash<D>, T12: Hash<D>, T13: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>, T9: Hash<D>, T10: Hash<D>, T11: Hash<D>, T12: Hash<D>, T13: Hash<D>, T14: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Hash<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)

where T0: Hash<D>, T1: Hash<D>, T2: Hash<D>, T3: Hash<D>, T4: Hash<D>, T5: Hash<D>, T6: Hash<D>, T7: Hash<D>, T8: Hash<D>, T9: Hash<D>, T10: Hash<D>, T11: Hash<D>, T12: Hash<D>, T13: Hash<D>, T14: Hash<D>, T15: Hash<D>,

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for Option<T>

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 0]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 1]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 2]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 3]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 4]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 5]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 6]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 7]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 8]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 9]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 10]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 11]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 12]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 13]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 14]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 15]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 16]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 17]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 18]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 19]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 20]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 21]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 22]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 23]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 24]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 25]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 26]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 27]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 28]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 29]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 30]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 31]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for [T; 32]

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for BinaryHeap<T>

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for BTreeSet<T>

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for LinkedList<T>

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for VecDeque<T>

fn hash(self) -> Output<D>

impl<D: Digest, T: Hash<D>> Hash<D> for Vec<T>

fn hash(self) -> Output<D>

Implementors