A node_cache maintains a std::queue of elements of type T. Each operation is protected by a lock.
More...
#include <_flow_graph_impl.h>
|
bool | empty () |
|
void | add (T &n) |
|
void | remove (T &n) |
|
void | clear () |
|
|
bool | internal_empty () |
|
size_type | internal_size () |
|
void | internal_push (T &n) |
|
T & | internal_pop () |
|
|
mutex_type | my_mutex |
|
std::queue< T *> | my_q |
|
template<typename T, typename M = spin_mutex>
class internal::node_cache< T, M >
A node_cache maintains a std::queue of elements of type T. Each operation is protected by a lock.
The documentation for this class was generated from the following file: