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
|
//C- -*- C++ -*-
//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: Arrays.cpp,v 1.8 2003/11/07 22:08:20 leonb Exp $
// $Name: release_3_5_15 $
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#if NEED_GNUG_PRAGMAS
# pragma implementation
#endif
#include "Arrays.h"
#include "GException.h"
#ifdef HAVE_NAMESPACES
namespace DJVU {
# ifdef NOT_DEFINED // Just to fool emacs c++ mode
}
#endif
#endif
ArrayRep::ArrayRep(int xelsize,
void (* xdestroy)(void *, int, int),
void (* xinit1)(void *, int, int),
void (* xinit2)(void *, int, int, const void *, int, int),
void (* xcopy)(void *, int, int, const void *, int, int),
void (* xinsert)(void *, int, int, const void *, int)) :
data(0), minlo(0), maxhi(-1), lobound(0), hibound(-1),
elsize(xelsize), destroy(xdestroy), init1(xinit1),
init2(xinit2), copy(xcopy), insert(xinsert)
{
}
ArrayRep::ArrayRep(int xelsize,
void (* xdestroy)(void *, int, int),
void (* xinit1)(void *, int, int),
void (* xinit2)(void *, int, int, const void *, int, int),
void (* xcopy)(void *, int, int, const void *, int, int),
void (* xinsert)(void *, int, int, const void *, int),
int hi) : data(0), minlo(0), maxhi(-1),
lobound(0), hibound(-1), elsize(xelsize), destroy(xdestroy), init1(xinit1),
init2(xinit2), copy(xcopy), insert(xinsert)
{
resize(0, hi);
}
ArrayRep::ArrayRep(int xelsize,
void (* xdestroy)(void *, int, int),
void (* xinit1)(void *, int, int),
void (* xinit2)(void *, int, int, const void *, int, int),
void (* xcopy)(void *, int, int, const void *, int, int),
void (* xinsert)(void *, int, int, const void *, int),
int lo, int hi) : data(0), minlo(0), maxhi(-1),
lobound(0), hibound(-1), elsize(xelsize), destroy(xdestroy), init1(xinit1),
init2(xinit2), copy(xcopy), insert(xinsert)
{
resize(lo,hi);
}
ArrayRep::ArrayRep(const ArrayRep & arr) : data(0), minlo(0), maxhi(-1),
lobound(0), hibound(-1), elsize(arr.elsize), destroy(arr.destroy),
init1(arr.init1), init2(arr.init2), copy(arr.copy), insert(arr.insert)
{
resize(arr.lobound, arr.hibound);
arr.copy(data, lobound-minlo, hibound-minlo,
arr.data, arr.lobound-arr.minlo, arr.hibound-arr.minlo);
}
ArrayRep::~ArrayRep()
{
destroy(data, lobound-minlo, hibound-minlo);
operator delete(data);
data=0;
}
ArrayRep &
ArrayRep::operator= (const ArrayRep & rep)
{
if (&rep == this) return *this;
empty();
resize(rep.lobound, rep.hibound);
copy(data, lobound-minlo, hibound-minlo,
rep.data, rep.lobound-rep.minlo, rep.hibound-rep.minlo);
return *this;
}
void
ArrayRep::resize(int lo, int hi)
{
int nsize = hi - lo + 1;
// Validation
if (nsize < 0)
G_THROW( ERR_MSG("arrays.resize") );
// Destruction
if (nsize == 0)
{
destroy(data, lobound-minlo, hibound-minlo);
operator delete(data);
data = 0;
lobound = minlo = lo;
hibound = maxhi = hi;
return;
}
// Simple extension
if (lo >= minlo && hi <= maxhi)
{
init1(data, lo-minlo, lobound-1-minlo);
destroy(data, lobound-minlo, lo-1-minlo);
init1(data, hibound+1-minlo, hi-minlo);
destroy(data, hi+1-minlo, hibound-minlo);
lobound = lo;
hibound = hi;
return;
}
// General case
int nminlo = minlo;
int nmaxhi = maxhi;
if (nminlo > nmaxhi)
nminlo = nmaxhi = lo;
while (nminlo > lo) {
int incr = nmaxhi - nminlo;
nminlo -= (incr < 8 ? 8 : (incr > 32768 ? 32768 : incr));
}
while (nmaxhi < hi) {
int incr = nmaxhi - nminlo;
nmaxhi += (incr < 8 ? 8 : (incr > 32768 ? 32768 : incr));
}
// allocate
int bytesize=elsize*(nmaxhi-nminlo+1);
void * ndata;
GPBufferBase gndata(ndata,bytesize,1);
memset(ndata, 0, bytesize);
// initialize
init1(ndata, lo-nminlo, lobound-1-nminlo);
init2(ndata, lobound-nminlo, hibound-nminlo,
data, lobound-minlo, hibound-minlo);
init1(ndata, hibound+1-nminlo, hi-nminlo);
destroy(data, lobound-minlo, hibound-minlo);
// free and tqreplace
void *tmp=data;
data = ndata;
ndata=tmp;
minlo = nminlo;
maxhi = nmaxhi;
lobound = lo;
hibound = hi;
}
void
ArrayRep::shift(int disp)
{
lobound += disp;
hibound += disp;
minlo += disp;
maxhi += disp;
}
void
ArrayRep::del(int n, unsigned int howmany)
{
if (howmany == 0)
return;
if ((int)(n + howmany) > hibound +1)
G_THROW( ERR_MSG("arrays.ill_arg") );
copy(data, n-minlo, hibound-howmany-minlo,
data, n+howmany-minlo, hibound-minlo);
destroy(data, hibound+1-howmany-minlo, hibound-minlo);
hibound = hibound - howmany;
}
void
ArrayRep::ins(int n, const void * what, unsigned int howmany)
{
int nhi = hibound + howmany;
if (howmany == 0) return;
if (maxhi < nhi)
{
int nmaxhi = maxhi;
while (nmaxhi < nhi)
nmaxhi += (nmaxhi < 8 ? 8 : (nmaxhi > 32768 ? 32768 : nmaxhi));
int bytesize = elsize*(nmaxhi-minlo+1);
void *ndata;
GPBufferBase gndata(ndata,bytesize,1);
memset(ndata, 0, bytesize);
copy(ndata, lobound-minlo, hibound-minlo,
data, lobound-minlo, hibound-minlo);
destroy(data, lobound-minlo, hibound-minlo);
void *tmp=data;
data=ndata;
tmp=data;
maxhi = nmaxhi;
}
insert(data, hibound+1-minlo, n-minlo, what, howmany);
hibound=nhi;
}
#ifdef HAVE_NAMESPACES
}
# ifndef NOT_USING_DJVU_NAMESPACE
using namespace DJVU;
# endif
#endif
// ---------------------------------------
// BEGIN HACK
// ---------------------------------------
// Included here to avoid dependency
// from ByteStream.o to Arrays.o
#ifndef DO_NOT_MOVE_GET_DATA_TO_ARRAYS_CPP
#include "ByteStream.h"
#ifdef HAVE_NAMESPACES
namespace DJVU {
# ifdef NOT_DEFINED // Just to fool emacs c++ mode
}
#endif
#endif
TArray<char>
ByteStream::get_data(void)
{
const int s=size();
if(s > 0)
{
TArray<char> data(0, s-1);
readat((char*)data, s, 0);
return data;
}else
{
TArray<char> data(0, -1);
return data;
}
}
#ifdef HAVE_NAMESPACES
}
# ifndef NOT_USING_DJVU_NAMESPACE
using namespace DJVU;
# endif
#endif
#endif
// ---------------------------------------
// END HACK
// ---------------------------------------
|
