33 , m_nameTreeEntry(nullptr)
38 Entry::findNextHop(
const Face& face)
40 return std::find_if(m_nextHops.begin(), m_nextHops.end(),
41 [&face] (
const NextHop& nexthop) {
42 return &nexthop.getFace() == &face;
49 return const_cast<Entry*
>(
this)->findNextHop(face) != m_nextHops.end();
55 auto it = this->findNextHop(face);
56 if (it == m_nextHops.end()) {
57 m_nextHops.emplace_back(face);
58 it = std::prev(m_nextHops.end());
68 auto it = this->findNextHop(face);
69 if (it != m_nextHops.end()) {
77 std::sort(m_nextHops.begin(), m_nextHops.end(),
bool hasNextHop(const Face &face) const
void addNextHop(Face &face, uint64_t cost)
adds a NextHop record
Entry(const Name &prefix)
Table::const_iterator iterator
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
void removeNextHop(const Face &face)
removes a NextHop record
represents a nexthop record in FIB entry