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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "hitlist.h"
#include <vespa/vespalib/objects/visit.hpp>
#include <algorithm>
#include <stdexcept>
namespace search::aggregation {
using vespalib::Serializer;
using vespalib::Deserializer;
using HitCP = vespalib::IdentifiablePtr<Hit>;
IMPLEMENT_IDENTIFIABLE_NS2(search, aggregation, HitList, ResultNode);
HitList & HitList::addHit(const FS4Hit & hit, uint32_t maxHits)
{
if (_fs4hits.size() < maxHits) {
_fs4hits.push_back(hit);
if (_fs4hits.size() == maxHits) {
std::make_heap(_fs4hits.begin(), _fs4hits.end());
}
} else {
if (hit.cmp(_fs4hits.front()) < 0) {
std::pop_heap(_fs4hits.begin(), _fs4hits.end());
_fs4hits.push_back(hit);
std::push_heap(_fs4hits.begin(), _fs4hits.end());
}
}
return *this;
}
HitList & HitList::addHit(const VdsHit & hit, uint32_t maxHits)
{
if (_vdshits.size() < maxHits) {
_vdshits.push_back(hit);
if (_vdshits.size() == maxHits) {
std::make_heap(_vdshits.begin(), _vdshits.end());
}
} else {
if (hit.cmp(_vdshits.front()) < 0) {
std::pop_heap(_vdshits.begin(), _vdshits.end());
_vdshits.push_back(hit);
std::push_heap(_vdshits.begin(), _vdshits.end());
}
}
return *this;
}
void
HitList::onMerge(const HitList & b)
{
_fs4hits.insert(_fs4hits.end(), b._fs4hits.begin(), b._fs4hits.end());
_vdshits.insert(_vdshits.end(), b._vdshits.begin(), b._vdshits.end());
}
void
HitList::sort()
{
std::sort(_fs4hits.begin(), _fs4hits.end());
std::sort(_vdshits.begin(), _vdshits.end());
}
void
HitList::postMerge(uint32_t maxHits)
{
sort();
if (_fs4hits.size() > maxHits) {
_fs4hits.resize(maxHits);
}
if (_vdshits.size() > maxHits) {
_vdshits.resize(maxHits);
}
}
Serializer &
HitList::onSerialize(Serializer & os) const
{
os << (uint32_t)(_fs4hits.size() + _vdshits.size());
for (uint32_t i(0); i < _fs4hits.size(); i++) {
HitCP hit(const_cast<FS4Hit *>(&_fs4hits[i]));
os << hit;
hit.release();
}
for (uint32_t i(0); i < _vdshits.size(); i++) {
HitCP hit(const_cast<VdsHit *>(&_vdshits[i]));
os << hit;
hit.release();
}
return os;
}
Deserializer &
HitList::onDeserialize(Deserializer & is)
{
uint32_t count(0);
is >> count;
for (uint32_t i(0); i < count; i++) {
HitCP hit;
is >> hit;
if (hit->inherits(FS4Hit::classId)) {
_fs4hits.push_back(static_cast<const FS4Hit &>(*hit));
} else {
_vdshits.push_back(static_cast<const VdsHit &>(*hit));
}
}
return is;
}
void
HitList::clear()
{
_fs4hits.clear();
_vdshits.clear();
}
void
HitList::visitMembers(vespalib::ObjectVisitor & visitor) const
{
visit(visitor, "fs4hits", _fs4hits);
visit(visitor, "vdshits", _vdshits);
}
void
HitList::selectMembers(const vespalib::ObjectPredicate & predicate, vespalib::ObjectOperation & operation)
{
for (uint32_t i(0); i < _fs4hits.size(); ++i) {
_fs4hits[i].select(predicate, operation);
}
for (uint32_t i(0); i < _vdshits.size(); ++i) {
_vdshits[i].select(predicate, operation);
}
}
void
HitList::set(const ResultNode & rhs)
{
(void) rhs;
throw std::runtime_error("HitList::set(const ResultNode & rhs) not implemented.");
}
}
// this function was added by ../../forcelink.sh
void forcelink_file_searchlib_aggregation_hitlist() {}
|
