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

A set based on a B-Tree.

## Structs

BTreeSet | A set based on a B-Tree.
Difference | A lazy iterator producing elements in the difference of `BTreeSet`s.
Intersection | A lazy iterator producing elements in the intersection of `BTreeSet`s.
IntoIter | An owning iterator over the items of a `BTreeSet`.
Iter | An iterator over the items of a `BTreeSet`.
Range | An iterator over a sub-range of items in a `BTreeSet`.
SymmetricDifference | A lazy iterator producing elements in the symmetric difference of `BTreeSet`s.
Union | A lazy iterator producing elements in the union of `BTreeSet`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
+ / -
  Collapse/expand 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`)