pub trait Hash {
// Required method
fn hash<H>(&self, state: &mut H)
where H: Hasher;
// Provided method
fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher,
Self: Sized { ... }
}
Expand description
A hashable type.
Types implementing Hash
are able to be hash
ed with an instance of
Hasher
.
§Implementing Hash
You can derive Hash
with #[derive(Hash)]
if all fields implement Hash
.
The resulting hash will be the combination of the values from calling
hash
on each field.
#[derive(Hash)]
struct Rustacean {
name: String,
country: String,
}
If you need more control over how a value is hashed, you can of course
implement the Hash
trait yourself:
use std::hash::{Hash, Hasher};
struct Person {
id: u32,
name: String,
phone: u64,
}
impl Hash for Person {
fn hash<H: Hasher>(&self, state: &mut H) {
self.id.hash(state);
self.phone.hash(state);
}
}
§Hash
and Eq
When implementing both Hash
and Eq
, it is important that the following
property holds:
k1 == k2 -> hash(k1) == hash(k2)
In other words, if two keys are equal, their hashes must also be equal.
HashMap
and HashSet
both rely on this behavior.
Thankfully, you won’t need to worry about upholding this property when
deriving both Eq
and Hash
with #[derive(PartialEq, Eq, Hash)]
.
Violating this property is a logic error. The behavior resulting from a logic error is not
specified, but users of the trait must ensure that such logic errors do not result in
undefined behavior. This means that unsafe
code must not rely on the correctness of these
methods.
§Prefix collisions
Implementations of hash
should ensure that the data they
pass to the Hasher
are prefix-free. That is,
values which are not equal should cause two different sequences of values to be written,
and neither of the two sequences should be a prefix of the other.
For example, the standard implementation of Hash
for &str
passes an extra
0xFF
byte to the Hasher
so that the values ("ab", "c")
and ("a", "bc")
hash differently.
§Portability
Due to differences in endianness and type sizes, data fed by Hash
to a Hasher
should not be considered portable across platforms. Additionally the data passed by most
standard library types should not be considered stable between compiler versions.
This means tests shouldn’t probe hard-coded hash values or data fed to a Hasher
and
instead should check consistency with Eq
.
Serialization formats intended to be portable between platforms or compiler versions should
either avoid encoding hashes or only rely on Hash
and Hasher
implementations that
provide additional guarantees.
Required Methods§
Provided Methods§
1.3.0 · Sourcefn hash_slice<H>(data: &[Self], state: &mut H)
fn hash_slice<H>(data: &[Self], state: &mut H)
Feeds a slice of this type into the given Hasher
.
This method is meant as a convenience, but its implementation is
also explicitly left unspecified. It isn’t guaranteed to be
equivalent to repeated calls of hash
and implementations of
Hash
should keep that in mind and call hash
themselves
if the slice isn’t treated as a whole unit in the PartialEq
implementation.
For example, a VecDeque
implementation might naïvely call
as_slices
and then hash_slice
on each slice, but this
is wrong since the two slices can change with a call to
make_contiguous
without affecting the PartialEq
result. Since these slices aren’t treated as singular
units, and instead part of a larger deque, this method cannot
be used.
§Examples
use std::hash::{DefaultHasher, Hash, Hasher};
let mut hasher = DefaultHasher::new();
let numbers = [6, 28, 496, 8128];
Hash::hash_slice(&numbers, &mut hasher);
println!("Hash is {:x}!", hasher.finish());
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.
Implementors§
impl Hash for AsciiChar
impl Hash for core::cmp::Ordering
impl Hash for Infallible
impl Hash for IpAddr
impl Hash for Ipv6MulticastScope
impl Hash for SocketAddr
impl Hash for core::sync::atomic::Ordering
impl Hash for ErrorKind
impl Hash for bio_types::alignment::AlignmentOperation
impl Hash for NoStrand
impl Hash for ReqStrand
impl Hash for Kind
impl Hash for bio::alignment::poa::AlignmentOperation
impl Hash for BackwardSearchResult
impl Hash for SuperblockRank
impl Hash for GffType
impl Hash for bio::pattern_matching::pssm::errors::Error
impl Hash for bio::stats::hmm::errors::Error
impl Hash for CheckedCastError
impl Hash for PodCastError
impl Hash for byteorder::BigEndian
impl Hash for byteorder::LittleEndian
impl Hash for TAffine
impl Hash for TGeneral
impl Hash for TProjective
impl Hash for SliceInfoElem
impl Hash for Sign
impl Hash for Direction
impl Hash for ParseError
impl Hash for zerocopy::byteorder::BigEndian
impl Hash for zerocopy::byteorder::LittleEndian
impl Hash for bool
impl Hash for char
impl Hash for i8
impl Hash for i16
impl Hash for i32
impl Hash for i64
impl Hash for i128
impl Hash for isize
impl Hash for !
impl Hash for str
impl Hash for u8
impl Hash for u16
impl Hash for u32
impl Hash for u64
impl Hash for u128
impl Hash for ()
impl Hash for usize
impl Hash for ByteString
impl Hash for CString
impl Hash for String
impl Hash for Layout
impl Hash for TypeId
impl Hash for ByteStr
impl Hash for CStr
impl Hash for core::fmt::Error
impl Hash for PhantomPinned
impl Hash for Ipv4Addr
impl Hash for Ipv6Addr
impl Hash for SocketAddrV4
impl Hash for SocketAddrV6
impl Hash for RangeFull
impl Hash for core::ptr::alignment::Alignment
impl Hash for Duration
impl Hash for OsStr
impl Hash for OsString
impl Hash for FileType
impl Hash for UCred
impl Hash for PathBuf
impl Hash for PrefixComponent<'_>
impl Hash for ThreadId
impl Hash for Instant
impl Hash for SystemTime
impl Hash for aho_corasick::util::primitives::PatternID
impl Hash for aho_corasick::util::primitives::StateID
impl Hash for aho_corasick::util::search::Match
impl Hash for aho_corasick::util::search::Span
impl Hash for bio_types::genome::Interval
impl Hash for Locus
impl Hash for MatchParams
impl Hash for TracebackCell
impl Hash for bio::alignment::poa::Alignment
impl Hash for SparseAlignmentResult
impl Hash for Alphabet
impl Hash for RankTransform
impl Hash for MaxOp
impl Hash for SumOp
impl Hash for BitEnc
impl Hash for Occ
impl Hash for BiInterval
impl Hash for bio::data_structures::fmindex::Interval
impl Hash for ExactMatch
impl Hash for bio::data_structures::qgram_index::Interval
impl Hash for bio::data_structures::qgram_index::Match
impl Hash for QGramIndex
impl Hash for RankSelect
impl Hash for WaveletMatrix
impl Hash for bio::io::bed::Record
impl Hash for bio::io::fasta::Record
impl Hash for Sequence
impl Hash for bio::io::fastq::Record
impl Hash for BNDM
impl Hash for BOM
impl Hash for ShiftAnd
impl Hash for Finder
impl Hash for Orf
impl Hash for State
impl Hash for StateIter
impl Hash for StateTransition
impl Hash for StateTransitionIter
impl Hash for FixedBitSet
impl Hash for Axis
impl Hash for IxDynImpl
impl Hash for ndarray::slice::Slice
impl Hash for BigInt
impl Hash for BigUint
impl Hash for Time
impl Hash for LazyStateID
impl Hash for Transition
impl Hash for NonMaxUsize
impl Hash for regex_automata::util::primitives::PatternID
impl Hash for SmallIndex
impl Hash for regex_automata::util::primitives::StateID
impl Hash for HalfMatch
impl Hash for regex_automata::util::search::Match
impl Hash for regex_automata::util::search::Span
impl Hash for ATerm
impl Hash for B0
impl Hash for B1
impl Hash for Z0
impl Hash for Equal
impl Hash for Greater
impl Hash for Less
impl Hash for UTerm
impl Hash for Path
impl<'a> Hash for Component<'a>
impl<'a> Hash for Prefix<'a>
impl<'a> Hash for PhantomContravariantLifetime<'a>
impl<'a> Hash for PhantomCovariantLifetime<'a>
impl<'a> Hash for PhantomInvariantLifetime<'a>
impl<'a> Hash for Location<'a>
impl<'a> Hash for BitEncIter<'a>
impl<'a> Hash for bio::pattern_matching::bndm::Matches<'a>
impl<'a> Hash for bio::pattern_matching::bom::Matches<'a>
impl<'a> Hash for Horspool<'a>
impl<'a> Hash for bio::pattern_matching::horspool::Matches<'a>
impl<'a> Hash for KMP<'a>
impl<'a, Block> Hash for BitSlice<'a, Block>
impl<'a, Block> Hash for BitSliceMut<'a, Block>
impl<'a, C, T> Hash for QGrams<'a, C, T>
impl<'a, N, D> Hash for bio::data_structures::interval_tree::avl_interval_tree::Entry<'a, N, D>
impl<'a, N, D> Hash for EntryMut<'a, N, D>
impl<'a, N, D> Hash for IntervalTreeIterator<'a, N, D>
impl<'a, N, D> Hash for IntervalTreeIteratorMut<'a, N, D>
impl<'a, R, T> Hash for AnnotMapIterator<'a, R, T>
impl<'a, R, T> Hash for bio::data_structures::annot_map::Entry<'a, R, T>
impl<'b, T> Hash for Ptr<'b, T>
impl<A, B> Hash for itertools::either_or_both::EitherOrBoth<A, B>
impl<A, B> Hash for itertools::either_or_both::EitherOrBoth<A, B>
impl<B> Hash for Cow<'_, B>
impl<B> Hash for bio::io::fasta::Records<B>
impl<B> Hash for bio::io::fastq::Reader<B>where
B: Hash,
impl<B> Hash for BitSet<B>where
B: BitBlock,
impl<B> Hash for bit_vec::BitVec<B>where
B: BitBlock,
impl<B> Hash for rna_algos::utils::Reader<B>where
B: Hash,
impl<B, C> Hash for ControlFlow<B, C>
impl<Block> Hash for bv::bit_vec::BitVec<Block>
impl<DBWT, DLess, DOcc> Hash for FMDIndex<DBWT, DLess, DOcc>
impl<DBWT, DLess, DOcc> Hash for FMIndex<DBWT, DLess, DOcc>
impl<Dyn> Hash for DynMetadata<Dyn>where
Dyn: ?Sized,
impl<F> Hash for bio::alignment::pairwise::banded::Aligner<F>
impl<F> Hash for bio::alignment::pairwise::Aligner<F>
impl<F> Hash for Scoring<F>
impl<F> Hash for Ukkonen<F>
impl<F> Hash for Fwhere
F: FnPtr,
impl<F, B> Hash for SmallInts<F, B>
impl<I> Hash for Dim<I>
impl<Idx> Hash for core::ops::range::Range<Idx>where
Idx: Hash,
impl<Idx> Hash for core::ops::range::RangeFrom<Idx>where
Idx: Hash,
impl<Idx> Hash for core::ops::range::RangeInclusive<Idx>where
Idx: Hash,
impl<Idx> Hash for RangeTo<Idx>where
Idx: Hash,
impl<Idx> Hash for RangeToInclusive<Idx>where
Idx: Hash,
impl<Idx> Hash for core::range::Range<Idx>where
Idx: Hash,
impl<Idx> Hash for core::range::RangeFrom<Idx>where
Idx: Hash,
impl<Idx> Hash for core::range::RangeInclusive<Idx>where
Idx: Hash,
impl<Ix> Hash for petgraph::adj::EdgeIndex<Ix>
impl<Ix> Hash for petgraph::graph_impl::EdgeIndex<Ix>where
Ix: Hash,
impl<Ix> Hash for NodeIndex<Ix>where
Ix: Hash,
impl<K, V> Hash for EnumMap<K, V>
impl<K, V> Hash for indexmap::map::slice::Slice<K, V>
impl<K, V, A> Hash for BTreeMap<K, V, A>
impl<L, Pr, Po, Payload> Hash for Model<L, Pr, Po, Payload>
impl<L, R> Hash for Either<L, R>
impl<N> Hash for bio::utils::interval::Interval<N>
impl<N, D> Hash for ArrayBackedIntervalTree<N, D>
impl<N, D> Hash for IntervalTree<N, D>
impl<O> Hash for F32<O>where
O: Hash,
impl<O> Hash for F64<O>where
O: Hash,
impl<O> Hash for I16<O>where
O: Hash,
impl<O> Hash for I32<O>where
O: Hash,
impl<O> Hash for I64<O>where
O: Hash,
impl<O> Hash for I128<O>where
O: Hash,
impl<O> Hash for Isize<O>where
O: Hash,
impl<O> Hash for U16<O>where
O: Hash,
impl<O> Hash for U32<O>where
O: Hash,
impl<O> Hash for U64<O>where
O: Hash,
impl<O> Hash for U128<O>where
O: Hash,
impl<O> Hash for Usize<O>where
O: Hash,
impl<Ptr> Hash for Pin<Ptr>
impl<R> Hash for bio::io::fastq::Records<R>
impl<R, S> Hash for Contig<R, S>
impl<R, S> Hash for Pos<R, S>
impl<R, S> Hash for Spliced<R, S>
impl<S, D> Hash for ArrayBase<S, D>
impl<T> Hash for Bound<T>where
T: Hash,
impl<T> Hash for Option<T>where
T: Hash,
impl<T> Hash for Poll<T>where
T: Hash,
impl<T> Hash for *const Twhere
T: ?Sized,
impl<T> Hash for *mut Twhere
T: ?Sized,
impl<T> Hash for &T
impl<T> Hash for &mut T
impl<T> Hash for [T]where
T: Hash,
impl<T> Hash for (T₁, T₂, …, Tₙ)
This trait is implemented for tuples up to twelve items long.
impl<T> Hash for Reverse<T>where
T: Hash,
impl<T> Hash for PhantomData<T>where
T: ?Sized,
impl<T> Hash for PhantomContravariant<T>where
T: ?Sized,
impl<T> Hash for PhantomCovariant<T>where
T: ?Sized,
impl<T> Hash for PhantomInvariant<T>where
T: ?Sized,
impl<T> Hash for ManuallyDrop<T>
impl<T> Hash for Discriminant<T>
impl<T> Hash for NonZero<T>where
T: ZeroablePrimitive + Hash,
impl<T> Hash for Saturating<T>where
T: Hash,
impl<T> Hash for Wrapping<T>where
T: Hash,
impl<T> Hash for NonNull<T>where
T: ?Sized,
impl<T> Hash for bio::pattern_matching::myers::long::Myers<T>
impl<T> Hash for bio::pattern_matching::myers::simple::Myers<T>
impl<T> Hash for indexmap::set::slice::Slice<T>where
T: Hash,
impl<T> Hash for IJKW<T>
impl<T> Hash for M2x2<T>
impl<T> Hash for M2x3<T>
impl<T> Hash for M2x4<T>
impl<T> Hash for M2x5<T>
impl<T> Hash for M2x6<T>
impl<T> Hash for M3x2<T>
impl<T> Hash for M3x3<T>
impl<T> Hash for M3x4<T>
impl<T> Hash for M3x5<T>
impl<T> Hash for M3x6<T>
impl<T> Hash for M4x2<T>
impl<T> Hash for M4x3<T>
impl<T> Hash for M4x4<T>
impl<T> Hash for M4x5<T>
impl<T> Hash for M4x6<T>
impl<T> Hash for M5x2<T>
impl<T> Hash for M5x3<T>
impl<T> Hash for M5x4<T>
impl<T> Hash for M5x5<T>
impl<T> Hash for M5x6<T>
impl<T> Hash for M6x2<T>
impl<T> Hash for M6x3<T>
impl<T> Hash for M6x4<T>
impl<T> Hash for M6x5<T>
impl<T> Hash for M6x6<T>
impl<T> Hash for X<T>
impl<T> Hash for XY<T>
impl<T> Hash for XYZ<T>
impl<T> Hash for XYZW<T>
impl<T> Hash for XYZWA<T>
impl<T> Hash for XYZWAB<T>
impl<T> Hash for Unit<T>where
T: Hash,
impl<T> Hash for Quaternion<T>
impl<T> Hash for num_complex::Complex<T>where
T: Hash,
impl<T> Hash for num_complex::Complex<T>where
T: Hash,
impl<T> Hash for num_rational::Ratio<T>
impl<T> Hash for num_rational::Ratio<T>
impl<T> Hash for NotNan<T>where
T: Float,
impl<T> Hash for OrderedFloat<T>where
T: Float,
impl<T> Hash for Unalign<T>
impl<T, A> Hash for Box<T, A>
impl<T, A> Hash for BTreeSet<T, A>
impl<T, A> Hash for LinkedList<T, A>
impl<T, A> Hash for VecDeque<T, A>
impl<T, A> Hash for Rc<T, A>
impl<T, A> Hash for UniqueRc<T, A>
impl<T, A> Hash for Arc<T, A>
impl<T, A> Hash for UniqueArc<T, A>
impl<T, A> Hash for Vec<T, A>
The hash of a vector is the same as that of the corresponding slice,
as required by the core::borrow::Borrow
implementation.
use std::hash::BuildHasher;
let b = std::hash::RandomState::new();
let v: Vec<u8> = vec![0xa8, 0x3c, 0x09];
let s: &[u8] = &[0xa8, 0x3c, 0x09];
assert_eq!(b.hash_one(v), b.hash_one(s));
impl<T, C, const D: usize> Hash for Transform<T, C, D>where
T: RealField + Hash,
C: TCategory,
Const<D>: DimNameAdd<Const<1>>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,
<DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer: Hash,
impl<T, D> Hash for OPoint<T, D>
impl<T, E> Hash for Result<T, E>
impl<T, Op> Hash for FenwickTree<T, Op>
impl<T, R, C, S> Hash for Matrix<T, R, C, S>
impl<T, R, const D: usize> Hash for Isometry<T, R, D>
impl<T, R, const D: usize> Hash for Similarity<T, R, D>
impl<T, const D: usize> Hash for Rotation<T, D>
impl<T, const D: usize> Hash for Translation<T, D>
impl<T, const N: usize> Hash for [T; N]where
T: Hash,
The hash of an array is the same as that of the corresponding slice,
as required by the Borrow
implementation.
use std::hash::BuildHasher;
let b = std::hash::RandomState::new();
let a: [u8; 3] = [0xa8, 0x3c, 0x09];
let s: &[u8] = &[0xa8, 0x3c, 0x09];
assert_eq!(b.hash_one(a), b.hash_one(s));