| /haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/search_n/ |
| H A D | 11400.cc | 29 template int* search_n (int*, int*, Integral, const int&);
30 template int* search_n (int*, int*, Integral, const int&, greater<int>);
|
| H A D | iterator.cc | 20 // 25 algorithms, search_n
68 using std::search_n;
71 VERIFY(search_n(con.end(), con.end(), 0, 1) == con.end());
72 VERIFY(search_n(con.end(), con.end(), 1, 1) == con.end());
73 VERIFY(search_n(con.begin(), con.end(), 1, 1).ptr == array1 + 1);
74 VERIFY(search_n(con.begin(), con.end(), 2, 1).ptr == array1 + 4);
75 VERIFY(search_n(con.begin(), con.end(), 3, 1).ptr == array1 + 7);
76 VERIFY(search_n(con.begin(), con.end(), 3, 0) == con.end());
93 int* t1 = search_n(forwardcon.begin(),
96 int* t2 = search_n(forwardco
[all...] |
| H A D | check_type.cc | 18 // 25.1.9 search_n
38 { return std::search_n(begin, end, i , value); }
|
| H A D | 58358.cc | 32 std::search_n(a.begin(), a.end(), 10, 1,
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/search_n/requirements/explicit_instantiation/ |
| H A D | 2.cc | 36 template iterator_type search_n(iterator_type, iterator_type,
39 template iterator_type search_n(iterator_type, iterator_type,
|
| H A D | pod.cc | 35 template iterator_type search_n(iterator_type, iterator_type,
38 template iterator_type search_n(iterator_type, iterator_type,
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/25_algorithms/ |
| H A D | search_n.cc | 50 search_n(fcon.begin(), fcon.end(), 10, 1);
58 search_n(rcon.begin(), rcon.end(), 10, 1);
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/headers/algorithm/ |
| H A D | parallel_algorithm_mixed2.cc | 56 std::search_n(v.begin(), v.end(), 5, value_type(1));
57 std::search_n(v.begin(), v.end(), 5, value_type(1),
59 __gnu_parallel::search_n(v.begin(), v.end(), 5, value_type(1));
60 __gnu_parallel::search_n(v.begin(), v.end(), 5, value_type(1),
|
| H A D | parallel_algorithm_mixed1.cc | 51 std::search_n(v.begin(), v.end(), 5, value_type(1));
52 std::search_n(v.begin(), v.end(), 5, value_type(1),
54 __gnu_parallel::search_n(v.begin(), v.end(), 5, value_type(1));
55 __gnu_parallel::search_n(v.begin(), v.end(), 5, value_type(1),
|
| H A D | synopsis.cc | 121 search_n(_FIter, _FIter, _Size, const _Tp&);
126 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| /haiku-buildtools/legacy/gcc/libstdc++/stl/ |
| H A D | algo.h | 45 using __STD::search_n;
|
| H A D | stl_algo.h | 374 // search_n. Search for __count consecutive copies of __val.
377 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last, function
401 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last, function
|
| /haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
| H A D | 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);
|
| H A D | algo.h | 1141 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1143 { return _GLIBCXX_STD_A::search_n(__begin, __end, __count, __val); }
1149 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1152 { return _GLIBCXX_STD_A::search_n(
1158 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
1162 return __gnu_parallel::search_n(__begin, __end, __count, __val,
1183 return _GLIBCXX_STD_A::search_n(__begin, __end, __count, __val,
1194 { return _GLIBCXX_STD_A::search_n(__begin, __end, __count, __val,
1201 search_n(_FIterator __begin, _FIterator __end, _Integer __count, function in namespace:__parallel
|
| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | algorithmfwd.h | 113 search_n
545 // search_n
762 search_n(_FIter, _FIter, _Size, const _Tp&);
767 search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
|
| H A D | stl_algo.h | 249 // search_n
252 * This is an helper function for search_n overloaded for forward iterators.
283 * This is an helper function for search_n overloaded for random access
4096 search_n(_ForwardIterator __first, _ForwardIterator __last, function
4130 search_n(_ForwardIterator __first, _ForwardIterator __last, function
|