blob: e4e8bc7aa452f2ead5437abdafc4a46fca32fa15 [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/**
akmhoque3d06e792014-05-27 16:23:20 -05003 * Copyright (c) 2014 University of Memphis,
4 * Regents of the University of California
5 *
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 "route/nexthop-list.hpp"
24#include "route/nexthop.hpp"
25#include <boost/test/unit_test.hpp>
26
27namespace nlsr {
28
29namespace test {
30
31BOOST_AUTO_TEST_SUITE(TestNhl)
32
33BOOST_AUTO_TEST_CASE(NhlAddNextHop)
34{
35 NextHop np1;
36
37 NexthopList nhl1;
38
39 nhl1.addNextHop(np1);
akmhoquefdbddb12014-05-02 18:35:19 -050040 BOOST_CHECK_EQUAL(nhl1.getSize(), (uint32_t)1);
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050041
42 nhl1.removeNextHop(np1);
akmhoquefdbddb12014-05-02 18:35:19 -050043 BOOST_CHECK_EQUAL(nhl1.getSize(), (uint32_t)0);
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050044}
45
Vince Lehman20fe4a92014-09-09 15:57:59 -050046BOOST_AUTO_TEST_CASE(LinkStateRemoveNextHop)
Vince Lehman145064a2014-08-23 11:44:16 -050047{
48 NextHop hop1;
49 hop1.setRouteCost(12.34);
50
51 NexthopList hopList;
52 hopList.addNextHop(hop1);
53
54 NextHop hop2;
Vince Lehman20fe4a92014-09-09 15:57:59 -050055 hop2.setRouteCost(13.01);
56
57 BOOST_REQUIRE_EQUAL(hopList.getSize(), 1);
58
59 hopList.removeNextHop(hop2);
60 BOOST_CHECK_EQUAL(hopList.getSize(), 1);
61
62 hopList.removeNextHop(hop1);
63 BOOST_CHECK_EQUAL(hopList.getSize(), 0);
64}
65
66BOOST_AUTO_TEST_CASE(HyperbolicRemoveNextHop)
67{
68 NextHop hop1;
69 hop1.setHyperbolic(true);
70 hop1.setRouteCost(12.34);
71
72 NexthopList hopList;
73 hopList.addNextHop(hop1);
74
75 NextHop hop2;
76 hop2.setHyperbolic(true);
Vince Lehman145064a2014-08-23 11:44:16 -050077 hop2.setRouteCost(12.35);
78
79 BOOST_REQUIRE_EQUAL(hopList.getSize(), 1);
80
81 hopList.removeNextHop(hop2);
82 BOOST_CHECK_EQUAL(hopList.getSize(), 1);
83
84 hopList.removeNextHop(hop1);
85 BOOST_CHECK_EQUAL(hopList.getSize(), 0);
86}
87
Ashlesh Gawandeeb582eb2014-05-01 14:25:20 -050088BOOST_AUTO_TEST_SUITE_END()
89
90} //namespace test
91} //namespace nlsr