commit c780a6986b0373465aeadee3c74cdce666c7bdff
author Nick Gordon <nmgordon@memphis.edu> Thu Apr 27 18:03:02 2017 -0500
committer Nick Gordon <nmgordon@memphis.edu> Fri Apr 28 10:43:08 2017 -0500
tree 239eb2753b75a58fb6954b13eb5ba6c5a4f70752
parent 9eaf3f4417fec6a87980ad182a357d52bb035fbd

nlsr: refactor AdjacencyList to use iterators instead of bare ptrs

Change-Id: I42225ee63c3d64eb80e58bc51c8d1afd20dd2ce2
refs: #4068

tests/test-link-state-calculator.cpp

diff --git a/tests/test-link-state-calculator.cpp b/tests/test-link-state-calculator.cpp
index f4fffb6..6bbf472 100644
--- a/tests/test-link-state-calculator.cpp
+++ b/tests/test-link-state-calculator.cpp
@@ -179,8 +179,8 @@
   AdjLsa* lsa = nlsr.getLsdb().findAdjLsa(key);
   BOOST_REQUIRE(lsa != nullptr);
 
-  Adjacent* c = lsa->getAdl().findAdjacent(ROUTER_C_NAME);
-  BOOST_REQUIRE(c != nullptr);
+  auto c = lsa->getAdl().findAdjacent(ROUTER_C_NAME);
+  BOOST_REQUIRE(c != nlsr.getAdjacencyList().end());
 
   double higherLinkCost = LINK_BC_COST + 1;
   c->setLinkCost(higherLinkCost);
@@ -228,8 +228,8 @@
   AdjLsa* lsa = nlsr.getLsdb().findAdjLsa(key);
   BOOST_REQUIRE(lsa != nullptr);
 
-  Adjacent* c = lsa->getAdl().findAdjacent(ROUTER_C_NAME);
-  BOOST_REQUIRE(c != nullptr);
+  auto c = lsa->getAdl().findAdjacent(ROUTER_C_NAME);
+  BOOST_REQUIRE(c != nlsr.getAdjacencyList().end());
 
   c->setLinkCost(0);