Searched refs:search_n (Results 1 - 7 of 7) sorted by relevance
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
H A D | 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(Ite [all...] |
H A D | 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(Ite [all...] |
H A D | Android.mk | 23 test_name := algorithms/alg.nonmodifying/alg.search/search_n 24 test_src := search_n.pass.cpp
|
/external/stlport/test/unit/ |
H A D | 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(arra [all...] |
/external/chromium_org/third_party/libjingle/source/talk/media/devices/ |
H A D | devicemanager.cc | 317 std::search_n(max_formats_.begin(), max_formats_.end(), 1, key,
|
/external/stlport/stlport/stl/ |
H A D | _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,
|
H A D | _algo.c | 244 // search_n. Search for __count consecutive copies of __val. 246 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last, function 260 _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last, function
|
Completed in 645 milliseconds