implements the Content Store More...
#include <daemon/table/cs.hpp>
Classes | |
struct | EntryFromEntryImpl |
Public Types | |
using | AfterEraseCallback = std::function< void(size_t nErased)> |
typedef boost::transform_iterator< EntryFromEntryImpl, iterator, const Entry & > | const_iterator |
ContentStore iterator (public API) More... | |
using | HitCallback = std::function< void(const Interest &, const Data &)> |
using | MissCallback = std::function< void(const Interest &)> |
Public Member Functions | |
Cs (size_t nMaxPackets=10) | |
const_iterator | begin () const |
void | enableAdmit (bool shouldAdmit) |
set CS_ENABLE_ADMIT flag More... | |
void | enableServe (bool shouldServe) |
set CS_ENABLE_SERVE flag More... | |
const_iterator | end () const |
void | erase (const Name &prefix, size_t limit, const AfterEraseCallback &cb) |
asynchronously erases entries under prefix More... | |
void | find (const Interest &interest, const HitCallback &hitCallback, const MissCallback &missCallback) const |
finds the best matching Data packet More... | |
size_t | getLimit () const |
get capacity (in number of packets) More... | |
Policy * | getPolicy () const |
get replacement policy More... | |
void | insert (const Data &data, bool isUnsolicited=false) |
inserts a Data packet More... | |
void | setLimit (size_t nMaxPackets) |
change capacity (in number of packets) More... | |
void | setPolicy (unique_ptr< Policy > policy) |
change replacement policy More... | |
bool | shouldAdmit () const |
get CS_ENABLE_ADMIT flag More... | |
bool | shouldServe () const |
get CS_ENABLE_SERVE flag More... | |
size_t | size () const |
get number of stored packets More... | |
implements the Content Store
This Content Store implementation consists of a Table and a replacement policy.
The Table is a container ( std::set
) sorted by full Names of stored Data packets. Data packets are wrapped in Entry objects. Each Entry contains the Data packet itself, and a few additional attributes such as when the Data becomes non-fresh.
The replacement policy is implemented in a subclass of Policy
.
using nfd::cs::Cs::AfterEraseCallback = std::function<void(size_t nErased)> |
typedef boost::transform_iterator<EntryFromEntryImpl, iterator, const Entry&> nfd::cs::Cs::const_iterator |
using nfd::cs::Cs::HitCallback = std::function<void(const Interest&, const Data&)> |
using nfd::cs::Cs::MissCallback = std::function<void(const Interest&)> |
|
inline |
void nfd::cs::Cs::enableAdmit | ( | bool | shouldAdmit | ) |
set CS_ENABLE_ADMIT flag
void nfd::cs::Cs::enableServe | ( | bool | shouldServe | ) |
set CS_ENABLE_SERVE flag
|
inline |
void nfd::cs::Cs::erase | ( | const Name & | prefix, |
size_t | limit, | ||
const AfterEraseCallback & | cb | ||
) |
void nfd::cs::Cs::find | ( | const Interest & | interest, |
const HitCallback & | hitCallback, | ||
const MissCallback & | missCallback | ||
) | const |
finds the best matching Data packet
interest | the Interest for lookup |
hitCallback | a callback if a match is found; must not be empty |
missCallback | a callback if there's no match; must not be empty |
|
inline |
|
inline |
void nfd::cs::Cs::insert | ( | const Data & | data, |
bool | isUnsolicited = false |
||
) |
|
inline |
void nfd::cs::Cs::setPolicy | ( | unique_ptr< Policy > | policy | ) |
|
inline |
get CS_ENABLE_ADMIT flag
|
inline |
get CS_ENABLE_SERVE flag