 |
Eclipse SUMO - Simulation of Urban MObility
|
Go to the documentation of this file.
45 FXMutex MSRoute::myDictMutex(
true);
54 const bool isPermanent,
const RGBColor*
const c,
55 const std::vector<SUMOVehicleParameter::Stop>& stops) :
56 Named(id), myEdges(edges), myAmPermanent(isPermanent),
57 myReferenceCounter(isPermanent ? 1 : 0),
105 FXMutexLock f(myDictMutex);
116 FXMutexLock f(myDictMutex);
129 FXMutexLock f(myDictMutex);
132 myDistDict[id] = std::make_pair(routeDist, permanent);
142 FXMutexLock f(myDictMutex);
144 RouteDict::iterator it =
myDict.find(
id);
146 RouteDistDict::iterator it2 =
myDistDict.find(
id);
147 if (it2 ==
myDistDict.end() || it2->second.first->getOverallProb() == 0) {
150 return it2->second.first->get(rng);
159 FXMutexLock f(myDictMutex);
161 RouteDistDict::iterator it2 =
myDistDict.find(
id);
165 return it2->second.first;
172 FXMutexLock f(myDictMutex);
175 delete i->second.first;
178 for (RouteDict::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
188 FXMutexLock f(myDictMutex);
190 RouteDistDict::iterator it =
myDistDict.find(
id);
191 if (it !=
myDistDict.end() && !it->second.second) {
192 const std::vector<const MSRoute*>& routes = it->second.first->getVals();
193 for (std::vector<const MSRoute*>::const_iterator i = routes.begin(); i != routes.end(); ++i) {
196 delete it->second.first;
205 FXMutexLock f(myDictMutex);
208 for (RouteDict::const_iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
209 into.push_back((*i).first);
212 into.push_back((*i).first);
220 ConstMSEdgeVector::const_iterator i =
myEdges.begin();
221 if (from !=
nullptr) {
224 for (; i !=
myEdges.end(); ++i) {
230 if (upTo || i !=
myEdges.end() - 1) {
240 MSEdgeVector::const_iterator i = edgelist.begin();
241 for (; i != edgelist.end(); ++i) {
259 FXMutexLock f(myDictMutex);
261 for (RouteDict::iterator it =
myDict.begin(); it !=
myDict.end(); ++it) {
278 const MSEdge* fromEdge,
const MSEdge* toEdge,
bool includeInternal,
int routePosition)
const {
280 if (routePosition < 0 || routePosition >= (
int)
myEdges.size()) {
285 if (fromEdge == toEdge) {
286 if (fromPos <= toPos) {
287 return toPos - fromPos;
290 return fromEdge->
getLength() - fromPos + toPos;
294 if (fromEdge ==
myEdges.front()) {
312 ConstMSEdgeVector::const_iterator it = std::find(
myEdges.begin() + routePosition,
myEdges.end(), fromEdge);
315 return std::numeric_limits<double>::max();
317 ConstMSEdgeVector::const_iterator it2 = std::find(it + 1,
myEdges.end(), toEdge);
319 if (fromEdge == toEdge) {
320 if (fromPos <= toPos) {
321 return toPos - fromPos;
322 }
else if (it2 ==
myEdges.end()) {
324 return std::numeric_limits<double>::max();
334 bool isFirstIteration =
true;
335 double distance = -fromPos;
337 if (fromEdge == toEdge) {
339 if (fromPos <= toPos) {
340 return toPos - fromPos;
343 return std::numeric_limits<double>::max();
345 }
else if (fromEdge > toEdge) {
347 return std::numeric_limits<double>::max();
349 for (; it !=
end(); ++it) {
350 if (it == toEdge && !isFirstIteration) {
354 distance += (*it)->getLength();
355 if (includeInternal && (it + 1) !=
end()) {
356 distance += (*it)->getInternalFollowingLengthTo(*(it + 1));
359 isFirstIteration =
false;
374 const std::vector<SUMOVehicleParameter::Stop>&
static void checkDist(const std::string &id)
Checks the distribution whether it is permanent and deletes it if not.
static RouteDict myDict
The dictionary container.
static const RGBColor DEFAULT_COLOR
The default color (for vehicle types and vehicles)
const RGBColor *const myColor
The color.
void release() const
deletes the route if there are no further references to it
const MSEdgeVector & getSuccessors(SUMOVehicleClass vClass=SVC_IGNORING) const
Returns the following edges, restricted by vClass.
Base class for objects which have an id.
Static storage of an output device and its base (abstract) implementation.
MSRouteIterator end() const
Returns the end of the list of edges to pass.
ConstMSEdgeVector::const_iterator MSRouteIterator
std::map< std::string, const MSRoute * > RouteDict
Definition of the dictionary container.
const MSEdge * getLastEdge() const
returns the destination edge
std::vector< const MSEdge * > ConstMSEdgeVector
const RGBColor & getColor() const
Returns the color.
double getLength() const
return the length of the edge
static void insertIDs(std::vector< std::string > &into)
bool closeTag(const std::string &comment="")
Closes the most recently opened tag and optionally adds a comment.
MSRoute(const std::string &id, const ConstMSEdgeVector &edges, const bool isPermanent, const RGBColor *const c, const std::vector< SUMOVehicleParameter::Stop > &stops)
Constructor.
bool isInternal() const
return whether this edge is an internal edge
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
int size() const
Returns the number of edges to pass.
static RandomDistributor< const MSRoute * > * distDictionary(const std::string &id)
Returns the named route distribution.
std::vector< SUMOVehicleParameter::Stop > myStops
List of the stops on the parsed route.
virtual ~MSRoute()
Destructor.
static void clear()
Clears the dictionary (delete all known routes, too)
static void dict_saveState(OutputDevice &out)
Saves all known routes into the given stream.
const MSEdge * operator[](int index) const
A road/street connecting two junctions.
const MSJunction * getToJunction() const
static RouteDistDict myDistDict
The dictionary container.
int myReferenceCounter
Information by how many vehicles the route is used.
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
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::map< std::string, std::pair< RandomDistributor< const MSRoute * > *, bool > > RouteDistDict
Definition of the dictionary container.
std::vector< MSEdge * > MSEdgeVector
const std::vector< SUMOVehicleParameter::Stop > & getStops() const
Returns the stops.
MSRouteIterator begin() const
Returns the begin of the list of edges to pass.
begin/end of the description of a route
static bool dictionary(const std::string &id, const MSRoute *route)
Adds a route to the dictionary.
void addReference() const
increments the reference counter for the route
bool containsAnyOf(const MSEdgeVector &edgelist) const
ConstMSEdgeVector myEdges
The list of edges to pass.
bool contains(const MSEdge *const edge) const
std::string myID
The name of the object.
double getDistanceBetween(double fromPos, double toPos, const MSEdge *fromEdge, const MSEdge *toEdge, bool includeInternal=true, int routePosition=0) const
Compute the distance between 2 given edges on this route, including the length of internal lanes....
const MSEdgeVector & getPredecessors() const