| Index: net/disk_cache/blockfile/bitmap_unittest.cc
|
| diff --git a/net/disk_cache/blockfile/bitmap_unittest.cc b/net/disk_cache/blockfile/bitmap_unittest.cc
|
| index a0748bf81a54b5f47a566bd513fcdb7d10f876af..d35f69c612e1416ba32e0432e536d42fca42c838 100644
|
| --- a/net/disk_cache/blockfile/bitmap_unittest.cc
|
| +++ b/net/disk_cache/blockfile/bitmap_unittest.cc
|
| @@ -105,8 +105,8 @@ TEST(BitmapTest, Map) {
|
| EXPECT_EQ(0, memcmp(local_map, bitmap.GetMap(), kMapSize));
|
|
|
| // Now let's create a bitmap that shares local_map as storage.
|
| - disk_cache::Bitmap bitmap2(reinterpret_cast<uint32*>(local_map),
|
| - kMapSize * 8, kMapSize / 4);
|
| + disk_cache::Bitmap bitmap2(
|
| + reinterpret_cast<uint32*>(local_map), kMapSize * 8, kMapSize / 4);
|
| EXPECT_EQ(0, memcmp(local_map, bitmap2.GetMap(), kMapSize));
|
|
|
| local_map[kMapSize / 2] = 'a';
|
| @@ -183,8 +183,7 @@ TEST(BitmapTest, FindNextSetBitBeforeLimit) {
|
| map.Set(i, (i % 27) == 0);
|
|
|
| int find_me = 135; // First one expected.
|
| - for (int index = 111; map.FindNextSetBitBeforeLimit(&index, 278);
|
| - ++index) {
|
| + for (int index = 111; map.FindNextSetBitBeforeLimit(&index, 278); ++index) {
|
| EXPECT_EQ(index, find_me);
|
| find_me += 27;
|
| }
|
|
|