Searched refs:jx (Results 1 - 5 of 5) sorted by relevance

/inkscape/src/2geom/
H A Dsweep-bounds.cpp54 unsigned jx = open[j]; local
55 if(rs[jx][1-d].intersects(rs[ix][1-d])) {
56 pairs[jx].push_back(ix);
108 unsigned jx = open[0][j];
109 if(a[jx][1-d].intersects(b[ix][1-d])) {
110 pairs[jx].push_back(ix);
117 unsigned jx = open[1][j];
118 if(b[jx][1-d].intersects(a[ix][1-d])) {
119 pairs[ix].push_back(jx);
H A Dcrossing.h168 for(unsigned jx = 0; jx < cull[i].size(); jx++) {
169 unsigned j = cull[i][jx];
H A Dpath-intersection.cpp482 for(unsigned jx = 0; jx < cull[i].size(); jx++) {
483 unsigned j = cull[i][jx];
525 for(unsigned jx = 0; jx < cull[i].size(); jx++) {
526 unsigned j = cull[i][jx];
632 for(unsigned jx = 0; jx < cul
[all...]
H A Dtoposweep.cpp43 TopoGraph::Edge TopoGraph::remove_edge(unsigned ix, unsigned jx) { argument
46 jx %= v.degree();
47 Edge &ret = v[jx];
48 v.erase(jx);
515 void add_edge_at(TopoGraph &g, unsigned ix, boost::shared_ptr<Section> s, TopoGraph::Edge jx, bool before = true) { argument
519 v.enters.insert(v.enters.begin() + (before ? i : i + 1), jx);
525 v.exits.insert(v.exits.begin() + (before ? i : i + 1), jx);
H A Dtoposweep.h118 //removes both edges, and returns the vertices[ix][jx] one
119 Edge remove_edge(unsigned ix, unsigned jx);

Completed in 21 milliseconds