![]() |
SUMO - Simulation of Urban MObility
|
#include <PedestrianRouter.h>
Public Types | |
typedef IntermodalEdge< E, L, N, V > | _IntermodalEdge |
typedef IntermodalNetwork< E, L, N, V > | _IntermodalNetwork |
typedef IntermodalTrip< E, N, V > | _IntermodalTrip |
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. More... | |
Public Member Functions | |
virtual SUMOAbstractRouter< E, _IntermodalTrip > * | clone () |
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. More... | |
bool | compute (const E *, const E *, const _IntermodalTrip *const, SUMOTime, std::vector< const E *> &) |
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. More... | |
void | endQuery (int visits) |
double | getEffort (const E *const e, const IntermodalTrip< E, N, V > *const v, double t) const |
PedestrianRouter () | |
Constructor. More... | |
PedestrianRouter (_IntermodalNetwork *net) | |
void | prohibit (const std::vector< E *> &toProhibit) |
double | recomputeCosts (const std::vector< const E *> &, const _IntermodalTrip *const, SUMOTime) const |
void | setBulkMode (const bool mode) |
void | startQuery () |
virtual | ~PedestrianRouter () |
Destructor. More... | |
Protected Attributes | |
bool | myBulkMode |
whether we are currently operating several route queries in a bulk More... | |
Operation | myOperation |
The object's operation to perform. More... | |
Private Member Functions | |
PedestrianRouter & | operator= (const PedestrianRouter &s) |
Invalidated assignment operator. More... | |
Private Attributes | |
const bool | myAmClone |
INTERNALROUTER * | myInternalRouter |
_IntermodalNetwork * | myPedNet |
The router for pedestrians (on a bidirectional network of sidewalks and crossings)
Definition at line 54 of file PedestrianRouter.h.
typedef IntermodalEdge<E, L, N, V> PedestrianRouter< E, L, N, V, INTERNALROUTER >::_IntermodalEdge |
Definition at line 57 of file PedestrianRouter.h.
typedef IntermodalNetwork<E, L, N, V> PedestrianRouter< E, L, N, V, INTERNALROUTER >::_IntermodalNetwork |
Definition at line 58 of file PedestrianRouter.h.
typedef IntermodalTrip<E, N, V> PedestrianRouter< E, L, N, V, INTERNALROUTER >::_IntermodalTrip |
Definition at line 59 of file PedestrianRouter.h.
|
inherited |
Type of the function that is used to retrieve the edge effort.
Definition at line 55 of file SUMOAbstractRouter.h.
|
inline |
Constructor.
Definition at line 62 of file PedestrianRouter.h.
|
inline |
Definition at line 68 of file PedestrianRouter.h.
|
inlinevirtual |
Destructor.
Definition at line 75 of file PedestrianRouter.h.
|
inlinevirtual |
Implements SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.
Definition at line 82 of file PedestrianRouter.h.
|
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 88 of file PedestrianRouter.h.
Referenced by MSRouteHandler::addPersonTrip(), libsumo::Simulation::findIntermodalRoute(), MSPModel_Striping::getNextLane(), MSPModel_Striping::PState::PState(), and libsumo::Person::rerouteTraveltime().
|
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 127 of file PedestrianRouter.h.
|
inlineinherited |
Definition at line 95 of file SUMOAbstractRouter.h.
References SysUtils::getCurrentMillis(), SUMOAbstractRouter< E, V >::myQueryStartTime, SUMOAbstractRouter< E, V >::myQueryTimeSum, and SUMOAbstractRouter< E, V >::myQueryVisits.
|
inlineinherited |
Definition at line 86 of file SUMOAbstractRouter.h.
References SUMOAbstractRouter< E, V >::myOperation.
|
private |
Invalidated assignment operator.
|
inline |
Definition at line 136 of file PedestrianRouter.h.
Referenced by MSNet::getPedestrianRouter().
|
inlinevirtual |
Implements SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.
Definition at line 132 of file PedestrianRouter.h.
|
inlineinherited |
Definition at line 100 of file SUMOAbstractRouter.h.
References SUMOAbstractRouter< E, V >::myBulkMode.
|
inlineinherited |
Definition at line 90 of file SUMOAbstractRouter.h.
References SysUtils::getCurrentMillis(), SUMOAbstractRouter< E, V >::myNumQueries, and SUMOAbstractRouter< E, V >::myQueryStartTime.
|
private |
|
protectedinherited |
whether we are currently operating several route queries in a bulk
Definition at line 109 of file SUMOAbstractRouter.h.
|
private |
Definition at line 147 of file PedestrianRouter.h.
Referenced by PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::compute(), PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::PedestrianRouter(), PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::prohibit(), and PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::~PedestrianRouter().
|
protectedinherited |
The object's operation to perform.
Definition at line 106 of file SUMOAbstractRouter.h.
|
private |
Definition at line 148 of file PedestrianRouter.h.
Referenced by PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::clone(), PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::compute(), PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::PedestrianRouter(), PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::prohibit(), and PedestrianRouter< E, L, N, V, DijkstraRouter< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V >, prohibited_withPermissions< IntermodalEdge< E, L, N, V >, IntermodalTrip< E, N, V > > > >::~PedestrianRouter().