maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

[libcxx] [test] D27015: Fix MSVC warning C4018 "signed/unsigned mismatch", part 3/12. 

Change unsigned to int in parameters.

llvm-svn: 287823
This commit is contained in:
Stephan T. Lavavej 2016-11-23 22:02:16 +00:00
parent a11d322f0d
commit afe99ae092
21 changed files with 29 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp
View File

@ -17,7 +17,7 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
void test(int N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp
View File

@ -17,7 +17,7 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
void test(int N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp
View File

@ -29,7 +29,7 @@ struct indirect_less
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
void test(unsigned N)
void test(int N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp
View File

@ -18,7 +18,7 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
void test(int N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp
View File

@ -30,7 +30,7 @@ struct indirect_less
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
void test(unsigned N)
void test(int N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp
View File

@ -17,7 +17,7 @@
#include <algorithm>
#include <cassert>
void test(unsigned N)
void test(int N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp
View File

@ -29,7 +29,7 @@ struct indirect_less
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
void test(unsigned N)
void test(int N)
{
int* ia = new int [N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.min.max/max_element.pass.cpp
View File

@ -35,7 +35,7 @@ test(Iter first, Iter last)
template <class Iter>
void
test(unsigned N)
test(int N)
{
int* a = new int[N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.min.max/max_element_comp.pass.cpp
View File

@ -36,7 +36,7 @@ test(Iter first, Iter last)
template <class Iter>
void
test(unsigned N)
test(int N)
{
int* a = new int[N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.min.max/min_element.pass.cpp
View File

@ -35,7 +35,7 @@ test(Iter first, Iter last)
template <class Iter>
void
test(unsigned N)
test(int N)
{
int* a = new int[N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.min.max/min_element_comp.pass.cpp
View File

@ -36,7 +36,7 @@ test(Iter first, Iter last)
template <class Iter>
void
test(unsigned N)
test(int N)
{
int* a = new int[N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.min.max/minmax_element.pass.cpp
View File

@ -41,7 +41,7 @@ test(Iter first, Iter last)
template <class Iter>
void
test(unsigned N)
test(int N)
{
int* a = new int[N];
for (int i = 0; i < N; ++i)

2
libcxx/test/std/algorithms/alg.sorting/alg.min.max/minmax_element_comp.pass.cpp
View File

@ -44,7 +44,7 @@ test(Iter first, Iter last)
template <class Iter>
void
test(unsigned N)
test(int N)
{
int* a = new int[N];
for (int i = 0; i < N; ++i)

4
libcxx/test/std/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp
View File

@ -19,7 +19,7 @@
#include <cassert>
void
test_one(unsigned N, unsigned M)
test_one(int N, int M)
{
assert(N != 0);
assert(M < N);
@ -34,7 +34,7 @@ test_one(unsigned N, unsigned M)
}
void
test(unsigned N)
test(int N)
{
test_one(N, 0);
test_one(N, 1);

4
libcxx/test/std/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp
View File

@ -33,7 +33,7 @@ struct indirect_less
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
void
test_one(unsigned N, unsigned M)
test_one(int N, int M)
{
assert(N != 0);
assert(M < N);
@ -48,7 +48,7 @@ test_one(unsigned N, unsigned M)
}
void
test(unsigned N)
test(int N)
{
test_one(N, 0);
test_one(N, 1);

4
libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy.pass.cpp
View File

@ -24,7 +24,7 @@
template <class Iter>
void
test_larger_sorts(unsigned N, unsigned M)
test_larger_sorts(int N, int M)
{
int* input = new int[N];
int* output = new int[M];
@ -43,7 +43,7 @@ test_larger_sorts(unsigned N, unsigned M)
template <class Iter>
void
test_larger_sorts(unsigned N)
test_larger_sorts(int N)
{
test_larger_sorts<Iter>(N, 0);
test_larger_sorts<Iter>(N, 1);

4
libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy_comp.pass.cpp
View File

@ -27,7 +27,7 @@
template <class Iter>
void
test_larger_sorts(unsigned N, unsigned M)
test_larger_sorts(int N, int M)
{
int* input = new int[N];
int* output = new int[M];
@ -47,7 +47,7 @@ test_larger_sorts(unsigned N, unsigned M)
template <class Iter>
void
test_larger_sorts(unsigned N)
test_larger_sorts(int N)
{
test_larger_sorts<Iter>(N, 0);
test_larger_sorts<Iter>(N, 1);

4
libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort.pass.cpp
View File

@ -19,7 +19,7 @@
#include <cassert>
void
test_larger_sorts(unsigned N, unsigned M)
test_larger_sorts(int N, int M)
{
assert(N != 0);
assert(N >= M);
@ -37,7 +37,7 @@ test_larger_sorts(unsigned N, unsigned M)
}
void
test_larger_sorts(unsigned N)
test_larger_sorts(int N)
{
test_larger_sorts(N, 0);
test_larger_sorts(N, 1);

4
libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort_comp.pass.cpp
View File

@ -33,7 +33,7 @@ struct indirect_less
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
void
test_larger_sorts(unsigned N, unsigned M)
test_larger_sorts(int N, int M)
{
assert(N != 0);
assert(N >= M);
@ -51,7 +51,7 @@ test_larger_sorts(unsigned N, unsigned M)
}
void
test_larger_sorts(unsigned N)
test_larger_sorts(int N)
{
test_larger_sorts(N, 0);
test_larger_sorts(N, 1);

4
libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp
View File

@ -72,7 +72,7 @@ test_sort_()
}
void
test_larger_sorts(unsigned N, unsigned M)
test_larger_sorts(int N, int M)
{
assert(N != 0);
assert(M != 0);
@ -112,7 +112,7 @@ test_larger_sorts(unsigned N, unsigned M)
}
void
test_larger_sorts(unsigned N)
test_larger_sorts(int N)
{
test_larger_sorts(N, 1);
test_larger_sorts(N, 2);

4
libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort.pass.cpp
View File

@ -72,7 +72,7 @@ test_sort_()
}
void
test_larger_sorts(unsigned N, unsigned M)
test_larger_sorts(int N, int M)
{
assert(N != 0);
assert(M != 0);
@ -112,7 +112,7 @@ test_larger_sorts(unsigned N, unsigned M)
}
void
test_larger_sorts(unsigned N)
test_larger_sorts(int N)
{
test_larger_sorts(N, 1);
test_larger_sorts(N, 2);