summaryrefslogtreecommitdiffstats
path: root/chrome/common/mru_cache_unittest.cc
diff options
context:
space:
mode:
authordeanm@chromium.org <deanm@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98>2008-12-08 14:44:44 +0000
committerdeanm@chromium.org <deanm@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98>2008-12-08 14:44:44 +0000
commit6f2660e7a1db2f25b95fd8b841abb38e313494a7 (patch)
tree6f615f39c8550a868c837920fb8d21a2b6d7d222 /chrome/common/mru_cache_unittest.cc
parentab182e455292e448df7b9011763d331c2874792a (diff)
downloadchromium_src-6f2660e7a1db2f25b95fd8b841abb38e313494a7.zip
chromium_src-6f2660e7a1db2f25b95fd8b841abb38e313494a7.tar.gz
chromium_src-6f2660e7a1db2f25b95fd8b841abb38e313494a7.tar.bz2
Platform cleanup in common/
Review URL: http://codereview.chromium.org/10988 Patch from Pawel Hajdan Jr. git-svn-id: svn://svn.chromium.org/chrome/trunk/src@6506 0039d316-1c4b-4281-b951-d872f2087c98
Diffstat (limited to 'chrome/common/mru_cache_unittest.cc')
-rw-r--r--chrome/common/mru_cache_unittest.cc12
1 files changed, 6 insertions, 6 deletions
diff --git a/chrome/common/mru_cache_unittest.cc b/chrome/common/mru_cache_unittest.cc
index dccc5a8..15f3dc5 100644
--- a/chrome/common/mru_cache_unittest.cc
+++ b/chrome/common/mru_cache_unittest.cc
@@ -46,7 +46,7 @@ TEST(MRUCacheTest, Basic) {
static const int kItem1Key = 5;
CachedItem item1(10);
Cache::iterator inserted_item = cache.Put(kItem1Key, item1);
- EXPECT_EQ(1, cache.size());
+ EXPECT_EQ(1U, cache.size());
// Check that item1 was properly inserted.
{
@@ -64,7 +64,7 @@ TEST(MRUCacheTest, Basic) {
static const int kItem2Key = 7;
CachedItem item2(12);
cache.Put(kItem2Key, item2);
- EXPECT_EQ(2, cache.size());
+ EXPECT_EQ(2U, cache.size());
// Check that item1 is the oldest since item2 was added afterwards.
{
@@ -94,14 +94,14 @@ TEST(MRUCacheTest, Basic) {
{
Cache::reverse_iterator next = cache.Erase(cache.rbegin());
- EXPECT_EQ(1, cache.size());
+ EXPECT_EQ(1U, cache.size());
EXPECT_TRUE(next == cache.rbegin());
EXPECT_EQ(kItem1Key, next->first);
EXPECT_EQ(item1.value, next->second.value);
cache.Erase(cache.begin());
- EXPECT_EQ(0, cache.size());
+ EXPECT_EQ(0U, cache.size());
}
}
@@ -163,7 +163,7 @@ TEST(MRUCacheTest, KeyReplacement) {
CachedItem item5(50);
cache.Put(kItem3Key, item5);
- EXPECT_EQ(4, cache.size());
+ EXPECT_EQ(4U, cache.size());
for (int i = 0; i < 3; ++i) {
Cache::reverse_iterator iter = cache.rbegin();
ASSERT_TRUE(iter != cache.rend());
@@ -191,7 +191,7 @@ TEST(MRUCacheTest, Owning) {
// There should still be one item, and one extra live item.
Cache::iterator iter = cache.Get(kItem1Key);
- EXPECT_EQ(1, cache.size());
+ EXPECT_EQ(1U, cache.size());
EXPECT_TRUE(iter != cache.end());
EXPECT_EQ(initial_count + 1, cached_item_live_count);