import quincy beta 17.1.0

[ceph.git] / ceph / src / boost / libs / bimap / test / test_bimap.hpp

diff --git a/ceph/src/boost/libs/bimap/test/test_bimap.hpp b/ceph/src/boost/libs/bimap/test/test_bimap.hpp
index 973fb6fb8aea7a3c72201e055ee662b04e1bf259..aca5116835bb78e516062cabdbc573a66502d579 100644 (file)
--- a/ceph/src/boost/libs/bimap/test/test_bimap.hpp
+++ b/ceph/src/boost/libs/bimap/test/test_bimap.hpp
@@ -33,35 +33,35 @@ void test_container(Container & c, const Data & d)
 
     c.clear();
 
-    BOOST_CHECK( c.size() == 0 );
-    BOOST_CHECK( c.empty() );
+    BOOST_TEST( c.size() == 0 );
+    BOOST_TEST( c.empty() );
 
     c.insert( *d.begin() );
 
     c.insert( ++d.begin(),d.end() );
 
-    BOOST_CHECK( c.size() == d.size() );
+    BOOST_TEST( c.size() == d.size() );
 
-    BOOST_CHECK( c.size() <= c.max_size() );
-    BOOST_CHECK( ! c.empty() );
+    BOOST_TEST( c.size() <= c.max_size() );
+    BOOST_TEST( ! c.empty() );
 
     c.erase( c.begin() );
 
-    BOOST_CHECK( c.size() == d.size() - 1 );
+    BOOST_TEST( c.size() == d.size() - 1 );
 
     c.erase( c.begin(), c.end() );
 
-    BOOST_CHECK( c.empty() );
+    BOOST_TEST( c.empty() );
 
     c.insert( *d.begin() );
 
-    BOOST_CHECK( c.size() == 1 );
+    BOOST_TEST( c.size() == 1 );
 
     c.insert( c.begin(), *(++d.begin()) );
 
-    BOOST_CHECK( c.size() == 2 );
+    BOOST_TEST( c.size() == 2 );
 
-    BOOST_CHECK( c.begin() != c.end() );
+    BOOST_TEST( c.begin() != c.end() );
 }
 
 template< class Container, class Data >
@@ -71,48 +71,48 @@ void test_sequence_container(Container & c, const Data & d)
 
     c.clear();
 
-    BOOST_CHECK( c.size() == 0 );
-    BOOST_CHECK( c.empty() );
+    BOOST_TEST( c.size() == 0 );
+    BOOST_TEST( c.empty() );
 
     c.push_front( *   d.begin()  );
     c.push_back ( *(++d.begin()) );
 
-    BOOST_CHECK( c.front() == *   c.begin()  );
-    BOOST_CHECK( c.back () == *(++c.begin()) );
+    BOOST_TEST( c.front() == *   c.begin()  );
+    BOOST_TEST( c.back () == *(++c.begin()) );
 
-    BOOST_CHECK( c.size() == 2 );
+    BOOST_TEST( c.size() == 2 );
 
-    BOOST_CHECK( c.size() <= c.max_size() );
-    BOOST_CHECK( ! c.empty() );
+    BOOST_TEST( c.size() <= c.max_size() );
+    BOOST_TEST( ! c.empty() );
 
     c.erase( c.begin() );
 
-    BOOST_CHECK( c.size() == 1 );
+    BOOST_TEST( c.size() == 1 );
 
     c.insert( c.begin(), *(++d.begin()) );
 
     c.erase( c.begin(), c.end() );
 
-    BOOST_CHECK( c.empty() );
+    BOOST_TEST( c.empty() );
 
     c.push_front( *d.begin() );
 
-    BOOST_CHECK( c.size() == 1 );
+    BOOST_TEST( c.size() == 1 );
 
-    BOOST_CHECK( c.begin() != c.end() );
+    BOOST_TEST( c.begin() != c.end() );
 
     c.clear();
-    BOOST_CHECK( c.empty() );
+    BOOST_TEST( c.empty() );
 
     // assign
     
     c.assign(d.begin(),d.end());
-    BOOST_CHECK( c.size() == d.size() );
-    BOOST_CHECK( std::equal( c.begin(), c.end(), d.begin() ) );
+    BOOST_TEST( c.size() == d.size() );
+    BOOST_TEST( std::equal( c.begin(), c.end(), d.begin() ) );
 
     c.assign(d.size(),*d.begin());
-    BOOST_CHECK( c.size() == d.size() );
-    BOOST_CHECK( *c.begin() == *d.begin() );
+    BOOST_TEST( c.size() == d.size() );
+    BOOST_TEST( *c.begin() == *d.begin() );
     
     // Check insert(IterPos,InputIter,InputIter)
     
@@ -120,22 +120,22 @@ void test_sequence_container(Container & c, const Data & d)
     c.insert( c.begin(), d.begin(), d.end() );
     c.insert( boost::next(c.begin(),2), d.begin(), d.end() );
                    
-    BOOST_CHECK( std::equal( boost::next(c.begin(),2)
+    BOOST_TEST( std::equal( boost::next(c.begin(),2)
                            , boost::next(c.begin(),2+d.size()) , d.begin() ) );
 
     // Check resize
    
     c.clear() ;
     c.resize(4,*d.begin());
-    BOOST_CHECK( c.size() == 4 );
-    BOOST_CHECK( *c.begin() == *d.begin() ) ;
-
-    BOOST_CHECK(     c == c   );
-    BOOST_CHECK( ! ( c != c ) );
-    BOOST_CHECK( ! ( c  < c ) );
-    BOOST_CHECK(   ( c <= c ) );
-    BOOST_CHECK( ! ( c  > c ) );
-    BOOST_CHECK(   ( c >= c ) );
+    BOOST_TEST( c.size() == 4 );
+    BOOST_TEST( *c.begin() == *d.begin() ) ;
+
+    BOOST_TEST(     c == c   );
+    BOOST_TEST( ! ( c != c ) );
+    BOOST_TEST( ! ( c  < c ) );
+    BOOST_TEST(   ( c <= c ) );
+    BOOST_TEST( ! ( c  > c ) );
+    BOOST_TEST(   ( c >= c ) );
 }
 
 template< class Container, class Data >
@@ -145,12 +145,12 @@ void test_vector_container(Container & c, const Data & d)
 
     c.clear() ;
     c.reserve(2) ;
-    BOOST_CHECK( c.capacity() >= 2 ) ;
+    BOOST_TEST( c.capacity() >= 2 ) ;
     c.assign(d.begin(),d.end());
-    BOOST_CHECK( c.capacity() >= c.size() ) ;
+    BOOST_TEST( c.capacity() >= c.size() ) ;
     
-    BOOST_CHECK( c[0] == *d.begin() ) ;
-    BOOST_CHECK( c.at(1) == *boost::next(d.begin()) );
+    BOOST_TEST( c[0] == *d.begin() ) ;
+    BOOST_TEST( c.at(1) == *boost::next(d.begin()) );
     
     test_sequence_container(c,d) ;
 }
@@ -166,7 +166,7 @@ void test_associative_container(Container & c, const Data & d)
     for( typename Data::const_iterator di = d.begin(), de = d.end();
          di != de; ++di )
     {
-        BOOST_CHECK( c.find(*di) != c.end() );
+        BOOST_TEST( c.find(*di) != c.end() );
     }
 
     typename Data::const_iterator da =   d.begin();
@@ -174,19 +174,19 @@ void test_associative_container(Container & c, const Data & d)
 
     c.erase(*da);
 
-    BOOST_CHECK( c.size() == d.size()-1 );
+    BOOST_TEST( c.size() == d.size()-1 );
 
-    BOOST_CHECK( c.count(*da) == 0 );
-    BOOST_CHECK( c.count(*db) == 1 );
+    BOOST_TEST( c.count(*da) == 0 );
+    BOOST_TEST( c.count(*db) == 1 );
 
-    BOOST_CHECK( c.find(*da) == c.end() );
-    BOOST_CHECK( c.find(*db) != c.end() );
+    BOOST_TEST( c.find(*da) == c.end() );
+    BOOST_TEST( c.find(*db) != c.end() );
 
-    BOOST_CHECK( c.equal_range(*db).first != c.end() );
+    BOOST_TEST( c.equal_range(*db).first != c.end() );
 
     c.clear();
 
-    BOOST_CHECK( c.equal_range(*da).first == c.end() );
+    BOOST_TEST( c.equal_range(*da).first == c.end() );
 }
 
 
@@ -230,7 +230,7 @@ void test_pair_associative_container(Container & c, const Data & d)
     for( typename Data::const_iterator di = d.begin(), de = d.end();
          di != de; ++di )
     {
-        BOOST_CHECK( c.find(di->first) != c.end() );
+        BOOST_TEST( c.find(di->first) != c.end() );
     }
 
     typename Data::const_iterator da =   d.begin();
@@ -238,30 +238,30 @@ void test_pair_associative_container(Container & c, const Data & d)
 
     c.erase(da->first);
 
-    BOOST_CHECK( c.size() == d.size()-1 );
+    BOOST_TEST( c.size() == d.size()-1 );
 
-    BOOST_CHECK( c.count(da->first) == 0 );
-    BOOST_CHECK( c.count(db->first) == 1 );
+    BOOST_TEST( c.count(da->first) == 0 );
+    BOOST_TEST( c.count(db->first) == 1 );
 
-    BOOST_CHECK( c.find(da->first) == c.end() );
-    BOOST_CHECK( c.find(db->first) != c.end() );
+    BOOST_TEST( c.find(da->first) == c.end() );
+    BOOST_TEST( c.find(db->first) != c.end() );
 
-    BOOST_CHECK( c.equal_range(db->first).first != c.end() );
+    BOOST_TEST( c.equal_range(db->first).first != c.end() );
 
     c.clear();
 
-    BOOST_CHECK( c.equal_range(da->first).first == c.end() );
+    BOOST_TEST( c.equal_range(da->first).first == c.end() );
 }
 
 
 template< class Container, class Data >
 void test_simple_ordered_associative_container_equality(Container & c, const Data & d)
 {
-    BOOST_CHECK( std::equal( c. begin(), c. end(), d. begin() ) );
-    BOOST_CHECK( std::equal( c.rbegin(), c.rend(), d.rbegin() ) );
+    BOOST_TEST( std::equal( c. begin(), c. end(), d. begin() ) );
+    BOOST_TEST( std::equal( c.rbegin(), c.rend(), d.rbegin() ) );
 
-    BOOST_CHECK( c.lower_bound( *d.begin() ) ==   c.begin() );
-    BOOST_CHECK( c.upper_bound( *d.begin() ) == ++c.begin() );
+    BOOST_TEST( c.lower_bound( *d.begin() ) ==   c.begin() );
+    BOOST_TEST( c.upper_bound( *d.begin() ) == ++c.begin() );
 }
 
 template< class Container, class Data >
@@ -276,10 +276,10 @@ void test_simple_ordered_associative_container(Container & c, const Data & d)
          di != de; ++di )
     {
         typename Container::const_iterator ci = c.find(*di);
-        BOOST_CHECK( ci != c.end() );
+        BOOST_TEST( ci != c.end() );
 
-        BOOST_CHECK( ! c.key_comp()(*ci,*di) );
-        BOOST_CHECK( ! c.value_comp()(*ci,*di) );
+        BOOST_TEST( ! c.key_comp()(*ci,*di) );
+        BOOST_TEST( ! c.value_comp()(*ci,*di) );
     }
 
     test_simple_ordered_associative_container_equality(c, d);
@@ -288,15 +288,15 @@ void test_simple_ordered_associative_container(Container & c, const Data & d)
 
     test_simple_ordered_associative_container_equality(cr, d);
 
-    BOOST_CHECK(     c == c   );
-    BOOST_CHECK( ! ( c != c ) );
-    BOOST_CHECK( ! ( c  < c ) );
-    BOOST_CHECK(   ( c <= c ) );
-    BOOST_CHECK( ! ( c  > c ) );
-    BOOST_CHECK(   ( c >= c ) );
+    BOOST_TEST(     c == c   );
+    BOOST_TEST( ! ( c != c ) );
+    BOOST_TEST( ! ( c  < c ) );
+    BOOST_TEST(   ( c <= c ) );
+    BOOST_TEST( ! ( c  > c ) );
+    BOOST_TEST(   ( c >= c ) );
     
     /*
-    BOOST_CHECK( c.range( *c.begin() <= ::boost::lambda::_1,
+    BOOST_TEST( c.range( *c.begin() <= ::boost::lambda::_1,
                             ::boost::lambda::_1 <= *(++c.begin()) ).
                     first == c.begin()
     );
@@ -309,8 +309,8 @@ void test_simple_unordered_associative_container(Container & c, const Data & d)
     c.clear();
     c.insert( d.begin(), d.end() );
 
-    BOOST_CHECK( c.bucket_count() * c.max_load_factor() >= d.size() );
-    BOOST_CHECK( c.max_bucket_count() >= c.bucket_count() );
+    BOOST_TEST( c.bucket_count() * c.max_load_factor() >= d.size() );
+    BOOST_TEST( c.max_bucket_count() >= c.bucket_count() );
 
     for( typename Data::const_iterator di = d.begin(), de = d.end() ;
          di != de ; ++di )
@@ -319,32 +319,32 @@ void test_simple_unordered_associative_container(Container & c, const Data & d)
         {
             typename Container::size_type nb = c.bucket(*c.find(*di));
 
-            BOOST_CHECK( c.begin(nb) != c.end(nb) );
+            BOOST_TEST( c.begin(nb) != c.end(nb) );
         }
 
         // const
         {
             const Container & const_c = c;
 
-            BOOST_CHECK(
+            BOOST_TEST(
                 const_c.bucket_size(const_c.bucket(*di)) == 1
             );
 
             typename Container::size_type nb =
                 const_c.bucket(*const_c.find(*di));
 
-            BOOST_CHECK(
+            BOOST_TEST(
                 const_c.begin(nb) != const_c.end(nb) 
             );
         }
     }
 
 
-    BOOST_CHECK( c.load_factor() < c.max_load_factor() );
+    BOOST_TEST( c.load_factor() < c.max_load_factor() );
 
     c.max_load_factor(0.75);
 
-    BOOST_CHECK( c.max_load_factor() == 0.75 );
+    BOOST_TEST( c.max_load_factor() == 0.75 );
 
     c.rehash(10);
 }
@@ -353,11 +353,11 @@ void test_simple_unordered_associative_container(Container & c, const Data & d)
 template< class Container, class Data >
 void test_pair_ordered_associative_container_equality(Container & c, const Data & d)
 {
-    BOOST_CHECK( std::equal( c. begin(), c. end(), d. begin() ) );
-    BOOST_CHECK( std::equal( c.rbegin(), c.rend(), d.rbegin() ) );
+    BOOST_TEST( std::equal( c. begin(), c. end(), d. begin() ) );
+    BOOST_TEST( std::equal( c.rbegin(), c.rend(), d.rbegin() ) );
 
-    BOOST_CHECK( c.lower_bound( d.begin()->first ) ==   c.begin() );
-    BOOST_CHECK( c.upper_bound( d.begin()->first ) == ++c.begin() );
+    BOOST_TEST( c.lower_bound( d.begin()->first ) ==   c.begin() );
+    BOOST_TEST( c.upper_bound( d.begin()->first ) == ++c.begin() );
 }
 
 template< class Container, class Data >
@@ -372,9 +372,9 @@ void test_pair_ordered_associative_container(Container & c, const Data & d)
          ci != ce; ++ci )
     {
         typename Data::const_iterator di = d.find(ci->first);
-        BOOST_CHECK( di != d.end() );
-        BOOST_CHECK( ! c.key_comp()(di->first,ci->first) );
-        BOOST_CHECK( ! c.value_comp()(*ci,*di) );
+        BOOST_TEST( di != d.end() );
+        BOOST_TEST( ! c.key_comp()(di->first,ci->first) );
+        BOOST_TEST( ! c.value_comp()(*ci,*di) );
     }
 
     test_pair_ordered_associative_container_equality(c, d);
@@ -383,7 +383,7 @@ void test_pair_ordered_associative_container(Container & c, const Data & d)
 
     test_pair_ordered_associative_container_equality(cr, d);
 
-    BOOST_CHECK( c.range( c.begin()->first <= ::boost::lambda::_1,
+    BOOST_TEST( c.range( c.begin()->first <= ::boost::lambda::_1,
                           ::boost::lambda::_1 <= (++c.begin())->first ).
                     first == c.begin()
     );
@@ -396,8 +396,8 @@ void test_pair_unordered_associative_container(Container & c, const Data & d)
     c.clear();
     c.insert( d.begin(), d.end() );
 
-    BOOST_CHECK( c.bucket_count() * c.max_load_factor() >= d.size() );
-    BOOST_CHECK( c.max_bucket_count() >= c.bucket_count() );
+    BOOST_TEST( c.bucket_count() * c.max_load_factor() >= d.size() );
+    BOOST_TEST( c.max_bucket_count() >= c.bucket_count() );
 
     for( typename Data::const_iterator di = d.begin(), de = d.end() ;
          di != de ; ++di )
@@ -407,28 +407,28 @@ void test_pair_unordered_associative_container(Container & c, const Data & d)
             typename Container::size_type nb =
                 c.bucket(c.find(di->first)->first);
 
-            BOOST_CHECK( c.begin(nb) != c.end(nb) );
+            BOOST_TEST( c.begin(nb) != c.end(nb) );
         }
 
         // const
         {
             const Container & const_c = c;
 
-            BOOST_CHECK( const_c.bucket_size(const_c.bucket(di->first)) == 1 );
+            BOOST_TEST( const_c.bucket_size(const_c.bucket(di->first)) == 1 );
 
             typename Container::size_type nb =
                 const_c.bucket(const_c.find(di->first)->first);
 
-            BOOST_CHECK( const_c.begin(nb) != const_c.end(nb) );
+            BOOST_TEST( const_c.begin(nb) != const_c.end(nb) );
         }
     }
 
 
-    BOOST_CHECK( c.load_factor() < c.max_load_factor() );
+    BOOST_TEST( c.load_factor() < c.max_load_factor() );
 
     c.max_load_factor(0.75);
 
-    BOOST_CHECK( c.max_load_factor() == 0.75 );
+    BOOST_TEST( c.max_load_factor() == 0.75 );
 
     c.rehash(10);
 }
@@ -440,7 +440,7 @@ void test_unique_container(Container & c, Data & d)
     c.clear();
     c.insert(d.begin(),d.end());
     c.insert(*d.begin());
-    BOOST_CHECK( c.size() == d.size() );
+    BOOST_TEST( c.size() == d.size() );
 }
 
 template< class Container, class Data >
@@ -449,7 +449,7 @@ void test_non_unique_container(Container & c, Data & d)
     c.clear();
     c.insert(d.begin(),d.end());
     c.insert(*d.begin());
-    BOOST_CHECK( c.size() == (d.size()+1) );
+    BOOST_TEST( c.size() == (d.size()+1) );
 }
 
 
@@ -463,8 +463,8 @@ void test_basic_bimap( Bimap & b,
 
     test_container(b,d);
 
-    BOOST_CHECK( & b.left  == & b.template by<member_at::left >() );
-    BOOST_CHECK( & b.right == & b.template by<member_at::right>() );
+    BOOST_TEST( & b.left  == & b.template by<member_at::left >() );
+    BOOST_TEST( & b.right == & b.template by<member_at::right>() );
 
     test_container(b.left , ld);
     test_container(b.right, rd);
@@ -476,18 +476,18 @@ void test_tagged_bimap(Bimap & b,
 {
     using namespace boost::bimaps;
 
-    BOOST_CHECK( &b.left  == & b.template by<LeftTag >() );
-    BOOST_CHECK( &b.right == & b.template by<RightTag>() );
+    BOOST_TEST( &b.left  == & b.template by<LeftTag >() );
+    BOOST_TEST( &b.right == & b.template by<RightTag>() );
 
     b.clear();
     b.insert( *d.begin() );
 
-    BOOST_CHECK(
+    BOOST_TEST(
         b.begin()->template get<LeftTag>() ==
             b.template by<RightTag>().begin()->template get<LeftTag>()
     );
 
-    BOOST_CHECK(
+    BOOST_TEST(
         b.begin()->template get<RightTag>() ==
             b.template by<LeftTag>().begin()->template get<RightTag>()
     );
@@ -497,13 +497,13 @@ void test_tagged_bimap(Bimap & b,
 
     const Bimap & bc = b;
 
-    BOOST_CHECK( &bc.left  == & bc.template by<LeftTag>() );
-    BOOST_CHECK( &bc.right == & bc.template by<RightTag>() );
+    BOOST_TEST( &bc.left  == & bc.template by<LeftTag>() );
+    BOOST_TEST( &bc.right == & bc.template by<RightTag>() );
 
-    BOOST_CHECK( bc.begin()->template get<LeftTag>() ==
+    BOOST_TEST( bc.begin()->template get<LeftTag>() ==
                     bc.template by<RightTag>().begin()->template get<LeftTag>() );
 
-    BOOST_CHECK( bc.begin()->template get<RightTag>() ==
+    BOOST_TEST( bc.begin()->template get<RightTag>() ==
                     bc.template by<LeftTag>().begin()->template get<RightTag>() );
     }
 }
@@ -581,29 +581,29 @@ void test_bimap_init_copy_swap(const Data&d)
 {    
     Bimap b1(d.begin(),d.end());
     Bimap b2( b1 );
-    BOOST_CHECK( b1 == b2 );
+    BOOST_TEST( b1 == b2 );
     
     b2.clear();
     b2 = b1;
-    BOOST_CHECK( b2 == b1 );
+    BOOST_TEST( b2 == b1 );
 
     b2.clear();
     b2.left = b1.left;
-    BOOST_CHECK( b2 == b1 );
+    BOOST_TEST( b2 == b1 );
 
     b2.clear();
     b2.right = b1.right;
-    BOOST_CHECK( b2 == b1 );
+    BOOST_TEST( b2 == b1 );
 
     b1.clear();
     b2.swap(b1);
-    BOOST_CHECK( b2.empty() && !b1.empty() );
+    BOOST_TEST( b2.empty() && !b1.empty() );
 
     b1.left.swap( b2.left );
-    BOOST_CHECK( b1.empty() && !b2.empty() );
+    BOOST_TEST( b1.empty() && !b2.empty() );
 
     b1.right.swap( b2.right );
-    BOOST_CHECK( b2.empty() && !b1.empty() );
+    BOOST_TEST( b2.empty() && !b1.empty() );
 } 
 
 #endif // LIBS_BIMAP_TEST_BIMAP_TEST_HPP