22 #ifndef XAPIAN_HGUARD_GLASS_SPELLINGWORDSLIST_H 23 #define XAPIAN_HGUARD_GLASS_SPELLINGWORDSLIST_H 59 : database(database_), cursor(cursor_), termfreq(0) {
GlassCursor * cursor
A cursor which runs through the spelling table reading termnames from the keys.
GlassSpellingWordsList(const GlassSpellingWordsList &)
Copying is not allowed.
Xapian::Internal::intrusive_ptr< const Xapian::Database::Internal > database
Keep a reference to our database to stop it being deleted.
std::string get_termname() const
Returns the current termname.
Abstract base class for termlists.
~GlassSpellingWordsList()
Destructor.
GlassSpellingWordsList(Xapian::Internal::intrusive_ptr< const Xapian::Database::Internal > database_, GlassCursor *cursor_)
unsigned XAPIAN_TERMCOUNT_BASE_TYPE termcount
A counts of terms.
void operator=(const GlassSpellingWordsList &)
Assignment is not allowed.
Xapian::termcount termfreq
The term frequency of the term at the current position.
Xapian::doccount get_termfreq() const
Returns the term frequency of the current term.
Abstract base class for iterating all terms in a database.
A cursor pointing to a position in a Btree table, for reading several entries in order, or finding approximate matches.
TermList * skip_to(const std::string &tname)
Advance to the first term which is >= tname.
void read_termfreq() const
Read and cache the term frequency.
unsigned XAPIAN_DOCID_BASE_TYPE doccount
A count of documents.
Interface to Btree cursors.
bool at_end() const
True if we're off the end of the list.
Abstract base class for iterating all terms in a database.
bool find_entry(const string &key)
Position the cursor on the highest entry with key <= key.
TermList * next()
Advance to the next term in the list.
Spelling correction data for a glass database.