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/ordered_index.hpp> 39 using Queue = boost::multi_index_container<
41 boost::multi_index::indexed_by<
42 boost::multi_index::sequenced<>,
43 boost::multi_index::ordered_unique<boost::multi_index::identity<Policy::EntryRef>>
71 evictEntries()
override;
77 insertToQueue(
EntryRef i,
bool isNewEntry);
90 #endif // NFD_DAEMON_TABLE_CS_POLICY_LRU_HPP Least-Recently-Used (LRU) replacement policy.
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
static const std::string POLICY_NAME
represents a CS replacement policy
boost::multi_index_container< Policy::EntryRef, boost::multi_index::indexed_by< boost::multi_index::sequenced<>, boost::multi_index::ordered_unique< boost::multi_index::identity< Policy::EntryRef > > > > Queue
Table::const_iterator EntryRef
a reference to an CS entry