Module rustc_data_structures::stable_hasher
source · Macros
Implement HashStable by just calling
Hash::hash(). Also implement StableOrd for the type since
that has the same requirements.Structs
Controls what data we do or do not hash.
Whenever a
HashStable implementation caches its
result, it needs to include HashingControls as part
of the key, to ensure that it does not produce an incorrect
result (for example, using a Fingerprint produced while
hashing Spans when a Fingerprint without Spans is
being requested)When hashing something that ends up affecting properties like symbol names,
we want these symbol names to be calculated independently of other factors
like what architecture you’re compiling from.
Traits
Something that implements
HashStable<CTX> can be hashed in a way that is
stable across multiple compilation sessions.Trait for marking a type as having a sort order that is
stable across compilation session boundaries. More formally:
Implement this for types that can be turned into stable keys like, for
example, for DefId that can be converted to a DefPathHash. This is used for
bringing maps into a predictable order before hashing them.