26 #ifndef NFD_DAEMON_RIB_RIB_ENTRY_HPP 27 #define NFD_DAEMON_RIB_RIB_ENTRY_HPP 38 class RibEntry :
public std::enable_shared_from_this<RibEntry>
46 : m_nRoutesWithCaptureSet(0)
63 addChild(shared_ptr<RibEntry> child);
68 const std::list<shared_ptr<RibEntry>>&
82 std::pair<RibEntry::iterator, bool>
132 RouteList::const_iterator
180 ndn::PrefixAnnouncement
182 time::milliseconds maxExpiration = 1_h)
const;
198 setParent(shared_ptr<RibEntry> parent);
202 std::list<shared_ptr<RibEntry>> m_children;
203 shared_ptr<RibEntry> m_parent;
205 RouteList m_inheritedRoutes;
213 uint64_t m_nRoutesWithCaptureSet;
229 RibEntry::setParent(shared_ptr<RibEntry> parent)
234 inline shared_ptr<RibEntry>
240 inline const std::list<shared_ptr<RibEntry>>&
255 return m_inheritedRoutes;
261 return m_routes.begin();
267 return m_routes.end();
273 return m_routes.begin();
279 return m_routes.end();
288 #endif // NFD_DAEMON_RIB_RIB_ENTRY_HPP bool hasInheritedRoute(const Route &route) const
Determines if the entry has an inherited route with a matching face ID.
const_iterator begin() const
void removeInheritedRoute(const Route &route)
void eraseRoute(const Route &route)
erases a Route with the same faceId and origin
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...
bool hasFaceId(const uint64_t faceId) const
const Route * getRouteWithSecondLowestCostByFaceId(uint64_t faceId) const
std::ostream & operator<<(std::ostream &os, const FibUpdate &update)
const_iterator end() const
std::list< Route > RouteList
const Name & getName() const
void setName(const Name &prefix)
void removeChild(shared_ptr< RibEntry > child)
const Route * getRouteWithLowestCostByFaceId(uint64_t faceId) const
Returns the route with the lowest cost that has the passed face ID.
const RouteList & getInheritedRoutes() const
Returns the routes this namespace has inherited.
const RouteList & getRoutes() const
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
RouteList::iterator iterator
represents a route for a name prefix
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...
RouteList::const_iterator const_iterator
size_t getNRoutes() const
ndn::PrefixAnnouncement getPrefixAnnouncement(time::milliseconds minExpiration=15_s, time::milliseconds maxExpiration=1_h) const
Retrieve a prefix announcement suitable for readvertising this route.
void addInheritedRoute(const Route &route)
shared_ptr< RibEntry > getParent() const
std::pair< RibEntry::iterator, bool > insertRoute(const Route &route)
inserts a new route into the entry's route list If another route already exists with the same faceId ...
void addChild(shared_ptr< RibEntry > child)
Represents a RIB entry, which contains one or more Routes with the same prefix.
const std::list< shared_ptr< RibEntry > > & getChildren() const
iterator findRoute(const Route &route)
bool hasRoute(const Route &route)
RouteList::const_iterator findInheritedRoute(const Route &route) const
Finds an inherited route with a matching face ID.