PIT in which the least recently used entry (the oldest entry with minimum number of incoming faces) will be removed when PIT size reached its limit. More...
#include <introspected-doxygen.h>
Classes | |
class | AggregateStats |
Additional Inherited Members | |
![]() | |
typedef ndnSIM::trie_with_policy< Name, ndnSIM::smart_pointer_payload_traits < EntryImpl< PitImpl < lru_policy_traits > > >, lru_policy_traits > | super |
typedef EntryImpl< PitImpl < lru_policy_traits > > | entry |
![]() | |
PitImpl () | |
PIT constructor. | |
virtual | ~PitImpl () |
Destructor. | |
virtual Ptr< Entry > | Lookup (const Data &header) |
Find corresponding PIT entry for the given content name. More... | |
virtual Ptr< Entry > | Lookup (const Interest &header) |
Find a PIT entry for the given content interest. More... | |
virtual Ptr< Entry > | Find (const Name &prefix) |
Get PIT entry for the prefix (exact match) More... | |
virtual Ptr< Entry > | Create (Ptr< const Interest > header) |
Creates a PIT entry for the given interest. More... | |
virtual void | MarkErased (Ptr< Entry > entry) |
virtual void | Print (std::ostream &os) const |
Print out PIT contents for debugging purposes. More... | |
virtual uint32_t | GetSize () const |
Get number of entries in PIT. | |
virtual Ptr< Entry > | Begin () |
Return first element of FIB (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 () |
![]() | |
Pit () | |
PIT constructor. | |
virtual | ~Pit () |
Destructor. | |
virtual void | MarkErased (Ptr< pit::Entry > entry)=0 |
Mark PIT entry deleted. More... | |
virtual Ptr< pit::Entry > | Next (Ptr< pit::Entry >)=0 |
Advance the iterator. | |
const Time & | GetMaxPitEntryLifetime () const |
Get maximum PIT entry lifetime. | |
void | SetMaxPitEntryLifetime (const Time &maxLifetime) |
Set maximum PIT entry lifetime. | |
![]() | |
static TypeId | GetTypeId () |
Interface ID. More... | |
![]() | |
static TypeId | GetTypeId () |
Interface ID. More... | |
static Ptr< Pit > | GetPit (Ptr< Object > node) |
Static call to cheat python bindings. | |
![]() | |
typedef trie< Name, ndnSIM::smart_pointer_payload_traits < EntryImpl< PitImpl < lru_policy_traits > > >, typename lru_policy_traits::policy_hook_type > | parent_trie |
typedef parent_trie::iterator | iterator |
typedef parent_trie::const_iterator | const_iterator |
typedef lru_policy_traits::template policy< trie_with_policy< Name, ndnSIM::smart_pointer_payload_traits < EntryImpl< PitImpl < lru_policy_traits > > >, lru_policy_traits > , parent_trie, typename lru_policy_traits::template container_hook< parent_trie > ::type >::type | policy_container |
![]() | |
void | RescheduleCleaning () |
void | CleanExpired () |
virtual void | NotifyNewAggregate () |
Even when object is aggregated to another Object. | |
virtual void | DoDispose () |
Do cleanup. | |
![]() | |
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< PitImpl< lru_policy_traits > > >::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) |
![]() | |
Time | m_PitEntryPruningTimout |
Time | m_maxPitEntryLifetime |
PIT in which the least recently used entry (the oldest entry with minimum number of incoming faces) will be removed when PIT size reached its limit.
Doxygen introspection did not find any typical Config paths.
No TraceSources are defined for this type.
Definition at line 122 of file ndn-pit-impl.cc.