summaryrefslogtreecommitdiffstats
path: root/libcxx/test/utilities/template.bitset/bitset.cons/ull_ctor.pass.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'libcxx/test/utilities/template.bitset/bitset.cons/ull_ctor.pass.cpp')
-rw-r--r--libcxx/test/utilities/template.bitset/bitset.cons/ull_ctor.pass.cpp41
1 files changed, 40 insertions, 1 deletions
diff --git a/libcxx/test/utilities/template.bitset/bitset.cons/ull_ctor.pass.cpp b/libcxx/test/utilities/template.bitset/bitset.cons/ull_ctor.pass.cpp
index 6e20abd489e..e5763e31844 100644
--- a/libcxx/test/utilities/template.bitset/bitset.cons/ull_ctor.pass.cpp
+++ b/libcxx/test/utilities/template.bitset/bitset.cons/ull_ctor.pass.cpp
@@ -1 +1,40 @@
-//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // test bitset(unsigned long long val); #include <bitset> #include <cassert> template <std::size_t N> void test_val_ctor() { { std::bitset<N> v(0xAAAAAAAAAAAAAAAAULL); assert(v.size() == N); unsigned M = std::min<std::size_t>(N, 64); for (std::size_t i = 0; i < M; ++i) assert(v[i] == (i & 1)); for (std::size_t i = M; i < N; ++i) assert(v[i] == false); } } int main() { test_val_ctor<0>(); test_val_ctor<1>(); test_val_ctor<31>(); test_val_ctor<32>(); test_val_ctor<33>(); test_val_ctor<63>(); test_val_ctor<64>(); test_val_ctor<65>(); test_val_ctor<1000>(); } \ No newline at end of file
+//===----------------------------------------------------------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+// test bitset(unsigned long long val);
+
+#include <bitset>
+#include <cassert>
+
+template <std::size_t N>
+void test_val_ctor()
+{
+ {
+ std::bitset<N> v(0xAAAAAAAAAAAAAAAAULL);
+ assert(v.size() == N);
+ unsigned M = std::min<std::size_t>(N, 64);
+ for (std::size_t i = 0; i < M; ++i)
+ assert(v[i] == (i & 1));
+ for (std::size_t i = M; i < N; ++i)
+ assert(v[i] == false);
+ }
+}
+
+int main()
+{
+ test_val_ctor<0>();
+ test_val_ctor<1>();
+ test_val_ctor<31>();
+ test_val_ctor<32>();
+ test_val_ctor<33>();
+ test_val_ctor<63>();
+ test_val_ctor<64>();
+ test_val_ctor<65>();
+ test_val_ctor<1000>();
+}
OpenPOWER on IntegriCloud