← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to drizzled/table.h

  • Committer: Brian Aker
  • Date: 2009-05-03 22:35:33 UTC
  • mfrom: (997.2.26 mordred)
  • Revision ID: brian@gaz-20090503223533-lv7lwqelv08dnv2j
Merge of Monty's code

Show diffs side-by-side

added added

removed removed

Lines of Context:
drizzled/table.h
23
23
#ifndef DRIZZLED_TABLE_H
24
24
#define DRIZZLED_TABLE_H
25
25
 
26
 
#include <storage/myisam/myisam.h>
 
26
#include <plugin/myisam/myisam.h>
27
27
#include <drizzled/order.h>
28
28
#include <drizzled/filesort_info.h>
29
29
#include <drizzled/natural_join_column.h>
106
106
  uint32_t find_shortest_key(const key_map *usable_keys);
107
107
  bool compare_record(Field **ptr);
108
108
  bool compare_record();
109
 
 
 
109
  /* TODO: the (re)storeRecord's may be able to be further condensed */
 
110
  void storeRecord();
 
111
  void storeRecordAsInsert();
 
112
  void storeRecordAsDefault();
 
113
  void restoreRecord();
 
114
  void restoreRecordAsDefault();
 
115
  void emptyRecord();
110
116
  bool table_check_intact(const uint32_t table_f_count, const TABLE_FIELD_W_TYPE *table_def);
111
117
 
112
118
  /* See if this can be blown away */
156
162
  order_st *group;
157
163
  const char    *alias;                   /* alias or table name */
158
164
  unsigned char         *null_flags;
159
 
  my_bitmap_map *bitmap_init_value;
160
165
  std::bitset<MAX_FIELDS> def_read_set, def_write_set, tmp_set; /* containers */
161
166
  std::bitset<MAX_FIELDS> *read_set, *write_set;                /* Active column sets */
162
167
  /*
180
185
  query_id_t    query_id;
181
186
 
182
187
  /*
183
 
    For each key that has quick_keys.is_set(key) == true: estimate of #records
 
188
    For each key that has quick_keys.test(key) == true: estimate of #records
184
189
    and max #key parts that range access would use.
185
190
  */
186
191
  ha_rows       quick_rows[MAX_KEY];