Home
last modified time | relevance | path

Searched refs:search_n (Results 1 – 9 of 9) sorted by relevance

/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/
Dsearch_n.pass.cpp28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); in test()
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); in test()
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa)); in test()
31 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa)); in test()
32 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia)); in test()
33 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3)); in test()
34 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa)); in test()
35 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa)); in test()
36 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia)); in test()
37 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5) == Iter(ia+5)); in test()
[all …]
Dsearch_n_pred.pass.cpp39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); in test()
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); in test()
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa)); in test()
48 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa)); in test()
51 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia)); in test()
54 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3)); in test()
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa)); in test()
60 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa)); in test()
63 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia)); in test()
66 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5, count_equal()) == Iter(ia+5)); in test()
[all …]
/ndk/tests/device/test-stlport/unit/
Dalg_test.cpp130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2); in search_n_test()
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3); in search_n_test()
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4); in search_n_test()
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>()); in search_n_test()
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>()); in search_n_test()
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>()); in search_n_test()
195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end); in search_n_test()
202 CPPUNIT_ASSERT( search_n(array, array_end, 1, 1, equal_to<int>() ) == &array[1] ); in search_n_test()
/ndk/tests/device/test-gnustl-full/unit/
Dalg_test.cpp130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2); in search_n_test()
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3); in search_n_test()
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4); in search_n_test()
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>()); in search_n_test()
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>()); in search_n_test()
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>()); in search_n_test()
195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end); in search_n_test()
202 CPPUNIT_ASSERT( search_n(array, array_end, 1, 1, equal_to<int>() ) == &array[1] ); in search_n_test()
/ndk/sources/cxx-stl/stlport/stlport/stl/
D_algo.h129 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
132 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
D_algo.c246 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last, in search_n() function
260 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last, in search_n() function
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dalgorithm159 search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
163 search_n(ForwardIterator first, ForwardIterator last,
1577 // search_n
1659 search_n(_ForwardIterator __first, _ForwardIterator __last,
1669 search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_)
1672 return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>());
/ndk/tests/device/test-libc++-shared-full/jni/
DAndroid.mk209 $(call gen-test, algorithms/alg.nonmodifying/alg.search/search_n)
/ndk/tests/device/test-libc++-static-full/jni/
DAndroid.mk200 $(call gen-test, algorithms/alg.nonmodifying/alg.search/search_n)