net.sourceforge.plantuml.zopfli.Util Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-mit Show documentation
Show all versions of plantuml-mit Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
package net.sourceforge.plantuml.zopfli;
class Util {
static final int[] LENGTH_SYMBOL = new int[] { 0, 0, 0, 257, 258, 259, 260, 261, 262, 263, 264, 265, 265, 266, 266,
267, 267, 268, 268, 269, 269, 269, 269, 270, 270, 270, 270, 271, 271, 271, 271, 272, 272, 272, 272, 273,
273, 273, 273, 273, 273, 273, 273, 274, 274, 274, 274, 274, 274, 274, 274, 275, 275, 275, 275, 275, 275,
275, 275, 276, 276, 276, 276, 276, 276, 276, 276, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277,
277, 277, 277, 277, 277, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278,
279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 280, 280, 280, 280, 280,
280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281,
281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281,
281, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282,
282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 283, 283, 283, 283, 283, 283, 283, 283, 283,
283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283,
283, 283, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284,
284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 285 };
static final int[] LENGTH_EXTRA_BITS = new int[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 0 };
static final int[] LENGTH_EXTRA_BITS_VALUE = new int[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0,
1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4,
5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14, 15, 0, 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, 0, 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, 0, 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, 0, 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, 0 };
static final int[] ORDER = new int[] { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
static final int[] CACHED_DIST_SYMBOL = cacheDistSymbol();
private static int[] cacheDistSymbol() {
int[] r = new int[32768];
for (int i = 0; i < 32768; ++i) {
r[i] = distSymbol(i);
}
return r;
}
private static int distSymbol(int dist) {
if (dist < 193) {
if (dist < 13) { /* dist 0..13. */
if (dist < 5)
return dist - 1;
else if (dist < 7)
return 4;
else if (dist < 9)
return 5;
else
return 6;
} else { /* dist 13..193. */
if (dist < 17)
return 7;
else if (dist < 25)
return 8;
else if (dist < 33)
return 9;
else if (dist < 49)
return 10;
else if (dist < 65)
return 11;
else if (dist < 97)
return 12;
else if (dist < 129)
return 13;
else
return 14;
}
} else {
if (dist < 2049) { /* dist 193..2049. */
if (dist < 257)
return 15;
else if (dist < 385)
return 16;
else if (dist < 513)
return 17;
else if (dist < 769)
return 18;
else if (dist < 1025)
return 19;
else if (dist < 1537)
return 20;
else
return 21;
} else { /* dist 2049..32768. */
if (dist < 3073)
return 22;
else if (dist < 4097)
return 23;
else if (dist < 6145)
return 24;
else if (dist < 8193)
return 25;
else if (dist < 12289)
return 26;
else if (dist < 16385)
return 27;
else if (dist < 24577)
return 28;
else
return 29;
}
}
}
static final int[] CACHED_DIST_EXTRA_BITS = precacheDistExtraBits();
private static int[] precacheDistExtraBits() {
int[] r = new int[4097];
for (int i = 0; i < 4097; ++i) {
r[i] = distExtraBits(i);
}
return r;
}
private static int distExtraBits(int dist) {
if (dist < 5) {
return 0;
} else if (dist < 9) {
return 1;
} else if (dist < 17) {
return 2;
} else if (dist < 33) {
return 3;
} else if (dist < 65) {
return 4;
} else if (dist < 129) {
return 5;
} else if (dist < 257) {
return 6;
} else if (dist < 513) {
return 7;
} else if (dist < 1025) {
return 8;
} else if (dist < 2049) {
return 9;
} else if (dist < 4097) {
return 10;
} else if (dist < 8193) {
return 11;
} else if (dist < 16385) {
return 12;
}
return 13;
}
static int distExtraBitsValue(int dist) {
if (dist < 5) {
return 0;
} else if (dist < 9) {
return (dist - 5) & 1;
} else if (dist < 17) {
return (dist - 9) & 3;
} else if (dist < 33) {
return (dist - 17) & 7;
} else if (dist < 65) {
return (dist - 33) & 15;
} else if (dist < 129) {
return (dist - 65) & 31;
} else if (dist < 257) {
return (dist - 129) & 63;
} else if (dist < 513) {
return (dist - 257) & 127;
} else if (dist < 1025) {
return (dist - 513) & 255;
} else if (dist < 2049) {
return (dist - 1025) & 511;
} else if (dist < 4097) {
return (dist - 2049) & 1023;
} else if (dist < 8193) {
return (dist - 4097) & 2047;
} else if (dist < 16385) {
return (dist - 8193) & 4095;
}
return (dist - 16385) & 8191;
}
}