| /oneTBB/src/tbb/ |
| H A D | mailbox.h | 171 bool empty() { in empty() function
225 bool empty() { in empty() function
|
| H A D | intrusive_list.h | 121 bool empty () const { return my_head.my_next_node == &my_head; } in empty() function
|
| H A D | task_stream.h | 228 bool empty() { in empty() function
|
| H A D | concurrent_monitor.h | 51 inline bool empty() const { return size() == 0; } in empty() function
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_cache_impl.h | 33 bool empty() { in empty() function
261 bool empty() { in empty() function
320 bool empty() { in empty() function
|
| H A D | _node_handle.h | 62 __TBB_nodiscard bool empty() const { return my_node == nullptr; } in empty() function
|
| H A D | _flow_graph_impl.h | 214 bool empty() const { return !my_first; } in empty() function
|
| H A D | _flow_graph_node_impl.h | 29 bool empty() const { in empty() function
|
| H A D | _concurrent_skip_list.h | 627 __TBB_nodiscard bool empty() const { in empty() function
673 bool empty() const { in empty() function
|
| H A D | _concurrent_queue_base.h | 468 bool empty() const { in empty() function
|
| H A D | _concurrent_unordered_base.h | 405 __TBB_nodiscard bool empty() const noexcept { return size() == 0; } in empty() function
710 bool empty() const { return my_begin_node == my_end_node; } in empty() function
|
| /oneTBB/test/conformance/ |
| H A D | conformance_task_group.cpp | 96 bool empty = (h == nullptr); variable
111 bool empty = ! static_cast<bool>(h); variable
|
| H A D | conformance_parallel_for.cpp | 73 bool empty() const {return size==0;} in empty() function in FooRange
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_sort.h | 123 bool empty() const { return size == 0; } in empty() function
|
| H A D | concurrent_queue.h | 214 __TBB_nodiscard bool empty() const { in empty() function
525 __TBB_nodiscard bool empty() const { in empty() function
|
| H A D | concurrent_priority_queue.h | 165 __TBB_nodiscard bool empty() const { return size() == 0; } in empty() function
|
| H A D | partitioner.h | 207 bool empty() const { return my_size == 0; } in empty() function
|
| H A D | concurrent_vector.h | 483 bool empty() const noexcept { in empty() function
|
| H A D | concurrent_hash_map.h | 509 bool empty() const { return my_begin == my_end; } in empty() function
|
| /oneTBB/examples/parallel_reduce/primes/ |
| H A D | primes.cpp | 200 bool empty() const { in empty() function in SieveRange
|
| /oneTBB/src/tbbmalloc/ |
| H A D | backend.h | 156 bool empty() const { return !head.load(std::memory_order_relaxed); } in empty() function
|
| /oneTBB/test/tbb/ |
| H A D | test_partitioner.h | 133 bool empty() const { return my_end == my_begin; } in empty() function
475 bool empty() const { in empty() function
|
| H A D | test_parallel_reduce.cpp | 460 bool empty() const {return begin==end;} in empty() function in MinimalRange
|
| /oneTBB/test/common/ |
| H A D | concepts_common.h | 109 bool empty() const requires (EnableEmpty == State::correct) { return true; } in empty() function
110 bool empty() requires (EnableEmpty == State::incorrect_constness) { return true; } in empty() function
111 Dummy empty() const requires (EnableEmpty == State::incorrect_return_type) { return Dummy{}; } in empty() function
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | polyover.cpp | 258 bool empty() const { in empty() function in blocked_range_with_maps
|