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
|
/*
* $Id: PdfPages.java,v 1.33 2003/05/02 09:01:26 blowagie Exp $
* $Name: $
*
* Copyright 1999, 2000, 2001, 2002 Bruno Lowagie
*
*
* The Original Code is 'iText, a free JAVA-PDF library'.
*
* The Initial Developer of the Original Code is Bruno Lowagie. Portions created by
* the Initial Developer are Copyright (C) 1999, 2000, 2001, 2002 by Bruno Lowagie.
* All Rights Reserved.
* Co-Developer of the code is Paulo Soares. Portions created by the Co-Developer
* are Copyright (C) 2000, 2001, 2002 by Paulo Soares. All Rights Reserved.
*
* Contributor(s): all the names of the contributors are added in the source code
* where applicable.
*
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, write to the
* Free Software Foundation, Inc., 51 Franklin St, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*
* If you didn't download this code from the following link, you should check if
* you aren't using an obsolete version:
* http://www.lowagie.com/iText/
*/
package com.lowagie.text.pdf;
import java.io.IOException;
import java.util.ArrayList;
import com.lowagie.text.DocumentException;
import com.lowagie.text.ExceptionConverter;
/**
* <CODE>PdfPages</CODE> is the PDF Pages-object.
* <P>
* The Pages of a document are accessible through a tree of nodes known as the Pages tree.
* This tree defines the ordering of the pages in the document.<BR>
* This object is described in the 'Portable Document Format Reference Manual version 1.3'
* section 6.3 (page 71-73)
*
* @see PdfPageElement
* @see PdfPage
*/
public class PdfPages {
private ArrayList pages = new ArrayList();
private ArrayList parents = new ArrayList();
private int leafSize = 10;
private PdfWriter writer;
private PdfIndirectReference topParent;
// constructors
/**
* Constructs a <CODE>PdfPages</CODE>-object.
*/
PdfPages(PdfWriter writer) {
this.writer = writer;
}
void addPage(PdfDictionary page) {
try {
if ((pages.size() % leafSize) == 0)
parents.add(writer.getPdfIndirectReference());
PdfIndirectReference parent = (PdfIndirectReference)parents.get(parents.size() - 1);
page.put(PdfName.PARENT, parent);
PdfIndirectReference current = writer.getCurrentPage();
writer.addToBody(page, current);
pages.add(current);
}
catch (Exception e) {
throw new ExceptionConverter(e);
}
}
PdfIndirectReference addPageRef(PdfIndirectReference pageRef) {
try {
if ((pages.size() % leafSize) == 0)
parents.add(writer.getPdfIndirectReference());
pages.add(pageRef);
return (PdfIndirectReference)parents.get(parents.size() - 1);
}
catch (Exception e) {
throw new ExceptionConverter(e);
}
}
// returns the top parent to include in the catalog
PdfIndirectReference writePageTree() throws IOException {
if (pages.size() == 0)
throw new IOException("The document has no pages.");
int leaf = 1;
ArrayList tParents = parents;
ArrayList tPages = pages;
ArrayList nextParents = new ArrayList();
while (true) {
leaf *= leafSize;
int stdCount = leafSize;
int rightCount = tPages.size() % leafSize;
if (rightCount == 0)
rightCount = leafSize;
for (int p = 0; p < tParents.size(); ++p) {
int count;
int thisLeaf = leaf;
if (p == tParents.size() - 1) {
count = rightCount;
thisLeaf = pages.size() % leaf;
if (thisLeaf == 0)
thisLeaf = leaf;
}
else
count = stdCount;
PdfDictionary top = new PdfDictionary(PdfName.PAGES);
top.put(PdfName.COUNT, new PdfNumber(thisLeaf));
PdfArray kids = new PdfArray();
ArrayList internal = kids.getArrayList();
internal.addAll(tPages.subList(p * stdCount, p * stdCount + count));
top.put(PdfName.KIDS, kids);
if (tParents.size() > 1) {
if ((p % leafSize) == 0)
nextParents.add(writer.getPdfIndirectReference());
top.put(PdfName.PARENT, (PdfIndirectReference)nextParents.get(p / leafSize));
}
writer.addToBody(top, (PdfIndirectReference)tParents.get(p));
}
if (tParents.size() == 1) {
topParent = (PdfIndirectReference)tParents.get(0);
return topParent;
}
tPages = tParents;
tParents = nextParents;
nextParents = new ArrayList();
}
}
PdfIndirectReference getTopParent() {
return topParent;
}
void setLinearMode(PdfIndirectReference topParent) {
if (parents.size() > 1)
throw new RuntimeException("Linear page mode can only be called with a single parent.");
if (topParent != null) {
this.topParent = topParent;
parents.clear();
parents.add(topParent);
}
leafSize = 10000000;
}
void addPage(PdfIndirectReference page) {
pages.add(page);
}
int reorderPages(int order[]) throws DocumentException {
if (order == null)
return pages.size();
if (parents.size() > 1)
throw new DocumentException("Page reordering requires a single parent in the page tree. Call PdfWriter.setLinearMode() after open.");
if (order.length != pages.size())
throw new DocumentException("Page reordering requires an array with the same size as the number of pages.");
int max = pages.size();
boolean temp[] = new boolean[max];
for (int k = 0; k < max; ++k) {
int p = order[k];
if (p < 1 || p > max)
throw new DocumentException("Page reordering requires pages between 1 and " + max + ". Found " + p + ".");
if (temp[p - 1])
throw new DocumentException("Page reordering requires no page repetition. Page " + p + " is repeated.");
temp[p - 1] = true;
}
Object copy[] = pages.toArray();
for (int k = 0; k < max; ++k) {
pages.set(k, copy[order[k] - 1]);
}
return max;
}
}
|
