|
| | Cs (size_t nMaxPackets=10) |
| |
| const_iterator | begin () const |
| |
| void | enableAdmit (bool shouldAdmit) noexcept |
| | Set CS_ENABLE_ADMIT flag.
|
| |
| void | enableServe (bool shouldServe) noexcept |
| | Set CS_ENABLE_SERVE flag.
|
| |
| const_iterator | end () const |
| |
| template<typename AfterEraseCallback > |
| void | erase (const Name &prefix, size_t limit, AfterEraseCallback &&cb) |
| | Asynchronously erases entries under prefix.
|
| |
| template<typename HitCallback , typename MissCallback > |
| void | find (const Interest &interest, HitCallback &&hit, MissCallback &&miss) const |
| | Finds the best matching Data packet.
|
| |
| size_t | getLimit () const noexcept |
| | Get capacity (in number of packets).
|
| |
| Policy * | getPolicy () const noexcept |
| | Get replacement policy.
|
| |
| void | insert (const Data &data, bool isUnsolicited=false) |
| | Inserts a Data packet.
|
| |
| void | setLimit (size_t nMaxPackets) |
| | Change capacity (in number of packets).
|
| |
| void | setPolicy (unique_ptr< Policy > policy) |
| | Change replacement policy.
|
| |
| bool | shouldAdmit () const noexcept |
| | Get CS_ENABLE_ADMIT flag.
|
| |
| bool | shouldServe () const noexcept |
| | Get CS_ENABLE_SERVE flag.
|
| |
| size_t | size () const |
| | Get number of stored packets.
|
| |
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.
Definition at line 44 of file cs.hpp.