Imperative containers are well-explored by C++'s std, and declarative containers by Okasaki's "Purely Functional Data Structures". But there's very little on transactional containers, and they prove to be a rich and nuanced topic given the goal of minimizing false dependencies.
-
-
Right. CRDTs relax traditional semantics to avoid contention. Maybe not exactly what you were asking but I think things must go in that direction when high perf is needed.
-
e.g. you could imagine an std::grow_only_vector that caches the lower bound of size() for bounds checks to avoid strict dependency there.
End of conversation
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.