mirror/mariadb
1
0
Fork 0
mirror of https://github.com/MariaDB/server.git synced 2025-01-22 06:44:16 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

branches/zip: dict_index_get_n_unique_in_tree(), dict_index_get_n_unique():

Browse source 
Add const qualifiers.
This commit is contained in:
marko 2007-09-19 09:49:58 +00:00
parent 499bbb4b17
commit 861d8fb842
2 changed files with 12 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
include/dict0dict.h
View file

@ -695,8 +695,8 @@ ulint
dict_index_get_n_unique(
/*====================*/
/* out: number of fields */
dict_index_t* index); /* in: an internal representation of index
(in the dictionary cache) */
const dict_index_t* index); /* in: an internal representation
of index (in the dictionary cache) */
/************************************************************************
Gets the number of fields in the internal representation of an index
which uniquely determine the position of an index entry in the index, if
@ -706,8 +706,8 @@ ulint
dict_index_get_n_unique_in_tree(
/*============================*/
/* out: number of fields */
dict_index_t* index); /* in: an internal representation of index
(in the dictionary cache) */
const dict_index_t* index); /* in: an internal representation
of index (in the dictionary cache) */
/************************************************************************
Gets the number of user-defined ordering fields in the index. In the internal
representation we add the row id to the ordering fields to make all indexes

8
include/dict0dict.ic
View file

@ -376,8 +376,8 @@ ulint
dict_index_get_n_unique(
/*====================*/
/* out: number of fields */
dict_index_t* index) /* in: an internal representation of index
(in the dictionary cache) */
const dict_index_t* index) /* in: an internal representation
of index (in the dictionary cache) */
{
ut_ad(index);
ut_ad(index->magic_n == DICT_INDEX_MAGIC_N);
@ -395,8 +395,8 @@ ulint
dict_index_get_n_unique_in_tree(
/*============================*/
/* out: number of fields */
dict_index_t* index) /* in: an internal representation of index
(in the dictionary cache) */
const dict_index_t* index) /* in: an internal representation
of index (in the dictionary cache) */
{
ut_ad(index);
ut_ad(index->magic_n == DICT_INDEX_MAGIC_N);