Merge branch 'dev' of github.com:khizmax/libcds into dev

diff --cc tests/test-hdr/tree/hdr_bronson_avltree_map.h
index 04f6ac7be27be80eb2891647950fa3947d35655d,9f16c1bea20c3b8c5d661afd6bd35b4323765e7c..f33e56af2f66637e557c399283617c5b84590bb4
--- 1/tests/test-hdr/tree/hdr_bronson_avltree_map.h
--- 2/tests/test-hdr/tree/hdr_bronson_avltree_map.h
+++ b/tests/test-hdr/tree/hdr_bronson_avltree_map.h
@@@ -352,9 -342,8 +352,9 @@@ namespace tree 
              exempt_ptr xp;
  
              // extract_min
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.emplace( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
              xp = s.extract_min();
              CPPUNIT_ASSERT( xp );
@@@ -370,9 -359,8 +370,9 @@@
              CPPUNIT_CHECK( nCount == sizeof(keys) / sizeof(keys[0]));
  
              // extract_min<Func>
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.insert( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
              nCount = 1;
              xp = s.extract_min( [&keyPrev]( key_type k ){ keyPrev = k; });
@@@ -392,9 -380,8 +392,9 @@@
              CPPUNIT_CHECK( nCount == sizeof(keys) / sizeof(keys[0]));
  
              // extract_min_key
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.insert( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
              nCount = 1;
              xp = s.extract_min_key( keyPrev );
@@@ -414,9 -401,8 +414,9 @@@
              CPPUNIT_CHECK( nCount == sizeof(keys) / sizeof(keys[0]));
  
              // extract_max
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.emplace( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
              nCount = 1;
              xp = s.extract_max();
@@@ -434,9 -420,8 +434,9 @@@
              CPPUNIT_CHECK( nCount == sizeof(keys) / sizeof(keys[0]));
  
              // extract_max<Func>
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.emplace( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
              nCount = 1;
              xp = s.extract_max( [&keyPrev]( key_type k ){ keyPrev = k; });
@@@ -458,9 -443,8 +458,9 @@@
              CPPUNIT_CHECK( nCount == sizeof(keys) / sizeof(keys[0]));
  
              // extract_max_key
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.emplace( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
              nCount = 1;
              xp = s.extract_max_key( keyPrev );
@@@ -482,11 -466,10 +482,11 @@@
              CPPUNIT_CHECK( nCount == sizeof(keys) / sizeof(keys[0]));
  
              // extract
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.emplace( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
-             for ( int i = 0; i < sizeof( keys ) / sizeof( keys[0] ); ++i ) {
+             for ( int i = 0; i < static_cast<int>(sizeof( keys ) / sizeof( keys[0] )); ++i ) {
                  xp = s.extract(keys[i]);
                  CPPUNIT_CHECK_EX( xp->nVal == keys[i] * c_nStep, "Expected value=" << keys[i] * c_nStep << " real=" << xp->nVal );
              }
@@@ -494,11 -477,10 +494,11 @@@
  
  
              // extract_with
-             for ( int i = 0; i < sizeof(keys) / sizeof(keys[0]); ++i )
+             for ( int i = 0; i < static_cast<int>(sizeof(keys) / sizeof(keys[0])); ++i )
                  CPPUNIT_ASSERT( s.emplace( keys[i], keys[i] * c_nStep ));
 +            CPPUNIT_CHECK( s.check_consistency( check_functor() ));
  
-             for ( int i = 0; i < sizeof( keys ) / sizeof( keys[0] ); ++i ) {
+             for ( int i = 0; i < static_cast<int>(sizeof( keys ) / sizeof( keys[0] )); ++i ) {
                  xp = s.extract_with( wrapped_int(keys[i]), wrapped_less());
                  CPPUNIT_CHECK_EX( xp->nVal == keys[i] * c_nStep, "Expected value=" << keys[i] * c_nStep << " real=" << xp->nVal );
              }