Module set

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.

Structs

• Difference
  A lazy iterator producing elements in the difference of IndexSets.
• Drain
  A draining iterator over the items of an IndexSet.
• Intersection
  A lazy iterator producing elements in the intersection of IndexSets.
• IntoIter
  An owning iterator over the items of an IndexSet.
• Iter
  An iterator over the items of an IndexSet.
• OrderSet
  A hash set where the iteration order of the values is independent of their hash values.
• Slice
  A dynamically-sized slice of values in an IndexSet.
• Splice
  A splicing iterator for IndexSet.
• SymmetricDifference
  A lazy iterator producing elements in the symmetric difference of IndexSets.
• Union
  A lazy iterator producing elements in the union of IndexSets.

Traits

• MutableValues
  Opt-in mutable access to OrderSet values.