Home
last modified time | relevance | path

Searched refs:MSEdge (Results 1 – 25 of 141) sorted by relevance

123456

/dports/cad/sumo/sumo-1.2.0/src/microsim/devices/
H A DMSRoutingEngine.cpp60 std::map<std::pair<const MSEdge*, const MSEdge*>, const MSRoute*> MSRoutingEngine::myCachedRoutes;
154 …std::map<std::pair<const MSEdge*, const MSEdge*>, const MSRoute*>::iterator it = myCachedRoutes.be… in adaptEdgeEfforts()
191 for (const MSEdge* e : edges) { in adaptEdgeEfforts()
204 MSRoutingEngine::getCachedRoute(const std::pair<const MSEdge*, const MSEdge*>& key) { in getCachedRoute() argument
229 … myRouter = new DijkstraRouter<MSEdge, SUMOVehicle, SUMOAbstractRouter<MSEdge, SUMOVehicle> >( in reroute()
250 … typedef AStarRouter<MSEdge, SUMOVehicle, SUMOAbstractRouter<MSEdge, SUMOVehicle> > AStar; in reroute()
258 … CHRouterWrapper<MSEdge, SUMOVehicle, SUMOAbstractRouter<MSEdge, SUMOVehicle> > router( in reroute()
269 … myRouter = new CHRouter<MSEdge, SUMOVehicle, SUMOAbstractRouterPermissions<MSEdge, SUMOVehicle> >( in reroute()
272 … myRouter = new CHRouter<MSEdge, SUMOVehicle, SUMOAbstractRouter<MSEdge, SUMOVehicle> >( in reroute()
309 SUMOAbstractRouter<MSEdge, SUMOVehicle>&
[all …]
H A DMSRoutingEngine.h83 static const MSRoute* getCachedRoute(const std::pair<const MSEdge*, const MSEdge*>& key);
89 static void setEdgeTravelTime(const MSEdge* const edge, const double travelTime);
100 static SUMOAbstractRouter<MSEdge, SUMOVehicle>& getRouterTT(
117 static double getEffort(const MSEdge* const e, const SUMOVehicle* const v, double t);
120 static double getAssumedSpeed(const MSEdge* edge);
145 SUMOAbstractRouter<MSEdge, SUMOVehicle>* router) in WorkerThread() argument
147 SUMOAbstractRouter<MSEdge, SUMOVehicle>& getRouter() const { in getRouter()
155 SUMOAbstractRouter<MSEdge, SUMOVehicle>* myRouter;
224 static SUMOAbstractRouter<MSEdge, SUMOVehicle>* myRouter;
227 …static AStarRouter<MSEdge, SUMOVehicle, SUMOAbstractRouterPermissions<MSEdge, SUMOVehicle> >* myRo…
[all …]
/dports/cad/sumo/sumo-1.2.0/src/microsim/traffic_lights/
H A DMSPushButton.cpp27 MSPushButton::MSPushButton(const MSEdge* edge, const MSEdge* crossingEdge) { in MSPushButton()
48 MSPedestrianPushButton::MSPedestrianPushButton(const MSEdge* walkingEdge, const MSEdge* crossingEdg… in MSPedestrianPushButton()
58 bool MSPedestrianPushButton::isActiveForEdge(const MSEdge* walkingEdge, const MSEdge* crossing) { in isActiveForEdge()
119 void getWalking(const std::vector<MSEdge*>& edges, std::vector< MSEdge*>& walkingEdges) { in getWalking()
121 MSEdge* edge = *it; in getWalking()
129 const std::vector<MSEdge*> getWalkingAreas(const MSEdge* crossing) { in getWalkingAreas()
130 std::vector<MSEdge*> walkingEdges; in getWalkingAreas()
140 MSEdge* walking = *wIt; in isActiveOnAnySideOfTheRoad()
167 MSEdge* crossing = MSEdge::dictionary(*cIt); in loadPushButtons()
185 …for (MSEdgeVector::const_iterator eIt = MSEdge::getAllEdges().begin(); eIt != MSEdge::getAllEdges(… in loadCrossingEdgeMap()
[all …]
H A DMSPushButton.h25 class MSEdge; variable
52 MSPushButton(const MSEdge* edge, const MSEdge* crossingEdge);
53 const MSEdge* m_edge;
54 const MSEdge* m_crossingEdge;
67 MSPedestrianPushButton(const MSEdge* walkingEdge, const MSEdge* crossingEdge);
81 static bool isActiveForEdge(const MSEdge* walkingEdge, const MSEdge* crossing);
88 static bool isActiveOnAnySideOfTheRoad(const MSEdge* crossing);
/dports/cad/sumo/sumo-1.2.0/src/microsim/
H A DMSEdge.h56 class MSEdge; variable
72 typedef std::vector<MSEdge*> MSEdgeVector;
74 typedef std::vector<std::pair<const MSEdge*, const MSEdge*> > MSConstEdgePairVector;
102 virtual ~MSEdge();
304 void addSuccessor(MSEdge* edge, const MSEdge* via = nullptr);
515 const MSEdge* getInternalFollowingEdge(const MSEdge* followerAfterInternal) const;
522 const MSEdge* getNormalBefore() const;
727 int operator()(const MSEdge* const e1, const MSEdge* const e2) const { in operator()
874 const MSEdge* myBidiEdge;
877 MSEdge(const MSEdge&);
[all …]
H A DMSEdgeWeightsStorage.h33 class MSEdge; variable
60 bool retrieveExistingTravelTime(const MSEdge* const e, const double t, double& value) const;
69 bool retrieveExistingEffort(const MSEdge* const e, const double t, double& value) const;
78 void addTravelTime(const MSEdge* const e, double begin, double end, double value);
87 void addEffort(const MSEdge* const e, double begin, double end, double value);
93 void removeTravelTime(const MSEdge* const e);
99 void removeEffort(const MSEdge* const e);
106 bool knowsTravelTime(const MSEdge* const e) const;
113 bool knowsEffort(const MSEdge* const e) const;
118 std::map<const MSEdge*, ValueTimeLine<double> > myTravelTimes;
[all …]
H A DMSEdgeWeightsStorage.cpp56 std::map<const MSEdge*, ValueTimeLine<double> >::const_iterator i = myEfforts.find(e); in retrieveExistingEffort()
70 MSEdgeWeightsStorage::addTravelTime(const MSEdge* const e, in addTravelTime()
73 std::map<const MSEdge*, ValueTimeLine<double> >::iterator i = myTravelTimes.find(e); in addTravelTime()
83 MSEdgeWeightsStorage::addEffort(const MSEdge* const e, in addEffort()
86 std::map<const MSEdge*, ValueTimeLine<double> >::iterator i = myEfforts.find(e); in addEffort()
96 MSEdgeWeightsStorage::removeTravelTime(const MSEdge* const e) { in removeTravelTime()
97 std::map<const MSEdge*, ValueTimeLine<double> >::iterator i = myTravelTimes.find(e); in removeTravelTime()
105 MSEdgeWeightsStorage::removeEffort(const MSEdge* const e) { in removeEffort()
106 std::map<const MSEdge*, ValueTimeLine<double> >::iterator i = myEfforts.find(e); in removeEffort()
114 MSEdgeWeightsStorage::knowsTravelTime(const MSEdge* const e) const { in knowsTravelTime()
[all …]
H A DMSEdge.cpp57 MSEdge::DictType MSEdge::myDict;
64 MSEdge::MSEdge(const std::string& id, int numericalID, in MSEdge() function in MSEdge
87 MSEdge::~MSEdge() { in ~MSEdge()
708 const MSEdge*
739 const MSEdge*
803 MSEdge::dictionary(const std::string& id, MSEdge* ptr) { in dictionary()
818 MSEdge*
878 const MSEdge* edge = MSEdge::dictionary(*i); in parseEdgesList()
982 MSEdge::addSuccessor(MSEdge* edge, const MSEdge* via) { in addSuccessor()
1094 const MSEdge*
[all …]
H A DMSTransportable.h39 class MSEdge; variable
83 const MSEdge* getDestination() const;
202 const MSEdge* myDestination;
245 const MSEdge* getEdge() const;
302 const MSEdge* myOrigin;
438 const MSEdge* getEdge() const;
439 const MSEdge* getFromEdge() const;
504 const MSEdge* myWaitingEdge;
593 const MSEdge* getDestination() const { in getDestination()
603 const MSEdge* getEdge() const { in getEdge()
[all …]
H A DMSContainer.h40 class MSEdge; variable
73 MSContainerStage_Driving(const MSEdge* destination, MSStoppingPlace* toStop,
113 …MSContainerStage_Tranship(const std::vector<const MSEdge*>& route, MSStoppingPlace* toStop, double…
124 const MSEdge* getEdge() const;
127 const MSEdge* getFromEdge() const;
130 const MSEdge* getToEdge() const;
181 … bool moveToNextEdge(MSTransportable* container, SUMOTime currentTime, MSEdge* nextInternal = 0);
197 inline const MSEdge* getNextRouteEdge() const { in getNextRouteEdge()
207 std::vector<const MSEdge*> myRoute;
210 std::vector<const MSEdge*>::iterator myRouteStep;
[all …]
H A DMSRoute.h48 class MSEdge; variable
56 typedef std::vector<const MSEdge*> ConstMSEdgeVector;
57 typedef std::vector<MSEdge*> MSEdgeVector;
87 const MSEdge* getLastEdge() const;
101 … int writeEdgeIDs(OutputDevice& os, const MSEdge* const from, const MSEdge* const upTo = 0) const;
103 bool contains(const MSEdge* const edge) const { in contains()
109 const MSEdge* operator[](int index) const;
138 …double getDistanceBetween(double fromPos, double toPos, const MSEdge* fromEdge, const MSEdge* toEd…
H A DMSJunction.h47 class MSEdge; variable
50 typedef std::vector<MSEdge*> MSEdgeVector;
51 typedef std::vector<const MSEdge*> ConstMSEdgeVector;
118 void addIncoming(MSEdge* edge) { in addIncoming()
122 void addOutgoing(MSEdge* edge) { in addOutgoing()
H A DMSNet.h54 class MSEdge; variable
112 typedef PedestrianRouter<MSEdge, MSLane, MSJunction, MSVehicle> MSPedestrianRouter;
113 typedef IntermodalRouter<MSEdge, MSLane, MSJunction, SUMOVehicle> MSIntermodalRouter;
608 static double getTravelTime(const MSEdge* const e, const SUMOVehicle* const v, double t);
618 static double getEffort(const MSEdge* const e, const SUMOVehicle* const v, double t);
624 SUMOAbstractRouter<MSEdge, SUMOVehicle>& getRouterTT(
626 SUMOAbstractRouter<MSEdge, SUMOVehicle>& getRouterEffort(
802 mutable SUMOAbstractRouter<MSEdge, SUMOVehicle>* myRouterTT;
803 mutable SUMOAbstractRouter<MSEdge, SUMOVehicle>* myRouterEffort;
H A DMSStateHandler.cpp76 out.writeHeader<MSEdge>(SUMO_TAG_SNAPSHOT); in saveState()
85 for (int i = 0; i < MSEdge::dictSize(); i++) { in saveState()
86 …for (MESegment* s = MSGlobals::gMesoNet->getSegmentForEdge(*MSEdge::getAllEdges()[i]); s != nullpt… in saveState()
91 for (int i = 0; i < MSEdge::dictSize(); i++) { in saveState()
92 const std::vector<MSLane*>& lanes = MSEdge::getAllEdges()[i]->getLanes(); in saveState()
174 mySegment = MSGlobals::gMesoNet->getSegmentForEdge(*MSEdge::getAllEdges()[0]); in myStartElement()
176 …mySegment = MSGlobals::gMesoNet->getSegmentForEdge(*MSEdge::getAllEdges()[mySegment->getEdge().get… in myStartElement()
185 … if (myEdgeAndLane.second == (int)MSEdge::getAllEdges()[myEdgeAndLane.first]->getLanes().size()) { in myStartElement()
197 … MSEdge::getAllEdges()[myEdgeAndLane.first]->getLanes()[myEdgeAndLane.second]->loadState( in myStartElement()
H A DMSLane.h58 class MSEdge; variable
664 MSEdge& getEdge() const { in getEdge()
672 const MSEdge* getNextNormal() const;
819 bool isApproachedFrom(MSEdge* const edge);
820 bool isApproachedFrom(MSEdge* const edge, MSLane* const lane);
1327 MSEdge* const myEdge;
1370 std::map<MSEdge*, std::vector<MSLane*> > myApproachingLanes;
1479 int operator()(const MSEdge* const e1, const MSEdge* const e2) const;
1484 const MSEdge* const myEdge;
1534 edge_finder(MSEdge* e) : myEdge(e) {} in edge_finder()
[all …]
H A DMSLinkCont.h34 class MSEdge; variable
56 static const MSEdge* getInternalFollowingEdge(const MSLane* fromLane,
57 const MSEdge* followerAfterInternal);
/dports/cad/sumo/sumo-1.2.0/src/microsim/pedestrians/
H A DMSPerson.h43 class MSEdge; variable
54 typedef std::vector<const MSEdge*> ConstMSEdgeVector;
92 const MSEdge* getEdge() const;
93 const MSEdge* getFromEdge() const;
160 inline const std::vector<const MSEdge*>::iterator getRouteStep() const { in getRouteStep()
164 inline const MSEdge* getRouteEdge() const { in getRouteEdge()
167 inline const MSEdge* getNextRouteEdge() const { in getNextRouteEdge()
204 MSEdge* myCurrentInternalEdge;
284 MSPersonStage_Access(const MSEdge* destination, MSStoppingPlace* toStop,
328 MSEdge* myStopEdge;
[all …]
H A DMSPerson.cpp91 const MSEdge*
101 const MSEdge*
165 const MSEdge* edge = *myRouteStep; in proceed()
197 for (const MSEdge* edge : myRoute) { in walkDistance()
203 const MSEdge* fromEdge = *i; in walkDistance()
204 const MSEdge* toEdge = *(i + 1); in walkDistance()
328 ((MSEdge*)getEdge())->removePerson(person); in moveToNextEdge()
372 ((MSEdge*)getEdge())->removePerson(person); in setRouteIndex()
374 ((MSEdge*)getEdge())->addPerson(person); in setRouteIndex()
658 const MSEdge* nextEdge = getNextEdgePtr(); in getNextEdge()
[all …]
H A DMSPModel_NonInteracting.cpp85 const MSEdge* old = myParent.getEdge(); in execute()
99 MSPModel_NonInteracting::PState::computeWalkingTime(const MSEdge* prev, const MSPerson::MSPersonSta… in computeWalkingTime()
101 const MSEdge* edge = stage.getEdge(); in computeWalkingTime()
102 const MSEdge* next = stage.getNextRouteEdge(); in computeWalkingTime()
141 const MSLane* lane = getSidewalk<MSEdge, MSLane>(stage.getEdge()); in getPosition()
179 const MSEdge*
H A DMSPModel_Remote.h65 const MSEdge* getNextEdge(const MSPerson::MSPersonStage_Walking& stage) const override;
83 void handleWalkingArea(MSEdge* msEdge, hybridsim::Scenario& scenario);
90 std::map<const MSEdge*, std::tuple<int, int>> edgesTransitionsMapping;
91 std::map<int, const MSEdge*> transitionsEdgesMapping;
96 MSLane* getFirstPedestrianLane(const MSEdge* const& edge);
/dports/cad/sumo/sumo-1.2.0/src/netload/
H A DNLEdgeControlBuilder.cpp49 myActiveEdge = (MSEdge*) nullptr; in NLEdgeControlBuilder()
69 if (MSEdge::dictionary(id) != nullptr) { in beginEdgeParsing()
162 MSEdge*
192 MSEdge* edge = *i1; in build()
215 for (MSEdge* e : myEdges) { in build()
223 MSEdge*
226 return new MSEdge(id, myCurrentNumericalEdgeID++, function, streetName, edgeType, priority); in buildEdge()
H A DNLEdgeControlBuilder.h125 virtual MSEdge* closeEdge();
144 virtual MSEdge* buildEdge(const std::string& id, const SumoXMLEdgeFunc function,
164 MSEdge* myActiveEdge;
176 std::map<MSEdge*, std::string> myBidiEdges;
/dports/cad/sumo/sumo-1.2.0/src/mesosim/
H A DMESegment.h34 class MSEdge; variable
70 const MSEdge& parent, MESegment* next,
266 inline const MSEdge& getEdge() const { in getEdge()
427 static bool useMultiQueue(bool multiQueue, const MSEdge& parent);
436 const MSEdge& myEdge;
487 std::map<const MSEdge*, std::vector<int> > myFollowerMap;
502 static MSEdge myDummyParent;
H A DMELoop.h35 class MSEdge; variable
84 void buildSegmentsFor(const MSEdge& e, const OptionsCont& oc);
92 MESegment* getSegmentForEdge(const MSEdge& e, double pos = 0);
139 static bool isEnteringRoundabout(const MSEdge& e);
/dports/cad/sumo/sumo-1.2.0/src/guisim/
H A DGUIEdge.h53 class GUIEdge : public MSEdge, public GUIGlObject {
140 MSEdge::addPerson(p); in addPerson()
145 MSEdge::removePerson(p); in removePerson()
151 MSEdge::addContainer(c); in addContainer()
156 MSEdge::removeContainer(c); in removeContainer()

123456