45 NBPTLine(
const std::string&
id,
const std::string& name,
46 const std::string& type,
const std::string& ref,
int interval,
const std::string& nightService,
49 void addPTStop(std::shared_ptr<NBPTStop> pStop);
63 const std::vector<std::shared_ptr<NBPTStop> >&
getStops();
65 void addWayNode(
long long int way,
long long int node);
67 void setNumOfStops(
int numStops,
int missingBefore,
int missingAfter);
106 void replaceStop(std::shared_ptr<NBPTStop> oldStop, std::shared_ptr<NBPTStop> newStop);
109 void replaceEdge(
const std::string& edgeID,
const std::vector<NBEdge*>& replacement);
130 inline const std::vector<std::string>&
getWays()
const {
134 const std::vector<long long int>*
getWayNodes(std::string wayId);
146 std::map<std::string, std::vector<long long int> >
myWayNodes;
161 void setEdges(
const std::vector<NBEdge*>& edges);
166 const std::vector<NBEdge*>&
getRoute()
const;
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types.
Storage for edges, including some functionality operating on multiple edges.
The representation of a single edge during network building.
const std::string & getType() const
void replaceStop(std::shared_ptr< NBPTStop > oldStop, std::shared_ptr< NBPTStop > newStop)
replace the given stop
void setNumOfStops(int numStops, int missingBefore, int missingAfter)
bool isConsistent(std::vector< NBEdge * > stops) const
return whether the mentioned edges appear in that order in the route
void deleteDuplicateStops()
void replaceStops(std::vector< std::shared_ptr< NBPTStop > > stops)
const std::vector< long long int > * getWayNodes(std::string wayId)
SUMOVehicleClass myVClass
void replaceEdge(const std::string &edgeID, const std::vector< NBEdge * > &replacement)
replace the edge with the given edge list
void setName(const std::string &name)
std::map< std::string, std::vector< long long int > > myWayNodes
void setRef(const std::string &line)
std::vector< std::string > myWays
void deleteInvalidStops(const NBEdgeCont &ec, const NBPTStopCont &sc)
remove invalid stops from the line
void write(OutputDevice &device)
std::vector< NBEdge * > myRoute
void removeInvalidEdges(const NBEdgeCont &ec)
remove invalid edges from the line
const std::string & getName() const
std::vector< bool > myStopsRevised
const std::string & getLineID() const
std::vector< PTStopInfo > getStopEdges(const NBEdgeCont &ec) const
void setPeriod(int intervalS)
SUMOVehicleClass getVClass() const
const std::string & getRef() const
get line reference (not unique)
NBEdge * getRouteEnd(const NBEdgeCont &ec) const
return last valid edge of myRoute (if it doest not lie before the last stop)
const std::vector< NBEdge * > & getRoute() const
std::vector< std::shared_ptr< NBPTStop > > myPTStops
void addWayNode(long long int way, long long int node)
std::string myNightService
NBEdge * getRouteStart(const NBEdgeCont &ec) const
return first valid edge of myRoute (if it doest not lie after the first stop)
const std::vector< std::string > & getWays() const
const std::vector< std::shared_ptr< NBPTStop > > & getStops()
const EdgeVector & getEdges() const
void setRevised(std::vector< bool > stopsRevised)
void addPTStop(std::shared_ptr< NBPTStop > pStop)
void setEdges(const std::vector< NBEdge * > &edges)
Container for public transport stops during the net building process.
The representation of a single pt stop.
Static storage of an output device and its base (abstract) implementation.
get stop edges and stop ids and directional validity
PTStopInfo(NBEdge *_edge, const std::string &_stopID, double _pos, bool _revised)