/*************************************************** ************ LZSS compression routines ************ ***************************************************   This compression algorithm is based on the ideas of Lempel and Ziv,   with the modifications suggested by Storer and Szymanski. The algorithm    is based on the use of a ring buffer, which initially contains zeros.    We read several characters from the file into the buffer, and then    search the buffer for the longest string that matches the characters    just read, and output the length and position of the match in the buffer.   With a buffer size of 4096 bytes, the position can be encoded in 12   bits. If we represent the match length in four bits, the <position,   length> pair is two bytes long. If the longest match is no more than   two characters, then we send just one character without encoding, and   restart the process with the next letter. We must send one extra bit   each time to tell the decoder whether we are sending a <position,   length> pair or an unencoded character, and these flags are stored as   an eight bit mask every eight items.   This implementation uses binary trees to speed up the search for the   longest match.   Original code by Haruhiko Okumura, 4/6/1989.   12-2-404 Green Heights, 580 Nagasawa, Yokosuka 239, Japan.   Modified for use in the Allegro filesystem by Shawn Hargreaves.   Use, distribute, and modify this code freely.*/import java.io.FilterInputStream;import java.io.InputStream;import java.io.IOException;public class LZSSInputStream extends FilterInputStream{	 final private static int N=4096;        /* 4k buffers for LZ compression */ final private static int F=18;          /* upper limit for LZ match length */ final private static int THRESHOLD=2;   /* LZ encode string into pos and length				       if match size is greater than this *//* for reading LZ files */   int state;                       /* where have we got to? */   int i, j, k, r, c;   int flags;   byte text_buf[];              /* ring buffer, with F-1 extra bytes				       for string comparison */	LZSSInputStream (InputStream i)	{		super(i);		text_buf=new byte[N+F-1];	}/* pack_read: *  Called by refill_buffer(). Unpacks from dat into buf, until either *  EOF is reached or s bytes have been extracted. Returns the number of *  bytes added to the buffer */ /* code stream *//* bits flag , bit 1-quoted byte 0-packed string *//* follows 8 codes, types determined by flagbits *//* 1st code type is in the lowest flag bit       *//* packed string is encoded in 16 bits: *//* 12 bits buffer position, 4 bits size *//* 1st byte: low part of pos.   2nd byte: high 4 bits = 4 high bits of pos.             low  4 bits = size - 2 */public final int read(byte buf[],int bufi, int s) throws IOException{   int size = 0;   if(state==0)   {     r=N-F;   /* fingbuffer pos? */     flags=0; /* zero flags */   }   while(s>0) {      if(state == 2 ) {         /* output encoded string from buffer */	 if( k <= j)  {            c = text_buf[(i+k) & (N - 1)];	    text_buf[r++] = (byte) c;	    buf[bufi++] = (byte) c;	    r &= (N - 1);	    k++;	    --s;	    size++;	    continue;	 }      }	     /* test zda mame nacist dalsi flags byte */      if (((flags >>>= 1) & 256) == 0) {	 if ((c = in.read()) == -1)	    break;	 flags = c | 0xFF00;        /* uses higher byte to count eight */      }      if ( (flags & 1) == 1 ) {      /* quoted character */	 if ((c = in.read()) == -1)	    break;	 text_buf[r++] = (byte) c; /* vlozit do bufferu */	 r &= N - 1; /* korekce pozice v ring bufferu */	 buf[bufi++] = (byte) c; /* vystup ven */	 ++size; 	 --s;	 state = 1;	 continue;	 }      /* encoded string */      if ((i = in.read()) == -1 )	    break;      if ((j = in.read()) == -1 )	    break;      i |= ((j & 0xF0) << 4);      /* position */      j = (j & 0x0F) + THRESHOLD;  /* size */      k = 0;                       /* output str. pos */      state = 2;   } /* while s>0 */   if(size==0) return -1;       else return size;}public int read() throws IOException{     byte b[]=new byte[1];     int rc=read(b,0,1);     if(rc==-1) return -1;     byte z=b[0];     return z & 0xFF; }public void close() throws IOException{  text_buf=null;  super.close();  in=null;}/* non supported interface methods */public boolean markSupported(){	return false;}public long skip(long n){       return 0;}public int available(){       return 0;}       public void mark(int readlimit){}public void reset() throws IOException{ throw new IOException("Reset is not supported");}}