22 #ifndef NDN_UTIL_IN_MEMORY_STORAGE_HPP
23 #define NDN_UTIL_IN_MEMORY_STORAGE_HPP
25 #include "../common.hpp"
26 #include "../interest.hpp"
27 #include "../data.hpp"
31 #include <boost/multi_index/member.hpp>
32 #include <boost/multi_index_container.hpp>
33 #include <boost/multi_index/ordered_index.hpp>
34 #include <boost/multi_index/sequenced_index.hpp>
35 #include <boost/multi_index/identity.hpp>
36 #include <boost/multi_index/mem_fun.hpp>
52 typedef boost::multi_index_container<
54 boost::multi_index::indexed_by<
57 boost::multi_index::ordered_unique<
58 boost::multi_index::tag<byFullName>,
59 boost::multi_index::const_mem_fun<InMemoryStorageEntry,
const Name&,
71 class const_iterator :
public std::iterator<std::input_iterator_tag, const Data>
75 Cache::index<byFullName>::type::iterator it);
98 Cache::index<byFullName>::type::iterator m_it;
104 class Error :
public std::runtime_error
107 Error() :
std::runtime_error(
"Cannot reduce the capacity of the in-memory storage!")
123 size_t limit = std::numeric_limits<size_t>::max());
156 shared_ptr<const Data>
170 shared_ptr<const Data>
171 find(
const Name& name);
184 erase(
const Name& prefix,
const bool isPrefix =
true);
269 return size() >= m_capacity;
291 freeEntry(Cache::iterator it);
307 InMemoryStorageEntry*
308 selectChild(
const Interest& interest,
309 Cache::index<byFullName>::type::iterator startingPoint)
const;
316 Cache::index<byFullName>::type::iterator
317 findNextFresh(Cache::index<byFullName>::type::iterator startingPoint)
const;
327 static const time::milliseconds ZERO_WINDOW;
338 std::stack<InMemoryStorageEntry*> m_freeEntries;
340 unique_ptr<Scheduler> m_scheduler;
346 #endif // NDN_UTIL_IN_MEMORY_STORAGE_HPP
virtual void afterAccess(InMemoryStorageEntry *entry)
Update the entry when the entry is returned by the find() function according to derived class impleme...
Copyright (c) 2013-2016 Regents of the University of California.
const Data * operator->()
bool isFull() const
returns true if the in-memory storage uses up the current capacity, false otherwise ...
InMemoryStorage(size_t limit=std::numeric_limits< size_t >::max())
Create a InMemoryStorage with up to limit entries The InMemoryStorage created through this method wil...
#define NDN_CXX_PUBLIC_WITH_TESTS_ELSE_PRIVATE
shared_ptr< const Data > find(const Interest &interest)
Finds the best match Data for an Interest.
Represents a self-defined const_iterator for the in-memory storage.
represents an Interest packet
bool operator!=(const const_iterator &rhs)
InMemoryStorage::const_iterator end() const
Returns end iterator of the in-memory storage ordering by name with digest.
InMemoryStorage::const_iterator begin() const
Returns begin iterator of the in-memory storage ordering by name with digest.
virtual bool evictItem()=0
Removes one Data packet from in-memory storage based on derived class implemented replacement policy...
virtual void beforeErase(InMemoryStorageEntry *entry)
Update the entry or other data structures before a entry is successfully erased according to derived ...
void eraseImpl(const Name &name)
deletes in-memory storage entries by the Name with implicit digest.
const_iterator & operator++()
Represents in-memory storage.
boost::multi_index_container< InMemoryStorageEntry *, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< boost::multi_index::tag< byFullName >, boost::multi_index::const_mem_fun< InMemoryStorageEntry, const Name &,&InMemoryStorageEntry::getFullName >, std::less< Name > > > > Cache
size_t getCapacity() const
returns current capacity of in-memory storage (in packets)
const Name & getFullName() const
Returns the full name (including implicit digest) of the Data packet stored in the in-memory storage ...
Represents an in-memory storage entry.
Name abstraction to represent an absolute name.
const_iterator(const Data *ptr, const Cache *cache, Cache::index< byFullName >::type::iterator it)
virtual ~InMemoryStorage()
bool operator==(const const_iterator &rhs)
virtual void afterInsert(InMemoryStorageEntry *entry)
Update the entry or other data structures after a entry is successfully inserted according to derived...
void insert(const Data &data, const time::milliseconds &mustBeFreshProcessingWindow=INFINITE_WINDOW)
Inserts a Data packet.
static const time::milliseconds INFINITE_WINDOW
void setCapacity(size_t nMaxPackets)
sets current capacity of in-memory storage (in packets)
Represents an error might be thrown during reduce the current capacity of the in-memory storage throu...
#define NDN_CXX_PUBLIC_WITH_TESTS_ELSE_PROTECTED
void erase(const Name &prefix, const bool isPrefix=true)
Deletes in-memory storage entry by prefix by default.
void printCache(std::ostream &os) const
Prints contents of the in-memory storage.