@@ -74,7 +74,6 @@ bool Connections911::updateConnections()
7474 int numVertices = Simulator::getInstance ().getTotalVertices ();
7575 Layout &layout = Simulator::getInstance ().getModel ().getLayout ();
7676 AllVertices &vertices = layout.getVertices ();
77- oldTypeMap_ = layout.vertexTypeMap_ ;
7877
7978 // Erase PSAPs
8079 for (int i = 0 ; i < psapsToErase_; i++) {
@@ -184,7 +183,7 @@ bool Connections911::erasePSAP(AllVertices &vertices, Layout &layout)
184183 erasedEdge.srcV = srcVertex;
185184 erasedEdge.destV = destVertex;
186185 erasedEdge.eType = layout.edgType (srcVertex, destVertex);
187- edgesErased .push_back (erasedEdge);
186+ edgesErased_ .push_back (erasedEdge);
188187
189188 changesMade = true ;
190189 edges_->eraseEdge (destVertex, iEdg);
@@ -205,7 +204,7 @@ bool Connections911::erasePSAP(AllVertices &vertices, Layout &layout)
205204
206205 if (changesMade) {
207206 // This is here so that we don't delete the vertex if we can't find any edges
208- verticesErased .push_back (randPSAP);
207+ verticesErased_ .push_back (randPSAP);
209208 layout.vertexTypeMap_ [randPSAP] = vertexType::VTYPE_UNDEF;
210209 }
211210
@@ -239,7 +238,7 @@ bool Connections911::erasePSAP(AllVertices &vertices, Layout &layout)
239238 addedEdge.srcV = srcVertex;
240239 addedEdge.destV = closestPSAP;
241240 addedEdge.eType = edgeType::CP;
242- edgesAdded .push_back (addedEdge);
241+ edgesAdded_ .push_back (addedEdge);
243242 }
244243
245244 // For each psap-less responder, find closest match
@@ -267,7 +266,7 @@ bool Connections911::erasePSAP(AllVertices &vertices, Layout &layout)
267266 addedEdge.srcV = closestPSAP;
268267 addedEdge.destV = destVertex;
269268 addedEdge.eType = edgeType::PR;
270- edgesAdded .push_back (addedEdge);
269+ edgesAdded_ .push_back (addedEdge);
271270 }
272271
273272 return changesMade;
@@ -318,7 +317,7 @@ bool Connections911::eraseRESP(AllVertices &vertices, Layout &layout)
318317 erasedEdge.srcV = srcVertex;
319318 erasedEdge.destV = destVertex;
320319 erasedEdge.eType = layout.edgType (srcVertex, destVertex);
321- edgesErased .push_back (erasedEdge);
320+ edgesErased_ .push_back (erasedEdge);
322321
323322 changesMade = true ;
324323 edges_->eraseEdge (destVertex, iEdg);
@@ -327,7 +326,7 @@ bool Connections911::eraseRESP(AllVertices &vertices, Layout &layout)
327326
328327 if (changesMade) {
329328 // This is here so that we don't delete the vertex if we can't find any edges
330- verticesErased .push_back (randRESP);
329+ verticesErased_ .push_back (randRESP);
331330 layout.vertexTypeMap_ [randRESP] = vertexType::VTYPE_UNDEF;
332331 }
333332
@@ -371,16 +370,23 @@ string Connections911::ChangedEdge::toString()
371370 return os.str ();
372371}
373372
373+ // / Registers variable to be recorded
374+ void Connections911::registerHistoryVariables ()
375+ {
376+ Recorder &recorder = Simulator::getInstance ().getModel ().getRecorder ();
377+ recorder.registerVariable (" verticesDeleted" , verticesErased_, Recorder::UpdatedType::DYNAMIC);
378+ }
379+
374380// / Returns the complete list of all deleted or added edges as a string.
375381string Connections911::changedEdgesToXML (bool added)
376382{
377383 stringstream os;
378384
379- vector<ChangedEdge> changed = edgesErased ;
385+ vector<ChangedEdge> changed = edgesErased_ ;
380386 string name = " edgesDeleted" ;
381387
382388 if (added) {
383- changed = edgesAdded ;
389+ changed = edgesAdded_ ;
384390 name = " edgesAdded" ;
385391 }
386392
@@ -395,22 +401,24 @@ string Connections911::changedEdgesToXML(bool added)
395401 return os.str ();
396402}
397403
404+ /*
398405/// Returns the complete list of deleted vertices as a string.
399406string Connections911::erasedVerticesToXML()
400407{
401408 stringstream os;
402409
403410 os << "<Matrix name=\"verticesDeleted\" type=\"complete\" rows=\"1\" columns=\""
404- << verticesErased .size () << " \" multiplier=\" 1.0\" >" << endl;
411+ << verticesErased_ .size() << "\" multiplier=\"1.0\">" << endl;
405412 os << " ";
406413
407- sort (verticesErased .begin (), verticesErased .end ());
408- for (int i = 0 ; i < verticesErased .size (); i++) {
409- os << verticesErased [i] << " " ;
414+ sort(verticesErased_ .begin(), verticesErased_ .end());
415+ for (int i = 0; i < verticesErased_ .size(); i++) {
416+ os << verticesErased_ [i] << " ";
410417 }
411418
412419 os << endl << "</Matrix>";
413420 return os.str();
414421}
422+ */
415423
416424#endif
0 commit comments