LruCache< key_t, value_t, hash_t > Class Template Reference

#include <LruCache.hpp>

Public Types
using	const_list_iterator_t = typename cache_list_t::const_iterator

Public Member Functions
	LruCache (const size_t max_size)
void	put (const key_t &key, value_t &&value)
void	put (const key_t &key, const value_t &value)
value_t *	get (const key_t &key)
const_list_iterator_t	find (const key_t &key) const
const_list_iterator_t	cend () const
void	clear ()
void	evictFractionEntries (const float fraction)
void	evictNEntries (const size_t n)

Private Types
using	key_value_pair_t = typename std::pair< key_t, value_t >
using	cache_list_t = typename std::list< key_value_pair_t >
using	list_iterator_t = typename cache_list_t::iterator
using	map_t = typename std::unordered_map< key_t, list_iterator_t, hash_t >
using	map_t_iterator = typename map_t::iterator

Private Member Functions
void	putCommon (map_t_iterator &it, key_t const &key)
void	evictCommon (const size_t entries_to_evict)

Private Attributes
cache_list_t	cache_items_list_
map_t	cache_items_map_
size_t	max_size_

Detailed Description

template<typename key_t, typename value_t, class hash_t = std::hash<key_t>>
class LruCache< key_t, value_t, hash_t >

Definition at line 16 of file LruCache.hpp.

Member Typedef Documentation

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

using LruCache< key_t, value_t, hash_t >::cache_list_t = typename std::list<key_value_pair_t>

private

Definition at line 19 of file LruCache.hpp.

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

using LruCache< key_t, value_t, hash_t >::const_list_iterator_t = typename cache_list_t::const_iterator

Definition at line 47 of file LruCache.hpp.

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

using LruCache< key_t, value_t, hash_t >::key_value_pair_t = typename std::pair<key_t, value_t>

private

Definition at line 18 of file LruCache.hpp.

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

using LruCache< key_t, value_t, hash_t >::list_iterator_t = typename cache_list_t::iterator

private

Definition at line 20 of file LruCache.hpp.

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

using LruCache< key_t, value_t, hash_t >::map_t = typename std::unordered_map<key_t, list_iterator_t, hash_t>

private

Definition at line 21 of file LruCache.hpp.

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

using LruCache< key_t, value_t, hash_t >::map_t_iterator = typename map_t::iterator

private

Definition at line 22 of file LruCache.hpp.

Constructor & Destructor Documentation

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

LruCache< key_t, value_t, hash_t >::LruCache ( const size_t  max_size )

inline

Definition at line 25 of file LruCache.hpp.

: max_size_(max_size) {}

Member Function Documentation

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

const_list_iterator_t LruCache< key_t, value_t, hash_t >::cend ( ) const

inline

Definition at line 55 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_list_.

Referenced by LruCache< key_t, value_t, hash_t >::find(), and Executor::getCodeFromCache().

{ return (cache_items_list_.cend()); }

Here is the caller graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

void LruCache< key_t, value_t, hash_t >::clear ( )

inline

Definition at line 57 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_list_, and LruCache< key_t, value_t, hash_t >::cache_items_map_.

Referenced by StubGenerator::clearCache(), and ResultSetReductionJIT::clearCache().

               {
    cache_items_list_.clear();
    cache_items_map_.clear();
  }

Here is the caller graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

void LruCache< key_t, value_t, hash_t >::evictCommon ( const size_t  entries_to_evict )

inlineprivate

Definition at line 91 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_list_, and LruCache< key_t, value_t, hash_t >::cache_items_map_.

Referenced by LruCache< key_t, value_t, hash_t >::evictFractionEntries(), and LruCache< key_t, value_t, hash_t >::evictNEntries().

                                                  {
    auto last = cache_items_list_.end();
    size_t entries_erased = 0;
    while (entries_erased < entries_to_evict && last != cache_items_list_.begin()) {
      last--;
      cache_items_map_.erase(last->first);
      last = cache_items_list_.erase(last);
      entries_erased++;
    }
  }

Here is the caller graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

void LruCache< key_t, value_t, hash_t >::evictFractionEntries ( const float  fraction )

inline

Definition at line 62 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_map_, and LruCache< key_t, value_t, hash_t >::evictCommon().

                                                  {
    size_t entries_to_evict =
        std::min(std::max(static_cast<size_t>(cache_items_map_.size() * fraction),
                          static_cast<size_t>(1)),
                 cache_items_map_.size());
    evictCommon(entries_to_evict);
  }

Here is the call graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

void LruCache< key_t, value_t, hash_t >::evictNEntries ( const size_t  n )

inline

Definition at line 70 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_map_, and LruCache< key_t, value_t, hash_t >::evictCommon().

                                     {
    size_t entries_to_evict = std::min(n, cache_items_map_.size());
    evictCommon(entries_to_evict);
  }

Here is the call graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

const_list_iterator_t LruCache< key_t, value_t, hash_t >::find ( const key_t &  key ) const

inline

Definition at line 49 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_map_, and LruCache< key_t, value_t, hash_t >::cend().

Referenced by Executor::getCodeFromCache().

                                                     {
    auto it = cache_items_map_.find(key);
    auto val = (it == cache_items_map_.end() ? cend() : it->second);
    return (val);
  }

Here is the call graph for this function:

Here is the caller graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

value_t* LruCache< key_t, value_t, hash_t >::get ( const key_t &  key )

inline

Definition at line 39 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_list_, and LruCache< key_t, value_t, hash_t >::cache_items_map_.

Referenced by ResultSetReductionJIT::codegen(), and StubGenerator::generateStub().

                                 {
    auto it = cache_items_map_.find(key);
    if (it == cache_items_map_.end()) {
      return nullptr;
    }
    cache_items_list_.splice(cache_items_list_.begin(), cache_items_list_, it->second);
    return &it->second->second;
  }

Here is the caller graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

void LruCache< key_t, value_t, hash_t >::put ( const key_t &  key, value_t &&  value  )

inline

Definition at line 27 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_list_, LruCache< key_t, value_t, hash_t >::cache_items_map_, and LruCache< key_t, value_t, hash_t >::putCommon().

Referenced by Executor::addCodeToCache().

                                              {
    auto it = cache_items_map_.find(key);
    cache_items_list_.emplace_front(key, std::forward<value_t&&>(value));
    putCommon(it, key);
  }

Here is the call graph for this function:

Here is the caller graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

void LruCache< key_t, value_t, hash_t >::put ( const key_t &  key, const value_t &  value  )

inline

Definition at line 33 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_list_, LruCache< key_t, value_t, hash_t >::cache_items_map_, and LruCache< key_t, value_t, hash_t >::putCommon().

                                                   {
    auto it = cache_items_map_.find(key);
    cache_items_list_.emplace_front(key, std::forward<const value_t&&>(value));
    putCommon(it, key);
  }

Here is the call graph for this function:

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

void LruCache< key_t, value_t, hash_t >::putCommon ( map_t_iterator &  it, key_t const &  key  )

inlineprivate

Definition at line 76 of file LruCache.hpp.

References LruCache< key_t, value_t, hash_t >::cache_items_list_, LruCache< key_t, value_t, hash_t >::cache_items_map_, and LruCache< key_t, value_t, hash_t >::max_size_.

Referenced by LruCache< key_t, value_t, hash_t >::put().

                                                       {
    if (it != cache_items_map_.end()) {
      cache_items_list_.erase(it->second);
      cache_items_map_.erase(it);
    }
    cache_items_map_[key] = cache_items_list_.begin();

    if (cache_items_map_.size() > max_size_) {
      auto last = cache_items_list_.end();
      last--;
      cache_items_map_.erase(last->first);
      cache_items_list_.pop_back();
    }
  }

Here is the caller graph for this function:

Member Data Documentation

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

cache_list_t LruCache< key_t, value_t, hash_t >::cache_items_list_

private

Definition at line 102 of file LruCache.hpp.

Referenced by LruCache< key_t, value_t, hash_t >::cend(), LruCache< key_t, value_t, hash_t >::clear(), LruCache< key_t, value_t, hash_t >::evictCommon(), LruCache< key_t, value_t, hash_t >::get(), LruCache< key_t, value_t, hash_t >::put(), and LruCache< key_t, value_t, hash_t >::putCommon().

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

map_t LruCache< key_t, value_t, hash_t >::cache_items_map_

private

Definition at line 103 of file LruCache.hpp.

Referenced by LruCache< key_t, value_t, hash_t >::clear(), LruCache< key_t, value_t, hash_t >::evictCommon(), LruCache< key_t, value_t, hash_t >::evictFractionEntries(), LruCache< key_t, value_t, hash_t >::evictNEntries(), LruCache< key_t, value_t, hash_t >::find(), LruCache< key_t, value_t, hash_t >::get(), LruCache< key_t, value_t, hash_t >::put(), and LruCache< key_t, value_t, hash_t >::putCommon().

template<typename key_t , typename value_t , class hash_t = std::hash<key_t>>

size_t LruCache< key_t, value_t, hash_t >::max_size_

private

Definition at line 104 of file LruCache.hpp.

Referenced by LruCache< key_t, value_t, hash_t >::putCommon().

---

The documentation for this class was generated from the following file:

• /home/jenkins-slave/workspace/core-os-doxygen/StringDictionary/LruCache.hpp