Eclipse SUMO - Simulation of Urban MObility
|
#include <PedestrianRouter.h>
Public Types | |
typedef double(* | Operation) (const E *const, const IntermodalTrip< E, N, V > *const, double) |
Type of the function that is used to retrieve the edge effort. | |
Public Member Functions | |
void | buildPathFrom (const typename SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::EdgeInfo *rbegin, std::vector< const E * > &edges) |
Builds the path from marked edges. | |
virtual SUMOAbstractRouter< E, _IntermodalTrip > * | clone () |
bool | compute (const E *, const E *, const _IntermodalTrip *const, SUMOTime, std::vector< const E * > &, bool) |
Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme. | |
double | compute (const E *from, const E *to, double departPos, double arrivalPos, double speed, SUMOTime msTime, const N *onlyNode, std::vector< const E * > &into, bool allEdges=false) |
Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme. | |
bool | compute (const E *from, double fromPos, const E *to, double toPos, const IntermodalTrip< E, N, V > *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false) |
Builds the route between the given edges using the minimum effort at the given time, also taking into account position along the edges to ensure currect handling of looped routes The definition of the effort depends on the wished routing scheme. | |
bool | computeLooped (const E *from, const E *to, const IntermodalTrip< E, N, V > *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false) |
Builds the route between the given edges using the minimum effort at the given time if from == to, return the shortest looped route. | |
void | endQuery (int visits) |
const SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::EdgeInfo & | getEdgeInfo (int index) const |
double | getEffort (const E *const e, const IntermodalTrip< E, N, V > *const v, double t) const |
double | getTravelTime (const E *const e, const IntermodalTrip< E, N, V > *const v, const double t, const double effort) const |
const std::string & | getType () const |
void | init (const int edgeID, const SUMOTime msTime) |
bool | isProhibited (const E *const edge, const IntermodalTrip< E, N, V > *const vehicle) const |
bool | isValid (const std::vector< const E * > &edges, const IntermodalTrip< E, N, V > *const v) const |
PedestrianRouter () | |
Constructor. | |
PedestrianRouter (_IntermodalNetwork *net) | |
void | prohibit (const std::vector< E * > &toProhibit) |
virtual double | recomputeCosts (const std::vector< const E * > &edges, const IntermodalTrip< E, N, V > *const v, SUMOTime msTime, double *lengthp=nullptr) const |
double | recomputeCostsPos (const std::vector< const E * > &edges, const IntermodalTrip< E, N, V > *const v, double fromPos, double toPos, SUMOTime msTime, double *lengthp=nullptr) const |
virtual void | reset (const IntermodalTrip< E, N, V > *const vehicle) |
reset internal caches, used by CHRouter | |
void | setAutoBulkMode (const bool mode) |
virtual void | setBulkMode (const bool mode) |
double | setHint (const typename std::vector< const E * >::const_iterator routeBegin, const typename std::vector< const E * >::const_iterator routeEnd, const IntermodalTrip< E, N, V > *const v, SUMOTime msTime) |
void | startQuery () |
void | updateViaCost (const E *const prev, const E *const e, const IntermodalTrip< E, N, V > *const v, double &time, double &effort, double &length) const |
void | updateViaEdgeCost (const E *viaEdge, const IntermodalTrip< E, N, V > *const v, double &time, double &effort, double &length) const |
virtual | ~PedestrianRouter () |
Destructor. | |
Protected Attributes | |
bool | myAmClean |
whether we are already initialized | |
bool | myAutoBulkMode |
whether we are currently trying to detect bulk mode automatically | |
bool | myBulkMode |
whether we are currently operating several route queries in a bulk | |
std::vector< typename SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::EdgeInfo > | myEdgeInfos |
The container of edge information. | |
MsgHandler *const | myErrorMsgHandler |
the handler for routing errors | |
std::vector< typename SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::EdgeInfo * > | myFound |
list of visited Edges (for resetting) | |
std::vector< typename SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::EdgeInfo * > | myFrontierList |
A container for reusage of the min edge heap. | |
const bool | myHavePermissions |
whether edge permissions need to be considered | |
const bool | myHaveRestrictions |
whether edge restrictions need to be considered | |
Operation | myOperation |
The object's operation to perform. | |
std::vector< E * > | myProhibited |
The list of explicitly prohibited edges. | |
Operation | myTTOperation |
The object's operation to perform for travel times. | |
Private Types | |
typedef IntermodalEdge< E, L, N, V > | _IntermodalEdge |
typedef IntermodalNetwork< E, L, N, V > | _IntermodalNetwork |
typedef IntermodalTrip< E, N, V > | _IntermodalTrip |
typedef DijkstraRouter< _IntermodalEdge, _IntermodalTrip > | _InternalRouter |
Private Member Functions | |
PedestrianRouter & | operator= (const PedestrianRouter &s) |
Invalidated assignment operator. | |
Private Attributes | |
const bool | myAmClone |
_InternalRouter * | myInternalRouter |
long long int | myNumQueries |
_IntermodalNetwork * | myPedNet |
long long int | myQueryStartTime |
the time spent querying in milliseconds | |
long long int | myQueryTimeSum |
long long int | myQueryVisits |
counters for performance logging | |
const std::string | myType |
the type of this router | |
The router for pedestrians (on a bidirectional network of sidewalks and crossings)
Definition at line 45 of file PedestrianRouter.h.
|
private |
Definition at line 47 of file PedestrianRouter.h.
|
private |
Definition at line 48 of file PedestrianRouter.h.
|
private |
Definition at line 49 of file PedestrianRouter.h.
|
private |
Definition at line 50 of file PedestrianRouter.h.
|
inherited |
Type of the function that is used to retrieve the edge effort.
Definition at line 92 of file SUMOAbstractRouter.h.
|
inline |
Constructor.
Definition at line 54 of file PedestrianRouter.h.
References IntermodalNetwork< E, L, N, V >::getAllEdges(), IntermodalEdge< E, L, N, V >::getTravelTimeStatic(), IntermodalEdge< E, L, N, V >::getTravelTimeStaticRandomized(), gWeightsRandomFactor, PedestrianRouter< E, L, N, V >::myInternalRouter, and PedestrianRouter< E, L, N, V >::myPedNet.
|
inline |
Definition at line 62 of file PedestrianRouter.h.
References IntermodalNetwork< E, L, N, V >::getAllEdges(), IntermodalEdge< E, L, N, V >::getTravelTimeStatic(), IntermodalEdge< E, L, N, V >::getTravelTimeStaticRandomized(), gWeightsRandomFactor, PedestrianRouter< E, L, N, V >::myInternalRouter, and PedestrianRouter< E, L, N, V >::myPedNet.
|
inlinevirtual |
Destructor.
Definition at line 71 of file PedestrianRouter.h.
References PedestrianRouter< E, L, N, V >::myAmClone, PedestrianRouter< E, L, N, V >::myInternalRouter, and PedestrianRouter< E, L, N, V >::myPedNet.
|
inlineinherited |
Builds the path from marked edges.
Definition at line 364 of file SUMOAbstractRouter.h.
|
inlinevirtual |
Implements SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.
Definition at line 78 of file PedestrianRouter.h.
References PedestrianRouter< E, L, N, V >::myPedNet.
|
inlinevirtual |
Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.
Implements SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.
Definition at line 124 of file PedestrianRouter.h.
References TL.
|
inline |
Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.
Definition at line 84 of file PedestrianRouter.h.
References DijkstraRouter< E, V >::compute(), IntermodalNetwork< E, L, N, V >::getArrivalConnector(), IntermodalNetwork< E, L, N, V >::getDepartConnector(), SUMOAbstractRouter< E, V >::getEffort(), PedestrianRouter< E, L, N, V >::myInternalRouter, PedestrianRouter< E, L, N, V >::myPedNet, TIME2STEPS, TL, toString(), and WRITE_WARNINGF.
Referenced by MSPModel_JuPedSim::add(), MSPModel_Striping::getNextLane(), MSPModel_Striping::PState::PState(), and LIBSUMO_NAMESPACE::Person::rerouteTraveltime().
|
inlineinherited |
Builds the route between the given edges using the minimum effort at the given time, also taking into account position along the edges to ensure currect handling of looped routes The definition of the effort depends on the wished routing scheme.
Definition at line 183 of file SUMOAbstractRouter.h.
|
inlineinherited |
Builds the route between the given edges using the minimum effort at the given time if from == to, return the shortest looped route.
Definition at line 198 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 339 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 169 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 330 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 231 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 165 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 136 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 227 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 260 of file SUMOAbstractRouter.h.
|
private |
Invalidated assignment operator.
|
inlinevirtual |
Reimplemented from SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.
Definition at line 129 of file PedestrianRouter.h.
References IntermodalNetwork< E, L, N, V >::getBothDirections(), PedestrianRouter< E, L, N, V >::myInternalRouter, PedestrianRouter< E, L, N, V >::myPedNet, and SUMOAbstractRouter< E, V >::prohibit().
|
inlinevirtualinherited |
Definition at line 269 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 287 of file SUMOAbstractRouter.h.
|
inlinevirtualinherited |
reset internal caches, used by CHRouter
Definition at line 161 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 348 of file SUMOAbstractRouter.h.
|
inlinevirtualinherited |
Reimplemented in IntermodalRouter< E, L, N, V >.
Definition at line 344 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 299 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 334 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 245 of file SUMOAbstractRouter.h.
|
inlineinherited |
Definition at line 235 of file SUMOAbstractRouter.h.
|
protectedinherited |
whether we are already initialized
Definition at line 390 of file SUMOAbstractRouter.h.
|
private |
Definition at line 139 of file PedestrianRouter.h.
Referenced by PedestrianRouter< E, L, N, V >::~PedestrianRouter().
|
protectedinherited |
whether we are currently trying to detect bulk mode automatically
Definition at line 387 of file SUMOAbstractRouter.h.
|
protectedinherited |
whether we are currently operating several route queries in a bulk
Definition at line 384 of file SUMOAbstractRouter.h.
|
protectedinherited |
The container of edge information.
Definition at line 402 of file SUMOAbstractRouter.h.
|
protectedinherited |
the handler for routing errors
Definition at line 375 of file SUMOAbstractRouter.h.
|
protectedinherited |
list of visited Edges (for resetting)
Definition at line 407 of file SUMOAbstractRouter.h.
|
protectedinherited |
A container for reusage of the min edge heap.
Definition at line 405 of file SUMOAbstractRouter.h.
|
protectedinherited |
whether edge permissions need to be considered
Definition at line 393 of file SUMOAbstractRouter.h.
|
protectedinherited |
whether edge restrictions need to be considered
Definition at line 396 of file SUMOAbstractRouter.h.
|
private |
Definition at line 140 of file PedestrianRouter.h.
Referenced by PedestrianRouter< E, L, N, V >::compute(), PedestrianRouter< E, L, N, V >::PedestrianRouter(), PedestrianRouter< E, L, N, V >::PedestrianRouter(), PedestrianRouter< E, L, N, V >::prohibit(), and PedestrianRouter< E, L, N, V >::~PedestrianRouter().
|
privateinherited |
Definition at line 415 of file SUMOAbstractRouter.h.
|
protectedinherited |
The object's operation to perform.
Definition at line 378 of file SUMOAbstractRouter.h.
|
private |
Definition at line 141 of file PedestrianRouter.h.
Referenced by PedestrianRouter< E, L, N, V >::clone(), PedestrianRouter< E, L, N, V >::compute(), PedestrianRouter< E, L, N, V >::PedestrianRouter(), PedestrianRouter< E, L, N, V >::PedestrianRouter(), PedestrianRouter< E, L, N, V >::prohibit(), and PedestrianRouter< E, L, N, V >::~PedestrianRouter().
|
protectedinherited |
The list of explicitly prohibited edges.
Definition at line 399 of file SUMOAbstractRouter.h.
|
privateinherited |
the time spent querying in milliseconds
Definition at line 417 of file SUMOAbstractRouter.h.
|
privateinherited |
Definition at line 418 of file SUMOAbstractRouter.h.
|
privateinherited |
counters for performance logging
Definition at line 414 of file SUMOAbstractRouter.h.
|
protectedinherited |
The object's operation to perform for travel times.
Definition at line 381 of file SUMOAbstractRouter.h.
|
privateinherited |
the type of this router
Definition at line 411 of file SUMOAbstractRouter.h.