33 : m_interest(interest.shared_from_this())
34 , m_nameTreeEntry(nullptr)
41 BOOST_ASSERT(m_interest->getName().compare(0, nEqualNameComps,
42 interest.
getName(), 0, nEqualNameComps) == 0);
44 return m_interest->getName().compare(nEqualNameComps,
Name::npos,
45 interest.
getName(), nEqualNameComps) == 0 &&
53 return std::find_if(m_inRecords.begin(), m_inRecords.end(),
54 [&face] (
const InRecord& inRecord) {
return &inRecord.getFace() == &face; });
60 BOOST_ASSERT(this->
canMatch(interest));
62 auto it = std::find_if(m_inRecords.begin(), m_inRecords.end(),
63 [&face] (
const InRecord& inRecord) {
return &inRecord.getFace() == &face; });
64 if (it == m_inRecords.end()) {
65 m_inRecords.emplace_front(face);
66 it = m_inRecords.begin();
76 auto it = std::find_if(m_inRecords.begin(), m_inRecords.end(),
77 [&face] (
const InRecord& inRecord) {
return &inRecord.getFace() == &face; });
78 if (it != m_inRecords.end()) {
79 m_inRecords.erase(it);
92 return std::find_if(m_outRecords.begin(), m_outRecords.end(),
93 [&face] (
const OutRecord& outRecord) {
return &outRecord.getFace() == &face; });
99 BOOST_ASSERT(this->
canMatch(interest));
101 auto it = std::find_if(m_outRecords.begin(), m_outRecords.end(),
102 [&face] (
const OutRecord& outRecord) {
return &outRecord.getFace() == &face; });
103 if (it == m_outRecords.end()) {
104 m_outRecords.emplace_front(face);
105 it = m_outRecords.begin();
108 it->update(interest);
115 auto it = std::find_if(m_outRecords.begin(), m_outRecords.end(),
116 [&face] (
const OutRecord& outRecord) {
return &outRecord.getFace() == &face; });
117 if (it != m_outRecords.end()) {
118 m_outRecords.erase(it);
OutRecordCollection::iterator getOutRecord(const Face &face)
get the out-record for face
const Selectors & getSelectors() const
void clearInRecords()
delete all in-records
generalization of a network interface
contains information about an Interest from an incoming face
InRecordCollection::iterator getInRecord(const Face &face)
get the in-record for face
static const size_t npos
indicates "until the end" in getSubName and compare
represents an Interest packet
Table::const_iterator iterator
Copyright (c) 2011-2015 Regents of the University of California.
void deleteOutRecord(const Face &face)
delete the out-record for face if it exists
Entry(const Interest &interest)
void deleteInRecord(const Face &face)
delete the in-record for face if it exists
bool canMatch(const Interest &interest, size_t nEqualNameComps=0) const
InRecordCollection::iterator insertOrUpdateInRecord(Face &face, const Interest &interest)
insert or update an in-record
OutRecordCollection::iterator insertOrUpdateOutRecord(Face &face, const Interest &interest)
insert or update an out-record
contains information about an Interest toward an outgoing face
const Name & getName() const