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
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
|
/*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.android.printspooler.util;
import android.print.PageRange;
import android.print.PrintDocumentInfo;
import android.util.Pair;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
/**
* This class contains utility functions for working with page ranges.
*/
public final class PageRangeUtils {
private static final PageRange[] ALL_PAGES_RANGE = new PageRange[] {PageRange.ALL_PAGES};
private static final Comparator<PageRange> sComparator = new Comparator<PageRange>() {
@Override
public int compare(PageRange lhs, PageRange rhs) {
return lhs.getStart() - rhs.getStart();
}
};
private PageRangeUtils() {
/* do nothing - hide constructor */
}
/**
* Gets whether page ranges contains a given page.
*
* @param pageRanges The page ranges.
* @param pageIndex The page for which to check.
* @return Whether the page is within the ranges.
*/
public static boolean contains(PageRange[] pageRanges, int pageIndex) {
final int rangeCount = pageRanges.length;
for (int i = 0; i < rangeCount; i++) {
PageRange pageRange = pageRanges[i];
if (pageRange.contains(pageIndex)) {
return true;
}
}
return false;
}
/**
* Checks whether one page range array contains another one.
*
* @param ourRanges The container page ranges.
* @param otherRanges The contained page ranges.
* @param pageCount The total number of pages.
* @return Whether the container page ranges contains the contained ones.
*/
public static boolean contains(PageRange[] ourRanges, PageRange[] otherRanges, int pageCount) {
if (ourRanges == null || otherRanges == null) {
return false;
}
if (Arrays.equals(ourRanges, ALL_PAGES_RANGE)) {
return true;
}
if (Arrays.equals(otherRanges, ALL_PAGES_RANGE)) {
otherRanges[0] = new PageRange(0, pageCount - 1);
}
ourRanges = normalize(ourRanges);
otherRanges = normalize(otherRanges);
// Note that the code below relies on the ranges being normalized
// which is they contain monotonically increasing non-intersecting
// sub-ranges whose start is less that or equal to the end.
int otherRangeIdx = 0;
final int ourRangeCount = ourRanges.length;
final int otherRangeCount = otherRanges.length;
for (int ourRangeIdx = 0; ourRangeIdx < ourRangeCount; ourRangeIdx++) {
PageRange ourRange = ourRanges[ourRangeIdx];
for (; otherRangeIdx < otherRangeCount; otherRangeIdx++) {
PageRange otherRange = otherRanges[otherRangeIdx];
if (otherRange.getStart() > ourRange.getEnd()) {
break;
}
if (otherRange.getStart() < ourRange.getStart()
|| otherRange.getEnd() > ourRange.getEnd()) {
return false;
}
}
}
return (otherRangeIdx >= otherRangeCount);
}
/**
* Normalizes a page range, which is the resulting page ranges are
* non-overlapping with the start lesser than or equal to the end
* and ordered in an ascending order.
*
* @param pageRanges The page ranges to normalize.
* @return The normalized page ranges.
*/
public static PageRange[] normalize(PageRange[] pageRanges) {
if (pageRanges == null) {
return null;
}
final int oldRangeCount = pageRanges.length;
if (oldRangeCount <= 1) {
return pageRanges;
}
Arrays.sort(pageRanges, sComparator);
int newRangeCount = 1;
for (int i = 0; i < oldRangeCount - 1; i++) {
PageRange currentRange = pageRanges[i];
PageRange nextRange = pageRanges[i + 1];
if (currentRange.getEnd() + 1 >= nextRange.getStart()) {
pageRanges[i] = null;
pageRanges[i + 1] = new PageRange(currentRange.getStart(),
Math.max(currentRange.getEnd(), nextRange.getEnd()));
} else {
newRangeCount++;
}
}
if (newRangeCount == oldRangeCount) {
return pageRanges;
}
int normalRangeIndex = 0;
PageRange[] normalRanges = new PageRange[newRangeCount];
for (int i = 0; i < oldRangeCount; i++) {
PageRange normalRange = pageRanges[i];
if (normalRange != null) {
normalRanges[normalRangeIndex] = normalRange;
normalRangeIndex++;
}
}
return normalRanges;
}
/**
* Return the next position after {@code pos} that is not a space character.
*
* @param s The string to parse
* @param pos The starting position
*
* @return The position of the first space character
*/
private static int readWhiteSpace(CharSequence s, int pos) {
while (pos < s.length() && s.charAt(pos) == ' ') {
pos++;
}
return pos;
}
/**
* Read a number from a string at a certain position.
*
* @param s The string to parse
* @param pos The starting position
*
* @return The position after the number + the number read or null if the number was not found
*/
private static Pair<Integer, Integer> readNumber(CharSequence s, int pos) {
Integer result = 0;
while (pos < s.length() && s.charAt(pos) >= '0' && s.charAt(pos) <= '9') {
// Number cannot start with 0
if (result == 0 && s.charAt(pos) == '0') {
break;
}
result = result * 10 + (s.charAt(pos) - '0');
// Abort on overflow
if (result < 0) {
break;
}
pos++;
}
// 0 is not a valid page number
if (result == 0) {
return new Pair<>(pos, null);
} else {
return new Pair<>(pos, result);
}
}
/**
* Read a single character from a string at a certain position.
*
* @param s The string to parse
* @param pos The starting position
* @param expectedChar The character to read
*
* @return The position after the character + the character read or null if the character was
* not found
*/
private static Pair<Integer, Character> readChar(CharSequence s, int pos, char expectedChar) {
if (pos < s.length() && s.charAt(pos) == expectedChar) {
return new Pair<>(pos + 1, expectedChar);
} else {
return new Pair<>(pos, null);
}
}
/**
* Read a page range character from a string at a certain position.
*
* @param s The string to parse
* @param pos The starting position
* @param maxPageNumber The highest page number to accept.
*
* @return The position after the page range + the page range read or null if the page range was
* not found
*/
private static Pair<Integer, PageRange> readRange(CharSequence s, int pos, int maxPageNumber) {
Pair<Integer, Integer> retInt;
Pair<Integer, Character> retChar;
Character comma;
if (pos == 0) {
// When we reading the first range, we do not want to have a comma
comma = ',';
} else {
retChar = readChar(s, pos, ',');
pos = retChar.first;
comma = retChar.second;
}
pos = readWhiteSpace(s, pos);
retInt = readNumber(s, pos);
pos = retInt.first;
Integer start = retInt.second;
pos = readWhiteSpace(s, pos);
retChar = readChar(s, pos, '-');
pos = retChar.first;
Character separator = retChar.second;
pos = readWhiteSpace(s, pos);
retInt = readNumber(s, pos);
pos = retInt.first;
Integer end = retInt.second;
pos = readWhiteSpace(s, pos);
if (comma != null &&
// range, maybe unbounded
((separator != null && (start != null || end != null)) ||
// single page
(separator == null && start != null && end == null))) {
if (start == null) {
start = 1;
}
if (end == null) {
if (separator == null) {
end = start;
} else {
end = maxPageNumber;
}
}
if (start <= end && start >= 1 && end <= maxPageNumber) {
return new Pair<>(pos, new PageRange(start - 1, end - 1));
}
}
return new Pair<>(pos, null);
}
/**
* Parse a string into an array of page ranges.
*
* @param s The string to parse
* @param maxPageNumber The highest page number to accept.
*
* @return The parsed ranges or null if the string could not be parsed.
*/
public static PageRange[] parsePageRanges(CharSequence s, int maxPageNumber) {
ArrayList<PageRange> ranges = new ArrayList<>();
int pos = 0;
while (pos < s.length()) {
Pair<Integer, PageRange> retRange = readRange(s, pos, maxPageNumber);
if (retRange.second == null) {
ranges.clear();
break;
}
ranges.add(retRange.second);
pos = retRange.first;
}
return PageRangeUtils.normalize(ranges.toArray(new PageRange[ranges.size()]));
}
/**
* Offsets a the start and end of page ranges with the given value.
*
* @param pageRanges The page ranges to offset.
* @param offset The offset value.
*/
public static void offset(PageRange[] pageRanges, int offset) {
if (offset == 0) {
return;
}
final int pageRangeCount = pageRanges.length;
for (int i = 0; i < pageRangeCount; i++) {
final int start = pageRanges[i].getStart() + offset;
final int end = pageRanges[i].getEnd() + offset;
pageRanges[i] = new PageRange(start, end);
}
}
/**
* Gets the number of pages in a normalized range array.
*
* @param pageRanges Normalized page ranges.
* @param layoutPageCount Page count after reported after layout pass.
* @return The page count in the ranges.
*/
public static int getNormalizedPageCount(PageRange[] pageRanges, int layoutPageCount) {
int pageCount = 0;
if (pageRanges != null) {
final int pageRangeCount = pageRanges.length;
for (int i = 0; i < pageRangeCount; i++) {
PageRange pageRange = pageRanges[i];
if (PageRange.ALL_PAGES.equals(pageRange)) {
return layoutPageCount;
}
pageCount += pageRange.getSize();
}
}
return pageCount;
}
public static PageRange asAbsoluteRange(PageRange pageRange, int pageCount) {
if (PageRange.ALL_PAGES.equals(pageRange)) {
return new PageRange(0, pageCount - 1);
}
return pageRange;
}
public static boolean isAllPages(PageRange[] pageRanges) {
final int pageRangeCount = pageRanges.length;
for (int i = 0; i < pageRangeCount; i++) {
PageRange pageRange = pageRanges[i];
if (isAllPages(pageRange)) {
return true;
}
}
return false;
}
public static boolean isAllPages(PageRange pageRange) {
return PageRange.ALL_PAGES.equals(pageRange);
}
public static boolean isAllPages(PageRange[] pageRanges, int pageCount) {
final int pageRangeCount = pageRanges.length;
for (int i = 0; i < pageRangeCount; i++) {
PageRange pageRange = pageRanges[i];
if (isAllPages(pageRange, pageCount)) {
return true;
}
}
return false;
}
public static boolean isAllPages(PageRange pageRanges, int pageCount) {
return pageRanges.getStart() == 0 && pageRanges.getEnd() == pageCount - 1;
}
/**
* Compute the pages of the file that correspond to the requested pages in the doc.
*
* @param pagesInDocRequested The requested pages, doc-indexed
* @param pagesWrittenToFile The pages in the file
* @param pageCount The number of pages in the doc
*
* @return The pages, file-indexed
*/
public static PageRange[] computeWhichPagesInFileToPrint(PageRange[] pagesInDocRequested,
PageRange[] pagesWrittenToFile, int pageCount) {
// Adjust the print job pages based on what was requested and written.
// The cases are ordered in the most expected to the least expected
// with a special case first where the app does not know the page count
// so we ask for all to be written.
if (Arrays.equals(pagesInDocRequested, ALL_PAGES_RANGE)
&& pageCount == PrintDocumentInfo.PAGE_COUNT_UNKNOWN) {
return ALL_PAGES_RANGE;
} else if (Arrays.equals(pagesWrittenToFile, pagesInDocRequested)) {
// We got a document with exactly the pages we wanted. Hence,
// the printer has to print all pages in the data.
return ALL_PAGES_RANGE;
} else if (Arrays.equals(pagesWrittenToFile, ALL_PAGES_RANGE)) {
// We requested specific pages but got all of them. Hence,
// the printer has to print only the requested pages.
return pagesInDocRequested;
} else if (PageRangeUtils.contains(pagesWrittenToFile, pagesInDocRequested, pageCount)) {
// We requested specific pages and got more but not all pages.
// Hence, we have to offset appropriately the printed pages to
// be based off the start of the written ones instead of zero.
// The written pages are always non-null and not empty.
final int offset = -pagesWrittenToFile[0].getStart();
PageRangeUtils.offset(pagesInDocRequested.clone(), offset);
return pagesInDocRequested;
} else if (Arrays.equals(pagesInDocRequested, ALL_PAGES_RANGE)
&& isAllPages(pagesWrittenToFile, pageCount)) {
// We requested all pages via the special constant and got all
// of them as an explicit enumeration. Hence, the printer has
// to print only the requested pages.
return ALL_PAGES_RANGE;
}
return null;
}
}
|