Re:Show HN: Whirlwind – Async concurrent hashmap for Rust
by CyberDildonics on Tuesday November 05, 2024 @06:18PM
(#42056052)
Why would you use a b tree if you don't need sorting? It will not only be slower but require a lot more to make lock free (is this hash map lock free?).
[ Parent
| on HN ]
There are no comments on this comment yet.