Are there any plans to extend the intrusive library with lock-free data structures (stacks, FIFO queues)? I'm about to start writing my own lock-free classes and have thought that it'd be nice to include them in the intrusive library, if possible [I've gotten used to the interface, and I don't want to have different interfaces in my code]. My goals: - lock-free stack and queue - SMR (both described in "Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic Reads and Writes" by Maged M. Michael) - target platform: Solaris using atomic_ops (3C); possibly also inline ASM for SunCC I don't have neither time nor resources (nor will, for that matter) to make a full implementation that works on all platforms supported by Boost. Also, I do *not* want to use Boost.Thread. The code is parametrized by the following (all related to SMR): - number of participating threads (every "thread" must be associated with a unique integer starting from 0) - number of hazard pointers - batch size SMR also needs static storage accessed by all threads. Any suggestions are welcome.