/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/**
 * Copyright (c) 2014-2020,  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 "routing-table-pool-entry.hpp"
#include "name-prefix-table-entry.hpp"

namespace nlsr {

std::ostream&
operator<<(std::ostream& os, RoutingTablePoolEntry& rtpe)
{
  os << "RoutingTablePoolEntry("
     << "Destination router: " << rtpe.getDestination()
     << "Next hop list: ";
  for (const auto& nh : rtpe.getNexthopList()) {
    os << nh;
  }
  os << "NamePrefixTableEntries using this entry:";
  for (const auto& entryPtr : rtpe.namePrefixTableEntries) {
    os << entryPtr.first << ":";
  }

  return os;
}

bool
operator==(const RoutingTablePoolEntry& lhs, const RoutingTablePoolEntry& rhs)
{
  return (lhs.getDestination() == rhs.getDestination() &&
          lhs.getNexthopList() == rhs.getNexthopList());
}

} // namespace nlsr