| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| hash.pred.pass.cpp | 55 template <typename Iter1, typename Iter2>
56 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
66 template <class Iter1, class Iter2>
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| pred.pass.cpp | 51 template <typename Iter1, typename Iter2>
52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
60 template <class Iter1, class Iter2>
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| hash.pass.cpp | 45 template <typename Iter1, typename Iter2>
46 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned /*max_count*/) {
53 template <class Iter1, class Iter2>
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| hash.pred.pass.cpp | 55 template <typename Iter1, typename Iter2>
56 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
66 template <class Iter1, class Iter2>
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| pred.pass.cpp | 51 template <typename Iter1, typename Iter2>
52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
60 template <class Iter1, class Iter2>
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| hash.pass.cpp | 44 template <typename Iter1, typename Iter2>
45 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned /*max_count*/) {
52 template <class Iter1, class Iter2>
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| hash.pred.pass.cpp | 54 template <typename Iter1, typename Iter2>
55 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
65 template <class Iter1, class Iter2>
71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| pred.pass.cpp | 50 template <typename Iter1, typename Iter2>
51 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
59 template <class Iter1, class Iter2>
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
14 // Iter1
15 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
22 template <class Iter1, class Iter2>
29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1));
31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18))
[all...] |
| find_end_pred.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2,
13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
15 // Iter1
16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
33 template <class Iter1, class Iter2>
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1));
45 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18))
[all...] |
| /external/libcxx/test/std/numerics/numeric.ops/inner.product/ |
| inner_product.pass.cpp | 12 // template <InputIterator Iter1, InputIterator Iter2, MoveConstructible T>
13 // requires HasMultiply<Iter1::reference, Iter2::reference>
14 // && HasPlus<T, HasMultiply<Iter1::reference, Iter2::reference>::result_type>
17 // HasMultiply<Iter1::reference,
20 // inner_product(Iter1 first1, Iter1 last1, Iter2 first2, T init);
27 template <class Iter1, class Iter2, class T>
29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x)
34 template <class Iter1, class Iter2
[all...] |
| inner_product_comp.pass.cpp | 12 // template <InputIterator Iter1, InputIterator Iter2, MoveConstructible T,
14 // Callable<auto, Iter1::reference, Iter2::reference> BinaryOperation2>
20 // inner_product(Iter1 first1, Iter1 last1, Iter2 first2,
29 template <class Iter1, class Iter2, class T>
31 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x)
37 template <class Iter1, class Iter2>
44 test(Iter1(a), Iter1(a), Iter2(b), 1, 1)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/inner.product/ |
| inner_product.pass.cpp | 12 // template <InputIterator Iter1, InputIterator Iter2, MoveConstructible T>
13 // requires HasMultiply<Iter1::reference, Iter2::reference>
14 // && HasPlus<T, HasMultiply<Iter1::reference, Iter2::reference>::result_type>
17 // HasMultiply<Iter1::reference,
20 // inner_product(Iter1 first1, Iter1 last1, Iter2 first2, T init);
27 template <class Iter1, class Iter2, class T>
29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x)
34 template <class Iter1, class Iter2
[all...] |
| inner_product_comp.pass.cpp | 12 // template <InputIterator Iter1, InputIterator Iter2, MoveConstructible T,
14 // Callable<auto, Iter1::reference, Iter2::reference> BinaryOperation2>
20 // inner_product(Iter1 first1, Iter1 last1, Iter2 first2,
29 template <class Iter1, class Iter2, class T>
31 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x)
37 template <class Iter1, class Iter2>
44 test(Iter1(a), Iter1(a), Iter2(b), 1, 1)
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pred.pass.cpp | 51 template <typename Iter1, typename Iter2>
52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
59 template <class Iter1, class Iter2>
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pred.pass.cpp | 51 template <typename Iter1, typename Iter2>
52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
59 template <class Iter1, class Iter2>
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
14 // constexpr Iter1 // constexpr after C++17
15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
60 template <class Iter1, class Iter2>
66 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia));
67 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia))
[all...] |
| search_pred.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
14 // constexpr Iter1 // constexpr after C++17
15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
46 template <class Iter1, class Iter2>
53 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia));
56 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
14 // Iter1
15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
32 template <class Iter1, class Iter2>
39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia));
42 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia))
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
14 // constexpr Iter1 // constexpr after C++17
15 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
42 template <class Iter1, class Iter2>
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1));
51 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 12 // template<InputIterator Iter1, InputIterator Iter2>
13 // requires HasLess<Iter1::value_type, Iter2::value_type>
14 // && HasLess<Iter2::value_type, Iter1::value_type>
16 // lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
23 template <class Iter1, class Iter2>
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)));
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa)))
[all...] |
| lexicographical_compare_comp.pass.cpp | 12 // template<InputIterator Iter1, InputIterator Iter2, CopyConstructible Compare>
13 // requires Predicate<Compare, Iter1::value_type, Iter2::value_type>
14 // && Predicate<Compare, Iter2::value_type, Iter1::value_type>
16 // lexicographical_compare(Iter1 first1, Iter1 last1,
25 template <class Iter1, class Iter2>
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 12 // template<InputIterator Iter1, InputIterator Iter2>
13 // requires HasLess<Iter1::value_type, Iter2::value_type>
14 // && HasLess<Iter2::value_type, Iter1::value_type>
16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
36 template <class Iter1, class Iter2>
49 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib)));
50 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1)))
[all...] |
| includes_comp.pass.cpp | 12 // template<InputIterator Iter1, InputIterator Iter2, typename Compare>
13 // requires Predicate<Compare, Iter1::value_type, Iter2::value_type>
14 // && Predicate<Compare, Iter2::value_type, Iter1::value_type>
16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Compare comp);
39 template <class Iter1, class Iter2>
52 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
53 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 12 // template<InputIterator Iter1, InputIterator Iter2>
13 // requires HasLess<Iter1::value_type, Iter2::value_type>
14 // && HasLess<Iter2::value_type, Iter1::value_type>
16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
23 template <class Iter1, class Iter2>
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib)));
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1)))
[all...] |
