| Interface | Description |
|---|---|
| IArtNode<V> | |
| LongObjConsumer<T> |
| Class | Description |
|---|---|
| ArtNode16<V> |
This node type is used for storing between 5 and
16 child pointers.
|
| ArtNode256<V> |
The largest node type is simply an array of 256
pointers and is used for storing between 49 and 256 entries.
|
| ArtNode4<V> |
The smallest node type can store up to 4 child
pointers and uses an array of length 4 for keys and another
array of the same length for pointers.
|
| ArtNode48<V> |
As the number of entries in a node increases,
searching the key array becomes expensive.
|
| LongAdaptiveRadixTreeMap<V> |
Adaptive Radix Tree (ART) Java implementation
|
| LongAdaptiveRadixTreeMap.Entry<V> |
Copyright © 2020. All rights reserved.