forked from caj2pdf/caj2pdf
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathutils.py
278 lines (248 loc) · 7.47 KB
/
utils.py
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
import os
import sys
import struct
import PyPDF2.generic as PDF
try:
from PyPDF2 import PdfWriter, PdfReader
except ImportError:
from PyPDF2 import PdfFileWriter as PdfWriter
from PyPDF2 import PdfFileReader as PdfReader
class Node(object):
def __init__(self, data, parent=None, lchild=None, rchild=None):
self.data = data
self.parent = parent
self.lchild = lchild
self.rchild = rchild
@property
def level(self):
return self.data["level"]
@property
def index(self):
return self.data["index"]
def real_parent(self):
p = self
while True:
c = p
p = p.parent
if p.lchild == c:
return p
if p.parent is None:
return None
def prev(self):
if self.parent.rchild == self:
return self.parent
else:
return None
def next(self):
return self.rchild
def first(self):
return self.lchild
def last(self):
f = self.first()
if f is None:
return None
r = f
while r.rchild is not None:
r = r.rchild
return r
class BTree(object):
def __init__(self):
self.root = Node({"level": 0, "index": 0}, None)
self.cursor = self.root
@property
def current_level(self):
return self.cursor.level
def insert_as_lchild(self, node):
self.cursor.lchild = node
node.parent = self.cursor
self.cursor = node
def insert_as_rchild(self, node):
self.cursor.rchild = node
node.parent = self.cursor
self.cursor = node
def fnd(f, s, start=0):
fsize = f.seek(0, os.SEEK_END)
f.seek(0)
bsize = 4096
buffer = None
if start > 0:
f.seek(start)
overlap = len(s) - 1
while True:
if overlap <= f.tell() < fsize:
f.seek(f.tell() - overlap)
buffer = f.read(bsize)
if buffer:
pos = buffer.find(s)
if pos >= 0:
return f.tell() - (len(buffer) - pos)
else:
return -1
def fnd_rvrs(f, s, end=sys.maxsize):
# find target in reverse direction
fsize = f.seek(0, os.SEEK_END)
bsize = 4096
if len(s) > end:
raise SystemExit("Too large string size for search.")
f.seek(fsize - bsize)
buffer = None
size = bsize
if bsize <= end < fsize:
f.seek(end - bsize)
elif 0 < end < bsize:
size = end
f.seek(0)
overlap = len(s) - 1
s = s[::-1]
while True:
buffer = f.read(size)
if buffer:
buffer = buffer[::-1]
pos = buffer.find(s)
if pos >= 0:
return f.tell() - pos
if (2 * bsize - overlap) < f.tell():
f.seek(f.tell() - (2 * bsize - overlap))
size = bsize
elif (bsize - overlap) < f.tell():
size = f.tell() - (bsize - overlap)
f.seek(0)
else:
return -1
def fnd_all(f, s):
results = []
last_addr = -len(s)
while True:
addr = fnd(f, s, start=last_addr + len(s))
if addr != -1:
results.append(addr)
last_addr = addr
else:
return results
def fnd_unuse_no(nos1, nos2):
unuse_no = -1
for i in range(99999):
if (99999 - i not in nos1) and (99999 - i not in nos2):
unuse_no = 99999 - i
break
if unuse_no == -1:
raise SystemExit("Error on PDF objects numbering.")
return unuse_no
def make_dest(pdfw, pg):
d = PDF.ArrayObject()
try:
d.append(pdfw.pages[pg].indirect_ref)
except AttributeError:
d.append(pdfw.pages[pg].indirectRef)
d.append(PDF.NameObject("/XYZ"))
d.append(PDF.NullObject())
d.append(PDF.NullObject())
d.append(PDF.NullObject())
return d
def build_outlines_btree(toc):
tree = BTree()
for i, t in enumerate(toc):
t["page"] -= 1 # Page starts at 0.
t["index"] = i + 1
node = Node(t)
if t["level"] > tree.current_level:
tree.insert_as_lchild(node)
elif t["level"] == tree.current_level:
tree.insert_as_rchild(node)
else:
while True:
p = tree.cursor.real_parent()
tree.cursor = p
if p.level == t["level"]:
tree.insert_as_rchild(node)
break
t["node"] = node
def add_outlines(toc, filename, output):
build_outlines_btree(toc)
pdf_out = PdfWriter()
inputFile = open(filename, 'rb')
pdf_in = PdfReader(inputFile)
for p in pdf_in.pages:
try:
pdf_out.add_page(p)
except AttributeError:
pdf_out.addPage(p)
toc_num = len(toc)
if (toc_num == 0): # Just copy if toc empty
outputFile = open(output, "wb")
pdf_out.write(outputFile)
inputFile.close()
outputFile.close()
return
idoix = len(pdf_out._objects) + 1
idorefs = [PDF.IndirectObject(x + idoix, 0, pdf_out)
for x in range(toc_num + 1)]
ol = PDF.DictionaryObject()
ol.update({
PDF.NameObject("/Type"): PDF.NameObject("/Outlines"),
PDF.NameObject("/First"): idorefs[1],
PDF.NameObject("/Last"): idorefs[-1],
PDF.NameObject("/Count"): PDF.NumberObject(toc_num)
})
olitems = []
for t in toc:
oli = PDF.DictionaryObject()
oli.update({
PDF.NameObject("/Title"): PDF.TextStringObject(t["title"].decode("utf-8")),
PDF.NameObject("/Dest"): make_dest(pdf_out, t["page"])
})
opt_keys = {"real_parent": "/Parent", "prev": "/Prev",
"next": "/Next", "first": "/First", "last": "/Last"}
for k, v in opt_keys.items():
n = getattr(t["node"], k)()
if n is not None:
oli.update({
PDF.NameObject(v): idorefs[n.index]
})
olitems.append(oli)
try:
pdf_out._add_object(ol)
except AttributeError:
pdf_out._addObject(ol)
for i in olitems:
try:
pdf_out._add_object(i)
except AttributeError:
pdf_out._addObject(i)
pdf_out._root_object.update({
PDF.NameObject("/Outlines"): idorefs[0]
})
outputFile = open(output, "wb")
pdf_out.write(outputFile)
inputFile.close()
outputFile.close()
# See if the page is N * N images, N images written N times,
# by checking image sizes and within 1 < N <= 10.
# Return True and N if that's the case.
def find_redundant_images(caj, initial_offset, images_per_page):
sqrts = {
4 : 2,
9 : 3,
16 : 4,
25 : 5,
36 : 6,
49 : 7,
64 : 8,
81 : 9,
100 : 10,
}
if (not (images_per_page in sqrts.keys())):
return (False, images_per_page)
stride = sqrts[images_per_page]
sizes = []
current_offset = initial_offset
for j in range(images_per_page):
caj.seek(current_offset)
read32 = caj.read(32)
[image_type_enum, offset_to_image_data, size_of_image_data] = struct.unpack("iii", read32[0:12])
if ((j >= stride) and (size_of_image_data != sizes[j-stride])):
return (False, images_per_page)
sizes.append(size_of_image_data)
current_offset = offset_to_image_data + size_of_image_data
# if we reach here, the image sizes seen are [A, B, C ... N, ..., A, B, C ... N] exactly N times.
return (True, stride)