| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
27 return (std::search_n(std::begin(ia), std::end(ia), 1, 0) == ia)
28 && (std::search_n(std::begin(ia), std::end(ia), 2, 1) == ia+2)
29 && (std::search_n(std::begin(ia), std::end(ia), 1, 3) == std::end(ia))
40 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
41 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa));
43 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa));
44 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia));
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3))
[all...] |
| search_n_pred.pass.cpp | 14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
29 return (std::search_n(std::begin(ia), std::end(ia), 1, 0, eq) == ia)
30 && (std::search_n(std::begin(ia), std::end(ia), 2, 1, eq) == ia+2)
31 && (std::search_n(std::begin(ia), std::end(ia), 1, 3, eq) == std::end(ia))
54 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
60 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
63 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa));
66 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia));
69 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
31 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa));
32 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa));
33 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia));
34 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3));
35 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa));
36 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa));
37 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,
41 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
44 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
47 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa));
50 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa));
53 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia));
56 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3));
59 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa));
62 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa));
65 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia))
[all...] |
| /external/webrtc/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.15-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/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| algorithmfwd.h | 113 search_n
528 // search_n
741 search_n(_FIter, _FIter, _Size, const _Tp&);
746 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| stl_algo.h | 348 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
380 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
413 // search_n
417 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
456 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
4835 search_n(_ForwardIterator __first, _ForwardIterator __last, function
4873 search_n(_ForwardIterator __first, _ForwardIterator __last, function
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| algorithmfwd.h | 113 search_n
528 // search_n
741 search_n(_FIter, _FIter, _Size, const _Tp&);
746 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| stl_algo.h | 348 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
380 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
413 // search_n
417 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
456 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
4835 search_n(_ForwardIterator __first, _ForwardIterator __last, function
4873 search_n(_ForwardIterator __first, _ForwardIterator __last, function
[all...] |
