mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 03:52:35 +01:00
3d5dc65dfd
RTREEs will be used for GIS extension in MySQL myisam/.cvsignore: Added sp_test and rt_test myisam/Makefile.am: Added RTREE files myisam/mi_create.c: Added RTREE/SPATIAL initialization myisam/mi_delete.c: Switched to use virual function, instead of mi_ck_delete() direct call myisam/mi_key.c: Added sp_make_key() call in the case of SPATIAL index type myisam/mi_open.c: Added some new initialization actions which depend on key_alg being used: RTREE or BTREE myisam/mi_range.c: Rtree estimation myisam/mi_rkey.c: rtree myisam/mi_rnext.c: rtree myisam/mi_rnext_same.c: rtree myisam/mi_static.c: New search flags for bounding rectungles myisam/mi_test1.c: one now should always specify key_alg during keyinfo initializing: BTREE or RTREE myisam/mi_test2.c: Added key_alg initializing myisam/mi_test3.c: Added key_alg initialization myisam/mi_update.c: Switched to virtual functions, instead of mi_ck_delete/mi_ck_write direct call myisam/mi_write.c: Virtual function instead of mi_ck_write() direct call myisam/myisamdef.h: Rtree additions
44 lines
1.9 KiB
C
44 lines
1.9 KiB
C
/* Copyright (C) 2000 MySQL AB & Ramil Kalimullin & MySQL Finland AB
|
|
& TCX DataKonsult AB
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
|
|
|
|
#ifndef _rt_index_h
|
|
#define _rt_index_h
|
|
|
|
#define rt_PAGE_FIRST_KEY(page, nod_flag) (page + 2 + nod_flag)
|
|
#define rt_PAGE_NEXT_KEY(key, key_length, nod_flag) (key + key_length + \
|
|
(nod_flag ? nod_flag : info->s->base.rec_reflength))
|
|
#define rt_PAGE_END(page) (page + mi_getint(page))
|
|
|
|
#define rt_PAGE_MIN_SIZE(block_length) ((uint)(block_length) / 2)
|
|
|
|
int rtree_insert(MI_INFO *info, uint keynr, uchar *key, uint key_length);
|
|
int rtree_delete(MI_INFO *info, uint keynr, uchar *key, uint key_length);
|
|
|
|
int rtree_find_first(MI_INFO *info, uint keynr, uchar *key, uint key_length,
|
|
uint search_flag);
|
|
int rtree_find_next(MI_INFO *info, uint keynr, uint search_flag);
|
|
|
|
int rtree_get_first(MI_INFO *info, uint keynr, uint key_length);
|
|
int rtree_get_next(MI_INFO *info, uint keynr, uint key_length);
|
|
|
|
ha_rows rtree_estimate(MI_INFO *info, uint keynr, uchar *key,
|
|
uint key_length, uint flag);
|
|
|
|
int rtree_split_page(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page, uchar *key,
|
|
uint key_length, my_off_t *new_page_offs);
|
|
|
|
#endif /* _rt_index_h */
|