| /external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
22 template <class Iter1, class Iter2>
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia));
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia));
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1))
[all...] |
| search_pred.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
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));
45 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
22 template <class Iter1, class Iter2>
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia));
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia));
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1))
[all...] |
| search_pred.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2>
13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type>
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));
45 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1))
[all...] |
| /external/libcxx/test/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>
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));
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15))
[all...] |
| find_end_pred.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2,
13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
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));
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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>
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));
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15))
[all...] |
| find_end_pred.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2,
13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
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));
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15))
[all...] |
| /external/libcxx/test/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...] |
| 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);
24 template <class Iter1, class Iter2>
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...] |
| 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);
24 template <class Iter1, class Iter2>
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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>
17 // Iter2 first2, Iter2 last2, Compare comp);
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/chromium_org/third_party/icu/source/samples/uciter8/ |
| uciter8.c | 46 UCharIterator *iter2, const char *n2) {
52 pos2=iter2->getIndex(iter2, UITER_LENGTH);
67 pos2=iter2->move(iter2, middle, UITER_ZERO);
75 c2=iter2->current(iter2);
84 c2=iter2->next(iter2);
94 c2=iter2->previous(iter2)
307 UCharIterator iter1, iter2; local
[all...] |
| /external/icu/icu4c/source/samples/uciter8/ |
| uciter8.c | 46 UCharIterator *iter2, const char *n2) {
52 pos2=iter2->getIndex(iter2, UITER_LENGTH);
67 pos2=iter2->move(iter2, middle, UITER_ZERO);
75 c2=iter2->current(iter2);
84 c2=iter2->next(iter2);
94 c2=iter2->previous(iter2)
307 UCharIterator iter1, iter2; local
[all...] |
| /external/libcxx/test/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>
18 // Iter2::reference>::result_type>::result_type>
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>
41 test(Iter1(a), Iter1(a), Iter2(b), 0, 0);
42 test(Iter1(a), Iter1(a), Iter2(b), 10, 10)
[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);
45 test(Iter1(a), Iter1(a), Iter2(b), 10, 10);
46 test(Iter1(a), Iter1(a+1), Iter2(b), 1, 7);
47 test(Iter1(a), Iter1(a+1), Iter2(b), 10, 70)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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>
18 // Iter2::reference>::result_type>::result_type>
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>
41 test(Iter1(a), Iter1(a), Iter2(b), 0, 0);
42 test(Iter1(a), Iter1(a), Iter2(b), 10, 10)
[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);
45 test(Iter1(a), Iter1(a), Iter2(b), 10, 10);
46 test(Iter1(a), Iter1(a+1), Iter2(b), 1, 7);
47 test(Iter1(a), Iter1(a+1), Iter2(b), 10, 70)
[all...] |