diff options
Diffstat (limited to 'test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp')
| -rw-r--r-- | test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp b/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp index bd38d7de6894..152c552381b9 100644 --- a/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp +++ b/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp @@ -46,7 +46,7 @@ test() OutIter r = std::merge(InIter1(ia), InIter1(ia+N), InIter2(ib), InIter2(ib+N), OutIter(ic), pred); assert(base(r) == ic+2*N); - assert(ic[0] == 2*N-1); + assert(ic[0] == static_cast<int>(2*N-1)); assert(ic[2*N-1] == 0); assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); assert(pred.count() <= (N + N - 1)); @@ -70,7 +70,7 @@ test() OutIter r = std::merge(InIter1(ia), InIter1(ia+N), InIter2(ib), InIter2(ib+N), OutIter(ic), pred); assert(base(r) == ic+2*N); - assert(ic[0] == 2*N-1); + assert(ic[0] == static_cast<int>(2*N-1)); assert(ic[2*N-1] == 0); assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); assert(pred.count() <= (N + N - 1)); |