Home
last modified time | relevance | path

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

/external/stlport/test/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()
/external/stlport/etc/
DReleaseNote.txt134 * Improvment of some algorithm like search_n or stable_sort.
DChangeLog-5.1719 * stlport/stl/_algo.c: search_n with predicate fail in case
3954 * stlport/stl/_algo.c: Fix search_n implementation for random access
5176 * test/unit/alg_test.cpp: Add a test case for the search_n algo.
5178 * stlport/stl/_algo.c: Integration of the search_n algo implementation
5346 * stlport/stl/_algo.c: Fix of the search_n algo thanks Jim Xochellis report.
/external/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