std::collections::hash_set - Rust
Description: A hash set implemented as a `HashMap` where the value is `()`.

## Module hash_set

1.0.0 · Source
Expand description

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

## Structs§

Difference
  A lazy iterator producing elements in the difference of `HashSet`s.
Drain
  A draining iterator over the items of a `HashSet`.
ExtractIf
  A draining, filtering iterator over the items of a `HashSet`.
HashSet
  A hash set implemented as a `HashMap` where the value is `()`.
Intersection
  A lazy iterator producing elements in the intersection of `HashSet`s.
IntoIter
  An owning iterator over the items of a `HashSet`.
Iter
  An iterator over the items of a `HashSet`.
SymmetricDifference
  A lazy iterator producing elements in the symmetric difference of `HashSet`s.
Union
  A lazy iterator producing elements in the union of `HashSet`s.
OccupiedEntryExperimental
  A view into an occupied entry in a `HashSet`. It is part of the `Entry` enum.
VacantEntryExperimental
  A view into a vacant entry in a `HashSet`. It is part of the `Entry` enum.

## Enums§

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