#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 (key_t const &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 ()

Private Types
typedef std::pair< key_t, value_t >	key_value_pair_t

using	cache_list_t = typename std::list< key_value_pair_t >

using	list_iterator_t = typename cache_list_t::iterator

typedef std::unordered_map< key_t, list_iterator_t, hash_t >	map_t

using	map_t_iterator = typename map_t::iterator

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

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

◆ cache_list_t

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.

◆ const_list_iterator_t

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.

◆ key_value_pair_t

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

typedef std::pair<key_t, value_t> LruCache< key_t, value_t, hash_t >::key_value_pair_t

private

Definition at line 18 of file LruCache.hpp.

◆ list_iterator_t

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.

◆ map_t

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

typedef std::unordered_map<key_t, list_iterator_t, hash_t> LruCache< key_t, value_t, hash_t >::map_t

private

Definition at line 21 of file LruCache.hpp.

◆ map_t_iterator

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

◆ LruCache()

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.

25 : max_size_(max_size) {}

LruCache::max_size_

size_t max_size_

Definition: LruCache.hpp:80

Member Function Documentation

◆ cend()

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.

Referenced by LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::find(), and Executor::getCodeFromCache().

55 { return (cache_items_list_.cend()); }

LruCache::cache_items_list_

cache_list_t cache_items_list_

Definition: LruCache.hpp:78

Here is the caller graph for this function:

◆ clear()

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.

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

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

Here is the caller graph for this function:

◆ find()

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.

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 caller graph for this function:

◆ get()

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.

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:

◆ put() [1/2]

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

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

inline

Definition at line 27 of file LruCache.hpp.

Referenced by Executor::getCodeFromCache().

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

Here is the caller graph for this function:

◆ put() [2/2]

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.

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

◆ putCommon()

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 63 of file LruCache.hpp.

Referenced by LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::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

◆ cache_items_list_

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 78 of file LruCache.hpp.

Referenced by LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::cend(), LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::clear(), LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::get(), LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::put(), and LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::putCommon().

◆ cache_items_map_

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 79 of file LruCache.hpp.

Referenced by LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::clear(), LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::find(), LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::get(), LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::put(), and LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::putCommon().

◆ max_size_

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 80 of file LruCache.hpp.

Referenced by LruCache< CodeCacheKey, CodeCacheValWithModule, boost::hash< CodeCacheKey > >::putCommon().

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

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

Public Types

Public Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

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

Member Typedef Documentation

◆ cache_list_t

◆ const_list_iterator_t

◆ key_value_pair_t

◆ list_iterator_t

◆ map_t

◆ map_t_iterator

Constructor & Destructor Documentation

◆ LruCache()

Member Function Documentation

◆ cend()

◆ clear()

◆ find()

◆ get()

◆ put() [1/2]

◆ put() [2/2]

◆ putCommon()

Member Data Documentation

◆ cache_items_list_

◆ cache_items_map_

◆ max_size_

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