Directories
¶
| Path | Synopsis |
|---|---|
|
Package ctrie provides an implementation of the Ctrie data structure, which is a concurrent, lock-free hash trie.
|
Package ctrie provides an implementation of the Ctrie data structure, which is a concurrent, lock-free hash trie. |
|
Package dtrie provides an implementation of the dtrie data structure, which is a persistent hash trie that dynamically expands or shrinks to provide efficient memory allocation.
|
Package dtrie provides an implementation of the dtrie data structure, which is a persistent hash trie that dynamically expands or shrinks to provide efficient memory allocation. |
|
Package xfast provides access to a sorted tree that treats integers as if they were words of m bits, where m can be 8, 16, 32, or 64.
|
Package xfast provides access to a sorted tree that treats integers as if they were words of m bits, where m can be 8, 16, 32, or 64. |
|
Package yfast implements a y-fast trie.
|
Package yfast implements a y-fast trie. |
Click to show internal directories.
Click to hide internal directories.