diff --git a/test/algorithm/querying_find.cpp b/test/algorithm/querying_find.cpp index 0e989e4..07d26fb 100644 --- a/test/algorithm/querying_find.cpp +++ b/test/algorithm/querying_find.cpp @@ -37,7 +37,7 @@ #define BOOST_PHOENIX_HASH_NAMESPACE stdext #endif #else -#define BOOST_PHOENIX_HAS_UNDORDERED_SET_AND_MAP +#define BOOST_PHOENIX_HAS_UNORDERED_SET_AND_MAP #include #include #endif @@ -82,7 +82,7 @@ namespace BOOST_TEST(boost::phoenix::find(arg1, 2)(m) == m.find(2)); //#endif -#ifdef BOOST_PHOENIX_HAS_UNDORDERED_SET_AND_MAP +#ifdef BOOST_PHOENIX_HAS_UNORDERED_SET_AND_MAP std::unordered_set hs(array, array + 3); BOOST_TEST(boost::phoenix::find(arg1, 2)(hs) == hs.find(2)); diff --git a/test/algorithm/querying_find2.cpp b/test/algorithm/querying_find2.cpp index 6646e2d..fbece8e 100644 --- a/test/algorithm/querying_find2.cpp +++ b/test/algorithm/querying_find2.cpp @@ -62,7 +62,7 @@ namespace convert_to_container >(); BOOST_TEST(boost::phoenix::find(arg1, 2)(m) == m.find(2)); -#ifdef BOOST_PHOENIX_HAS_UNDORDERED_SET_AND_MAP +#ifdef BOOST_PHOENIX_HAS_UNORDERED_SET_AND_MAP std::unordered_set us(array, array + 3); BOOST_TEST(boost::phoenix::find(arg1, 2)(us) == us.find(2)); @@ -70,13 +70,15 @@ namespace std::unordered_multiset ums(marray, marray + 5); BOOST_TEST(boost::phoenix::find(arg1, 2)(ums) == ums.find(2)); - std::unordered_map um = boost::assign::map_list_of(0, 1)(2, 3)(4, 5). - convert_to_container >(); - BOOST_TEST(boost::phoenix::find(arg1, 2)(um) == um.find(2)); + std::unordered_map um = + boost::assign::map_list_of(0, 1)(2, 3)(4, 5). + convert_to_container >(); + BOOST_TEST(boost::phoenix::find(arg1, 2)(um) == um.find(2)); - std::unordered_multimap umm = boost::assign::map_list_of(0, 1)(2, 3)(4, 5)(4, 6). - convert_to_container >(); - BOOST_TEST(boost::phoenix::find(arg1, 2)(umm) == umm.find(2)); + std::unordered_multimap umm = + boost::assign::map_list_of(0, 1)(2, 3)(4, 5)(4, 6). + convert_to_container >(); + BOOST_TEST(boost::phoenix::find(arg1, 2)(umm) == umm.find(2)); #else