| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_sort.h | 36 template <typename Compare, typename Iterator> 58 template<typename RandomAccessIterator, typename Compare> 116 const Compare& comp; 136 template<typename RandomAccessIterator, typename Compare> 138 const Compare& comp; 167 template<typename RandomAccessIterator, typename Compare> 176 template<typename RandomAccessIterator, typename Compare> 185 template<typename RandomAccessIterator, typename Compare> 234 template<typename RandomAccessIterator, typename Compare> 261 template<typename Range, typename Compare> [all …]
|
| H A D | concurrent_set.h | 51 template <typename Key, typename Compare, typename Allocator> 54 template <typename Key, typename Compare = std::less<Key>, typename Allocator = tbb::tbb_allocator<… 62 using key_compare = Compare; 148 template <typename Key, typename Compare, typename Allocator> 149 void swap( concurrent_set<Key, Compare, Allocator>& lhs, in swap() argument 150 concurrent_set<Key, Compare, Allocator>& rhs ) in swap() 155 template <typename Key, typename Compare = std::less<Key>, typename Allocator = tbb::tbb_allocator<… 163 using key_compare = Compare; 248 template <typename Key, typename Compare, typename Allocator> 249 void swap( concurrent_multiset<Key, Compare, Allocator>& lhs, in swap() argument [all …]
|
| H A D | concurrent_map.h | 67 template <typename Key, typename Value, typename Compare, typename Allocator> 72 …using base_type = concurrent_skip_list<map_traits<Key, Value, Compare, concurrent_geometric_level_… 79 using key_compare = Compare; 213 template <typename Key, typename Value, typename Compare, typename Allocator> 214 void swap( concurrent_map<Key, Value, Compare, Allocator>& lhs, in swap() argument 215 concurrent_map<Key, Value, Compare, Allocator>& rhs ) in swap() 222 …using base_type = concurrent_skip_list<map_traits<Key, Value, Compare, concurrent_geometric_level_… 229 using key_compare = Compare; 331 template <typename Key, typename Value, typename Compare, typename Allocator> 332 void swap( concurrent_multimap<Key, Value, Compare, Allocator>& lhs, in swap() argument [all …]
|
| H A D | concurrent_priority_queue.h | 40 template <typename T, typename Compare = std::less<T>, typename Allocator = cache_aligned_allocator… 60 …explicit concurrent_priority_queue( const Compare& compare, const allocator_type& alloc = allocato… 73 …explicit concurrent_priority_queue( size_type init_capacity, const Compare& compare, const allocat… 81 …concurrent_priority_queue( InputIterator begin, InputIterator end, const Compare& compare, const a… 91 : concurrent_priority_queue(begin, end, Compare(), alloc) {} in concurrent_priority_queue() argument 97 : concurrent_priority_queue(init, Compare(), alloc) {} in concurrent_priority_queue() argument 403 Compare my_compare; 406 char padding2[max_nfs_size - (2*sizeof(size_type)) - sizeof(Compare)]; 475 template <typename T, typename Compare, typename Allocator> 476 void swap( concurrent_priority_queue<T, Compare, Allocator>& lhs, in swap() argument [all …]
|
| H A D | flow_graph.h | 1657 template<typename T, typename Compare = std::less<T>> 1668 __TBB_NOINLINE_SYM explicit priority_queue_node( graph &g, const Compare& comp = Compare() ) 1677 priority_queue_node(const node_set<Args...>& nodes, const Compare& comp = Compare()) 1780 Compare compare; 3246 template <typename T, typename Compare> 3247 inline void set_name(const priority_queue_node<T, Compare>& node, const char *name) { in set_name()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _containers_helpers.h | 30 template <typename Compare, typename = void> 33 template <typename Compare> 34 struct comp_is_transparent<Compare, tbb::detail::void_t<typename Compare::is_transparent>> : std::t…
|
| H A D | _flow_graph_nodes_deduction.h | 140 template <typename NodeSet, typename Compare> 141 priority_queue_node(const NodeSet&, const Compare&) 142 ->priority_queue_node<decide_on_set_t<NodeSet>, Compare>;
|
| /oneTBB/doc/main/reference/ |
| H A D | parallel_sort_ranges_extension.rst | 37 template <typename Container, typename Compare> 38 void parallel_sort( Container&& c, const Compare& comp ); 50 …nction:: template <typename Container, typename Compare> void parallel_sort( Container&& c, const …
|
| H A D | constructors_for_nodes.rst | 75 explicit priority_queue_node(follows(...), const Compare& comp = Compare()); 76 explicit priority_queue_node(precedes(...), const Compare& compare = Compare());
|
| /oneTBB/test/tbb/ |
| H A D | test_parallel_sort.cpp | 105 template <typename RandomAccessIterator, typename Compare> 107 std::size_t size, const Compare &compare) { in fill_ranges() 208 template <typename RandomAccessIterator, typename Compare> 209 …llel_sort_with_iterator_and_compare = requires( RandomAccessIterator it, const Compare& compare ) { 218 template <typename CBS, typename Compare> 219 concept can_call_parallel_sort_with_cbs_and_compare = requires( CBS& cbs, const Compare& compare ) {
|
| /oneTBB/test/common/ |
| H A D | concurrent_priority_queue_common.h | 30 template <typename ElementType, typename Compare, typename Allocator> 31 std::vector<ElementType> toVector( const tbb::concurrent_priority_queue<ElementType, Compare, Alloc… in toVector() argument 98 template <typename ValueType, typename Compare> 99 void type_tester( const std::vector<ValueType>& vec, Compare comp ) { in type_tester() 100 using queue_type = tbb::concurrent_priority_queue<ValueType, Compare>; in type_tester()
|
| H A D | concepts_common.h | 405 struct Compare { struct 412 template <typename T> using Correct = Compare<T, /*() = */State::correct>; argument 413 template <typename T> using NoOperatorRoundBrackets = Compare<T, /*() = */State::not_defined>; 414 template <typename T> using WrongFirstInputOperatorRoundBrackets = Compare<T, /*() = */State::incor… 415 template <typename T> using WrongSecondInputOperatorRoundBrackets = Compare<T, /*() = */State::inco… 416 template <typename T> using WrongReturnOperatorRoundBrackets = Compare<T, /*() = */State::incorrect…
|
| /oneTBB/src/tbbmalloc/ |
| H A D | tbbmalloc_internal.h | 161 template<typename Arg, typename Compare> 162 inline void AtomicUpdate(std::atomic<Arg>& location, Arg newVal, const Compare &cmp) in AtomicUpdate()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_hash_map.cpp | 1092 using Compare = debug_hash_compare<Key>; in TestDeductionGuides() typedef 1098 Compare compare; in TestDeductionGuides() 1107 static_assert(std::is_same<decltype(m2), TMap<Key, Value, Compare>>::value); in TestDeductionGuides() 1111 static_assert(std::is_same<decltype(m3), TMap<Key, Value, Compare, Allocator>>::value); in TestDeductionGuides() 1123 static_assert(std::is_same<decltype(m6), TMap<Key, Value, Compare, DefaultAllocator>>::value); in TestDeductionGuides() 1127 static_assert(std::is_same<decltype(m7), TMap<Key, Value, Compare, Allocator>>::value); in TestDeductionGuides()
|