1 | /* | |
2 | * Copyright 2005 by Paulo Soares. | |
3 | * | |
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/ | |
7 | * | |
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. | |
11 | * | |
12 | * The Original Code is 'iText, a free JAVA-PDF library'. | |
13 | * | |
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. | |
19 | * | |
20 | * Contributor(s): all the names of the contributors are added in the source code | |
21 | * where applicable. | |
22 | * | |
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. | |
32 | * | |
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. | |
37 | * | |
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 | |
41 | * details. | |
42 | * | |
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/ | |
46 | */ | |
47 | package com.lowagie.text.pdf; | |
48 | ||
49 | import java.io.IOException; | |
50 | import java.util.Arrays; | |
51 | import java.util.HashMap; | |
52 | import java.util.Map; | |
53 | ||
54 | /** | |
55 | * Creates a number tree. | |
56 | * @author Paulo Soares (psoares@consiste.pt) | |
57 | */ | |
58 | public class PdfNumberTree { | |
59 | | |
60 | private static final int leafSize = 64; | |
61 | | |
62 | /** | |
63 | * Creates a number tree. | |
64 | * @param items the item of the number tree. The key is an <CODE>Integer</CODE> | |
65 | * and the value is a <CODE>PdfObject</CODE>. | |
66 | * @param writer the writer | |
67 | * @throws IOException on error | |
68 | * @return the dictionary with the number tree. | |
69 | */ | |
70 | public static PdfDictionary writeTree(Map items, PdfWriter writer) throws IOException { | |
71 |
1
1. writeTree : negated conditional → NO_COVERAGE |
if (items.isEmpty()) |
72 |
1
1. writeTree : mutated return of Object value for com/lowagie/text/pdf/PdfNumberTree::writeTree to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return null; |
73 | Integer[] numbers = new Integer[items.size()]; | |
74 | numbers = (Integer[])items.keySet().toArray(numbers); | |
75 |
1
1. writeTree : removed call to java/util/Arrays::sort → NO_COVERAGE |
Arrays.sort(numbers); |
76 |
2
1. writeTree : changed conditional boundary → NO_COVERAGE 2. writeTree : negated conditional → NO_COVERAGE |
if (numbers.length <= leafSize) { |
77 | PdfDictionary dic = new PdfDictionary(); | |
78 | PdfArray ar = new PdfArray(); | |
79 | for (Integer number : numbers) { | |
80 | ar.add(new PdfNumber(number)); | |
81 | ar.add((PdfObject) items.get(number)); | |
82 | } | |
83 |
1
1. writeTree : removed call to com/lowagie/text/pdf/PdfDictionary::put → NO_COVERAGE |
dic.put(PdfName.NUMS, ar); |
84 |
1
1. writeTree : mutated return of Object value for com/lowagie/text/pdf/PdfNumberTree::writeTree to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return dic; |
85 | } | |
86 | int skip = leafSize; | |
87 |
3
1. writeTree : Replaced integer addition with subtraction → NO_COVERAGE 2. writeTree : Replaced integer subtraction with addition → NO_COVERAGE 3. writeTree : Replaced integer division with multiplication → NO_COVERAGE |
PdfIndirectReference[] kids = new PdfIndirectReference[(numbers.length + leafSize - 1) / leafSize]; |
88 |
3
1. writeTree : changed conditional boundary → NO_COVERAGE 2. writeTree : Changed increment from 1 to -1 → NO_COVERAGE 3. writeTree : negated conditional → NO_COVERAGE |
for (int k = 0; k < kids.length; ++k) { |
89 |
1
1. writeTree : Replaced integer multiplication with division → NO_COVERAGE |
int offset = k * leafSize; |
90 |
1
1. writeTree : Replaced integer addition with subtraction → NO_COVERAGE |
int end = Math.min(offset + leafSize, numbers.length); |
91 | PdfDictionary dic = new PdfDictionary(); | |
92 | PdfArray arr = new PdfArray(); | |
93 | arr.add(new PdfNumber(numbers[offset])); | |
94 |
1
1. writeTree : Replaced integer subtraction with addition → NO_COVERAGE |
arr.add(new PdfNumber(numbers[end - 1])); |
95 |
1
1. writeTree : removed call to com/lowagie/text/pdf/PdfDictionary::put → NO_COVERAGE |
dic.put(PdfName.LIMITS, arr); |
96 | arr = new PdfArray(); | |
97 |
3
1. writeTree : changed conditional boundary → NO_COVERAGE 2. writeTree : Changed increment from 1 to -1 → NO_COVERAGE 3. writeTree : negated conditional → NO_COVERAGE |
for (; offset < end; ++offset) { |
98 | arr.add(new PdfNumber(numbers[offset])); | |
99 | arr.add((PdfObject)items.get(numbers[offset])); | |
100 | } | |
101 |
1
1. writeTree : removed call to com/lowagie/text/pdf/PdfDictionary::put → NO_COVERAGE |
dic.put(PdfName.NUMS, arr); |
102 | kids[k] = writer.addToBody(dic).getIndirectReference(); | |
103 | } | |
104 | int top = kids.length; | |
105 | while (true) { | |
106 |
2
1. writeTree : changed conditional boundary → NO_COVERAGE 2. writeTree : negated conditional → NO_COVERAGE |
if (top <= leafSize) { |
107 | PdfArray arr = new PdfArray(); | |
108 |
2
1. writeTree : changed conditional boundary → NO_COVERAGE 2. writeTree : negated conditional → NO_COVERAGE |
for (int k = 0; k < top; ++k) |
109 | arr.add(kids[k]); | |
110 | PdfDictionary dic = new PdfDictionary(); | |
111 |
1
1. writeTree : removed call to com/lowagie/text/pdf/PdfDictionary::put → NO_COVERAGE |
dic.put(PdfName.KIDS, arr); |
112 |
1
1. writeTree : mutated return of Object value for com/lowagie/text/pdf/PdfNumberTree::writeTree to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return dic; |
113 | } | |
114 |
1
1. writeTree : Replaced integer multiplication with division → NO_COVERAGE |
skip *= leafSize; |
115 |
3
1. writeTree : Replaced integer addition with subtraction → NO_COVERAGE 2. writeTree : Replaced integer subtraction with addition → NO_COVERAGE 3. writeTree : Replaced integer division with multiplication → NO_COVERAGE |
int tt = (numbers.length + skip - 1 )/ skip; |
116 |
2
1. writeTree : changed conditional boundary → NO_COVERAGE 2. writeTree : negated conditional → NO_COVERAGE |
for (int k = 0; k < tt; ++k) { |
117 |
1
1. writeTree : Replaced integer multiplication with division → NO_COVERAGE |
int offset = k * leafSize; |
118 |
1
1. writeTree : Replaced integer addition with subtraction → NO_COVERAGE |
int end = Math.min(offset + leafSize, top); |
119 | PdfDictionary dic = new PdfDictionary(); | |
120 | PdfArray arr = new PdfArray(); | |
121 |
1
1. writeTree : Replaced integer multiplication with division → NO_COVERAGE |
arr.add(new PdfNumber(numbers[k * skip])); |
122 |
3
1. writeTree : Replaced integer addition with subtraction → NO_COVERAGE 2. writeTree : Replaced integer multiplication with division → NO_COVERAGE 3. writeTree : Replaced integer subtraction with addition → NO_COVERAGE |
arr.add(new PdfNumber(numbers[Math.min((k + 1) * skip, numbers.length) - 1])); |
123 |
1
1. writeTree : removed call to com/lowagie/text/pdf/PdfDictionary::put → NO_COVERAGE |
dic.put(PdfName.LIMITS, arr); |
124 | arr = new PdfArray(); | |
125 |
3
1. writeTree : changed conditional boundary → NO_COVERAGE 2. writeTree : Changed increment from 1 to -1 → NO_COVERAGE 3. writeTree : negated conditional → NO_COVERAGE |
for (; offset < end; ++offset) { |
126 | arr.add(kids[offset]); | |
127 | } | |
128 |
1
1. writeTree : removed call to com/lowagie/text/pdf/PdfDictionary::put → NO_COVERAGE |
dic.put(PdfName.KIDS, arr); |
129 | kids[k] = writer.addToBody(dic).getIndirectReference(); | |
130 | } | |
131 | top = tt; | |
132 | } | |
133 | } | |
134 | | |
135 | private static void iterateItems(PdfDictionary dic, HashMap items) { | |
136 | PdfArray nn = (PdfArray)PdfReader.getPdfObjectRelease(dic.get(PdfName.NUMS)); | |
137 |
1
1. iterateItems : negated conditional → NO_COVERAGE |
if (nn != null) { |
138 |
2
1. iterateItems : changed conditional boundary → NO_COVERAGE 2. iterateItems : negated conditional → NO_COVERAGE |
for (int k = 0; k < nn.size(); ++k) { |
139 |
1
1. iterateItems : Changed increment from 1 to -1 → NO_COVERAGE |
PdfNumber s = (PdfNumber)PdfReader.getPdfObjectRelease(nn.getPdfObject(k++)); |
140 | items.put(s.intValue(), nn.getPdfObject(k)); | |
141 | } | |
142 | } | |
143 |
1
1. iterateItems : negated conditional → NO_COVERAGE |
else if ((nn = (PdfArray)PdfReader.getPdfObjectRelease(dic.get(PdfName.KIDS))) != null) { |
144 |
2
1. iterateItems : changed conditional boundary → NO_COVERAGE 2. iterateItems : negated conditional → NO_COVERAGE |
for (int k = 0; k < nn.size(); ++k) { |
145 | PdfDictionary kid = (PdfDictionary)PdfReader.getPdfObjectRelease(nn.getPdfObject(k)); | |
146 |
1
1. iterateItems : removed call to com/lowagie/text/pdf/PdfNumberTree::iterateItems → NO_COVERAGE |
iterateItems(kid, items); |
147 | } | |
148 | } | |
149 | } | |
150 | | |
151 | public static HashMap readTree(PdfDictionary dic) { | |
152 | HashMap items = new HashMap(); | |
153 |
1
1. readTree : negated conditional → NO_COVERAGE |
if (dic != null) |
154 |
1
1. readTree : removed call to com/lowagie/text/pdf/PdfNumberTree::iterateItems → NO_COVERAGE |
iterateItems(dic, items); |
155 |
1
1. readTree : mutated return of Object value for com/lowagie/text/pdf/PdfNumberTree::readTree to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return items; |
156 | } | |
157 | } | |
Mutations | ||
71 |
1.1 |
|
72 |
1.1 |
|
75 |
1.1 |
|
76 |
1.1 2.2 |
|
83 |
1.1 |
|
84 |
1.1 |
|
87 |
1.1 2.2 3.3 |
|
88 |
1.1 2.2 3.3 |
|
89 |
1.1 |
|
90 |
1.1 |
|
94 |
1.1 |
|
95 |
1.1 |
|
97 |
1.1 2.2 3.3 |
|
101 |
1.1 |
|
106 |
1.1 2.2 |
|
108 |
1.1 2.2 |
|
111 |
1.1 |
|
112 |
1.1 |
|
114 |
1.1 |
|
115 |
1.1 2.2 3.3 |
|
116 |
1.1 2.2 |
|
117 |
1.1 |
|
118 |
1.1 |
|
121 |
1.1 |
|
122 |
1.1 2.2 3.3 |
|
123 |
1.1 |
|
125 |
1.1 2.2 3.3 |
|
128 |
1.1 |
|
137 |
1.1 |
|
138 |
1.1 2.2 |
|
139 |
1.1 |
|
143 |
1.1 |
|
144 |
1.1 2.2 |
|
146 |
1.1 |
|
153 |
1.1 |
|
154 |
1.1 |
|
155 |
1.1 |