diff --git a/test/algorithm/querying_find.cpp b/test/algorithm/querying_find.cpp
index c0843ff..2d65c9b 100644
--- a/test/algorithm/querying_find.cpp
+++ b/test/algorithm/querying_find.cpp
@@ -66,20 +66,20 @@ namespace
         std::set<int> s(array, array + 3);
         BOOST_TEST(boost::phoenix::find(arg1, 2)(s) == s.find(2));
 
-	//#if !(defined(BOOST_MSVC) && (BOOST_MSVC >= 1900))
+        //#if !(defined(BOOST_MSVC) && (BOOST_MSVC >= 1900))
         //std::map<int, int> m = boost::assign::map_list_of(0, 1)(2, 3)(4, 5).to_container(m);
         std::map<int, int> m = boost::assign::map_list_of(0, 1)(2, 3)(4, 5).
                                convert_to_container<std::map<int, int> >();
         BOOST_TEST(boost::phoenix::find(arg1, 2)(m) == m.find(2));
-	//#endif
+        //#endif
 
 #ifdef BOOST_PHOENIX_HAS_UNDORDERED_SET_AND_MAP
         std::unordered_set<int> hs(array, array + 3);
         BOOST_TEST(boost::phoenix::find(arg1, 2)(hs) == hs.find(2));
 
         //std::unordered_map<int, int> hm = boost::assign::map_list_of(0, 1)(2, 3)(4, 5).
-	// convert_to_container<std::unordered_map<int, int> >();
-	// BOOST_TEST(boost::phoenix::find(arg1, 2)(hm) == hm.find(2));
+        // convert_to_container<std::unordered_map<int, int> >();
+        // BOOST_TEST(boost::phoenix::find(arg1, 2)(hm) == hm.find(2));
 
 #else
 #ifdef BOOST_PHOENIX_HAS_HASH