MODULE_big = btree_gist

OBJS= btree_common.o btree_int4.o btree_int8.o btree_float4.o btree_float8.o btree_ts.o

EXTRA_CLEAN = btree_int4.c btree_int8.c btree_float4.c btree_float8.c

btree_int4.c: btree_num.c.in

sed 's,__DEFINE_BTREE_TYPE_HERE__,BTREE_GIST_INT4,g;s,__BTREE_GIST_TYPE__,int32,g;s,__BTREE_GIST_TYPE2__,int4,g' < $< > $@

btree_int8.c: btree_num.c.in

sed 's,__DEFINE_BTREE_TYPE_HERE__,BTREE_GIST_INT8,g;s,__BTREE_GIST_TYPE__,int64,g;s,__BTREE_GIST_TYPE2__,int8,g' < $< > $@

btree_float4.c: btree_num.c.in

sed 's,__DEFINE_BTREE_TYPE_HERE__,BTREE_GIST_FLOAT4,g;s,__BTREE_GIST_TYPE__,float4,g;s,__BTREE_GIST_TYPE2__,float4,g' < $< > $@

btree_float8.c: btree_num.c.in

sed 's,__DEFINE_BTREE_TYPE_HERE__,BTREE_GIST_FLOAT8,g;s,__BTREE_GIST_TYPE__,float8,g;s,__BTREE_GIST_TYPE2__,float8,g' < $< > $@

This is B-Tree implementation using GiST for int4, int8, float4, float8

NEWS:

Feb 5, 2003 - btree_gist now support int8, float4, float8 !

Thank Janko Richter <jankorichter@yahoo.de> for

contribution.

This version will works only with postgresql version 7.3 and above

#include "btree_gist.h"

PG_FUNCTION_INFO_V1(btree_decompress);

Datum btree_decompress(PG_FUNCTION_ARGS);

btree_decompress(PG_FUNCTION_ARGS)

{

PG_RETURN_POINTER(PG_GETARG_POINTER(0));

}

extern GIST_SPLITVEC *

btree_picksplit(bytea *entryvec, GIST_SPLITVEC *v, BINARY_UNION bu, CMPFUNC cmp)

{

OffsetNumber i;

RIX *array;

OffsetNumber maxoff;

int nbytes;

maxoff = ((VARSIZE(entryvec) - VARHDRSZ) / sizeof(GISTENTRY)) - 1;

nbytes = (maxoff + 2) * sizeof(OffsetNumber);

v->spl_left = (OffsetNumber *) palloc(nbytes);

v->spl_right = (OffsetNumber *) palloc(nbytes);

v->spl_nleft = 0;

v->spl_nright = 0;

v->spl_ldatum = PointerGetDatum(0);

v->spl_rdatum = PointerGetDatum(0);

array = (RIX *) palloc(sizeof(RIX) * (maxoff + 1));

/* copy the data into RIXes, and sort the RIXes */

for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i))

{

array[i].index = i;

array[i].r = (char *) DatumGetPointer((((GISTENTRY *) (VARDATA(entryvec)))[i].key));

}

qsort((void *) &array[FirstOffsetNumber], maxoff - FirstOffsetNumber + 1,

sizeof(RIX), cmp);

for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i))

{

if (i <= (maxoff - FirstOffsetNumber + 1) / 2)

{

v->spl_left[v->spl_nleft] = array[i].index;

v->spl_nleft++;

(*bu) (&v->spl_ldatum, array[i].r);

}

else

{

v->spl_right[v->spl_nright] = array[i].index;

v->spl_nright++;

(*bu) (&v->spl_rdatum, array[i].r);

}

}

pfree(array);

return (v);

}