Expand description
Associative Range Query Tree with dynamic allocation, supporting sparse initialization and persistence
Structs§
- Dynamic
Arq - A dynamic, and optionally persistent, associative range query data structure.
- Dynamic
ArqNode
Functions§
- first_
negative - An example of binary search to find the first position whose element is negative. The DynamicArq version works on trees of any size, not necessarily a power of two.