lfbs

lib.rs:

Lock-free stack with batched pop.

No memory relamation scheme

Usually, lock-free data structures must be used with a memory reclamation scheme like epoch-based reclamation or hazard pointer to guarantee the safe removal from the data structure. This lock-free stack overcomes this limitation by not accessing any node in the data structure while performing the removal operation. The caveat is that it is no longer possible to remove a single element at a time; instead, every element in the stack will be removed at once.