24#ifndef SQL_RANGE_OPTIMIZER_GEOMETRY_INDEX_RANGE_SCAN_H_ 
   25#define SQL_RANGE_OPTIMIZER_GEOMETRY_INDEX_RANGE_SCAN_H_ 
   38                                 double expected_rows, uint index_arg,
 
   39                                 bool need_rows_in_rowid_order_arg,
 
   40                                 bool reuse_handler_arg,
 
   41                                 MEM_ROOT *return_mem_root, uint mrr_flags_arg,
 
   42                                 uint mrr_buf_size_arg,
 
   45                               index_arg, need_rows_in_rowid_order_arg,
 
   46                               reuse_handler_arg, return_mem_root,
 
   47                               mrr_flags_arg, mrr_buf_size_arg, ranges_arg),
 
A wrapper class which provides array bounds checking.
Definition: sql_array.h:47
 
Definition: geometry_index_range_scan.h:35
 
ha_rows * m_examined_rows
Definition: geometry_index_range_scan.h:52
 
int Read() override
Read a single row.
Definition: geometry_index_range_scan.cc:35
 
GeometryIndexRangeScanIterator(THD *thd, TABLE *table, ha_rows *examined_rows, double expected_rows, uint index_arg, bool need_rows_in_rowid_order_arg, bool reuse_handler_arg, MEM_ROOT *return_mem_root, uint mrr_flags_arg, uint mrr_buf_size_arg, Bounds_checked_array< QUICK_RANGE * > ranges_arg)
Definition: geometry_index_range_scan.h:37
 
Definition: index_range_scan.h:61
 
THD * thd() const
Definition: row_iterator.h:228
 
For each client connection we create a separate thread with THD serving as a thread/connection descri...
Definition: sql_lexer_thd.h:36
 
TABLE * table() const
Definition: row_iterator.h:246
 
my_off_t ha_rows
Definition: my_base.h:1141
 
The MEM_ROOT is a simple arena, where allocations are carved out of larger blocks.
Definition: my_alloc.h:83