Trait tract_pulse::internal::tract_core::ops::nn::Hash 1.0.0[−][src]
pub trait Hash { fn hash<H>(&self, state: &mut H)
where
H: Hasher; fn hash_slice<H>(data: &[Self], state: &mut H)
where
H: Hasher, { ... } }
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)]
.
Required methods
Provided methods
1.3.0[src]fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
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::collections::hash_map::DefaultHasher; use std::hash::{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());
Implementations on Foreign Types
The hash of an array is the same as that of the corresponding slice,
as required by the Borrow
implementation.
#![feature(build_hasher_simple_hash_one)] use std::hash::BuildHasher; let b = std::collections::hash_map::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));
impl<O, T> Hash for BitVec<O, T> where
O: BitOrder,
T: BitStore,
impl<O, T> Hash for BitVec<O, T> where
O: BitOrder,
T: BitStore,
impl<O, T> Hash for BitSlice<O, T> where
O: BitOrder,
T: BitStore,
impl<O, T> Hash for BitSlice<O, T> where
O: BitOrder,
T: BitStore,
Writes the contents of the BitSlice
, in semantic bit order, into a hasher.
impl<O, T> Hash for BitBox<O, T> where
O: BitOrder,
T: BitStore,
impl<O, T> Hash for BitBox<O, T> where
O: BitOrder,
T: BitStore,
impl<O, V> Hash for BitArray<O, V> where
O: BitOrder,
V: BitView,
impl<O, V> Hash for BitArray<O, V> where
O: BitOrder,
V: BitView,
Implementors
impl Hash for AttrOrInput
impl Hash for Validation
impl Hash for ConcatSlice
impl Hash for KernelFormat
impl Hash for PaddingSpec
impl Hash for ProtoFusedSpec
impl Hash for InputMapping
impl Hash for StateInitializer
impl Hash for tract_pulse::internal::tract_core::ops::nn::DataFormat
impl Hash for tract_pulse::internal::tract_core::ops::nn::tract_downcast_rs::__std::sync::atomic::Ordering
impl Hash for MatrixStoreSpec
impl Hash for FiniteReshape
impl Hash for GatherElements
impl Hash for MultiBroadcastTo
impl Hash for ScatterElements
impl Hash for TypedConcat
impl Hash for MergeOpUnicast
impl Hash for TypedBinOp
impl Hash for ConcretePoolGeometry
impl Hash for SymbolicPoolGeometry
impl Hash for DeconvUnary
impl Hash for ElementWiseOp
impl Hash for GreaterEqual
impl Hash for LesserEqual
impl Hash for FlippedPow
impl Hash for FlippedShiftLeft
impl Hash for FlippedShiftRight
impl Hash for RoundHalfToEven
impl Hash for ShiftRight
impl Hash for ConcreteMatMulGeometry
impl Hash for LirMatMulUnary
impl Hash for SymbolicMatMulGeometry
impl Hash for QMatMulUnary
impl Hash for MatMatMulPack
impl Hash for MatMulQParams
impl Hash for MatMulUnary
impl Hash for DequantizeLinearF32
impl Hash for LookupTable
impl Hash for QuantizeLinearI8
impl Hash for QuantizeLinearU8
impl Hash for TypedSource
impl Hash for Downsample
impl Hash for UnimplementedOp
impl Hash for Box<dyn ElementWiseMiniOp + 'static, Global>
impl<F> Hash for OutputMapping<F> where
F: Hash + Clone,
impl<F, O> Hash for Graph<F, O> where
O: Debug + Display + AsRef<dyn Op + 'static> + AsMut<dyn Op + 'static> + Clone + 'static + Hash,
F: Fact + Hash + Clone + 'static,
impl<F, O, M> Hash for SimplePlan<F, O, M> where
O: Debug + Display + AsRef<dyn Op + 'static> + AsMut<dyn Op + 'static> + Clone + 'static + Hash,
F: Fact + Hash + Clone + 'static,
M: Borrow<Graph<F, O>> + Hash,
impl<Symbolic, Concrete> Hash for GeometryBound<Symbolic, Concrete> where
Symbolic: Hash,
Concrete: Hash,