Home
last modified time | relevance | path

Searched refs:ValueType (Results 1 – 16 of 16) sorted by relevance

/oneTBB/examples/parallel_for/seismic/
H A Duniverse.hpp45 typedef float ValueType; typedef in Universe
48 ValueType S[MaxHeight][MaxWidth];
51 ValueType V[MaxHeight][MaxWidth];
54 ValueType T[MaxHeight][MaxWidth];
57 ValueType M[MaxHeight][MaxWidth];
60 ValueType D[MaxHeight][MaxWidth];
63 ValueType L[MaxHeight][MaxWidth];
H A Duniverse.cpp49 T[i][j] = S[i][j] = V[i][j] = ValueType(1.0E-6); in InitializeUniverse()
54 ValueType t = (ValueType)i / (ValueType)UniverseHeight; in InitializeUniverse()
78 ValueType scale = 2.0f / (ValueType)ColorMapSize; in InitializeUniverse()
82 ValueType t = (i - ColorMapSize / 2) * scale; in InitializeUniverse()
83 ValueType r = t > 0 ? t : 0; in InitializeUniverse()
84 ValueType b = t < 0 ? -t : 0; in InitializeUniverse()
85 ValueType g = 0.5f * fabs(t); in InitializeUniverse()
94 ValueType d = 1.0; in InitializeUniverse()
110 ValueType t = (pulseCounter - pulseTime / 2) * 0.05f; in UpdatePulse()
/oneTBB/test/tbb/
H A Dtest_parallel_reduce.cpp33 using ValueType = uint64_t; typedef
43 ValueType operator() ( const tbb::blocked_range<ValueType*>& r, ValueType value ) const { in operator ()()
56 m_array = new ValueType[unsigned(count)]; in ParallelSumTester()
57 for ( ValueType i = 0; i < count; ++i ) in ParallelSumTester()
66 ValueType result1 = reduce_invoker<ValueType>( m_range, Accumulator(), Sum(), partitioner ); in CheckParallelReduce()
68 ValueType result2 = reduce_invoker<ValueType>( m_range, in CheckParallelReduce()
69 [](const tbb::blocked_range<ValueType*>& r, ValueType value) -> ValueType { in CheckParallelReduce()
80 ValueType* m_array;
81 tbb::blocked_range<ValueType*> m_range;
82 static const ValueType count, expected;
[all …]
H A Dtest_concurrent_unordered_set.cpp70 template <bool DefCtorPresent, typename ValueType>
71 void check( const std::list<ValueType>& lst ) { in check()
72 …TypeTester<DefCtorPresent, tbb::concurrent_unordered_set<ValueType, std::hash<ValueType>, utils::I… in check()
73 …ypeTester<DefCtorPresent, tbb::concurrent_unordered_multiset<ValueType, std::hash<ValueType>, util… in check()
H A Dtest_concurrent_set.cpp64 template <bool DefCtorPresent, typename ValueType>
65 void check( const std::list<ValueType>& lst ) { in check()
66 TypeTester<DefCtorPresent, tbb::concurrent_set<ValueType>>(lst); in check()
67 TypeTester<DefCtorPresent, tbb::concurrent_multiset<ValueType>>(lst); in check()
H A Dtest_concurrent_map.cpp79 template <bool DefCtorPresent, typename ValueType>
80 void check( const std::list<ValueType>& lst ) { in check()
81 using key_type = typename ValueType::first_type; in check()
82 using mapped_type = typename ValueType::second_type; in check()
H A Dtest_concurrent_unordered_map.cpp86 template <bool DefCtorPresent, typename ValueType>
87 void check( const std::list<ValueType>& lst ) { in check()
88 using key_type = typename std::remove_const<typename ValueType::first_type>::type; in check()
89 using mapped_type = typename ValueType::second_type; in check()
H A Dtest_parallel_sort.cpp89 template <typename RefType, typename ValueType>
90 void set(RefType& ref, ValueType new_value) { in set()
94 template <typename ValueType>
95 void set(Minimal& minimal_ref, ValueType new_value) { in set()
/oneTBB/test/common/
H A Dconcurrent_lru_cache_common.h51 template<typename ValueType>
53 ValueType& my_ref_to_original;
55 cloner(ValueType& ref_to_original) : my_ref_to_original(ref_to_original) {} in cloner()
58 ValueType operator()(KeyType) const { return my_ref_to_original; } in operator()
63 template <typename KeyType, typename ValueType>
65 using map_type = std::map<KeyType, ValueType>;
72 ValueType& operator()(KeyType k) { in operator()
75 it = my_map_ref.insert(it, std::make_pair(k, ValueType())); in operator()
H A Dconcurrent_priority_queue_common.h98 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()
103 std::vector<ValueType> vec_sorted(vec); in type_tester()
183 template <typename ValueType>
184 void type_tester( const std::vector<ValueType>& vec ) { in type_tester()
185 type_tester(vec, std::less<ValueType>{}); in type_tester()
H A Drange_based_for_support.h26 template <typename ValueType, typename Container, typename BinaryAccumulator, typename InitValueTyp…
30 for (ValueType x : c) { in range_based_for_accumulate()
/oneTBB/test/conformance/
H A Dconformance_parallel_pipeline.cpp147 using ValueType = typename Iterator1::value_type; in RootSequence() typedef
149 oneapi::tbb::make_filter<void,ValueType>( in RootSequence()
151 [&first, &last](oneapi::tbb::flow_control& fc)-> ValueType{ in RootSequence()
153 ValueType val = *first; in RootSequence()
158 return ValueType{}; in RootSequence()
162 oneapi::tbb::make_filter<ValueType,ValueType>( in RootSequence()
164 [](ValueType p){return p*p;} in RootSequence()
166 oneapi::tbb::make_filter<ValueType,void>( in RootSequence()
168 [&res](ValueType x) { in RootSequence()
H A Dconformance_concurrent_queue.cpp45 template<typename CQ, typename ValueType, typename CounterType>
46 void push(CQ& q, ValueType v, CounterType i) { in push()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_tagged_buffer_impl.h33 template<typename ValueType>
37 typedef typename aligned_pair<ValueType, void *>::type type;
43 typename ValueType,
46 … typename Allocator=tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >
51 typedef ValueType value_type;
H A D_concurrent_unordered_base.h163 template <typename ValueType, typename SokeyType>
169 using value_type = ValueType;
951 template <typename ValueType>
952 std::pair<iterator, bool> internal_insert_value( ValueType&& value ) { in internal_insert_value()
955 return create_node(order_key, std::forward<ValueType>(value)); in internal_insert_value()
984 template <typename ValueType, typename CreateInsertNode>
985 …internal_insert_return_type internal_insert( ValueType&& value, CreateInsertNode create_insert_nod… in internal_insert()
986 static_assert(std::is_same<typename std::decay<ValueType>::type, value_type>::value, in internal_insert()
H A D_concurrent_skip_list.h184 template <typename NodeType, typename ValueType>
190 using value_type = ValueType;