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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298
|
//start of SimpleSearch.java
//TEXT_STYLE:CODE=Shift_JIS(Japanese):RET_CODE=CRLF
/**
* SimpleSearch.java
*
* Copyright (C) 2002 Michel Ishizuka All rights reserved.
*
* ȉ̏ɓӂȂ\[XƃoCi`̍ĔzzƎgp
* ύX̗Lɂ炸B
*
* PD\[XR[h̍ĔzzɂĒ쌠\ ̏̃Xg
* щL̐ێȂĂ͂ȂȂB
*
* QDoCi`̍ĔzzɂĒ쌠\ ̏̃Xg
* щL̐gp ̑̔zz
* ܂ގɋLqȂȂȂB
*
* ̃\tgEFA͐Β˔ڂɂĖۏŒA̖
* IBłƂۏAilLƂۏɂƂǂ܂炸A
* Ȃ閾IшÎIȕۏȂB
* Β˔ڂ ̃\tgEFA̎gpɂ钼ړIAԐړIA
* IAȁAT^IȁA邢͕KRIȑQ(gpɂf[^
* AƖ̒f〈܂Ăv̈⎸Ai
* T[rX̓l邪AĂꂾɌ肳Ȃ
* Q)ɑāAȂ鎖Ԃ̌ƂȂƂĂA_̐
* C△ߎӔC܂ ȂӔC낤ƂAƂꂪs
* ŝׂ߂łƂĂA܂͂̂悤ȑQ̉\
* ĂƂĂ̐ӔCȂ̂ƂB
*/
package jp.gr.java_conf.dangan.util.lha;
//import classes and interfaces
import jp.gr.java_conf.dangan.util.lha.LzssSearchMethod;
import jp.gr.java_conf.dangan.util.lha.LzssOutputStream;
//import exceptions
/**
* ʂȌ@\pȂ
* LzssSearchMethod ̍łVvȎB<br>
* @\pȂ߁A
* ̌@\pƔׂƒxA
* ʂɏȂB<br>
*
* <pre>
* -- revision history --
* $Log: SimpleSearch.java,v $
* Revision 1.0 2002/08/05 00:00:00 dangan
* add to version control
* [change]
* LzssSearchMethod ̃C^tFCXύXɂ킹ăC^tFCXύXB
* [maintenance]
* \[X
* ^up~
* CZX̏C
*
* </pre>
*
* @author $Author: dangan $
* @version $Revision: 1.0 $
*/
public class SimpleSearch implements LzssSearchMethod{
//------------------------------------------------------------------
// instance field
//------------------------------------------------------------------
// LZSS parameter
//------------------------------------------------------------------
// private int DictionarySize
// private int MaxMatch
// private int Threshold
//------------------------------------------------------------------
/**
* LZSSTCYB
*/
private int DictionarySize;
/**
* LZSSkɎgplB
* ővB
*/
private int MaxMatch;
/**
* LZSSkɎgp臒lB
* v ̒lȏłAkR[ho͂B
*/
private int Threshold;
//------------------------------------------------------------------
// instance field
//------------------------------------------------------------------
// text buffer
//------------------------------------------------------------------
// private byte[] TextBuffer
// private int DictionaryLimit
//------------------------------------------------------------------
/**
* LZSSk{߂̃obt@B
* position Ö͎A
* 㔼͈k{߂̃f[^̓obt@B
* LzssSearchMethod̎ł͓ǂݍ݂̂B
*/
private byte[] TextBuffer;
/**
* ̌EʒuB
* TextBufferO̎̈Ƀf[^ꍇ
* ̈ɂs̃f[^(Javał0)gp
* Ĉkŝ}~B
*/
private int DictionaryLimit;
//------------------------------------------------------------------
// constructor
//------------------------------------------------------------------
// private SimpleSearch()
// public SimpleSearch( int DictionarySize, int MaxMatch,
// int Threshold, byte[] TextBuffer )
//------------------------------------------------------------------
/**
* ftHgRXgN^B
*gps
*/
private SimpleSearch(){ }
/**
* ʂȌ@\pȂVv
* LzssSearchMethod \zB<br>
*
* @param DictionarySize TCY
* @param MaxMatch őv
* @param Threshold kAk臒l
* @param TextBuffer LZSSk{߂̃obt@
*/
public SimpleSearch( int DictionarySize,
int MaxMatch,
int Threshold,
byte[] TextBuffer ){
this.DictionarySize = DictionarySize;
this.MaxMatch = MaxMatch;
this.Threshold = Threshold;
this.TextBuffer = TextBuffer;
this.DictionaryLimit = this.DictionarySize;
}
//------------------------------------------------------------------
// method of jp.gr.java_conf.dangan.util.lha.LzssSearchMethod
//------------------------------------------------------------------
// public void put( int position )
// public int searchAndPut( int position )
// public int search( int position, int lastPutPos, int maxMatch )
// public void slide()
// public int putRequires()
//------------------------------------------------------------------
/**
* SimpleSearch ͌@\gpȂ
* ̃\bh͉ȂB
*
* @param position TextBuffer̃f[^p^̊Jnʒu
*/
public void put( int position ){ }
/**
* TextBuffer ̎̈ɂf[^p^
* position n܂f[^p^
* Œ̈v̂B<br>
*
* @param position TextBuffer̃f[^p^̊JnʒuB
*
* @return vꍇ
* LzssOutputStream.createSearchReturn
* ɂĐꂽvʒuƈv̏lA
* vȂꍇ
* LzssOutputStream.NOMATCHB
*
* @see LzssOutputStream#createSearchReturn(int,int)
* @see LzssOutputStream#NOMATCH
*/
public int searchAndPut( int position ){
int matchlen = this.Threshold - 1;
int matchpos = position;
int scanlimit = Math.max( this.DictionaryLimit,
position - this.DictionarySize );
int scanpos = position - 1;
byte[] buf = this.TextBuffer;
int max = position + this.MaxMatch;
int p = 0;
int s = 0;
int len = 0;
while( scanlimit < scanpos ){
s = scanpos;
p = position;
while( buf[ s ] == buf[ p ] ){
s++;
p++;
if( max <= p ) break;
}
len = p - position;
if( matchlen < len ){
matchpos = scanpos;
matchlen = len;
if( this.MaxMatch == len ) break;
}
scanpos--;
}
if( this.Threshold <= matchlen ){
return LzssOutputStream.createSearchReturn( matchlen, matchpos );
}else{
return LzssOutputStream.NOMATCH;
}
}
/**
* TextBuffer ̎̈ɂf[^p^
* position n܂f[^p^
* Œ̈v̂B<br>
*
* @param position TextBuffer̃f[^p^̊JnʒuB
* @param lastPutPos Ōɓo^f[^p^̊JnʒuB
*
* @return vꍇ
* LzssOutputStream.createSearchReturn
* ɂĐꂽvʒuƈv̏lA
* vȂꍇ
* LzssOutputStream.NOMATCHB
*
* @see LzssOutputStream#createSearchReturn(int,int)
* @see LzssOutputStream#NOMATCH
*/
public int search( int position, int lastPutPos ){
int matchlen = this.Threshold - 1;
int matchpos = position;
int scanlimit = Math.max( this.DictionaryLimit,
position - this.DictionarySize );
int scanpos = position - 1;
byte[] buf = this.TextBuffer;
int max = Math.min( position + this.MaxMatch,
this.TextBuffer.length );
int p = 0;
int s = 0;
int len = 0;
while( scanlimit < scanpos ){
s = scanpos;
p = position;
while( buf[ s ] == buf[ p ] ){
s++;
p++;
if( max <= p ) break;
}
len = p - position;
if( matchlen < len ){
matchpos = scanpos;
matchlen = len;
if( this.MaxMatch == len ) break;
}
scanpos--;
}
if( this.Threshold <= matchlen ){
return LzssOutputStream.createSearchReturn( matchlen, matchpos );
}else{
return LzssOutputStream.NOMATCH;
}
}
/**
* LzssOutputStream slide() TextBuffer̃f[^
* DictionarySize ړۂɌ@\̃f[^
* Ɩړ鏈sB
*/
public void slide(){
this.DictionaryLimit = Math.max( 0, this.DictionaryLimit - this.DictionarySize );
}
/**
* SimpleSearch ͌@\gpȂߏ 0 ԂB
*
* @return 0
*/
public int putRequires(){
return 0;
}
}
//end of SimpleSearch.java
|