Dmitry Galchinsky

It is ~4600 ms after fixing, caching reduces the time to ~4300. 6% not so bad. I made a [RAII-version](https://github.com/galchinsky/clay/commits/accumulatingTimer) of a timer

What about operator overloading? Compiler gives a list of detected capturings to an operator and really puts in lambda what operator returned. ``` (->)(forward ..x) = ..x; (#>)(..x) = move(..x);...

To reproduce: ``` #include #include #include "SPSCQueue.h" int main() { rigtorp::SPSCQueue< int > queue(16); for (int j = 0; j < 6; ++j) { queue.emplace(0); } for (int j =...

@Philippe91 it's a simple single-threaded example with a few push and a few pop operations, I don't think CPU can make a difference here.

I just moved to Facebook's queue, because who knows are there any other bugs like that

I don't remember the details (even where the assertion got triggered), but here are 3 chunks of code I had before moving to the facebook's queue, and checking for front...