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
|
/** @file
* @brief Abstract base class for leaf postlists.
*/
/* Copyright (C) 2007,2009,2011,2013,2014,2017,2024 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, see
* <https://www.gnu.org/licenses/>.
*/
#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;
}
double
LeafPostList::get_weight(Xapian::termcount doclen,
Xapian::termcount unique_terms,
Xapian::termcount wdfdocmax) const
{
if (!weight) return 0;
double sumpart = weight->get_sumpart(get_wdf(), doclen,
unique_terms, wdfdocmax);
AssertRel(sumpart, <=, weight->get_maxpart());
return sumpart;
}
double
LeafPostList::recalc_maxweight()
{
return weight ? weight->get_maxpart() : 0;
}
Xapian::termcount
LeafPostList::count_matching_subqs() const
{
return weight ? 1 : 0;
}
void
LeafPostList::gather_position_lists(OrPositionList* orposlist)
{
orposlist->add_poslist(read_position_list());
}
bool
LeafPostList::open_nearby_postlist(std::string_view, bool, LeafPostList*&) const
{
return false;
}
|
