| 接口 | 说明 |
|---|---|
| Shuttle |
| 类 | 说明 |
|---|---|
| AbstractShuttle |
visit the art tree's space through a stack which records the deep first visiting paths.
|
| Art |
See: https://db.in.tum.de/~leis/papers/ART.pdf a cpu cache friendly main memory data structure.
|
| BackwardShuttle |
visit the leaf node space in descending order
|
| ContainerIterator | |
| Containers |
To support the largest 2^48 different keys,we almost need 2^18 Container arrays which holds 2^31
- 8 Container
|
| ForwardShuttle |
visit the leaf node space in ascending order.
|
| KeyIterator | |
| LeafNode | |
| LeafNodeIterator | |
| Node | |
| Node16 | |
| Node256 | |
| Node4 | |
| Node48 |
| 枚举 | 说明 |
|---|---|
| NodeType |