some minor code improvements refs: #4705 Change-Id: I28805981a88a94c79f699956bb7e62a268d9ba49
99 lines
2.7 KiB
C++
99 lines
2.7 KiB
C++
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
|
/**
|
|
* Copyright (c) 2014-2018, The University of Memphis,
|
|
* Regents of the University of California
|
|
*
|
|
* 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/>.
|
|
**/
|
|
|
|
#include "adjacent.hpp"
|
|
#include "logger.hpp"
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <cmath>
|
|
#include <limits>
|
|
|
|
namespace nlsr {
|
|
|
|
INIT_LOGGER(Adjacent);
|
|
|
|
const float Adjacent::DEFAULT_LINK_COST = 10.0;
|
|
|
|
Adjacent::Adjacent()
|
|
: m_name()
|
|
, m_faceUri()
|
|
, m_linkCost(DEFAULT_LINK_COST)
|
|
, m_status(STATUS_INACTIVE)
|
|
, m_interestTimedOutNo(0)
|
|
, m_faceId(0)
|
|
{
|
|
}
|
|
|
|
Adjacent::Adjacent(const ndn::Name& an)
|
|
: m_name(an)
|
|
, m_faceUri()
|
|
, m_linkCost(DEFAULT_LINK_COST)
|
|
, m_status(STATUS_INACTIVE)
|
|
, m_interestTimedOutNo(0)
|
|
, m_faceId(0)
|
|
{
|
|
}
|
|
|
|
Adjacent::Adjacent(const ndn::Name& an, const ndn::FaceUri& faceUri, double lc,
|
|
Status s, uint32_t iton, uint64_t faceId)
|
|
: m_name(an)
|
|
, m_faceUri(faceUri)
|
|
, m_linkCost(lc)
|
|
, m_status(s)
|
|
, m_interestTimedOutNo(iton)
|
|
, m_faceId(faceId)
|
|
{
|
|
}
|
|
|
|
bool
|
|
Adjacent::operator==(const Adjacent& adjacent) const
|
|
{
|
|
return (m_name == adjacent.getName()) &&
|
|
(m_faceUri == adjacent.getFaceUri()) &&
|
|
(std::abs(m_linkCost - adjacent.getLinkCost()) <
|
|
std::numeric_limits<double>::epsilon());
|
|
}
|
|
|
|
bool
|
|
Adjacent::operator<(const Adjacent& adjacent) const
|
|
{
|
|
auto linkCost = adjacent.getLinkCost();
|
|
return std::tie(m_name, m_linkCost) <
|
|
std::tie(adjacent.getName(), linkCost);
|
|
}
|
|
|
|
std::ostream&
|
|
operator<<(std::ostream& os, const Adjacent& adjacent)
|
|
{
|
|
os << "Adjacent: " << adjacent.m_name << "\n Connecting FaceUri: " << adjacent.m_faceUri
|
|
<< "\n Link cost: " << adjacent.m_linkCost << "\n Status: " << adjacent.m_status
|
|
<< "\n Interest Timed Out: " << adjacent.m_interestTimedOutNo << std::endl;
|
|
return os;
|
|
}
|
|
|
|
void
|
|
Adjacent::writeLog()
|
|
{
|
|
NLSR_LOG_DEBUG(*this);
|
|
}
|
|
|
|
} // namespace nlsr
|