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

/inkscape/src/livarot/
H A DAVL.h73 // startNode is the node where the rebalancing starts; rebalancing then moves up the tree to the root
76 int Remove(AVLTree * &racine, AVLTree * &startNode, int &diff);
H A DAVL.cpp659 AVLTree *startNode = NULL; local
661 int res = Remove (racine, startNode, remDiff);
662 if (res == avl_no_err && rebalance && startNode)
663 res = startNode->RestoreBalances (remDiff, racine);
668 AVLTree::Remove (AVLTree * &racine, AVLTree * &startNode, int &diff) argument
686 startNode = newMe;
702 startNode = oParent;
730 startNode = parent;
753 startNode = parent;
776 startNode
[all...]
/inkscape/src/libcola/
H A Dstraightener.h35 unsigned startNode, endNode; member in struct:straightener::Edge
41 : id(id), openInd(0), startNode(start), endNode(end), route(route)
54 if(startNode==n||endNode==n) return true;
H A Dstraightener.cpp71 //printf("Edge::nodePath: (%d,%d) dummyNodes:%d\n",startNode,endNode,ds.size());
73 path.push_back(startNode);
146 //cerr << "edge(intersections="<<bs.size()<<":("<<e->startNode<<","<<e->endNode<<"))"<<endl;
158 if(e->startNode==v->id||e->endNode==v->id) continue;
159 //if(l!=NULL&&(e->startNode==l->id||e->endNode==l->id)) continue;
160 //cerr << "edge("<<e->startNode<<","<<e->endNode<<",pts="<<e->pts<<")"<<endl;
179 if(e->startNode==v->id||e->endNode==v->id) continue;
180 //if(r!=NULL&&(e->startNode==r->id||e->endNode==r->id)) continue;
181 //cerr << "edge("<<e->startNode<<","<<e->endNode<<",pts="<<e->pts<<")"<<endl;
343 //printf("EdgeOpen@%f,eid=%d,(u,v)=(%d,%d)\n", e->pos,e->e->id,e->e->startNode,
[all...]

Completed in 63 milliseconds