blob: 033986dc90fe889de0eda0d3f9929d369199db3d (
plain) (
blame)
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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.prelude.query;
import com.yahoo.compress.IntegerCompressor;
import com.yahoo.prelude.query.textualrepresentation.Discloser;
import java.nio.ByteBuffer;
/**
* Weak And of a collection of sub-expressions:
* this behaves like an OR unless many hits are returned and then
* it starts acting more like an AND.
* Alternately it can be viewed as an n-of-m operator where n
* is 1 at first and then increases gradually to m as more hits
* are seen.
*
* @author arnej27959
*/
public final class WeakAndItem extends NonReducibleCompositeItem {
private int N;
private String index;
private int scoreThreshold = 0;
public ItemType getItemType() {
return ItemType.WEAK_AND;
}
public String getName() {
return "WAND";
}
/**
* Make a WAND item with no children. You can mention a common index or you can mention it on each child.
*
* @param index The index it shall search.
* @param N the target for minimum number of hits to produce;
* a backend will not suppress any hits in the operator
* until N hits have been produced.
**/
public WeakAndItem(String index, int N) {
this.N = N;
this.index = (index == null) ? "" : index;
}
public WeakAndItem(int N) {
this("", N);
}
/** Sets the index name of all subitems of this */
public void setIndexName(String index) {
String toSet = (index == null) ? "" : index;
super.setIndexName(toSet);
this.index = toSet;
}
public String getIndexName() {
return index;
}
/** Appends the heading of this string - <code>[getName()]([limit]) </code> */
protected void appendHeadingString(StringBuilder buffer) {
buffer.append(getName());
buffer.append("(");
buffer.append(N);
buffer.append(")");
buffer.append(" ");
}
/** The default N used if none is specified: 100 */
public static final int defaultN = 100;
/** Creates a WAND item with default N */
public WeakAndItem() {
this(defaultN);
}
public int getN() {
return N;
}
public void setN(int N) {
this.N = N;
}
public int getScoreThreshold() {
return scoreThreshold;
}
/**
* Sets the score threshold used by the backend search operator handling this WeakAndItem.
* This threshold is currently only used if the WeakAndItem is searching a RISE index field.
* The score threshold then specifies the minimum dot product score a match needs to be part of the result set.
* Default value is 0.
*
* @param scoreThreshold the score threshold.
*/
public void setScoreThreshold(int scoreThreshold) {
this.scoreThreshold = scoreThreshold;
}
protected void encodeThis(ByteBuffer buffer) {
super.encodeThis(buffer);
IntegerCompressor.putCompressedPositiveNumber(N, buffer);
putString(index, buffer);
}
@Override
public void disclose(Discloser discloser) {
super.disclose(discloser);
discloser.addProperty("N", N);
}
public int hashCode() {
return super.hashCode() + 31 * N;
}
/**
* Returns whether this item is of the same class and
* contains the same state as the given item
*/
public boolean equals(Object object) {
if (!super.equals(object)) return false;
WeakAndItem other = (WeakAndItem) object; // Ensured by superclass
if (this.N != other.N) return false;
return true;
}
}
|