boost/phoenix
2
0
Fork 0
mirror of https://github.com/boostorg/phoenix.git synced 2026-02-19 02:32:09 +00:00
Code Issues Projects Releases Wiki Activity

querying_find.cpp Take out tabs

Browse Source
This commit is contained in:
John Fletcher
2015-01-24 14:42:10 +00:00
parent 58387d2314
commit 382eda45dc
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
test/algorithm/querying_find.cpp
View File

@@ -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