| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _concurrent_skip_list.h | 444 iterator unsafe_erase( iterator pos ) { in unsafe_erase()
595 iterator begin() { in begin()
607 iterator end() { in end()
608 return iterator(nullptr); in end()
643 std::pair<iterator, iterator> equal_range(const key_type& key) { in equal_range()
715 using iterator = typename concurrent_skip_list::iterator;
722 iterator begin() const { in begin()
727 iterator end() const { in end()
820 std::pair<iterator, iterator> internal_equal_range(const K& key) const { in internal_equal_range()
969 return std::pair<iterator, bool>(iterator(next), false); in internal_insert_node()
[all …]
|
| H A D | _concurrent_unordered_base.h | 397 iterator begin() noexcept { return iterator(first_value_node(&my_head)); } in begin()
401 iterator end() noexcept { return iterator(nullptr); } in end()
498 iterator unsafe_erase( iterator pos ) { in unsafe_erase()
570 std::pair<iterator, iterator> equal_range( const key_type& key ) { in equal_range()
572 return std::make_pair(iterator(result.first), iterator(result.second)); in equal_range()
583 return std::make_pair(iterator(result.first), iterator(result.second)); in equal_range()
589 return std::make_pair(iterator(result.first), iterator(result.second)); in equal_range()
731 iterator end() const { return iterator(my_instance.first_value_node(my_end_node)); } in end()
766 using iterator = typename concurrent_unordered_base::iterator;
769 iterator begin() const { return iterator(const_range_type::begin().get_node_ptr()); } in begin()
[all …]
|
| H A D | _flow_graph_cache_impl.h | 252 for ( typename successors_type::iterator i = my_successors.begin(); in remove_successor()
309 for ( successors_type::iterator i = my_successors.begin(); i != my_successors.end(); ++i ) { in remove_successor()
349 typename successors_type::iterator i = this->my_successors.begin(); in try_put_task()
373 typename successors_type::iterator i = this->my_successors.begin(); in gather_successful_try_puts()
416 typename successors_type::iterator i = this->my_successors.begin(); in try_put_task()
|
| H A D | _flow_graph_impl.h | 307 typedef graph_iterator<graph, graph_node> iterator; typedef
312 iterator begin();
314 iterator end();
|
| /oneTBB/doc/main/reference/ |
| H A D | parallel_for_each_semantics.rst | 42 * ``iterator`` determines the type of the iterator passed into ``parallel_for_each`` algorithm (whi…
44 * ``value_type`` - the type ``typename std::iterator_traits<iterator>::value_type``
45 * ``reference`` - the type ``typename std::iterator_traits<iterator>::reference``.
47 Requirements for different iterator types
50 If the ``iterator`` satisfies `Input iterator` named requirements from [input.iterators] ISO C++ St…
51 `Forward iterator` named requirements from [forward.iterators] ISO C++ Standard section, ``tbb::par…
59 If the ``iterator`` satisfies `Forward iterator` named requirements from [forward.iterators] ISO C+…
|
| /oneTBB/test/common/ |
| H A D | concurrent_associative_common.h | 123 … std::pair<typename MultiMap::iterator, typename MultiMap::iterator> range = m.equal_range( key );
504 std::pair<typename T::iterator, typename T::iterator> range = cont.equal_range(1);
505 typename T::iterator it;
530 std::pair<typename T::iterator, typename T::iterator> range = cont.equal_range(1);
582 std::pair<typename T::iterator, typename T::iterator> range2 = newcont.equal_range(1);
598 std::pair<typename T::iterator, typename T::iterator> range = cont.equal_range(1);
621 std::pair<typename T::iterator, typename T::iterator> range = newcont.equal_range(1);
1053 using iterator = typename Table::iterator;
1070 iterator it = res.first;
1076 std::pair<iterator, iterator> r1 = my_c.equal_range(Value<Table>::key(value));
[all …]
|
| /oneTBB/src/tbb/ |
| H A D | intrusive_list.h | 113 using iterator = iterator_impl<T>;
125 iterator begin () { return iterator(my_head.my_next_node); } in begin()
127 iterator end () { return iterator(&my_head); } in end()
157 iterator erase ( iterator it ) { in erase()
|
| /oneTBB/test/tbb/ |
| H A D | test_intrusive_list.cpp | 105 using iterator = typename List::iterator; in test_list_operations() typedef
113 iterator it = il.begin(); in test_list_operations()
121 check_list_nodes<List, iterator>(il, 2); in test_list_operations()
128 check_list_nodes<List, iterator>(il, 4); in test_list_operations()
|
| H A D | test_concurrent_hash_map.cpp | 124 using iterator = typename Table::iterator; typedef in check_value
168 std::pair<iterator,iterator> r1 = my_c.equal_range( value.first ); in operator ()()
169 iterator r1_first_prev = r1.first++; in operator ()()
198 using iterator = typename Table::iterator; in Examine() typedef
211 test_range<Table,iterator>( c, lst, marks ).do_test_range( c.begin(), c.end() ); in Examine()
218 …tbb::parallel_for( c.range(), test_range<Table,typename range_type::iterator,range_type>( c, lst, … in Examine()
335 for ( std::list<int_int_t>::iterator it = arrIntInt.begin(); it != arrIntInt.end(); ++it ) in TestSpecificTypes()
341 for ( std::list<int_int_t>::iterator it = arrIntInt.begin(); it != arrIntInt.end(); ++it ) in TestSpecificTypes()
514 template <typename hash_map_type, typename iterator>
515 static bool equal(hash_map_type const& c, iterator begin, iterator end){ in equal()
[all …]
|
| H A D | test_parallel_for_each.cpp | 233 can_call_parallel_for_each_with_iterator<CorrectCBS::iterator, Body> &&
240 using CorrectIterator = typename std::vector<int>::iterator; // random_access_iterator in test_pfor_each_iterator_constraints()
248 static_assert(can_call_parallel_for_each_with_cbs<Correct, CorrectBody<Correct::iterator>>); in test_pfor_each_container_based_sequence_constraints()
249 static_assert(!can_call_parallel_for_each_with_cbs<NoBegin, CorrectBody<NoBegin::iterator>>); in test_pfor_each_container_based_sequence_constraints()
250 static_assert(!can_call_parallel_for_each_with_cbs<NoEnd, CorrectBody<NoEnd::iterator>>); in test_pfor_each_container_based_sequence_constraints()
|
| H A D | test_flow_graph.cpp | 97 for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) { in test_iterator()
105 for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) { in test_iterator()
113 for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) { in test_iterator()
134 for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) { in operator ()()
143 for (tbb::flow::graph::iterator it = g.begin(); it != g.end(); ++it) { in operator ()()
|
| H A D | test_arena_constraints.cpp | 44 …id recursive_arena_binding(constraints_container::iterator current_pos, constraints_container::ite… in recursive_arena_binding()
|
| H A D | test_eh_algorithms.cpp | 778 using iterator = Iterator; typedef
780 iterator begin() const { in begin()
781 return iterator{&my_array.front()}; in begin()
783 iterator begin() { in begin()
784 return iterator{&my_array.front()}; in begin()
786 iterator end() const { in end()
787 return iterator{&my_array.back()}; in end()
789 iterator end() { in end()
790 return iterator{&my_array.back()}; in end()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_vector.h | 242 using iterator = Iterator; variable
278 using range_type = generic_range_type<iterator>;
381 iterator grow_by( size_type delta ) { in grow_by()
400 iterator grow_to_at_least( size_type n ) { in grow_to_at_least()
407 iterator push_back( const value_type& item ) { in push_back()
411 iterator push_back( value_type&& item ) { in push_back()
416 iterator emplace_back( Args&&... args ) { in emplace_back()
462 iterator begin() { return iterator(*this, 0); } in begin()
466 iterator end() { return iterator(*this, size()); } in end()
774 iterator internal_emplace_back( Args&&... args ) { in internal_emplace_back()
[all …]
|
| H A D | concurrent_map.h | 88 using iterator = typename base_type::iterator; variable
113 iterator it = this->find(key); in at()
126 iterator it = this->find(key);
135 iterator it = this->find(key);
147 std::pair<iterator, bool>>::type insert( P&& value ) in insert()
154 iterator>::type insert( const_iterator hint, P&& value ) in insert()
238 using iterator = typename base_type::iterator; variable
264 std::pair<iterator, bool>>::type insert( P&& value ) in insert()
271 iterator>::type insert( const_iterator hint, P&& value ) in insert()
|
| H A D | concurrent_unordered_map.h | 65 using iterator = typename base_type::iterator; variable
91 iterator where = this->find(key);
100 iterator where = this->find(key);
109 iterator where = this->find(key); in at()
130 std::pair<iterator, bool>>::type insert( P&& value ) { in insert()
136 iterator>::type insert( const_iterator hint, P&& value ) { in insert()
264 using iterator = typename base_type::iterator; variable
291 std::pair<iterator, bool>>::type insert( P&& value ) { in insert()
297 iterator>::type insert( const_iterator hint, P&& value ) { in insert()
|
| H A D | concurrent_queue.h | 69 using iterator = concurrent_queue_iterator<concurrent_queue, T, Allocator>; variable
230 iterator unsafe_begin() { return concurrent_queue_iterator_provider::get<iterator>(*this); } in unsafe_begin()
231 iterator unsafe_end() { return iterator(); } in unsafe_end()
344 using iterator = concurrent_queue_iterator<concurrent_bounded_queue, T, Allocator>; variable
541 iterator unsafe_begin() { return concurrent_queue_iterator_provider::get<iterator>(*this); } in unsafe_begin()
542 iterator unsafe_end() { return iterator(); } in unsafe_end()
|
| H A D | enumerable_thread_specific.h | 517 using inner_iterator = typename InnerContainer::iterator;
518 using outer_iterator = typename SegmentedContainer::iterator;
774 using iterator = I;
841 using iterator = enumerable_thread_specific_iterator<internal_collection_type, value_type>;
845 using range_type = generic_range_type<iterator>;
904 iterator begin() { return iterator( my_locals, 0 ); }
906 iterator end() { return iterator(my_locals, my_locals.size() ); }
1041 for(iterator ci = begin(); ci != end(); ++ci) {
1064 using iterator = segmented_iterator<Container, value_type>;
1073 iterator begin() { return iterator(*my_container) = my_begin; }
[all …]
|
| H A D | concurrent_set.h | 71 using iterator = typename base_type::iterator; variable
172 using iterator = typename base_type::iterator; variable
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_vector.cpp | 97 typename V::iterator p = v.begin(); in TestSequentialFor()
172 CheckIteratorComparison<typename V::iterator, typename V::iterator>(v); in TestSequentialFor()
681 …api::tbb::concurrent_vector<element_type, allocator_type > const& c, iterator begin, iterator end){ in equal()
713 typename MyVector::iterator p; in operator ()()
755 using iterator = oneapi::tbb::concurrent_vector<int>::range_type::iterator; typedef
756 iterator base;
765 AssignElement( iterator base_ ) : base(base_) {} in AssignElement()
769 using iterator = oneapi::tbb::concurrent_vector<int>::const_range_type::iterator; typedef
770 iterator base;
778 CheckElement( iterator base_ ) : base(base_) {} in CheckElement()
[all …]
|
| H A D | conformance_concurrent_hash_map.cpp | 289 test_table_type::iterator it = w.begin(); in TestRehash()
366 TestIteratorTraits<test_table_type::iterator,test_table_type::value_type>(); in TestIteratorsAndRanges()
375 TestIteratorAssignment<test_table_type::iterator>( v.begin() ); in TestIteratorsAndRanges()
591 template <typename hash_map_type, typename iterator>
592 static bool equal(hash_map_type const& c, iterator begin, iterator end){ in equal()
597 for (iterator it = begin; it != end; ++it ){ in equal()
746 for( test_table_type::iterator i = table.begin(); i!=table.end(); ++i ) { in TraverseTable()
757 … std::pair<test_table_type::iterator, test_table_type::iterator> er = table.equal_range(i->first); in TraverseTable()
1204 TestCHMapIteratorComparisonsBasic<typename chmap_type::iterator>(chmap); in TestCHMapIteratorComparisons()
1367 using iterator = typename chmap_type::iterator; in test_heterogeneous_equal_range() typedef
[all …]
|
| H A D | conformance_blocked_range3d.cpp | 222 …oneapi::tbb::blocked_range3d<decltype(v)::iterator, decltype(v2)::iterator, decltype(v3)::iterator…
|
| H A D | conformance_enumerable_thread_specific.cpp | 394 for ( typename ets_type::iterator i = sums.begin(); i != sums.end(); ++i ) { in run_parallel_scalar_tests_nocombine()
414 … for ( typename ets_type::const_range_type::iterator i = cr.begin(); i != cr.end(); ++i ) { in run_parallel_scalar_tests_nocombine()
619 for (typename R::iterator ri = r.begin(); ri != r.end(); ++ri) { in operator ()()
674 typename oneapi::tbb::flattened2d<ets_type>::iterator it; in run_parallel_vector_tests()
678 typename oneapi::tbb::flattened2d<ets_type>::iterator it3; in run_parallel_vector_tests()
690 … for(typename oneapi::tbb::flattened2d<ets_type>::iterator i = fvs.begin(); i != fvs.end(); i++) { in run_parallel_vector_tests()
763 …for(typename oneapi::tbb::flattened2d<ets_nokey_type>::iterator i = fvs.begin(); i != fvs.end(); +… in run_cross_type_vector_tests()
1051 static_assert(utils::is_random_access_iterator<typename ets_container_type::iterator>::value, in TestMemberTypes()
1053 static_assert(!std::is_const<typename ets_container_type::iterator::value_type>::value, in TestMemberTypes()
1124 typename ets_type::iterator it; in TestETSIterator()
[all …]
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | concurrent_vector_ug.rst | 17 with ``T()``. Both methods return an iterator pointing to the first
45 past the current value of ``end()``. However, the iterator may reference
|
| /oneTBB/examples/common/utility/ |
| H A D | utility.hpp | 206 std::pair<args_map_type::iterator, bool> result = in add_arg()
266 args_map_type::iterator it = args_map.find(name_found); in parse()
278 args_map_type::iterator it = args_map.find(argv[j]); in parse()
286 args_map_type::iterator found_positional_arg = in parse()
|