My Project
|
Public Member Functions | |
QUICK_ROR_INTERSECT_SELECT (THD *thd, TABLE *table, bool retrieve_full_rows, MEM_ROOT *parent_alloc) | |
int | init () |
void | need_sorted_output () |
int | reset (void) |
int | get_next () |
bool | reverse_sorted () const |
bool | reverse_sort_possible () const |
bool | unique_key_range () |
int | get_type () |
void | add_keys_and_lengths (String *key_names, String *used_lengths) |
void | add_info_string (String *str) |
bool | is_keys_used (const MY_BITMAP *fields) |
void | dbug_dump (int indent, bool verbose) |
int | init_ror_merged_scan (bool reuse_handler) |
bool | push_quick_back (QUICK_RANGE_SELECT *quick_sel_range) |
virtual bool | is_valid () |
Public Attributes | |
List< QUICK_RANGE_SELECT > | quick_selects |
QUICK_RANGE_SELECT * | cpk_quick |
MEM_ROOT | alloc |
THD * | thd |
bool | need_to_fetch_row |
bool | scans_inited |
virtual bool QUICK_ROR_INTERSECT_SELECT::is_valid | ( | ) | [inline, virtual] |
Simple sanity check that the quick select has been set up correctly. Function is overridden by quick selects that merge indices.
Reimplemented from QUICK_SELECT_I.
bool QUICK_ROR_INTERSECT_SELECT::reverse_sort_possible | ( | ) | const [inline, virtual] |
Whether the range access method is capable of returning records in reverse order.
Implements QUICK_SELECT_I.
bool QUICK_ROR_INTERSECT_SELECT::reverse_sorted | ( | ) | const [inline, virtual] |
Whether the range access method returns records in reverse order.
Implements QUICK_SELECT_I.