Struct btree_insert_list¶

Public Types¶

Type	Name
enum	btree_insert_list

Type	Name
size_t	add_key (const DB_VALUE * key, const OID & oid)
	btree_insert_list () = delete
	btree_insert_list (const TP_DOMAIN *& key_type)
	btree_insert_list (DB_VALUE * key, OID * oid)
bool	check_release_latch (THREAD_ENTRY * thread_p, void * arg, PAGE_PTR leaf_page)
DB_VALUE *	get_key ()
OID *	get_oid ()
int	next_key ()
void	prepare_list (void)
void	reset_boundary_keys ()
	~btree_insert_list ()

enum btree_insert_list::btree_insert_list {
    KEY_AVAILABLE = 0,
    KEY_NOT_AVAILABLE
};

page_key_boundary btree_insert_list::m_boundaries;

DB_VALUE* btree_insert_list::m_curr_key;

OID* btree_insert_list::m_curr_oid;

int btree_insert_list::m_curr_pos;

int btree_insert_list::m_ignored_nulls_cnt;

int btree_insert_list::m_keep_page_iterations;

const TP_DOMAIN* btree_insert_list::m_key_type;

std::vector<key_oid> btree_insert_list::m_keys_oids;

int btree_insert_list::m_ovf_appends;

int btree_insert_list::m_ovf_appends_new_page;

std::vector<key_oid*> btree_insert_list::m_sorted_keys_oids;

bool btree_insert_list::m_use_page_boundary_check;

bool btree_insert_list::m_use_sorted_bulk_insert;

size_t btree_insert_list::add_key (
    const  DB_VALUE * key,
    const  OID & oid
)

btree_insert_list::btree_insert_list () = delete

inline btree_insert_list::btree_insert_list (
    const  TP_DOMAIN *& key_type
)

btree_insert_list::btree_insert_list (
    DB_VALUE * key,
    OID * oid
)

bool btree_insert_list::check_release_latch (
    THREAD_ENTRY * thread_p,
    void * arg,
    PAGE_PTR leaf_page
)

inline DB_VALUE * btree_insert_list::get_key ()

inline OID * btree_insert_list::get_oid ()

int btree_insert_list::next_key ()

void btree_insert_list::prepare_list (
    void
)

void btree_insert_list::reset_boundary_keys ()

btree_insert_list::~btree_insert_list ()

The documentation for this class was generated from the following file cubrid/src/storage/btree.h