Searched refs:scanline (Results 1 - 2 of 2) sorted by relevance

/inkscape/src/libvpsc/
H A Dgenerate-constraints.cpp108 static NodeSet* getLeftNeighbours(NodeSet &scanline,Node *v) { argument
110 NodeSet::iterator i=scanline.find(v);
111 while(i--!=scanline.begin()) {
123 static NodeSet* getRightNeighbours(NodeSet &scanline,Node *v) { argument
125 NodeSet::iterator i=scanline.find(v);
126 for(++i;i!=scanline.end(); ++i) {
184 NodeSet scanline; local
190 scanline.insert(v);
193 getLeftNeighbours(scanline,v),
194 getRightNeighbours(scanline,
267 NodeSet scanline; local
[all...]
/inkscape/src/libavoid/
H A Dorthogonal.cpp257 // Find the first Node above in the scanline that is a shape edge,
274 // Find the first Node below in the scanline that is a shape edge,
291 // Mark all connector segments above in the scanline as being able
306 // Mark all connector segments below in the scanline as being able
1155 // The first pass is adding the event to the scanline, the second is for
1156 // processing the event and the third for removing it from the scanline.
1157 static void processEventVert(Router *router, NodeSet& scanline, argument
1165 std::pair<NodeSet::iterator, bool> result = scanline.insert(v);
1171 if (it != scanline.begin())
1178 if (++it != scanline
1323 processEventHori(Router * , NodeSet& scanline, SegmentListWrapper& segments, Event *e, unsigned int pass) argument
1478 NodeSet scanline; local
1630 processShiftEvent(Router * , NodeSet& scanline, ShiftSegmentList& , Event *e, size_t dim, unsigned int pass) argument
[all...]

Completed in 20 milliseconds