Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
M
mariadb
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
mariadb
Commits
f23b30a6
Commit
f23b30a6
authored
Oct 12, 2004
by
timour@mysql.com
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Renamed formal parameters of constructors so that they are different from class memebers.
parent
3bb2c4e3
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
33 additions
and
36 deletions
+33
-36
sql/opt_range.cc
sql/opt_range.cc
+33
-36
No files found.
sql/opt_range.cc
View file @
f23b30a6
...
@@ -1471,12 +1471,26 @@ private:
...
@@ -1471,12 +1471,26 @@ private:
public:
public:
ha_rows
quick_prefix_records
;
ha_rows
quick_prefix_records
;
public:
public:
TRP_GROUP_MIN_MAX
(
bool
have_min
,
bool
have_max
,
TRP_GROUP_MIN_MAX
(
bool
have_min_arg
,
bool
have_max_arg
,
KEY_PART_INFO
*
min_max_arg_part
,
uint
group_prefix_len
,
KEY_PART_INFO
*
min_max_arg_part_arg
,
uint
used_key_parts
,
uint
group_key_parts
,
KEY
*
index_info
,
uint
group_prefix_len_arg
,
uint
used_key_parts_arg
,
uint
index
,
uint
key_infix_len
,
byte
*
key_infix
,
uint
group_key_parts_arg
,
KEY
*
index_info_arg
,
SEL_TREE
*
tree
,
SEL_ARG
*
index_tree
,
uint
param_idx
,
uint
index_arg
,
uint
key_infix_len_arg
,
byte
*
key_infix_arg
,
ha_rows
quick_prefix_records
);
SEL_TREE
*
tree_arg
,
SEL_ARG
*
index_tree_arg
,
uint
param_idx_arg
,
ha_rows
quick_prefix_records_arg
)
:
have_min
(
have_min_arg
),
have_max
(
have_max_arg
),
min_max_arg_part
(
min_max_arg_part_arg
),
group_prefix_len
(
group_prefix_len_arg
),
used_key_parts
(
used_key_parts_arg
),
group_key_parts
(
group_key_parts_arg
),
index_info
(
index_info_arg
),
index
(
index_arg
),
key_infix_len
(
key_infix_len_arg
),
range_tree
(
tree_arg
),
index_tree
(
index_tree_arg
),
param_idx
(
param_idx_arg
),
quick_prefix_records
(
quick_prefix_records_arg
)
{
if
(
key_infix_len
)
memcpy
(
this
->
key_infix
,
key_infix_arg
,
key_infix_len
);
}
QUICK_SELECT_I
*
make_quick
(
PARAM
*
param
,
bool
retrieve_full_rows
,
QUICK_SELECT_I
*
make_quick
(
PARAM
*
param
,
bool
retrieve_full_rows
,
MEM_ROOT
*
parent_alloc
);
MEM_ROOT
*
parent_alloc
);
...
@@ -7135,25 +7149,6 @@ SEL_ARG * get_index_range_tree(uint index, SEL_TREE* range_tree, PARAM *param,
...
@@ -7135,25 +7149,6 @@ SEL_ARG * get_index_range_tree(uint index, SEL_TREE* range_tree, PARAM *param,
}
}
TRP_GROUP_MIN_MAX
::
TRP_GROUP_MIN_MAX
(
bool
have_min
,
bool
have_max
,
KEY_PART_INFO
*
min_max_arg_part
,
uint
group_prefix_len
,
uint
used_key_parts
,
uint
group_key_parts
,
KEY
*
index_info
,
uint
index
,
uint
key_infix_len
,
byte
*
key_infix
,
SEL_TREE
*
tree
,
SEL_ARG
*
index_tree
,
uint
param_idx
,
ha_rows
quick_prefix_records
)
:
have_min
(
have_min
),
have_max
(
have_max
),
min_max_arg_part
(
min_max_arg_part
),
group_prefix_len
(
group_prefix_len
),
used_key_parts
(
used_key_parts
),
group_key_parts
(
group_key_parts
),
index_info
(
index_info
),
index
(
index
),
key_infix_len
(
key_infix_len
),
range_tree
(
tree
),
index_tree
(
index_tree
),
param_idx
(
param_idx
),
quick_prefix_records
(
quick_prefix_records
)
{
if
(
key_infix_len
)
memcpy
(
this
->
key_infix
,
key_infix
,
key_infix_len
);
}
/*
/*
Compute the cost of a quick_group_min_max_select for a particular index.
Compute the cost of a quick_group_min_max_select for a particular index.
...
@@ -7412,23 +7407,25 @@ TRP_GROUP_MIN_MAX::make_quick(PARAM *param, bool retrieve_full_rows,
...
@@ -7412,23 +7407,25 @@ TRP_GROUP_MIN_MAX::make_quick(PARAM *param, bool retrieve_full_rows,
*/
*/
QUICK_GROUP_MIN_MAX_SELECT
::
QUICK_GROUP_MIN_MAX_SELECT
(
QUICK_GROUP_MIN_MAX_SELECT
::
QUICK_GROUP_MIN_MAX_SELECT
(
TABLE
*
table
,
JOIN
*
join
,
bool
have_min
,
bool
have_max
,
TABLE
*
table
,
JOIN
*
join_arg
,
bool
have_min_arg
,
bool
have_max_arg
,
KEY_PART_INFO
*
min_max_arg_part
,
uint
group_prefix_len
,
uint
used_key_parts
,
KEY_PART_INFO
*
min_max_arg_part_arg
,
uint
group_prefix_len_arg
,
KEY
*
index_info
,
uint
use_index
,
double
read_cost
,
ha_rows
records
,
uint
used_key_parts_arg
,
KEY
*
index_info_arg
,
uint
use_index
,
uint
key_infix_len
,
byte
*
key_infix
,
MEM_ROOT
*
parent_alloc
)
double
read_cost_arg
,
ha_rows
records_arg
,
uint
key_infix_len_arg
,
:
join
(
join
),
index_info
(
index_info
),
group_prefix_len
(
group_prefix_len
),
byte
*
key_infix_arg
,
MEM_ROOT
*
parent_alloc
)
have_min
(
have_min
),
have_max
(
have_max
),
seen_first_key
(
FALSE
),
:
join
(
join_arg
),
index_info
(
index_info_arg
),
min_max_arg_part
(
min_max_arg_part
),
key_infix
(
key_infix
),
group_prefix_len
(
group_prefix_len_arg
),
have_min
(
have_min_arg
),
key_infix_len
(
key_infix_len
)
have_max
(
have_max_arg
),
seen_first_key
(
FALSE
),
min_max_arg_part
(
min_max_arg_part_arg
),
key_infix
(
key_infix_arg
),
key_infix_len
(
key_infix_len_arg
)
{
{
head
=
table
;
head
=
table
;
file
=
head
->
file
;
file
=
head
->
file
;
index
=
use_index
;
index
=
use_index
;
record
=
head
->
record
[
0
];
record
=
head
->
record
[
0
];
tmp_record
=
head
->
record
[
1
];
tmp_record
=
head
->
record
[
1
];
this
->
read_time
=
read_cost
;
read_time
=
read_cost_arg
;
this
->
records
=
records
;
records
=
records_arg
;
this
->
used_key_parts
=
used_key_parts
;
used_key_parts
=
used_key_parts_arg
;
real_prefix_len
=
group_prefix_len
+
key_infix_len
;
real_prefix_len
=
group_prefix_len
+
key_infix_len
;
group_prefix
=
NULL
;
group_prefix
=
NULL
;
min_max_arg_len
=
min_max_arg_part
?
min_max_arg_part
->
store_length
:
0
;
min_max_arg_len
=
min_max_arg_part
?
min_max_arg_part
->
store_length
:
0
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment