tlv: add LSDB dataset tlv abstractions
refs #2280
Change-Id: I2d0d238686e28d1c25a7821a47352fcd589df823
diff --git a/src/tlv/adjacency-lsa.hpp b/src/tlv/adjacency-lsa.hpp
new file mode 100644
index 0000000..2fe5fc3
--- /dev/null
+++ b/src/tlv/adjacency-lsa.hpp
@@ -0,0 +1,154 @@
+/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
+/**
+ * Copyright (c) 2014-2015, The University of Memphis,
+ * Regents of the University of California,
+ * Arizona Board of Regents.
+ *
+ * This file is part of NLSR (Named-data Link State Routing).
+ * See AUTHORS.md for complete list of NLSR authors and contributors.
+ *
+ * NLSR is free software: you can redistribute it and/or modify it under the terms
+ * of the GNU General Public License as published by the Free Software Foundation,
+ * either version 3 of the License, or (at your option) any later version.
+ *
+ * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+ * PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with
+ * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
+ **/
+
+#ifndef NLSR_TLV_ADJACENCY_LSA_HPP
+#define NLSR_TLV_ADJACENCY_LSA_HPP
+
+#include "lsa-info.hpp"
+#include "adjacency.hpp"
+
+#include <ndn-cxx/util/time.hpp>
+#include <ndn-cxx/encoding/block.hpp>
+#include <ndn-cxx/encoding/encoding-buffer.hpp>
+#include <ndn-cxx/encoding/tlv.hpp>
+#include <ndn-cxx/name.hpp>
+
+#include <list>
+
+namespace nlsr {
+namespace tlv {
+
+/**
+ * @brief Data abstraction for AdjacencyLsa
+ *
+ * AdjacencyLsa := ADJACENCY-LSA-TYPE TLV-LENGTH
+ * LsaInfo
+ * Adjacency*
+ *
+ * @sa http://redmine.named-data.net/projects/nlsr/wiki/LSDB_DataSet
+ */
+class AdjacencyLsa
+{
+public:
+ class Error : public ndn::tlv::Error
+ {
+ public:
+ explicit
+ Error(const std::string& what)
+ : ndn::tlv::Error(what)
+ {
+ }
+ };
+
+ typedef std::list<Adjacency> AdjacencyList;
+ typedef AdjacencyList::const_iterator iterator;
+
+ AdjacencyLsa();
+
+ explicit
+ AdjacencyLsa(const ndn::Block& block);
+
+ const LsaInfo&
+ getLsaInfo() const
+ {
+ return m_lsaInfo;
+ }
+
+ AdjacencyLsa&
+ setLsaInfo(const LsaInfo& lsaInfo)
+ {
+ m_lsaInfo = lsaInfo;
+ m_wire.reset();
+ return *this;
+ }
+
+ bool
+ hasAdjacencies() const
+ {
+ return m_hasAdjacencies;
+ }
+
+ const std::list<Adjacency>&
+ getAdjacencies() const
+ {
+ return m_adjacencies;
+ }
+
+ AdjacencyLsa&
+ addAdjacency(const Adjacency& adjacency)
+ {
+ m_adjacencies.push_back(adjacency);
+ m_wire.reset();
+ m_hasAdjacencies = true;
+ return *this;
+ }
+
+ AdjacencyLsa&
+ clearAdjacencies()
+ {
+ m_adjacencies.clear();
+ m_hasAdjacencies = false;
+ return *this;
+ }
+
+ template<bool T>
+ size_t
+ wireEncode(ndn::EncodingImpl<T>& block) const;
+
+ const ndn::Block&
+ wireEncode() const;
+
+ void
+ wireDecode(const ndn::Block& wire);
+
+ iterator
+ begin() const;
+
+ iterator
+ end() const;
+
+private:
+ LsaInfo m_lsaInfo;
+ bool m_hasAdjacencies;
+ AdjacencyList m_adjacencies;
+
+ mutable ndn::Block m_wire;
+};
+
+inline AdjacencyLsa::iterator
+AdjacencyLsa::begin() const
+{
+ return m_adjacencies.begin();
+}
+
+inline AdjacencyLsa::iterator
+AdjacencyLsa::end() const
+{
+ return m_adjacencies.end();
+}
+
+std::ostream&
+operator<<(std::ostream& os, const AdjacencyLsa& adjacencyLsa);
+
+} // namespace tlv
+} // namespace nlsr
+
+#endif // NLSR_TLV_ADJACENCY_LSA_HPP