All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.sourceforge.plantuml.brotli.State Maven / Gradle / Ivy

There is a newer version: 1.2024.8
Show newest version
// 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 General Public License V2.
 *
 * THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC
 * LICENSE ("AGREEMENT"). [GNU General Public License V2]
 *
 * ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES
 * RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
 *
 * You may obtain a copy of the License at
 *
 * https://www.gnu.org/licenses/old-licenses/gpl-2.0.html
 *
 * 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.
 *
 * PlantUML can occasionally display sponsored or advertising messages. Those
 * messages are usually generated on welcome or error images and never on
 * functional diagrams.
 * See https://plantuml.com/professional if you want to remove them
 *
 * Images (whatever their format : PNG, SVG, EPS...) generated by running PlantUML
 * are owned by the author of their corresponding sources code (that is, their
 * textual description in PlantUML language). Those images are not covered by
 * this GPL v2 license.
 *
 * The generated images can then be used without any reference to the GPL v2 license.
 * It is not even necessary to stipulate that they have been generated with PlantUML,
 * although this will be appreciated by the PlantUML team.
 *
 * There is an exception : if the textual description in PlantUML language is also covered
 * by any license, then the generated images are logically covered
 * by the very same license.
 *
 * This is the IGY distribution (Install GraphViz by Yourself).
 * You have to install GraphViz and to setup the GRAPHVIZ_DOT environment variable
 * (see https://plantuml.com/graphviz-dot )
 *
 * Icons provided by OpenIconic :  https://useiconic.com/open
 * Archimate sprites provided by Archi :  http://www.archimatetool.com
 * Stdlib AWS provided by https://github.com/milo-minderbinder/AWS-PlantUML
 * Stdlib Icons provided https://github.com/tupadr3/plantuml-icon-font-sprites
 * ASCIIMathML (c) Peter Jipsen http://www.chapman.edu/~jipsen
 * ASCIIMathML (c) David Lippman http://www.pierce.ctc.edu/dlippman
 * CafeUndZopfli ported by Eugene Klyuchnikov https://github.com/eustas/CafeUndZopfli
 * Brotli (c) by the Brotli Authors https://github.com/google/brotli
 * Themes (c) by Brett Schwarz https://github.com/bschwarz/puml-themes
 * Twemoji (c) by Twitter at https://twemoji.twitter.com/
 *
 */

package net.sourceforge.plantuml.brotli;

import java.io.InputStream;

final class State {
	byte[] ringBuffer;
	byte[] contextModes;
	byte[] contextMap;
	byte[] distContextMap;
	byte[] output;
	byte[] byteBuffer; // BitReader

	short[] shortBuffer; // BitReader

	int[] intBuffer; // BitReader
	int[] rings;
	int[] blockTrees;
	int[] hGroup0;
	int[] hGroup1;
	int[] hGroup2;

	long accumulator64; // BitReader: pre-fetched bits.

	int runningState; // Default value is 0 == Decode.UNINITIALIZED
	int nextRunningState;
	int accumulator32; // BitReader: pre-fetched bits.
	int bitOffset; // BitReader: bit-reading position in accumulator.
	int halfOffset; // BitReader: offset of next item in intBuffer/shortBuffer.
	int tailBytes; // BitReader: number of bytes in unfinished half.
	int endOfStreamReached; // BitReader: input stream is finished.
	int metaBlockLength;
	int inputEnd;
	int isUncompressed;
	int isMetadata;
	int literalBlockLength;
	int numLiteralBlockTypes;
	int commandBlockLength;
	int numCommandBlockTypes;
	int distanceBlockLength;
	int numDistanceBlockTypes;
	int pos;
	int maxDistance;
	int distRbIdx;
	int trivialLiteralContext;
	int literalTreeIndex;
	int literalTree;
	int j;
	int insertLength;
	int contextMapSlice;
	int distContextMapSlice;
	int contextLookupOffset1;
	int contextLookupOffset2;
	int treeCommandOffset;
	int distanceCode;
	int numDirectDistanceCodes;
	int distancePostfixMask;
	int distancePostfixBits;
	int distance;
	int copyLength;
	int copyDst;
	int maxBackwardDistance;
	int maxRingBufferSize;
	int ringBufferSize;
	int expectedTotalSize;
	int outputOffset;
	int outputLength;
	int outputUsed;
	int bytesWritten;
	int bytesToWrite;

	InputStream input; // BitReader

	State() {
		this.ringBuffer = new byte[0];
		this.rings = new int[10];
		this.rings[0] = 16;
		this.rings[1] = 15;
		this.rings[2] = 11;
		this.rings[3] = 4;
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy