 |
Eclipse SUMO - Simulation of Urban MObility
|
Go to the documentation of this file.
18 #ifndef RODFRouteCont_h
19 #define RODFRouteCont_h
99 bool save(std::vector<std::string>& saved,
106 std::vector<RODFRouteDesc>&
get() {
126 void removeIllegal(
const std::vector<ROEdgeVector >& illegals);
std::map< std::pair< ROEdge *, ROEdge * >, int > myConnectionOccurences
Counts how many routes connecting the key-edges were already stored.
std::vector< RODFRouteDesc > myRoutes
Stored route descriptions.
int operator()(const RODFRouteDesc &p1, const RODFRouteDesc &p2)
Sorting function; compares RODFRouteDesc::distance2Last.
Static storage of an output device and its base (abstract) implementation.
by_distance_sorter()
Constructor.
void addRouteDesc(RODFRouteDesc &desc)
Adds a route to the container.
bool removeRouteDesc(RODFRouteDesc &desc)
Removes the given route description from the container.
RODFRouteCont()
Constructor.
A class for finding a same route (one that passes the same edges)
A route within the DFROUTER.
A class for sorting route descriptions by their length.
~RODFRouteCont()
Destructor.
bool save(std::vector< std::string > &saved, const std::string &prependix, OutputDevice &out)
Saves routes.
bool operator()(const RODFRouteDesc &desc)
The comparing function; compares passed edges.
void setID(RODFRouteDesc &desc) const
Computes and sets the id of a route.
const RODFRouteDesc & myDesc
The route description for which a same shall be found.
ROEdgeVector edges2Pass
The edges the route is made of.
route_finder & operator=(const route_finder &)
invalidated assignment operator
A container for DFROUTER-routes.
std::vector< RODFRouteDesc > & get()
Returns the container of stored routes.
void removeIllegal(const std::vector< ROEdgeVector > &illegals)
Removes "illegal" routes.
route_finder(const RODFRouteDesc &desc)
onstructor
void sortByDistance()
Sorts routes by their distance (length)