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
|
/** @file
* @brief Iteration over terms in a document
*/
/* Copyright 2017,2024 Olly Betts
*
* 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 "documenttermlist.h"
#include "backends/inmemory/inmemory_positionlist.h"
#include "omassert.h"
#include "xapian/error.h"
using namespace std;
Xapian::termcount
DocumentTermList::get_approx_size() const
{
// DocumentTermList is only used in a TermIterator wrapper and that never
// calls this method.
Assert(false);
return 0;
}
Xapian::termcount
DocumentTermList::get_wdf() const
{
Assert(it != doc->terms->end());
return it->second.get_wdf();
}
Xapian::doccount
DocumentTermList::get_termfreq() const
{
throw Xapian::InvalidOperationError("get_termfreq() not valid for a TermIterator from a Document which is not associated with a database");
}
const Xapian::VecCOW<Xapian::termpos>*
DocumentTermList::get_vec_termpos() const
{
return it->second.get_positions();
}
PositionList*
DocumentTermList::positionlist_begin() const
{
return new InMemoryPositionList(*it->second.get_positions());
}
Xapian::termcount
DocumentTermList::positionlist_count() const
{
return it->second.count_positions();
}
TermList*
DocumentTermList::next()
{
if (it == doc->terms->end()) {
it = doc->terms->begin();
} else {
++it;
}
while (it != doc->terms->end() && it->second.is_deleted()) {
++it;
}
if (it == doc->terms->end()) {
return this;
}
current_term = it->first;
return NULL;
}
TermList*
DocumentTermList::skip_to(string_view term)
{
it = doc->terms->lower_bound(term);
while (it != doc->terms->end() && it->second.is_deleted()) {
++it;
}
if (it == doc->terms->end()) {
return this;
}
current_term = it->first;
return NULL;
}
|
