mirror of
https://github.com/llvm-mirror/libcxx.git
synced 2025-10-23 18:38:30 +08:00
[libcxx] [test] D27013: Fix MSVC warning C4018 "signed/unsigned mismatch", part 1/12.
Change loop indices from int to std::size_t. Also, include <cstddef> when it wasn't already being included. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@287820 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -15,6 +15,7 @@
|
||||
|
||||
#include <valarray>
|
||||
#include <cassert>
|
||||
#include <cstddef>
|
||||
|
||||
int main()
|
||||
{
|
||||
@@ -26,7 +27,7 @@ int main()
|
||||
std::valarray<T> v2;
|
||||
v2 = v;
|
||||
assert(v2.size() == v.size());
|
||||
for (int i = 0; i < v2.size(); ++i)
|
||||
for (std::size_t i = 0; i < v2.size(); ++i)
|
||||
assert(v2[i] == v[i]);
|
||||
}
|
||||
{
|
||||
@@ -37,7 +38,7 @@ int main()
|
||||
std::valarray<T> v2;
|
||||
v2 = v;
|
||||
assert(v2.size() == v.size());
|
||||
for (int i = 0; i < v2.size(); ++i)
|
||||
for (std::size_t i = 0; i < v2.size(); ++i)
|
||||
assert(v2[i] == v[i]);
|
||||
}
|
||||
{
|
||||
@@ -51,7 +52,7 @@ int main()
|
||||
for (int i = 0; i < N; ++i)
|
||||
{
|
||||
assert(v2[i].size() == v[i].size());
|
||||
for (int j = 0; j < v[i].size(); ++j)
|
||||
for (std::size_t j = 0; j < v[i].size(); ++j)
|
||||
assert(v2[i][j] == v[i][j]);
|
||||
}
|
||||
}
|
||||
|
@@ -15,6 +15,7 @@
|
||||
|
||||
#include <valarray>
|
||||
#include <cassert>
|
||||
#include <cstddef>
|
||||
|
||||
int main()
|
||||
{
|
||||
@@ -26,7 +27,7 @@ int main()
|
||||
std::valarray<T> v2;
|
||||
v2 = {1, 2, 3, 4, 5};
|
||||
assert(v2.size() == N);
|
||||
for (int i = 0; i < v2.size(); ++i)
|
||||
for (std::size_t i = 0; i < v2.size(); ++i)
|
||||
assert(v2[i] == a[i]);
|
||||
}
|
||||
{
|
||||
@@ -36,7 +37,7 @@ int main()
|
||||
std::valarray<T> v2;
|
||||
v2 = {1, 2.5, 3, 4.25, 5};
|
||||
assert(v2.size() == N);
|
||||
for (int i = 0; i < v2.size(); ++i)
|
||||
for (std::size_t i = 0; i < v2.size(); ++i)
|
||||
assert(v2[i] == a[i]);
|
||||
}
|
||||
{
|
||||
@@ -49,7 +50,7 @@ int main()
|
||||
for (int i = 0; i < N; ++i)
|
||||
{
|
||||
assert(v2[i].size() == a[i].size());
|
||||
for (int j = 0; j < a[i].size(); ++j)
|
||||
for (std::size_t j = 0; j < a[i].size(); ++j)
|
||||
assert(v2[i][j] == a[i][j]);
|
||||
}
|
||||
}
|
||||
|
@@ -15,6 +15,7 @@
|
||||
|
||||
#include <valarray>
|
||||
#include <cassert>
|
||||
#include <cstddef>
|
||||
|
||||
int main()
|
||||
{
|
||||
@@ -28,7 +29,7 @@ int main()
|
||||
v2 = std::move(v);
|
||||
assert(v2.size() == N);
|
||||
assert(v.size() == 0);
|
||||
for (int i = 0; i < v2.size(); ++i)
|
||||
for (std::size_t i = 0; i < v2.size(); ++i)
|
||||
assert(v2[i] == a[i]);
|
||||
}
|
||||
{
|
||||
@@ -40,7 +41,7 @@ int main()
|
||||
v2 = std::move(v);
|
||||
assert(v2.size() == N);
|
||||
assert(v.size() == 0);
|
||||
for (int i = 0; i < v2.size(); ++i)
|
||||
for (std::size_t i = 0; i < v2.size(); ++i)
|
||||
assert(v2[i] == a[i]);
|
||||
}
|
||||
{
|
||||
@@ -55,7 +56,7 @@ int main()
|
||||
for (int i = 0; i < N; ++i)
|
||||
{
|
||||
assert(v2[i].size() == a[i].size());
|
||||
for (int j = 0; j < a[i].size(); ++j)
|
||||
for (std::size_t j = 0; j < a[i].size(); ++j)
|
||||
assert(v2[i][j] == a[i][j]);
|
||||
}
|
||||
}
|
||||
|
@@ -15,6 +15,7 @@
|
||||
|
||||
#include <valarray>
|
||||
#include <cassert>
|
||||
#include <cstddef>
|
||||
|
||||
int main()
|
||||
{
|
||||
@@ -25,7 +26,7 @@ int main()
|
||||
std::valarray<T> v(a, N);
|
||||
v = 7;
|
||||
assert(v.size() == N);
|
||||
for (int i = 0; i < v.size(); ++i)
|
||||
for (std::size_t i = 0; i < v.size(); ++i)
|
||||
assert(v[i] == 7);
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user