Home
last modified time | relevance | path

Searched refs:Value (Results 1 – 25 of 29) sorted by relevance

12

/oneTBB/include/oneapi/tbb/
H A Dparallel_reduce.h50 template <typename Combine, typename Value>
52 const Value&, const Value&> &&
54 … const Value&, const Value&>,
373 const Value& my_identity_element;
376 Value my_value;
399 Value result() const { in result()
525 Value parallel_reduce( const Range& range, const Value& identity, const RealBody& real_body, const … in __TBB_requires()
538 Value parallel_reduce( const Range& range, const Value& identity, const RealBody& real_body, const … in __TBB_requires()
551 Value parallel_reduce( const Range& range, const Value& identity, const RealBody& real_body, const … in __TBB_requires()
564 Value parallel_reduce( const Range& range, const Value& identity, const RealBody& real_body, const … in __TBB_requires()
[all …]
H A Dblocked_range.h42 template<typename Value>
43 __TBB_requires(blocked_range_value<Value>) in __TBB_requires() argument
49 using const_iterator = Value; in __TBB_requires()
55 blocked_range( Value begin_, Value end_, size_type grainsize_=1 ) : in __TBB_requires()
114 Value my_end; in __TBB_requires()
115 Value my_begin; in __TBB_requires()
119 static Value do_split( blocked_range& r, split ) in __TBB_requires()
122 Value middle = r.my_begin + (r.my_end - r.my_begin) / 2u; in __TBB_requires()
127 static Value do_split( blocked_range& r, proportional_split& proportion ) in __TBB_requires()
139 return r.my_end = Value(r.my_end - right_part); in __TBB_requires()
H A Dparallel_scan.h66 template <typename Function, typename Range, typename Value>
73 template <typename Combine, typename Value>
75 const Value&, const Value&> &&
77 … const Value&, const Value&>,
78 Value>;
502 Value m_sum_slot;
503 const Value& identity_element;
535 Value result() const { in result()
589 Value parallel_scan( const Range& range, const Value& identity, const Scan& scan, const ReverseJoin… in __TBB_requires()
600 Value parallel_scan( const Range& range, const Value& identity, const Scan& scan, const ReverseJoin… in __TBB_requires()
[all …]
H A Dblocked_rangeNd.h52 template<typename Value, unsigned int N, typename = detail::make_index_sequence<N>>
53 __TBB_requires(blocked_range_value<Value>)
56 template<typename Value, unsigned int N, std::size_t... Is>
57 __TBB_requires(blocked_range_value<Value>) in __TBB_requires() argument
58 class blocked_rangeNd_impl<Value, N, detail::index_sequence<Is...>> { in __TBB_requires()
61 using value_type = Value; in __TBB_requires()
135 template<typename Value, unsigned int N>
136 using blocked_rangeNd = blocked_rangeNd_impl<Value, N>;
H A Dconcurrent_map.h37 using mapped_type = Value;
67 template <typename Key, typename Value, typename Compare, typename Allocator>
70 …ypename Key, typename Value, typename Compare = std::less<Key>, typename Allocator = tbb::tbb_allo…
75 using mapped_type = Value;
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()
220 …ypename Key, typename Value, typename Compare = std::less<Key>, typename Allocator = tbb::tbb_allo…
225 using mapped_type = Value;
332 void swap( concurrent_multimap<Key, Value, Compare, Allocator>& lhs, in swap() argument
[all …]
H A Denumerable_thread_specific.h343 template< typename Container, typename Value >
350 mutable Value *my_value;
370 using value_type = Value;
371 using pointer = Value*;
372 using reference = Value&;
409 Value& operator*() const {
410 Value* value = my_value;
418 Value& operator[]( std::ptrdiff_t k ) const {
523 using value_type = Value;
525 using pointer = Value*;
[all …]
H A Dconcurrent_queue.h253 template <typename Container, typename Value, typename A>
654 template <typename Container, typename Value, typename A>
H A Dconcurrent_hash_map.h371 template <typename Container, typename Value>
379 using value_type = Value;
403 Value& operator*() const {
408 Value* operator->() const {return &operator*();}
591 template <typename Container, typename Value> in __TBB_requires()
/oneTBB/test/common/
H A Dtest_invoke.h33 template <typename Value>
35 using base_range = oneapi::tbb::blocked_range<Value>;
37 …SmartRange(const Value& first, const Value& last) : base_range(first, last), change_vector(nullptr… in SmartRange()
38 SmartRange(const Value& first, const Value& last, std::vector<std::size_t>& cv) in SmartRange()
52 Value reduction(const Value& idx) const { in reduction()
53 Value result = idx; in reduction()
55 result = result + Value(index); in reduction()
57 return Value(result); in reduction()
60 Value scan(const Value& idx, bool is_final_scan) const { in scan()
62 Value result = idx; in scan()
[all …]
H A Dconcurrent_associative_common.h59 static Value make( const Key& key ) { return Value(key, key); } in make()
60 static Value make( const Key& key, const Key& mapped ) { return Value(key, mapped); } in make()
401 cont.insert(Value<T>::make(1));
402 cont.insert(Value<T>::make(2));
411 cont4.insert(Value<T>::make(1));
571 cont.insert(Value<T>::make(3));
592 newcont.insert( { Value<T>::make( 1 ), Value<T>::make( 2 ), Value<T>::make( 1 ) } );
711 … auto init = { Value<Container>::make(1), Value<Container>::make(1), Value<Container>::make(1) };
715 auto init = { Value<Container>::make(i), Value<Container>::make(i + 2),
1104 template <typename Value>
[all …]
H A Dnode_handling_support.h27 struct Value;
255 auto key = Value<Container>::key(expected_value); in test_extract()
265 auto key2 = Value<Container>::key(expected_value2); in test_extract()
286 cont.insert(Value<Container>::make(i)); in test_node_handling_support()
290 cont.insert(Value<Container>::make(4)); in test_node_handling_support()
429 table1_1.insert(Value<Container1>::make(i)); in test_merge()
433 table1_1.insert(Value<Container1>::make(i)); in test_merge()
441 table2_1.insert(Value<Container2>::make(i)); in test_merge()
445 table2_1.insert(Value<Container2>::make(i)); in test_merge()
454 table1_3.insert(Value<Container1>::make(i)); in test_merge()
[all …]
H A Dconcurrent_ordered_common.h50 … return !val_comp(rhs, lhs) && !key_comp(Value<Container>::key(rhs), Value<Container>::key(lhs)); in operator()
51 … return val_comp(lhs, rhs) && key_comp(Value<Container>::key(lhs), Value<Container>::key(rhs)); in operator()
78 cont.insert(Value<Container>::make(r)); in test_ordered_methods()
144 cont.insert(Value<Container>::make(i)); in test_concurrent_order()
148 cont.insert(Value<Container>::make(i)); in test_concurrent_order()
308 c.insert(Value<Container>::make(i));
312 c.insert(Value<Container>::make(0));
333 c1.insert(Value<Container>::make(1));
336 c2.insert(Value<Container>::make(1));
339 c2.insert(Value<Container>::make(2));
[all …]
H A Dconcurrent_unordered_common.h51 cont.insert(Value<T>::make(1)); in test_unordered_methods()
52 cont.insert(Value<T>::make(2)); in test_unordered_methods()
75 std::pair<typename T::iterator, bool> ins3 = cont.insert(Value<T>::make(i)); in test_unordered_methods()
76 …REQUIRE_MESSAGE((ins3.second == true && Value<T>::get(*(ins3.first)) == i), "Element 1 has not bee… in test_unordered_methods()
144 if (!c.contains(Value<UnorderedType>::key(*it))) { in equal()
175 const size_type index = c.unsafe_bucket(Value<Table>::key(*it)); in CustomExamine()
329 c1.insert(Value<Container>::make(1)); in test_comparisons_basic()
332 c2.insert(Value<Container>::make(1)); in test_comparisons_basic()
335 c2.insert(Value<Container>::make(2)); in test_comparisons_basic()
346 c1.insert(Value<TwoWayComparableContainerType>::make(1)); in test_two_way_comparable_container()
[all …]
H A Dconcurrent_lru_cache_common.h160 template<typename Key, typename Value>
161 struct preset_default : preset_base<Key, Value> {
162 using cache_type = typename preset_base<Key, Value>::cache_type;
/oneTBB/include/oneapi/tbb/detail/
H A D_node_handle.h47 template<typename Value, typename Node, typename Allocator>
105 template<typename Key, typename Value, typename Node, typename Allocator>
106 class node_handle : public node_handle_base<Value, Node, Allocator> {
107 using base_type = node_handle_base<Value, Node, Allocator>;
110 using mapped_type = typename Value::second_type;
152 template <typename Key, typename Value, typename Node, typename Allocator>
153 void swap( node_handle<Key, Value, Node, Allocator>& lhs, in swap() argument
154 node_handle<Key, Value, Node, Allocator>& rhs ) { in swap()
H A D_range_common.h86 template <typename Value>
87 concept blocked_range_value = std::copyable<Value> &&
88 … requires( const std::remove_reference_t<Value>& lhs, const std::remove_reference_t<Value>& rhs ) {
91 { lhs + (rhs - lhs) } -> std::convertible_to<Value>;
H A D_concurrent_queue_base.h508 template <typename Value, typename Allocator>
510 using queue_rep_type = concurrent_queue_rep<Value, Allocator>;
547 Value* tmp; in advance()
566 bool get_item( Value*& item, std::size_t k ) { in get_item()
579 Value* my_item{ nullptr };
592 template <typename Container, typename Value, typename Allocator>
593 …_iterator : public concurrent_queue_iterator_base<typename std::remove_cv<Value>::type, Allocator>…
594 … using base_type = concurrent_queue_iterator_base<typename std::remove_cv<Value>::type, Allocator>;
596 using value_type = Value;
/oneTBB/test/tbb/
H A Dtest_parallel_reduce.cpp305 template <typename Range, typename Value, typename RealBody, typename Reduction>
306 concept can_call_functional_preduce = can_call_preduce_with_partitioner<const Range&, const Value&,
309 template <typename Range, typename Value, typename RealBody, typename Reduction>
310 …can_call_functional_pdet_reduce = can_call_pdet_reduce_with_partitioner<const Range&, const Value&,
568 template<typename Range, typename Value, typename RealBody, typename Reduction>
569 …Value parallel_deterministic_reduce(const Range& , const Value& identity, const RealBody& , const … in parallel_deterministic_reduce()
572 template<typename Range, typename Value, typename RealBody, typename Reduction>
573 …Value parallel_deterministic_reduce(const Range& , const Value& identity, const RealBody& , const … in parallel_deterministic_reduce()
H A Dtest_concurrent_hash_map.cpp177 template <typename Value, typename U = Value>
255 template <bool default_construction_present, typename Value>
256 void TypeTester( const std::list<Value> &lst ) { in TypeTester()
257 using first_type = typename Value::first_type; in TypeTester()
259 using second_type = typename Value::second_type; in TypeTester()
268 typename std::list<Value>::const_iterator it = lst.begin(); in TypeTester()
269 std::initializer_list<Value> il = { *it++, *it++, *it++ }; in TypeTester()
290 … LocalCountingAllocator<std::allocator<Value>>>; in TypeTester()
309 LocalCountingAllocator<std::allocator<Value>> allocator; in TypeTester()
H A Dtest_concurrent_unordered_set.cpp31 template <typename Value>
32 using MyAllocator = LocalCountingAllocator<std::allocator<Value>>;
H A Dtest_parallel_sort.cpp61 template<typename Value>
62 bool compare(const Value& lhs, const Value& rhs) { in compare()
H A Dtest_parallel_scan.cpp408 template <typename Range, typename Value, typename Func, typename Combine>
409 concept can_call_functional_pscan = can_call_parallel_scan_basic<const Range&, const Value&, const …
410 …can_call_parallel_scan_basic<const Range&, const Value&, const Func&, const Combine&, const tbb::s…
411 …can_call_parallel_scan_basic<const Range&, const Value&, const Func&, const Combine&, const tbb::a…
/oneTBB/doc/main/reference/
H A Dconcurrent_lru_cache_cls.rst53 template <typename Key, typename Value, typename ValueFunctionType = Value (*)(Key)>
57 using value_type = Value;
/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp1086 using Value = std::string; in TestDeductionGuides() typedef
1088 using ComplexType = std::pair<Key, Value>; in TestDeductionGuides()
1089 using ComplexTypeConst = std::pair<const Key, Value>; in TestDeductionGuides()
1103 …static_assert(std::is_same<decltype(m1), TMap<Key, Value, DefaultCompare, DefaultAllocator>>::valu… 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()
1115 static_assert(std::is_same<decltype(m4), TMap<Key, Value, DefaultCompare, Allocator>>::value); in TestDeductionGuides()
1119 …static_assert(std::is_same<decltype(m5), TMap<Key, Value, DefaultCompare, DefaultAllocator>>::valu… 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()
[all …]
H A Dconformance_enumerable_thread_specific.cpp184 template <typename T, int Value>
189 T operator()() { return Value; } in operator ()()
192 template <int Value>
193 struct FunctorFinit<ThrowingConstructor,Value> {
197 ThrowingConstructor operator()() { ThrowingConstructor temp; temp.m_cnt = Value; return temp; } in operator ()()
200 template <size_t N, int Value>
201 struct FunctorFinit<minimalNComparable<N>,Value> {
207 result.set_value( Value ); in operator ()()

12