43 LOGCALL(DB,
string,
"ChertSpellingWordsList::get_termname", NO_ARGS);
104 LOGCALL(DB,
bool,
"ChertSpellingWordsList::at_end", NO_ARGS);
ChertCursor * cursor
A cursor which runs through the spelling table reading termnames from the keys.
bool next()
Advance to the next key.
TermList * next()
Advance to the next term in the list.
#define LOGCALL_DTOR(CATEGORY, CLASS)
void to_end()
Set the cursor to be off the end of the table.
Abstract base class for termlists.
Xapian::doccount get_termfreq() const
Returns the term frequency of the current term.
Hierarchy of classes which Xapian can throw as exceptions.
unsigned XAPIAN_TERMCOUNT_BASE_TYPE termcount
A counts of terms.
bool find_entry_ge(const string &key)
Position the cursor on the lowest entry with key >= key.
string current_tag
Current tag pointed to by cursor.
std::string get_termname() const
Returns the current termname.
~ChertSpellingWordsList()
Destructor.
bool startswith(const std::string &s, char pfx)
DatabaseCorruptError indicates database corruption was detected.
bool after_end() const
Determine whether cursor is off the end of table.
string current_key
Current key pointed to by cursor.
A termlist containing all words which are spelling targets.
bool at_end() const
True if we're off the end of the list.
unsigned XAPIAN_DOCID_BASE_TYPE doccount
A count of documents.
bool read_tag(bool keep_compressed=false)
Read the tag from the table and store it in current_tag.
Pack types into strings and unpack them again.
bool unpack_uint_last(const char **p, const char *end, U *result)
Decode an unsigned integer as the last item in a string.
Various handy helpers which std::string really should provide.
TermList * skip_to(const std::string &tname)
Advance to the first term which is >= tname.
#define LOGCALL(CATEGORY, TYPE, FUNC, PARAMS)