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

fix issue related to ADL for begin()/end()

Browse Source
This commit is contained in:
Oliver Kowalke
2014-08-28 20:00:26 +02:00
parent a5c7873893
commit 3991225896
3 changed files with 13 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
example/cpp11/asymmetric/layout.cpp
View File

@@ -44,7 +44,7 @@ int main(int argc,char* argv[]){
}
});
std::copy(std::begin(words),std::end(words),std::begin(writer));
std::copy(std::begin(words),std::end(words),boost::begin(writer));
return 0;
}

24
example/cpp11/asymmetric/same_fringe.cpp
View File

@@ -100,8 +100,8 @@ int main()
traverse(left_d,out);
});
std::cout << "left tree from d:\n";
std::copy(std::begin(left_d_reader),
std::end(left_d_reader),
std::copy(boost::begin(left_d_reader),
boost::end(left_d_reader),
std::ostream_iterator<std::string>(std::cout, " "));
std::cout << std::endl;
@@ -111,8 +111,8 @@ int main()
traverse(right_b,out);
});
std::cout << "right tree from b:\n";
std::copy(std::begin(right_b_reader),
std::end(right_b_reader),
std::copy(boost::begin(right_b_reader),
boost::end(right_b_reader),
std::ostream_iterator<std::string>(std::cout, " "));
std::cout << std::endl;
@@ -122,8 +122,8 @@ int main()
traverse(right_x,out);
});
std::cout << "right tree from x:\n";
std::copy(std::begin(right_x_reader),
std::end(right_x_reader),
std::copy(boost::begin(right_x_reader),
boost::end(right_x_reader),
std::ostream_iterator<std::string>(std::cout, " "));
std::cout << std::endl;
}
@@ -143,9 +143,9 @@ int main()
std::cout << "left tree from d == right tree from b? "
<< std::boolalpha
<< std::equal(std::begin(left_d_reader),
std::end(left_d_reader),
std::begin(right_b_reader))
<< std::equal(boost::begin(left_d_reader),
boost::end(left_d_reader),
boost::begin(right_b_reader))
<< std::endl;
}
@@ -164,9 +164,9 @@ int main()
std::cout << "left tree from d == right tree from x? "
<< std::boolalpha
<< std::equal(std::begin(left_d_reader),
std::end(left_d_reader),
std::begin(right_x_reader))
<< std::equal(boost::begin(left_d_reader),
boost::end(left_d_reader),
boost::begin(right_x_reader))
<< std::endl;
}