I wrote something fun during my week off: a concurrent map & set. https://gitlab.com/boats/skiplist/tree/master …
Can I read somewhere more about this? I'd be curious what were the requirements exactly.
-
-
It was while implementing this: https://github.com/servo/servo/blob/master/components/style/rule_tree/mod.rs … Basically you have a simple tree of nodes representing rules you populate and read from multiple threads. ensure_child and reads happen in parallel, gc can happen on the main thread, once the thread pool is done styling.
-
So if I got this right, this is a lock-free singly-linked list used as a map keyed by (level, source), and you wanted to turn it into a hash table to speed up lookup/insert? And presumably you didn't need it because the lists are reasonably short anyways (now I'm just guessing)?
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.