Skip to main content

Hash

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".

Implementors§

1.29.0 · Source§

impl Hash for !

1.0.0 · Source§

impl Hash for ()

Source§

impl Hash for Alignment

Source§

impl Hash for AsciiChar

Source§

impl Hash for Authority

Case-insensitive hashing

§Examples


let a: Authority = "HELLO.com".parse().unwrap();
let b: Authority = "hello.coM".parse().unwrap();

let mut s = DefaultHasher::new();
a.hash(&mut s);
let a = s.finish();

let mut s = DefaultHasher::new();
b.hash(&mut s);
let b = s.finish();

assert_eq!(a, b);
Source§

impl Hash for BitBoard

Source§

impl Hash for BoardStatus

Source§

impl Hash for ByteStr

Source§

impl Hash for ByteString

Source§

impl Hash for Bytes

Source§

impl Hash for BytesMut

1.64.0 · Source§

impl Hash for CStr

1.64.0 · Source§

impl Hash for CString

Source§

impl Hash for CastleMoveType

Source§

impl Hash for CastleRights

Source§

impl Hash for CharCase

Source§

impl Hash for ChessPosition

Source§

impl Hash for CloseEvent

Source§

impl Hash for Color

1.3.0 · Source§

impl Hash for Duration

1.0.0 · Source§

impl Hash for Error

1.0.0 · Source§

impl Hash for ErrorKind

Source§

impl Hash for FieldId

Source§

impl Hash for File

1.1.0 · Source§

impl Hash for FileType

Source§

impl Hash for GameResult

Source§

impl Hash for GoCommand

Source§

impl Hash for HandlerId

Source§

impl Hash for HeaderName

Source§

impl Hash for HeaderValue

Source§

impl Hash for IdentityHasher

1.44.0 · Source§

impl Hash for Infallible

1.8.0 · Source§

impl Hash for Instant

1.55.0 · Source§

impl Hash for IntErrorKind

1.7.0 · Source§

impl Hash for IpAddr

1.0.0 · Source§

impl Hash for Ipv4Addr

1.0.0 · Source§

impl Hash for Ipv6Addr

Source§

impl Hash for Ipv6MulticastScope

1.28.0 · Source§

impl Hash for Layout

Source§

impl Hash for Locality

1.10.0 · Source§

impl Hash for Location<'_>

Source§

impl Hash for Map<String, Value>

Source§

impl Hash for Method

Source§

impl Hash for Move

Source§

impl Hash for MoveType

Source§

impl Hash for Number

1.0.0 · Source§

impl Hash for timecat::Ordering

1.0.0 · Source§

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

1.0.0 · Source§

impl Hash for OsStr

1.0.0 · Source§

impl Hash for OsString

1.0.0 · Source§

impl Hash for Path

Source§

impl Hash for PathAndQuery

1.0.0 · Source§

impl Hash for PathBuf

1.33.0 · Source§

impl Hash for PhantomPinned

Source§

impl Hash for Piece

Source§

impl Hash for PieceType

1.0.0 · Source§

impl Hash for PrefixComponent<'_>

Source§

impl Hash for PyBackedBytes

Source§

impl Hash for PyBackedStr

1.0.0 · Source§

impl Hash for RangeFull

Source§

impl Hash for Rank

Source§

impl Hash for Scheme

Case-insensitive hashing

1.0.0 · Source§

impl Hash for SocketAddr

1.0.0 · Source§

impl Hash for SocketAddrV4

1.0.0 · Source§

impl Hash for SocketAddrV6

Source§

impl Hash for Square

Source§

impl Hash for State

Source§

impl Hash for StatusCode

1.0.0 · Source§

impl Hash for String

1.8.0 · Source§

impl Hash for SystemTime

1.19.0 · Source§

impl Hash for ThreadId

Source§

impl Hash for TimecatError

Source§

impl Hash for TimedGoCommand

1.0.0 · Source§

impl Hash for TypeId

Source§

impl Hash for UCred

Source§

impl Hash for Uri

Source§

impl Hash for ValidOrNullMove

Source§

impl Hash for Value

Source§

impl Hash for Version

Source§

impl Hash for WeightedMove

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.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 usize

1.0.0 · Source§

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

Source§

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

Source§

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

Source§

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

1.0.0 · Source§

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

Source§

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

1.55.0 · Source§

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

1.0.0 · Source§

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

Source§

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

1.4.0 · Source§

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

1.0.0 · Source§

impl<Idx> Hash for timecat::Range<Idx>
where Idx: Hash,

1.96.0 · Source§

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

1.0.0 · Source§

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

1.96.0 · Source§

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

1.26.0 · Source§

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

1.95.0 · Source§

impl<Idx> Hash for core::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 core::ops::range::RangeToInclusive<Idx>
where Idx: Hash,

1.96.0 · Source§

impl<Idx> Hash for core::range::RangeToInclusive<Idx>
where Idx: 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, R> Hash for Either<L, R>
where L: Hash, R: Hash,

1.41.0 · Source§

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

1.0.0 · Source§

impl<T, A> Hash for Arc<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 Box<T, A>
where T: Hash + ?Sized, A: Allocator,

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 Rc<T, A>
where T: Hash + ?Sized, A: Allocator,

Source§

impl<T, A> Hash for UniqueArc<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 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));
1.0.0 · Source§

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

1.0.0 · Source§

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

Source§

impl<T, const CAP: usize> Hash for ArrayVec<T, CAP>
where T: Hash,

Source§

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

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 VARIANT: u32, const FIELD: u32> Hash for FieldRepresentingType<T, VARIANT, FIELD>
where T: ?Sized,

Source§

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

Source§

impl<T: Hash> Hash for BinaryMagic<T>

Source§

impl<T: Hash> Hash for CustomDebug<T>

Source§

impl<T: Hash> Hash for SerdeWrapper<T>

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₁, T₂, …, Tₙ)
where T: Hash,

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

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.17.0 · Source§

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

1.21.0 · Source§

impl<T> Hash for Discriminant<T>

1.20.0 · Source§

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

1.25.0 · Source§

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

1.28.0 · Source§

impl<T> Hash for NonZero<T>

1.0.0 · Source§

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

Source§

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

Source§

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

1.0.0 · Source§

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

Source§

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

1.36.0 · Source§

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

1.19.0 · Source§

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

1.74.0 · Source§

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

Source§

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

1.0.0 · Source§

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

1.0.0 · Source§

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

Source§

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

Source§

impl<const CAP: usize> Hash for ArrayString<CAP>