A collection of Lock-Free (sometimes also Wait-Free) algorithms and datastructures
The Goal of this Crate is to provide a save, easy to use and fast implementation for a variety of different Lock-Free or Wait-Free datastructures.
Name | Default | Description --- | --- | --- hashtrie | true | Enables the Hash-Trie-Map implementation hazardptr | true | Enables the Hazard-Ptr implementation queues | true | Enables the different Queues implementation async | true | Enables async varients of different Datastructures full | true | Enables all Feature-Flags