| Package | Description |
|---|---|
| exchange.core2.collections.art |
| Modifier and Type | Class and Description |
|---|---|
class |
ArtNode16<V>
This node type is used for storing between 5 and
16 child pointers.
|
class |
ArtNode256<V>
The largest node type is simply an array of 256
pointers and is used for storing between 49 and 256 entries.
|
class |
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.
|
class |
ArtNode48<V>
As the number of entries in a node increases,
searching the key array becomes expensive.
|
| Modifier and Type | Method and Description |
|---|---|
IArtNode<V> |
IArtNode.put(long key,
int level,
V value) |
IArtNode<V> |
ArtNode48.put(long key,
int level,
V value) |
IArtNode<V> |
ArtNode4.put(long key,
int level,
V value) |
IArtNode<V> |
ArtNode256.put(long key,
int level,
V value) |
IArtNode<V> |
ArtNode16.put(long key,
int level,
V value) |
IArtNode<V> |
IArtNode.remove(long key,
int level) |
IArtNode<V> |
ArtNode48.remove(long key,
int level) |
IArtNode<V> |
ArtNode4.remove(long key,
int level) |
IArtNode<V> |
ArtNode256.remove(long key,
int level) |
IArtNode<V> |
ArtNode16.remove(long key,
int level) |
| Modifier and Type | Method and Description |
|---|---|
void |
LongAdaptiveRadixTreeMap.getOrInsertFromNode(IArtNode<V> node,
Supplier<V> supplier) |
Copyright © 2020. All rights reserved.