Searched refs:i1 (Results 1 - 6 of 6) sorted by relevance

/inkscape/src/libavoid/
H A Dgeometry.cpp309 // point index; i1 = i-1 mod n
361 // point index; i1 = i-1 mod n
362 size_t i1 = ( i + n - 1 ) % n; local
367 // if( ((P[i].y > 0) && (P[i1].y <= 0)) ||
368 // ((P[i1].y > 0) && (P[i].y <= 0)) )
370 if ((P[i].y > 0) != (P[i1].y > 0))
373 double x = (P[i].x * P[i1].y - P[i1].x * P[i].y)
374 / (P[i1].y - P[i].y);
384 // if( ((P[i].y < 0) && (P[i1]
[all...]
/inkscape/src/
H A Dmain.cpp2031 for ( int i1 = 1; i1 < numArgs; i1++ )
2033 bool wildcarded = (wcschr(parsed[i1], L'?') != NULL) || (wcschr(parsed[i1], L'*') != NULL);
2034 wildcarded &= parsed[i1][0] != L'"';
2035 wildcarded &= parsed[i1][0] != L'-';
2046 int baseLen = wcslen(parsed[i1]) + 2;
2048 wcsncpy( base, parsed[i1], baseLen );
2062 if ( WideCharToMultiByte( CP_ACP, 0, parsed[i1],
[all...]
/inkscape/src/trace/
H A Dquantize.cpp329 int i1 = childIndex(node1->rgb >> (newwidth - node1->width - 1)); local
332 node1->ref = &newnode->child[i1];
333 newnode->child[i1] = node1;
/inkscape/share/extensions/
H A Dgcodetools.py459 for i1 in range(len(csp1)) :
460 for j1 in range(1,len(csp1[i1])) :
463 d = csp_seg_bound_to_csp_seg_bound_max_min_distance(csp1[i1][j1-1],csp1[i1][j1],csp2[i2][j2-1],csp2[i2][j2])
465 if d[1] < dist_bounds[0] : return [d[1],i1,j1,1,i2,j2,1]
466 d = csp_seg_to_csp_seg_distance(csp1[i1][j1-1],csp1[i1][j1],csp2[i2][j2-1],csp2[i2][j2], dist_bounds, tolerance=tolerance)
468 dist = [d[0], i1,j1,d[1], i2,j2,d[2]]
2808 for i1 in range(len(poly1)) :
2810 vertex = poly1[i1]
[all...]
/inkscape/src/ui/tools/
H A Dgradient-tool.cpp398 gint i1 = g_slist_index(these_stops, stop1); local
399 if (i1 != -1) {
400 GSList *next_next = g_slist_nth (next_stops, i1);
/inkscape/src/ui/dialog/
H A Dspellcheck.cpp267 SPItem *i1 = SP_ITEM(a); local
270 Geom::OptRect bbox1 = i1->desktopVisualBounds();
281 // if i2 is higher only 0.2 or less times it is righter than i1, put i1 first

Completed in 31 milliseconds