Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/* net.sf.jazzlib.DeflaterConstants
Copyright (C) 2001 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GNU Classpath is 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
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA.
Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this
exception statement from your version. */
package net.sf.jazzlib;
interface DeflaterConstants {
final static boolean DEBUGGING = false;
final static int STORED_BLOCK = 0;
final static int STATIC_TREES = 1;
final static int DYN_TREES = 2;
final static int PRESET_DICT = 0x20;
final static int DEFAULT_MEM_LEVEL = 8;
final static int MAX_MATCH = 258;
final static int MIN_MATCH = 3;
final static int MAX_WBITS = 15;
final static int WSIZE = 1 << MAX_WBITS;
final static int WMASK = WSIZE - 1;
final static int HASH_BITS = DEFAULT_MEM_LEVEL + 7;
final static int HASH_SIZE = 1 << HASH_BITS;
final static int HASH_MASK = HASH_SIZE - 1;
final static int HASH_SHIFT = ((HASH_BITS + MIN_MATCH) - 1) / MIN_MATCH;
final static int MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1;
final static int MAX_DIST = WSIZE - MIN_LOOKAHEAD;
final static int PENDING_BUF_SIZE = 1 << (DEFAULT_MEM_LEVEL + 8);
final static int MAX_BLOCK_SIZE = Math.min(65535, PENDING_BUF_SIZE - 5);
final static int DEFLATE_STORED = 0;
final static int DEFLATE_FAST = 1;
final static int DEFLATE_SLOW = 2;
final static int GOOD_LENGTH[] = { 0, 4, 4, 4, 4, 8, 8, 8, 32, 32 };
final static int MAX_LAZY[] = { 0, 4, 5, 6, 4, 16, 16, 32, 128, 258 };
final static int NICE_LENGTH[] = { 0, 8, 16, 32, 16, 32, 128, 128, 258, 258 };
final static int MAX_CHAIN[] = { 0, 4, 8, 32, 16, 32, 128, 256, 1024, 4096 };
final static int COMPR_FUNC[] = { 0, 1, 1, 1, 1, 2, 2, 2, 2, 2 };
}
