Module collections::treemap

An ordered map and set implemented as self-balancing binary search trees. The only requirement for the types is that the key implements TotalOrd.

Structs

DifferenceItems	Lazy iterator producing elements in the set difference (in-order)
Entries	Lazy forward iterator over a map
IntersectionItems	Lazy iterator producing elements in the set intersection (in-order)
MoveEntries	Lazy forward iterator over a map that consumes the map while iterating
MutEntries	Lazy forward iterator over a map that allows for the mutation of the values.
RevEntries	Lazy backward iterator over a map
RevMutEntries	Lazy backward iterator over a map
RevSetItems	Lazy backward iterator over a set
SetItems	Lazy forward iterator over a set
SymDifferenceItems	Lazy iterator producing elements in the set symmetric difference (in-order)
TreeMap
TreeSet	A implementation of the `Set` trait on top of the `TreeMap` container. The only requirement is that the type of the elements contained ascribes to the `TotalOrd` trait.
UnionItems	Lazy iterator producing elements in the set intersection (in-order)