41     bool push( T& t ) {  in push()  argument
42         return this->push_back( t );  in push()
89     graph_task* try_put_task( const input_type& t) override {  in try_put_task()  argument
91             return try_put_task_impl(t, has_policy<lightweight, Policy>());  in try_put_task()
93             return try_put_task_impl(t, std::false_type());  in try_put_task()
161         operation_type(const input_type& e, op_type t) :  in operation_type()  argument
162             type(char(t)), elem(const_cast<input_type*>(&e)), bypass_t(nullptr) {}  in operation_type()
163         operation_type(op_type t) : type(char(t)), r(nullptr), bypass_t(nullptr) {}  in operation_type()  argument
261     graph_task* internal_try_put_bypass( const input_type& t ) {  in internal_try_put_bypass()  argument
262         operation_type op_data(t, tryput_bypass);  in internal_try_put_bypass()
270     graph_task* try_put_task_impl( const input_type& t, /*lightweight=*/std::true_type ) {  in try_put_task_impl()  argument
272             return apply_body_bypass(t);  in try_put_task_impl()
274             operation_type check_op(t, occupy_concurrency);  in try_put_task_impl()
277                 return apply_body_bypass(t);  in try_put_task_impl()
279             return internal_try_put_bypass(t);  in try_put_task_impl()
283     graph_task* try_put_task_impl( const input_type& t, /*lightweight=*/std::false_type ) {  in try_put_task_impl()  argument
285             return create_body_task(t);  in try_put_task_impl()
287             return internal_try_put_bypass(t);  in try_put_task_impl()
305 …graph_task* t = allocator.new_object<task_type>( my_graph_ref, allocator, *this, input, my_priorit…  in create_body_task()  local
307         return t;  in create_body_task()
332 …graph_task* t = allocator.new_object<task_type>( graph_reference(), allocator, *this, my_priority …  in create_forward_task()  local
334         return t;  in create_forward_task()
565 inline void check_task_and_spawn(graph& g, graph_task* t) {
566     if (t && t != SUCCESSFULLY_ENQUEUED) {
567         spawn_in_graph_arena(g, *t);
575     static graph_task* emit_this(graph& g, const T &t, P &p) {
577         graph_task* last_task = std::get<N-1>(p).try_put_task(std::get<N-1>(t));
579         return emit_element<N-1>::emit_this(g,t,p);
586     static graph_task* emit_this(graph& g, const T &t, P &p) {
587         graph_task* last_task = std::get<0>(p).try_put_task(std::get<0>(t));
685 …graph_task* t = allocator.new_object<task_type>( graph_reference(), allocator, *this, continue_msg…
687             return t;