comparison UnitTestsSources/MemoryCacheTests.cpp @ 3454:0e3c26e4b8ec

LeastRecentlyUsedIndex::GetAllKeys (test)
author Alain Mazy <alain@mazy.be>
date Wed, 03 Jul 2019 10:19:27 +0200
parents 4e43e67f8ecf
children db71bd11affc
comparison
equal deleted inserted replaced
3453:8c663bbe5363 3454:0e3c26e4b8ec
33 33
34 #include "PrecompiledHeadersUnitTests.h" 34 #include "PrecompiledHeadersUnitTests.h"
35 #include "gtest/gtest.h" 35 #include "gtest/gtest.h"
36 36
37 #include <memory> 37 #include <memory>
38 #include <algorithm>
38 #include <boost/thread.hpp> 39 #include <boost/thread.hpp>
39 #include <boost/lexical_cast.hpp> 40 #include <boost/lexical_cast.hpp>
40 41
41 #include "../Core/Cache/MemoryCache.h" 42 #include "../Core/Cache/MemoryCache.h"
42 #include "../Core/Cache/SharedArchive.h" 43 #include "../Core/Cache/SharedArchive.h"
168 r.RemoveOldest(); 169 r.RemoveOldest();
169 170
170 ASSERT_TRUE(r.IsEmpty()); 171 ASSERT_TRUE(r.IsEmpty());
171 } 172 }
172 173
174 TEST(LRU, GetAllKeys)
175 {
176 Orthanc::LeastRecentlyUsedIndex<std::string, int> r;
177 std::vector<std::string> keys;
178
179 r.AddOrMakeMostRecent("a", 420);
180 r.GetAllKeys(keys);
181
182 ASSERT_EQ(1, keys.size());
183 ASSERT_EQ("a", keys[0]);
184
185 r.AddOrMakeMostRecent("b", 421);
186 r.GetAllKeys(keys);
187
188 ASSERT_EQ(2, keys.size());
189 ASSERT_TRUE(std::find(keys.begin(), keys.end(),"a") != keys.end());
190 ASSERT_TRUE(std::find(keys.begin(), keys.end(),"b") != keys.end());
191 }
173 192
174 193
175 194
176 namespace 195 namespace
177 { 196 {