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
|
/*
* @(#)QueryHit.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 QueryHit
{
private int _doc;
private int _begin;
private int _end;
private double _score;
private final int[] _concepts;
public QueryHit(Location loc, double penalty, int nColumns)
{
_score = penalty;
_doc = loc.getDocument();
_begin = loc.getBegin();
_end = loc.getEnd();
_concepts = new int[nColumns];
}
public String toString() {
return "[doc = "+_doc+", "+_begin+", "+_end+", "+_score+"]";
}
public int getDocument() {
return _doc;
}
public int getBegin() {
return _begin;
}
public int getEnd() {
return _end;
}
public double getScore() {
return _score;
}
public int[] getArray() {
return _concepts;
}
public boolean betterThan(QueryHit x)
{
if (_score < x._score) return true;
if (_score > x._score) return false;
if (_begin < x._begin) return true;
if (_begin > x._begin) return false;
if (_end < x._end) return true;
if (_end > x._end) return false;
return false;
}
}
|
