LineageOS/android_external_libcxx
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Enable the -Wsign-compare warning to better support MSVC

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@289363 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Eric Fiselier
2016-12-11 05:31:00 +00:00
parent 47dfc5940d
commit a2cd270943
67 changed files with 322 additions and 290 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
test/std/numerics/numarray/template.valarray/valarray.access/access.pass.cpp
View File

@@ -23,11 +23,11 @@ int main()
T a[] = {5, 4, 3, 2, 1};
const unsigned N = sizeof(a)/sizeof(a[0]);
std::valarray<T> v(a, N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v[i] == a[i]);
v[i] = i;
assert(v[i] == i);
assert(v[i] == static_cast<int>(i));
}
}
}

2
test/std/numerics/numarray/template.valarray/valarray.access/const_access.pass.cpp
View File

@@ -23,7 +23,7 @@ int main()
T a[] = {5, 4, 3, 2, 1};
const unsigned N = sizeof(a)/sizeof(a[0]);
const std::valarray<T> v(a, N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v[i] == a[i]);
}

2
test/std/numerics/numarray/template.valarray/valarray.assign/copy_assign.pass.cpp
View File

@@ -49,7 +49,7 @@ int main()
std::valarray<T> v2(a, N-2);
v2 = v;
assert(v2.size() == v.size());
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == v[i].size());
for (std::size_t j = 0; j < v[i].size(); ++j)

2
test/std/numerics/numarray/template.valarray/valarray.assign/initializer_list_assign.pass.cpp
View File

@@ -47,7 +47,7 @@ int main()
std::valarray<T> v2(a, N-2);
v2 = {T(1), T(2), T(3), T(4), T(5)};
assert(v2.size() == N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == a[i].size());
for (std::size_t j = 0; j < a[i].size(); ++j)

2
test/std/numerics/numarray/template.valarray/valarray.assign/move_assign.pass.cpp
View File

@@ -53,7 +53,7 @@ int main()
v2 = std::move(v);
assert(v2.size() == N);
assert(v.size() == 0);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == a[i].size());
for (std::size_t j = 0; j < a[i].size(); ++j)

2
test/std/numerics/numarray/template.valarray/valarray.cons/copy.pass.cpp
View File

@@ -46,7 +46,7 @@ int main()
std::valarray<T> v(a, N);
std::valarray<T> v2 = v;
assert(v2.size() == v.size());
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == v[i].size());
for (std::size_t j = 0; j < v[i].size(); ++j)

4
test/std/numerics/numarray/template.valarray/valarray.cons/initializer_list.pass.cpp
View File

@@ -25,7 +25,7 @@ int main()
const unsigned N = sizeof(a)/sizeof(a[0]);
std::valarray<T> v = {1, 2, 3, 4, 5};
assert(v.size() == N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
assert(v[i] == a[i]);
}
{
@@ -34,7 +34,7 @@ int main()
const unsigned N = sizeof(a)/sizeof(a[0]);
std::valarray<T> v = {1, 2, 3, 4, 5};
assert(v.size() == N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
assert(v[i] == a[i]);
}
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS

2
test/std/numerics/numarray/template.valarray/valarray.cons/move.pass.cpp
View File

@@ -51,7 +51,7 @@ int main()
std::valarray<T> v2 = std::move(v);
assert(v2.size() == N);
assert(v.size() == 0);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == a[i].size());
for (std::size_t j = 0; j < v2[i].size(); ++j)

6
test/std/numerics/numarray/template.valarray/valarray.cons/pointer_size.pass.cpp
View File

@@ -25,7 +25,7 @@ int main()
const unsigned N = sizeof(a)/sizeof(a[0]);
std::valarray<T> v(a, N);
assert(v.size() == N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
assert(v[i] == a[i]);
}
{
@@ -34,7 +34,7 @@ int main()
const unsigned N = sizeof(a)/sizeof(a[0]);
std::valarray<T> v(a, N);
assert(v.size() == N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
assert(v[i] == a[i]);
}
{
@@ -43,7 +43,7 @@ int main()
const unsigned N = sizeof(a)/sizeof(a[0]);
std::valarray<T> v(a, N);
assert(v.size() == N);
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v[i].size() == a[i].size());
for (std::size_t j = 0; j < v[i].size(); ++j)

2
test/std/numerics/numarray/template.valarray/valarray.unary/bit_not.pass.cpp
View File

@@ -36,7 +36,7 @@ int main()
std::valarray<T> v(a, N);
std::valarray<T> v2 = ~v;
assert(v2.size() == v.size());
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == v[i].size());
for (std::size_t j = 0; j < v[i].size(); ++j)

2
test/std/numerics/numarray/template.valarray/valarray.unary/negate.pass.cpp
View File

@@ -46,7 +46,7 @@ int main()
std::valarray<T> v(a, N);
std::valarray<T> v2 = -v;
assert(v2.size() == v.size());
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == v[i].size());
for (std::size_t j = 0; j < v[i].size(); ++j)

2
test/std/numerics/numarray/template.valarray/valarray.unary/plus.pass.cpp
View File

@@ -46,7 +46,7 @@ int main()
std::valarray<T> v(a, N);
std::valarray<T> v2 = +v;
assert(v2.size() == v.size());
for (int i = 0; i < N; ++i)
for (unsigned i = 0; i < N; ++i)
{
assert(v2[i].size() == v[i].size());
for (std::size_t j = 0; j < v[i].size(); ++j)