summaryrefslogtreecommitdiff
path: root/sql/sql_select.h
diff options
context:
space:
mode:
authorsergefp@mysql.com <>2004-05-13 01:38:40 +0400
committersergefp@mysql.com <>2004-05-13 01:38:40 +0400
commita46d7542c94eb5848231324a043ddccffbc552b0 (patch)
tree34118ff1da06b90ade9507174ddccf92c228286a /sql/sql_select.h
parentb2efad935b38bfcf8177837082e3946c60ba8328 (diff)
downloadmariadb-git-a46d7542c94eb5848231324a043ddccffbc552b0.tar.gz
This is first cset for WL#1394 "Optimize index merge when all involved index ranges include only values with equal keys"
The main idea is to exploit the fact that key scans for "key=const" return ordered sequences of rowids.
Diffstat (limited to 'sql/sql_select.h')
-rw-r--r--sql/sql_select.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/sql/sql_select.h b/sql/sql_select.h
index 9bba4e9318e..9d784e585b1 100644
--- a/sql/sql_select.h
+++ b/sql/sql_select.h
@@ -329,7 +329,7 @@ uint find_shortest_key(TABLE *table, const key_map *usable_keys);
int opt_sum_query(TABLE_LIST *tables, List<Item> &all_fields,COND *conds);
/* from sql_delete.cc, used by opt_range.cc */
-extern "C" int refposcmp2(void* arg, const void *a,const void *b);
+extern "C" int refpos_order_cmp(void* arg, const void *a,const void *b);
/* class to copying an field/item to a key struct */