mulle-concurrent is a library for lock- and wait-free data structures. Wait-freeness is a desirable property for "hotly" contested data structures in multi-threaded environments.
Many of the ideas are taken from Preshing on Programming: A Resizable, Concurrent Map. The definition of concurrent and wait-free are from concurrencyfreaks.blogspot.de
|Build Status||Release Version|
Install the prerequisites first:
Then build and install
mkdir build 2> /dev/null ( cd build ; cmake .. ; make install )
Or let mulle-sde do it all for you.
||A growing, mutable map of pointers, indexed by a hash. A.k.a. hashtable, dictionary, maptable||Example|
||A growing array of pointers||Example|