22 #ifndef NLSR_ADJACENCY_LIST_HPP 23 #define NLSR_ADJACENCY_LIST_HPP 29 #include <boost/cstdint.hpp> 37 typedef std::list<Adjacent>::iterator
iterator;
58 const std::list<Adjacent>&
119 return m_adjList.size();
125 if (m_adjList.size() > 0) {
145 template <
typename T =
float>
void 148 BOOST_STATIC_ASSERT_MSG(std::is_integral<T>::value,
149 "Don't use std::string with findAdjacent!");
162 return m_adjList.begin();
168 return m_adjList.end();
173 find(
const ndn::Name& adjName);
176 find(
const ndn::Name& adjName)
const;
179 std::list<Adjacent> m_adjList;
183 #endif // NLSR_ADJACENCY_LIST_HPP void setTimedOutInterestCount(const ndn::Name &neighbor, uint32_t count)
void findAdjacent(const std::string &faceUri)
Hack to stop developers from using this function.
bool operator==(const AdjacencyList &adl) const
bool isNeighbor(const ndn::Name &adjName) const
std::list< Adjacent >::const_iterator const_iterator
Adjacent::Status getStatusOfNeighbor(const ndn::Name &neighbor) const
bool isAdjLsaBuildable(const uint32_t interestRetryNo) const
Determines whether this list can be used to build an adj. LSA.
Adjacent getAdjacent(const ndn::Name &adjName)
Copyright (c) 2014-2017, The University of Memphis, Regents of the University of California.
const_iterator begin() const
int32_t getTimedOutInterestCount(const ndn::Name &neighbor) const
int32_t insert(Adjacent &adjacent)
Inserts an adjacency into the list.
A neighbor reachable over a Face.
Copyright (c) 2014-2018, The University of Memphis, Regents of the University of California, Arizona Board of Regents.
AdjacencyList::iterator findAdjacent(const ndn::Name &adjName)
int32_t getNumOfActiveNeighbor() const
void addAdjacents(AdjacencyList &adl)
Copies the adjacencies in a list to this one.
std::list< Adjacent >::iterator iterator
void incrementTimedOutInterestCount(const ndn::Name &neighbor)
uint64_t getFaceId(const ndn::FaceUri &faceUri)
std::list< Adjacent > & getAdjList()
void setStatusOfNeighbor(const ndn::Name &neighbor, Adjacent::Status status)
const_iterator end() const