# HG changeset patch
# User Alain Mazy <alain@mazy.be>
# Date 1562141967 -7200
# Node ID 0e3c26e4b8ec5d7c4813c315110ed0a3a57f0a1c
# Parent  8c663bbe536310bba27bda564f91a9c8448e2ffd
LeastRecentlyUsedIndex::GetAllKeys (test)

diff -r 8c663bbe5363 -r 0e3c26e4b8ec UnitTestsSources/MemoryCacheTests.cpp
--- a/UnitTestsSources/MemoryCacheTests.cpp	Wed Jul 03 10:18:05 2019 +0200
+++ b/UnitTestsSources/MemoryCacheTests.cpp	Wed Jul 03 10:19:27 2019 +0200
@@ -35,6 +35,7 @@
 #include "gtest/gtest.h"
 
 #include <memory>
+#include <algorithm>
 #include <boost/thread.hpp>
 #include <boost/lexical_cast.hpp>
 
@@ -170,6 +171,24 @@
   ASSERT_TRUE(r.IsEmpty());
 }
 
+TEST(LRU, GetAllKeys)
+{
+  Orthanc::LeastRecentlyUsedIndex<std::string, int> r;
+  std::vector<std::string> keys;
+
+  r.AddOrMakeMostRecent("a", 420);
+  r.GetAllKeys(keys);
+
+  ASSERT_EQ(1, keys.size());
+  ASSERT_EQ("a", keys[0]);
+
+  r.AddOrMakeMostRecent("b", 421);
+  r.GetAllKeys(keys);
+
+  ASSERT_EQ(2, keys.size());
+  ASSERT_TRUE(std::find(keys.begin(), keys.end(),"a") != keys.end());
+  ASSERT_TRUE(std::find(keys.begin(), keys.end(),"b") != keys.end());
+}