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
|
/** @file leafpostlist.cc
* @brief Abstract base class for leaf postlists.
*/
/* Copyright (C) 2007,2009,2011,2013,2014 Olly Betts
* Copyright (C) 2009 Lemur Consulting Ltd
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* This program 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 for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <config.h>
#include "xapian/weight.h"
#include "leafpostlist.h"
#include "matcher/orpositionlist.h"
#include "omassert.h"
#include "debuglog.h"
using namespace std;
LeafPostList::~LeafPostList()
{
delete weight;
}
Xapian::doccount
LeafPostList::get_termfreq_min() const
{
return get_termfreq();
}
Xapian::doccount
LeafPostList::get_termfreq_max() const
{
return get_termfreq();
}
Xapian::doccount
LeafPostList::get_termfreq_est() const
{
return get_termfreq();
}
void
LeafPostList::set_termweight(const Xapian::Weight * weight_)
{
// This method shouldn't be called more than once on the same object.
Assert(!weight);
weight = weight_;
need_doclength = weight->get_sumpart_needs_doclength_();
need_unique_terms = weight->get_sumpart_needs_uniqueterms_();
}
double
LeafPostList::get_maxweight() const
{
return weight ? weight->get_maxpart() : 0;
}
double
LeafPostList::get_weight() const
{
if (!weight) return 0;
Xapian::termcount doclen = 0, unique_terms = 0;
// Fetching the document length and number of unique terms is work we can
// avoid if the weighting scheme doesn't use them.
if (need_doclength)
doclen = get_doclength();
if (need_unique_terms)
unique_terms = get_unique_terms();
double sumpart = weight->get_sumpart(get_wdf(), doclen, unique_terms);
AssertRel(sumpart, <=, weight->get_maxpart());
return sumpart;
}
double
LeafPostList::recalc_maxweight()
{
return LeafPostList::get_maxweight();
}
TermFreqs
LeafPostList::get_termfreq_est_using_stats(
const Xapian::Weight::Internal & stats) const
{
LOGCALL(MATCH, TermFreqs, "LeafPostList::get_termfreq_est_using_stats", stats);
if (term.empty()) {
RETURN(TermFreqs(stats.collection_size,
stats.rset_size,
stats.total_term_count));
}
map<string, TermFreqs>::const_iterator i = stats.termfreqs.find(term);
Assert(i != stats.termfreqs.end());
RETURN(i->second);
}
Xapian::termcount
LeafPostList::count_matching_subqs() const
{
return weight ? 1 : 0;
}
void
LeafPostList::gather_position_lists(OrPositionList* orposlist)
{
orposlist->add_poslist(read_position_list());
}
LeafPostList *
LeafPostList::open_nearby_postlist(const std::string &) const
{
return NULL;
}
|
