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

net.sourceforge.plantuml.zopfli.Util Maven / Gradle / Ivy

Go to download

PlantUML is a component that allows to quickly write diagrams from text.

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 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 .
 *
 * 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 LGPL license.
 *
 * The generated images can then be used without any reference to the LGPL 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.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;
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy