| /external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa));
31 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa));
32 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia));
33 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3));
34 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa));
35 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa));
36 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia))
[all...] |
| search_n_pred.pass.cpp | 14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
48 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa));
51 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia));
54 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3));
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa));
60 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa));
63 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia))
[all...] |
| Android.mk | 23 test_name := algorithms/alg.nonmodifying/alg.search/search_n
24 test_src := search_n.pass.cpp
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa));
31 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa));
32 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia));
33 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3));
34 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa));
35 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa));
36 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia))
[all...] |
| search_n_pred.pass.cpp | 14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
48 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa));
51 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia));
54 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3));
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa));
60 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa));
63 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia))
[all...] |
| /external/stlport/test/unit/ |
| alg_test.cpp | 126 //search_n
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
159 //search_n with predicate
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>());
195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end);
202 CPPUNIT_ASSERT( search_n(array, array_end, 1, 1, equal_to<int>() ) == &array[1] )
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| alg_test.cpp | 126 //search_n
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
159 //search_n with predicate
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>());
195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end);
202 CPPUNIT_ASSERT( search_n(array, array_end, 1, 1, equal_to<int>() ) == &array[1] )
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| alg_test.cpp | 126 //search_n
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
159 //search_n with predicate
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>());
195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end);
202 CPPUNIT_ASSERT( search_n(array, array_end, 1, 1, equal_to<int>() ) == &array[1] )
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/media/devices/ |
| devicemanager.cc | 317 std::search_n(max_formats_.begin(), max_formats_.end(), 1, key,
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/ |
| algorithmfwd.h | 111 search_n
526 // search_n
730 search_n(_FIter, _FIter, _Size, const _Tp&);
735 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| algorithmfwd.h | 109 search_n
521 // search_n
721 search_n(_FIter, _FIter, _Size, const _Tp&);
726 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| algorithmfwd.h | 109 search_n
521 // search_n
721 search_n(_FIter, _FIter, _Size, const _Tp&);
726 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| algorithmfwd.h | 109 search_n
521 // search_n
721 search_n(_FIter, _FIter, _Size, const _Tp&);
726 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| algorithmfwd.h | 109 search_n
521 // search_n
721 search_n(_FIter, _FIter, _Size, const _Tp&);
726 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| algorithmfwd.h | 111 search_n
526 // search_n
730 search_n(_FIter, _FIter, _Size, const _Tp&);
735 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| algorithmfwd.h | 111 search_n
526 // search_n
730 search_n(_FIter, _FIter, _Size, const _Tp&);
735 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| algorithmfwd.h | 376 search_n(_FIter, _FIter, _Integer, const _Tp&,
382 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate,
387 search_n(_FIter, _FIter, _Integer, const _Tp&);
392 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate);
|
| algo.h | 1142 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1150 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1159 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1202 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| algorithmfwd.h | 376 search_n(_FIter, _FIter, _Integer, const _Tp&,
382 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate,
387 search_n(_FIter, _FIter, _Integer, const _Tp&);
392 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate);
|
| algo.h | 1142 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1150 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1159 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1202 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| algorithmfwd.h | 376 search_n(_FIter, _FIter, _Integer, const _Tp&,
382 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate,
387 search_n(_FIter, _FIter, _Integer, const _Tp&);
392 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate);
|
| algo.h | 1142 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1150 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1159 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1202 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| algorithmfwd.h | 376 search_n(_FIter, _FIter, _Integer, const _Tp&,
382 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate,
387 search_n(_FIter, _FIter, _Integer, const _Tp&);
392 search_n(_FIter, _FIter, _Integer, const _Tp&, _BiPredicate);
|
| algo.h | 1144 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1152 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1161 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1204 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
[all...] |
| /external/stlport/stlport/stl/ |
| _algo.h | 127 // search_n. Search for __count consecutive copies of __val.
129 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
132 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
|
