Home
last modified time | relevance | path

Searched refs:next_permutation (Results 1 – 13 of 13) sorted by relevance

/external/stlport/test/unit/
Dperm_test.cpp138 next_permutation(v1, v1 + 3); in nextprm0()
149 next_permutation(v1.begin(), v1.end()); in nextprm1()
153 next_permutation(v1.begin(), v1.end()); in nextprm1()
157 next_permutation(v1.begin(), v1.end()); in nextprm1()
161 next_permutation(v1.begin(), v1.end()); in nextprm1()
165 next_permutation(v1.begin(), v1.end()); in nextprm1()
169 next_permutation(v1.begin(), v1.end()); in nextprm1()
173 next_permutation(v1.begin(), v1.end()); in nextprm1()
177 next_permutation(v1.begin(), v1.end()); in nextprm1()
181 next_permutation(v1.begin(), v1.end()); in nextprm1()
[all …]
/external/chromium_org/chrome/browser/
Dinternal_auth_unittest.cc80 std::next_permutation(dummy.begin(), dummy.end()); in TEST_F()
82 std::next_permutation(dummy.begin(), dummy.end()); in TEST_F()
120 std::next_permutation(dummy.begin(), dummy.end()); in TEST_F()
126 std::next_permutation(dummy.begin(), dummy.begin() + dummy.size() / 2); in TEST_F()
151 std::next_permutation(dummy1.begin(), dummy1.end()); in TEST_F()
156 std::next_permutation(dummy2.begin(), dummy2.begin() + dummy2.size() / 2); in TEST_F()
/external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/
DAndroid.mk19 test_name := algorithms/alg.sorting/alg.permutation.generators/next_permutation
20 test_src := next_permutation.pass.cpp
Dnext_permutation.pass.cpp47 x = std::next_permutation(Iter(ia), Iter(ia+e)); in test()
Dnext_permutation_comp.pass.cpp49 x = std::next_permutation(Iter(ia), Iter(ia+e), C()); in test()
/external/chromium_org/remoting/base/
Dcapabilities_unittest.cc70 } while (std::next_permutation(caps.begin(), caps.end())); in TEST()
102 } while (std::next_permutation(caps.begin(), caps.end())); in TEST()
/external/eigen/test/
Dprec_inverse_4x4.cpp25 std::next_permutation(indices.data(),indices.data()+4); in inverse_permutation_4x4()
/external/eigen/test/eigen2/
Deigen2_prec_inverse_4x4.cpp44 std::next_permutation(indices.data(),indices.data()+4); in inverse_permutation_4x4()
/external/libcxx/test/algorithms/alg.sorting/alg.sort/sort/
Dsort.pass.cpp35 } while (std::next_permutation(f, l)); in test_sort_helper()
/external/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/
Dstable_sort.pass.cpp35 } while (std::next_permutation(f, l)); in test_sort_helper()
/external/stlport/stlport/stl/
D_algo.h684 bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last);
687 bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
D_algo.c1896 bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last) { in next_permutation() function
1903 bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last, in next_permutation() function
/external/libcxx/include/
Dalgorithm605 next_permutation(BidirectionalIterator first, BidirectionalIterator last);
609 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
5603 // next_permutation
5635 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5650 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last)
5652 return _VSTD::next_permutation(__first, __last,