Actually there’s a way, although I haven’t implemented it myself there’s a paper on a lock free map using hazard pointers from eminent C++ expert Andrei Alexandrescu.
More Related Contents:
- Lock-free Progress Guarantees in a circular buffer queue
- How can I sort a std::map first by value, then by key?
- Circular lock-free buffer
- How can I sort an STL map by value?
- Mixing two arrays by alternating elements two by two
- Map C++ Sort and Insert elements by value
- banker’s algorithm in c++
- What is the difference between palindrome permutation and permutation? [closed]
- Why can’t I compile an unordered_map with a pair as key?
- Sorting zipped (locked) containers in C++ using boost or the STL
- std::transform() and toupper(), no matching function
- Shared-memory IPC synchronization (lock-free)
- C++ string::find complexity
- How can I modify values in a map using range based for loop?
- insert vs emplace vs operator[] in c++ map
- Special simple random number generator
- TMP: how to generalize a Cartesian Product of Vectors?
- How can std::make_heap be implemented while making at most 3N comparisons?
- Writing a simple equation parser
- What is the right approach when using STL container for median calculation?
- Howto create combinations of several vectors without hardcoding loops in C++?
- how do you make a heterogeneous boost::map?
- Ways to do modulo multiplication with primitive types
- Removing ‘#include ‘ doesn’t break the code
- What would a std::map extended initializer list look like?
- Why Can’t I store references in a `std::map` in C++?
- Is it possible to map string to int faster than using hashmap?
- How to find Longest Common Substring using C++
- Is a memory barrier required to read a value that is atomically modified?
- Generate N random numbers within a range with a constant sum