Concurrent trie-hash map library -- a general purpose associative array, combining the elements of hashing and radix trie. Highlights: * Very competitive performance, with logarithmic time complexity on average. * Lookups are lock-free and inserts/deletes are using fine-grained locking. * Incremental growth of the data structure (no large resizing/rehashing). * Optional support for use with shared memory, e.g. memory-mapped file. The implementation is written in C11 and distributed under the 2-clause BSD license. WWW: https://github.com/rmind/thmap Will be used by npf port.
3 lines
200 B
Text
3 lines
200 B
Text
TIMESTAMP = 1558679673
|
|
SHA256 (rmind-thmap-g2019052401-0f1cbfc_GH0.tar.gz) = a618091195b47b7f1ba474f9b4ec60583031956060268ff66a56260d5d5f55a0
|
|
SIZE (rmind-thmap-g2019052401-0f1cbfc_GH0.tar.gz) = 22315
|