Home
last modified time | relevance | path

Searched refs:begin (Results 1 – 25 of 143) sorted by relevance

123456

/oneTBB/include/oneapi/tbb/
H A Dparallel_sort.h75 RandomAccessIterator array = range.begin; in split_range()
118 RandomAccessIterator begin; variable
121 comp(comp_), size(size_), begin(begin_) {} in quick_sort_range()
131 , begin(range.begin + range.size + 1) {} in quick_sort_range()
170 std::sort(range.begin, range.begin + range.size, range.comp); in operator()
178 parallel_for(quick_sort_range<RandomAccessIterator,Compare>(begin, end - begin, comp), in do_parallel_quick_sort()
191 RandomAccessIterator k = begin; in parallel_quick_sort()
192 for( ; k != begin + serial_cutoff; ++k ) { in parallel_quick_sort()
240 if( end > begin ) { in __TBB_requires()
241 if( end - begin < min_parallel_size ) { in __TBB_requires()
[all …]
H A Dblocked_rangeNd.h89 … return std::any_of(my_dims.begin(), my_dims.end(), [](const tbb::blocked_range<value_type>& d) { in __TBB_requires()
96 … return std::any_of(my_dims.begin(), my_dims.end(), [](const tbb::blocked_range<value_type>& d) { in __TBB_requires()
120 …auto my_it = std::max_element(my_dims.begin(), my_dims.end(), [](const tbb::blocked_range<value_ty… in __TBB_requires()
124 auto r_it = r.my_dims.begin() + (my_it - my_dims.begin()); in __TBB_requires()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DDivide_and_Conquer.rst72 if( end-begin>1 ) {
74 T* mid = partition( begin+1, end, bind2nd(less<T>(),*begin) );
75 swap( *begin, mid[-1] );
76 SerialQuicksort( begin, mid-1 );
91 if( end-begin>1 ) {
93 T* mid = partition( begin+1, end, bind2nd(less<T>(),*begin) );
94 swap( *begin, mid[-1] );
109 if( end-begin>=500 ) {
111 T* mid = partition( begin+1, end, bind2nd(less<T>(),*begin) );
112 swap( *begin, mid[-1] );
[all …]
/oneTBB/test/conformance/
H A Dconformance_blocked_range3d.cpp111 …f( (GetValueOf(r2.pages().begin())==GetValueOf(r.pages().begin())) && (GetValueOf(r2.rows().begin(… in SerialTest()
114 … REQUIRE( GetValueOf(r2.cols().begin())==GetValueOf(r.cols().end()) ); in SerialTest()
116 … ( (GetValueOf(r2.pages().begin())==GetValueOf(r.pages().begin())) && (GetValueOf(r2.cols().begin(… in SerialTest()
119 … REQUIRE( GetValueOf(r2.rows().begin())==GetValueOf(r.rows().end()) ); in SerialTest()
123 … REQUIRE( GetValueOf(r2.pages().begin())==GetValueOf(r.pages().end()) ); in SerialTest()
145 …for( oneapi::tbb::blocked_range<int>::const_iterator i=r.pages().begin(); i!=r.pages().end(); ++i ) in operator ()()
146 … for( oneapi::tbb::blocked_range<int>::const_iterator j=r.rows().begin(); j!=r.rows().end(); ++j ) in operator ()()
147 … for( oneapi::tbb::blocked_range<int>::const_iterator k=r.cols().begin(); k!=r.cols().end(); ++k ) in operator ()()
195 …original.rows().begin() + ps.left() * (original.rows().end() - original.rows().begin()) / (ps.left…
220 …oneapi::tbb::blocked_range3d r1(v.begin(), v.end(), 2, v2.begin(), v2.end(), 2, v3.begin(), v3.end…
H A Dconformance_blocked_rangeNd.cpp72 …std::for_each(data.begin(), data.end(), range_utils<range_t, N - 1>::template init_data<EntityType… in init_data()
77 auto begin = data.begin() + range.dim(N - 1).begin(); in increment_data() local
79 auto end = begin + range.dim(N - 1).size(); in increment_data()
80 for (auto i = begin; i != end; ++i) { in increment_data()
87 auto begin = data.begin() + range.dim(N - 1).begin(); in check_data() local
89 auto end = begin + range.dim(N - 1).size(); in check_data()
90 for (auto i = begin; i != end; ++i) { in check_data()
120 if (get(range_split.dim(N - 1).begin()) == get(range_new.dim(N - 1).begin())) { in check_splitting()
124 …REQUIRE((get(range_split.dim(N - 1).end()) == get(range_new.dim(N - 1).begin()) && !split_checker)… in check_splitting()
266 …original.dim(0).begin() + ps.left() * (original.dim(0).end() - original.dim(0).begin()) / (ps.left…
H A Dconformance_parallel_sort.cpp44 oneapi::tbb::parallel_sort(test_vector.begin(), test_vector.end());
46 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
58 oneapi::tbb::parallel_sort(test_vector.begin(), test_vector.end(), std::greater<int>());
60 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
74 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
88 for(auto it = test_vector.begin(); it != test_vector.end() - 1; ++it)
H A Dconformance_concurrent_vector.cpp46 REQUIRE( u.begin()[i].bar()==i ); in CheckConstIterator()
52 Iterator1 i = u.begin(); in CheckIteratorComparison()
55 Iterator2 j = u.begin(); in CheckIteratorComparison()
56 Iterator2 i2 = u2.begin(); in CheckIteratorComparison()
97 typename V::iterator p = v.begin(); in TestSequentialFor()
142 cp = u.begin(); in TestSequentialFor()
511 …REQUIRE_MESSAGE( std::equal(victim.begin(), victim.begin() + planned_victim_size, src.begin()), "f… in verify_vector_partially_copied()
683 return equal_sizes && std::equal(c.begin(), c.end(), begin); in equal()
1224 TVector v1(v.begin(), v.end()); in TestDeductionGuides()
1399 it1 = vec.begin(); in TestVectorIteratorComparisonsBasic()
[all …]
H A Dconformance_blocked_range2d.cpp94 if( GetValueOf(r2.rows().begin())==GetValueOf(r.rows().begin()) ) { in SerialTest()
96 … REQUIRE( GetValueOf(r2.cols().begin())==GetValueOf(r.cols().end()) ); in SerialTest()
99 … REQUIRE( GetValueOf(r2.rows().begin())==GetValueOf(r.rows().end()) ); in SerialTest()
117 … for( oneapi::tbb::blocked_range<int>::const_iterator i=r.rows().begin(); i!=r.rows().end(); ++i ) in operator ()()
118 … for( oneapi::tbb::blocked_range<int>::const_iterator j=r.cols().begin(); j!=r.cols().end(); ++j ) in operator ()()
162 …original.rows().begin() + ps.left() * (original.rows().end() - original.rows().begin()) / (ps.left…
181 oneapi::tbb::blocked_range2d r1(v.begin(), v.end(), 2, v2.begin(), v2.end(), 2);
H A Dconformance_enumerable_thread_specific.cpp676 it = fvs.begin(); in run_parallel_vector_tests()
769 REQUIRE(std::distance(fvs2.begin(), fvs2.end()) == vs3.begin()->size()); in run_cross_type_vector_tests()
771 REQUIRE(std::distance(cfvs2.begin(), cfvs2.end()) == vs3.begin()->size()); in run_cross_type_vector_tests()
1102 auto iter = ets.begin(); in TestETSIterator()
1111 auto citer = cets.begin(); in TestETSIterator()
1125 it = ets.begin(); in TestETSIterator()
1131 it = ets.begin(); in TestETSIterator()
1135 REQUIRE(it == ets.begin()); in TestETSIterator()
1142 auto iter1 = ets.begin(); in TestETSIterator()
1164 it1 = ets.begin(); in TestETSIteratorComparisonsBasic()
[all …]
H A Dconformance_blocked_range.cpp68 utils::AssertSameType( r.begin(), MakeAbstractValueType(0) ); in SerialTest()
78 CHECK( GetValueOf(r.begin())==x ); in SerialTest()
79 CHECK( GetValueOf(r.end())==GetValueOf(r2.begin()) ); in SerialTest()
95 for( oneapi::tbb::blocked_range<int>::const_iterator i=r.begin(); i!=r.end(); ++i ) in operator ()()
143 … original.begin() + ps.left() * (original.end() - original.begin()) / (ps.left() + ps.right())
155 oneapi::tbb::blocked_range r1(v.begin(), v.end());
/oneTBB/test/tbb/
H A Dtest_blocked_range.cpp62 std::size_t begin = r1.begin(); variable
77 …std::size_t diff = (r2.begin() < newRangeBegin) ? (newRangeBegin - r2.begin()) : (r2.begin() - new…
79 bool test_passed = (r1.begin() == begin && r1.end() == r2.begin() && is_split_correct &&
83 …"must be r1[%lu, %lu) and r2[%lu, %lu)\n", begin, end, r1.begin(), r1.end(), r2.begin(), r2.end(),…
H A Dtest_concurrent_vector.cpp46 std::sort( array.begin(), array.end() ); in TestSort()
71 new (ptr) container_type(begin, end); in construct_container()
78 new (ptr) container_type(begin, end, a); in construct_container()
101 return equal_sizes && std::equal(c.begin(), c.end(), begin); in equal()
221 c1.grow_by(init_list.begin(), init_list.end()); in test_scoped_allocator()
290 std::copy( c.begin(), c.begin() + 5, std::back_inserter( c2 ) ); in Examine()
292 c.grow_by( c2.begin(), c2.end() ); in Examine()
317 std::copy( my_vec.begin(), my_vec.end(), c7.begin() ); in operator ()()
320 std::copy( c7.begin(), c7.end(), c8.begin() ); in operator ()()
352 tbb::concurrent_vector<Type> c11(vec.begin(), vec.end()); in TypeTester()
[all …]
H A Dtest_concurrent_hash_map.cpp207 std::for_each( lst.begin(), lst.end(), cv ); in Examine()
231 c2.insert( lst.begin(), begin5 ); in Examine()
264 c1.insert( lst.begin(), lst.end() ); in TypeTester()
292 c6.insert( lst.begin(), lst.end() ); in TypeTester()
299 c8.insert( lst.begin(), lst.end() ); in TypeTester()
302 c9.insert( lst.begin(), lst.end() ); in TypeTester()
318 ch_map_debug_hash c12(c1.begin(), c1.end(), compare); in TypeTester()
476 new (ptr) container_type(begin, end); in construct_container()
483 new (ptr) container_type(begin, end, a); in construct_container()
520 for (iterator it = begin; it != end; ++it ){ in equal()
[all …]
H A Dtest_enumerable_thread_specific.cpp170 REQUIRE( static_cast<int>(a[i].end() - a[i].begin()) == 0 ); in flog_key_creation_and_deletion()
202 for(my_si=my_vec.begin(), ii=0; my_si != my_vec.end(); ++my_si, ++ii) { in flog_segmented_interator()
210 for(my_si=my_vec.begin(); my_si != my_vec.end(); ++my_si) { in flog_segmented_interator()
219 for(my_si = my_vec.begin(); my_si != my_vec.end(); ++my_si) { in flog_segmented_interator()
233 for(my_si = my_vec.begin(), ii=0; my_si != my_vec.end(); ++my_si, ++ii) { in flog_segmented_interator()
240 for(my_csi=my_vec.begin(), ii=0; my_csi != my_vec.end(); ++my_csi, ++ii) { in flog_segmented_interator()
248 for(my_csi=my_vec.begin(); my_csi != my_vec.end(); ++my_csi) { in flog_segmented_interator()
257 for(my_csi = my_vec.begin(); my_csi != my_vec.end(); ++my_csi) { in flog_segmented_interator()
271 for(my_csi = my_vec.begin(), ii=0; my_csi != my_vec.end(); ++my_csi, ++ii) { in flog_segmented_interator()
302 for(my_si=my_vec.begin(), ii=0; my_si != my_vec.end(); ++my_si, ++ii) { in flog_segmented_iterator_map()
[all …]
H A Dtest_parallel_reduce.cpp44 for ( ValueType* pv = r.begin(); pv != r.end(); ++pv ) in operator ()()
451 size_t begin, end; member in MinimalRange
457 begin = r.end = (r.begin+r.end)/2; in MinimalRange()
459 bool is_divisible() const {return end-begin>=2;} in is_divisible()
460 bool empty() const {return begin==end;} in empty()
474 size_t begin, end; member in FooBody
500 begin = ~size_t(0); in init()
508 REQUIRE( end==s.begin ); in join()
514 for( size_t k=r.begin; k<r.end; ++k ) in operator ()()
518 begin = r.begin; in operator ()()
[all …]
/oneTBB/test/common/
H A Dconcurrent_unordered_common.h124 new (ptr) UnorderedType(begin, end); in construct_container()
174 for (auto it = lst.begin(); it != lst.end();) { in CustomExamine()
211 c1.insert(lst.begin(), lst.end()); in TypeTester()
219 auto it = lst.begin(); in TypeTester()
224 it = lst.begin(); in TypeTester()
230 it = lst.begin(); in TypeTester()
246 c4.insert(lst.begin(), lst.end()); in TypeTester()
251 c4_alloc.insert(lst.begin(), lst.end()); in TypeTester()
256 c4_hash_alloc.insert(lst.begin(), lst.end()); in TypeTester()
260 Table c5(c1.begin(), c1.end()); in TypeTester()
[all …]
H A Dconcurrent_priority_queue_common.h40 std::reverse(v.begin(), v.end()); in toVector()
108 q1.assign(vec.begin(), vec.end()); in type_tester()
134 queue_type q5(vec.begin(), vec.end()); in type_tester()
139 q6.assign(vec.begin(), vec.end()); in type_tester()
144 q7.assign(vec.begin(), vec.end()); in type_tester()
148 q8.assign(vec.begin(), vec.end()); in type_tester()
153 q9.assign(vec.begin(), vec.end()); in type_tester()
157 q10.assign(vec.begin(), vec.end()); in type_tester()
161 q11.assign(vec.begin(), vec.end()); in type_tester()
165 queue_type q12(vec.begin(), vec.end(), comp); in type_tester()
[all …]
H A Dconcurrent_ordered_common.h95 for (auto it = cont.begin(); it != cont.end(); ++it){ in test_ordered_methods()
170 new (ptr) OrderedType(begin, end); in construct_container()
187 for (Iterator it = begin; it != end; ++it) { in equal()
218 c1.insert(lst.begin(), lst.end());
224 auto it = lst.begin();
252 c4.insert(lst.begin(), lst.end());
257 c5.insert(lst.begin(), lst.end());
262 c6.insert(lst.begin(), lst.end());
266 Table c7(c1.begin(), c1.end());
270 Table c8(c1.begin(), c1.end(), allocator);
[all …]
H A Dcontainer_move_support.h334 for (auto it = source.begin(); it != source.end(); ++it) { in MemoryLocations()
335 locations[std::distance(source.begin(), it)] = &*it; in MemoryLocations()
345 return std::equal(dst.begin(), dst.end(), locations.begin(), is_same_location); in content_location_unchanged()
353 return std::equal(dst.begin(), dst.end(), locations.begin(), is_not_same_location); in content_location_changed()
391 … REQUIRE_MESSAGE(&(*source_arena_fixture.storage.begin()) != &(*dst_arena_fixture.storage.begin()), in TwoMemoryArenasFixture()
484 …REQUIRE(std::equal(dst.begin(), dst.begin() + number_of_constructed_items, init_iterator_type(0))); in verify_content_equal_to_source()
497 … REQUIRE_MESSAGE(std::all_of(dst.begin(), dst.end(), is_state_predicate<Foo::MoveInitialized>()), in verify_content_deep_moved()
499 … REQUIRE_MESSAGE(std::all_of(source.begin(), source.end(), is_state_predicate<Foo::MovedFrom>()), in verify_content_deep_moved()
506 …REQUIRE_MESSAGE(std::all_of(dst.begin(), dst.begin() + number_of_constructed_items, is_state_predi… in verify_part_of_content_deep_moved()
512 …REQUIRE_MESSAGE(std::all_of(source.begin(), source.begin() + number_of_constructed_items, is_state… in verify_part_of_content_deep_moved()
[all …]
/oneTBB/examples/parallel_for/tachyon/src/
H A Dtrace.tbb.cpp209 drawing_area drawing(r.cols().begin(), in operator ()()
211 r.cols().end() - r.cols().begin(), in operator ()()
212 r.rows().end() - r.rows().begin()); in operator ()()
213 for (int i = 1, y = r.rows().begin(); y != r.rows().end(); ++y, i++) { in operator ()()
215 for (int x = r.cols().begin(); x != r.cols().end(); x++) { in operator ()()
224 drawing_area drawing(r.cols().begin(), in operator ()()
226 r.cols().end() - r.cols().begin(), in operator ()()
227 r.rows().end() - r.rows().begin()); in operator ()()
228 for (int i = 1, y = r.rows().begin(); y != r.rows().end(); ++y, i++) { in operator ()()
230 for (int x = r.cols().begin(); x != r.cols().end(); x++) { in operator ()()
[all …]
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_bench.cpp130 H.insert(H.end(), P_reduced.begin(), P_reduced.end()); in divide_and_conquer()
136 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
137 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
153 hull.insert(hull.end(), H.begin(), H.end()); in quickhull()
215 dest.insert(dest.end(), src.begin(), src.end()); in appendVector()
243 util::rng the_rng(range.begin()); in operator ()()
270 util::rng the_rng(range.begin()); in operator ()()
283 std::copy(tmp_vec, tmp_vec + j, points.begin() + range.begin()); in operator ()()
555 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
556 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
[all …]
/oneTBB/examples/parallel_for/game_of_life/
H A DUpdate_state.cpp100 unsigned size_sse_ar = size_sse_row * (end - begin); in UpdateState()
127 unsigned height = end - begin; in UpdateState()
130 char* src = &mas[(row + begin) * width]; in UpdateState()
136 if (begin == 0) { in UpdateState()
140 src = &mas[(begin - 1) * width]; in UpdateState()
165 height = end - begin + 2; in UpdateState()
175 height = end - begin + 2; in UpdateState()
188 height = end - begin + 2; in UpdateState()
201 height = end - begin; in UpdateState()
204 char* dst = &dest[(row + begin) * width]; in UpdateState()
[all …]
H A DEvolution.cpp149 int begin = (int)r.begin(); //! capture lower range number for this chunk in operator ()() local
151 UpdateState(m_source, m_dest, begin, end); in operator ()()
166 std::size_t begin = 0; //! beginning cell position in Step() local
177 parallel_for(oneapi::tbb::blocked_range<std::size_t>(begin, end, GRAIN_SIZE), in Step()
/oneTBB/examples/parallel_pipeline/square/
H A Dsquare.cpp52 t->logical_end = t->begin(); in allocate()
53 t->physical_end = t->begin() + max_size; in allocate()
59 (char*)this, sizeof(TextSlice) + (physical_end - begin()) + 1); in free()
62 char* begin() { in begin() function in TextSlice
128 while (p > t->begin() && isdigit(p[-1])) in operator ()()
130 assert(p > t->begin()); // Number too large to fit in buffer in operator ()()
147 char* p = input->begin(); in operator ()()
149 char* q = out->begin(); in operator ()()
180 std::size_t n = fwrite(out->begin(), 1, out->size(), my_output_file); in operator ()()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h53 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->second))%alignment_of<buffer_ite… in item()
54 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->first))%alignment_of<item_type>:… in item()
55 return *my_array[i & (my_array_size - 1) ].begin(); in item()
59 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->second))%alignment_of<buffer_ite… in item()
60 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->first))%alignment_of<item_type>:… in item()
61 return *my_array[i & (my_array_size-1)].begin(); in item()
166 for( size_type i=0; i<new_size; ++i ) { new_array[i].begin()->second = no_item; } in grow_my_array()
171 char *new_space = (char *)&(new_array[i&(new_size-1)].begin()->first); in grow_my_array()
173 new_array[i&(new_size-1)].begin()->second = item(i).second; in grow_my_array()

123456