/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.replace/ |
H A D | replace.pass.cpp | 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 30 std::replace(Iter(ia), Iter(ia+sa), 2, 5);
|
H A D | replace_if.pass.cpp | 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5);
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
H A D | adjacent_find.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 forward_iterator<const int*>(ia + sa)) == 33 forward_iterator<const int*>(ia + sa)) == 34 forward_iterator<const int*>(ia+sa));
|
H A D | adjacent_find_pred.pass.cpp | 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 forward_iterator<const int*>(ia + sa), 36 forward_iterator<const int*>(ia + sa), 38 forward_iterator<const int*>(ia+sa));
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.count/ |
H A D | count.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 input_iterator<const int*>(ia + sa), 2) == 3); 29 input_iterator<const int*>(ia + sa), 7) == 0);
|
H A D | count_if.pass.cpp | 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 input_iterator<const int*>(ia + sa), 31 input_iterator<const int*>(ia + sa),
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
H A D | is_sorted.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted(Iter(a), Iter(a+sa))); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted(Iter(a), Iter(a+sa))); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted(Iter(a), Iter(a+sa))); 45 unsigned sa = sizeof(a) / sizeof(a[0]); local 46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 51 assert(std::is_sorted(Iter(a), Iter(a+sa))); 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 52 assert(std::is_sorted(Iter(a), Iter(a+sa), st 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_until.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 45 unsigned sa local 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_until_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), st 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
H A D | replace.pass.cpp | 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 30 std::replace(Iter(ia), Iter(ia+sa), 2, 5);
|
H A D | replace_if.pass.cpp | 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
H A D | adjacent_find.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 forward_iterator<const int*>(ia + sa)) == 33 forward_iterator<const int*>(ia + sa)) == 34 forward_iterator<const int*>(ia+sa));
|
H A D | adjacent_find_pred.pass.cpp | 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 forward_iterator<const int*>(ia + sa), 36 forward_iterator<const int*>(ia + sa), 38 forward_iterator<const int*>(ia+sa));
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.count/ |
H A D | count.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 input_iterator<const int*>(ia + sa), 2) == 3); 29 input_iterator<const int*>(ia + sa), 7) == 0);
|
H A D | count_if.pass.cpp | 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 input_iterator<const int*>(ia + sa), 31 input_iterator<const int*>(ia + sa),
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
H A D | is_sorted.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted(Iter(a), Iter(a+sa))); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted(Iter(a), Iter(a+sa))); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted(Iter(a), Iter(a+sa))); 45 unsigned sa = sizeof(a) / sizeof(a[0]); local 46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 51 assert(std::is_sorted(Iter(a), Iter(a+sa))); 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 52 assert(std::is_sorted(Iter(a), Iter(a+sa), st 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_until.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 45 unsigned sa local 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
H A D | is_sorted_until_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), st 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.replace/ |
H A D | replace.pass.cpp | 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 30 std::replace(Iter(ia), Iter(ia+sa), 2, 5);
|
H A D | replace_if.pass.cpp | 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
H A D | adjacent_find.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 forward_iterator<const int*>(ia + sa)) == 33 forward_iterator<const int*>(ia + sa)) == 34 forward_iterator<const int*>(ia+sa));
|
H A D | adjacent_find_pred.pass.cpp | 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 forward_iterator<const int*>(ia + sa), 36 forward_iterator<const int*>(ia + sa), 38 forward_iterator<const int*>(ia+sa));
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.count/ |
H A D | count.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 input_iterator<const int*>(ia + sa), 2) == 3); 29 input_iterator<const int*>(ia + sa), 7) == 0);
|