llvm/libcxx
1
0
Fork 0
mirror of https://github.com/llvm-mirror/libcxx.git synced 2025-10-23 18:38:30 +08:00
Code Issues 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

2
test/std/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search_comp.pass.cpp
View File

@@ -35,7 +35,7 @@ void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
const int M = 10;
std::vector<int> v(N);
int x = 0;
for (std::size_t i = 0; i < v.size(); ++i)

2
test/std/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range.pass.cpp
View File

@@ -42,7 +42,7 @@ void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
const int M = 10;
std::vector<int> v(N);
int x = 0;
for (std::size_t i = 0; i < v.size(); ++i)

2
test/std/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range_comp.pass.cpp
View File

@@ -43,7 +43,7 @@ void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
const int M = 10;
std::vector<int> v(N);
int x = 0;
for (std::size_t i = 0; i < v.size(); ++i)

2
test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound.pass.cpp
View File

@@ -37,7 +37,7 @@ void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
const int M = 10;
std::vector<int> v(N);
int x = 0;
for (std::size_t i = 0; i < v.size(); ++i)

2
test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound_comp.pass.cpp
View File

@@ -38,7 +38,7 @@ void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
const int M = 10;
std::vector<int> v(N);
int x = 0;
for (std::size_t i = 0; i < v.size(); ++i)

2
test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound.pass.cpp
View File

@@ -37,7 +37,7 @@ void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
const int M = 10;
std::vector<int> v(N);
int x = 0;
for (std::size_t i = 0; i < v.size(); ++i)

2
test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp.pass.cpp
View File

@@ -38,7 +38,7 @@ void
test()
{
const unsigned N = 1000;
const unsigned M = 10;
const int M = 10;
std::vector<int> v(N);
int x = 0;
for (std::size_t i = 0; i < v.size(); ++i)