Re-exports§
pub use self::entry::Entry;Experimental pub use self::entry::OccupiedEntry;Experimental pub use self::entry::VacantEntry;Experimental pub use super::map::UnorderedKeyError;Experimental
Modules§
- entry 🔒
Structs§
- BTree
Set - An ordered set based on a B-Tree.
- Difference
- A lazy iterator producing elements in the difference of
BTreeSets. - Intersection
- A lazy iterator producing elements in the intersection of
BTreeSets. - Into
Iter - An owning iterator over the items of a
BTreeSetin ascending order. - Iter
- An iterator over the items of a
BTreeSet. - Range
- An iterator over a sub-range of items in a
BTreeSet. - Symmetric
Difference - A lazy iterator producing elements in the symmetric difference of
BTreeSets. - Union
- A lazy iterator producing elements in the union of
BTreeSets. - Cursor
Experimental - A cursor over a
BTreeSet. - Cursor
Mut Experimental - A cursor over a
BTreeSetwith editing operations. - Cursor
MutKey Experimental - A cursor over a
BTreeSetwith editing operations, and which allows mutating elements. - Extract
If Experimental - An iterator produced by calling
extract_ifon BTreeSet.