| Interface | Description |
|---|---|
| ReversedRadixTree<O> |
API of a reversed radix tree, that is a tree which allows values to be looked up based on suffixes of the keys
with which they were associated, as well as based on exact matches for keys.
|
| Class | Description |
|---|---|
| ConcurrentReversedRadixTree<O> |
An implementation of
ReversedRadixTree which supports lock-free concurrent reads, and allows items to be added
to and to be removed from the tree atomically by background thread(s), without blocking reads. |
Copyright © 2024. All rights reserved.