Fixes for the checkstyle plugin as without the build breaks on windows.
This commit is contained in:
parent
ca3409c622
commit
a7b550a74a
@ -113,4 +113,8 @@ final class Adler32 {
|
||||
}
|
||||
return s2 << 16 | s1;
|
||||
}
|
||||
|
||||
private Adler32() {
|
||||
// Utility class
|
||||
}
|
||||
}
|
||||
|
@ -92,4 +92,8 @@ final class CRC32 {
|
||||
crc32 ^= 0xffffffff;
|
||||
return crc32;
|
||||
}
|
||||
|
||||
private CRC32() {
|
||||
// Utility class
|
||||
}
|
||||
}
|
||||
|
@ -96,7 +96,7 @@ final class Deflate {
|
||||
"data error", // Z_DATA_ERROR (-3)
|
||||
"insufficient memory", // Z_MEM_ERROR (-4)
|
||||
"buffer error", // Z_BUF_ERROR (-5)
|
||||
"incompatible version",// Z_VERSION_ERROR (-6)
|
||||
"incompatible version", // Z_VERSION_ERROR (-6)
|
||||
"" };
|
||||
|
||||
// block not completed, need more input or more output
|
||||
@ -342,7 +342,7 @@ final class Deflate {
|
||||
|
||||
// Scan a literal or distance tree to determine the frequencies of the codes
|
||||
// in the bit length tree.
|
||||
private void scan_tree(short[] tree,// the tree to be scanned
|
||||
private void scan_tree(short[] tree, // the tree to be scanned
|
||||
int max_code // and its largest code of non zero frequency
|
||||
) {
|
||||
int n; // iterates over all tree elements
|
||||
@ -437,7 +437,7 @@ final class Deflate {
|
||||
|
||||
// Send a literal or distance tree in compressed form, using the codes in
|
||||
// bl_tree.
|
||||
private void send_tree(short[] tree,// the tree to be sent
|
||||
private void send_tree(short[] tree, // the tree to be sent
|
||||
int max_code // and its largest code of non zero frequency
|
||||
) {
|
||||
int n; // iterates over all tree elements
|
||||
@ -493,28 +493,28 @@ final class Deflate {
|
||||
|
||||
// Output a byte on the stream.
|
||||
// IN assertion: there is enough room in pending_buf.
|
||||
private final void put_byte(byte[] p, int start, int len) {
|
||||
private void put_byte(byte[] p, int start, int len) {
|
||||
System.arraycopy(p, start, pending_buf, pending, len);
|
||||
pending += len;
|
||||
}
|
||||
|
||||
private final void put_byte(byte c) {
|
||||
private void put_byte(byte c) {
|
||||
pending_buf[pending ++] = c;
|
||||
}
|
||||
|
||||
private final void put_short(int w) {
|
||||
private void put_short(int w) {
|
||||
put_byte((byte) w/*&0xff*/);
|
||||
put_byte((byte) (w >>> 8));
|
||||
}
|
||||
|
||||
private final void putShortMSB(int b) {
|
||||
private void putShortMSB(int b) {
|
||||
put_byte((byte) (b >> 8));
|
||||
put_byte((byte) b/*&0xff*/);
|
||||
}
|
||||
|
||||
private final void send_code(int c, short[] tree) {
|
||||
private void send_code(int c, short[] tree) {
|
||||
int c2 = c * 2;
|
||||
send_bits((tree[c2] & 0xffff), (tree[c2 + 1] & 0xffff));
|
||||
send_bits(tree[c2] & 0xffff, tree[c2 + 1] & 0xffff);
|
||||
}
|
||||
|
||||
private void send_bits(int value, int length) {
|
||||
@ -806,7 +806,7 @@ final class Deflate {
|
||||
int stored_len, // length of input block
|
||||
boolean eof // true if this is the last block for a file
|
||||
) {
|
||||
int opt_lenb, static_lenb;// opt_len and static_len in bytes
|
||||
int opt_lenb, static_lenb; // opt_len and static_len in bytes
|
||||
int max_blindex = 0; // index of last bit length code of non zero freq
|
||||
|
||||
// Build the Huffman trees unless a stored block is forced
|
||||
|
@ -61,7 +61,7 @@ final class InfBlocks {
|
||||
|
||||
private static final int TYPE = 0; // get type bits (3, including end bit)
|
||||
private static final int LENS = 1; // get lengths for stored
|
||||
private static final int STORED = 2;// processing stored block
|
||||
private static final int STORED = 2; // processing stored block
|
||||
private static final int TABLE = 3; // get table lengths
|
||||
private static final int BTREE = 4; // get bit lengths tree for a dynamic block
|
||||
private static final int DTREE = 5; // get length, distance trees for a dynamic block
|
||||
|
@ -71,7 +71,7 @@ final class InfCodes {
|
||||
// mode dependent information
|
||||
private int len;
|
||||
private int[] tree; // pointer into tree
|
||||
private int tree_index = 0;
|
||||
private int tree_index;
|
||||
private int need; // bits needed
|
||||
private int lit;
|
||||
// if EXT or COPY, where and how much
|
||||
|
@ -180,8 +180,8 @@ final class InfTree {
|
||||
int[] e, // list of extra bits for non-simple codes
|
||||
int[] t, // result: starting table
|
||||
int[] m, // maximum lookup bits, returns actual
|
||||
int[] hp,// space for trees
|
||||
int[] hn,// hufts used in space
|
||||
int[] hp, // space for trees
|
||||
int[] hn, // hufts used in space
|
||||
int[] v // working area: values in order of bit length
|
||||
) {
|
||||
// Given a list of code lengths and a maximum table size, make a set of
|
||||
@ -437,7 +437,7 @@ final class InfTree {
|
||||
|
||||
static int inflate_trees_fixed(int[] bl, //literal desired/actual bit depth
|
||||
int[] bd, //distance desired/actual bit depth
|
||||
int[][] tl,//literal/length tree result
|
||||
int[][] tl, //literal/length tree result
|
||||
int[][] td //distance tree result
|
||||
) {
|
||||
bl[0] = fixed_bl;
|
||||
|
@ -76,7 +76,7 @@ final class Inflate {
|
||||
private static final int GZIP_FNAME = 21;
|
||||
private static final int GZIP_FCOMMENT = 22;
|
||||
private static final int GZIP_FHCRC = 23;
|
||||
private static final int GZIP_CRC32= 24;
|
||||
private static final int GZIP_CRC32 = 24;
|
||||
private static final int GZIP_ISIZE = 25;
|
||||
|
||||
private int mode; // current inflate mode
|
||||
@ -305,7 +305,7 @@ final class Inflate {
|
||||
break;
|
||||
} else if (z.istate.wrapperType == WrapperType.ZLIB) {
|
||||
z.istate.mode = CHECK4;
|
||||
} else if (z.istate.wrapperType == WrapperType.GZIP){
|
||||
} else if (z.istate.wrapperType == WrapperType.GZIP) {
|
||||
gzipCRC32 = 0;
|
||||
gzipISize = 0;
|
||||
gzipBytesToRead = 4;
|
||||
|
@ -105,4 +105,8 @@ public final class JZlib {
|
||||
static enum WrapperType {
|
||||
NONE, ZLIB, GZIP, ZLIB_OR_NONE;
|
||||
}
|
||||
|
||||
private JZlib() {
|
||||
// Utility class
|
||||
}
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user