30template<
class E,
class L,
class N,
class V>
39 double traveltime = -1) :
41 numericalID, outEdge->
getEdge(),
"!access", length > 0. ? length : NUMERICAL_EPS),
47 AccessEdge(
int numericalID,
const std::string&
id,
const E* edge,
const double length = 0,
50 _IntermodalEdge(id, numericalID, edge,
"!access", length > 0. ? length : NUMERICAL_EPS),
long long int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
@ SVC_IGNORING
vehicles ignoring classes
@ SVC_TAXI
vehicle is a taxi
@ SVC_PEDESTRIAN
pedestrian
the access edge connecting different modes that is given to the internal router (SUMOAbstractRouter)
AccessEdge(int numericalID, const std::string &id, const E *edge, const double length=0, SVCPermissions modeRestriction=SVC_IGNORING, SVCPermissions vehicleRestriction=SVC_IGNORING)
const SVCPermissions myVehicleRestriction
only allow using this edge if the vehicle class matches (i.e. exiting a taxi)
bool prohibits(const IntermodalTrip< E, N, V > *const trip) const
AccessEdge(int numericalID, const _IntermodalEdge *inEdge, const _IntermodalEdge *outEdge, const double length, SVCPermissions modeRestriction=SVC_IGNORING, SVCPermissions vehicleRestriction=SVC_IGNORING, double traveltime=-1)
IntermodalEdge< E, L, N, V > _IntermodalEdge
const double myTraveltime
travel time (alternative to length)
const SVCPermissions myModeRestrictions
only allow using this edge if the modeSet matches (i.e. entering a taxi)
double getTravelTime(const IntermodalTrip< E, N, V > *const trip, double) const
the base edge type that is given to the internal router (SUMOAbstractRouter)
const E * getEdge() const
double getLength() const
required by DijkstraRouter et al for external effort computation
the "vehicle" type that is given to the internal router (SUMOAbstractRouter)
const SVCPermissions modeSet
const std::string & getID() const
Returns the id.