26 #ifndef NFD_RIB_RIB_ENTRY_HPP 27 #define NFD_RIB_RIB_ENTRY_HPP 36 class RibEntry :
public enable_shared_from_this<RibEntry>
44 : m_nRoutesWithCaptureSet(0)
61 addChild(shared_ptr<RibEntry> child);
66 const std::list<shared_ptr<RibEntry>>&
127 RouteList::const_iterator
177 setParent(shared_ptr<RibEntry> parent);
181 std::list<shared_ptr<RibEntry>> m_children;
182 shared_ptr<RibEntry> m_parent;
184 RouteList m_inheritedRoutes;
192 uint64_t m_nRoutesWithCaptureSet;
208 RibEntry::setParent(shared_ptr<RibEntry> parent)
213 inline shared_ptr<RibEntry>
219 inline const std::list<shared_ptr<RibEntry> >&
234 return m_inheritedRoutes;
240 return m_routes.begin();
246 return m_routes.end();
252 return m_routes.begin();
258 return m_routes.end();
267 #endif // NFD_RIB_RIB_ENTRY_HPP
void removeChild(shared_ptr< RibEntry > child)
iterator findRoute(const Route &route)
void addChild(shared_ptr< RibEntry > child)
bool hasRoute(const Route &route)
const Route * getRouteWithLowestCostByFaceId(uint64_t faceId) const
Returns the route with the lowest cost that has the passed face ID.
shared_ptr< RibEntry > getParent() const
std::ostream & operator<<(std::ostream &os, const FibUpdate &update)
RouteList::iterator iterator
void removeInheritedRoute(const Route &route)
Table::const_iterator iterator
void addInheritedRoute(const Route &route)
Copyright (c) 2011-2015 Regents of the University of California.
const_iterator end() const
represents a RIB entry, which contains one or more Routes with the same prefix
represents a route for a name prefix
const Route * getRouteWithSecondLowestCostByFaceId(uint64_t faceId) const
Name abstraction to represent an absolute name.
const std::list< shared_ptr< RibEntry > > & getChildren() const
const Name & getName() const
const RouteList & getInheritedRoutes() const
Returns the routes this namespace has inherited.
size_t getNRoutes() const
RouteList::const_iterator findInheritedRoute(const Route &route) const
Finds an inherited route with a matching face ID.
bool hasFaceId(const uint64_t faceId) const
RouteList::const_iterator const_iterator
const Route * getRouteWithLowestCostAndChildInheritByFaceId(uint64_t faceId) const
Returns the route with the lowest cost that has the passed face ID and its child inherit flag set...
void setName(const Name &prefix)
std::list< Route > RouteList
void eraseRoute(const Route &route)
erases a Route with the same faceId and origin
bool hasInheritedRoute(const Route &route) const
Determines if the entry has an inherited route with a matching face ID.
bool insertRoute(const Route &route)
inserts a new route into the entry's route list If another route already exists with the same faceId ...
bool hasChildInheritOnFaceId(uint64_t faceId) const
Determines if the entry has an inherited route with the passed face ID and its child inherit flag set...
const_iterator begin() const