Searched refs:NodeSet (Results 1 - 4 of 4) sorted by relevance

/inkscape/src/libvpsc/
H A Dgenerate-constraints.cpp42 typedef set<Node*,CmpNodePos> NodeSet; typedef in namespace:vpsc
49 NodeSet *leftNeighbours, *rightNeighbours;
65 void setNeighbours(NodeSet *left, NodeSet *right) {
68 for(NodeSet::iterator i=left->begin();i!=left->end();++i) {
72 for(NodeSet::iterator i=right->begin();i!=right->end();++i) {
108 static NodeSet* getLeftNeighbours(NodeSet &scanline,Node *v) {
109 NodeSet *leftv = new NodeSet;
[all...]
/inkscape/src/libavoid/
H A Dorthogonal.cpp210 typedef std::set<Node*,CmpNodePos> NodeSet; typedef in namespace:Avoid
219 NodeSet::iterator iter;
1157 static void processEventVert(Router *router, NodeSet& scanline,
1165 std::pair<NodeSet::iterator, bool> result = scanline.insert(v);
1169 NodeSet::iterator it = v->iter;
1323 static void processEventHori(Router */*router*/, NodeSet& scanline,
1331 std::pair<NodeSet::iterator, bool> result = scanline.insert(v);
1335 NodeSet::iterator it = v->iter;
1478 NodeSet scanline;
1630 static void processShiftEvent(Router */*router*/, NodeSet
[all...]
/inkscape/src/libcola/
H A Dstraightener.cpp232 NodeSet openNodes;
243 NodeSet::iterator it=openNodes.lower_bound(v);
H A Dstraightener.h128 typedef std::set<Node*,CmpNodePos> NodeSet; typedef in namespace:straightener

Completed in 22 milliseconds