28 std::string
id = ptStop->
getID();
29 PTStopsCont::iterator i =
myPTStops.find(
id);
39 std::string edgeId = i->second->getEdgeId();
43 const std::string& lane = edge->
getLaneID(0);
44 i->second->setLaneID(lane);
47 i->second->computExtent(offset, edge->
getLength());
50 WRITE_WARNING(
"Could not find corresponding edge for pt stop: " + i->second->getName() +
". Thus, it will be removed!");
double getLength() const
Returns the computed length of the edge.
NBEdge * getByID(const std::string &edgeID) const
Returns the edge with id if it exists.
PTStopsCont myPTStops
The map of names to pt stops.
EdgeVector getGeneratedFrom(const std::string &id) const
Returns the edges which have been built by splitting the edge of the given id.
The representation of a single edge during network building.
std::string getID() const
The representation of a single pt stop.
#define WRITE_WARNING(msg)
std::string getLaneID(int lane) const
get Lane ID (Secure)
Storage for edges, including some functionality operating on multiple edges.
void process(NBEdgeCont &cont)
const PositionVector & getLaneShape(int i) const
Returns the shape of the nth lane.
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
bool insert(NBPTStop *ptStop)
Inserts a node into the map.
double nearest_offset_to_point2D(const Position &p, bool perpendicular=true) const
return the nearest offest to point 2D