net.sourceforge.plantuml.zopfli.Cookie Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-lgpl Show documentation
Show all versions of plantuml-lgpl Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
* |
* | PlantUML : a free UML diagram generator
* |
* +=======================================================================
*
* (C) Copyright 2009-2024, Arnaud Roques
*
* Project Info: https://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* https://plantuml.com/patreon (only 1$ per month!)
* https://plantuml.com/liberapay (only 1€ per month!)
* https://plantuml.com/paypal
*
*
* PlantUML 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 3 of the License, or
* (at your option) any later version.
*
* PlantUML 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, see wc = new Comparator<>() {
*
* @Override public int compare(Node node, Node node2) { int r = node.weight -
* node2.weight; return r == 0 ? node.count - node2.count : r; } };
*/
final int[] i320a = new int[320];
final int[] i320b = new int[320];
final int[] i320c = new int[320];
final int[] i288a = new int[288];
final int[] i288b = new int[288];
final int[] i288c = new int[288];
final int[] i289a = new int[289];
final char[] c259a = new char[259];
final int[] i32a = new int[32];
final int[] i32b = new int[32];
final int[] i32c = new int[32];
final int[] i19a = new int[19];
final int[] i19b = new int[19];
final int[] i19c = new int[19];
final int[] i16a = new int[16];
final int[] i16b = new int[16];
final int[] p = new int[SPLIT_PARTITIONS];
final int[] vp = new int[SPLIT_PARTITIONS];
final char[] lengthArray; // unsigned short, but really values are 0..258 == MAX_MATCH
final long[] costs;
final char[] path;
final int[] splitPoints;
final int[] splitSize;
final SymbolStats stats = new SymbolStats();
final SymbolStats bestStats = new SymbolStats();
final SymbolStats lastStats = new SymbolStats();
final Hash h = new Hash();
int lenVal;
int distVal;
int rnd = 42;
final LzStore store1;
final LzStore store2;
final LongestMatchCache lmc;
final int masterBlockSize;
final Node node(int weight, int count, Node tail) {
Node result = nodes[nextNode++];
result.weight = weight;
result.count = count;
result.tail = tail;
return result;
}
final void resetPool() {
nextNode = 0;
}
static void fill0(int[] array, int length) {
int i = 0;
while (i < length) {
int j = i + 65536;
if (j > length) {
j = length;
}
System.arraycopy(intZeroes, 0, array, i, j - i);
i = j;
}
}
static void fill0(char[] array, int length) {
int i = 0;
while (i < length) {
int j = i + 65536;
if (j > length) {
j = length;
}
System.arraycopy(charZeroes, 0, array, i, j - i);
i = j;
}
}
static void fillCostMax(long[] array, int length) {
int i = 0;
while (i < length) {
int j = i + 65536;
if (j > length) {
j = length;
}
System.arraycopy(costMax, 0, array, i, j - i);
i = j;
}
}
/**
* Maximum amount of blocks to split into.
*
* {@code 0} for unlimited.
*/
final int blockSplittingMax = 15;
Cookie(int masterBlockSize) { // TODO: + maxBlockSize?
this.masterBlockSize = masterBlockSize;
for (int i = 0; i < POOL_MAX; i++) {
nodes[i] = new Node();
}
splitPoints = new int[blockSplittingMax + 1];
splitSize = new int[blockSplittingMax + 1];
lengthArray = new char[masterBlockSize + 1]; // 2
costs = new long[masterBlockSize + 1]; // 8
path = new char[masterBlockSize + 1]; // 2
lmc = new LongestMatchCache(masterBlockSize); // 28
store1 = new LzStore(masterBlockSize); // 4
store2 = new LzStore(masterBlockSize); // 4
// 2 + 8 + 2 + 28 + 4 + 4 = 48
}
}