dnrops
/
gimp
mirror of https://github.com/GNOME/gimp.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

plug-ins/sel2path/fit.c 

Tue Jul 20 00:29:41 BST 1999 Andy Thomas <alt@gimp.org>

	* plug-ins/sel2path/fit.c

	Corrected some non-portable code problems.
This commit is contained in:
BST 1999 Andy Thomas 1999-07-19 23:38:21 +00:00 committed by Andy Thomas
parent 6c28319bc3
commit 17288aca6a
2 changed files with 20 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
ChangeLog
View File

@ -1,4 +1,10 @@
Tue Jul 20 00:29:41 BST 1999 Andy Thomas <alt@gimp.org>
* plug-ins/sel2path/fit.c
Corrected some non-portable code problems.
Mon Jul 19 21:33:56 BST 1999 Andy Thomas <alt@gimp.org>
* app/indicator_area.c

19
plug-ins/sel2path/fit.c
View File

@ -648,8 +648,10 @@ find_vectors (unsigned test_index, pixel_outline_type outline,
unsigned n_done;
coordinate_type candidate = O_COORDINATE (outline, test_index);
*in = (vector_type) { 0.0, 0.0 };
*out = (vector_type) { 0.0, 0.0 };
in->dx = 0.0;
in->dy = 0.0;
out->dx = 0.0;
out->dy = 0.0;
/* Add up the differences from p of the `corner_surround' points
before p. */
@ -996,7 +998,10 @@ find_curve_vectors (unsigned test_index, curve_type curve,
/* Add up the differences from p of the `surround' points
before p. */
*in = (vector_type) { 0.0, 0.0 };
in->dx = 0.0;
in->dy = 0.0;
for (i = CURVE_PREV (curve, test_index), n_done = 0;
i >= 0 && n_done < surround; /* Do not wrap around. */
i = CURVE_PREV (curve, i), n_done++)
@ -1005,7 +1010,9 @@ find_curve_vectors (unsigned test_index, curve_type curve,
/* And the points after p. Don't use more points after p than we
ended up with before it. */
*out = (vector_type) { 0.0, 0.0 };
out->dx = 0.0;
out->dy = 0.0;
for (i = CURVE_NEXT (curve, test_index), n_done = 0;
i < CURVE_LENGTH (curve) && n_done < surround && n_done < in_count;
i = CURVE_NEXT (curve, i), n_done++)
@ -1017,7 +1024,9 @@ find_curve_vectors (unsigned test_index, curve_type curve,
but for this few of points, efficiency doesn't matter.) */
if (out_count < in_count)
{
*in = (vector_type) { 0.0, 0.0 };
in->dx = 0.0;
in->dy = 0.0;
for (i = CURVE_PREV (curve, test_index), n_done = 0;
i >= 0 && n_done < out_count;
i = CURVE_PREV (curve, i), n_done++)