|
drizzle
C++ MySQL-protocol-compatible database server
|
#include <btr0cur.h>
Public Attributes | |
| dict_index_t * | index |
| page_cur_t | page_cur |
| purge_node_t * | purge_node |
| buf_block_t * | left_block |
| que_thr_t * | thr |
| enum btr_cur_method | flag |
| ulint | tree_height |
| ulint | up_match |
| ulint | up_bytes |
| ulint | low_match |
| ulint | low_bytes |
| ulint | n_fields |
| ulint | n_bytes |
| ulint | fold |
| ulint | ibuf_cnt |
| btr_path_t * | path_arr |
The tree cursor: the definition appears here only for the compiler to know struct size!
| enum btr_cur_method btr_cur_struct::flag |
| ulint btr_cur_struct::fold |
| dict_index_t* btr_cur_struct::index |
| buf_block_t* btr_cur_struct::left_block |
| ulint btr_cur_struct::low_bytes |
| ulint btr_cur_struct::low_match |
| ulint btr_cur_struct::n_bytes |
| ulint btr_cur_struct::n_fields |
| page_cur_t btr_cur_struct::page_cur |
| btr_path_t* btr_cur_struct::path_arr |
| purge_node_t* btr_cur_struct::purge_node |
| que_thr_t* btr_cur_struct::thr |
| ulint btr_cur_struct::tree_height |
| ulint btr_cur_struct::up_bytes |
| ulint btr_cur_struct::up_match |
If the search mode was PAGE_CUR_LE, the number of matched fields to the the first user record to the right of the cursor record after btr_cur_search_to_nth_level; for the mode PAGE_CUR_GE, the matched fields to the first user record AT THE CURSOR or to the right of it; NOTE that the up_match and low_match values may exceed the correct values for comparison to the adjacent user record if that record is on a different leaf page! (See the note in row_ins_duplicate_key.)