| /third_party/boost/boost/move/algo/detail/ |
| D | set_difference.hpp | 46 (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt result, Compare comp) in set_difference() argument
48 while (first1 != last1) { in set_difference()
50 return boost::move_detail::copy(first1, last1, result); in set_difference()
52 if (comp(*first1, *first2)) { in set_difference()
53 *result = *first1; in set_difference()
55 ++first1; in set_difference()
58 if (!comp(*first2, *first1)) { in set_difference()
59 ++first1; in set_difference()
74 (InputOutputIt1 first1, InputOutputIt1 last1, InputIt2 first2, InputIt2 last2, Compare comp ) in inplace_set_difference() argument
76 while (first1 != last1) { in inplace_set_difference()
[all …]
|
| D | insertion_sort.hpp | 41 void insertion_sort_op(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator first2… in insertion_sort_op() argument
43 if (first1 != last1){ in insertion_sort_op()
45 op(first1, last2); in insertion_sort_op()
46 for (++last2; ++first1 != last1; ++last2){ in insertion_sort_op()
49 if (comp(*first1, *--i2)){ in insertion_sort_op()
51 for (--j2; i2 != first2 && comp(*first1, *--i2); --j2) { in insertion_sort_op()
55 op(first1, j2); in insertion_sort_op()
61 void insertion_sort_swap(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator firs… in insertion_sort_swap() argument
63 insertion_sort_op(first1, last1, first2, comp, swap_op()); in insertion_sort_swap()
68 void insertion_sort_copy(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator firs… in insertion_sort_copy() argument
[all …]
|
| D | adaptive_sort_merge.hpp | 149 ( RandIt first1, RandIt const last1 in skip_until_merge() argument
152 while(first1 != last1 && !comp(next_key, *first1)){ in skip_until_merge()
153 ++first1; in skip_until_merge()
155 return first1; in skip_until_merge()
232 (RandIt first1, RandIt last1, RandIt const last2, bool *const pis_range1_A, Compare comp) in partial_merge_bufferless_impl() argument
235 return first1; in partial_merge_bufferless_impl()
238 if(first1 != last1 && comp(*last1, last1[-1])){ in partial_merge_bufferless_impl()
241 last1 = boost::movelib::lower_bound(last1, last2, *first1, comp); in partial_merge_bufferless_impl()
242 first1 = rotate_gcd(first1, old_last1, last1);//old_last1 == last1 supported in partial_merge_bufferless_impl()
244 return first1; in partial_merge_bufferless_impl()
[all …]
|
| /third_party/boost/boost/test/utils/ |
| D | algorithm.hpp | 43 mismatch( InputIter1 first1, InputIter1 last1, in mismatch() argument
46 while( first1 != last1 && first2 != last2 && *first1 == *first2 ) { in mismatch()
47 ++first1; in mismatch()
51 return std::pair<InputIter1, InputIter2>(first1, first2); in mismatch()
67 mismatch( InputIter1 first1, InputIter1 last1, in mismatch() argument
71 while( first1 != last1 && first2 != last2 && pred( *first1, *first2 ) ) { in mismatch()
72 ++first1; in mismatch()
76 return std::pair<InputIter1, InputIter2>(first1, first2); in mismatch()
89 find_first_not_of( ForwardIterator1 first1, ForwardIterator1 last1, in find_first_not_of() argument
92 while( first1 != last1 ) { in find_first_not_of()
[all …]
|
| /third_party/boost/boost/algorithm/cxx11/ |
| D | is_permutation.hpp | 45 bool is_permutation_inner ( ForwardIterator1 first1, ForwardIterator1 last1, in is_permutation_inner() argument
50 for ( ForwardIterator1 iter = first1; iter != last1; ++iter ) { in is_permutation_inner()
54 if ( std::find_if ( first1, iter, pred ) == iter ) { in is_permutation_inner()
65 bool is_permutation_tag ( ForwardIterator1 first1, ForwardIterator1 last1, in is_permutation_tag() argument
71 while ( first1 != last1 && first2 != last2 && p ( *first1, *first2 )) { in is_permutation_tag()
72 ++first1; in is_permutation_tag()
75 if ( first1 != last1 && first2 != last2 ) in is_permutation_tag()
76 return boost::algorithm::detail::is_permutation_inner ( first1, last1, first2, last2, in is_permutation_tag()
78 return first1 == last1 && first2 == last2; in is_permutation_tag()
82 bool is_permutation_tag ( RandomAccessIterator1 first1, RandomAccessIterator1 last1, in is_permutation_tag() argument
[all …]
|
| /third_party/boost/boost/numeric/odeint/algebra/detail/ |
| D | for_each.hpp | 28 inline void for_each1( Iterator1 first1 , Iterator1 last1 , Operation op ) in for_each1() argument
30 for( ; first1 != last1 ; ) in for_each1()
31 op( *first1++ ); in for_each1()
36 inline void for_each2( Iterator1 first1 , Iterator1 last1 , Iterator2 first2 , Operation op ) in for_each2() argument
38 for( ; first1 != last1 ; ) in for_each2()
39 op( *first1++ , *first2++ ); in for_each2()
44 …inline void for_each3( Iterator1 first1 , Iterator1 last1 , Iterator2 first2 , Iterator3 first3, O… in for_each3() argument
46 for( ; first1 != last1 ; ) in for_each3()
47 op( *first1++ , *first2++ , *first3++ ); in for_each3()
52 …inline void for_each4( Iterator1 first1 , Iterator1 last1 , Iterator2 first2 , Iterator3 first3, I… in for_each4() argument
[all …]
|
| /third_party/boost/boost/intrusive/detail/ |
| D | algorithm.hpp | 42 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) in algo_equal() argument
44 for (; first1 != last1; ++first1, ++first2) { in algo_equal()
45 if (!p(*first1, *first2)) { in algo_equal()
53 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) in algo_equal() argument
54 { return (algo_equal)(first1, last1, first2, algo_pred_equal()); } in algo_equal()
57 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, BinaryPredicate p… in algo_equal() argument
59 for (; first1 != last1 && first2 != last2; ++first1, ++first2) in algo_equal()
60 if (!pred(*first1, *first2)) in algo_equal()
62 return first1 == last1 && first2 == last2; in algo_equal()
66 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2) in algo_equal() argument
[all …]
|
| /third_party/boost/boost/range/algorithm/ |
| D | equal.hpp | 27 inline bool equal_impl( SinglePassTraversalReadableIterator1 first1, in equal_impl() argument
39 if (first1 == last1) in equal_impl()
49 if (*first1 != *first2) in equal_impl()
52 ++first1; in equal_impl()
66 inline bool equal_impl( SinglePassTraversalReadableIterator1 first1, in equal_impl() argument
79 if (first1 == last1) in equal_impl()
89 if (!pred(*first1, *first2)) in equal_impl()
92 ++first1; in equal_impl()
105 inline bool equal_impl( RandomAccessTraversalReadableIterator1 first1, in equal_impl() argument
112 return ((last1 - first1) == (last2 - first2)) in equal_impl()
[all …]
|
| /third_party/boost/libs/serialization/src/ |
| D | codecvt_null.cpp | 24 const wchar_t * first1, in do_out() argument
31 while(first1 != last1){ in do_out()
36 next1 = first1; in do_out()
40 * reinterpret_cast<wchar_t *>(first2) = * first1++; in do_out()
44 next1 = first1; in do_out()
52 const char * first1, in do_in() argument
66 if (first1 == last1) in do_in()
70 if(static_cast<int>(sizeof(wchar_t)) > (last1 - first1)){ in do_in()
71 next1 = first1; in do_in()
75 *first2++ = * reinterpret_cast<const wchar_t *>(first1); in do_in()
[all …]
|
| /third_party/boost/boost/algorithm/cxx14/ |
| D | equal.hpp | 30 bool equal ( RandomAccessIterator1 first1, RandomAccessIterator1 last1, in equal() argument
35 if ( std::distance ( first1, last1 ) != std::distance ( first2, last2 )) in equal()
39 for (; first1 != last1; ++first1, ++first2) in equal()
40 if (!pred(*first1, *first2)) in equal()
47 bool equal ( InputIterator1 first1, InputIterator1 last1, in equal() argument
51 for (; first1 != last1 && first2 != last2; ++first1, ++first2 ) in equal()
52 if ( !pred(*first1, *first2 )) in equal()
55 return first1 == last1 && first2 == last2; in equal()
71 bool equal ( InputIterator1 first1, InputIterator1 last1, in equal() argument
75 first1, last1, first2, last2, pred, in equal()
[all …]
|
| D | mismatch.hpp | 33 InputIterator1 first1, InputIterator1 last1, in mismatch() argument
37 for (; first1 != last1 && first2 != last2; ++first1, ++first2) in mismatch()
38 if ( !pred ( *first1, *first2 )) in mismatch()
40 return std::pair<InputIterator1, InputIterator2>(first1, first2); in mismatch()
53 InputIterator1 first1, InputIterator1 last1, in mismatch() argument
56 for (; first1 != last1 && first2 != last2; ++first1, ++first2) in mismatch()
57 if ( *first1 != *first2 ) in mismatch()
59 return std::pair<InputIterator1, InputIterator2>(first1, first2); in mismatch()
|
| /third_party/boost/libs/graph/test/ |
| D | floyd_warshall_test.cpp | 182 typename boost::graph_traits< Graph >::vertex_iterator first1, in acceptance_test() local
184 for (boost::tie(first1, last1) = boost::vertices(g); in acceptance_test()
185 first1 != last1; first1++) in acceptance_test()
190 if (matrix2[*first1][*first2] != matrix[*first1][*first2]) in acceptance_test()
194 << index[*first1] << " " << index[*first2] in acceptance_test()
195 << " Bellman results: " << matrix2[*first1][*first2] in acceptance_test()
196 << " floyd 1 results " << matrix[*first1][*first2] in acceptance_test()
200 if (matrix2[*first1][*first2] != matrix3[*first1][*first2]) in acceptance_test()
204 << index[*first1] << " " << index[*first2] in acceptance_test()
205 << " Bellman results: " << matrix2[*first1][*first2] in acceptance_test()
[all …]
|
| /third_party/abseil-cpp/absl/algorithm/ |
| D | algorithm.h | 45 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
49 if (first1 == last1) return first2 == last2; in EqualImpl()
51 if (!pred(*first1, *first2)) return false; in EqualImpl()
52 ++first1; in EqualImpl()
58 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
61 return (last1 - first1 == last2 - first2) && in EqualImpl()
62 std::equal(first1, last1, first2, std::forward<Pred>(pred)); in EqualImpl()
69 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
73 return (last1 - first1 == last2 - first2) && in EqualImpl()
74 std::equal(first1, last1, first2); in EqualImpl()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/algorithm/ |
| D | algorithm.h | 45 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
49 if (first1 == last1) return first2 == last2; in EqualImpl()
51 if (!pred(*first1, *first2)) return false; in EqualImpl()
52 ++first1; in EqualImpl()
58 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
61 return (last1 - first1 == last2 - first2) && in EqualImpl()
62 std::equal(first1, last1, first2, std::forward<Pred>(pred)); in EqualImpl()
69 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
73 return (last1 - first1 == last2 - first2) && in EqualImpl()
74 std::equal(first1, last1, first2); in EqualImpl()
[all …]
|
| /third_party/boost/boost/poly_collection/ |
| D | algorithm.hpp | 221 const Iterator& first1,const Iterator& last1, in BOOST_POLY_COLLECTION_DEFINE_OVERLOAD_SET()
224 return generic_find<std_find_first_of,Ts...>(first1,last1,first2,last2); in BOOST_POLY_COLLECTION_DEFINE_OVERLOAD_SET()
233 const Iterator& first1,const Iterator& last1, in find_first_of() argument
236 return generic_find<std_find_first_of,Ts...>(first1,last1,first2,last2,pred); in find_first_of()
337 InputIterator1 first1,InputIterator1 last1, in operator ()()
340 while(first1!=last1&&pred(*first1,*first2)){ in operator ()()
341 ++first1; in operator ()()
344 return first1; in operator ()()
352 InputIterator1 first1,InputIterator1 last1, in operator ()()
356 while(first1!=last1&&first2!=last2&&pred(*first1,*first2)){ in operator ()()
[all …]
|
| /third_party/boost/boost/compute/algorithm/ |
| D | mismatch.hpp | 38 mismatch(InputIterator1 first1, in mismatch() argument
49 InputIterator2 last2 = first2 + std::distance(first1, last1); in mismatch()
56 boost::make_tuple(first1, first2) in mismatch()
71 return std::make_pair(iter, first2 + std::distance(first1, iter)); in mismatch()
77 mismatch(InputIterator1 first1, in mismatch() argument
85 if(std::distance(first1, last1) < std::distance(first2, last2)){ in mismatch()
86 return ::boost::compute::mismatch(first1, last1, first2, queue); in mismatch()
90 first1, first1 + std::distance(first2, last2), first2, queue in mismatch()
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/ |
| D | mismatch.hpp | 38 mismatch(InputIterator1 first1, in mismatch() argument
49 InputIterator2 last2 = first2 + std::distance(first1, last1); in mismatch()
56 boost::make_tuple(first1, first2) in mismatch()
71 return std::make_pair(iter, first2 + std::distance(first1, iter)); in mismatch()
77 mismatch(InputIterator1 first1, in mismatch() argument
85 if(std::distance(first1, last1) < std::distance(first2, last2)){ in mismatch()
86 return ::boost::compute::mismatch(first1, last1, first2, queue); in mismatch()
90 first1, first1 + std::distance(first2, last2), first2, queue in mismatch()
|
| /third_party/boost/boost/compute/algorithm/detail/ |
| D | merge_with_merge_path.hpp | 45 void set_range(InputIterator1 first1, in set_range() argument
65 first1[expr<uint_>("start1")]) << "))\n" << in set_range()
68 " = " << first1[expr<uint_>("start1")] << ";\n" << in set_range()
83 " = " << first1[expr<uint_>("start1")] << ";\n" << in set_range()
99 void set_range(InputIterator1 first1, in set_range() argument
108 set_range(first1, first2, tile_first1, tile_last1, tile_first2, result, less_than); in set_range()
142 merge_with_merge_path(InputIterator1 first1, in merge_with_merge_path() argument
155 size_t count1 = iterator_range_size(first1, last1); in merge_with_merge_path()
164 tiling_kernel.set_range(first1, last1, first2, last2, in merge_with_merge_path()
176 merge_kernel.set_range(first1, first2, tile_a.begin(), tile_a.end(), in merge_with_merge_path()
[all …]
|
| /third_party/boost/boost/multi_index/detail/ |
| D | rnd_index_ops.hpp | 86 BOOST_DEDUCED_TYPENAME Node::impl_ptr_pointer first1,Compare comp) in random_access_index_inplace_merge() argument
95 last0=first1, in random_access_index_inplace_merge()
98 while(first0!=last0&&first1!=last1){ in random_access_index_inplace_merge()
100 const_cast<const value_type&>(Node::from_impl(*first1)->value()), in random_access_index_inplace_merge()
102 *out++=*first1++; in random_access_index_inplace_merge()
109 std::copy(&*first1,&*last1,&*out); in random_access_index_inplace_merge()
111 first1=ptrs.begin(); in random_access_index_inplace_merge()
113 while(first1!=last1){ in random_access_index_inplace_merge()
114 *first1=*out++; in random_access_index_inplace_merge()
115 (*first1)->up()=first1; in random_access_index_inplace_merge()
[all …]
|
| D | seq_index_ops.hpp | 65 iterator first1=y.begin(),last1=y.end(); in sequenced_index_merge() local
66 while(first0!=last0&&first1!=last1){ in sequenced_index_merge()
67 if(comp(*first1,*first0))x.splice(first0,y,first1++); in sequenced_index_merge()
70 x.splice(last0,y,first1,last1); in sequenced_index_merge()
89 impl_pointer first1=y->next(); in sequenced_index_collate() local
91 while(first0!=last0&&first1!=last1){ in sequenced_index_collate()
93 Node::from_impl(first1)->value(),Node::from_impl(first0)->value())){ in sequenced_index_collate()
94 impl_pointer tmp=first1->next(); in sequenced_index_collate()
95 impl_type::relink(first0,first1); in sequenced_index_collate()
96 first1=tmp; in sequenced_index_collate()
[all …]
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/detail/ |
| D | merge_with_merge_path.hpp | 45 void set_range(InputIterator1 first1, in set_range() argument
65 first1[expr<uint_>("start1")]) << "))\n" << in set_range()
68 " = " << first1[expr<uint_>("start1")] << ";\n" << in set_range()
83 " = " << first1[expr<uint_>("start1")] << ";\n" << in set_range()
99 void set_range(InputIterator1 first1, in set_range() argument
108 set_range(first1, first2, tile_first1, tile_last1, tile_first2, result, less_than); in set_range()
142 merge_with_merge_path(InputIterator1 first1, in merge_with_merge_path() argument
155 size_t count1 = iterator_range_size(first1, last1); in merge_with_merge_path()
164 tiling_kernel.set_range(first1, last1, first2, last2, in merge_with_merge_path()
176 merge_kernel.set_range(first1, first2, tile_a.begin(), tile_a.end(), in merge_with_merge_path()
[all …]
|
| /third_party/boost/libs/hana/include/boost/hana/detail/ |
| D | algorithm.hpp | 71 constexpr bool lexicographical_compare(InputIter1 first1, InputIter1 last1, in lexicographical_compare() argument
75 for (; first2 != last2; ++first1, ++first2) { in lexicographical_compare()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
85 constexpr bool lexicographical_compare(InputIter1 first1, InputIter1 last1, in lexicographical_compare() argument
87 { return detail::lexicographical_compare(first1, last1, first2, last2, hana::_ < hana::_); } in lexicographical_compare()
91 constexpr bool equal(InputIter1 first1, InputIter1 last1, in equal() argument
95 for (; first1 != last1 && first2 != last2; ++first1, ++first2) in equal()
96 if (!pred(*first1, *first2)) in equal()
98 return first1 == last1 && first2 == last2; in equal()
[all …]
|
| /third_party/boost/boost/hana/detail/ |
| D | algorithm.hpp | 71 constexpr bool lexicographical_compare(InputIter1 first1, InputIter1 last1, in lexicographical_compare() argument
75 for (; first2 != last2; ++first1, ++first2) { in lexicographical_compare()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
85 constexpr bool lexicographical_compare(InputIter1 first1, InputIter1 last1, in lexicographical_compare() argument
87 { return detail::lexicographical_compare(first1, last1, first2, last2, hana::_ < hana::_); } in lexicographical_compare()
91 constexpr bool equal(InputIter1 first1, InputIter1 last1, in equal() argument
95 for (; first1 != last1 && first2 != last2; ++first1, ++first2) in equal()
96 if (!pred(*first1, *first2)) in equal()
98 return first1 == last1 && first2 == last2; in equal()
[all …]
|
| /third_party/boost/libs/iostreams/test/detail/ |
| D | null_padded_codecvt.hpp | 72 do_in( state_type& state, const char* first1, const char* last1, in do_in() argument
79 next1 = first1; in do_in()
104 do_out( state_type& state, const wchar_t* first1, const wchar_t* last1, in do_out() argument
111 next1 = first1; in do_out()
158 const char* first1, const char* last1, in do_length() argument
163 const char* next1 = first1; in do_length()
191 do_in( state_type&, const char* first1, const char* last1, in do_in() argument
196 for ( next1 = first1, next2 = first2; in do_in()
216 do_out( state_type&, const wchar_t* first1, const wchar_t* last1, in do_out() argument
221 for ( next1 = first1, next2 = first2; in do_out()
[all …]
|
| /third_party/boost/boost/container/detail/ |
| D | algorithm.hpp | 122 InputIt find_first_of(InputIt first1, InputIt last1, ForwardIt first2, ForwardIt last2, BinaryPredi… in find_first_of() argument
124 for (; first1 != last1; ++first1) { in find_first_of()
126 if (p(*first1, *it)) { in find_first_of()
127 return first1; in find_first_of()
135 ForwardIt1 search(ForwardIt1 first1, ForwardIt1 last1, in search() argument
138 for (; ; ++first1) { in search()
139 ForwardIt1 it = first1; in search()
142 return first1; in search()
|