| /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()
67 mismatch( InputIter1 first1, InputIter1 last1, in mismatch() argument
71 while( first1 != last1 && first2 != last2 && pred( *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()
113 find_first_not_of( ForwardIterator1 first1, ForwardIterator1 last1, in find_first_not_of() argument
117 while( first1 != last1 ) { in find_first_not_of()
136 find_last_of( BidirectionalIterator1 first1, BidirectionalIterator1 last1, in find_last_of() argument
139 if( first1 == last1 || first2 == last2 ) in find_last_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()
56 … if ( dest_count == 0 || dest_count != (std::size_t) std::count_if ( iter, last1, pred )) 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()
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
87 if ( std::distance ( first1, last1 ) != std::distance ( first2, last2 )) in is_permutation_tag()
[all …]
|
| /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()
74 (InputOutputIt1 first1, InputOutputIt1 last1, InputIt2 first2, InputIt2 last2, Compare comp ) in inplace_set_difference() argument
76 while (first1 != last1) { in inplace_set_difference()
79 return last1; in inplace_set_difference()
90 , boost::make_move_iterator(last1) in inplace_set_difference()
109 …(ForwardIt1 first1, ForwardIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt result, Compare co… in set_unique_difference() argument
111 while (first1 != last1) { in set_unique_difference()
116 while (++first1 != last1) { in set_unique_difference()
[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()
232 (RandIt first1, RandIt last1, RandIt const last2, bool *const pis_range1_A, Compare comp) in partial_merge_bufferless_impl() argument
234 if(last1 == last2){ in partial_merge_bufferless_impl()
238 if(first1 != last1 && comp(*last1, last1[-1])){ in partial_merge_bufferless_impl()
240 RandIt const old_last1 = last1; 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()
243 if(last1 == last2){ in partial_merge_bufferless_impl()
248 } while(last1 != first1 && !comp(*last1, *first1) ); in partial_merge_bufferless_impl()
[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()
46 for (++last2; ++first1 != last1; ++last2){ 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
70 insertion_sort_op(first1, last1, first2, comp, move_op()); in insertion_sort_copy()
97 (BirdirectionalIterator first1, BirdirectionalIterator const last1 in insertion_sort_uninitialized_copy() argument
102 if (first1 != last1){ in insertion_sort_uninitialized_copy()
107 for (++last2; ++first1 != last1; ++last2){ in insertion_sort_uninitialized_copy()
|
| /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()
36 inline void for_each2( Iterator1 first1 , Iterator1 last1 , Iterator2 first2 , Operation op ) in for_each2() argument
38 for( ; first1 != last1 ; ) 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()
52 …inline void for_each4( Iterator1 first1 , Iterator1 last1 , Iterator2 first2 , Iterator3 first3, I… in for_each4() argument
54 for( ; first1 != last1 ; ) in for_each4()
60 inline void for_each5( Iterator1 first1 , Iterator1 last1 , Iterator2 first2 , Iterator3 first3, in for_each5() argument
63 for( ; first1 != last1 ; ) in for_each5()
[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()
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()
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
67 { return (algo_equal)(first1, last1, first2, last2, algo_pred_equal()); } in algo_equal()
70 bool algo_lexicographical_compare (InputIterator1 first1, InputIterator1 last1, in algo_lexicographical_compare() argument
[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
81 while (next2 != last2 && next1 != last1) { in do_in()
82 while (next1 != last1) { in do_in()
104 do_out( state_type& state, const wchar_t* first1, const wchar_t* last1, in do_out() argument
113 while (next1 != last1 && next2 != last2) { in do_out()
130 return next1 == last1 ? in do_out()
158 const char* first1, const char* last1, in do_length() argument
164 while (result < len2 && next1 != last1) { in do_length()
165 while (next1 != last1) { in do_length()
191 do_in( state_type&, const char* first1, const char* last1, in do_in() argument
[all …]
|
| /third_party/boost/boost/range/algorithm/ |
| D | equal.hpp | 28 SinglePassTraversalReadableIterator1 last1, in equal_impl() argument
39 if (first1 == last1) in equal_impl()
67 SinglePassTraversalReadableIterator1 last1, in equal_impl() argument
79 if (first1 == last1) in equal_impl()
106 RandomAccessTraversalReadableIterator1 last1, in equal_impl() argument
112 return ((last1 - first1) == (last2 - first2)) in equal_impl()
113 && std::equal(first1, last1, first2); in equal_impl()
120 RandomAccessTraversalReadableIterator1 last1, in equal_impl() argument
127 return ((last1 - first1) == (last2 - first2)) in equal_impl()
128 && std::equal(first1, last1, first2, pred); in equal_impl()
[all …]
|
| D | swap_ranges.hpp | 26 void swap_ranges_impl(Iterator1 it1, Iterator1 last1, in swap_ranges_impl() argument
32 for (; it1 != last1; ++it1, ++it2) in swap_ranges_impl()
40 void swap_ranges_impl(Iterator1 it1, Iterator1 last1, in swap_ranges_impl() argument
46 BOOST_ASSERT( last2 - it2 >= last1 - it1 ); in swap_ranges_impl()
47 std::swap_ranges(it1, last1, it2); in swap_ranges_impl()
51 void swap_ranges_impl(Iterator1 first1, Iterator1 last1, in swap_ranges_impl() argument
54 swap_ranges_impl(first1, last1, first2, last2, in swap_ranges_impl()
|
| /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()
47 bool equal ( InputIterator1 first1, InputIterator1 last1, in equal() argument
51 for (; first1 != last1 && first2 != last2; ++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()
90 bool equal ( InputIterator1 first1, InputIterator1 last1, in equal() argument
94 first1, last1, first2, last2, in equal()
|
| D | is_permutation.hpp | 35 bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, in is_permutation() argument
41 ( first1, last1, first2, last2 ); in is_permutation()
42 if ( eq.first == last1 && eq.second == last2) in is_permutation()
45 eq.first, last1, eq.second, last2, in is_permutation()
64 bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, in is_permutation() argument
69 ( first1, last1, first2, last2, pred ); in is_permutation()
70 if ( eq.first == last1 && eq.second == last2) in is_permutation()
73 first1, last1, first2, last2, pred, in is_permutation()
|
| /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 ()()
352 InputIterator1 first1,InputIterator1 last1, in operator ()()
356 while(first1!=last1&&first2!=last2&&pred(*first1,*first2)){ in operator ()()
370 const Iterator& first1,const Iterator& last1, in mismatch() argument
373 auto it=generic_find<mismatch_alg,Ts...>(first1,last1,first2,pred); in mismatch()
[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()
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()
104 bool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2, in equal() argument
107 first1, last1, first2, last2, std::forward<Pred>(pred), in equal()
[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()
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()
104 bool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2, in equal() argument
107 first1, last1, first2, last2, std::forward<Pred>(pred), in equal()
[all …]
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/ |
| D | equal.hpp | 30 InputIterator1 last1, in equal() argument
37 last1, in equal()
39 queue).first == last1; in equal()
45 InputIterator1 last1, in equal() argument
52 if(std::distance(first1, last1) != std::distance(first2, last2)){ in equal()
56 return ::boost::compute::equal(first1, last1, first2, queue); in equal()
|
| D | inner_product.hpp | 37 InputIterator1 last1, in inner_product() argument
46 ptrdiff_t n = std::distance(first1, last1); in inner_product()
57 boost::make_tuple(last1, first2 + n) in inner_product()
73 InputIterator1 last1, in inner_product() argument
84 size_t count = detail::iterator_range_size(first1, last1); in inner_product()
87 last1, in inner_product()
|
| D | mismatch.hpp | 39 InputIterator1 last1, in mismatch() argument
49 InputIterator2 last2 = first2 + std::distance(first1, last1); in mismatch()
62 boost::make_tuple(last1, last2) in mismatch()
78 InputIterator1 last1, 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()
|
| /third_party/boost/boost/compute/algorithm/ |
| D | equal.hpp | 30 InputIterator1 last1, in equal() argument
37 last1, in equal()
39 queue).first == last1; in equal()
45 InputIterator1 last1, in equal() argument
52 if(std::distance(first1, last1) != std::distance(first2, last2)){ in equal()
56 return ::boost::compute::equal(first1, last1, first2, queue); in equal()
|
| D | inner_product.hpp | 37 InputIterator1 last1, in inner_product() argument
46 ptrdiff_t n = std::distance(first1, last1); in inner_product()
57 boost::make_tuple(last1, first2 + n) in inner_product()
73 InputIterator1 last1, in inner_product() argument
84 size_t count = detail::iterator_range_size(first1, last1); in inner_product()
87 last1, in inner_product()
|
| D | mismatch.hpp | 39 InputIterator1 last1, in mismatch() argument
49 InputIterator2 last2 = first2 + std::distance(first1, last1); in mismatch()
62 boost::make_tuple(last1, last2) in mismatch()
78 InputIterator1 last1, 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()
|
| /third_party/boost/boost/math/tools/ |
| D | norms.hpp | 248 size_t hamming_distance(ForwardIterator first1, ForwardIterator last1, ForwardIterator first2) in hamming_distance() argument
253 while (it1 != last1) in hamming_distance()
356 auto lp_distance(ForwardIterator first1, ForwardIterator last1, ForwardIterator first2, unsigned p) in lp_distance() argument
371 while(it1 != last1) in lp_distance()
381 while(it1 != last1) in lp_distance()
391 while(it1 != last1) in lp_distance()
412 auto l1_distance(ForwardIterator first1, ForwardIterator last1, ForwardIterator first2) in l1_distance() argument
424 while (it1 != last1) { in l1_distance()
432 while (it1 != last1) in l1_distance()
441 while(it1 != last1) in l1_distance()
[all …]
|
| /third_party/boost/boost/range/detail/ |
| D | join_iterator.hpp | 44 join_iterator_link(Iterator1 last1, Iterator2 first2) in join_iterator_link()
45 : last1(last1) in join_iterator_link()
50 Iterator1 last1; member
185 …join_iterator(unsigned int section, Iterator1 current1, Iterator1 last1, Iterator2 first2, Iterato… in join_iterator() argument
188 , m_link(link_t(last1, first2)) in join_iterator()
232 if (m_it.it1() == m_link.last1) in increment()
246 m_it.it1() = boost::prior(m_link.last1); in decrement()
285 + (other.m_it.it1() - m_link.last1); in distance_to()
294 result = (m_link.last1 - m_it.it1()) in distance_to()
317 m_it.it1() = m_link.last1 + r1_dist; in advance_from_range2()
[all …]
|
| /third_party/boost/boost/iostreams/detail/ |
| D | codecvt_helper.hpp | 88 in( State& state, const Extern* first1, const Extern* last1, in in()
92 return do_in(state, first1, last1, next1, first2, last2, next2); in in()
96 out( State& state, const Intern* first1, const Intern* last1, in out()
100 return do_out(state, first1, last1, next1, first2, last2, next2); in out()
116 const Extern* first1, const Extern* last1, in length()
119 return do_length(state, first1, last1, len2); in length()
149 const Extern* first1, const Extern* last1, in do_length()
152 return (std::min)(static_cast<std::size_t>(last1 - first1), len2); in do_length()
|
| /third_party/boost/libs/serialization/src/ |
| D | codecvt_null.cpp | 25 const wchar_t * last1, in do_out() argument
31 while(first1 != last1){ in do_out()
53 const char * last1, in do_in() argument
66 if (first1 == last1) in do_in()
70 if(static_cast<int>(sizeof(wchar_t)) > (last1 - first1)){ in do_in()
|