boostorg/range
1
0
Fork 1
mirror of https://github.com/boostorg/range.git synced 2025-07-12 12:16:38 +02:00
Code Issues Packages Projects Releases Wiki Activity

[boost][range] - Improved handling of temporary ranges in range algorithms.

Browse Source 
[SVN r63903]
This commit is contained in:
Neil Groves
2010-07-12 00:12:49 +00:00
parent ef000176d8
commit 74a01a4487
57 changed files with 1178 additions and 216 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
test/algorithm_test/count.cpp
View File

@ -31,28 +31,36 @@ namespace boost
Container cont;
const Container& cref_cont = cont;
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
cont += 1;
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1) );
BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1) );
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1u) );
BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1u) );
BOOST_CHECK_EQUAL( 1u, boost::count(boost::make_iterator_range(cont), 1u) );
cont += 2,3,4,5,6,7,8,9;
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1) );
BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1) );
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1u) );
BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1u) );
BOOST_CHECK_EQUAL( 1u, boost::count(boost::make_iterator_range(cont), 1u) );
cont += 2;
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1) );
BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1) );
BOOST_CHECK_EQUAL( 2u, boost::count(cont, 2) );
BOOST_CHECK_EQUAL( 2u, boost::count(cref_cont, 2) );
BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1u) );
BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1u) );
BOOST_CHECK_EQUAL( 1u, boost::count(boost::make_iterator_range(cont), 1u) );
BOOST_CHECK_EQUAL( 2u, boost::count(cont, 2u) );
BOOST_CHECK_EQUAL( 2u, boost::count(cref_cont, 2u) );
BOOST_CHECK_EQUAL( 2u, boost::count(boost::make_iterator_range(cont), 2u) );
}
void test_count()