Removed some tabs that snuck into the test suite. No functionality change

llvm-svn: 227363

5 files changed, 29 insertions, 29 deletions

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp
index e12c69b4b62..b2c875d0f4b 100644
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp
@@ -155,5 +155,5 @@ int main()
 
 #endif  // _LIBCPP_HAS_NO_RVALUE_REFERENCES
 
-	test2();
+    test2();
 }
diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp
index 0cf06bbfba7..abc89dc5609 100644
--- a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp
@@ -30,24 +30,24 @@ int main()
     int ib[] = {0, 1, 2, 3, 0, 1, 2, 3};
     const unsigned sb = sizeof(ib)/sizeof(ib[0]);
 
-	typedef input_iterator<const int*> II;
-	typedef random_access_iterator<const int*>  RAI;
+    typedef input_iterator<const int*> II;
+    typedef random_access_iterator<const int*>  RAI;
 
     assert(std::mismatch(II(ia), II(ia + sa), II(ib))
-    		== (std::pair<II, II>(II(ia+3), II(ib+3))));
+            == (std::pair<II, II>(II(ia+3), II(ib+3))));
 
     assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib))
-    		== (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
+            == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
 
 #ifdef HAS_FOUR_ITERATOR_VERSION
     assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb))
-    		== (std::pair<II, II>(II(ia+3), II(ib+3))));
+            == (std::pair<II, II>(II(ia+3), II(ib+3))));
 
     assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb))
-    		== (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
+            == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
 
 
     assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+2))
-    		== (std::pair<II, II>(II(ia+2), II(ib+2))));
+            == (std::pair<II, II>(II(ia+2), II(ib+2))));
 #endif
 }
diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp
index ce0326c660f..8d85d993cd6 100644
--- a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp
@@ -33,9 +33,9 @@ int main()
     int ib[] = {0, 1, 2, 3, 0, 1, 2, 3};
     const unsigned sb = sizeof(ib)/sizeof(ib[0]);
     
-	typedef input_iterator<const int*> II;
-	typedef random_access_iterator<const int*>  RAI;
-	typedef std::equal_to<int> EQ;
+    typedef input_iterator<const int*> II;
+    typedef random_access_iterator<const int*>  RAI;
+    typedef std::equal_to<int> EQ;
 
     assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ())
             == (std::pair<II, II>(II(ia+3), II(ib+3))));
@@ -45,9 +45,9 @@ int main()
     binary_counting_predicate<EQ, int> bcp((EQ()));
     assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp))
             == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
-	assert(bcp.count() > 0 && bcp.count() < sa);
-	bcp.reset();
-		
+    assert(bcp.count() > 0 && bcp.count() < sa);
+    bcp.reset();
+        
 #ifdef HAS_FOUR_ITERATOR_VERSION
     assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ())
             == (std::pair<II, II>(II(ia+3), II(ib+3))));
@@ -56,7 +56,7 @@ int main()
 
     assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), std::ref(bcp))
             == (std::pair<II, II>(II(ia+3), II(ib+3))));
-	assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb));
+    assert(bcp.count() > 0 && bcp.count() < std::min(sa, sb));
 #endif
 
     assert(std::mismatch(ia, ia + sa, ib, EQ()) ==
diff --git a/libcxx/test/std/utilities/meta/meta.unary.prop.query/void_t.pass.cpp b/libcxx/test/std/utilities/meta/meta.unary.prop.query/void_t.pass.cpp
index 1f99a74d9b6..5deeeff110d 100644
--- a/libcxx/test/std/utilities/meta/meta.unary.prop.query/void_t.pass.cpp
+++ b/libcxx/test/std/utilities/meta/meta.unary.prop.query/void_t.pass.cpp
@@ -50,19 +50,19 @@ int main()
 {
     static_assert( std::is_same<void, std::void_t<>>::value, "");
 
-	test1<void>();
-	test1<int>();
-	test1<double>();
-	test1<int&>();
-	test1<Class>();
-	test1<Class[]>();
-	test1<Class[5]>();
-	
-	test2<void, int>();
-	test2<double, int>();
-	test2<int&, int>();
-	test2<Class&, bool>();
-	test2<void *, int&>();
+    test1<void>();
+    test1<int>();
+    test1<double>();
+    test1<int&>();
+    test1<Class>();
+    test1<Class[]>();
+    test1<Class[5]>();
+    
+    test2<void, int>();
+    test2<double, int>();
+    test2<int&, int>();
+    test2<Class&, bool>();
+    test2<void *, int&>();
 
     static_assert( std::is_same<void, std::void_t<int, double const &, Class, volatile int[], void>>::value, "");
 }
diff --git a/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_default_constructible.pass.cpp b/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_default_constructible.pass.cpp
index e7d2e3a5503..c8d5c42fbf8 100644
--- a/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_default_constructible.pass.cpp
+++ b/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_default_constructible.pass.cpp
@@ -37,7 +37,7 @@ class Empty
 
 class NoDefaultConstructor
 {
-	NoDefaultConstructor(int) {}
+    NoDefaultConstructor(int) {}
 };
 
 class NotEmpty