DictionaryCache< key_t, value_t > Class Template Reference

#include <DictionaryCache.hpp>

Public Member Functions
	DictionaryCache ()
void	put (const key_t &key, const std::shared_ptr< value_t > value)
std::shared_ptr< value_t >	get (const key_t &key)
void	remove (const key_t &key)
bool	is_empty ()
void	invalidateInvertedIndex () noexcept

Private Attributes
std::unordered_map< key_t, std::shared_ptr< value_t > >	cache_items

Detailed Description

template<typename key_t, typename value_t>
class DictionaryCache< key_t, value_t >

Definition at line 26 of file DictionaryCache.hpp.

Constructor & Destructor Documentation

template<typename key_t, typename value_t>

DictionaryCache< key_t, value_t >::DictionaryCache ( )

inline

Definition at line 28 of file DictionaryCache.hpp.

{}

Member Function Documentation

template<typename key_t, typename value_t>

std::shared_ptr<value_t> DictionaryCache< key_t, value_t >::get ( const key_t &  key )

inline

Definition at line 38 of file DictionaryCache.hpp.

                                               {
    auto it = cache_items.find(key);
    if (it == cache_items.end()) {
      return nullptr;
    }
    return it->second;
  }

template<typename key_t, typename value_t>

void DictionaryCache< key_t, value_t >::invalidateInvertedIndex ( )

inlinenoexcept

Definition at line 50 of file DictionaryCache.hpp.

                                          {
    if (!cache_items.empty()) {
      cache_items.clear();
    }
  }

template<typename key_t, typename value_t>

bool DictionaryCache< key_t, value_t >::is_empty ( )

inline

Definition at line 48 of file DictionaryCache.hpp.

{ return cache_items.empty(); }

template<typename key_t, typename value_t>

void DictionaryCache< key_t, value_t >::put ( const key_t &  key, const std::shared_ptr< value_t >  value  )

inline

Definition at line 30 of file DictionaryCache.hpp.

                                                                 {
    auto it = cache_items.find(key);
    if (it != cache_items.end()) {
      cache_items.erase(it);
    }
    cache_items.insert({key, value});
  }

template<typename key_t, typename value_t>

void DictionaryCache< key_t, value_t >::remove ( const key_t &  key )

inline

Definition at line 46 of file DictionaryCache.hpp.

{ cache_items.erase(key); }

Member Data Documentation

template<typename key_t, typename value_t>

std::unordered_map<key_t, std::shared_ptr<value_t> > DictionaryCache< key_t, value_t >::cache_items

private

Definition at line 57 of file DictionaryCache.hpp.

Referenced by DictionaryCache< std::string, StringDictionary::compare_cache_value_t >::get(), DictionaryCache< std::string, StringDictionary::compare_cache_value_t >::invalidateInvertedIndex(), DictionaryCache< std::string, StringDictionary::compare_cache_value_t >::is_empty(), DictionaryCache< std::string, StringDictionary::compare_cache_value_t >::put(), and DictionaryCache< std::string, StringDictionary::compare_cache_value_t >::remove().

---

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

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