39 : myID(id), myNode(-1) {
41 for (PositionVector::const_iterator i = geom.begin(); i != geom.end(); ++i) {
58 DictType::iterator i =
myDict.find(
id);
69 DictType::iterator i =
myDict.find(
id);
95 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
122 std::vector<int> ret;
123 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
126 ret.push_back(e->
myID);
152 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
171const std::vector<int>&
#define WRITE_WARNINGF(...)
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
static bool transformCoordinate(Position &from, bool includeInBoundary=true, GeoConvHelper *from_srs=nullptr)
transforms loaded coordinates handles projections, offsets (using GeoConvHelper) and import of height...
static bool dictionary(int id, NIVissimAbstractEdge *e)
const PositionVector & getGeometry() const
static std::vector< int > getWithin(const AbstractPoly &p, double offset=0.0)
bool hasNodeCluster() const
virtual ~NIVissimAbstractEdge()
bool overlapsWith(const AbstractPoly &p, double offset=0.0) const
static void splitAndAssignToNodes()
Position crossesEdgeAtPoint(NIVissimAbstractEdge *c) const
const std::vector< int > & getDisturbances() const
void addDisturbance(int disturbance)
NIVissimAbstractEdge(int id, const PositionVector &geom)
std::map< int, NIVissimAbstractEdge * > DictType
std::vector< int > myDisturbances
bool crossesEdge(NIVissimAbstractEdge *c) const
Position getGeomPosition(double pos) const
A point in 2D or 3D with translation and scaling methods.
bool overlapsWith(const AbstractPoly &poly, double offset=0) const
Returns the information whether the given polygon overlaps with this.
double length() const
Returns the length.
Position intersectionPosition2D(const Position &p1, const Position &p2, const double withinDist=0.) const
Returns the position of the intersection.
Position positionAtOffset(double pos, double lateralOffset=0) const
Returns the position at the given length.
void extrapolate(const double val, const bool onlyFirst=false, const bool onlyLast=false)
extrapolate position vector
void push_back_noDoublePos(const Position &p)
insert in back a non double position
bool intersects(const Position &p1, const Position &p2) const
Returns the information whether this list of points interesects the given line.