Cache.h

Go to the documentation of this file.

 
#pragma once
 
#include <aws/core/utils/DateTime.h>
#include <aws/core/utils/memory/stl/AWSMap.h>
#include <chrono>
 
namespace Aws
{
    namespace Utils
    {
        template <typename TKey, typename TValue>
        class Cache
        {
        public:
            explicit Cache(size_t initialSize = 1000) : m_maxSize(initialSize)
            {
            }
 
            bool Get(const TKey& key, TValue& value) const
            {
                auto it = m_entries.find(key);
                if (it == m_entries.end())
                {
                    return false;
                }
 
                if (DateTime::Now() > it->second.expiration)
                {
                    return false;
                }
 
                value = it->second.val;
                return true;
            }
 
            template<typename UValue>
            void Put(TKey&& key, UValue&& val, std::chrono::milliseconds duration)
            {
                auto it = m_entries.find(key);
                const DateTime expiration = DateTime::Now() + duration;
                if (it != m_entries.end())
                {
                    it->second.val = std::forward<UValue>(val);
                    it->second.expiration = expiration;
                    return;
                }
 
                if (m_entries.size() >= m_maxSize)
                {
                    Prune(); // removes expired/expiring elements
                }
 
                m_entries.emplace(std::move(key), Value { expiration, std::forward<UValue>(val) });
            }
 
            template<typename UValue>
            void Put(const TKey& key, UValue&& val, std::chrono::milliseconds duration)
            {
                auto it = m_entries.find(key);
                const DateTime expiration = DateTime::Now() + duration;
                if (it != m_entries.end())
                {
                    it->second.val = std::forward<UValue>(val);
                    it->second.expiration = expiration;
                    return;
                }
 
                if (m_entries.size() >= m_maxSize)
                {
                    Prune(); // removes expired/expiring elements
                }
 
                m_entries.emplace(key, Value { expiration, std::forward<UValue>(val) });
            }
 
        private:
 
            void Prune()
            {
                auto mostExpiring = m_entries.begin();
                // remove the expired ones. If none expired, remove the one that's closest to expiring.
                for (auto it = m_entries.begin(); it != m_entries.end();)
                {
                    if (DateTime::Now() > it->second.expiration)
                    {
                        it = m_entries.erase(it);
                    }
                    else
                    {
                        if (it->second.expiration < mostExpiring->second.expiration)
                        {
                            mostExpiring = it;
                        }
                        ++it;
                    }
                }
 
                // if nothing was erased. Remove the most expiring element.
                if (m_entries.size() >= m_maxSize)
                {
                    m_entries.erase(mostExpiring);
                }
            }
 
            struct Value
            {
                DateTime expiration;
                TValue val;
            };
 
            Aws::Map<TKey, Value> m_entries;
            const size_t m_maxSize;
        };
    }
}