SUMO - Simulation of Urban MObility
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
PedestrianRouter< E, L, N, INTERNALROUTER > Class Template Reference

#include <PedestrianRouter.h>

Inheritance diagram for PedestrianRouter< E, L, N, INTERNALROUTER >:
SUMOAbstractRouter< E, PedestrianTrip< E, N > >

Public Types

typedef PedestrianEdge< E, L, N > _PedestrianEdge
typedef PedestrianTrip< E, N > _PedestrianTrip

Public Member Functions

virtual void compute (const E *from, const E *to, const PedestrianTrip< E, N > *const vehicle, SUMOTime msTime, std::vector< const E * > &into)=0
 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.
void compute (const E *from, const E *to, SUMOReal departPos, SUMOReal arrivalPos, SUMOReal 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.
void compute (const E *, const E *, const _PedestrianTrip *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.
void endQuery (int visits)
 PedestrianRouter ()
 Constructor.
virtual void prepare (const E *, const PedestrianTrip< E, N > *, bool)
void prohibit (const std::vector< E * > &toProhibit)
virtual SUMOReal recomputeCosts (const std::vector< const E * > &edges, const PedestrianTrip< E, N > *const v, SUMOTime msTime) const =0
SUMOReal recomputeCosts (const std::vector< const E * > &, const _PedestrianTrip *const, SUMOTime) const
void startQuery ()
virtual ~PedestrianRouter ()
 Destructor.

Private Member Functions

PedestrianRouteroperator= (const PedestrianRouter &s)
 Invalidated assignment operator.

Private Attributes

INTERNALROUTER * myInternalRouter

Detailed Description

template<class E, class L, class N, class INTERNALROUTER>
class PedestrianRouter< E, L, N, INTERNALROUTER >

The router for pedestrians (on a bidirectional network of sidewalks and crossings

Definition at line 367 of file PedestrianRouter.h.

Member Typedef Documentation

template<class E, class L, class N, class INTERNALROUTER>
typedef PedestrianEdge<E, L, N> PedestrianRouter< E, L, N, INTERNALROUTER >::_PedestrianEdge

Definition at line 370 of file PedestrianRouter.h.

template<class E, class L, class N, class INTERNALROUTER>
typedef PedestrianTrip<E, N> PedestrianRouter< E, L, N, INTERNALROUTER >::_PedestrianTrip

Definition at line 371 of file PedestrianRouter.h.

Constructor & Destructor Documentation

template<class E, class L, class N, class INTERNALROUTER>
PedestrianRouter< E, L, N, INTERNALROUTER >::PedestrianRouter ( )
inline

Constructor.

Definition at line 374 of file PedestrianRouter.h.

template<class E, class L, class N, class INTERNALROUTER>
virtual PedestrianRouter< E, L, N, INTERNALROUTER >::~PedestrianRouter ( )
inlinevirtual

Destructor.

Definition at line 381 of file PedestrianRouter.h.

Member Function Documentation

virtual void SUMOAbstractRouter< E, PedestrianTrip< E, N > >::compute ( const E *  from,
const E *  to,
const PedestrianTrip< E, N > *const  vehicle,
SUMOTime  msTime,
std::vector< const E * > &  into 
)
pure virtualinherited

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.

template<class E, class L, class N, class INTERNALROUTER>
void PedestrianRouter< E, L, N, INTERNALROUTER >::compute ( const E *  from,
const E *  to,
SUMOReal  departPos,
SUMOReal  arrivalPos,
SUMOReal  speed,
SUMOTime  msTime,
const N *  onlyNode,
std::vector< const E * > &  into,
bool  allEdges = false 
)
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 387 of file PedestrianRouter.h.

Referenced by MSPModel_Striping::getNextLane(), MSRouteHandler::myStartElement(), MSPModel_Striping::PState::PState(), and RORouteHandler::routePedestrian().

template<class E, class L, class N, class INTERNALROUTER>
void PedestrianRouter< E, L, N, INTERNALROUTER >::compute ( const E *  ,
const E *  ,
const _PedestrianTrip const,
SUMOTime  ,
std::vector< const E * > &   
)
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 413 of file PedestrianRouter.h.

template<class E, class L, class N, class INTERNALROUTER>
PedestrianRouter& PedestrianRouter< E, L, N, INTERNALROUTER >::operator= ( const PedestrianRouter< E, L, N, INTERNALROUTER > &  s)
private

Invalidated assignment operator.

virtual void SUMOAbstractRouter< E, PedestrianTrip< E, N > >::prepare ( const E *  ,
const PedestrianTrip< E, N > *  ,
bool   
)
inlinevirtualinherited

Definition at line 81 of file SUMOAbstractRouter.h.

template<class E, class L, class N, class INTERNALROUTER>
void PedestrianRouter< E, L, N, INTERNALROUTER >::prohibit ( const std::vector< E * > &  toProhibit)
inline

Definition at line 422 of file PedestrianRouter.h.

Referenced by MSNet::getPedestrianRouter().

virtual SUMOReal SUMOAbstractRouter< E, PedestrianTrip< E, N > >::recomputeCosts ( const std::vector< const E * > &  edges,
const PedestrianTrip< E, N > *const  v,
SUMOTime  msTime 
) const
pure virtualinherited
template<class E, class L, class N, class INTERNALROUTER>
SUMOReal PedestrianRouter< E, L, N, INTERNALROUTER >::recomputeCosts ( const std::vector< const E * > &  ,
const _PedestrianTrip const,
SUMOTime   
) const
inline

Definition at line 418 of file PedestrianRouter.h.

Field Documentation


The documentation for this class was generated from the following file: