name mode size
.. 100644 6.97kB 100644 6.06kB 100644 3.14kB
# 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 []( 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`](dox/ | A growing, mutable map of pointers, indexed by a hash. A.k.a. hashtable, dictionary, maptable | [Example](tests/hashmap/example.c) [`mulle_concurrent_pointerarray`](dox/ | A growing array of pointers | [Example](tests/array/example.c) ### Platforms and Compilers All platforms and compilers supported by [mulle-c11](// and [mulle-thread](// ## Author [Nat!](// for [Mulle kybernetiK](// and [Codeon GmbH](//