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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.vdslib;
import com.yahoo.vespa.objects.BufferSerializer;
import com.yahoo.vespa.objects.Deserializer;
import java.io.UnsupportedEncodingException;
import java.nio.ByteOrder;
import java.util.Map;
import java.util.TreeMap;
public class SearchResult {
public static class Hit implements Comparable<Hit> {
private String docId;
private double rank;
public Hit(Hit h) {
docId = h.docId;
rank = h.rank;
}
public Hit(String docId, double rank) {
this.rank = rank;
this.docId = docId;
}
final public String getDocId() { return docId; }
final public double getRank() { return rank; }
final public void setRank(double rank) { this.rank = rank; }
public int compareTo(Hit h) {
return (h.rank < rank) ? -1 : (h.rank > rank) ? 1 : 0; // Sort order: descending
}
}
public static class HitWithSortBlob extends Hit {
private byte [] sortBlob;
public HitWithSortBlob(Hit h, byte [] sb) {
super(h);
sortBlob = sb;
}
final public byte [] getSortBlob() { return sortBlob; }
public int compareTo(Hit h) {
HitWithSortBlob b = (HitWithSortBlob) h;
int m = java.lang.Math.min(sortBlob.length, b.sortBlob.length);
for (int i = 0; i < m; i++) {
if (sortBlob[i] != b.sortBlob[i]) {
return (((int)sortBlob[i]) & 0xff) < (((int)b.sortBlob[i]) & 0xff) ? -1 : 1;
}
}
return sortBlob.length - b.sortBlob.length;
}
}
private int totalHits;
private Hit[] hits;
private TreeMap<Integer, byte []> aggregatorList;
private TreeMap<Integer, byte []> groupingList;
public SearchResult(Deserializer buf) {
BufferSerializer bser = (BufferSerializer) buf; // TODO: dirty cast. must do this differently
bser.order(ByteOrder.BIG_ENDIAN);
this.totalHits = buf.getInt(null);
int numHits = buf.getInt(null);
hits = new Hit[numHits];
if (numHits != 0) {
int docIdBufferLength = buf.getInt(null);
byte[] cArr = bser.getBuf().array();
int start = bser.getBuf().arrayOffset() + bser.position();
for(int i=0; i < numHits; i++) {
int end = start;
while (cArr[end++] != 0);
try {
hits[i] = new Hit(new String(cArr, start, end-start-1, "utf-8"), 0);
} catch (UnsupportedEncodingException e) {
throw new RuntimeException("UTF-8 apparently not supported");
}
start = end;
}
bser.position(start - bser.getBuf().arrayOffset());
for(int i=0; i < numHits; i++) {
hits[i].setRank(buf.getDouble(null));
}
}
int numSortBlobs = buf.getInt(null);
int [] size = new int [numSortBlobs];
for (int i = 0; i < numSortBlobs; i++) {
size[i] = buf.getInt(null);
}
for (int i = 0; i < numSortBlobs; i++) {
hits[i] = new HitWithSortBlob(hits[i], buf.getBytes(null, size[i]));
}
int numAggregators = buf.getInt(null);
aggregatorList = new TreeMap<Integer, byte []>();
for (int i = 0; i < numAggregators; i++) {
int aggrId = buf.getInt(null);
int aggrLength = buf.getInt(null);
aggregatorList.put(aggrId, buf.getBytes(null, aggrLength));
}
int numGroupings = buf.getInt(null);
groupingList = new TreeMap<Integer, byte []>();
for (int i = 0; i < numGroupings; i++) {
int aggrId = buf.getInt(null);
int aggrLength = buf.getInt(null);
groupingList.put(aggrId, buf.getBytes(null, aggrLength));
}
}
/**
* Constructs a new message from a byte buffer.
*
* @param buffer A byte buffer that contains a serialized message.
*/
public SearchResult(byte[] buffer) {
this(BufferSerializer.wrap(buffer));
}
final public int getHitCount() { return hits.length; }
final public int getTotalHitCount() { return (totalHits != 0) ? totalHits : getHitCount(); }
final public Hit getHit(int hitNo) { return hits[hitNo]; }
final public Map<Integer, byte []> getAggregatorList() { return aggregatorList; }
final public Map<Integer, byte []> getGroupingList() { return groupingList; }
}
|
