1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
|
/* curve.c: operations on the lists of pixels and lists of curves.
The code was partially derived from limn.
Copyright (C) 1992 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif /* Def: HAVE_CONFIG_H */
#include "logreport.h"
#include "curve.h"
#include "xstd.h"
static at_real_coord int_to_real_coord(at_coord);
/* Return an entirely empty curve. */
curve_type new_curve(void)
{
curve_type curve;
XMALLOC(curve, sizeof(struct curve));
curve->point_list = NULL;
CURVE_LENGTH(curve) = 0;
CURVE_CYCLIC(curve) = FALSE;
CURVE_START_TANGENT(curve) = CURVE_END_TANGENT(curve) = NULL;
PREVIOUS_CURVE(curve) = NEXT_CURVE(curve) = NULL;
return curve;
}
/* Don't copy the points or tangents, but copy everything else. */
curve_type copy_most_of_curve(curve_type old_curve)
{
curve_type curve = new_curve();
CURVE_CYCLIC(curve) = CURVE_CYCLIC(old_curve);
PREVIOUS_CURVE(curve) = PREVIOUS_CURVE(old_curve);
NEXT_CURVE(curve) = NEXT_CURVE(old_curve);
return curve;
}
/* The length of CURVE will be zero if we ended up not being able to fit
it (which in turn implies a problem elsewhere in the program, but at
any rate, we shouldn't try here to free the nonexistent curve). */
void free_curve(curve_type curve)
{
if (CURVE_LENGTH(curve) > 0)
free(curve->point_list);
if (CURVE_START_TANGENT(curve))
free(CURVE_START_TANGENT(curve));
if (CURVE_END_TANGENT(curve))
free(CURVE_END_TANGENT(curve));
}
void append_pixel(curve_type curve, at_coord coord)
{
append_point(curve, int_to_real_coord(coord));
}
void append_point(curve_type curve, at_real_coord coord)
{
CURVE_LENGTH(curve)++;
XREALLOC(curve->point_list, CURVE_LENGTH(curve) * sizeof(point_type));
LAST_CURVE_POINT(curve) = coord;
/* The t value does not need to be set. */
}
/* Print a curve in human-readable form. It turns out we never care
about most of the points on the curve, and so it is pointless to
print them all out umpteen times. What matters is that we have some
from the end and some from the beginning. */
#define NUM_TO_PRINT 3
#define LOG_CURVE_POINT(c, p, print_t) \
do \
{ \
LOG ("(%.3f,%.3f)", CURVE_POINT (c, p).x, CURVE_POINT (c, p).y); \
if (print_t) \
LOG ("/%.2f", CURVE_T (c, p)); \
} \
while (0)
void log_curve(curve_type curve, gboolean print_t)
{
unsigned this_point;
LOG("curve id = %lx:\n", (unsigned long)curve);
LOG(" length = %u.\n", CURVE_LENGTH(curve));
if (CURVE_CYCLIC(curve))
LOG(" cyclic.\n");
/* It should suffice to check just one of the tangents for being null
-- either they both should be, or neither should be. */
if (CURVE_START_TANGENT(curve) != NULL)
LOG(" tangents = (%.3f,%.3f) & (%.3f,%.3f).\n", CURVE_START_TANGENT(curve)->dx, CURVE_START_TANGENT(curve)->dy, CURVE_END_TANGENT(curve)->dx, CURVE_END_TANGENT(curve)->dy);
LOG(" ");
/* If the curve is short enough, don't use ellipses. */
if (CURVE_LENGTH(curve) <= NUM_TO_PRINT * 2) {
for (this_point = 0; this_point < CURVE_LENGTH(curve); this_point++) {
LOG_CURVE_POINT(curve, this_point, print_t);
LOG(" ");
if (this_point != CURVE_LENGTH(curve) - 1 && (this_point + 1) % NUM_TO_PRINT == 0)
LOG("\n ");
}
} else {
for (this_point = 0; this_point < NUM_TO_PRINT && this_point < CURVE_LENGTH(curve); this_point++) {
LOG_CURVE_POINT(curve, this_point, print_t);
LOG(" ");
}
LOG("...\n ...");
for (this_point = CURVE_LENGTH(curve) - NUM_TO_PRINT; this_point < CURVE_LENGTH(curve); this_point++) {
LOG(" ");
LOG_CURVE_POINT(curve, this_point, print_t);
}
}
LOG(".\n");
}
/* Like `log_curve', but write the whole thing. */
void log_entire_curve(curve_type curve)
{
unsigned this_point;
LOG("curve id = %lx:\n", (unsigned long)curve);
LOG(" length = %u.\n", CURVE_LENGTH(curve));
if (CURVE_CYCLIC(curve))
LOG(" cyclic.\n");
/* It should suffice to check just one of the tangents for being null
-- either they both should be, or neither should be. */
if (CURVE_START_TANGENT(curve) != NULL)
LOG(" tangents = (%.3f,%.3f) & (%.3f,%.3f).\n", CURVE_START_TANGENT(curve)->dx, CURVE_START_TANGENT(curve)->dy, CURVE_END_TANGENT(curve)->dx, CURVE_END_TANGENT(curve)->dy);
LOG(" ");
for (this_point = 0; this_point < CURVE_LENGTH(curve); this_point++) {
LOG(" ");
LOG_CURVE_POINT(curve, this_point, TRUE);
/* Compiler warning `Condition is always true' can be ignored */
}
LOG(".\n");
}
/* Return an initialized but empty curve list. */
curve_list_type new_curve_list(void)
{
curve_list_type curve_list;
curve_list.length = 0;
curve_list.data = NULL;
return curve_list;
}
/* Free a curve list and all the curves it contains. */
void free_curve_list(curve_list_type * curve_list)
{
unsigned this_curve;
for (this_curve = 0; this_curve < curve_list->length; this_curve++) {
free_curve(curve_list->data[this_curve]);
free(curve_list->data[this_curve]);
}
/* If the character was empty, it won't have any curves. */
free(curve_list->data);
}
/* Add an element to a curve list. */
void append_curve(curve_list_type * curve_list, curve_type curve)
{
curve_list->length++;
XREALLOC(curve_list->data, curve_list->length * sizeof(curve_type));
curve_list->data[curve_list->length - 1] = curve;
}
/* Return an initialized but empty curve list array. */
curve_list_array_type new_curve_list_array(void)
{
curve_list_array_type curve_list_array;
CURVE_LIST_ARRAY_LENGTH(curve_list_array) = 0;
curve_list_array.data = NULL;
return curve_list_array;
}
/* Free a curve list array and all the curve lists it contains. */
void free_curve_list_array(curve_list_array_type * curve_list_array, at_progress_func notify_progress, gpointer client_data)
{
unsigned this_list;
for (this_list = 0; this_list < CURVE_LIST_ARRAY_LENGTH(*curve_list_array); this_list++) {
if (notify_progress)
notify_progress(((gfloat) this_list) / (CURVE_LIST_ARRAY_LENGTH(*curve_list_array) * (gfloat) 3.0) + (gfloat) 0.666, client_data);
free_curve_list(&CURVE_LIST_ARRAY_ELT(*curve_list_array, this_list));
}
/* If the character was empty, it won't have any curves. */
free(curve_list_array->data);
}
/* Add an element to a curve list array. */
void append_curve_list(curve_list_array_type * curve_list_array, curve_list_type curve_list)
{
CURVE_LIST_ARRAY_LENGTH(*curve_list_array)++;
XREALLOC(curve_list_array->data, CURVE_LIST_ARRAY_LENGTH(*curve_list_array) * sizeof(curve_list_type));
LAST_CURVE_LIST_ARRAY_ELT(*curve_list_array) = curve_list;
}
/* Turn an integer point into a real one. */
static at_real_coord int_to_real_coord(at_coord int_coord)
{
at_real_coord real_coord;
real_coord.x = int_coord.x;
real_coord.y = int_coord.y;
real_coord.z = 0.0;
return real_coord;
}
|
