BtreeCheck Member List

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

Btree::add(const string &key, string tag)	Btree
FlintTable::add(const string &key, string tag, bool already_compressed=false)	FlintTable
Btree::add_item(Item_wr kt, int j)	Btree	[protected]
FlintTable::add_item(Item_wr_ kt, int j)	FlintTable	[protected]
Btree::add_item_to_block(byte *p, Item_wr kt, int c)	Btree	[protected]
FlintTable::add_item_to_block(byte *p, Item_wr_ kt, int c)	FlintTable	[protected]
Btree::add_kt(bool found)	Btree	[protected]
FlintTable::add_kt(bool found)	FlintTable	[protected]
Btree::alter()	Btree	[protected]
FlintTable::alter()	FlintTable	[protected]
Btree::base	Btree	[protected]
FlintTable::base	FlintTable	[protected]
Btree::base_letter	Btree	[protected]
FlintTable::base_letter	FlintTable	[protected]
Btree::basic_open(bool revision_supplied, quartz_revision_number_t revision)	Btree	[protected]
FlintTable::basic_open(bool revision_supplied, flint_revision_number_t revision)	FlintTable	[protected]
block_check(Cursor_ *C_, int j, int opts)	BtreeCheck	[private]
block_check(Cursor *C_, int j, int opts)	BtreeCheck	[private]
Btree::block_given_by(const byte *p, int c)	Btree	[protected, static]
FlintTable::block_given_by(const byte *p, int c)	FlintTable	[protected, static]
Btree::block_size	Btree	[protected]
FlintTable::block_size	FlintTable	[protected]
Btree::block_to_cursor(Cursor *C_, int j, uint4 n) const	Btree	[protected]
FlintTable::block_to_cursor(Cursor_ *C_, int j, uint4 n) const	FlintTable	[protected]
block_usage(const byte *p) const	BtreeCheck	[private]
block_usage(const byte *p) const	BtreeCheck	[private]
Btree::both_bases	Btree	[mutable, protected]
FlintTable::both_bases	FlintTable	[mutable, protected]
Btree(string path_, bool readonly_)	Btree
Btree::Btree_modified	Btree	[mutable, protected]
FlintTable::Btree_modified	FlintTable	[mutable, protected]
BtreeCheck(const std::string &name_, bool readonly, std::ostream &out_)	BtreeCheck	[inline, private]
BtreeCheck(const std::string &name_, bool readonly, std::ostream &out_)	BtreeCheck	[inline, private]
Btree::buffer	Btree	[protected]
FlintTable::buffer	FlintTable	[protected]
Btree::C	Btree	[mutable, protected]
FlintTable::C	FlintTable	[mutable, protected]
Btree::cancel()	Btree
FlintTable::cancel()	FlintTable
Btree::changed_c	Btree	[protected]
FlintTable::changed_c	FlintTable	[protected]
Btree::changed_n	Btree	[protected]
FlintTable::changed_n	FlintTable	[protected]
check(const string &name, int opts, std::ostream &out=std::cout)	BtreeCheck	[static]
check(const string &name, int opts, std::ostream &out=std::cout)	BtreeCheck	[static]
Btree::close()	Btree
FlintTable::close(bool permanent=false)	FlintTable
Btree::commit(quartz_revision_number_t revision)	Btree
FlintTable::commit(flint_revision_number_t revision)	FlintTable
Btree::compact(byte *p)	Btree	[protected]
FlintTable::compact(byte *p)	FlintTable	[protected]
compress_strategy	FlintTable	[protected]
create(unsigned int blocksize)	Btree
create_and_open(unsigned int blocksize)	FlintTable
Btree::cursor_get() const	Btree
FlintTable::cursor_get() const	FlintTable
Btree::del(const string &key)	Btree
FlintTable::del(const string &key)	FlintTable
Btree::delete_item(int j, bool repeatedly)	Btree	[protected]
FlintTable::delete_item(int j, bool repeatedly)	FlintTable	[protected]
Btree::delete_kt()	Btree	[protected]
FlintTable::delete_kt()	FlintTable	[protected]
Btree::do_open_to_read(bool revision_supplied, quartz_revision_number_t revision_)	Btree	[protected]
FlintTable::do_open_to_read(bool revision_supplied, flint_revision_number_t revision_)	FlintTable	[protected]
Btree::do_open_to_write(bool revision_supplied, quartz_revision_number_t revision_)	Btree	[protected]
FlintTable::do_open_to_write(bool revision_supplied, flint_revision_number_t revision_, bool create_db=false)	FlintTable	[protected]
dont_close_handle	Btree	[protected]
Btree::enter_key(int j, Key prevkey, Key newkey)	Btree	[protected]
FlintTable::enter_key(int j, Key_ prevkey, Key_ newkey)	FlintTable	[protected]
erase()	FlintTable
Btree::exists() const	Btree
FlintTable::exists() const	FlintTable
failure(int n) const	BtreeCheck	[private]
Btree::faked_root_block	Btree	[protected]
FlintTable::faked_root_block	FlintTable	[protected]
Btree::find(Cursor *) const	Btree	[protected]
FlintTable::find(Cursor_ *) const	FlintTable	[protected]
Btree::find_in_block(const byte *p, Key key, bool leaf, int c)	Btree	[protected, static]
FlintTable::find_in_block(const byte *p, Key_ key, bool leaf, int c)	FlintTable	[protected, static]
Btree::find_tag(const string &key, string *tag) const	Btree
FlintTable::find_tag(const string &key, string *tag) const	FlintTable
FlintTable(string path_, bool readonly_, int compress_strategy_=DONT_COMPRESS, bool lazy=false)	FlintTable
Btree::form_key(const string &key) const	Btree	[protected]
FlintTable::form_key(const string &key) const	FlintTable	[protected]
Btree::full_compaction	Btree	[protected]
FlintTable::full_compaction	FlintTable	[protected]
get_block_size() const	FlintTable	[inline]
Btree::get_entry_count() const	Btree	[inline]
FlintTable::get_entry_count() const	FlintTable	[inline]
Btree::get_exact_entry(const string &key, string &tag) const	Btree
FlintTable::get_exact_entry(const string &key, string &tag) const	FlintTable
Btree::get_latest_revision_number() const	Btree	[inline]
FlintTable::get_latest_revision_number() const	FlintTable	[inline]
Btree::get_open_revision_number() const	Btree	[inline]
FlintTable::get_open_revision_number() const	FlintTable	[inline]
Btree::handle	Btree	[protected]
FlintTable::handle	FlintTable	[protected]
Btree::is_modified() const	Btree	[inline]
FlintTable::is_modified() const	FlintTable	[inline]
Btree::item_count	Btree	[protected]
FlintTable::item_count	FlintTable	[protected]
key_exists(const string &key) const	FlintTable
Btree::kt	Btree	[mutable, protected]
FlintTable::kt	FlintTable	[mutable, protected]
Btree::latest_revision_number	Btree	[mutable, protected]
FlintTable::latest_revision_number	FlintTable	[mutable, protected]
lazy	FlintTable	[protected]
Btree::level	Btree	[protected]
FlintTable::level	FlintTable	[protected]
Btree::max_item_size	Btree	[protected]
FlintTable::max_item_size	FlintTable	[protected]
Btree::mid_point(byte *p)	Btree	[protected]
FlintTable::mid_point(byte *p)	FlintTable	[protected]
Btree::name	Btree	[protected]
FlintTable::name	FlintTable	[protected]
Btree::next(Cursor *C_, int j) const	Btree	[inline, protected]
FlintTable::next(Cursor_ *C_, int j) const	FlintTable	[inline, protected]
Btree::next_default(Cursor *C_, int j) const	Btree	[protected]
FlintTable::next_default(Cursor_ *C_, int j) const	FlintTable	[protected]
Btree::next_for_sequential(Cursor *C_, int dummy) const	Btree	[protected]
FlintTable::next_for_sequential(Cursor_ *C_, int dummy) const	FlintTable	[protected]
next_ptr	Btree	[protected]
Btree::open()	Btree
Btree::open(quartz_revision_number_t revision_)	Btree
FlintTable::open()	FlintTable
FlintTable::open(flint_revision_number_t revision_)	FlintTable
Btree::other_base_letter	Btree	[protected]
FlintTable::other_base_letter() const	FlintTable	[inline, protected]
out	BtreeCheck	[mutable, private]
out	BtreeCheck	[mutable, private]
Btree::prev(Cursor *C_, int j) const	Btree	[inline, protected]
FlintTable::prev(Cursor_ *C_, int j) const	FlintTable	[inline, protected]
Btree::prev_default(Cursor *C_, int j) const	Btree	[protected]
FlintTable::prev_default(Cursor_ *C_, int j) const	FlintTable	[protected]
Btree::prev_for_sequential(Cursor *C_, int dummy) const	Btree	[protected]
FlintTable::prev_for_sequential(Cursor_ *C_, int dummy) const	FlintTable	[protected]
prev_ptr	Btree	[protected]
print_bytes(int n, const byte *p) const	BtreeCheck	[private]
print_bytes(int n, const byte *p) const	BtreeCheck	[private]
print_key(const byte *p, int c, int j) const	BtreeCheck	[private]
print_key(const byte *p, int c, int j) const	BtreeCheck	[private]
print_spaces(int n) const	BtreeCheck	[private]
print_spaces(int n) const	BtreeCheck	[private]
print_tag(const byte *p, int c, int j) const	BtreeCheck	[private]
print_tag(const byte *p, int c, int j) const	BtreeCheck	[private]
Btree::read_block(uint4 n, byte *p) const	Btree	[protected]
FlintTable::read_block(uint4 n, byte *p) const	FlintTable	[protected]
Btree::read_root()	Btree	[protected]
FlintTable::read_root()	FlintTable	[protected]
Btree::read_tag(Cursor *C_, string *tag) const	Btree
FlintTable::read_tag(Cursor_ *C_, string *tag, bool keep_compressed) const	FlintTable
report_block(int m, int n, const byte *p) const	BtreeCheck	[private]
report_block(int m, int n, const byte *p) const	BtreeCheck	[private]
report_block_full(int m, int n, const byte *p) const	BtreeCheck	[private]
report_block_full(int m, int n, const byte *p) const	BtreeCheck	[private]
report_cursor(int N, const Cursor_ *C_) const	BtreeCheck	[private]
report_cursor(int N, const Cursor *C_) const	BtreeCheck	[private]
Btree::revision_number	Btree	[protected]
FlintTable::revision_number	FlintTable	[protected]
Btree::root	Btree	[protected]
FlintTable::root	FlintTable	[protected]
Btree::seq_count	Btree	[protected]
FlintTable::seq_count	FlintTable	[protected]
Btree::sequential	Btree	[protected]
FlintTable::sequential	FlintTable	[protected]
set_block_size(unsigned int block_size_)	FlintTable
Btree::set_full_compaction(bool parity)	Btree
FlintTable::set_full_compaction(bool parity)	FlintTable
Btree::set_max_item_size(size_t block_capacity)	Btree	[inline]
FlintTable::set_max_item_size(size_t block_capacity)	FlintTable	[inline]
Btree::split_p	Btree	[protected]
FlintTable::split_p	FlintTable	[protected]
Btree::split_root(uint4 split_n)	Btree	[protected]
FlintTable::split_root(uint4 split_n)	FlintTable	[protected]
Btree::writable	Btree	[protected]
FlintTable::writable	FlintTable	[protected]
Btree::write_block(uint4 n, const byte *p) const	Btree	[protected]
FlintTable::write_block(uint4 n, const byte *p) const	FlintTable	[protected]
XAPIAN_NORETURN(void failure(int n) const)	BtreeCheck	[private]
Btree::XAPIAN_NORETURN(void set_overwritten() const)	Btree	[protected]
FlintTable::XAPIAN_NORETURN(void set_overwritten() const)	FlintTable	[protected]
~Btree()	Btree
~FlintTable()	FlintTable

---