File: SearchEnvironment.java

package info (click to toggle)
javahelp2 2.0.05.ds1-10
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 2,552 kB
  • sloc: java: 28,795; xml: 1,631; makefile: 16; sh: 2
file content (375 lines) | stat: -rw-r--r-- 10,665 bytes parent folder | download | duplicates (6)
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
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
/*
 * @(#)SearchEnvironment.java	1.29 06/10/30
 * 
 * Copyright (c) 2006 Sun Microsystems, Inc.  All Rights Reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 * 
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.  Sun designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Sun in the LICENSE file that accompanied this code.
 * 
 * This code 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
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 * 
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 * 
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
 * CA 95054 USA or visit www.sun.com if you need additional information or
 * have any questions.
 */

/*
 * @(#) SearchEnvironment.java 1.11 - last change made 04/19/98
 */

package com.sun.java.help.search;

import javax.help.search.SearchItem;
import java.io.*;
import java.util.Vector;		// consider removal
import java.net.URL;
import java.net.URLConnection;
import java.net.MalformedURLException;
import java.util.Locale;
import java.awt.datatransfer.DataFlavor;
import java.lang.reflect.Method;

/**
 * This class established a SearchEnvironment for JavaHelp classes
 *
 * @version	1.11	04/19/98
 * @author Jacek R. Ambroziak
 * @author Roger D. Brinkley
 */

class SearchEnvironment {
  private IntegerArray concepts;
  private IntegerArray offsets;
  private byte[]       allLists;

  private IntegerArray concepts3;
  private IntegerArray offsets3;
  private byte[]       allChildren;

  
  private IntegerArray documents;
  private IntegerArray offsets2;
  private IntegerArray titles;

  private RAFFile positionsFile = null;
  private byte[]  positions;
  
  private ByteArrayDecompressor compr;
  
  private BtreeDict tmap;
  
  private URL base;		// the base for all searches
  private String indexDir;	// the index directory


  public SearchEnvironment(String indexDir, URL hsBase) throws Exception {
    this.base = hsBase;
    this.indexDir = indexDir;

    readFromDB();
    compr = new ByteArrayDecompressor(null, 0);
  }

  public int fetch(String conceptName) throws Exception {
    return tmap.fetch(conceptName);
  }
  
  public String fetch(int conceptID) throws Exception {
    return tmap.fetch(conceptID);
  }
  
  public SearchItem makeItem(QueryHit hit) throws Exception
  {
    Vector concepts = new Vector();
    int[] conceptIDs = hit.getArray();
    for (int i = 0; i < conceptIDs.length; i++) {
      if (conceptIDs[i] > 0) {
	concepts.addElement(fetch(conceptIDs[i]));
      }
    }

    int begin = hit.getBegin();
    int end = hit.getEnd();
    return new SearchItem(this.base,
			  fetch(titles.at(hit.getDocument())),
			  Locale.getDefault().toString(),
			  fetch(documents.at(hit.getDocument())),
			  hit.getScore(),
			  begin,
			  end, 
			  concepts);
  }

  public String hitToString(QueryHit hit) throws Exception
  {
    StringBuffer result = new StringBuffer();
    result.append(hit.getScore());
    result.append(" ");
    result.append(fetch(documents.at(hit.getDocument())));
    if (false) {
      result.append(" ");
      result.append(fetch(titles.at(hit.getDocument())));
    }
    result.append(" [");
    int begin = hit.getBegin();
    int end = hit.getEnd();
    result.append(begin);
    result.append(", ");
    result.append(end);
    result.append("], {");
    int[] concepts = hit.getArray();
    for (int i = 0; i < concepts.length; i++)
      {
	if (concepts[i] > 0)
	  result.append(fetch(concepts[i]));
	else
	  result.append("--");
	if (i < concepts.length - 1)
	  result.append(", ");
      }
    result.append("}");
    return result.toString();
  }
  
  public byte[] getPositions(int docId) throws java.io.IOException
  {
      // Later on we should do some caching of this
      int offset = offsets2.at(docId);
      int upto;
      if (docId+1 == offsets2.cardinality()) {
	  upto = (int)positionsFile.length();
      } else {
	  upto = offsets2.at(docId+1);
      }
      positions = new byte[upto - offset];
      positionsFile.seek(offset);
      positionsFile.read(positions, 0, upto - offset);
      return positions;
  }

  public int getDocumentIndex(int docId) {
    return offsets2.at(docId);
  }
  
  public void close() throws java.io.IOException {
    positionsFile.close();
  }

  public boolean occursInText(int concept) {
    return concepts.indexOf(concept) >= 0;
  }

  public NonnegativeIntegerGenerator getDocumentIterator(int concept)
  {
    int index = concepts.indexOf(concept);
    if (index >= 0)
      return new ConceptList(allLists, offsets.at(index));
    else
      return null;
  }
  
  public NonnegativeIntegerGenerator getChildIterator(int concept)
  {
    int index = concepts3.indexOf(concept);
    if (index >= 0)
      return new ConceptList(allChildren, offsets3.at(index));
    else
      return null;
  }
  
  public void getChildren(int concept, IntegerArray array) throws Exception
  {
    int index = concepts3.indexOf(concept);
    if (index >= 0)
      {
	int where = offsets3.at(index);
	compr.initReading(allChildren, where + 1);
	compr.ascDecode(allChildren[where], array);
      }
  }
  
  public int getConceptLength(int concept) throws Exception {
    return tmap.fetch(concept).length();
  }
  
  // A temporary piece of code
  // Should be rearranged as soon as possible

  private URL getURL(String s) throws MalformedURLException {
    URL hsBase = this.base;
    String dir = this.indexDir;
    URL back;
    URL baseURL = null;
    File file;

    if (hsBase == null) {
	file = new File(dir);
	if (file.exists()) {
	    // On Win32 we need to convert all "\" to "/"
	    if (File.separatorChar != '/') {
		dir = dir.replace(File.separatorChar, '/');
	    }
	    // Make sure the last character is a file separator
	    if (dir.lastIndexOf('/')
		!= dir.length() - 1) {
		dir = dir.concat("/");
	    }
	    debug ("file:" + dir);
	    // Use a file protocol
	    baseURL = new URL("file", "", dir);
	} else {
	    // Assume that some protocol was specified and try it
	  baseURL = new URL(dir);
	}
    }
      
    if (hsBase != null) {
      back = new URL(hsBase, dir + "/" + s);
    } else {
      back = new URL(baseURL, s);
    }

    return back;
  }

  private void readChildrenData() throws Exception {
    URL url;
    URLConnection connect;
    BufferedInputStream in;

    // Read the Children.Tab data
    try {
      url = getURL("CHILDREN.TAB");
      connect = url.openConnection();
      InputStream ois = connect.getInputStream();
      
      if (ois == null) {
	  concepts3 = new IntegerArray(1);
	  return;
      }

      in = new BufferedInputStream(ois);

      int k1 = in.read();
      concepts3 = new IntegerArray(4096);
      StreamDecompressor sddocs = new StreamDecompressor(in);
      sddocs.ascDecode(k1, concepts3);
      int k2 = in.read();
      offsets3 = new IntegerArray(concepts3.cardinality() + 1);
      offsets3.add(0);
      StreamDecompressor sdoffsets = new StreamDecompressor(in);
      sdoffsets.ascDecode(k2, offsets3);
      in.close();
    
      // Read the Chilren data
      url = getURL("CHILDREN");
      connect = url.openConnection();
      ois = connect.getInputStream();

      if (ois == null) {
	  concepts3 = new IntegerArray(1);
	  return;
      }

      in = new BufferedInputStream(ois);
      int length = connect.getContentLength();
      allChildren = new byte[length];
      in.read(allChildren);
      in.close();
    } catch (MalformedURLException e) {
      concepts3 = new IntegerArray(1);
    } catch (FileNotFoundException e2) {
      concepts3 = new IntegerArray(1);
    } catch (IOException e2) {
      concepts3 = new IntegerArray(1);
    }
  }

  private void readFromDB() throws Exception {
    URL url;
    URLConnection connect;
    BufferedInputStream in = null;
    
    Schema schema = new Schema(base, indexDir, false);
    BtreeDictParameters params = new BtreeDictParameters(schema, "TMAP");
    params.readState();
    tmap = new BtreeDict(params);

    readChildrenData();

    url = getURL("DOCS.TAB");
    connect = url.openConnection();
    in = new BufferedInputStream(connect.getInputStream());
    int k1 = in.read();
    concepts = new IntegerArray(4096);
    StreamDecompressor sddocs = new StreamDecompressor(in);
    sddocs.ascDecode(k1, concepts);
    int k2 = in.read();
    offsets = new IntegerArray(concepts.cardinality() + 1);
    offsets.add(0);
    StreamDecompressor sdoffsets = new StreamDecompressor(in);
    sdoffsets.ascDecode(k2, offsets);     
    in.close();

    // Read the Lists data
    url = getURL("DOCS");
    connect = url.openConnection();
    in = new BufferedInputStream(connect.getInputStream());
    // Note: I'd rather look a the length in the URLConnection
    // and read in all the data at once, but it doesn't work on 1.1
    ByteArrayOutputStream data = new ByteArrayOutputStream();
    byte [] buff = new byte[512];
    int i = 0;
    while ((i = in.read(buff)) != -1) {
      data.write(buff, 0, i);
    }
    allLists = data.toByteArray();
    in.close();

    // Read the positions offset data
    url = getURL("OFFSETS");
    connect = url.openConnection();
    in = new BufferedInputStream(connect.getInputStream());
    k1 = in.read();
    documents = new IntegerArray(4096);
    sddocs = new StreamDecompressor(in);
    sddocs.ascDecode(k1, documents);
    k2 = in.read();
    offsets2 = new IntegerArray(documents.cardinality() + 1);
    sdoffsets = new StreamDecompressor(in);
    sdoffsets.ascDecode(k2, offsets2);
    // decompress titles' ids table
    int k3 = in.read();
    titles = new IntegerArray(documents.cardinality());
    StreamDecompressor sdtitles = new StreamDecompressor(in);
    sdtitles.decode(k3, titles);
    in.close();

    // Read in the Positions data
    RAFFileFactory factory = RAFFileFactory.create();
    url = getURL("POSITIONS");
    positionsFile = factory.get(url, false);
  }

  /**
   * For printf debugging.
   */
  private static boolean debugFlag = false;
  private static void debug(String str) {
    if( debugFlag ) {
      System.out.println("SearchEnvironment: " + str);
    }
  }
}