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
|
//========================================================================
//
// Dict.cc
//
// Copyright 1996-2003 Glyph & Cog, LLC
//
//========================================================================
//========================================================================
//
// Modified under the Poppler project - http://poppler.freedesktop.org
//
// All changes made under the Poppler project to this file are licensed
// under GPL version 2 or later
//
// Copyright (C) 2005 Kristian Høgsberg <krh@redhat.com>
// Copyright (C) 2006 Krzysztof Kowalczyk <kkowalczyk@gmail.com>
// Copyright (C) 2007-2008 Julien Rebetez <julienr@svn.gnome.org>
// Copyright (C) 2008, 2010 Albert Astals Cid <aacid@kde.org>
// Copyright (C) 2010 Paweł Wiejacha <pawel.wiejacha@gmail.com>
//
// To see a description of the changes please see the Changelog file that
// came with your tarball or type make ChangeLog if you are building from git
//
//========================================================================
#include <config.h>
#ifdef USE_GCC_PRAGMAS
#pragma implementation
#endif
#include <algorithm>
#include <stddef.h>
#include <string.h>
#include "goo/gmem.h"
#include "Object.h"
#include "XRef.h"
#include "Dict.h"
//------------------------------------------------------------------------
// Dict
//------------------------------------------------------------------------
static const int SORT_LENGTH_LOWER_LIMIT = 32;
static inline bool cmpDictEntries(const DictEntry &e1, const DictEntry &e2)
{
return strcmp(e1.key, e2.key) < 0;
}
static int binarySearch(const char *key, DictEntry *entries, int length)
{
int first = 0;
int end = length - 1;
while (first <= end) {
const int middle = (first + end) / 2;
const int res = strcmp(key, entries[middle].key);
if (res == 0) {
return middle;
} else if (res < 0) {
end = middle - 1;
} else {
first = middle + 1;
}
}
return -1;
}
Dict::Dict(XRef *xrefA) {
xref = xrefA;
entries = NULL;
size = length = 0;
ref = 1;
sorted = gFalse;
}
Dict::Dict(Dict* dictA) {
xref = dictA->xref;
size = length = dictA->length;
ref = 1;
sorted = dictA->sorted;
entries = (DictEntry *)gmallocn(size, sizeof(DictEntry));
for (int i=0; i<length; i++) {
entries[i].key = strdup(dictA->entries[i].key);
dictA->entries[i].val.copy(&entries[i].val);
}
}
Dict::~Dict() {
int i;
for (i = 0; i < length; ++i) {
gfree(entries[i].key);
entries[i].val.free();
}
gfree(entries);
}
void Dict::add(char *key, Object *val) {
if (sorted) {
// We use add on very few occasions so
// virtually this will never be hit
sorted = gFalse;
}
if (length == size) {
if (length == 0) {
size = 8;
} else {
size *= 2;
}
entries = (DictEntry *)greallocn(entries, size, sizeof(DictEntry));
}
entries[length].key = key;
entries[length].val = *val;
++length;
}
inline DictEntry *Dict::find(char *key) {
if (!sorted && length >= SORT_LENGTH_LOWER_LIMIT)
{
sorted = gTrue;
std::sort(entries, entries+length, cmpDictEntries);
}
if (sorted) {
const int pos = binarySearch(key, entries, length);
if (pos != -1) {
return &entries[pos];
}
} else {
int i;
for (i = length - 1; i >=0; --i) {
if (!strcmp(key, entries[i].key))
return &entries[i];
}
}
return NULL;
}
GBool Dict::hasKey(char *key) {
return find(key) != NULL;
}
void Dict::remove(char *key) {
if (sorted) {
const int pos = binarySearch(key, entries, length);
if (pos != -1) {
length -= 1;
if (pos != length) {
memmove(&entries[pos], &entries[pos + 1], (length - pos) * sizeof(DictEntry));
}
}
} else {
int i;
bool found = false;
DictEntry tmp;
if(length == 0) return;
for(i=0; i<length; i++) {
if (!strcmp(key, entries[i].key)) {
found = true;
break;
}
}
if(!found) return;
//replace the deleted entry with the last entry
length -= 1;
tmp = entries[length];
if (i!=length) //don't copy the last entry if it is deleted
entries[i] = tmp;
}
}
void Dict::set(char *key, Object *val) {
DictEntry *e;
e = find (key);
if (e) {
e->val.free();
e->val = *val;
} else {
add (copyString(key), val);
}
}
GBool Dict::is(char *type) {
DictEntry *e;
return (e = find("Type")) && e->val.isName(type);
}
Object *Dict::lookup(char *key, Object *obj, std::set<int> *fetchOriginatorNums) {
DictEntry *e;
return (e = find(key)) ? e->val.fetch(xref, obj, fetchOriginatorNums) : obj->initNull();
}
Object *Dict::lookupNF(char *key, Object *obj) {
DictEntry *e;
return (e = find(key)) ? e->val.copy(obj) : obj->initNull();
}
GBool Dict::lookupInt(const char *key, const char *alt_key, int *value)
{
Object obj1;
GBool success = gFalse;
lookup ((char *) key, &obj1);
if (obj1.isNull () && alt_key != NULL) {
obj1.free ();
lookup ((char *) alt_key, &obj1);
}
if (obj1.isInt ()) {
*value = obj1.getInt ();
success = gTrue;
}
obj1.free ();
return success;
}
char *Dict::getKey(int i) {
return entries[i].key;
}
Object *Dict::getVal(int i, Object *obj) {
return entries[i].val.fetch(xref, obj);
}
Object *Dict::getValNF(int i, Object *obj) {
return entries[i].val.copy(obj);
}
|
