Cross Reference: /external/chromium_org/base/containers/mru_cache

Lines Matching refs:cache
37   Cache cache(Cache::NO_AUTO_EVICT);
42     EXPECT_TRUE(cache.Get(0) == cache.end());
43     EXPECT_TRUE(cache.Peek(0) == cache.end());
48   Cache::iterator inserted_item = cache.Put(kItem1Key, item1);
49   EXPECT_EQ(1U, cache.size());
53     Cache::iterator found = cache.Get(kItem1Key);
54     EXPECT_TRUE(inserted_item == cache.begin());
55     EXPECT_TRUE(found != cache.end());
57     found = cache.Peek(kItem1Key);
58     EXPECT_TRUE(found != cache.end());
66   cache.Put(kItem2Key, item2);
67   EXPECT_EQ(2U, cache.size());
71     Cache::reverse_iterator oldest = cache.rbegin();
72     ASSERT_TRUE(oldest != cache.rend());
79     Cache::iterator test_item = cache.Get(kItem1Key);
80     ASSERT_TRUE(test_item != cache.end());
87     Cache::reverse_iterator oldest = cache.rbegin();
88     ASSERT_TRUE(oldest != cache.rend());
95     Cache::reverse_iterator next = cache.Erase(cache.rbegin());
97     EXPECT_EQ(1U, cache.size());
99     EXPECT_TRUE(next == cache.rbegin());
103     cache.Erase(cache.begin());
104     EXPECT_EQ(0U, cache.size());
108   cache.Put(kItem1Key, item1);
109   cache.Put(kItem2Key, item2);
110   EXPECT_EQ(2U, cache.size());
111   cache.Clear();
112   EXPECT_EQ(0U, cache.size());
117   Cache cache(Cache::NO_AUTO_EVICT);
121   cache.Put(kItem1Key, item1);
125   cache.Put(kItem2Key, item2);
128   cache.ShrinkToSize(100);
132     Cache::reverse_iterator iter = cache.rbegin();
133     ASSERT_TRUE(iter != cache.rend());
140     Cache::iterator peekiter = cache.Peek(kItem1Key);
141     ASSERT_TRUE(peekiter != cache.end());
143     Cache::reverse_iterator iter = cache.rbegin();
144     ASSERT_TRUE(iter != cache.rend());
152   Cache cache(Cache::NO_AUTO_EVICT);
156   cache.Put(kItem1Key, item1);
160   cache.Put(kItem2Key, item2);
164   cache.Put(kItem3Key, item3);
168   cache.Put(kItem4Key, item4);
171   cache.Put(kItem3Key, item5);
173   EXPECT_EQ(4U, cache.size());
175     Cache::reverse_iterator iter = cache.rbegin();
176     ASSERT_TRUE(iter != cache.rend());
180   cache.ShrinkToSize(1);
182   Cache::iterator iter = cache.begin();
190   Cache cache(Cache::NO_AUTO_EVICT);
196   cache.Put(kItem1Key, new CachedItem(20));
197   cache.Put(kItem1Key, new CachedItem(22));
200   Cache::iterator iter = cache.Get(kItem1Key);
201   EXPECT_EQ(1U, cache.size());
202   EXPECT_TRUE(iter != cache.end());
206   cache.Erase(cache.begin());
209   // Now try another cache that goes out of scope to make sure its pointers
238     Cache cache(kMaxSize);
241     cache.Put(kItem1Key, new CachedItem(20));
242     cache.Put(kItem2Key, new CachedItem(21));
243     cache.Put(kItem3Key, new CachedItem(22));
244     cache.Put(kItem4Key, new CachedItem(23));
246     // The cache should only have kMaxSize items in it even though we inserted
248     EXPECT_EQ(kMaxSize, cache.size());
256   // Very simple test to make sure that the hashing cache works correctly.
258   Cache cache(Cache::NO_AUTO_EVICT);
261   cache.Put("First", one);
264   cache.Put("Second", two);
266   EXPECT_EQ(one.value, cache.Get("First")->second.value);
267   EXPECT_EQ(two.value, cache.Get("Second")->second.value);
268   cache.ShrinkToSize(1);
269   EXPECT_EQ(two.value, cache.Get("Second")->second.value);
270   EXPECT_TRUE(cache.Get("First") == cache.end());