| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 155 int ig[] = {0, 1, 2, 3, 4, 5}; local
156 const int sg = static_cast<int>(sizeof(ig)/sizeof(ig[0]));
157 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg));
158 assert(base(r) == ig+sg);
159 assert(ig[0] == 0);
160 assert(ig[1] == 1);
161 assert(ig[2] == 2)
359 std::unique_ptr<int> ig[6]; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 89 int ig[] = {1, 2, 3, 4}; local
90 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), count_equal()) == Iter1(ib+8));
|
| search.pass.cpp | 48 int ig[] = {1, 2, 3, 4}; local
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 156 int ig[] = {0, 1, 2, 3, 4, 5}; local
157 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
158 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg));
159 assert(base(r) == ig+sg);
160 assert(ig[0] == 0);
161 assert(ig[1] == 1);
162 assert(ig[2] == 2)
360 std::unique_ptr<int> ig[6]; local
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 89 int ig[] = {1, 2, 3, 4}; local
90 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), count_equal()) == Iter1(ib+8));
|
| search.pass.cpp | 48 int ig[] = {1, 2, 3, 4}; local
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 156 int ig[] = {0, 1, 2, 3, 4, 5}; local
157 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
158 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg));
159 assert(base(r) == ig+sg);
160 assert(ig[0] == 0);
161 assert(ig[1] == 1);
162 assert(ig[2] == 2)
360 std::unique_ptr<int> ig[6]; local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_pred.pass.cpp | 89 int ig[] = {1, 2, 3, 4}; local
90 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), count_equal()) == Iter1(ib+8));
|
| search.pass.cpp | 48 int ig[] = {1, 2, 3, 4}; local
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8));
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| default.pass.cpp | 73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
112 char ig[] = {1, 2, 3, 4}; local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
|
| hash.pass.cpp | 79 int ig[] = {1, 2, 3, 4}; local
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
113 char ig[] = {1, 2, 3, 4}; local
114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| hash.pred.pass.cpp | 94 int ig[] = {1, 2, 3, 4}; local
95 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
131 char ig[] = {1, 2, 3, 4}; local
132 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| pred.pass.cpp | 88 int ig[] = {1, 2, 3, 4}; local
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
122 char ig[] = {1, 2, 3, 4}; local
123 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| default.pass.cpp | 73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
112 char ig[] = {1, 2, 3, 4}; local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
|
| hash.pass.cpp | 78 int ig[] = {1, 2, 3, 4}; local
79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
112 char ig[] = {1, 2, 3, 4}; local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| hash.pred.pass.cpp | 91 int ig[] = {1, 2, 3, 4}; local
92 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
125 char ig[] = {1, 2, 3, 4}; local
126 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| pred.pass.cpp | 85 int ig[] = {1, 2, 3, 4}; local
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
119 char ig[] = {1, 2, 3, 4}; local
120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pass.cpp | 73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
|
| default.pred.pass.cpp | 85 int ig[] = {1, 2, 3, 4}; local
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pass.cpp | 58 int ig[] = {1, 2, 3, 4}; local
59 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
|
| make_default_searcher.pred.pass.cpp | 70 int ig[] = {1, 2, 3, 4}; local
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| default.pass.cpp | 73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
112 char ig[] = {1, 2, 3, 4}; local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
|
| hash.pass.cpp | 79 int ig[] = {1, 2, 3, 4}; local
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
113 char ig[] = {1, 2, 3, 4}; local
114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| hash.pred.pass.cpp | 90 int ig[] = {1, 2, 3, 4}; local
91 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
124 char ig[] = {1, 2, 3, 4}; local
125 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
| pred.pass.cpp | 86 int ig[] = {1, 2, 3, 4}; local
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
120 char ig[] = {1, 2, 3, 4}; local
121 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
|
