缓存淘汰器类

AbstractCacheLimiter.h

#pragma once

#include <functional>

template <typename T>
class AbstractCacheLimiter {
public:
	virtual bool contains(T cache)												= 0;
	virtual void clearCache()													= 0;
	virtual void addCache(T cache)												= 0;
	virtual void removeCache(T cache)											= 0;
	virtual uint64_t getMaxCacheCount()											= 0;
	virtual void setMaxCacheCount(uint64_t maxCount)							= 0;
	virtual void setCacheDiscardCallback(std::function<void(T cache)> callback) = 0;

	virtual ~AbstractCacheLimiter() = default;
};

FIFOCacheLimiter.hpp

#pragma once

#include "AbstractCacheLimiter.h"

#include <list>
#include <memory>

template <typename T>
class FIFOCacheLimiter : public AbstractCacheLimiter<T> {
public:
	FIFOCacheLimiter();
	virtual bool contains(T cache) override;
	virtual void clearCache() override;
	virtual void addCache(T cache) override;
	virtual void removeCache(T cache) override;

	virtual void setCacheDiscardCallback(std::function<void(T cache)> callback) override;
	virtual void setMaxCacheCount(uint64_t maxCount) override;
	virtual uint64_t getMaxCacheCount() override;
private:
	void discardEarliestCache();

	std::list<T> m_cacheList;
	uint64_t m_maxCacheCount = 100;
	std::function<void(T cache)> m_cacheDiscardCallback;
};

template <typename T>
uint64_t
FIFOCacheLimiter<T>::getMaxCacheCount()
{
	return m_maxCacheCount;
}

template <typename T>
bool
FIFOCacheLimiter<T>::contains(T cache)
{
	return std::find(m_cacheList.begin(), m_cacheList.end(), cache) != m_cacheList.end();
}

template <typename T>
void
FIFOCacheLimiter<T>::clearCache()
{
	for (T &item : m_cacheList) {
		removeCache(item);
	}
}

template <typename T>
FIFOCacheLimiter<T>::FIFOCacheLimiter()
{
}

template <typename T>
void
FIFOCacheLimiter<T>::addCache(T cache)
{
	auto it = std::find(m_cacheList.begin(), m_cacheList.end(), cache);
	if (it != m_cacheList.end()) {
		m_cacheList.splice(m_cacheList.end(), m_cacheList, it);
		return;
	}

	if (m_cacheList.size() >= m_maxCacheCount) {
		discardEarliestCache();
	}
	m_cacheList.insert(m_cacheList.end(), cache);
}

template <typename T>
void
FIFOCacheLimiter<T>::removeCache(T cache)
{
	m_cacheList.remove(cache);
}

template <typename T>
void
FIFOCacheLimiter<T>::setCacheDiscardCallback(std::function<void(T cache)> callback)
{
	m_cacheDiscardCallback = callback;
}

template <typename T>
void
FIFOCacheLimiter<T>::setMaxCacheCount(uint64_t maxCount)
{
	m_maxCacheCount = maxCount;
}

template <typename T>
void
FIFOCacheLimiter<T>::discardEarliestCache()
{
	T discardedCache = std::move(m_cacheList.front());
	m_cacheList.erase(m_cacheList.begin());
	if (m_cacheDiscardCallback) {
		m_cacheDiscardCallback(discardedCache);
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

barbyQAQ

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值