52 FXMutex MSRoute::myDictMutex(
true);
61 const bool isPermanent,
const RGBColor*
const c,
62 const std::vector<SUMOVehicleParameter::Stop>& stops)
63 :
Named(id), myEdges(edges), myAmPermanent(isPermanent),
64 myReferenceCounter(isPermanent ? 1 : 0),
65 myColor(c), myStops(stops) {}
109 FXMutexLock f(myDictMutex);
120 FXMutexLock f(myDictMutex);
133 FXMutexLock f(myDictMutex);
136 myDistDict[id] = std::make_pair(routeDist, permanent);
146 FXMutexLock f(myDictMutex);
148 RouteDict::iterator it =
myDict.find(
id);
150 RouteDistDict::iterator it2 =
myDistDict.find(
id);
151 if (it2 ==
myDistDict.end() || it2->second.first->getOverallProb() == 0) {
154 return it2->second.first->get(rng);
163 FXMutexLock f(myDictMutex);
165 RouteDistDict::iterator it2 =
myDistDict.find(
id);
169 return it2->second.first;
176 FXMutexLock f(myDictMutex);
179 delete i->second.first;
182 for (RouteDict::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
192 FXMutexLock f(myDictMutex);
194 RouteDistDict::iterator it =
myDistDict.find(
id);
195 if (it !=
myDistDict.end() && !it->second.second) {
196 const std::vector<const MSRoute*>& routes = it->second.first->getVals();
197 for (std::vector<const MSRoute*>::const_iterator i = routes.begin(); i != routes.end(); ++i) {
200 delete it->second.first;
209 FXMutexLock f(myDictMutex);
212 for (RouteDict::const_iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
213 into.push_back((*i).first);
216 into.push_back((*i).first);
224 ConstMSEdgeVector::const_iterator i =
myEdges.begin();
228 for (; i !=
myEdges.end(); ++i) {
234 if (upTo || i !=
myEdges.end() - 1) {
244 MSEdgeVector::const_iterator i = edgelist.begin();
245 for (; i != edgelist.end(); ++i) {
263 FXMutexLock f(myDictMutex);
265 for (RouteDict::iterator it =
myDict.begin(); it !=
myDict.end(); ++it) {
282 const MSEdge* fromEdge,
const MSEdge* toEdge,
bool includeInternal)
const {
283 ConstMSEdgeVector::const_iterator it = std::find(
myEdges.begin(),
myEdges.end(), fromEdge);
288 ConstMSEdgeVector::const_iterator it2 = std::find(it + 1,
myEdges.end(), toEdge);
290 if (fromEdge == toEdge) {
291 if (fromPos <= toPos) {
292 return toPos - fromPos;
293 }
else if (it2 ==
myEdges.end()) {
305 bool isFirstIteration =
true;
306 double distance = -fromPos;
308 if (fromEdge == toEdge) {
310 if (fromPos <= toPos) {
311 return toPos - fromPos;
316 }
else if (fromEdge > toEdge) {
320 for (; it !=
end(); ++it) {
321 if (it == toEdge && !isFirstIteration) {
325 distance += (*it)->getLength();
326 if (includeInternal) {
334 isFirstIteration =
false;
349 const std::vector<SUMOVehicleParameter::Stop>&
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
std::map< std::string, const MSRoute * > RouteDict
Definition of the dictionary container.
void release() const
deletes the route if there are no further references to it
Represents a generic random distribution.
double getDistanceBetween(double fromPos, double toPos, const MSEdge *fromEdge, const MSEdge *toEdge, bool includeInternal=true) const
Compute the distance between 2 given edges on this route, including the length of internal lanes...
const RGBColor & getColor() const
Returns the color.
const MSEdge * getLastEdge() const
returns the destination edge
std::vector< const MSEdge * > ConstMSEdgeVector
static RandomDistributor< const MSRoute * > * distDictionary(const std::string &id)
Returns the named route distribution.
double getLength() const
return the length of the edge
int size() const
Returns the number of edges to pass.
begin/end of the description of a route
static void dict_saveState(OutputDevice &out)
Saves all known routes into the given stream.
static void insertIDs(std::vector< std::string > &into)
A road/street connecting two junctions.
static void clear()
Clears the dictionary (delete all known routes, too)
static RouteDistDict myDistDict
The dictionary container.
static const RGBColor DEFAULT_COLOR
The default color (for vehicle types and vehicles)
MSRoute(const std::string &id, const ConstMSEdgeVector &edges, const bool isPermanent, const RGBColor *const c, const std::vector< SUMOVehicleParameter::Stop > &stops)
Constructor.
ConstMSEdgeVector::const_iterator MSRouteIterator
std::map< std::string, std::pair< RandomDistributor< const MSRoute * > *, bool > > RouteDistDict
Definition of the dictionary container.
virtual ~MSRoute()
Destructor.
int writeEdgeIDs(OutputDevice &os, const MSEdge *const from, const MSEdge *const upTo=0) const
Output the edge ids up to but not including the id of the given edge.
std::vector< SUMOVehicleParameter::Stop > myStops
List of the stops on the parsed route.
Base class for objects which have an id.
const MSEdge * getInternalFollowingEdge(const MSEdge *followerAfterInternal) const
const MSEdge * operator[](int index) const
std::string myID
The name of the object.
bool containsAnyOf(const MSEdgeVector &edgelist) const
ConstMSEdgeVector myEdges
The list of edges to pass.
void addReference() const
increments the reference counter for the route
int myReferenceCounter
Information by how many vehicles the route is used.
Static storage of an output device and its base (abstract) implementation.
bool closeTag()
Closes the most recently opened tag.
MSRouteIterator begin() const
Returns the begin of the list of edges to pass.
std::vector< MSEdge * > MSEdgeVector
static void checkDist(const std::string &id)
Checks the distribution whether it is permanent and deletes it if not.
const std::vector< SUMOVehicleParameter::Stop > & getStops() const
Returns the stops.
MSRouteIterator end() const
Returns the end of the list of edges to pass.
static RouteDict myDict
The dictionary container.
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
bool contains(const MSEdge *const edge) const
const RGBColor *const myColor
The color.
static bool dictionary(const std::string &id, const MSRoute *route)
Adds a route to the dictionary.