← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to drizzled/opt_range.h

  • Committer: Monty Taylor
  • Date: 2008-08-18 23:04:17 UTC
  • mfrom: (327.1.12 drizzle)
  • Revision ID: monty@inaugust.com-20080818230417-442rhihpahnout34
Merged from trunk.

Show diffs side-by-side

added added

removed removed

Lines of Context:
drizzled/opt_range.h
117
117
  bool sorted;
118
118
  ha_rows records;  /* estimate of # of records to be retrieved */
119
119
  double  read_time; /* time to perform this retrieval          */
120
 
  TABLE   *head;
 
120
  Table   *head;
121
121
  /*
122
122
    Index this quick select uses, or MAX_KEY for quick selects
123
123
    that use several indexes
313
313
public:
314
314
  MEM_ROOT alloc;
315
315
 
316
 
  QUICK_RANGE_SELECT(THD *thd, TABLE *table,uint index_arg,bool no_alloc,
 
316
  QUICK_RANGE_SELECT(THD *thd, Table *table,uint index_arg,bool no_alloc,
317
317
                     MEM_ROOT *parent_alloc, bool *create_err);
318
318
  ~QUICK_RANGE_SELECT();
319
319
 
346
346
  }
347
347
  friend class TRP_ROR_INTERSECT;
348
348
  friend
349
 
  QUICK_RANGE_SELECT *get_quick_select_for_ref(THD *thd, TABLE *table,
 
349
  QUICK_RANGE_SELECT *get_quick_select_for_ref(THD *thd, Table *table,
350
350
                                               struct st_table_ref *ref,
351
351
                                               ha_rows records);
352
352
  friend bool get_quick_keys(PARAM *param, QUICK_RANGE_SELECT *quick, 
432
432
class QUICK_INDEX_MERGE_SELECT : public QUICK_SELECT_I
433
433
{
434
434
public:
435
 
  QUICK_INDEX_MERGE_SELECT(THD *thd, TABLE *table);
 
435
  QUICK_INDEX_MERGE_SELECT(THD *thd, Table *table);
436
436
  ~QUICK_INDEX_MERGE_SELECT();
437
437
 
438
438
  int  init();
486
486
class QUICK_ROR_INTERSECT_SELECT : public QUICK_SELECT_I
487
487
{
488
488
public:
489
 
  QUICK_ROR_INTERSECT_SELECT(THD *thd, TABLE *table,
 
489
  QUICK_ROR_INTERSECT_SELECT(THD *thd, Table *table,
490
490
                             bool retrieve_full_rows,
491
491
                             MEM_ROOT *parent_alloc);
492
492
  ~QUICK_ROR_INTERSECT_SELECT();
539
539
class QUICK_ROR_UNION_SELECT : public QUICK_SELECT_I
540
540
{
541
541
public:
542
 
  QUICK_ROR_UNION_SELECT(THD *thd, TABLE *table);
 
542
  QUICK_ROR_UNION_SELECT(THD *thd, Table *table);
543
543
  ~QUICK_ROR_UNION_SELECT();
544
544
 
545
545
  int  init();
646
646
  void update_min_result();
647
647
  void update_max_result();
648
648
public:
649
 
  QUICK_GROUP_MIN_MAX_SELECT(TABLE *table, JOIN *join, bool have_min,
 
649
  QUICK_GROUP_MIN_MAX_SELECT(Table *table, JOIN *join, bool have_min,
650
650
                             bool have_max, KEY_PART_INFO *min_max_arg_part,
651
651
                             uint group_prefix_len, uint group_key_parts,
652
652
                             uint used_key_parts, KEY *index_info, uint
691
691
 public:
692
692
  QUICK_SELECT_I *quick;        // If quick-select used
693
693
  COND          *cond;          // where condition
694
 
  TABLE *head;
 
694
  Table *head;
695
695
  IO_CACHE file;                // Positions to used records
696
696
  ha_rows records;              // Records in use if read from file
697
697
  double read_time;             // Time to read rows
715
715
                        bool ordered_output);
716
716
};
717
717
 
718
 
QUICK_RANGE_SELECT *get_quick_select_for_ref(THD *thd, TABLE *table,
 
718
QUICK_RANGE_SELECT *get_quick_select_for_ref(THD *thd, Table *table,
719
719
                                             struct st_table_ref *ref,
720
720
                                             ha_rows records);
721
 
uint get_index_for_order(TABLE *table, ORDER *order, ha_rows limit);
 
721
uint get_index_for_order(Table *table, ORDER *order, ha_rows limit);
722
722
 
723
723
#endif