Is there a production ready lock-free queue or hash implementation in C++ [closed]

by

As of 1.53, boost provides a set of lock free data structures, including queues, stacks and single-producer/single-consumer queues (i.e. ring buffers).

More Related Contents:

  1. c++ push reference node to stl list
  2. Erasing elements from a vector
  3. Concise explanation of reference collapsing rules requested: (1) A& & -> A& , (2) A& && -> A& , (3) A&& & -> A& , and (4) A&& && -> A&&
  4. Why are Standard iterator ranges [begin, end) instead of [begin, end]?
  5. Why do I get the same sequence for every run with std::random_device with mingw gcc4.8.1?
  6. When vectors are allocated, do they use memory on the heap or the stack?
  7. Nice way to append a vector to itself
  8. In STL maps, is it better to use map::insert than []?
  9. Where can I get a “useful” C++ binary search algorithm?
  10. Relative performance of std::vector vs. std::list vs. std::slist?
  11. std::sort does not always call std::swap
  12. Is std::vector copying the objects with a push_back?
  13. how-to initialize ‘const std::vector’ like a c array
  14. Is hash_map part of the STL?
  15. How to read a growing text file in C++?
  16. Why is value taking setter member functions not recommended in Herb Sutter’s CppCon 2014 talk (Back to Basics: Modern C++ Style)?
  17. Initial capacity of vector in C++
  18. Non-copyable elements in vector
  19. Circular lock-free buffer
  20. How to make elements of vector unique? (remove non adjacent duplicates)
  21. How does overloading of const and non-const functions work?
  22. How can I use Standard Library (STL) classes in my dll interface or ABI?
  23. Does boost have a datatype for set operations that is simpler than the STL?
  24. Memory allocation and deallocation across dll boundaries
  25. STL deque accessing by index is O(1)?
  26. Incrementing iterators: Is ++it more efficient than it++? [duplicate]
  27. Can std::vector emplace_back copy construct from an element of the vector itself?
  28. C++ template function compiles in header but not implementation
  29. Insert into an STL queue using std::copy
  30. Is a memory barrier required to read a value that is atomically modified?

Leave a Comment