Module collections::tree_mapExperimental [-]  [+] [src]

Structs

Entries

Lazy forward iterator over a map

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

TreeMap

This is implemented as an AA tree, which is a simplified variation of a red-black tree where red (horizontal) nodes can only be added as a right child. The time complexity is the same, and re-balancing operations are more frequent but also cheaper.

Type Definitions

Keys

TreeMap keys iterator.

Values

TreeMap values iterator.