#include <IntermodalRouter.h>

Inheritance diagram for IntermodalRouter< E, L, N, V >:

Collaboration diagram for IntermodalRouter< E, L, N, V >:

Data Structures
struct	TripItem

Public Types
typedef IntermodalNetwork< E, L, N, V >	Network

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.

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.

bool	compute (const E from, const E to, const double departPos, const std::string &originStopID, const double arrivalPos, const std::string &stopID, const double speed, const V *const vehicle, const SVCPermissions modeSet, const SUMOTime msTime, std::vector< TripItem > &into, const double externalFactor=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.

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)

int	getCarWalkTransfer () const

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

EffortCalculator *	getExternalEffort () const

Network *	getNetwork () 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)

	IntermodalRouter (CreateNetCallback callback, const int carWalkTransfer, double taxiWait, const std::string &routingAlgorithm, const int routingMode=0, EffortCalculator *calc=nullptr)
	Constructor.

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

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)

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

void	writeNetwork (OutputDevice &dev)

void	writeWeights (OutputDevice &dev)

virtual	~IntermodalRouter ()
	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 IntermodalTrip< E, N, V >	_IntermodalTrip

typedef AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >	_InternalAStar

typedef DijkstraRouter< _IntermodalEdge, _IntermodalTrip >	_InternalDijkstra

typedef SUMOAbstractRouter< _IntermodalEdge, _IntermodalTrip >	_InternalRouter

typedef MapMatcher< E, L, N >	_MapMatcher

typedef void(*	CreateNetCallback) (IntermodalRouter< E, L, N, V > &)

Private Member Functions
void	createNet ()

	IntermodalRouter (Network net, const int carWalkTransfer, double taxiWait, const std::string &routingAlgorithm, const int routingMode, EffortCalculator calc)

bool	loopedLineTransfer (const _IntermodalEdge prev, const _IntermodalEdge cur, double prevTime, double time)

IntermodalRouter &	operator= (const IntermodalRouter &s)
	Invalidated assignment operator.

Static Private Member Functions
static double	getCombined (const _IntermodalEdge const edge, const _IntermodalTrip const trip, double time)

Private Attributes
const bool	myAmClone

CreateNetCallback	myCallback

const int	myCarWalkTransfer

EffortCalculator *const	myExternalEffort

Network *	myIntermodalNet

_InternalRouter *	myInternalRouter

long long int	myNumQueries

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	myRoutingAlgorithm

const int	myRoutingMode

const double	myTaxiWait

const std::string	myType
	the type of this router

Detailed Description

template<class E, class L, class N, class V>
class IntermodalRouter< E, L, N, V >

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

Definition at line 52 of file IntermodalRouter.h.

Member Typedef Documentation

◆ _IntermodalEdge

template<class E , class L , class N , class V >

typedef IntermodalEdge<E, L, N, V> IntermodalRouter< E, L, N, V >::_IntermodalEdge

private

Definition at line 58 of file IntermodalRouter.h.

◆ _IntermodalTrip

template<class E , class L , class N , class V >

typedef IntermodalTrip<E, N, V> IntermodalRouter< E, L, N, V >::_IntermodalTrip

private

Definition at line 59 of file IntermodalRouter.h.

◆ _InternalAStar

template<class E , class L , class N , class V >

typedef AStarRouter<_IntermodalEdge, _IntermodalTrip, _MapMatcher> IntermodalRouter< E, L, N, V >::_InternalAStar

private

Definition at line 63 of file IntermodalRouter.h.

◆ _InternalDijkstra

template<class E , class L , class N , class V >

typedef DijkstraRouter<_IntermodalEdge, _IntermodalTrip> IntermodalRouter< E, L, N, V >::_InternalDijkstra

private

Definition at line 62 of file IntermodalRouter.h.

◆ _InternalRouter

template<class E , class L , class N , class V >

typedef SUMOAbstractRouter<_IntermodalEdge, _IntermodalTrip> IntermodalRouter< E, L, N, V >::_InternalRouter

private

Definition at line 60 of file IntermodalRouter.h.

◆ _MapMatcher

template<class E , class L , class N , class V >

typedef MapMatcher<E, L, N> IntermodalRouter< E, L, N, V >::_MapMatcher

private

Definition at line 61 of file IntermodalRouter.h.

◆ CreateNetCallback

template<class E , class L , class N , class V >

typedef void(* IntermodalRouter< E, L, N, V >::CreateNetCallback) (IntermodalRouter< E, L, N, V > &)

private

Definition at line 57 of file IntermodalRouter.h.

◆ Network

template<class E , class L , class N , class V >

typedef IntermodalNetwork<E, L, N, V> IntermodalRouter< E, L, N, V >::Network

Definition at line 54 of file IntermodalRouter.h.

◆ Operation

typedef double(* SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::Operation) (const E *const, const IntermodalTrip< E, N, V > *const, double)

inherited

Type of the function that is used to retrieve the edge effort.

Definition at line 92 of file SUMOAbstractRouter.h.

Constructor & Destructor Documentation

◆ IntermodalRouter() [1/2]

template<class E , class L , class N , class V >

IntermodalRouter< E, L, N, V >::IntermodalRouter	(	CreateNetCallback	callback,
		const int	carWalkTransfer,
		double	taxiWait,
		const std::string &	routingAlgorithm,
		const int	routingMode = `0`,
		EffortCalculator *	calc = `nullptr`
	)

inline

Constructor.

Definition at line 85 of file IntermodalRouter.h.

◆ ~IntermodalRouter()

template<class E , class L , class N , class V >

virtual IntermodalRouter< E, L, N, V >::~IntermodalRouter ( )

inlinevirtual

Destructor.

Definition at line 95 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::myAmClone, IntermodalRouter< E, L, N, V >::myIntermodalNet, and IntermodalRouter< E, L, N, V >::myInternalRouter.

◆ IntermodalRouter() [2/2]

template<class E , class L , class N , class V >

IntermodalRouter< E, L, N, V >::IntermodalRouter	(	Network *	net,
		const int	carWalkTransfer,
		double	taxiWait,
		const std::string &	routingAlgorithm,
		const int	routingMode,
		EffortCalculator *	calc
	)

inlineprivate

Definition at line 281 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::createNet().

Member Function Documentation

◆ buildPathFrom()

void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::buildPathFrom	(	const typename SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::EdgeInfo *	rbegin,
		std::vector< const E * > &	edges
	)

inlineinherited

Builds the path from marked edges.

Definition at line 364 of file SUMOAbstractRouter.h.

◆ clone()

template<class E , class L , class N , class V >

SUMOAbstractRouter< E, _IntermodalTrip > * IntermodalRouter< E, L, N, V >::clone ( )

inlinevirtual

Implements SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.

Definition at line 102 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::createNet(), IntermodalRouter< E, L, N, V >::myCarWalkTransfer, IntermodalRouter< E, L, N, V >::myExternalEffort, IntermodalRouter< E, L, N, V >::myIntermodalNet, IntermodalRouter< E, L, N, V >::myRoutingAlgorithm, IntermodalRouter< E, L, N, V >::myRoutingMode, and IntermodalRouter< E, L, N, V >::myTaxiWait.

◆ compute() [1/3]

template<class E , class L , class N , class V >

bool IntermodalRouter< E, L, N, V >::compute	(	const E *	,
		const E *	,
		const _IntermodalTrip * const	,
		SUMOTime	,
		std::vector< const E * > &	,
		bool
	)

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 225 of file IntermodalRouter.h.

References TL.

◆ compute() [2/3]

template<class E , class L , class N , class V >

bool IntermodalRouter< E, L, N, V >::compute	(	const E *	from,
		const E *	to,
		const double	departPos,
		const std::string &	originStopID,
		const double	arrivalPos,
		const std::string &	stopID,
		const double	speed,
		const V *const	vehicle,
		const SVCPermissions	modeSet,
		const SUMOTime	msTime,
		std::vector< TripItem > &	into,
		const double	externalFactor = `0.`
	)

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 113 of file IntermodalRouter.h.

References IntermodalTrip< E, N, V >::arrivalPos, SUMOAbstractRouter< E, V >::compute(), IntermodalRouter< E, L, N, V >::createNet(), IntermodalTrip< E, N, V >::departPos, IntermodalNetwork< E, L, N, V >::getArrivalEdge(), IntermodalNetwork< E, L, N, V >::getDepartEdge(), SUMOAbstractRouter< E, V >::getEffort(), Named::getID(), IntermodalEdge< E, L, N, V >::getIntended(), IntermodalNetwork< E, L, N, V >::getStopEdge(), getVehicleClassNames(), MsgHandler::informf(), IntermodalRouter< E, L, N, V >::loopedLineTransfer(), SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myErrorMsgHandler, IntermodalRouter< E, L, N, V >::myExternalEffort, IntermodalRouter< E, L, N, V >::myIntermodalNet, IntermodalRouter< E, L, N, V >::myInternalRouter, EffortCalculator::output(), STEPS2TIME, TIME2STEPS, TL, toString(), and SUMOAbstractRouter< E, V >::updateViaCost().

Referenced by LIBSUMO_NAMESPACE::Simulation::findIntermodalRoute(), MSStageTrip::reroute(), and MSTriggeredRerouter::triggerRouting().

Here is the caller graph for this function:

◆ compute() [3/3]

bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::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`
	)

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.

◆ computeLooped()

bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::computeLooped	(	const E *	from,
		const E *	to,
		const IntermodalTrip< E, N, V > *const	vehicle,
		SUMOTime	msTime,
		std::vector< const E * > &	into,
		bool	silent = `false`
	)

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.

◆ createNet()

template<class E , class L , class N , class V >

void IntermodalRouter< E, L, N, V >::createNet ( )

inlineprivate

Definition at line 295 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::clone(), IntermodalRouter< E, L, N, V >::compute(), IntermodalRouter< E, L, N, V >::IntermodalRouter(), IntermodalRouter< E, L, N, V >::prohibit(), IntermodalRouter< E, L, N, V >::writeNetwork(), and IntermodalRouter< E, L, N, V >::writeWeights().

Here is the caller graph for this function:

◆ endQuery()

void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::endQuery ( int visits )

inlineinherited

Definition at line 339 of file SUMOAbstractRouter.h.

◆ getCarWalkTransfer()

template<class E , class L , class N , class V >

int IntermodalRouter< E, L, N, V >::getCarWalkTransfer ( ) const

inline

Definition at line 107 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::myCarWalkTransfer.

Referenced by MSNet::adaptIntermodalRouter(), and RONet::adaptIntermodalRouter().

Here is the caller graph for this function:

◆ getCombined()

template<class E , class L , class N , class V >

static double IntermodalRouter< E, L, N, V >::getCombined	(	const _IntermodalEdge *const	edge,
		const _IntermodalTrip *const	trip,
		double	time
	)

inlinestaticprivate

Definition at line 291 of file IntermodalRouter.h.

References IntermodalTrip< E, N, V >::calc, IntermodalTrip< E, N, V >::externalFactor, EffortCalculator::getEffort(), IntermodalEdge< E, L, N, V >::getNumericalID(), and IntermodalEdge< E, L, N, V >::getTravelTime().

Referenced by IntermodalRouter< E, L, N, V >::createNet().

Here is the caller graph for this function:

◆ getEdgeInfo()

const SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::EdgeInfo & SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::getEdgeInfo ( int index ) const

inlineinherited

Definition at line 169 of file SUMOAbstractRouter.h.

◆ getEffort()

double SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::getEffort	(	const E *const	e,
		const IntermodalTrip< E, N, V > *const	v,
		double	t
	)		const

inlineinherited

Definition at line 330 of file SUMOAbstractRouter.h.

◆ getExternalEffort()

template<class E , class L , class N , class V >

EffortCalculator * IntermodalRouter< E, L, N, V >::getExternalEffort ( ) const

inline

Definition at line 276 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::myExternalEffort.

Referenced by MSNet::adaptIntermodalRouter().

Here is the caller graph for this function:

◆ getNetwork()

template<class E , class L , class N , class V >

Network * IntermodalRouter< E, L, N, V >::getNetwork ( ) const

inline

Definition at line 272 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::myIntermodalNet.

Referenced by MSNet::adaptIntermodalRouter(), MSInsertionControl::adaptIntermodalRouter(), MSVehicleControl::adaptIntermodalRouter(), and RONet::adaptIntermodalRouter().

Here is the caller graph for this function:

◆ getTravelTime()

double SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::getTravelTime	(	const E *const	e,
		const IntermodalTrip< E, N, V > *const	v,
		const double	t,
		const double	effort
	)		const

inlineinherited

Definition at line 231 of file SUMOAbstractRouter.h.

◆ getType()

const std::string & SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::getType ( ) const

inlineinherited

Definition at line 165 of file SUMOAbstractRouter.h.

◆ init()

void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::init	(	const int	edgeID,
		const SUMOTime	msTime
	)

inlineinherited

Definition at line 136 of file SUMOAbstractRouter.h.

◆ isProhibited()

bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::isProhibited	(	const E *const	edge,
		const IntermodalTrip< E, N, V > *const	vehicle
	)		const

inlineinherited

Definition at line 227 of file SUMOAbstractRouter.h.

◆ isValid()

bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::isValid	(	const std::vector< const E * > &	edges,
		const IntermodalTrip< E, N, V > *const	v
	)		const

inlineinherited

Definition at line 260 of file SUMOAbstractRouter.h.

◆ loopedLineTransfer()

template<class E , class L , class N , class V >

bool IntermodalRouter< E, L, N, V >::loopedLineTransfer	(	const _IntermodalEdge *	prev,
		const _IntermodalEdge *	cur,
		double	prevTime,
		double	time
	)

inlineprivate

Definition at line 333 of file IntermodalRouter.h.

References IntermodalEdge< E, L, N, V >::getIntended(), IntermodalEdge< E, L, N, V >::getLine(), IntermodalNetwork< E, L, N, V >::isLooped(), and IntermodalRouter< E, L, N, V >::myIntermodalNet.

Referenced by IntermodalRouter< E, L, N, V >::compute().

Here is the caller graph for this function:

◆ operator=()

template<class E , class L , class N , class V >

IntermodalRouter & IntermodalRouter< E, L, N, V >::operator= ( const IntermodalRouter< E, L, N, V > & s )

private

Invalidated assignment operator.

◆ prohibit()

template<class E , class L , class N , class V >

void IntermodalRouter< E, L, N, V >::prohibit ( const std::vector< E * > & toProhibit )

inlinevirtual

Reimplemented from SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.

Definition at line 237 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::createNet(), IntermodalNetwork< E, L, N, V >::getBothDirections(), IntermodalNetwork< E, L, N, V >::getCarEdge(), IntermodalRouter< E, L, N, V >::myIntermodalNet, IntermodalRouter< E, L, N, V >::myInternalRouter, and SUMOAbstractRouter< E, V >::prohibit().

Referenced by MSRoutingEngine::reroute().

Here is the caller graph for this function:

◆ recomputeCosts()

virtual double SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::recomputeCosts	(	const std::vector< const E * > &	edges,
		const IntermodalTrip< E, N, V > *const	v,
		SUMOTime	msTime,
		double *	lengthp = `nullptr`
	)		const

inlinevirtualinherited

Definition at line 269 of file SUMOAbstractRouter.h.

◆ recomputeCostsPos()

double SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::recomputeCostsPos	(	const std::vector< const E * > &	edges,
		const IntermodalTrip< E, N, V > *const	v,
		double	fromPos,
		double	toPos,
		SUMOTime	msTime,
		double *	lengthp = `nullptr`
	)		const

inlineinherited

Definition at line 287 of file SUMOAbstractRouter.h.

◆ reset()

virtual void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::reset ( const IntermodalTrip< E, N, V > *const vehicle )

inlinevirtualinherited

reset internal caches, used by CHRouter

Definition at line 161 of file SUMOAbstractRouter.h.

◆ setAutoBulkMode()

void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::setAutoBulkMode ( const bool mode )

inlineinherited

Definition at line 348 of file SUMOAbstractRouter.h.

◆ setBulkMode()

template<class E , class L , class N , class V >

void IntermodalRouter< E, L, N, V >::setBulkMode ( const bool mode )

inlinevirtual

Reimplemented from SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.

Definition at line 230 of file IntermodalRouter.h.

References IntermodalRouter< E, L, N, V >::myInternalRouter, and SUMOAbstractRouter< E, V >::setBulkMode().

◆ setHint()

double SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::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
	)

inlineinherited

Definition at line 299 of file SUMOAbstractRouter.h.

◆ startQuery()

void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::startQuery ( )

inlineinherited

Definition at line 334 of file SUMOAbstractRouter.h.

◆ updateViaCost()

void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::updateViaCost	(	const E *const	prev,
		const E *const	e,
		const IntermodalTrip< E, N, V > *const	v,
		double &	time,
		double &	effort,
		double &	length
	)		const

inlineinherited

Definition at line 245 of file SUMOAbstractRouter.h.

◆ updateViaEdgeCost()

void SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::updateViaEdgeCost	(	const E *	viaEdge,
		const IntermodalTrip< E, N, V > *const	v,
		double &	time,
		double &	effort,
		double &	length
	)		const

inlineinherited

Definition at line 235 of file SUMOAbstractRouter.h.

◆ writeNetwork()

template<class E , class L , class N , class V >

void IntermodalRouter< E, L, N, V >::writeNetwork ( OutputDevice & dev )

inline

Definition at line 248 of file IntermodalRouter.h.

References OutputDevice::closeTag(), IntermodalRouter< E, L, N, V >::createNet(), IntermodalNetwork< E, L, N, V >::getAllEdges(), IntermodalRouter< E, L, N, V >::myIntermodalNet, OutputDevice::openTag(), SUMO_ATTR_ID, SUMO_ATTR_LENGTH, SUMO_ATTR_LINE, SUMO_TAG_EDGE, SVC_IGNORING, toString(), and OutputDevice::writeAttr().

Referenced by RONet::writeIntermodal().

Here is the caller graph for this function:

◆ writeWeights()

template<class E , class L , class N , class V >

void IntermodalRouter< E, L, N, V >::writeWeights ( OutputDevice & dev )

inline

Definition at line 260 of file IntermodalRouter.h.

References OutputDevice::closeTag(), IntermodalRouter< E, L, N, V >::createNet(), DEFAULT_PEDESTRIAN_SPEED, IntermodalNetwork< E, L, N, V >::getAllEdges(), IntermodalRouter< E, L, N, V >::myIntermodalNet, OutputDevice::openTag(), SUMO_ATTR_ID, SUMO_TAG_EDGE, SVC_BICYCLE, SVC_BUS, SVC_PASSENGER, and OutputDevice::writeAttr().

Referenced by RONet::writeIntermodal().

Here is the caller graph for this function:

Field Documentation

◆ myAmClean

bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myAmClean

protectedinherited

whether we are already initialized

Definition at line 390 of file SUMOAbstractRouter.h.

◆ myAmClone

template<class E , class L , class N , class V >

const bool IntermodalRouter< E, L, N, V >::myAmClone

private

Definition at line 347 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::~IntermodalRouter().

◆ myAutoBulkMode

bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myAutoBulkMode

protectedinherited

whether we are currently trying to detect bulk mode automatically

Definition at line 387 of file SUMOAbstractRouter.h.

◆ myBulkMode

bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myBulkMode

protectedinherited

whether we are currently operating several route queries in a bulk

Definition at line 384 of file SUMOAbstractRouter.h.

◆ myCallback

template<class E , class L , class N , class V >

CreateNetCallback IntermodalRouter< E, L, N, V >::myCallback

private

Definition at line 350 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::createNet().

◆ myCarWalkTransfer

template<class E , class L , class N , class V >

const int IntermodalRouter< E, L, N, V >::myCarWalkTransfer

private

Definition at line 351 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::clone(), IntermodalRouter< E, L, N, V >::createNet(), and IntermodalRouter< E, L, N, V >::getCarWalkTransfer().

◆ myEdgeInfos

std::vector<typename SUMOAbstractRouter<E, IntermodalTrip< E, N, V > >::EdgeInfo> SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myEdgeInfos

protectedinherited

The container of edge information.

Definition at line 402 of file SUMOAbstractRouter.h.

◆ myErrorMsgHandler

MsgHandler* const SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myErrorMsgHandler

protectedinherited

the handler for routing errors

Definition at line 375 of file SUMOAbstractRouter.h.

◆ myExternalEffort

template<class E , class L , class N , class V >

EffortCalculator* const IntermodalRouter< E, L, N, V >::myExternalEffort

private

Definition at line 355 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::clone(), IntermodalRouter< E, L, N, V >::compute(), IntermodalRouter< E, L, N, V >::createNet(), and IntermodalRouter< E, L, N, V >::getExternalEffort().

◆ myFound

std::vector<typename SUMOAbstractRouter<E, IntermodalTrip< E, N, V > >::EdgeInfo*> SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myFound

protectedinherited

list of visited Edges (for resetting)

Definition at line 407 of file SUMOAbstractRouter.h.

◆ myFrontierList

std::vector<typename SUMOAbstractRouter<E, IntermodalTrip< E, N, V > >::EdgeInfo*> SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myFrontierList

protectedinherited

A container for reusage of the min edge heap.

Definition at line 405 of file SUMOAbstractRouter.h.

◆ myHavePermissions

const bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myHavePermissions

protectedinherited

whether edge permissions need to be considered

Definition at line 393 of file SUMOAbstractRouter.h.

◆ myHaveRestrictions

const bool SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myHaveRestrictions

protectedinherited

whether edge restrictions need to be considered

Definition at line 396 of file SUMOAbstractRouter.h.

◆ myIntermodalNet

template<class E , class L , class N , class V >

Network* IntermodalRouter< E, L, N, V >::myIntermodalNet

private

Definition at line 349 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::clone(), IntermodalRouter< E, L, N, V >::compute(), IntermodalRouter< E, L, N, V >::createNet(), IntermodalRouter< E, L, N, V >::getNetwork(), IntermodalRouter< E, L, N, V >::loopedLineTransfer(), IntermodalRouter< E, L, N, V >::prohibit(), IntermodalRouter< E, L, N, V >::writeNetwork(), IntermodalRouter< E, L, N, V >::writeWeights(), and IntermodalRouter< E, L, N, V >::~IntermodalRouter().

◆ myInternalRouter

template<class E , class L , class N , class V >

_InternalRouter* IntermodalRouter< E, L, N, V >::myInternalRouter

private

Definition at line 348 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::compute(), IntermodalRouter< E, L, N, V >::createNet(), IntermodalRouter< E, L, N, V >::prohibit(), IntermodalRouter< E, L, N, V >::setBulkMode(), and IntermodalRouter< E, L, N, V >::~IntermodalRouter().

◆ myNumQueries

long long int SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myNumQueries

privateinherited

Definition at line 415 of file SUMOAbstractRouter.h.

◆ myOperation

Operation SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myOperation

protectedinherited

The object's operation to perform.

Definition at line 378 of file SUMOAbstractRouter.h.

◆ myProhibited

std::vector<E*> SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myProhibited

protectedinherited

The list of explicitly prohibited edges.

Definition at line 399 of file SUMOAbstractRouter.h.

◆ myQueryStartTime

long long int SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myQueryStartTime

privateinherited

the time spent querying in milliseconds

Definition at line 417 of file SUMOAbstractRouter.h.

◆ myQueryTimeSum

long long int SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myQueryTimeSum

privateinherited

Definition at line 418 of file SUMOAbstractRouter.h.

◆ myQueryVisits

long long int SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myQueryVisits

privateinherited

counters for performance logging

Definition at line 414 of file SUMOAbstractRouter.h.

◆ myRoutingAlgorithm

template<class E , class L , class N , class V >

const std::string IntermodalRouter< E, L, N, V >::myRoutingAlgorithm

private

Definition at line 353 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::clone(), and IntermodalRouter< E, L, N, V >::createNet().

◆ myRoutingMode

template<class E , class L , class N , class V >

const int IntermodalRouter< E, L, N, V >::myRoutingMode

private

Definition at line 354 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::clone(), and IntermodalRouter< E, L, N, V >::createNet().

◆ myTaxiWait

template<class E , class L , class N , class V >

const double IntermodalRouter< E, L, N, V >::myTaxiWait

private

Definition at line 352 of file IntermodalRouter.h.

Referenced by IntermodalRouter< E, L, N, V >::clone(), and IntermodalRouter< E, L, N, V >::createNet().

◆ myTTOperation

Operation SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myTTOperation

protectedinherited

The object's operation to perform for travel times.

Definition at line 381 of file SUMOAbstractRouter.h.

◆ myType

const std::string SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >::myType

privateinherited

the type of this router

Definition at line 411 of file SUMOAbstractRouter.h.

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

Data Structures

Public Types

Public Member Functions

Protected Attributes

Private Types

Private Member Functions

Static Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ _IntermodalEdge

◆ _IntermodalTrip

◆ _InternalAStar

◆ _InternalDijkstra

◆ _InternalRouter

◆ _MapMatcher

◆ CreateNetCallback

◆ Network

◆ Operation

Constructor & Destructor Documentation

◆ IntermodalRouter() [1/2]

◆ ~IntermodalRouter()

◆ IntermodalRouter() [2/2]

Member Function Documentation

◆ buildPathFrom()

◆ clone()

◆ compute() [1/3]

◆ compute() [2/3]

◆ compute() [3/3]

◆ computeLooped()

◆ createNet()

◆ endQuery()

◆ getCarWalkTransfer()

◆ getCombined()

◆ getEdgeInfo()

◆ getEffort()

◆ getExternalEffort()

◆ getNetwork()

◆ getTravelTime()

◆ getType()

◆ init()

◆ isProhibited()

◆ isValid()

◆ loopedLineTransfer()

◆ operator=()

◆ prohibit()

◆ recomputeCosts()

◆ recomputeCostsPos()

◆ reset()

◆ setAutoBulkMode()

◆ setBulkMode()

◆ setHint()

◆ startQuery()

◆ updateViaCost()

◆ updateViaEdgeCost()

◆ writeNetwork()

◆ writeWeights()

Field Documentation

◆ myAmClean

◆ myAmClone

◆ myAutoBulkMode

◆ myBulkMode

◆ myCallback

◆ myCarWalkTransfer

◆ myEdgeInfos

◆ myErrorMsgHandler

◆ myExternalEffort

◆ myFound

◆ myFrontierList

◆ myHavePermissions

◆ myHaveRestrictions

◆ myIntermodalNet

◆ myInternalRouter

◆ myNumQueries

◆ myOperation

◆ myProhibited

◆ myQueryStartTime

◆ myQueryTimeSum

◆ myQueryVisits

◆ myRoutingAlgorithm