Searched defs:VertInf (Results 1 - 3 of 3) sorted by relevance

/inkscape/src/libavoid/
H A Dvertices.cpp151 VertInf::VertInf(Router *router, const VertID& vid, const Point& vpoint, function in class:Avoid::VertInf
176 VertInf::~VertInf()
181 void VertInf::Reset(const VertID& vid, const Point& vpoint)
190 void VertInf::Reset(const Point& vpoint)
199 bool VertInf::orphaned(void)
205 void VertInf::removeFromGraph(const bool isConnVert)
239 bool directVis(VertInf *src, VertInf *ds
[all...]
H A Dvertices.h80 class VertInf class in namespace:Avoid
83 VertInf(Router *router, const VertID& vid, const Point& vpoint,
85 ~VertInf();
94 VertInf *lstPrev;
95 VertInf *lstNext;
96 VertInf *shPrev;
97 VertInf *shNext;
104 VertInf *pathNext;
109 bool directVis(VertInf *src, VertInf *ds
[all...]
H A Dorthogonal.cpp214 VertInf *c;
232 Node(VertInf *c, const double p)
506 static ConnDirFlags getPosVertInfDirection(VertInf *v, size_t dim)
552 PosVertInf(double p, VertInf *vI, ConnDirFlags d = ConnDirNone)
569 VertInf *vert;
581 bool operator()(const VertInf* u, const VertInf* v) const
583 // Comparator for VertSet, an ordered set of VertInf pointers.
601 typedef std::set<VertInf *, CmpVertInf> VertSet;
613 bool /*ss*/ = false, VertInf *bv
619 COLA_ASSERT(begin < finish); if (bvi) { vertInfs.insert(bvi); } if (fvi) { vertInfs.insert(fvi); } } LineSegment(const double& bf, const double& p, VertInf *bfvi = NULL) : begin(bf), finish(bf), pos(p), shapeSide(false) { if (bfvi) { vertInfs.insert(bfvi); } } bool operator<(const LineSegment& rhs) const { if (begin != rhs.begin) { return begin < rhs.begin; } if (pos != rhs.pos) { return pos < rhs.pos; } if (finish != rhs.finish) { return finish < rhs.finish; } COLA_ASSERT(shapeSide == rhs.shapeSide); return false; } bool overlaps(const LineSegment& rhs) const { if ((begin == rhs.begin) && (pos == rhs.pos) && (finish == rhs.finish)) { return true; } if (pos == rhs.pos) { if (((begin >= rhs.begin) && (begin <= rhs.finish)) || ((rhs.begin >= begin) && (rhs.begin <= finish)) ) { return true; } } return false; } void mergeVertInfs(const LineSegment& segment) { begin = std::min(begin, segment.begin); finish = std::max(finish, segment.finish); vertInfs.insert(segment.vertInfs.begin(), segment.vertInfs.end()); } VertInf *beginVertInf(void) const { if (vertInfs.empty()) { return NULL; } return *vertInfs.begin(); } VertInf *finishVertInf(void) const { if (vertInfs.empty()) { return NULL; } return *vertInfs.rbegin(); } VertInf *commitPositionX(Router *router, double posX) { VertInf *found = NULL; for (VertSet::iterator v = vertInfs.begin(); v != vertInfs.end(); ++v) { if ((*v)->point.x == posX) { found = *v; break; } } if (!found) { found = new VertInf(router, dummyOrthogID, Point(posX, pos)); vertInfs.insert(found); } return found; } void commitBegin(Router *router, VertInf *vert = NULL) { if (vert) { vertInfs.insert(vert); } if (vertInfs.empty() || ((*vertInfs.begin())->point.x != begin)) { vertInfs.insert(new VertInf(router, dummyOrthogID, Point(begin, pos))); } } void commitFinish(Router *router, VertInf *vert = NULL) { if (vert) { vertInfs.insert(vert); } if (vertInfs.empty() || ((*vertInfs.rbegin())->point.x != finish)) { vertInfs.insert(new VertInf(router, dummyOrthogID, Point(finish, pos))); } } VertSet::iterator addSegmentsUpTo(Router * , double finishPos) { VertSet::iterator firstIntersectionPt = vertInfs.end(); for (VertSet::iterator vert = vertInfs.begin(); vert != vertInfs.end(); ++vert) { if ((*vert)->point.x > finishPos) argument
[all...]

Completed in 19 milliseconds