1 files changed, 44 insertions, 1 deletions
diff --git a/libcxx/test/utilities/template.bitset/bitset.members/none.pass.cpp b/libcxx/test/utilities/template.bitset/bitset.members/none.pass.cpp
index abba3fd54f0..5270a5a3320 100644
--- a/libcxx/test/utilities/template.bitset/bitset.members/none.pass.cpp
+++ b/libcxx/test/utilities/template.bitset/bitset.members/none.pass.cpp
@@ -1 +1,44 @@
-//===----------------------------------------------------------------------===//
-//
-//                     The LLVM Compiler Infrastructure
-//
-// This file is distributed under the University of Illinois Open Source
-// License. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-// test bool none() const;
-#include <bitset>
-#include <cassert>
-template <std::size_t N>
-void test_none()
-{
-    std::bitset<N> v;
-    v.reset();
-    assert(v.none() == true);
-    v.set();
-    assert(v.none() == (N == 0));
-    if (N > 1)
-    {
-        v[N/2] = false;
-        assert(v.none() == false);
-        v.reset();
-        v[N/2] = true;
-        assert(v.none() == false);
-    }
-}
-int main()
-{
-    test_none<0>();
-    test_none<1>();
-    test_none<31>();
-    test_none<32>();
-    test_none<33>();
-    test_none<63>();
-    test_none<64>();
-    test_none<65>();
-    test_none<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 bool none() const;
+
+#include <bitset>
+#include <cassert>
+
+template <std::size_t N>
+void test_none()
+{
+    std::bitset<N> v;
+    v.reset();
+    assert(v.none() == true);
+    v.set();
+    assert(v.none() == (N == 0));
+    if (N > 1)
+    {
+        v[N/2] = false;
+        assert(v.none() == false);
+        v.reset();
+        v[N/2] = true;
+        assert(v.none() == false);
+    }
+}
+
+int main()
+{
+    test_none<0>();
+    test_none<1>();
+    test_none<31>();
+    test_none<32>();
+    test_none<33>();
+    test_none<63>();
+    test_none<64>();
+    test_none<65>();
+    test_none<1000>();
+}