summaryrefslogtreecommitdiffstats
path: root/libcxx/test/std/containers/sequences
diff options
context:
space:
mode:
Diffstat (limited to 'libcxx/test/std/containers/sequences')
-rw-r--r--libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size.pass.cpp3
-rw-r--r--libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size_value.pass.cpp3
-rw-r--r--libcxx/test/std/containers/sequences/vector.bool/push_back.pass.cpp5
3 files changed, 7 insertions, 4 deletions
diff --git a/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size.pass.cpp
index 53c6bd3380a..156c274327e 100644
--- a/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size.pass.cpp
+++ b/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size.pass.cpp
@@ -15,6 +15,7 @@
#include <algorithm>
#include <iterator>
#include <cassert>
+#include <cstddef>
#include "test_macros.h"
#include "min_allocator.h"
@@ -53,7 +54,7 @@ test(C& c1, int size)
CI i = c1.begin();
for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
assert(*i == j);
- for (int j = c1_osize; j < c1.size(); ++j, ++i)
+ for (std::size_t j = c1_osize; j < c1.size(); ++j, ++i)
assert(*i == 0);
}
diff --git a/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size_value.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size_value.pass.cpp
index 12af64386bd..82d20057ba8 100644
--- a/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size_value.pass.cpp
+++ b/libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size_value.pass.cpp
@@ -15,6 +15,7 @@
#include <algorithm>
#include <iterator>
#include <cassert>
+#include <cstddef>
#include "test_macros.h"
#include "min_allocator.h"
@@ -53,7 +54,7 @@ test(C& c1, int size, int x)
CI i = c1.begin();
for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
assert(*i == j);
- for (int j = c1_osize; j < c1.size(); ++j, ++i)
+ for (std::size_t j = c1_osize; j < c1.size(); ++j, ++i)
assert(*i == x);
}
diff --git a/libcxx/test/std/containers/sequences/vector.bool/push_back.pass.cpp b/libcxx/test/std/containers/sequences/vector.bool/push_back.pass.cpp
index 3897a438b44..c482f49454b 100644
--- a/libcxx/test/std/containers/sequences/vector.bool/push_back.pass.cpp
+++ b/libcxx/test/std/containers/sequences/vector.bool/push_back.pass.cpp
@@ -14,6 +14,7 @@
#include <vector>
#include <cassert>
+#include <cstddef>
#include "min_allocator.h"
@@ -27,7 +28,7 @@ int main()
{
c.push_back(a[i]);
assert(c.size() == i+1);
- for (int j = 0; j < c.size(); ++j)
+ for (std::size_t j = 0; j < c.size(); ++j)
assert(c[j] == a[j]);
}
}
@@ -40,7 +41,7 @@ int main()
{
c.push_back(a[i]);
assert(c.size() == i+1);
- for (int j = 0; j < c.size(); ++j)
+ for (std::size_t j = 0; j < c.size(); ++j)
assert(c[j] == a[j]);
}
}
OpenPOWER on IntegriCloud