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
|
/*
* @(#)RoleFiller.java 1.6 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.
*/
/**
* @date 1/13/98
* @author Jacek R. Ambroziak
* @group Sun Microsystems Laboratories
*/
package com.sun.java.help.search;
import java.io.PrintStream;
class RoleFiller
{
static int Threshold = 300;
private ConceptData _conceptData;
private byte _fixedRole;
private short _filled;
private int _begin;
private int _end;
private int _limit;
private RoleFiller _next;
private RoleFiller[] _fillers;
public static final RoleFiller STOP = new RoleFiller();
private RoleFiller() {}
public RoleFiller(int nColumns, ConceptData first, int role,
int pos, int limit)
{
_conceptData = first;
_fixedRole = (byte)role; // primary/constitutive concept/role
_filled = (short)(1 << _fixedRole);
_begin = pos; // offset in file
_end = _begin + first.getConceptLength();
_limit = limit;
_next = null;
_fillers = new RoleFiller[nColumns];
_fillers[role] = this;
}
public void print(PrintStream out) {
out.println(_begin + ", " + _end);
}
void makeQueryHit(Query q, int nColumns, int doc, double penalty)
{
if (q.goodEnough(penalty))
{
int[] array =
q.getConceptArrayOfNewHit(penalty,
new Location(doc, _begin, _end));
for (int i = 0; i < nColumns; i++)
array[i] = (_filled & 1 << i) != 0 ? _fillers[i].getConcept() : 0;
}
}
boolean isHit() {
return _filled > (1 << _fixedRole);
}
double getScore() {
return _conceptData.getScore();
}
int getConcept() {
return _conceptData.getConcept();
}
RoleFiller next() {
return _next;
}
void use(RoleFiller[] place, int index)
{
if (place[index] != null)
{
RoleFiller rf = place[index];
place[index] = this;
_next = rf;
while (rf._limit >= _begin)
{
// check if we can grow/improve a hit
// we don't ever replace filler's fixed role
if (_fixedRole != rf._fixedRole)
{
if ((rf._filled & (1 << _fixedRole)) == 0) // not filled yet
{
rf._filled |= 1 << _fixedRole;
rf._fillers[_fixedRole] = this;
rf._end = _end;
}
else
rf.considerReplacementWith(this);
}
if (rf._next != null)
rf = rf._next;
else
return;
}
}
else
place[index] = this;
}
private void considerReplacementWith(RoleFiller replacement)
{
// !!! simplistic for now
// needs gap and out of order
int role = replacement._fixedRole;
if (replacement.getScore() > _fillers[role].getScore())
_fillers[role] = replacement;
}
private double penalty(Query query, int nColumns)
{
int length = _end - _begin + 1;
double penalty = query.lookupPenalty(_filled);
// !!! here is a chance to check against query if hit worth scoring further
// might not be if query already has lots of good hits
for (int i = 0; i < nColumns; i++)
if ((_filled & (1 << i)) != 0)
{
penalty += _fillers[i]._conceptData.getPenalty();
length -= _fillers[i]._conceptData.getConceptLength() + 1;
if ((_filled >> (i + 1)) != 0)
for (int j = i + 1; j < nColumns; j++)
if ((_filled & 1 << j) != 0 && _fillers[j]._begin < _begin)
penalty += query.getOutOufOrderPenalty();
}
return penalty + length*query.getGapPenalty();
}
public void scoreList(Query query, int document)
{
int nColumns = query.getNColumns();
RoleFiller candidateHit = this; // function called for the head of list
RoleFiller next; // lookahead: if overlap, if so, is it better
// 'candidateHit' always points at the current candidate to be converted to a QueryHit
// 'penalty' is its penalty
// 'next' is used to explore earlier overlapping fillers
// the decision to emit a QueryHit is made when either there's no next
// or next doesn't overlap the current candidate
// the loop's logic makes sure that at emit time there's no better/earlier filler
// to overlap with the candidate
double penalty = candidateHit.penalty(query, nColumns);
for (next = candidateHit._next; next != null; next = next._next)
if (next._end < candidateHit._begin) // no overlap
{
candidateHit.makeQueryHit(query, nColumns, document, penalty);
candidateHit = next;
penalty = candidateHit.penalty(query, nColumns);
}
else
{
// !!! can be computed in two steps
double penalty2 = next.penalty(query, nColumns);
if (penalty2 <= penalty) // prefer next, disregard candidateHit
{
penalty = penalty2;
candidateHit = next;
}
}
candidateHit.makeQueryHit(query, nColumns, document, penalty);
}
}
|
