| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | rotate.pass.cpp | 156 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg)); in test() 164 r = std::rotate(Iter(ig), Iter(ig+1), Iter(ig+sg)); in test() 172 r = std::rotate(Iter(ig), Iter(ig+2), Iter(ig+sg)); in test() 180 r = std::rotate(Iter(ig), Iter(ig+3), Iter(ig+sg)); in test() 188 r = std::rotate(Iter(ig), Iter(ig+4), Iter(ig+sg)); in test() 196 r = std::rotate(Iter(ig), Iter(ig+5), Iter(ig+sg)); in test() 204 r = std::rotate(Iter(ig), Iter(ig+sg), Iter(ig+sg)); in test() 364 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg)); in test1() 372 r = std::rotate(Iter(ig), Iter(ig+1), Iter(ig+sg)); in test1() 380 r = std::rotate(Iter(ig), Iter(ig+2), Iter(ig+sg)); in test1() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| H A D | unique.pass.cpp | 76 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test() 77 r = std::unique(Iter(ig), Iter(ig+sg)); in test() 79 assert(ig[0] == 0); in test() 80 assert(ig[1] == 1); in test() 150 Ptr ig[4]; in test1() local 151 ig[2].reset(&one); in test1() 152 ig[3].reset(&one); in test1() 153 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test1() 154 r = std::unique(Iter(ig), Iter(ig+sg)); in test1() 156 assert(ig[0] == 0); in test1() [all …]
|
| H A D | unique_pred.pass.cpp | 96 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test() 98 r = std::unique(Iter(ig), Iter(ig+sg), count_equal()); in test() 100 assert(ig[0] == 0); in test() 101 assert(ig[1] == 1); in test() 186 Ptr ig[4]; in test1() local 187 ig[2].reset(&one); in test1() 188 ig[3].reset(&one); in test1() 189 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test1() 191 r = std::unique(Iter(ig), Iter(ig+sg), count_equal()); in test1() 193 assert(ig[0] == 0); in test1() [all …]
|
| H A D | unique_copy.pass.cpp | 94 const int ig[] = {0, 0, 1, 1}; in test() local 95 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test() 97 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg)); in test()
|
| H A D | unique_copy_pred.pass.cpp | 104 const int ig[] = {0, 0, 1, 1}; in test() local 105 const unsigned sg = sizeof(ig)/sizeof(ig[0]); in test() 108 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg), count_equal()); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| H A D | pred.pass.cpp | 88 int ig[] = {1, 2, 3, 4}; in test() local 89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 122 char ig[] = {1, 2, 3, 4}; in test2() local 123 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | default.pass.cpp | 74 int ig[] = {1, 2, 3, 4}; in test() local 75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test() 113 char ig[] = {1, 2, 3, 4}; in test2() local 114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test2()
|
| H A D | hash.pass.cpp | 79 int ig[] = {1, 2, 3, 4}; in test() local 80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 113 char ig[] = {1, 2, 3, 4}; in test2() local 114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | hash.pred.pass.cpp | 94 int ig[] = {1, 2, 3, 4}; in test() local 95 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 131 char ig[] = {1, 2, 3, 4}; in test2() local 132 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| H A D | default.pass.cpp | 73 int ig[] = {1, 2, 3, 4}; in test() local 74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test() 112 char ig[] = {1, 2, 3, 4}; in test2() local 113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test2()
|
| H A D | hash.pred.pass.cpp | 91 int ig[] = {1, 2, 3, 4}; in test() local 92 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 125 char ig[] = {1, 2, 3, 4}; in test2() local 126 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | hash.pass.cpp | 78 int ig[] = {1, 2, 3, 4}; in test() local 79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 112 char ig[] = {1, 2, 3, 4}; in test2() local 113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | pred.pass.cpp | 85 int ig[] = {1, 2, 3, 4}; in test() local 86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 119 char ig[] = {1, 2, 3, 4}; in test2() local 120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| H A D | default.pass.cpp | 74 int ig[] = {1, 2, 3, 4}; in test() local 75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test() 113 char ig[] = {1, 2, 3, 4}; in test2() local 114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test2()
|
| H A D | hash.pred.pass.cpp | 92 int ig[] = {1, 2, 3, 4}; in test() local 93 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 126 char ig[] = {1, 2, 3, 4}; in test2() local 127 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | pred.pass.cpp | 86 int ig[] = {1, 2, 3, 4}; in test() local 87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 120 char ig[] = {1, 2, 3, 4}; in test2() local 121 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | hash.pass.cpp | 79 int ig[] = {1, 2, 3, 4}; in test() local 80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 113 char ig[] = {1, 2, 3, 4}; in test2() local 114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| H A D | pred.pass.cpp | 89 int ig[] = {1, 2, 3, 4}; in test() local 90 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 123 char ig[] = {1, 2, 3, 4}; in test2() local 124 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | hash.pass.cpp | 80 int ig[] = {1, 2, 3, 4}; in test() local 81 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 114 char ig[] = {1, 2, 3, 4}; in test2() local 115 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | hash.pred.pass.cpp | 95 int ig[] = {1, 2, 3, 4}; in test() local 96 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test() 132 char ig[] = {1, 2, 3, 4}; in test2() local 133 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test2()
|
| H A D | default.pass.cpp | 75 int ig[] = {1, 2, 3, 4}; in test() local 76 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test() 114 char ig[] = {1, 2, 3, 4}; in test2() local 115 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test2()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| H A D | default.pass.cpp | 74 int ig[] = {1, 2, 3, 4}; in test() local 75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
|
| H A D | default.pred.pass.cpp | 86 int ig[] = {1, 2, 3, 4}; in test() local 87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| H A D | make_default_searcher.pass.cpp | 59 int ig[] = {1, 2, 3, 4}; in test() local 60 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8)); in test()
|
| H A D | make_default_searcher.pred.pass.cpp | 71 int ig[] = {1, 2, 3, 4}; in test() local 72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); in test()
|