3 ms·
They are good, but I note that there are now hash tables in Boost that may be even better. https://www.boost.org/doc/libs/develop/libs/unordered/doc/html/unord
by jeffbee 2y ago
They are good, but I note that there are now hash tables in Boost that may be even better.
https://www.boost.org/doc/libs/develop/libs/unordered/doc/html/unordered.html#buckets_fast_closed_addressing_implementation https://www.boost.org/doc/libs/develop/libs/unordered/doc/ht...
- spacechild1 2y agoThanks a lot! I have been looking for fast hashtables and I didn't know about Boost.Unordered. They even have concurrent (lockfree) versions!
- senderista 2y agoI didn't see a lock-free hashtable there. They describe a concurrent hashtable with fine-grained locking: https://www.boost.org/doc/libs/develop/libs/unordered/doc/html/unordered.html#structures_concurrent_containers https://www.boost.org/doc/libs/develop/libs/unordered/doc/ht...
- spacechild1 2y agoAh, I assumed it was lockfree. Thanks for the clarification.
- quotemstr 2y agoSure. Anything but the standard library. :-)