# 1.0.0[−][src]Module std::collections::hash_set

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`.
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.

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g., `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g., `vec -> usize` or `* -> vec`)

Search multiple things at once by splitting your query with comma (e.g., `str,u8` or `String,struct:Vec,test`)