55 #ifdef CHECK_MEMORY_LEAKS
57 #endif // CHECK_MEMORY_LEAKS
78 myName(name), myFromDef(from_def), myToDef(to_def),
79 myDirection(direction),
80 myDXNothalt(dxnothalt), myDXEinordnen(dxeinordnen),
81 myZuschlag1(zuschlag1), myZuschlag2(zuschlag2),
82 myAssignedVehicles(assignedVehicles), myClosedLanes(clv) {}
102 const std::vector<int>& assignedVehicles,
105 geom, direction, dxnothalt, dxeinordnen, zuschlag1, zuschlag2,
106 seglength, assignedVehicles, clv);
121 DictType::iterator i =
myDict.find(
id);
133 DictType::iterator i =
myDict.find(
id);
143 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
147 std::vector<int> connections =
150 std::vector<int>(),
true);
161 std::vector<int> ret;
162 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
163 if ((*i).second->crosses(poly)) {
164 ret.push_back((*i).second->myID);
183 std::vector<int> ret;
184 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
185 int connID = (*i).first;
186 if ((*i).second->myFromDef.getEdgeID() == edgeid
188 (*i).second->myToDef.getEdgeID() == edgeid) {
189 if (!(*i).second->hasNodeCluster()) {
190 ret.push_back(connID);
254 unsigned int unsetConnections = 0;
262 if (vissimFrom != 0) {
284 if (fromEdge == 0 || toEdge == 0) {
290 const std::vector<int>& toLanes =
getToLanes();
291 if (fromLanes.size() != toLanes.size()) {
294 for (
unsigned int index = 0; index < fromLanes.size(); ++index) {
295 if (fromEdge->
getNumLanes() <=
static_cast<unsigned int>(fromLanes[index])) {
304 return unsetConnections;
310 unsigned int unsetConnections = 0;
312 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
313 unsetConnections += (*i).second->buildEdgeConnections(ec);
315 if (unsetConnections != 0) {
316 WRITE_WARNING(toString<size_t>(unsetConnections) +
" of " + toString<size_t>(
myDict.size()) +
" connections could not be assigned.");
321 const std::vector<int>&
327 const std::vector<int>&
349 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {