Home
last modified time | relevance | path

Searched refs:numberOfElementsInPath (Results 1 – 25 of 69) sorted by relevance

123

/dports/editors/impress/impress-1.1b9/pstoedit_3.21/src/
H A Ddrvfig.cpp203 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in nrOfCurvetos()
220 unsigned int last = numberOfElementsInPath() - 1; in print_polyline_coords()
264 unsigned int last = numberOfElementsInPath()-1; in print_spline_coords_noxsplines()
339 unsigned int last = numberOfElementsInPath() - 1; in print_spline_coords1()
407 unsigned int last = numberOfElementsInPath() - 1; in print_spline_coords2()
420 if ( (n+1) != numberOfElementsInPath()) { buffer << "\t"; } in print_spline_coords2()
447 if ((n+1) != numberOfElementsInPath()) { buffer << "\t"; } in print_spline_coords2()
466 if ( (n+1) != numberOfElementsInPath()) { buffer << "\t"; } in print_spline_coords2()
474 if ( (n+1) != numberOfElementsInPath()) { buffer << "\t"; } in print_spline_coords2()
646 buffer << (int)(numberOfElementsInPath()) << "\n"; in show_path()
[all …]
H A Ddrvtgif.cpp81 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
89 if (n != numberOfElementsInPath() - 1 ) { in print_coords()
93 if ((!((n + 1) % 8)) && ((n + 1) != numberOfElementsInPath())) { in print_coords()
102 if (n != numberOfElementsInPath() - 1 ) { in print_coords()
106 if ((!((n + 1) % 8)) && ((n + 1) != numberOfElementsInPath())) { in print_coords()
312 << numberOfElementsInPath()
337 for (unsigned int i = 0 ; i < numberOfElementsInPath() ; i = i + 4) {
351 << numberOfElementsInPath()
367 for (unsigned int i = 0 ; i < numberOfElementsInPath() ; i = i + 4) {
H A Ddrvbase.cpp253 && (path1.numberOfElementsInPath == path2.numberOfElementsInPath) ) { in pathsCanBeMerged()
270 " p1 el " << path1.numberOfElementsInPath << in pathsCanBeMerged()
273 " p2 el " << path2.numberOfElementsInPath << in pathsCanBeMerged()
381 if (numberOfElementsInPath()!=5) in is_a_rectangle()
608 outputPath->numberOfElementsInPath = origCount; in dumpRearrangedPathes()
622 if (currentPath->numberOfElementsInPath == 2) { in dumpPath()
678 if (numberOfElementsInPath() > 0 ) { in dumpPath()
698 numberOfElementsInPath() << " elements" << endl; in dumpPath()
701 if (numberOfElementsInPath() > 1) { in dumpPath()
750 currentPath->numberOfElementsInPath++; in addtopath()
[all …]
H A Dsubpath.cpp69 cerr << "numberOfElementsInPath: " << p.numberOfElementsInPath << endl;
70 for(unsigned int i = 0; i < p.numberOfElementsInPath; i++)
128 if(start + num_elements == main_path.numberOfElementsInPath) in read()
399 for(i = 0; i < path_info.numberOfElementsInPath-1; i++) in read()
530 test_distance = get_min_distance(&path[numberOfElementsInPath], in rearrange()
532 tmp_num - numberOfElementsInPath, in rearrange()
545 parent_index + numberOfElementsInPath, child_index); in rearrange()
549 numberOfElementsInPath = tmp_num; in rearrange()
554 for(i = 0; i+1 < numberOfElementsInPath ; i++) in rearrange()
564 for(j = i; j+1 < numberOfElementsInPath; j++) in rearrange()
[all …]
H A Ddrvrib.cpp54 outf << "[" << numberOfElementsInPath() << "]" << endl << "["; in print_coords()
55 for (unsigned int i = 0; i < numberOfElementsInPath(); i++) { in print_coords()
59 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
H A Ddrvlwo.cpp116 p->x = new float[numberOfElementsInPath()]; // allocate a conservative amount in print_coords()
117 p->y = new float[numberOfElementsInPath()]; // allocate a conservative amount in print_coords()
122 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
H A Ddrvdxf.cpp410 ( (numberOfElementsInPath() == 2) && (pathElement(0).getType() == moveto) in show_path()
414 for(unsigned int t=1;t<numberOfElementsInPath();t++) { in show_path()
442 for(unsigned int t=0;t<numberOfElementsInPath();t++) { in show_path()
H A Ddrvrpl.cpp47 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
72 outf << numberOfElementsInPath() << " ( count )" << endl; in print_coords()
H A Ddrvsk.cpp98 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) in print_coords()
301 && first->numberOfElementsInPath == last->numberOfElementsInPath) in pathsCanBeMerged()
303 for (unsigned int i = 0; i < last->numberOfElementsInPath ; i++) in pathsCanBeMerged()
H A Ddrvbase.h189 unsigned int numberOfElementsInPath; member
211 numberOfElementsInPath(0), in PathInfo()
372 unsigned int &numberOfElementsInPath() { return outputPath->numberOfElementsInPath; } in numberOfElementsInPath() function
373 unsigned int numberOfElementsInPath() const { return outputPath->numberOfElementsInPath; } in numberOfElementsInPath() function
H A Ddrvhpgl.cpp98 const unsigned int elems = numberOfElementsInPath(); in print_coords()
167 if (numberOfElementsInPath()) { in show_path()
/dports/graphics/pstoedit/pstoedit-3.70/src/
H A Dsubpath.cpp69 cerr << "numberOfElementsInPath: " << p.numberOfElementsInPath << endl;
70 for (unsigned int i = 0; i < p.numberOfElementsInPath; i++)
149 if (start + num_elements == main_path.numberOfElementsInPath) in read()
386 for (i = 0; i < path_info.numberOfElementsInPath - 1; i++) { // ??? why -1 ??? in read()
505 [numberOfElementsInPath], in rearrange()
508 numberOfElementsInPath, in rearrange()
527 if (tmp_num > numberOfElementsInPath) { in rearrange()
531 numberOfElementsInPath = tmp_num; in rearrange()
536 {for (unsigned int i = 0; i + 1 < numberOfElementsInPath; i++) { in rearrange()
543 for (unsigned int j = i; j + 1 < numberOfElementsInPath; j++) { in rearrange()
[all …]
H A Ddrvtgif.cpp89 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
97 if (n != numberOfElementsInPath() - 1) { in print_coords()
102 && ((n + 1) != numberOfElementsInPath())) { in print_coords()
111 if (n != numberOfElementsInPath() - 1) { in print_coords()
116 && ((n + 1) != numberOfElementsInPath())) { in print_coords()
320 << "'," << numberOfElementsInPath()
336 for (unsigned int i = 0; i < numberOfElementsInPath(); i = i + 4) {
345 << "'," << numberOfElementsInPath()
352 for (unsigned int i = 0; i < numberOfElementsInPath(); i = i + 4) {
H A Ddrvbase.cpp328 && (path1.numberOfElementsInPath == path2.numberOfElementsInPath)) { in pathsCanBeMerged()
349 " PI1 el " << path1.numberOfElementsInPath << in pathsCanBeMerged()
920 outputPath->numberOfElementsInPath = origCount; in dumpRearrangedPathes()
1084 if (numberOfElementsInPath() > 0) { in dumpPath()
1108 if (numberOfElementsInPath() > 1) { in dumpPath()
1164 currentPath->numberOfElementsInPath--; in removeFromElementFromPath()
1184 numberOfElementsInPath++; in addtopath()
1187 if (numberOfElementsInPath < maxElements) { in addtopath()
1188 path[numberOfElementsInPath] = newelement; in addtopath()
1193 numberOfElementsInPath++; in addtopath()
[all …]
H A Ddrvfig.cpp228 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in nrOfCurvetos()
312 unsigned int last = numberOfElementsInPath() - 1; in print_polyline_coords()
357 unsigned int last = numberOfElementsInPath() - 1; in print_spline_coords1()
398 if ((j == 0) && (n != (numberOfElementsInPath()))) { in print_spline_coords1()
436 unsigned int last = numberOfElementsInPath() - 1; in print_spline_coords2()
449 if ((n + 1) != numberOfElementsInPath()) { in print_spline_coords2()
465 if ((n + 1) != numberOfElementsInPath()) { in print_spline_coords2()
480 if ((n + 1) != numberOfElementsInPath()) { in print_spline_coords2()
506 && ((n + 1) == numberOfElementsInPath()))) { in print_spline_coords2()
772 for (unsigned int i = 0; i < numberOfElementsInPath(); i++) { in bbox_path()
[all …]
H A Ddrvrib.cpp55 outf << "[" << numberOfElementsInPath() << "]" << endl << "["; in print_coords()
56 for (unsigned int i = 0; i < numberOfElementsInPath(); i++) { in print_coords()
60 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
H A Ddrvvtk.cpp90 polyStream << numberOfElementsInPath() << " " ; in print_coords()
91 linepoints += numberOfElementsInPath(); in print_coords()
93 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
H A Ddrvlwo.cpp125 p->x = new float[numberOfElementsInPath()]; // allocate a conservative amount in print_coords()
126 p->y = new float[numberOfElementsInPath()]; // allocate a conservative amount in print_coords()
131 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
H A Ddrvrpl.cpp48 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
73 outf << numberOfElementsInPath() << " ( count )" << endl; in print_coords()
H A Ddrvpcb1.cpp80 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
192 pcberrf << "\tPath Elements 0 to " << numberOfElementsInPath()-1 << endl; in show_path()
264 int nreip=numberOfElementsInPath(); in lineOut()
308 int nreip=numberOfElementsInPath(); in filledRectangleOut()
384 int nreip=numberOfElementsInPath(); in filledCircleOut()
H A Ddrvsk.cpp62 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
250 && first->numberOfElementsInPath == last->numberOfElementsInPath) { in pathsCanBeMerged()
251 for (unsigned int i = 0; i < last->numberOfElementsInPath; i++) { in pathsCanBeMerged()
H A Ddrvpcb2.cpp162 if (numberOfElementsInPath() < 3) in show_path()
167 numberofvalidelements = numberOfElementsInPath(); in show_path()
268 {for (unsigned int n = 1; n < numberOfElementsInPath(); n++) { in show_path()
274 {for (unsigned int n = 1; n < numberOfElementsInPath(); n++) { in show_path()
H A Ddrvnoi.cpp178 double (*points)[2] = new double[numberOfElementsInPath()][2]; in draw_polyline()
181 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) in draw_polyline()
239 double (*points)[2] = new double[numberOfElementsInPath()][2]; in draw_polygon()
245 for (unsigned n = 0; n < numberOfElementsInPath(); n++) in draw_polygon()
H A Ddrvasy.cpp117 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
126 if(next == numberOfElementsInPath()) break; in print_coords()
207 for (unsigned int n = 0; n < numberOfElementsInPath(); n++) { in print_coords()
264 n + 1 < numberOfElementsInPath() && in print_coords()
/dports/editors/impress/impress-1.1b9/src/
H A Ddrvbase.h189 unsigned int numberOfElementsInPath; member
211 numberOfElementsInPath(0), in PathInfo()
372 unsigned int &numberOfElementsInPath() { return outputPath->numberOfElementsInPath; } in numberOfElementsInPath() function
373 unsigned int numberOfElementsInPath() const { return outputPath->numberOfElementsInPath; } in numberOfElementsInPath() function

123