Skip to content
📶 A lock- and wait-free hashtable (and an array too), written in C
C CMake Shell
Branch: release
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.mulle
cmake
dox
src
test
.gitignore
.travis.yml
CMakeLists.txt
LICENSE
README.md
RELEASENOTES.md
mulle-concurrent.sublime-project

README.md

mulle-concurrent

📶 A lock- and wait-free hashtable (and an array too), written in C

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
Build Status Mulle kybernetiK tag Build Status

Install

Manually

Install the prerequisites first:

Prerequisites
mulle-aba

Then build and install

mkdir build 2> /dev/null
(
   cd build ;
   cmake .. ;
   make install
)

Conveniently

Or let mulle-sde do it all for you.

Data structures

API Description Example
mulle_concurrent_hashmap A growing, mutable map of pointers, indexed by a hash. A.k.a. hashtable, dictionary, maptable Example
mulle_concurrent_pointerarray A growing array of pointers Example

Platforms and Compilers

All platforms and compilers supported by mulle-c11 and mulle-thread.

Author

Nat! for Mulle kybernetiK and Codeon GmbH

You can’t perform that action at this time.