Expand description
OrderSet
is a hash table set where the iteration order of the items
is independent of the hash values of the items.
It is based on IndexSet
, and even shares many of the auxiliary types
like Slice
and all of the iterators.
Unlike IndexSet
, OrderSet
does consider the order for PartialEq
and Eq
, and it also implements PartialOrd
, Ord
, and Hash
.
Methods like OrderSet::remove
use IndexSet
’s “shift” semantics, so
they preserve the relative order of remaining entries.
Modules§
- rayon
rayon
Structs§
- A lazy iterator producing elements in the difference of
IndexSet
s. - A draining iterator over the items of an
IndexSet
. - A lazy iterator producing elements in the intersection of
IndexSet
s. - An owning iterator over the items of an
IndexSet
. - An iterator over the items of an
IndexSet
. - A hash set where the iteration order of the values is independent of their hash values.
- A dynamically-sized slice of values in an
IndexSet
. - A splicing iterator for
IndexSet
. - A lazy iterator producing elements in the symmetric difference of
IndexSet
s. - A lazy iterator producing elements in the union of
IndexSet
s.
Traits§
- Opt-in mutable access to
OrderSet
values.