AndrewShkrob/organicmaps
1
Fork 0
forked from organicmaps/organicmaps
Code Pull requests Activity

Tests on LRU cache implementation.

Browse source
This commit is contained in:
Vladimir Byko-Ianko 2018-03-29 14:49:08 +03:00 • committed by mpimenov
parent c37441bf50
commit cf7e192f97
3 changed files with 171 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
base/base_tests/CMakeLists.txt
View file

@ -24,6 +24,7 @@ set(
levenshtein_dfa_test.cpp
linked_map_tests.cpp
logging_test.cpp
lru_cache_test.cpp
math_test.cpp
matrix_test.cpp
mem_trie_test.cpp

166
base/base_tests/lru_cache_test.cpp Normal file
View file

@ -0,0 +1,166 @@
#include "testing/testing.hpp"
#include "base/lru_cache.hpp"
#include <cstddef>
#include <map>
template <typename Key, typename Value>
class LruCacheTest
{
public:
LruCacheTest(size_t maxCacheSize, typename LruCache<Key, Value>::Loader const & loader)
: m_cache(maxCacheSize, loader)
{
}
Value const & GetValue(Key const & key) { return m_cache.GetValue(key); }
bool IsValid() const { return m_cache.IsValid(); }
private:
LruCache<Key, Value> m_cache;
};
template <typename Key, typename Value>
class LruCacheKeyAgeTest
{
public:
void InsertKey(Key const & key) { m_keyAge.InsertKey(key); }
void UpdateAge(Key const & key) { m_keyAge.UpdateAge(key); }
Key const & GetLruKey() const { return m_keyAge.GetLruKey(); }
void RemoveLru() { m_keyAge.RemoveLru(); }
bool IsValid() const { return m_keyAge.IsValidForTesting(); }
size_t GetAge() const { return m_keyAge.m_age; }
std::map<size_t, Key> const & GetAgeToKey() const { return m_keyAge.m_ageToKey; };
std::map<Key, size_t> const & GetKeyToAge() const { return m_keyAge.m_keyToAge; };
private:
typename LruCache<Key, Value>::KeyAge m_keyAge;
};
template <typename Key, typename Value>
void TestAge(LruCacheKeyAgeTest<Key, Value> const & keyAge,
size_t expectedAge, std::map<size_t, Key> const & expectedAgeToKey,
std::map<Key, size_t> const & expectedKeyToAge)
{
TEST(keyAge.IsValid(), ());
TEST_EQUAL(keyAge.GetAge(), expectedAge, ());
TEST_EQUAL(keyAge.GetAgeToKey(), expectedAgeToKey, ());
TEST_EQUAL(keyAge.GetKeyToAge(), expectedKeyToAge, ());
}
UNIT_TEST(LruCacheAgeTest)
{
using Key = int;
using Value = double;
LruCacheKeyAgeTest<Key, Value> age;
TEST_EQUAL(age.GetAge(), 0, ());
TEST(age.GetAgeToKey().empty(), ());
TEST(age.GetKeyToAge().empty(), ());
age.InsertKey(10);
{
std::map<size_t, Key> const expectedAgeToKey({{1 /* age */, 10 /* key */}});
std::map<Key, size_t> const expectedKeyToAge({{10 /* key */, 1 /* age */}});
TestAge(age, 1 /* cache age */, expectedAgeToKey, expectedKeyToAge);
}
age.InsertKey(9);
{
std::map<size_t, Key> const expectedAgeToKey({{1, 10}, {2, 9}});
std::map<Key, size_t> const expectedKeyToAge({{10, 1}, {9, 2}});
TestAge(age, 2 /* cache age */, expectedAgeToKey, expectedKeyToAge);
}
age.RemoveLru();
{
std::map<size_t, Key> const expectedAgeToKey({{2, 9}});
std::map<Key, size_t> const expectedKeyToAge({{9, 2}});
TestAge(age, 2 /* cache age */, expectedAgeToKey, expectedKeyToAge);
}
age.InsertKey(11);
{
std::map<size_t, Key> const expectedAgeToKey({{2, 9}, {3, 11}});
std::map<Key, size_t> const expectedKeyToAge({{9, 2}, {11, 3}});
TestAge(age, 3 /* cache age */, expectedAgeToKey, expectedKeyToAge);
}
age.UpdateAge(9);
{
std::map<size_t, Key> const expectedAgeToKey({{4, 9}, {3, 11}});
std::map<Key, size_t> const expectedKeyToAge({{9, 4}, {11, 3}});
TestAge(age, 4 /* cache age */, expectedAgeToKey, expectedKeyToAge);
}
age.RemoveLru();
{
std::map<size_t, Key> const expectedAgeToKey({{4, 9}});
std::map<Key, size_t> const expectedKeyToAge({{9, 4}});
TestAge(age, 4 /* cache age */, expectedAgeToKey, expectedKeyToAge);
}
age.InsertKey(12);
{
std::map<size_t, Key> const expectedAgeToKey({{4, 9}, {5, 12}});
std::map<Key, size_t> const expectedKeyToAge({{9, 4}, {12, 5}});
TestAge(age, 5 /* cache age */, expectedAgeToKey, expectedKeyToAge);
}
}
UNIT_TEST(LruCacheSmokeTest)
{
using Key = int;
using Value = int;
{
LruCacheTest<Key, Value> cache(1 /* maxCacheSize */, [](Key k, Value & v) { v = 1; } /* loader */);
TEST_EQUAL(cache.GetValue(1), 1, ());
TEST_EQUAL(cache.GetValue(2), 1, ());
TEST_EQUAL(cache.GetValue(3), 1, ());
TEST_EQUAL(cache.GetValue(4), 1, ());
TEST_EQUAL(cache.GetValue(1), 1, ());
TEST(cache.IsValid(), ());
}
{
LruCacheTest<Key, Value> cache(3 /* maxCacheSize */, [](Key k, Value & v) { v = k; } /* loader */);
TEST_EQUAL(cache.GetValue(1), 1, ());
TEST_EQUAL(cache.GetValue(2), 2, ());
TEST_EQUAL(cache.GetValue(2), 2, ());
TEST_EQUAL(cache.GetValue(5), 5, ());
TEST_EQUAL(cache.GetValue(1), 1, ());
TEST(cache.IsValid(), ());
}
}
UNIT_TEST(LruCacheLoaderCallsTest)
{
using Key = int;
using Value = int;
bool shouldLoadBeCalled = true;
auto loader = [&shouldLoadBeCalled](Key k, Value & v) {
TEST(shouldLoadBeCalled, ());
v = k;
};
LruCacheTest<Key, Value> cache(3 /* maxCacheSize */, loader);
TEST(cache.IsValid(), ());
cache.GetValue(1);
cache.GetValue(2);
cache.GetValue(3);
TEST(cache.IsValid(), ());
shouldLoadBeCalled = false;
cache.GetValue(3);
cache.GetValue(2);
cache.GetValue(1);
TEST(cache.IsValid(), ());
shouldLoadBeCalled = true;
cache.GetValue(4);
TEST(cache.IsValid(), ());
shouldLoadBeCalled = false;
cache.GetValue(1);
TEST(cache.IsValid(), ());
}

4
xcode/base/base.xcodeproj/project.pbxproj
View file

@ -83,6 +83,7 @@
3DBD7B95240FB11200ED9FE8 /* checked_cast_tests.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 3DBD7B94240FB11200ED9FE8 /* checked_cast_tests.cpp */; };
564BB445206E89ED00BDD211 /* fifo_cache.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 564BB444206E89ED00BDD211 /* fifo_cache.hpp */; };
56290B8A206D0887003892E0 /* lru_cache.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 56290B89206D0887003892E0 /* lru_cache.hpp */; };
56290B8C206D0938003892E0 /* lru_cache_test.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 56290B8B206D0937003892E0 /* lru_cache_test.cpp */; };
56B1A0741E69DE4D00395022 /* random.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 56B1A0711E69DE4D00395022 /* random.cpp */; };
56B1A0751E69DE4D00395022 /* random.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 56B1A0721E69DE4D00395022 /* random.hpp */; };
56B1A0761E69DE4D00395022 /* small_set.hpp in Headers */ = {isa = PBXBuildFile; fileRef = 56B1A0731E69DE4D00395022 /* small_set.hpp */; };
@ -236,6 +237,7 @@
564BB444206E89ED00BDD211 /* fifo_cache.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = fifo_cache.hpp; sourceTree = "<group>"; };
564BB446206E8A4D00BDD211 /* fifo_cache_test.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = fifo_cache_test.cpp; sourceTree = "<group>"; };
56290B89206D0887003892E0 /* lru_cache.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = lru_cache.hpp; sourceTree = "<group>"; };
56290B8B206D0937003892E0 /* lru_cache_test.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = lru_cache_test.cpp; sourceTree = "<group>"; };
56B1A0711E69DE4D00395022 /* random.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = random.cpp; sourceTree = "<group>"; };
56B1A0721E69DE4D00395022 /* random.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = random.hpp; sourceTree = "<group>"; };
56B1A0731E69DE4D00395022 /* small_set.hpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.h; path = small_set.hpp; sourceTree = "<group>"; };
@ -354,6 +356,7 @@
39F995E220F55B8A0034F977 /* visitor_tests.cpp */,
39BC707420F55B6700A6EC20 /* clustering_map_tests.cpp */,
564BB446206E8A4D00BDD211 /* fifo_cache_test.cpp */,
56290B8B206D0937003892E0 /* lru_cache_test.cpp */,
39B89C391FD1898A001104AF /* control_flow_tests.cpp */,
67E40EC71E4DC0D500A6D200 /* small_set_test.cpp */,
3446C67E1DDCAA6E00146687 /* newtype_test.cpp */,
@ -792,6 +795,7 @@
67B52B601AD3C84E00664C17 /* thread_checker.cpp in Sources */,
675341E71A3F57E400A0A8C3 /* normalize_unicode.cpp in Sources */,
675341E11A3F57E400A0A8C3 /* lower_case.cpp in Sources */,
56290B8C206D0938003892E0 /* lru_cache_test.cpp in Sources */,
672DD4C11E0425600078E13C /* condition.cpp in Sources */,
);
runOnlyForDeploymentPostprocessing = 0;