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
|
/*
* @(#)ConceptData.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;
class ConceptData
{
private final byte _query;
private final byte _nColumns;
private final byte _role;
private final int _concept;
private int _conceptLength;
private final int _proximity;
private final double _penalty;
private ConceptData _next;
private static final int ProxPerTerm = 100;
public ConceptData(int id, int role, double score, int query, int nColumns)
{
_query = (byte)query;
_nColumns = (byte)nColumns;
_concept = id;
_proximity = nColumns * ProxPerTerm;
_role = (byte)role;
_penalty = score;
_next = null;
}
public int getConcept() {
return _concept;
}
public double getPenalty() {
return _penalty;
}
public int getConceptLength() {
return _conceptLength;
}
public byte getRole() {
return _role;
}
public byte getQuery() {
return _query;
}
public byte getNColumns() {
return _nColumns;
}
public double getScore() {
return _penalty;
}
public ConceptData getNext() {
return _next;
}
public int getQueryMask() {
return (_next != null ? _next.getQueryMask() : 0) | (1 << _query);
}
public void setConceptLength(int length)
{
_conceptLength = length;
if (_next != null)
_next.setConceptLength(length);
}
public void setNext(ConceptData next) {
_next = next;
}
boolean cEquals(ConceptData other) {
return _concept == other._concept;
}
boolean crEquals(ConceptData other) {
return _concept == other._concept && _role == other._role;
}
boolean crqEquals(ConceptData other) {
return _concept == other._concept && _role == other._role &&
_query == other._query;
}
void addLast(ConceptData other)
{
if (_next != null)
_next.addLast(other);
else
_next = other;
}
boolean compareWith(ConceptData other) {
return _concept < other._concept
|| cEquals(other) && _role < other._role
|| crEquals(other) && _penalty < other._penalty;
}
public void runBy(Query[] queries)
{
ConceptData cd = this;
do
queries[cd._query].updateEstimate(cd._role, cd._penalty);
while ((cd = cd._next) != null);
}
public void generateFillers(RoleFiller[] array, int pos)
{
if (array[_query] != RoleFiller.STOP) // 'prohibited'
(new RoleFiller(_nColumns, this, _role, pos, pos + _proximity))
.use(array, _query);
if (_next != null)
_next.generateFillers(array, pos);
}
}
|
