26 #ifndef NFD_DAEMON_TABLE_CS_POLICY_LRU_HPP 27 #define NFD_DAEMON_TABLE_CS_POLICY_LRU_HPP 31 #include <boost/multi_index_container.hpp> 32 #include <boost/multi_index/sequenced_index.hpp> 33 #include <boost/multi_index/hashed_index.hpp> 48 typedef boost::multi_index_container<
50 boost::multi_index::indexed_by<
51 boost::multi_index::sequenced<>,
52 boost::multi_index::ordered_unique<
74 doAfterInsert(iterator i)
override;
77 doAfterRefresh(iterator i)
override;
80 doBeforeErase(iterator i)
override;
83 doBeforeUse(iterator i)
override;
86 evictEntries()
override;
92 insertToQueue(iterator i,
bool isNewEntry);
105 #endif // NFD_DAEMON_TABLE_CS_POLICY_LRU_HPP LRU cs replacement policy.
Table::const_iterator iterator
bool operator()(const iterator &a, const iterator &b) const
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
static const std::string POLICY_NAME
boost::multi_index_container< iterator, boost::multi_index::indexed_by< boost::multi_index::sequenced<>, boost::multi_index::ordered_unique< boost::multi_index::identity< iterator >, EntryItComparator > > > Queue
represents a CS replacement policy