Module outils::tree::bst::aatree [−] [src]

AaTree<K, V> is an unweighted balanced binary search tree data structure.

Structs

AaTree<K, V> is a balanced binary search tree data structure. Its tree nodes are held in a memory arena and are addressed through their associated NodeIndex.

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
+: Expand all sections
-: Collapse 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)