bitset: Prove that bitset operations with len=0 don't underflow

This commit is contained in:
lupine
2013-07-26 17:09:21 +01:00
parent f590f8ed3c
commit 1a966ca0be

View File

@@ -209,6 +209,11 @@ START_TEST( test_bitset_set_range )
bitset_set_range( map, 8, 8 ); bitset_set_range( map, 8, 8 );
assert_bitset_is( map, 0x000000000000ff00 ); assert_bitset_is( map, 0x000000000000ff00 );
bitset_clear( map );
assert_bitset_is( map, 0x0000000000000000 );
bitset_set_range( map, 0, 0 );
assert_bitset_is( map, 0x0000000000000000 );
free( map ); free( map );
} }
END_TEST END_TEST
@@ -222,6 +227,11 @@ START_TEST( test_bitset_clear_range )
bitset_clear_range( map, 8, 8 ); bitset_clear_range( map, 8, 8 );
assert_bitset_is( map, 0xffffffffffff00ff ); assert_bitset_is( map, 0xffffffffffff00ff );
bitset_set( map );
assert_bitset_is( map, 0xffffffffffffffff );
bitset_clear_range( map, 0, 0 );
assert_bitset_is( map, 0xffffffffffffffff );
free( map ); free( map );
} }
END_TEST END_TEST