Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* ===========================================
* Java Pdf Extraction Decoding Access Library
* ===========================================
*
* Project Info: http://www.idrsolutions.com
* Help section for developers at http://www.idrsolutions.com/support/
*
* (C) Copyright 1997-2017 IDRsolutions and Contributors.
*
* This file is part of JPedal/JPDF2HTML5
*
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* ---------------
* StreamReaderUtils.java
* ---------------
*/
package org.jpedal.io.types;
import org.jpedal.exception.PdfSecurityException;
import org.jpedal.io.security.DecryptionFactory;
import org.jpedal.utils.LogWriter;
import org.jpedal.utils.NumberUtils;
/**
*
*/
public class StreamReaderUtils {
static boolean handleIndirect(final byte[] raw, int aa) {
boolean indirect = true;
//find next value and make sure not /
final int length = raw.length;
while (raw[aa] != 93) {
aa++;
//allow for ref (ie 7 0 R)
if (aa >= length) {
break;
}
if (raw[aa] == 'R' && (raw[aa - 1] == 32 || raw[aa - 1] == 10 || raw[aa - 1] == 13)) {
break;
} else if (raw[aa] == '>' && raw[aa - 1] == '>') {
indirect = false;
break;
} else if (raw[aa] == 47) {
indirect = false;
break;
}
}
return indirect;
}
public static int findDictionaryEnd(int jj, final byte[] raw, final int length) {
int keyLength = 0;
while (true) { //get key up to space or [ or / or ( or < or carriage return
if (raw[jj] == 32 || raw[jj] == 13 || raw[jj] == 9 || raw[jj] == 10 || raw[jj] == 91 ||
raw[jj] == 47 || raw[jj] == 40 || raw[jj] == 60 || raw[jj] == 62) {
break;
}
jj++;
keyLength++;
if (jj == length) {
break;
}
}
return keyLength;
}
public static int skipToEndOfRef(final byte[] raw, int i) {
byte b = raw[i];
while (b != 10 && b != 13 && b != 32 && b != 47 && b != 60 && b != 62) {
i++;
b = raw[i];
}
return i;
}
public static boolean isNull(final byte[] arrayData, final int j2) {
return arrayData[j2] == 'n' && arrayData[j2 + 1] == 'u' && arrayData[j2 + 2] == 'l' && arrayData[j2 + 3] == 'l';
}
public static int skipComment(final byte[] raw, int i) {
final int len = raw.length;
while (i < len && raw[i] != 10 && raw[i] != 13) {
i++;
}
//move cursor to start of text
while (i < len && (raw[i] == 10 || raw[i] == 13 || raw[i] == 32 || raw[i] == 9)) {
i++;
}
return i;
}
/**
* convert newValues.length) {
continue;
}
/*String array is a series of byte values.
* If the byte values has a \n in the middle we should ignore it.
* (customer-June2011/payam.pdf)
*/
while (str.charAt(ii) == '\n' || str.charAt(ii) == ' ') {
ii++;
}
nextValue = str.substring(ii, ii + 2);
IDbytes[ptr] = (byte) Integer.parseInt(nextValue, 16);
ptr++;
}
newValues = new byte[ptr];
System.arraycopy(IDbytes, 0, newValues, 0, ptr);
if (decryptor != null) {
byte[] decryptedValue = null;
try {
decryptedValue = decryptor.decryptString(IDbytes, ref);
} catch (final PdfSecurityException ex) {
LogWriter.writeLog("Exception: " + ex.getMessage());
}
newValues = (decryptedValue == null) ? IDbytes : decryptedValue;
}
return newValues;
}
public static int skipSpaces(final byte[] data, int start) {
final int len = data.length;
//now skip any spaces to key or text
while (start < len && (data[start] == 10 || data[start] == 13 || data[start] == 32 || data[start] == 9)) {
start++;
}
return start;
}
public static int skipSpacesOrOtherCharacter(final byte[] data, int start, final int character) {
final int length = data.length;
while (start < length && (data[start] == 10 || data[start] == 13 || data[start] == 32 || data[start] == 9 || data[start] == character)) {
start++;
}
return start;
}
public static int skipToEndOfKey(final byte[] data, int start) {
final int len = data.length;
while (start < len && !(data[start] == '/' || data[start] == '[' ||
data[start] == ' ' || data[start] == 10 || data[start] == ']'
|| data[start] == '>' || data[start] == 13 || data[start] == '<'
|| data[start] == ')' || data[start] == '(')) {
start++;
}
return start;
}
static boolean isSpace(final byte[] arrayData, final int endPtr) {
return (arrayData[endPtr] == 32 || arrayData[endPtr] == 13 || arrayData[endPtr] == 10);
}
static boolean isNumber(final byte[] arrayData, int j2) {
boolean isNumber = true;
final int count = arrayData.length;
int chars = 0;
j2 = skipSpaces(arrayData, j2);
while (isNumber && j2 < count) {
if (chars > 0 && (arrayData[j2] == '(' || arrayData[j2] == '<' || arrayData[j2] == ' ' || arrayData[j2] == '/')) {
break;
}
if ((arrayData[j2] >= '0' && arrayData[j2] <= '9')) {
//part of number char
j2++;
chars++;
} else {
isNumber = false;
}
}
return isNumber;
}
public static boolean isRef(final byte[] arrayData, int j2) {
boolean isRef = true;
final int count = arrayData.length;
int elementCount = 0;
j2 = skipSpaces(arrayData, j2);
while (isRef && j2 < count && arrayData[j2] != 'R') {
if ((arrayData[j2] >= '0' && arrayData[j2] <= '9')) {
//part of number char
j2++;
} else if (isSpace(arrayData, j2)) {
elementCount++;
j2 = skipSpaces(arrayData, j2);
} else {
isRef = false;
}
}
return isRef && elementCount == 2;
}
public static boolean isArray(final byte[] arrayData, final int j2) {
return arrayData[j2] == '[';
}
static boolean isEndObj(final byte[] arrayData, final int j2) {
return arrayData[j2] == 'e' && arrayData[j2 + 1] == 'n' && arrayData[j2 + 2] == 'd' && arrayData[j2 + 3] == 'o' && arrayData[j2 + 4] == 'b' && arrayData[j2 + 5] == 'j';
}
static int skipToEndOfArray(final byte[] data, int start) {
int level = 1;
start++;
boolean inStream = false;
while (level > 0) {
//allow for streams
if (!inStream && data[start] == '(') {
inStream = true;
} else if (inStream && data[start] == ')' && (data[start - 1] != '\\' || data[start - 2] == '\\')) {
inStream = false;
}
if (!inStream) {
if (data[start] == '[') {
level++;
} else if (data[start] == ']') {
level--;
}
}
start++;
}
return start;
}
static int skipToEndOfStream(final byte[] data, int start) {
start++;
while (data[start] != ')' || (data[start - 1] == '\\' && data[start - 2] == '\\')) {
start++;
}
return start;
}
public static int[] readRefFromStream(final byte[] raw, int ptr) {
final int startI = ptr;
//move cursor to end of ref
ptr = StreamReaderUtils.skipToEndOfRef(raw, ptr);
//actual value or first part of ref
final int ref = NumberUtils.parseInt(startI, ptr, raw);
ptr = StreamReaderUtils.skipSpaces(raw, ptr);
// get generation number
final int keyStart = ptr;
//move cursor to end of reference
ptr = StreamReaderUtils.skipToEndOfRef(raw, ptr);
final int generation = NumberUtils.parseInt(keyStart, ptr, raw);
ptr = StreamReaderUtils.skipSpaces(raw, ptr);
return new int[]{ref, generation, ptr};
}
}
