Is there a decent wait_any implementation using c++11's concurrency primitives?
or how to implement it in c++11's mutex, condition_variable, ... ?
What is the general idea and algorithms in implementing it, with not only c++11, but also native Linux system call and pthread?
The wait_any is waiting any futures in a vector/array to be available, or any of multiple condition_variables to be signaled, and etc...
when_any does not exist in C++ std.
Usually I end up using a producer-consumer queue of messages. Any of the suppiers can queue a message in the queue (like "I am ready").
Many threads waiting on many such queues ends up being very complex.
In effect, you build things out of the C++ std primitives, you don't directly use them in client code.
queue stuff very much, and I can put an index in the queue, and access the data via index in vector, to use future.get()
threaded_queue<T> somewhere on stackoverflow.threaded_queue<T>.You can only have polling (busy-wait) implementations of mutex and condition variables if they do not use OS facilities to deschedule the waiting thread off the CPU.
Also, without the OS involvement there can be no such things as robust mutex or priority inversion mitigation.
