|
typedef ContentStoreImpl
< ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits > > > | super |
|
typedef
super::policy_container::template
index< 1 >::type | lifetime_stats_container |
|
typedef
ndnSIM::trie_with_policy< Name,
ndnSIM::smart_pointer_payload_traits
< EntryImpl< ContentStoreImpl
< ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits >
> > >, Entry >
, ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits > > > | super |
|
typedef EntryImpl
< ContentStoreImpl
< ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits > > > > | entry |
|
virtual void | Print (std::ostream &os) const |
| Print out content store entries.
|
|
virtual Ptr< Data > | Lookup (Ptr< const Interest > interest) |
| Find corresponding CS entry for the given interest. More...
|
|
virtual bool | Add (Ptr< const Data > data) |
| Add a new content to the content store. More...
|
|
virtual uint32_t | GetSize () const |
| Get number of entries in content store.
|
|
virtual Ptr< Entry > | Begin () |
| Return first element of content store (no order guaranteed)
|
|
virtual Ptr< Entry > | End () |
| Return item next after last (no order guaranteed)
|
|
virtual Ptr< Entry > | Next (Ptr< Entry >) |
|
const super::policy_container & | GetPolicy () const |
|
super::policy_container & | GetPolicy () |
|
virtual | ~ContentStore () |
| Virtual destructor.
|
|
virtual Ptr< cs::Entry > | Next (Ptr< cs::Entry >)=0 |
| Advance the iterator.
|
|
static TypeId | GetTypeId () |
|
static TypeId | GetTypeId () |
|
static TypeId | GetTypeId () |
| Interface ID. More...
|
|
static Ptr< ContentStore > | GetContentStore (Ptr< Object > node) |
| Static call to cheat python bindings.
|
|
typedef trie< Name,
ndnSIM::smart_pointer_payload_traits
< EntryImpl< ContentStoreImpl
< ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits >
> > >, Entry >, typename
ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits >
>::policy_hook_type > | parent_trie |
|
typedef parent_trie::iterator | iterator |
|
typedef parent_trie::const_iterator | const_iterator |
|
typedef
ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits >
>::template policy
< trie_with_policy< Name,
ndnSIM::smart_pointer_payload_traits
< EntryImpl< ContentStoreImpl
< ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits >
> > >, Entry >
, ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits >
> >, parent_trie, typename
ndnSIM::multi_policy_traits
< boost::mpl::vector2
< lru_policy_traits,
ndnSIM::lifetime_stats_policy_traits >
>::template container_hook
< parent_trie >::type >::type | policy_container |
|
| trie_with_policy (size_t bucketSize=1, size_t bucketIncrement=1) |
|
std::pair< iterator, bool > | insert (const Name &key, typename ndnSIM::smart_pointer_payload_traits< EntryImpl< ContentStoreImpl< ndnSIM::multi_policy_traits< boost::mpl::vector2< lru_policy_traits, ndnSIM::lifetime_stats_policy_traits > > > >, Entry >::insert_type payload) |
|
void | erase (const Name &key) |
|
void | erase (iterator node) |
|
void | clear () |
|
bool | modify (iterator position, Modifier mod) |
|
iterator | find_exact (const Name &key) |
| Find a node that has the exact match with the key.
|
|
iterator | longest_prefix_match (const Name &key) |
| Find a node that has the longest common prefix with key (FIB/PIT lookup)
|
|
iterator | longest_prefix_match_if (const Name &key, Predicate pred) |
| Find a node that has the longest common prefix with key (FIB/PIT lookup)
|
|
iterator | deepest_prefix_match (const Name &key) |
| Const version of the longest common prefix match (semi-const, because there could be update of the policy anyways) More...
|
|
iterator | deepest_prefix_match_if (const Name &key, Predicate pred) |
| Find a node that has prefix at least as the key.
|
|
iterator | deepest_prefix_match_if_next_level (const Name &key, Predicate pred) |
| Find a node that has prefix at least as the key. More...
|
|
iterator | end () const |
|
const parent_trie & | getTrie () const |
|
parent_trie & | getTrie () |
|
const policy_container & | getPolicy () const |
|
policy_container & | getPolicy () |
|
static iterator | s_iterator_to (typename parent_trie::iterator item) |
|
TracedCallback< Ptr< const
Interest >, Ptr< const Data > > | m_cacheHitsTrace |
| trace of cache hits
|
|
TracedCallback< Ptr< const
Interest > > | m_cacheMissesTrace |
| trace of cache misses
|
|
Content Store with stats implementing LRU cache replacement policy.
Doxygen introspection did not find any typical Config paths.
No Attributes are defined for this type.
TraceSources
-
WillRemoveEntry: Trace called just before content store entry will be removed
-
DidAddEntry: Trace fired every time entry is successfully added to the cache
-
CacheHits: Trace called every time there is a cache hit
-
CacheMisses: Trace called every time there is a cache miss
Definition at line 76 of file content-store-with-stats.cc.