27 template< typename T, typename M=spin_mutex >
38     void add( T &n ) {  in add()
43     void remove( T &n ) {  in remove()
46             T &s = internal_pop();  in remove()
61     std::queue< T * > my_q;
74     inline void internal_push( T &n )  {  in internal_push()
79     inline T &internal_pop() {  in internal_pop()
80         T *v = my_q.front();  in internal_pop()
88 template< typename T, typename M=spin_mutex >
89 class predecessor_cache : public node_cache< sender<T>, M > {
92     typedef T output_type;
146 template< typename T, typename M=spin_mutex >
147 class reservable_predecessor_cache : public predecessor_cache< T, M > {
150     typedef T output_type;
151     typedef sender<T> predecessor_type;
152     typedef receiver<T> successor_type;
155         : predecessor_cache<T,M>(owner), reserved_src(nullptr)  in reservable_predecessor_cache()
205         predecessor_cache<T, M>::reset();  in reset()
210         predecessor_cache<T, M>::clear();  in clear()
219 template<typename T, typename M=spin_rw_mutex >
226     typedef receiver<T> successor_type;
227     typedef receiver<T>* pointer_type;
228     typedef sender<T> owner_type;
270     virtual graph_task* try_put_task( const T& t ) = 0;
333 template<typename T, typename M=spin_rw_mutex>
334 class broadcast_cache : public successor_cache<T, M> {
335     typedef successor_cache<T, M> base_type;
337     typedef typename successor_cache<T,M>::successors_type successors_type;
346     graph_task* try_put_task( const T &t ) override {  in try_put_task()
370     bool gather_successful_try_puts( const T &t, graph_task_list& tasks ) {  in gather_successful_try_puts()
396 template<typename T, typename M=spin_rw_mutex >
397 class round_robin_cache : public successor_cache<T, M> {
398     typedef successor_cache<T, M> base_type;
401     typedef typename successor_cache<T,M>::successors_type successors_type;
414     graph_task* try_put_task( const T &t ) override {  in try_put_task()