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
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
|
//C- -------------------------------------------------------------------
//C- DjVuLibre-3.5
//C- Copyright (c) 2002 Leon Bottou and Yann Le Cun.
//C- Copyright (c) 2001 AT&T
//C-
//C- This software is subject to, and may be distributed under, the
//C- GNU General Public License, Version 2. The license should have
//C- accompanied the software or you may obtain a copy of the license
//C- from the Free Software Foundation at http://www.fsf.org .
//C-
//C- This program is distributed in the hope that it will be useful,
//C- but WITHOUT ANY WARRANTY; without even the implied warranty of
//C- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//C- GNU General Public License for more details.
//C-
//C- DjVuLibre-3.5 is derived from the DjVu(r) Reference Library
//C- distributed by Lizardtech Software. On July 19th 2002, Lizardtech
//C- Software authorized us to replace the original DjVu(r) Reference
//C- Library notice by the following text (see doc/lizard2002.djvu):
//C-
//C- ------------------------------------------------------------------
//C- | DjVu (r) Reference Library (v. 3.5)
//C- | Copyright (c) 1999-2001 LizardTech, Inc. All Rights Reserved.
//C- | The DjVu Reference Library is protected by U.S. Pat. No.
//C- | 6,058,214 and patents pending.
//C- |
//C- | This software is subject to, and may be distributed under, the
//C- | GNU General Public License, Version 2. The license should have
//C- | accompanied the software or you may obtain a copy of the license
//C- | from the Free Software Foundation at http://www.fsf.org .
//C- |
//C- | The computer code originally released by LizardTech under this
//C- | license and unmodified by other parties is deemed "the LIZARDTECH
//C- | ORIGINAL CODE." Subject to any third party intellectual property
//C- | claims, LizardTech grants recipient a worldwide, royalty-free,
//C- | non-exclusive license to make, use, sell, or otherwise dispose of
//C- | the LIZARDTECH ORIGINAL CODE or of programs derived from the
//C- | LIZARDTECH ORIGINAL CODE in compliance with the terms of the GNU
//C- | General Public License. This grant only confers the right to
//C- | infringe patent claims underlying the LIZARDTECH ORIGINAL CODE to
//C- | the extent such infringement is reasonably necessary to enable
//C- | recipient to make, have made, practice, sell, or otherwise dispose
//C- | of the LIZARDTECH ORIGINAL CODE (or portions thereof) and not to
//C- | any greater extent that may be necessary to utilize further
//C- | modifications or combinations.
//C- |
//C- | The LIZARDTECH ORIGINAL CODE is provided "AS IS" WITHOUT WARRANTY
//C- | OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
//C- | TO ANY WARRANTY OF NON-INFRINGEMENT, OR ANY IMPLIED WARRANTY OF
//C- | MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
//C- +------------------------------------------------------------------
//
// $Id: GRect.cpp,v 1.10 2003/11/07 22:08:21 leonb Exp $
// $Name: release_3_5_15 $
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#if NEED_GNUG_PRAGMAS
# pragma implementation
#endif
// -- Implementation of class GRect and GRectMapper
// - Author: Leon Bottou, 05/1997
#include "GRect.h"
#include "GException.h"
#ifdef HAVE_NAMESPACES
namespace DJVU {
# ifdef NOT_DEFINED // Just to fool emacs c++ mode
}
#endif
#endif
// -- Local utilities
static inline int
imin(int x, int y)
{
if (x < y)
return x;
else
return y;
}
static inline int
imax(int x, int y)
{
if (x > y)
return x;
else
return y;
}
static inline void
iswap(int &x, int &y)
{
int tmp = x; x = y; y = tmp;
}
// -- Class GRect
int
operator==(const GRect & r1, const GRect & r2)
{
int isempty1 = r1.isempty();
int isempty2 = r2.isempty();
if (isempty1 || isempty2)
if (isempty1 && isempty2)
return 1;
if ( r1.xmin==r2.xmin && r1.xmax==r2.xmax
&& r1.ymin==r2.ymin && r1.ymax==r2.ymax )
return 1;
return 0;
}
int
GRect::inflate(int dx, int dy)
{
xmin -= dx;
xmax += dx;
ymin -= dy;
ymax += dy;
if (! isempty())
return 1;
xmin = ymin = xmax = ymax = 0;
return 0;
}
int
GRect::translate(int dx, int dy)
{
xmin += dx;
xmax += dx;
ymin += dy;
ymax += dy;
if (! isempty())
return 1;
xmin = ymin = xmax = ymax = 0;
return 0;
}
int
GRect::intersect(const GRect &rect1, const GRect &rect2)
{
xmin = imax(rect1.xmin, rect2.xmin);
xmax = imin(rect1.xmax, rect2.xmax);
ymin = imax(rect1.ymin, rect2.ymin);
ymax = imin(rect1.ymax, rect2.ymax);
if (! isempty())
return 1;
xmin = ymin = xmax = ymax = 0;
return 0;
}
int
GRect::recthull(const GRect &rect1, const GRect &rect2)
{
if (rect1.isempty())
{
xmin = rect2.xmin;
xmax = rect2.xmax;
ymin = rect2.ymin;
ymax = rect2.ymax;
return !isempty();
}
if (rect2.isempty())
{
xmin = rect1.xmin;
xmax = rect1.xmax;
ymin = rect1.ymin;
ymax = rect1.ymax;
return !isempty();
}
xmin = imin(rect1.xmin, rect2.xmin);
xmax = imax(rect1.xmax, rect2.xmax);
ymin = imin(rect1.ymin, rect2.ymin);
ymax = imax(rect1.ymax, rect2.ymax);
return 1;
}
int
GRect::contains(const GRect & rect) const
{
GRect tmp_rect;
tmp_rect.intersect(*this, rect);
return tmp_rect==rect;
}
void
GRect::scale(float factor)
{
xmin = (int)(((float)xmin) * factor);
ymin = (int)(((float)ymin) * factor);
xmax = (int)(((float)xmax) * factor);
ymax = (int)(((float)ymax) * factor);
}
void
GRect::scale(float xfactor, float yfactor)
{
xmin = (int)(((float)xmin) * xfactor);
ymin = (int)(((float)ymin) * yfactor);
xmax = (int)(((float)xmax) * xfactor);
ymax = (int)(((float)ymax) * yfactor);
}
// -- Class GRatio
inline
GRectMapper::GRatio::GRatio()
: p(0), q(1)
{
}
inline
GRectMapper::GRatio::GRatio(int p, int q)
: p(p), q(q)
{
if (q == 0)
G_THROW( ERR_MSG("GRect.div_zero") );
if (p == 0)
q = 1;
if (q < 0)
{
p = -p;
q = -q;
}
int gcd = 1;
int g1 = p;
int g2 = q;
if (g1 > g2)
{
gcd = g1;
g1 = g2;
g2 = gcd;
}
while (g1 > 0)
{
gcd = g1;
g1 = g2 % g1;
g2 = gcd;
}
p /= gcd;
q /= gcd;
}
#ifdef HAVE_LONG_LONG_INT
#define llint_t long long int
#else
#define llint_t long int
#endif
inline int
operator*(int n, GRectMapper::GRatio r )
{
/* [LB] -- This computation is carried out with integers and
rational numbers because it must be exact. Some lizard changed
it to double and this is wrong. I suspect they did so because
they encountered overflow issues. Let's use long long ints. */
llint_t x = (llint_t) n * (llint_t) r.p;
if (x >= 0)
return ((r.q/2 + x) / r.q);
else
return - ((r.q/2 - x) / r.q);
}
inline int
operator/(int n, GRectMapper::GRatio r )
{
/* [LB] -- See comment in operator*() above. */
llint_t x = (llint_t) n * (llint_t) r.q;
if (x >= 0)
return ((r.p/2 + x) / r.p);
else
return - ((r.p/2 - x) / r.p);
}
// -- Class GRectMapper
#define MIRRORX 1
#define MIRRORY 2
#define SWAPXY 4
GRectMapper::GRectMapper()
: rectFrom(0,0,1,1),
rectTo(0,0,1,1),
code(0)
{
}
void
GRectMapper::clear()
{
rectFrom = GRect(0,0,1,1);
rectTo = GRect(0,0,1,1);
code = 0;
}
void
GRectMapper::set_input(const GRect &rect)
{
if (rect.isempty())
G_THROW( ERR_MSG("GRect.empty_rect1") );
rectFrom = rect;
if (code & SWAPXY)
{
iswap(rectFrom.xmin, rectFrom.ymin);
iswap(rectFrom.xmax, rectFrom.ymax);
}
rw = rh = GRatio();
}
void
GRectMapper::set_output(const GRect &rect)
{
if (rect.isempty())
G_THROW( ERR_MSG("GRect.empty_rect2") );
rectTo = rect;
rw = rh = GRatio();
}
void
GRectMapper::rotate(int count)
{
int oldcode = code;
switch (count & 0x3)
{
case 1:
code ^= (code & SWAPXY) ? MIRRORY : MIRRORX;
code ^= SWAPXY;
break;
case 2:
code ^= (MIRRORX|MIRRORY);
break;
case 3:
code ^= (code & SWAPXY) ? MIRRORX : MIRRORY;
code ^= SWAPXY;
break;
}
if ((oldcode ^ code) & SWAPXY)
{
iswap(rectFrom.xmin, rectFrom.ymin);
iswap(rectFrom.xmax, rectFrom.ymax);
rw = rh = GRatio();
}
}
void
GRectMapper::mirrorx()
{
code ^= MIRRORX;
}
void
GRectMapper::mirrory()
{
code ^= MIRRORY;
}
void
GRectMapper::precalc()
{
if (rectTo.isempty() || rectFrom.isempty())
G_THROW( ERR_MSG("GRect.empty_rect3") );
rw = GRatio(rectTo.width(), rectFrom.width());
rh = GRatio(rectTo.height(), rectFrom.height());
}
void
GRectMapper::map(int &x, int &y)
{
int mx = x;
int my = y;
// precalc
if (! (rw.p && rh.p))
precalc();
// swap and mirror
if (code & SWAPXY)
iswap(mx,my);
if (code & MIRRORX)
mx = rectFrom.xmin + rectFrom.xmax - mx;
if (code & MIRRORY)
my = rectFrom.ymin + rectFrom.ymax - my;
// scale and translate
x = rectTo.xmin + (mx - rectFrom.xmin) * rw;
y = rectTo.ymin + (my - rectFrom.ymin) * rh;
}
void
GRectMapper::unmap(int &x, int &y)
{
// precalc
if (! (rw.p && rh.p))
precalc();
// scale and translate
int mx = rectFrom.xmin + (x - rectTo.xmin) / rw;
int my = rectFrom.ymin + (y - rectTo.ymin) / rh;
// mirror and swap
if (code & MIRRORX)
mx = rectFrom.xmin + rectFrom.xmax - mx;
if (code & MIRRORY)
my = rectFrom.ymin + rectFrom.ymax - my;
if (code & SWAPXY)
iswap(mx,my);
x = mx;
y = my;
}
void
GRectMapper::map(GRect &rect)
{
map(rect.xmin, rect.ymin);
map(rect.xmax, rect.ymax);
if (rect.xmin >= rect.xmax)
iswap(rect.xmin, rect.xmax);
if (rect.ymin >= rect.ymax)
iswap(rect.ymin, rect.ymax);
}
void
GRectMapper::unmap(GRect &rect)
{
unmap(rect.xmin, rect.ymin);
unmap(rect.xmax, rect.ymax);
if (rect.xmin >= rect.xmax)
iswap(rect.xmin, rect.xmax);
if (rect.ymin >= rect.ymax)
iswap(rect.ymin, rect.ymax);
}
GRect
GRectMapper::get_input()
{
return rectFrom;
}
GRect
GRectMapper::get_output()
{
return rectTo;
}
#ifdef HAVE_NAMESPACES
}
# ifndef NOT_USING_DJVU_NAMESPACE
using namespace DJVU;
# endif
#endif
|