| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/range/algorithm/ |
| H A D | equal.hpp | 30 SinglePassTraversalReadableIterator2 last2, in equal_impl() argument
40 return first2 == last2; in equal_impl()
45 if (first2 == last2) in equal_impl()
69 SinglePassTraversalReadableIterator2 last2, in equal_impl() argument
80 return first2 == last2; in equal_impl()
85 if (first2 == last2) in equal_impl()
108 RandomAccessTraversalReadableIterator2 last2, in equal_impl() argument
112 return ((last1 - first1) == (last2 - first2)) in equal_impl()
122 RandomAccessTraversalReadableIterator2 last2, in equal_impl() argument
127 return ((last1 - first1) == (last2 - first2)) in equal_impl()
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/intrusive/detail/ |
| H A D | algorithm.hpp | 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()
71 InputIterator2 first2, InputIterator2 last2, in algo_lexicographical_compare() argument
75 if (first2 == last2 || *first2 < *first1) return false; in algo_lexicographical_compare()
79 return (first2 != last2); in algo_lexicographical_compare()
84 InputIterator2 first2, InputIterator2 last2) in algo_lexicographical_compare() argument
85 { return (algo_lexicographical_compare)(first1, last1, first2, last2, algo_pred_less()); } in algo_lexicographical_compare()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/move/algo/detail/ |
| H A D | insertion_sort.hpp | 44 BirdirectionalIterator last2 = first2; in insertion_sort_op() local
45 op(first1, last2); in insertion_sort_op()
46 for (++last2; ++first1 != last1; ++last2){ in insertion_sort_op()
47 BirdirectionalIterator j2 = last2; in insertion_sort_op()
103 BirdirectionalRawIterator last2 = first2; in insertion_sort_uninitialized_copy() local
104 ::new((iterator_to_raw_pointer)(last2), boost_move_new_t()) value_type(move(*first1)); in insertion_sort_uninitialized_copy()
107 for (++last2; ++first1 != last1; ++last2){ in insertion_sort_uninitialized_copy()
108 BirdirectionalRawIterator j2 = last2; in insertion_sort_uninitialized_copy()
|
| H A D | merge.hpp | 163 , RandIt const last2 in op_merge_left() argument
167 for(RandIt first2=last1; first2 != last2; ++buf_first){ in op_merge_left()
169 op(forward_t(), first2, last2, buf_first); in op_merge_left()
194 (RandIt buf_first, RandIt first1, RandIt const last1, RandIt const last2, Compare comp) in merge_left() argument
196 op_merge_left(buf_first, first1, last1, last2, comp, move_op()); in merge_left()
205 (RandIt buf_first, RandIt first1, RandIt const last1, RandIt const last2, Compare comp) in swap_merge_left() argument
207 op_merge_left(buf_first, first1, last1, last2, comp, swap_op()); in swap_merge_left()
212 (RandIt const first1, RandIt last1, RandIt last2, RandIt buf_last, Compare comp, Op op) in op_merge_right() argument
216 if(last2 == first2){ in op_merge_right()
220 --last2; in op_merge_right()
[all …]
|
| H A D | adaptive_sort_merge.hpp | 403 , RandIt2 &rfirst2, RandIt2 const last2 in op_buffered_partial_merge_to_range1_and_buffer() argument
413 if(first1 != last1 && first2 != last2){ in op_buffered_partial_merge_to_range1_and_buffer()
420 if(first2 == last2){ in op_buffered_partial_merge_to_range1_and_buffer()
464 (RandIt first1, RandIt last1, RandIt const last2, bool *const pis_range1_A, Compare comp) in partial_merge_bufferless_impl() argument
466 if(last1 == last2){ in partial_merge_bufferless_impl()
473 last1 = boost::movelib::lower_bound(last1, last2, *first1, comp); in partial_merge_bufferless_impl()
475 if(last1 == last2){ in partial_merge_bufferless_impl()
490 (RandIt first1, RandIt last1, RandIt const last2, bool *const pis_range1_A, Compare comp) in partial_merge_bufferless() argument
492 return *pis_range1_A ? partial_merge_bufferless_impl(first1, last1, last2, pis_range1_A, comp) in partial_merge_bufferless()
493 … : partial_merge_bufferless_impl(first1, last1, last2, pis_range1_A, antistable<Compare>(comp)); in partial_merge_bufferless()
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/ta/vector_util/ |
| H A D | c_algo.c | 83 c_iterator last2, in c_lexicographical_compare() argument
87 !ITER_EQUAL(first2, last2); in c_lexicographical_compare()
95 return (ITER_EQUAL(first1, last1) && !ITER_EQUAL(first2, last2)); in c_lexicographical_compare()
307 c_iterator last2, in c_search() argument
311 ITER_EQUAL(first2, last2)) in c_search()
318 if(ITER_EQUAL(tmp, last2)) in c_search()
359 if(ITER_EQUAL(p, last2)) in c_search()
|
| H A D | c_algo.h | 88 c_iterator last2,
106 c_iterator last2,
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/container/detail/ |
| H A D | algorithm.hpp | 122 InputIt find_first_of(InputIt first1, InputIt last1, ForwardIt first2, ForwardIt last2, BinaryPredi… in find_first_of() argument
125 for (ForwardIt it = first2; it != last2; ++it) { in find_first_of()
136 ForwardIt2 first2, ForwardIt2 last2, BinaryPredicate p) in search() argument
141 if (it2 == last2) { in search()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/move/ |
| H A D | adl_move_swap.hpp | 256 BidirIt2 adl_move_swap_ranges_backward(BidirIt1 first1, BidirIt1 last1, BidirIt2 last2) in adl_move_swap_ranges_backward() argument
259 ::boost::adl_move_swap(*(--last1), *(--last2)); in adl_move_swap_ranges_backward()
261 return last2; in adl_move_swap_ranges_backward()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/spirit/home/support/algorithm/ |
| H A D | any_if_ns.hpp | 49 , Last1 const& last1, Last2 const& last2, F& f, mpl::false_) in any_if_ns() argument
55 , last1, last2 in any_if_ns()
|
| H A D | any_if.hpp | 181 , Last2 const& last2, F& f, mpl::false_) in any_if() argument
190 , last1, last2 in any_if()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/type_index/detail/ |
| H A D | compile_time_type_info.hpp | 110 ForwardIterator2 last2) BOOST_NOEXCEPT in constexpr_search() argument
112 if (first2 == last2) { in constexpr_search()
123 if (it2 == last2) return first1; in constexpr_search()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/strategies/agnostic/ |
| H A D | hull_graham_andrew.hpp | 333 point_type const& last2 = *rit++; in add_to_hull() local
335 if (Factor * side::apply(*rit, last, last2) <= 0) in add_to_hull()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/view/transform_view/detail/ |
| H A D | end_impl.hpp | 62 return type(s.last1(), s.last2(), s.f); in call()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/view/transform_view/ |
| H A D | transform_view.hpp | 73 last2_type last2() const { return fusion::end(seq2); } in last2() function
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/overlay/ |
| H A D | get_turn_info_for_endpoint.hpp | 398 bool first1, bool last1, bool first2, bool last2, in handle_internal()
410 if ( !first2 && !last2 ) in handle_internal()
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/ |
| H A D | algorithm | 57 ForwardIterator2 first2, ForwardIterator2 last2);
62 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
67 ForwardIterator2 first2, ForwardIterator2 last2);
72 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
97 InputIterator2 first2, InputIterator2 last2); // **C++14**
107 InputIterator2 first2, InputIterator2 last2,
117 InputIterator2 first2, InputIterator2 last2); // **C++14**
127 InputIterator2 first2, InputIterator2 last2,
138 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
148 ForwardIterator2 first2, ForwardIterator2 last2,
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/ |
| H A D | algorithm | 57 ForwardIterator2 first2, ForwardIterator2 last2);
62 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
67 ForwardIterator2 first2, ForwardIterator2 last2);
72 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
97 InputIterator2 first2, InputIterator2 last2); // **C++14**
107 InputIterator2 first2, InputIterator2 last2,
117 InputIterator2 first2, InputIterator2 last2); // **C++14**
127 InputIterator2 first2, InputIterator2 last2,
138 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
148 ForwardIterator2 first2, ForwardIterator2 last2,
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/container/ |
| H A D | vector.hpp | 2100 const const_iterator last1(x.cend()), last2(y.cend()); in operator <() local
2101 for ( ; (first1 != last1) && (first2 != last2); ++first1, ++first2 ) { in operator <()
2105 return (first1 == last1) && (first2 != last2); in operator <()
|