22 #ifndef NLSR_LSA_ADJ_LSA_HPP
23 #define NLSR_LSA_ADJ_LSA_HPP
44 AdjLsa(
const ndn::Name& originR, uint64_t seqNo,
45 const ndn::time::system_clock::time_point& timepoint,
48 AdjLsa(
const ndn::Block& block);
103 template<ndn::encoding::Tag TAG>
105 wireEncode(ndn::EncodingImpl<TAG>& block)
const;
116 std::tuple<bool, std::list<ndn::Name>, std::list<ndn::Name>>
117 update(
const std::shared_ptr<Lsa>& lsa)
override;
Data abstraction for AdjLsa AdjacencyLsa := ADJACENCY-LSA-TYPE TLV-LENGTH Lsa Adjacency*.
const_iterator begin() const
std::tuple< bool, std::list< ndn::Name >, std::list< ndn::Name > > update(const std::shared_ptr< Lsa > &lsa) override
const ndn::Block & wireEncode() const override
void wireDecode(const ndn::Block &wire)
const_iterator end() const
Lsa::Type getType() const override
static constexpr Lsa::Type type()
bool isEqualContent(const AdjLsa &alsa) const
void addAdjacent(Adjacent adj)
AdjacencyList::const_iterator const_iterator
std::string toString() const override
const AdjacencyList & getAdl() const
std::list< Adjacent >::const_iterator const_iterator
const_iterator begin() const
bool insert(const Adjacent &adjacent)
const_iterator end() const
A neighbor reachable over a Face.
Data abstraction for Lsa Lsa := LSA-TYPE TLV-LENGTH Name SequenceNumber ExpirationTimePoint.
Copyright (c) 2014-2020, The University of Memphis, Regents of the University of California.
NDN_CXX_DECLARE_WIRE_ENCODE_INSTANTIATIONS(Adjacent)
std::ostream & operator<<(std::ostream &os, const Adjacent &adjacent)
#define PUBLIC_WITH_TESTS_ELSE_PRIVATE