42 #ifdef CHECK_MEMORY_LEAKS
44 #endif // CHECK_MEMORY_LEAKS
84 bool haveSavedOneAtLeast =
false;
85 for (std::vector<RODFRouteDesc>::const_iterator j =
myRoutes.begin(); j !=
myRoutes.end(); ++j) {
87 if (find(saved.begin(), saved.end(), desc.
routename) != saved.end()) {
90 saved.push_back((*j).routename);
92 out <<
" <route id=\"" << prependix << desc.
routename <<
"\" edges=\"";
93 for (std::vector<ROEdge*>::const_iterator k = desc.
edges2Pass.begin(); k != desc.
edges2Pass.end(); k++) {
100 haveSavedOneAtLeast =
true;
102 return haveSavedOneAtLeast;
114 for (std::vector<RODFRouteDesc>::iterator i =
myRoutes.begin(); i !=
myRoutes.end();) {
117 for (std::vector<std::vector<ROEdge*> >::const_iterator j = illegals.begin(); !
remove && j != illegals.end(); ++j) {
119 for (std::vector<ROEdge*>::const_iterator k = (*j).begin(); !
remove && k != (*j).end(); ++k) {
139 std::vector<RODFRouteDesc> newRoutes;
140 for (std::vector<RODFRouteDesc>::iterator i =
myRoutes.begin(); i !=
myRoutes.end(); ++i) {
144 newRoutes.push_back(desc);
151 newRoutes.push_back(ndesc);
161 desc.
routename = c.first->getID() +
"_to_" + c.second->getID();