QuartzTermListTable Member List

This is the complete list of members for QuartzTermListTable, including all inherited members.

add(const string &key, string tag)	Btree
add_item(Item_wr kt, int j)	Btree	[protected]
add_item_to_block(byte *p, Item_wr kt, int c)	Btree	[protected]
add_kt(bool found)	Btree	[protected]
alter()	Btree	[protected]
base	Btree	[protected]
base_letter	Btree	[protected]
basic_open(bool revision_supplied, quartz_revision_number_t revision)	Btree	[protected]
block_given_by(const byte *p, int c)	Btree	[protected, static]
block_size	Btree	[protected]
block_to_cursor(Cursor *C_, int j, uint4 n) const	Btree	[protected]
both_bases	Btree	[mutable, protected]
Btree(string path_, bool readonly_)	Btree
Btree_modified	Btree	[mutable, protected]
buffer	Btree	[protected]
C	Btree	[mutable, protected]
cancel()	Btree
changed_c	Btree	[protected]
changed_n	Btree	[protected]
close()	Btree
commit(quartz_revision_number_t revision)	Btree
compact(byte *p)	Btree	[protected]
create(unsigned int blocksize)	Btree
cursor_get() const	Btree
del(const string &key)	Btree
delete_item(int j, bool repeatedly)	Btree	[protected]
delete_kt()	Btree	[protected]
delete_termlist(Xapian::docid did)	QuartzTermListTable
do_open_to_read(bool revision_supplied, quartz_revision_number_t revision_)	Btree	[protected]
do_open_to_write(bool revision_supplied, quartz_revision_number_t revision_)	Btree	[protected]
dont_close_handle	Btree	[protected]
enter_key(int j, Key prevkey, Key newkey)	Btree	[protected]
exists() const	Btree
faked_root_block	Btree	[protected]
find(Cursor *) const	Btree	[protected]
find_in_block(const byte *p, Key key, bool leaf, int c)	Btree	[protected, static]
find_tag(const string &key, string *tag) const	Btree
form_key(const string &key) const	Btree	[protected]
full_compaction	Btree	[protected]
get_entry_count() const	Btree	[inline]
get_exact_entry(const string &key, string &tag) const	Btree
get_latest_revision_number() const	Btree	[inline]
get_open_revision_number() const	Btree	[inline]
handle	Btree	[protected]
is_modified() const	Btree	[inline]
item_count	Btree	[protected]
kt	Btree	[mutable, protected]
latest_revision_number	Btree	[mutable, protected]
level	Btree	[protected]
max_item_size	Btree	[protected]
mid_point(byte *p)	Btree	[protected]
name	Btree	[protected]
next(Cursor *C_, int j) const	Btree	[inline, protected]
next_default(Cursor *C_, int j) const	Btree	[protected]
next_for_sequential(Cursor *C_, int dummy) const	Btree	[protected]
next_ptr	Btree	[protected]
open()	Btree
open(quartz_revision_number_t revision_)	Btree
other_base_letter	Btree	[protected]
prev(Cursor *C_, int j) const	Btree	[inline, protected]
prev_default(Cursor *C_, int j) const	Btree	[protected]
prev_for_sequential(Cursor *C_, int dummy) const	Btree	[protected]
prev_ptr	Btree	[protected]
QuartzTermListTable(string path_, bool readonly_)	QuartzTermListTable	[inline]
read_block(uint4 n, byte *p) const	Btree	[protected]
read_root()	Btree	[protected]
read_tag(Cursor *C_, string *tag) const	Btree
revision_number	Btree	[protected]
root	Btree	[protected]
seq_count	Btree	[protected]
sequential	Btree	[protected]
set_entries(Xapian::docid did, Xapian::TermIterator t, const Xapian::TermIterator &t_end, quartz_doclen_t doclen, bool store_termfreqs)	QuartzTermListTable
set_full_compaction(bool parity)	Btree
set_max_item_size(size_t block_capacity)	Btree	[inline]
split_p	Btree	[protected]
split_root(uint4 split_n)	Btree	[protected]
writable	Btree	[protected]
write_block(uint4 n, const byte *p) const	Btree	[protected]
XAPIAN_NORETURN(void set_overwritten() const)	Btree	[protected]
~Btree()	Btree

---