SUMO - Simulation of Urban MObility
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MSLinkCont.cpp
Go to the documentation of this file.
1 /****************************************************************************/
7 // Helpers for link vector
8 /****************************************************************************/
9 // SUMO, Simulation of Urban MObility; see http://sumo.sourceforge.net/
10 // Copyright (C) 2001-2012 DLR (http://www.dlr.de/) and contributors
11 /****************************************************************************/
12 //
13 // This file is part of SUMO.
14 // SUMO is free software: you can redistribute it and/or modify
15 // it under the terms of the GNU General Public License as published by
16 // the Free Software Foundation, either version 3 of the License, or
17 // (at your option) any later version.
18 //
19 /****************************************************************************/
20 
21 
22 // ===========================================================================
23 // included modules
24 // ===========================================================================
25 #ifdef _MSC_VER
26 #include <windows_config.h>
27 #else
28 #include <config.h>
29 #endif
30 
31 #include "MSLinkCont.h"
32 #include "MSLane.h"
33 
34 #ifdef CHECK_MEMORY_LEAKS
35 #include <foreign/nvwa/debug_new.h>
36 #endif // CHECK_MEMORY_LEAKS
37 
38 
39 // ===========================================================================
40 // method definitions
41 // ===========================================================================
42 #ifdef HAVE_INTERNAL_LANES
43 const MSEdge*
44 MSLinkContHelper::getInternalFollowingEdge(MSLane* fromLane,
45  MSEdge* followerAfterInternal) {
46  //@todo to be optimized
47  const MSLinkCont& lc = fromLane->getLinkCont();
48  for (MSLinkCont::const_iterator j = lc.begin(); j != lc.end(); j++) {
49  MSLink* link = *j;
50  if (&link->getLane()->getEdge() == followerAfterInternal) {
51  return &link->getViaLane()->getEdge();
52  }
53  }
54  return 0;
55 }
56 #endif
57 
58 
59 MSLink*
61  const MSLinkCont& lc = from.getLinkCont();
62  for (MSLinkCont::const_iterator j = lc.begin(); j != lc.end(); j++) {
63  MSLink* link = *j;
64  if (link->getLane() == &to) {
65  return link;
66  }
67  }
68  return 0;
69 }
70 
71 
72 
73 /****************************************************************************/
74