2
* Copyright 2004 by Paulo Soares.
4
* The contents of this file are subject to the Mozilla Public License Version 1.1
5
* (the "License"); you may not use this file except in compliance with the License.
6
* You may obtain a copy of the License at http://www.mozilla.org/MPL/
8
* Software distributed under the License is distributed on an "AS IS" basis,
9
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
10
* for the specific language governing rights and limitations under the License.
12
* The Original Code is 'iText, a free JAVA-PDF library'.
14
* The Initial Developer of the Original Code is Bruno Lowagie. Portions created by
15
* the Initial Developer are Copyright (C) 1999, 2000, 2001, 2002 by Bruno Lowagie.
16
* All Rights Reserved.
17
* Co-Developer of the code is Paulo Soares. Portions created by the Co-Developer
18
* are Copyright (C) 2000, 2001, 2002 by Paulo Soares. All Rights Reserved.
20
* Contributor(s): all the names of the contributors are added in the source code
23
* Alternatively, the contents of this file may be used under the terms of the
24
* LGPL license (the "GNU LIBRARY GENERAL PUBLIC LICENSE"), in which case the
25
* provisions of LGPL are applicable instead of those above. If you wish to
26
* allow use of your version of this file only under the terms of the LGPL
27
* License and not to allow others to use your version of this file under
28
* the MPL, indicate your decision by deleting the provisions above and
29
* replace them with the notice and other provisions required by the LGPL.
30
* If you do not delete the provisions above, a recipient may use your version
31
* of this file under either the MPL or the GNU LIBRARY GENERAL PUBLIC LICENSE.
33
* This library is free software; you can redistribute it and/or modify it
34
* under the terms of the MPL as stated above or under the terms of the GNU
35
* Library General Public License as published by the Free Software Foundation;
36
* either version 2 of the License, or any later version.
38
* This library is distributed in the hope that it will be useful, but WITHOUT
39
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
40
* FOR A PARTICULAR PURPOSE. See the GNU Library general Public License for more
43
* If you didn't download this code from the following link, you should check if
44
* you aren't using an obsolete version:
45
* http://www.lowagie.com/iText/
47
package com.lowagie.text.pdf;
49
import java.util.HashMap;
50
import java.util.Arrays;
51
import java.util.ArrayList;
52
import java.io.IOException;
53
import com.lowagie.text.StringCompare;
56
* Creates a name tree.
57
* @author Paulo Soares (psoares@consiste.pt)
59
public class PdfNameTree {
61
private static final int leafSize = 64;
62
private static final StringCompare stringCompare = new StringCompare();
65
* Creates a name tree.
66
* @param items the item of the name tree. The key is a <CODE>String</CODE>
67
* and the value is a <CODE>PdfObject</CODE>. Note that although the
68
* keys are strings only the lower byte is used and no check is made for chars
69
* with the same lower byte and different upper byte. This will generate a wrong
71
* @param writer the writer
72
* @throws IOException on error
73
* @return the dictionary with the name tree. This dictionary is the one
74
* generally pointed to by the key /Dests, for example
76
public static PdfDictionary writeTree(HashMap items, PdfWriter writer) throws IOException {
77
if (items.size() == 0)
79
String names[] = new String[items.size()];
80
names = (String[])items.keySet().toArray(names);
81
Arrays.sort(names, stringCompare);
82
if (names.length <= leafSize) {
83
PdfDictionary dic = new PdfDictionary();
84
PdfArray ar = new PdfArray();
85
for (int k = 0; k < names.length; ++k) {
86
ar.add(new PdfString(names[k], null));
87
ar.add((PdfObject)items.get(names[k]));
89
dic.put(PdfName.NAMES, ar);
93
PdfIndirectReference kids[] = new PdfIndirectReference[(names.length + leafSize - 1) / leafSize];
94
for (int k = 0; k < kids.length; ++k) {
95
int offset = k * leafSize;
96
int end = Math.min(offset + leafSize, names.length);
97
PdfDictionary dic = new PdfDictionary();
98
PdfArray arr = new PdfArray();
99
arr.add(new PdfString(names[offset], null));
100
arr.add(new PdfString(names[end - 1], null));
101
dic.put(PdfName.LIMITS, arr);
102
arr = new PdfArray();
103
for (; offset < end; ++offset) {
104
arr.add(new PdfString(names[offset], null));
105
arr.add((PdfObject)items.get(names[offset]));
107
dic.put(PdfName.NAMES, arr);
108
kids[k] = writer.addToBody(dic).getIndirectReference();
110
int top = kids.length;
112
if (top <= leafSize) {
113
PdfArray arr = new PdfArray();
114
for (int k = 0; k < top; ++k)
116
PdfDictionary dic = new PdfDictionary();
117
dic.put(PdfName.KIDS, arr);
121
int tt = (names.length + skip - 1 )/ skip;
122
for (int k = 0; k < tt; ++k) {
123
int offset = k * leafSize;
124
int end = Math.min(offset + leafSize, top);
125
PdfDictionary dic = new PdfDictionary();
126
PdfArray arr = new PdfArray();
127
arr.add(new PdfString(names[k * skip], null));
128
arr.add(new PdfString(names[Math.min((k + 1) * skip, names.length) - 1], null));
129
dic.put(PdfName.LIMITS, arr);
130
arr = new PdfArray();
131
for (; offset < end; ++offset) {
132
arr.add(kids[offset]);
134
dic.put(PdfName.KIDS, arr);
135
kids[k] = writer.addToBody(dic).getIndirectReference();
141
private static void iterateItems(PdfDictionary dic, HashMap items) {
142
PdfArray nn = (PdfArray)PdfReader.getPdfObjectRelease(dic.get(PdfName.NAMES));
144
ArrayList arr = nn.getArrayList();
145
for (int k = 0; k < arr.size(); ++k) {
146
PdfString s = (PdfString)PdfReader.getPdfObjectRelease((PdfObject)arr.get(k++));
147
items.put(PdfEncodings.convertToString(s.getBytes(), null), arr.get(k));
150
else if ((nn = (PdfArray)PdfReader.getPdfObjectRelease(dic.get(PdfName.KIDS))) != null) {
151
ArrayList arr = nn.getArrayList();
152
for (int k = 0; k < arr.size(); ++k) {
153
PdfDictionary kid = (PdfDictionary)PdfReader.getPdfObjectRelease((PdfObject)arr.get(k));
154
iterateItems(kid, items);
159
public static HashMap readTree(PdfDictionary dic) {
160
HashMap items = new HashMap();
162
iterateItems(dic, items);
b'\\ No newline at end of file'