• unknown's avatar
    WL#1562 (Improving spatial code) · c690204c
    unknown authored
    A set of changes improving our RTree indexes and fixed few bugs
    found during the tests
    
    
    myisam/rt_index.c:
      Algorythm for picking the branch to insert was fixed.
      pick_by_perimeter version of the algorythm added (mostly for testing
      purposes)
    myisam/rt_index.h:
      minimal size of the page set to 1/3
      It noticeable increases searching performance
    myisam/rt_key.c:
      counting of the size of the filled part of the page fixed
      rtree_choose_key moved to rt_index.c
    myisam/rt_key.h:
      no need to make rtree_choose_key global
    myisam/rt_mbr.c:
      operations for counting the perimeter of MBR added
    myisam/rt_mbr.h:
      interface for rtree_perimeter_increase
    myisam/rt_split.c:
      my_multi_malloc changed with my_alloca
    sql/spatial.cc:
      LINESTRING object can consist of single point
    c690204c
rt_mbr.h 1.68 KB
/* 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_mbr_h
#define _rt_mbr_h

int rtree_key_cmp(HA_KEYSEG *keyseg, uchar *a, uchar *b, uint key_length,
                  uint nextflag);
int rtree_combine_rect(HA_KEYSEG *keyseg,uchar *, uchar *, uchar*, 
                       uint key_length);
double rtree_rect_volume(HA_KEYSEG *keyseg, uchar*, uint key_length);
int rtree_d_mbr(HA_KEYSEG *keyseg, uchar *a, uint key_length, double *res);
double rtree_overlapping_area(HA_KEYSEG *keyseg, uchar *a, uchar *b, 
                              uint key_length);
double rtree_area_increase(HA_KEYSEG *keyseg, uchar *a, uchar *b, 
                           uint key_length, double *ab_area);
double rtree_perimeter_increase(HA_KEYSEG *keyseg, uchar* a, uchar* b, 
				uint key_length, double *ab_perim);
int rtree_page_mbr(MI_INFO *info, HA_KEYSEG *keyseg, uchar *page_buf, 
                   uchar* c, uint key_length);
#endif /* _rt_mbr_h */