Trait Hash

1.0.0 · Source
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 hashed 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§

1.0.0 · Source

fn hash<H>(&self, state: &mut H)
where H: Hasher,

Feeds this value into the given Hasher.

§Examples
use std::hash::{DefaultHasher, Hash, Hasher};

let mut hasher = DefaultHasher::new();
7920.hash(&mut hasher);
println!("Hash is {:x}!", hasher.finish());

Provided Methods§

1.3.0 · Source

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

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§

Source§

impl Hash for AsciiChar

1.0.0 · Source§

impl Hash for core::cmp::Ordering

1.44.0 · Source§

impl Hash for Infallible

1.7.0 · Source§

impl Hash for IpAddr

Source§

impl Hash for Ipv6MulticastScope

1.0.0 · Source§

impl Hash for SocketAddr

1.0.0 · Source§

impl Hash for core::sync::atomic::Ordering

1.0.0 · Source§

impl Hash for ErrorKind

Source§

impl Hash for bio_types::alignment::AlignmentOperation

Source§

impl Hash for NoStrand

Source§

impl Hash for ReqStrand

Source§

impl Hash for Kind

Source§

impl Hash for bio::alignment::poa::AlignmentOperation

Source§

impl Hash for BackwardSearchResult

Source§

impl Hash for SuperblockRank

Source§

impl Hash for GffType

Source§

impl Hash for bio::pattern_matching::pssm::errors::Error

Source§

impl Hash for bio::stats::hmm::errors::Error

Source§

impl Hash for CheckedCastError

Source§

impl Hash for PodCastError

Source§

impl Hash for byteorder::BigEndian

Source§

impl Hash for byteorder::LittleEndian

Source§

impl Hash for TAffine

Source§

impl Hash for TGeneral

Source§

impl Hash for TProjective

Source§

impl Hash for SliceInfoElem

Source§

impl Hash for Sign

Source§

impl Hash for Direction

Source§

impl Hash for ParseError

Source§

impl Hash for zerocopy::byteorder::BigEndian

Source§

impl Hash for zerocopy::byteorder::LittleEndian

1.0.0 · Source§

impl Hash for bool

1.0.0 · Source§

impl Hash for char

1.0.0 · Source§

impl Hash for i8

1.0.0 · Source§

impl Hash for i16

1.0.0 · Source§

impl Hash for i32

1.0.0 · Source§

impl Hash for i64

1.0.0 · Source§

impl Hash for i128

1.0.0 · Source§

impl Hash for isize

1.29.0 · Source§

impl Hash for !

1.0.0 · Source§

impl Hash for str

1.0.0 · Source§

impl Hash for u8

1.0.0 · Source§

impl Hash for u16

1.0.0 · Source§

impl Hash for u32

1.0.0 · Source§

impl Hash for u64

1.0.0 · Source§

impl Hash for u128

1.0.0 · Source§

impl Hash for ()

1.0.0 · Source§

impl Hash for usize

Source§

impl Hash for ByteString

1.64.0 · Source§

impl Hash for CString

1.0.0 · Source§

impl Hash for String

1.28.0 · Source§

impl Hash for Layout

1.0.0 · Source§

impl Hash for TypeId

Source§

impl Hash for ByteStr

1.64.0 · Source§

impl Hash for CStr

1.0.0 · Source§

impl Hash for core::fmt::Error

1.33.0 · Source§

impl Hash for PhantomPinned

1.0.0 · Source§

impl Hash for Ipv4Addr

1.0.0 · Source§

impl Hash for Ipv6Addr

1.0.0 · Source§

impl Hash for SocketAddrV4

1.0.0 · Source§

impl Hash for SocketAddrV6

1.0.0 · Source§

impl Hash for RangeFull

Source§

impl Hash for core::ptr::alignment::Alignment

1.3.0 · Source§

impl Hash for Duration

1.0.0 · Source§

impl Hash for OsStr

1.0.0 · Source§

impl Hash for OsString

1.1.0 · Source§

impl Hash for FileType

Source§

impl Hash for UCred

1.0.0 · Source§

impl Hash for PathBuf

1.0.0 · Source§

impl Hash for PrefixComponent<'_>

1.19.0 · Source§

impl Hash for ThreadId

1.8.0 · Source§

impl Hash for Instant

1.8.0 · Source§

impl Hash for SystemTime

Source§

impl Hash for aho_corasick::util::primitives::PatternID

Source§

impl Hash for aho_corasick::util::primitives::StateID

Source§

impl Hash for aho_corasick::util::search::Match

Source§

impl Hash for aho_corasick::util::search::Span

Source§

impl Hash for bio_types::genome::Interval

Source§

impl Hash for Locus

Source§

impl Hash for MatchParams

Source§

impl Hash for TracebackCell

Source§

impl Hash for bio::alignment::poa::Alignment

Source§

impl Hash for SparseAlignmentResult

Source§

impl Hash for Alphabet

Source§

impl Hash for RankTransform

Source§

impl Hash for MaxOp

Source§

impl Hash for SumOp

Source§

impl Hash for BitEnc

Source§

impl Hash for Occ

Source§

impl Hash for BiInterval

Source§

impl Hash for bio::data_structures::fmindex::Interval

Source§

impl Hash for ExactMatch

Source§

impl Hash for bio::data_structures::qgram_index::Interval

Source§

impl Hash for bio::data_structures::qgram_index::Match

Source§

impl Hash for QGramIndex

Source§

impl Hash for RankSelect

Source§

impl Hash for WaveletMatrix

Source§

impl Hash for bio::io::bed::Record

Source§

impl Hash for bio::io::fasta::Record

Source§

impl Hash for Sequence

Source§

impl Hash for bio::io::fastq::Record

Source§

impl Hash for BNDM

Source§

impl Hash for BOM

Source§

impl Hash for ShiftAnd

Source§

impl Hash for Finder

Source§

impl Hash for Orf

Source§

impl Hash for State

Source§

impl Hash for StateIter

Source§

impl Hash for StateTransition

Source§

impl Hash for StateTransitionIter

Source§

impl Hash for FixedBitSet

Source§

impl Hash for Axis

Source§

impl Hash for IxDynImpl

Source§

impl Hash for ndarray::slice::Slice

Source§

impl Hash for BigInt

Source§

impl Hash for BigUint

Source§

impl Hash for Time

Source§

impl Hash for LazyStateID

Source§

impl Hash for Transition

Source§

impl Hash for NonMaxUsize

Source§

impl Hash for regex_automata::util::primitives::PatternID

Source§

impl Hash for SmallIndex

Source§

impl Hash for regex_automata::util::primitives::StateID

Source§

impl Hash for HalfMatch

Source§

impl Hash for regex_automata::util::search::Match

Source§

impl Hash for regex_automata::util::search::Span

Source§

impl Hash for ATerm

Source§

impl Hash for B0

Source§

impl Hash for B1

Source§

impl Hash for Z0

Source§

impl Hash for Equal

Source§

impl Hash for Greater

Source§

impl Hash for Less

Source§

impl Hash for UTerm

1.0.0 · Source§

impl Hash for Path

1.0.0 · Source§

impl<'a> Hash for Component<'a>

1.0.0 · Source§

impl<'a> Hash for Prefix<'a>

Source§

impl<'a> Hash for PhantomContravariantLifetime<'a>

Source§

impl<'a> Hash for PhantomCovariantLifetime<'a>

Source§

impl<'a> Hash for PhantomInvariantLifetime<'a>

1.10.0 · Source§

impl<'a> Hash for Location<'a>

Source§

impl<'a> Hash for BitEncIter<'a>

Source§

impl<'a> Hash for bio::pattern_matching::bndm::Matches<'a>

Source§

impl<'a> Hash for bio::pattern_matching::bom::Matches<'a>

Source§

impl<'a> Hash for Horspool<'a>

Source§

impl<'a> Hash for bio::pattern_matching::horspool::Matches<'a>

Source§

impl<'a> Hash for KMP<'a>

Source§

impl<'a, Block> Hash for BitSlice<'a, Block>
where Block: BlockType + Hash,

Source§

impl<'a, Block> Hash for BitSliceMut<'a, Block>
where Block: BlockType + Hash,

Source§

impl<'a, C, T> Hash for QGrams<'a, C, T>
where C: Hash + Borrow<u8>, T: Hash + Iterator<Item = C>,

Source§

impl<'a, N, D> Hash for bio::data_structures::interval_tree::avl_interval_tree::Entry<'a, N, D>
where N: Hash + Ord + Clone, D: Hash,

Source§

impl<'a, N, D> Hash for EntryMut<'a, N, D>
where N: Hash + Ord + Clone, D: Hash,

Source§

impl<'a, N, D> Hash for IntervalTreeIterator<'a, N, D>
where N: Hash + Ord + Clone, D: Hash,

Source§

impl<'a, N, D> Hash for IntervalTreeIteratorMut<'a, N, D>
where N: Hash + Ord + Clone, D: Hash,

Source§

impl<'a, R, T> Hash for AnnotMapIterator<'a, R, T>
where R: Hash + Eq, T: Hash,

Source§

impl<'a, R, T> Hash for bio::data_structures::annot_map::Entry<'a, R, T>
where R: Hash + Eq, T: Hash,

Source§

impl<'b, T> Hash for Ptr<'b, T>

Source§

impl<A, B> Hash for itertools::either_or_both::EitherOrBoth<A, B>
where A: Hash, B: Hash,

Source§

impl<A, B> Hash for itertools::either_or_both::EitherOrBoth<A, B>
where A: Hash, B: Hash,

1.0.0 · Source§

impl<B> Hash for Cow<'_, B>
where B: Hash + ToOwned + ?Sized,

Source§

impl<B> Hash for bio::io::fasta::Records<B>
where B: Hash + BufRead,

Source§

impl<B> Hash for bio::io::fastq::Reader<B>
where B: Hash,

Source§

impl<B> Hash for BitSet<B>
where B: BitBlock,

Source§

impl<B> Hash for bit_vec::BitVec<B>
where B: BitBlock,

Source§

impl<B> Hash for rna_algos::utils::Reader<B>
where B: Hash,

1.55.0 · Source§

impl<B, C> Hash for ControlFlow<B, C>
where B: Hash, C: Hash,

Source§

impl<Block> Hash for bv::bit_vec::BitVec<Block>
where Block: BlockType + Hash,

Source§

impl<DBWT, DLess, DOcc> Hash for FMDIndex<DBWT, DLess, DOcc>
where DBWT: Hash + Borrow<Vec<u8>>, DLess: Hash + Borrow<Vec<usize>>, DOcc: Hash + Borrow<Occ>,

Source§

impl<DBWT, DLess, DOcc> Hash for FMIndex<DBWT, DLess, DOcc>
where DBWT: Hash + Borrow<Vec<u8>>, DLess: Hash + Borrow<Vec<usize>>, DOcc: Hash + Borrow<Occ>,

Source§

impl<Dyn> Hash for DynMetadata<Dyn>
where Dyn: ?Sized,

Source§

impl<F> Hash for bio::alignment::pairwise::banded::Aligner<F>
where F: Hash + MatchFunc,

Source§

impl<F> Hash for bio::alignment::pairwise::Aligner<F>
where F: Hash + MatchFunc,

Source§

impl<F> Hash for Scoring<F>
where F: Hash + MatchFunc,

Source§

impl<F> Hash for Ukkonen<F>
where F: Hash + Fn(u8, u8) -> u32,

1.4.0 · Source§

impl<F> Hash for F
where F: FnPtr,

Source§

impl<F, B> Hash for SmallInts<F, B>
where F: Hash + Integer + Bounded + NumCast + Copy, B: Hash + Integer + NumCast + Copy,

Source§

impl<I> Hash for Dim<I>
where I: Hash + ?Sized,

1.0.0 · Source§

impl<Idx> Hash for core::ops::range::Range<Idx>
where Idx: Hash,

1.0.0 · Source§

impl<Idx> Hash for core::ops::range::RangeFrom<Idx>
where Idx: Hash,

1.26.0 · Source§

impl<Idx> Hash for core::ops::range::RangeInclusive<Idx>
where Idx: Hash,

1.0.0 · Source§

impl<Idx> Hash for RangeTo<Idx>
where Idx: Hash,

1.26.0 · Source§

impl<Idx> Hash for RangeToInclusive<Idx>
where Idx: Hash,

Source§

impl<Idx> Hash for core::range::Range<Idx>
where Idx: Hash,

Source§

impl<Idx> Hash for core::range::RangeFrom<Idx>
where Idx: Hash,

Source§

impl<Idx> Hash for core::range::RangeInclusive<Idx>
where Idx: Hash,

Source§

impl<Ix> Hash for petgraph::adj::EdgeIndex<Ix>
where Ix: Hash + IndexType,

Source§

impl<Ix> Hash for petgraph::graph_impl::EdgeIndex<Ix>
where Ix: Hash,

Source§

impl<Ix> Hash for NodeIndex<Ix>
where Ix: Hash,

Source§

impl<K, V> Hash for EnumMap<K, V>
where K: EnumArray<V>, V: Hash,

Source§

impl<K, V> Hash for indexmap::map::slice::Slice<K, V>
where K: Hash, V: Hash,

1.0.0 · Source§

impl<K, V, A> Hash for BTreeMap<K, V, A>
where K: Hash, V: Hash, A: Allocator + Clone,

Source§

impl<L, Pr, Po, Payload> Hash for Model<L, Pr, Po, Payload>
where L: Hash + Likelihood<Payload>, Pr: Hash + Prior, Po: Hash + Posterior, Payload: Hash + Default,

Source§

impl<L, R> Hash for Either<L, R>
where L: Hash, R: Hash,

Source§

impl<N> Hash for bio::utils::interval::Interval<N>
where N: Hash + Ord + Clone,

Source§

impl<N, D> Hash for ArrayBackedIntervalTree<N, D>
where N: Hash + Ord + Clone + Copy, D: Hash,

Source§

impl<N, D> Hash for IntervalTree<N, D>
where N: Hash + Ord + Clone, D: Hash,

Source§

impl<O> Hash for F32<O>
where O: Hash,

Source§

impl<O> Hash for F64<O>
where O: Hash,

Source§

impl<O> Hash for I16<O>
where O: Hash,

Source§

impl<O> Hash for I32<O>
where O: Hash,

Source§

impl<O> Hash for I64<O>
where O: Hash,

Source§

impl<O> Hash for I128<O>
where O: Hash,

Source§

impl<O> Hash for Isize<O>
where O: Hash,

Source§

impl<O> Hash for U16<O>
where O: Hash,

Source§

impl<O> Hash for U32<O>
where O: Hash,

Source§

impl<O> Hash for U64<O>
where O: Hash,

Source§

impl<O> Hash for U128<O>
where O: Hash,

Source§

impl<O> Hash for Usize<O>
where O: Hash,

1.41.0 · Source§

impl<Ptr> Hash for Pin<Ptr>
where Ptr: Deref, <Ptr as Deref>::Target: Hash,

Source§

impl<R> Hash for bio::io::fastq::Records<R>
where R: Hash + Read,

Source§

impl<R, S> Hash for Contig<R, S>
where R: Hash, S: Hash,

Source§

impl<R, S> Hash for Pos<R, S>
where R: Hash, S: Hash,

Source§

impl<R, S> Hash for Spliced<R, S>
where R: Hash, S: Hash,

Source§

impl<S, D> Hash for ArrayBase<S, D>
where D: Dimension, S: Data, <S as RawData>::Elem: Hash,

1.17.0 · Source§

impl<T> Hash for Bound<T>
where T: Hash,

1.0.0 · Source§

impl<T> Hash for Option<T>
where T: Hash,

1.36.0 · Source§

impl<T> Hash for Poll<T>
where T: Hash,

1.0.0 · Source§

impl<T> Hash for *const T
where T: ?Sized,

1.0.0 · Source§

impl<T> Hash for *mut T
where T: ?Sized,

1.0.0 · Source§

impl<T> Hash for &T
where T: Hash + ?Sized,

1.0.0 · Source§

impl<T> Hash for &mut T
where T: Hash + ?Sized,

1.0.0 · Source§

impl<T> Hash for [T]
where T: Hash,

1.0.0 · Source§

impl<T> Hash for (T₁, T₂, …, Tₙ)
where T: Hash + ?Sized,

This trait is implemented for tuples up to twelve items long.

1.19.0 · Source§

impl<T> Hash for Reverse<T>
where T: Hash,

1.0.0 · Source§

impl<T> Hash for PhantomData<T>
where T: ?Sized,

Source§

impl<T> Hash for PhantomContravariant<T>
where T: ?Sized,

Source§

impl<T> Hash for PhantomCovariant<T>
where T: ?Sized,

Source§

impl<T> Hash for PhantomInvariant<T>
where T: ?Sized,

1.20.0 · Source§

impl<T> Hash for ManuallyDrop<T>
where T: Hash + ?Sized,

1.21.0 · Source§

impl<T> Hash for Discriminant<T>

1.28.0 · Source§

impl<T> Hash for NonZero<T>

1.74.0 · Source§

impl<T> Hash for Saturating<T>
where T: Hash,

1.0.0 · Source§

impl<T> Hash for Wrapping<T>
where T: Hash,

1.25.0 · Source§

impl<T> Hash for NonNull<T>
where T: ?Sized,

Source§

impl<T> Hash for bio::pattern_matching::myers::long::Myers<T>
where T: Hash + BitVec,

Source§

impl<T> Hash for bio::pattern_matching::myers::simple::Myers<T>
where T: Hash + BitVec, <T as BitVec>::DistType: Hash,

Source§

impl<T> Hash for indexmap::set::slice::Slice<T>
where T: Hash,

Source§

impl<T> Hash for IJKW<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M2x2<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M2x3<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M2x4<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M2x5<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M2x6<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M3x2<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M3x3<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M3x4<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M3x5<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M3x6<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M4x2<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M4x3<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M4x4<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M4x5<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M4x6<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M5x2<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M5x3<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M5x4<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M5x5<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M5x6<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M6x2<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M6x3<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M6x4<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M6x5<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for M6x6<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for X<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for XY<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for XYZ<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for XYZW<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for XYZWA<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for XYZWAB<T>
where T: Hash + Scalar,

Source§

impl<T> Hash for Unit<T>
where T: Hash,

Source§

impl<T> Hash for Quaternion<T>
where T: Scalar + Hash,

Source§

impl<T> Hash for num_complex::Complex<T>
where T: Hash,

Source§

impl<T> Hash for num_complex::Complex<T>
where T: Hash,

Source§

impl<T> Hash for num_rational::Ratio<T>
where T: Clone + Integer + Hash,

Source§

impl<T> Hash for num_rational::Ratio<T>
where T: Clone + Integer + Hash,

Source§

impl<T> Hash for NotNan<T>
where T: Float,

Source§

impl<T> Hash for OrderedFloat<T>
where T: Float,

Source§

impl<T> Hash for Unalign<T>
where T: Unaligned + Hash,

1.0.0 · Source§

impl<T, A> Hash for Box<T, A>
where T: Hash + ?Sized, A: Allocator,

1.0.0 · Source§

impl<T, A> Hash for BTreeSet<T, A>
where T: Hash, A: Allocator + Clone,

1.0.0 · Source§

impl<T, A> Hash for LinkedList<T, A>
where T: Hash, A: Allocator,

1.0.0 · Source§

impl<T, A> Hash for VecDeque<T, A>
where T: Hash, A: Allocator,

1.0.0 · Source§

impl<T, A> Hash for Rc<T, A>
where T: Hash + ?Sized, A: Allocator,

Source§

impl<T, A> Hash for UniqueRc<T, A>
where T: Hash + ?Sized, A: Allocator,

1.0.0 · Source§

impl<T, A> Hash for Arc<T, A>
where T: Hash + ?Sized, A: Allocator,

Source§

impl<T, A> Hash for UniqueArc<T, A>
where T: Hash + ?Sized, A: Allocator,

1.0.0 · Source§

impl<T, A> Hash for Vec<T, A>
where T: Hash, A: Allocator,

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));
Source§

impl<T, C, const D: usize> Hash for Transform<T, C, D>

Source§

impl<T, D> Hash for OPoint<T, D>
where T: Scalar + Hash, D: DimName, DefaultAllocator: Allocator<T, D>,

1.0.0 · Source§

impl<T, E> Hash for Result<T, E>
where T: Hash, E: Hash,

Source§

impl<T, Op> Hash for FenwickTree<T, Op>
where T: Hash + Default + Ord, Op: Hash + PrefixOp<T>,

Source§

impl<T, R, C, S> Hash for Matrix<T, R, C, S>
where T: Scalar + Hash, R: Dim, C: Dim, S: RawStorage<T, R, C>,

Source§

impl<T, R, const D: usize> Hash for Isometry<T, R, D>
where T: Scalar + Hash, R: Hash, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer: Hash,

Source§

impl<T, R, const D: usize> Hash for Similarity<T, R, D>
where T: Scalar + Hash, R: Hash, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer: Hash,

Source§

impl<T, const D: usize> Hash for Rotation<T, D>
where T: Scalar + Hash, <DefaultAllocator as Allocator<T, Const<D>, Const<D>>>::Buffer: Hash,

Source§

impl<T, const D: usize> Hash for Translation<T, D>

1.0.0 · Source§

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));
Source§

impl<T, const N: usize> Hash for Simd<T, N>

Source§

impl<T, const R: usize, const C: usize> Hash for ArrayStorage<T, R, C>
where T: Hash,

Source§

impl<U> Hash for NInt<U>
where U: Hash + Unsigned + NonZero,

Source§

impl<U> Hash for PInt<U>
where U: Hash + Unsigned + NonZero,

Source§

impl<U, B> Hash for UInt<U, B>
where U: Hash, B: Hash,

Source§

impl<V> Hash for VecMap<V>
where V: Hash,

Source§

impl<V, A> Hash for TArr<V, A>
where V: Hash, A: Hash,

Source§

impl<Y, R> Hash for CoroutineState<Y, R>
where Y: Hash, R: Hash,

Source§

impl<const R: usize> Hash for Const<R>