Module extra::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

Difference	Lazy iterator producing elements in the set difference (in-order)
Intersection	Lazy iterator producing elements in the set intersection (in-order)
SymDifference	Lazy iterator producing elements in the set symmetric difference (in-order)
TreeMap
TreeMapIterator	Lazy forward iterator over a map
TreeMapMoveIterator	Lazy forward iterator over a map that consumes the map while iterating
TreeMapRevIterator	Lazy backward iterator over a map
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.
TreeSetIterator	Lazy forward iterator over a set
TreeSetRevIterator	Lazy backward iterator over a set
Union	Lazy iterator producing elements in the set intersection (in-order)