|
NS-3 based Named Data Networking (NDN) simulator
ndnSIM: NDN, CCN, CCNx, content centric networks
|
API Documentation |
|
|
NS-3 based Named Data Networking (NDN) simulator
ndnSIM: NDN, CCN, CCNx, content centric networks
|
API Documentation |
Additional Inherited Members | |
 Public Types inherited from ns3::ndn::ndnSIM::trie_with_policy< Name, ndnSIM::smart_pointer_payload_traits< RegisteredPrefixEntry >, ndnSIM::counting_policy_traits > | |
|
typedef trie< Name, ndnSIM::smart_pointer_payload_traits < RegisteredPrefixEntry > , typename ndnSIM::counting_policy_traits::policy_hook_type > | parent_trie |
| typedef parent_trie::iterator | iterator |
| typedef parent_trie::const_iterator | const_iterator |
|
typedef ndnSIM::counting_policy_traits::template policy< trie_with_policy< Name, ndnSIM::smart_pointer_payload_traits < RegisteredPrefixEntry > , ndnSIM::counting_policy_traits > , parent_trie, typename ndnSIM::counting_policy_traits::template container_hook< parent_trie > ::type >::type | policy_container |
| Public Member Functions inherited from ns3::ndn::ndnSIM::trie_with_policy< Name, ndnSIM::smart_pointer_payload_traits< RegisteredPrefixEntry >, ndnSIM::counting_policy_traits > | |
| 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< RegisteredPrefixEntry >::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 Public Member Functions inherited from ns3::ndn::ndnSIM::trie_with_policy< Name, ndnSIM::smart_pointer_payload_traits< RegisteredPrefixEntry >, ndnSIM::counting_policy_traits > | |
| static iterator | s_iterator_to (typename parent_trie::iterator item) |
Definition at line 52 of file registered-prefix-container.h.
1.8.7 
