blob: e4946821fab6447dda64de3eca55f6a7a7e8b2ee [file] [log] [blame]
akmhoque3d06e792014-05-27 16:23:20 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -05002/**
Nick Gordonfeae5572017-01-13 12:06:26 -06003 * Copyright (c) 2014-2017, The University of Memphis,
Nick Gordonf8b5bcd2016-08-11 15:06:50 -05004 * Regents of the University of California
akmhoque3d06e792014-05-27 16:23:20 -05005 *
6 * This file is part of NLSR (Named-data Link State Routing).
7 * See AUTHORS.md for complete list of NLSR authors and contributors.
8 *
9 * NLSR is free software: you can redistribute it and/or modify it under the terms
10 * of the GNU General Public License as published by the Free Software Foundation,
11 * either version 3 of the License, or (at your option) any later version.
12 *
13 * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
14 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along with
18 * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
19 *
20 * \author Ashlesh Gawande <agawande@memphis.edu>
21 *
22 **/
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050023#include "adjacent.hpp"
24#include <boost/test/unit_test.hpp>
25
26namespace nlsr {
27
28namespace test {
29
30using namespace std;
31
Nick Gordone9733ed2017-04-26 10:48:39 -050032BOOST_AUTO_TEST_SUITE(TestAdjacent)
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050033
Nick Gordone9733ed2017-04-26 10:48:39 -050034BOOST_AUTO_TEST_CASE(OperatorEquals)
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050035{
Nick Gordone9733ed2017-04-26 10:48:39 -050036 const ndn::Name ADJ_NAME_1 = "name1";
37 const ndn::util::FaceUri ADJ_URI_1 = ndn::util::FaceUri("udp4://10.0.0.1:8000");
38 const double ADJ_LINK_COST_1 = 1;
39 Adjacent adjacent1(ADJ_NAME_1);
40 Adjacent adjacent2(ADJ_NAME_1);
41 adjacent1.setFaceUri(ADJ_URI_1);
42 adjacent2.setFaceUri(ADJ_URI_1);
43 adjacent1.setLinkCost(ADJ_LINK_COST_1);
44 adjacent2.setLinkCost(ADJ_LINK_COST_1);
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050045
Nick Gordone9733ed2017-04-26 10:48:39 -050046 BOOST_CHECK(adjacent1 == adjacent2);
47}
48
49BOOST_AUTO_TEST_CASE(Accessors)
50{
51 const ndn::Name ADJ_NAME_1 = "name1";
52 Adjacent adjacent1(ADJ_NAME_1);
53
54 // Link cost should always be rounded up to the nearest integer.
55 // The library only acceps integral values for prefix registration.
56 adjacent1.setLinkCost(10.1);
57
58 BOOST_CHECK_EQUAL(adjacent1.getName(), "name1");
59 BOOST_CHECK_EQUAL(adjacent1.getLinkCost(), 11);
60}
61
62BOOST_AUTO_TEST_CASE(compareFaceUri)
63{
64 const ndn::Name ADJ_NAME_1 = "name1";
65 const ndn::Name ADJ_NAME_2 = "name2";
66 const ndn::util::FaceUri ADJ_URI_1 = ndn::util::FaceUri("udp4://10.0.0.1:8000");
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050067 Adjacent adjacent1(ADJ_NAME_1);
68 Adjacent adjacent2(ADJ_NAME_2);
Nick Gordone9733ed2017-04-26 10:48:39 -050069 adjacent1.setFaceUri(ADJ_URI_1);
70 adjacent2.setFaceUri(ADJ_URI_1);
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050071
Nick Gordone9733ed2017-04-26 10:48:39 -050072 BOOST_CHECK(adjacent1.compareFaceUri(adjacent2.getFaceUri()));
73}
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050074
Nick Gordone9733ed2017-04-26 10:48:39 -050075BOOST_AUTO_TEST_CASE(compareFaceId)
76{
77 const ndn::Name ADJ_NAME_1 = "name1";
78 const ndn::Name ADJ_NAME_2 = "name2";
79 const uint64_t ADJ_FACEID_1 = 1;
80 Adjacent adjacent1(ADJ_NAME_1);
81 Adjacent adjacent2(ADJ_NAME_2);
82 adjacent1.setFaceId(ADJ_FACEID_1);
83 adjacent2.setFaceId(ADJ_FACEID_1);
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050084
Nick Gordone9733ed2017-04-26 10:48:39 -050085 BOOST_CHECK(adjacent1.compareFaceId(adjacent2.getFaceId()));
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050086}
87
88BOOST_AUTO_TEST_SUITE_END()
89
Nick Gordonfad8e252016-08-11 14:21:38 -050090} // namespace test
91} // namespace nlsr