lock-free

A library for lock-free data structures.

Currently the library contains a Doubly-Linked List and a single-reader single-writer queue. DList is based on the paper Lock-free deques and doubly linked lists. A good description of SRSW queues can be found here

They doubly-linked list still needs a thorough review and some polishing. That said all unittests pass on X86_64, no warranty though!