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
|
/** @file chert_spellingwordslist.cc
* @brief Iterator for the spelling correction words in a chert database.
*/
/* Copyright (C) 2004,2005,2006,2007,2008 Olly Betts
* Copyright (C) 2007 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 "chert_spellingwordslist.h"
#include "xapian/error.h"
#include "xapian/types.h"
#include "debuglog.h"
#include "pack.h"
#include "stringutils.h"
ChertSpellingWordsList::~ChertSpellingWordsList()
{
LOGCALL_DTOR(DB, "ChertSpellingWordsList");
delete cursor;
}
string
ChertSpellingWordsList::get_termname() const
{
LOGCALL(DB, string, "ChertSpellingWordsList::get_termname", NO_ARGS);
Assert(cursor);
Assert(!at_end());
Assert(!cursor->current_key.empty());
Assert(cursor->current_key[0] == 'W');
RETURN(cursor->current_key.substr(1));
}
Xapian::doccount
ChertSpellingWordsList::get_termfreq() const
{
LOGCALL(DB, Xapian::doccount, "ChertSpellingWordsList::get_termfreq", NO_ARGS);
Assert(cursor);
Assert(!at_end());
Assert(!cursor->current_key.empty());
Assert(cursor->current_key[0] == 'W');
cursor->read_tag();
Xapian::termcount freq;
const char *p = cursor->current_tag.data();
if (!unpack_uint_last(&p, p + cursor->current_tag.size(), &freq)) {
throw Xapian::DatabaseCorruptError("Bad spelling word freq");
}
RETURN(freq);
}
Xapian::termcount
ChertSpellingWordsList::get_collection_freq() const
{
throw Xapian::InvalidOperationError("ChertSpellingWordsList::get_collection_freq() not meaningful");
}
TermList *
ChertSpellingWordsList::next()
{
LOGCALL(DB, TermList *, "ChertSpellingWordsList::next", NO_ARGS);
Assert(!at_end());
cursor->next();
if (!cursor->after_end() && !startswith(cursor->current_key, 'W')) {
// We've reached the end of the prefixed terms.
cursor->to_end();
}
RETURN(NULL);
}
TermList *
ChertSpellingWordsList::skip_to(const string &tname)
{
LOGCALL(DB, TermList *, "ChertSpellingWordsList::skip_to", tname);
Assert(!at_end());
if (!cursor->find_entry_ge("W" + tname)) {
// The exact term we asked for isn't there, so check if the next
// term after it also has a W prefix.
if (!cursor->after_end() && !startswith(cursor->current_key, 'W')) {
// We've reached the end of the prefixed terms.
cursor->to_end();
}
}
RETURN(NULL);
}
bool
ChertSpellingWordsList::at_end() const
{
LOGCALL(DB, bool, "ChertSpellingWordsList::at_end", NO_ARGS);
RETURN(cursor->after_end());
}
|
