/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> 14 // Iter1 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)) [all...] |
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...] |
/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> 14 // Iter1 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)) [all...] |
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/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...] |
/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> 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/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...] |
/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> 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...] |
/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> 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/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...] |
/external/llvm/include/llvm/ADT/ |
SparseBitVector.h | 569 ElementListConstIter Iter1 = Elements.begin(); 572 for (; Iter1 != Elements.end() && Iter2 != RHS.Elements.end(); 573 ++Iter1, ++Iter2) { 574 if (*Iter1 != *Iter2) 577 return Iter1 == Elements.end() && Iter2 == RHS.Elements.end(); 583 ElementListIter Iter1 = Elements.begin(); 591 if (Iter1 == Elements.end() || Iter1->index() > Iter2->index()) { 592 Elements.insert(Iter1, 596 } else if (Iter1->index() == Iter2->index()) [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.swap/ |
swap_ranges.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2> 13 // requires HasSwap<Iter1::reference, Iter2::reference> 15 // swap_ranges(Iter1 first1, Iter1 last1, Iter2 first2); 25 template<class Iter1, class Iter2> 31 Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j)); 43 template<class Iter1, class Iter2> 53 Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j)) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.swap/ |
swap_ranges.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2> 13 // requires HasSwap<Iter1::reference, Iter2::reference> 15 // swap_ranges(Iter1 first1, Iter1 last1, Iter2 first2); 25 template<class Iter1, class Iter2> 31 Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j)); 43 template<class Iter1, class Iter2> 53 Iter2 r = std::swap_ranges(Iter1(i), Iter1(i+3), Iter2(j)) [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
set_difference.pass.cpp | 26 template <class Iter1, class Iter2, class OutIter> 37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), 43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
|
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
set_intersection.pass.cpp | 26 template <class Iter1, class Iter2, class OutIter> 37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), 41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
set_intersection_comp.pass.cpp | 28 template <class Iter1, class Iter2, class OutIter> 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), 43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
set_symmetric_difference.pass.cpp | 27 template <class Iter1, class Iter2, class OutIter> 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), 42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|