Expand description

A hash set implemented as a HashMap where the value is ().

Modules

rayon-based parallel iterator types for hash sets. You will rarely need to interact with it directly unless you have need to name one of the iterator types.

Structs

A lazy iterator producing elements in the difference of HashSets.

A draining iterator over the items of a HashSet.

A draining iterator over entries of a HashSet which don’t satisfy the predicate f.

A hash set implemented as a HashMap where the value is ().

A lazy iterator producing elements in the intersection of HashSets.

An owning iterator over the items of a HashSet.

An iterator over the items of a HashSet.

A view into an occupied entry in a HashSet. It is part of the Entry enum.

A lazy iterator producing elements in the symmetric difference of HashSets.

A lazy iterator producing elements in the union of HashSets.

A view into a vacant entry in a HashSet. It is part of the Entry enum.

Enums

A view into a single entry in a set, which may either be vacant or occupied.