Module unord 

This module contains collection types that don’t expose their internal ordering. This is a useful property for deterministic computations, such as required by the query system.

Re-exports

use std::borrow::Borrow; 🔒

use std::borrow::BorrowMut; 🔒

use std::collections::hash_map::Entry; 🔒

use std::collections::hash_map::OccupiedError; 🔒 Experimental

use std::hash::Hash; 🔒

use std::hash::Hash; 🔒

use std::iter::Product; 🔒

use std::iter::Sum; 🔒

use std::ops::Index; 🔒

use rustc_macros::Decodable_NoContext; 🔒

use rustc_macros::Encodable_NoContext; 🔒

use crate::fingerprint::Fingerprint; 🔒

use crate::fx::FxBuildHasher; 🔒

use crate::fx::FxHashMap; 🔒

use crate::fx::FxHashSet; 🔒

use crate::stable_hash::StableCompare; 🔒

use crate::stable_hash::StableHash; 🔒

use crate::stable_hash::StableHashCtxt; 🔒

use crate::stable_hash::StableHasher; 🔒

use crate::stable_hash::ToStableHashKey; 🔒

Structs

UnordBag

This is a collection type that tries very hard to not expose any internal iteration. This is a useful property when trying to uphold the determinism invariants imposed by the query system.

UnordItems

UnordItems is the order-less version of Iterator. It only contains methods that don’t (easily) expose an ordering of the underlying items.

UnordMap

This is a map collection type that tries very hard to not expose any internal iteration. This is a useful property when trying to uphold the determinism invariants imposed by the query system.

UnordSet

This is a set collection type that tries very hard to not expose any internal iteration. This is a useful property when trying to uphold the determinism invariants imposed by the query system.

Traits

ExtendUnord

UnordCollection 🔒

A marker trait specifying that Self can consume UnordItems<_> without exposing any internal ordering.

Functions

hash_iter_order_independent 🔒

to_sorted_vec 🔒