wroclaw-git-backups/nix
1
0
Fork 0
mirror of https://github.com/NixOS/nix synced 2025-07-05 08:11:47 +02:00
Code Activity

libutil: Use heterogeneous lookup for LRUCache

Browse source 
This gets rid of some ugly std::string_view -> std::string
conversions, which are an eye-sore and lead to extra copying.
This commit is contained in:
Sergei Zimmerman 2025-05-14 21:42:35 +00:00
parent 90d70aa4c9
commit cd61e922ff
No known key found for this signature in database
GPG key ID: A9B0B557CA632325
2 changed files with 13 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

13
src/libutil/include/nix/util/lru-cache.hh
View file

@ -11,7 +11,7 @@ namespace nix {
/**
* A simple least-recently used cache. Not thread-safe.
*/
template<typename Key, typename Value>
template<typename Key, typename Value, typename Compare = std::less<>>
class LRUCache
{
private:
@ -22,7 +22,7 @@ private:
// and LRU.
struct LRUIterator;
using Data = std::map<Key, std::pair<LRUIterator, Value>>;
using Data = std::map<Key, std::pair<LRUIterator, Value>, Compare>;
using LRU = std::list<typename Data::iterator>;
struct LRUIterator
@ -43,7 +43,8 @@ public:
/**
* Insert or upsert an item in the cache.
*/
void upsert(const Key & key, const Value & value)
template<typename K>
void upsert(const K & key, const Value & value)
{
if (capacity == 0)
return;
@ -68,7 +69,8 @@ public:
i->second.first.it = j;
}
bool erase(const Key & key)
template<typename K>
bool erase(const K & key)
{
auto i = data.find(key);
if (i == data.end())
@ -82,7 +84,8 @@ public:
* Look up an item in the cache. If it exists, it becomes the most
* recently used item.
* */
std::optional<Value> get(const Key & key)
template<typename K>
std::optional<Value> get(const K & key)
{
auto i = data.find(key);
if (i == data.end())