mirror of git://gcc.gnu.org/git/gcc.git
79 lines
2.8 KiB
Java
79 lines
2.8 KiB
Java
/* java.util.zip.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., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
02110-1301 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 java.util.zip;
|
|
|
|
interface DeflaterConstants
|
|
{
|
|
boolean DEBUGGING = false;
|
|
|
|
int STORED_BLOCK = 0;
|
|
int STATIC_TREES = 1;
|
|
int DYN_TREES = 2;
|
|
int PRESET_DICT = 0x20;
|
|
|
|
int DEFAULT_MEM_LEVEL = 8;
|
|
|
|
int MAX_MATCH = 258;
|
|
int MIN_MATCH = 3;
|
|
|
|
int MAX_WBITS = 15;
|
|
int WSIZE = 1 << MAX_WBITS;
|
|
int WMASK = WSIZE - 1;
|
|
|
|
int HASH_BITS = DEFAULT_MEM_LEVEL + 7;
|
|
int HASH_SIZE = 1 << HASH_BITS;
|
|
int HASH_MASK = HASH_SIZE - 1;
|
|
int HASH_SHIFT = (HASH_BITS + MIN_MATCH - 1) / MIN_MATCH;
|
|
|
|
int MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1;
|
|
int MAX_DIST = WSIZE - MIN_LOOKAHEAD;
|
|
|
|
int PENDING_BUF_SIZE = 1 << (DEFAULT_MEM_LEVEL + 8);
|
|
int MAX_BLOCK_SIZE = Math.min(65535, PENDING_BUF_SIZE-5);
|
|
|
|
int DEFLATE_STORED = 0;
|
|
int DEFLATE_FAST = 1;
|
|
int DEFLATE_SLOW = 2;
|
|
|
|
int GOOD_LENGTH[] = { 0,4, 4, 4, 4, 8, 8, 8, 32, 32 };
|
|
int MAX_LAZY[] = { 0,4, 5, 6, 4,16, 16, 32, 128, 258 };
|
|
int NICE_LENGTH[] = { 0,8,16,32,16,32,128,128, 258, 258 };
|
|
int MAX_CHAIN[] = { 0,4, 8,32,16,32,128,256,1024,4096 };
|
|
int COMPR_FUNC[] = { 0,1, 1, 1, 1, 2, 2, 2, 2, 2 };
|
|
}
|