/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
H A D | equal_range.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value) argument 28 std::pair<Iter, Iter> i = std::equal_range(first, last, value); 29 for (Iter j = first; j != i.first; ++j) 31 for (Iter j = i.first; j != last; ++j) 33 for (Iter j = first; j != i.second; ++j)
|
H A D | equal_range_comp.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value, Compare comp); 27 test(Iter first, Iter last, const T& value) argument 29 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>()); 30 for (Iter j = first; j != i.first; ++j) 32 for (Iter j = i.first; j != last; ++j) 34 for (Iter j = first; j != i.second; ++j)
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
H A D | lower_bound.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) argument 27 Iter i = std::lower_bound(first, last, value); 28 for (Iter j = first; j != i; ++j)
|
H A D | lower_bound_comp.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value) argument 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); 29 for (Iter j = first; j != i; ++j)
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
H A D | upper_bound.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) argument 27 Iter i = std::upper_bound(first, last, value); 28 for (Iter j = first; j != i; ++j)
|
H A D | upper_bound_comp.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value, Compare comp); 26 test(Iter first, Iter last, const T& value) argument 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); 29 for (Iter j = first; j != i; ++j)
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
H A D | max_element.pass.cpp | 15 // max_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 Iter i = std::max_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j)
|
H A D | min_element.pass.cpp | 15 // min_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 Iter i = std::min_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j)
|
H A D | minmax_element.pass.cpp | 15 // minmax_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 std::pair<Iter, Iter> p = std::minmax_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j) 31 assert(!(*j < *p.first)); 37 assert(p.first == last); 71 assert(base(p.first) == a);
|
H A D | max_element_comp.pass.cpp | 15 // max_element(Iter first, Iter last, Compare comp); 25 test(Iter first, Iter last) argument 27 Iter i = std::max_element(first, last, std::greater<int>()); 28 if (first != last) 30 for (Iter j = first; j != last; ++j) 62 void test_eq0(Iter first, Iter last, Pred p) argument 64 assert(first == std::max_element(first, last, p));
|
H A D | min_element_comp.pass.cpp | 15 // min_element(Iter first, Iter last, Compare comp); 25 test(Iter first, Iter last) argument 27 Iter i = std::min_element(first, last, std::greater<int>()); 28 if (first != last) 30 for (Iter j = first; j != last; ++j) 62 void test_eq0(Iter first, Iter last, Pred p) argument 64 assert(first == std::min_element(first, last, p));
|
H A D | minmax_element_comp.pass.cpp | 15 // minmax_element(Iter first, Iter last, Compare comp); 25 test(Iter first, Iter last) argument 29 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp); 30 if (first != last) 32 for (Iter j = first; j != last; ++j) 34 assert(!comp(*j, *p.first)); 40 assert(p.first == last); 76 assert(base(p.first) == a);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | construct_iter_iter.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last); 24 test(Iterator first, Iterator last) argument 26 C c(first, last); 28 assert(c.size() == std::distance(first, last)); 30 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 31 assert(*i == *first);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
H A D | construct_iter_iter.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last); 23 test(Iterator first, Iterator last) argument 25 C c(first, last); 27 assert(c.size() == std::distance(first, last)); 28 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 29 assert(*i == *first);
|
H A D | construct_iter_iter_alloc.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last, 24 test(Iterator first, Iterator last, const typename C::allocator_type& a) argument 26 C c(first, last, a); 28 assert(c.size() == std::distance(first, last)); 29 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i, ++first) 30 assert(*i == *first);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/iterator.primitives/iterator.operations/ |
H A D | distance.pass.cpp | 14 // distance(Iter first, Iter last); 18 // distance(Iter first, Iter last); 27 test(It first, It last, typename std::iterator_traits<It>::difference_type x) argument 29 assert(std::distance(first, last) == x);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.regex/re.regex.construct/ |
H A D | iter_iter.pass.cpp | 15 // basic_regex(ForwardIterator first, ForwardIterator last); 24 test(Iter first, Iter last, unsigned mc) argument 26 std::basic_regex<typename std::iterator_traits<Iter>::value_type> r(first, last);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_append/ |
H A D | iterator.pass.cpp | 13 // basic_string& append(InputIterator first, InputIterator last); 23 test(S s, It first, It last, S expected) argument 25 s.append(first, last);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_assign/ |
H A D | iterator.pass.cpp | 13 // basic_string& assign(InputIterator first, InputIterator last); 23 test(S s, It first, It last, S expected) argument 25 s.assign(first, last);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/meta/meta.unary/meta.unary.prop/ |
H A D | is_standard_layout.pass.cpp | 37 T1 first; member in struct:pair
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
H A D | pair.hpp | 31 typedef T1 first; typedef in struct:boost::mpl::pair 40 struct first struct in namespace:boost::mpl 43 typedef typename P::first type; 45 typedef typename aux::msvc_eti_base<P>::first type; 47 BOOST_MPL_AUX_LAMBDA_SUPPORT(1,first,(P)) 65 BOOST_MPL_AUX_NA_SPEC(1, first)
|
/ndk/tests/device/multi-static-instances/jni/ |
H A D | main.cpp | 15 A* first = A::instance(); local 18 if (first != second) { 19 fprintf(stderr, "ERROR: instance() returned two distinct addresses: %p %p\n", first, second); 22 printf("OK: instance() returned the same address twice: %p\n", first);
|
/ndk/tests/device/test-stlport_shared-exception/jni/ |
H A D | delete3.cpp | 13 static bool first; member in struct:Foo 16 if (first) 17 first = false; 19 throw first; 27 bool Foo::first = true; member in class:Foo
|
/ndk/tests/device/test-stlport_static-exception/jni/ |
H A D | delete3.cpp | 13 static bool first; member in struct:Foo 16 if (first) 17 first = false; 19 throw first; 27 bool Foo::first = true; member in class:Foo
|
/ndk/sources/android/crazy_linker/src/ |
H A D | crazy_linker_util_unittest.cpp | 187 int first = v.PopFirst(); local 189 EXPECT_EQ(n * 100, first);
|