diff options
author | Stephan T. Lavavej <stl@exchange.microsoft.com> | 2016-11-23 22:02:27 +0000 |
---|---|---|
committer | Stephan T. Lavavej <stl@exchange.microsoft.com> | 2016-11-23 22:02:27 +0000 |
commit | 73876facd5d2298b68c0f3a81d1f95aefc178f15 (patch) | |
tree | c15e2350c2e498956be37ca3c4b262c640d36fcb /libcxx/test/std | |
parent | afe99ae092b92f88c93dbf4b139557e998d938be (diff) | |
download | bcm5719-llvm-73876facd5d2298b68c0f3a81d1f95aefc178f15.tar.gz bcm5719-llvm-73876facd5d2298b68c0f3a81d1f95aefc178f15.zip |
[libcxx] [test] D27016: Fix MSVC warning C4018 "signed/unsigned mismatch", part 4/12.
Change "int j;" indices to "std::size_t j;".
Also, include <cstddef> when it wasn't already being included.
llvm-svn: 287824
Diffstat (limited to 'libcxx/test/std')
6 files changed, 25 insertions, 19 deletions
diff --git a/libcxx/test/std/containers/sequences/vector.bool/insert_iter_iter_iter.pass.cpp b/libcxx/test/std/containers/sequences/vector.bool/insert_iter_iter_iter.pass.cpp index 89fe7a76d40..55884daf4f7 100644 --- a/libcxx/test/std/containers/sequences/vector.bool/insert_iter_iter_iter.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector.bool/insert_iter_iter_iter.pass.cpp @@ -15,6 +15,7 @@ #include <vector> #include <cassert> +#include <cstddef> #include "test_iterators.h" #include "min_allocator.h" @@ -28,7 +29,7 @@ int main() input_iterator<const bool*>(a+N)); assert(v.size() == 100 + N); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (int k = 0; k < N; ++j, ++k) @@ -62,7 +63,7 @@ int main() forward_iterator<const bool*>(a+N)); assert(v.size() == sz + N); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (int k = 0; k < N; ++j, ++k) @@ -81,7 +82,7 @@ int main() forward_iterator<const bool*>(a+N)); assert(v.size() == sz + N); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (int k = 0; k < N; ++j, ++k) @@ -98,7 +99,7 @@ int main() input_iterator<const bool*>(a+N)); assert(v.size() == 100 + N); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (int k = 0; k < N; ++j, ++k) @@ -114,7 +115,7 @@ int main() forward_iterator<const bool*>(a+N)); assert(v.size() == 100 + N); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (int k = 0; k < N; ++j, ++k) diff --git a/libcxx/test/std/containers/sequences/vector.bool/insert_iter_size_value.pass.cpp b/libcxx/test/std/containers/sequences/vector.bool/insert_iter_size_value.pass.cpp index 35c57cbd8e4..3ec8952ff15 100644 --- a/libcxx/test/std/containers/sequences/vector.bool/insert_iter_size_value.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector.bool/insert_iter_size_value.pass.cpp @@ -14,6 +14,7 @@ #include <vector> #include <cassert> +#include <cstddef> #include "min_allocator.h" @@ -24,7 +25,7 @@ int main() std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); assert(v.size() == 105); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (; j < 15; ++j) @@ -39,7 +40,7 @@ int main() std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); assert(v.size() == sz + 5); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (; j < 15; ++j) @@ -55,7 +56,7 @@ int main() std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 5, 1); assert(v.size() == sz + 5); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (; j < 15; ++j) @@ -69,7 +70,7 @@ int main() std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 5, 1); assert(v.size() == 105); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (; j < 15; ++j) diff --git a/libcxx/test/std/containers/sequences/vector.bool/insert_iter_value.pass.cpp b/libcxx/test/std/containers/sequences/vector.bool/insert_iter_value.pass.cpp index 78ffe7ba73c..6a4a6d4bcb7 100644 --- a/libcxx/test/std/containers/sequences/vector.bool/insert_iter_value.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector.bool/insert_iter_value.pass.cpp @@ -14,6 +14,7 @@ #include <vector> #include <cassert> +#include <cstddef> #include "min_allocator.h" @@ -24,7 +25,7 @@ int main() std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); assert(v.size() == 101); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); assert(v[j] == 1); @@ -38,7 +39,7 @@ int main() std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); assert(v.size() == sz + 1); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); assert(v[j] == 1); @@ -53,7 +54,7 @@ int main() std::vector<bool>::iterator i = v.insert(v.cbegin() + 10, 1); assert(v.size() == sz + 1); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); assert(v[j] == 1); @@ -66,7 +67,7 @@ int main() std::vector<bool, min_allocator<bool>>::iterator i = v.insert(v.cbegin() + 10, 1); assert(v.size() == 101); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); assert(v[j] == 1); diff --git a/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_iter_iter.pass.cpp b/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_iter_iter.pass.cpp index 6c16726c43d..e4079426a16 100644 --- a/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_iter_iter.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_iter_iter.pass.cpp @@ -18,6 +18,7 @@ #include <vector> #include <cassert> +#include <cstddef> #include "test_allocator.h" #include "test_iterators.h" #include "min_allocator.h" @@ -69,7 +70,7 @@ int main() forward_iterator<const int*>(a+N)); assert(v.size() == sz + N); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (int k = 0; k < N; ++j, ++k) @@ -87,7 +88,7 @@ int main() forward_iterator<const int*>(a+N)); assert(v.size() == sz + N); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (int k = 0; k < N; ++j, ++k) diff --git a/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_size_value.pass.cpp b/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_size_value.pass.cpp index c495c648d4c..d169e31cc28 100644 --- a/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_size_value.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_size_value.pass.cpp @@ -17,6 +17,7 @@ #include <vector> #include <cassert> +#include <cstddef> #include "test_allocator.h" #include "min_allocator.h" #include "asan_testing.h" @@ -45,7 +46,7 @@ int main() assert(v.size() == sz + 5); assert(is_contiguous_container_asan_correct(v)); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (; j < 15; ++j) @@ -61,7 +62,7 @@ int main() assert(v.size() == sz + 5); assert(is_contiguous_container_asan_correct(v)); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); for (; j < 15; ++j) diff --git a/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_value.pass.cpp b/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_value.pass.cpp index c8b2d8de9b4..8a7af267dd2 100644 --- a/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_value.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector/vector.modifiers/insert_iter_value.pass.cpp @@ -17,6 +17,7 @@ #include <vector> #include <cassert> +#include <cstddef> #include "test_allocator.h" #include "min_allocator.h" #include "asan_testing.h" @@ -44,7 +45,7 @@ int main() assert(v.size() == sz + 1); assert(is_contiguous_container_asan_correct(v)); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); assert(v[j] == 1); @@ -60,7 +61,7 @@ int main() assert(v.size() == sz + 1); assert(is_contiguous_container_asan_correct(v)); assert(i == v.begin() + 10); - int j; + std::size_t j; for (j = 0; j < 10; ++j) assert(v[j] == 0); assert(v[j] == 1); |