btree_utils_num.h 2.76 KB
Newer Older
1 2 3
#ifndef __BTREE_UTILS_NUM_H__
#define __BTREE_UTILS_NUM_H__

4
#include "btree_gist.h"
5 6 7 8 9 10

typedef char GBT_NUMKEY;

/* Better readable key */
typedef struct
{
Bruce Momjian's avatar
Bruce Momjian committed
11 12 13
	const GBT_NUMKEY *lower,
			   *upper;
}	GBT_NUMKEY_R;
14 15 16 17 18


/* for sorting */
typedef struct
{
Bruce Momjian's avatar
Bruce Momjian committed
19 20 21
	int			i;
	GBT_NUMKEY *t;
}	Nsrt;
22 23 24 25 26 27 28


/* type description */

typedef struct
{

Bruce Momjian's avatar
Bruce Momjian committed
29
	/* Attribs */
30

Bruce Momjian's avatar
Bruce Momjian committed
31 32
	enum gbtree_type t;			/* data type */
	int32		size;			/* size of type , 0 means variable */
33

Bruce Momjian's avatar
Bruce Momjian committed
34
	/* Methods */
35

Bruce Momjian's avatar
Bruce Momjian committed
36 37 38 39 40 41 42
	bool		(*f_gt) (const void *, const void *);	/* greater then */
	bool		(*f_ge) (const void *, const void *);	/* greater equal */
	bool		(*f_eq) (const void *, const void *);	/* equal */
	bool		(*f_le) (const void *, const void *);	/* less equal */
	bool		(*f_lt) (const void *, const void *);	/* less then */
	int			(*f_cmp) (const void *, const void *);	/* key compare function */
}	gbtree_ninfo;
43 44 45


/*
Bruce Momjian's avatar
Bruce Momjian committed
46
 *	Numeric btree functions
47 48
*/

49

50 51 52 53 54

/*
 * Note: The factor 0.49 in following macro avoids floating point overflows
*/
#define penalty_num(result,olower,oupper,nlower,nupper) do { \
55 56
  double	tmp = 0.0F; \
  (*(result))	= 0.0F; \
57
  if ( (nupper) > (oupper) ) \
58
	  tmp += ( ((double)nupper)*0.49F - ((double)oupper)*0.49F ); \
Bruce Momjian's avatar
Bruce Momjian committed
59
  if (	(olower) > (nlower)  ) \
60 61 62
	  tmp += ( ((double)olower)*0.49F - ((double)nlower)*0.49F ); \
  if (tmp > 0.0F) \
  { \
63 64 65
	(*(result)) += FLT_MIN; \
	(*(result)) += (float) ( ((double)(tmp)) / ( (double)(tmp) + ( ((double)(oupper))*0.49F - ((double)(olower))*0.49F ) ) ); \
	(*(result)) *= (FLT_MAX / (((GISTENTRY *) PG_GETARG_POINTER(0))->rel->rd_att->natts + 1)); \
66
  } \
67 68 69
} while (0);


70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87
/*
 * Convert an Interval to an approximate equivalent number of seconds
 * (as a double).  Here because we need it for time/timetz as well as
 * interval.  See interval_cmp_internal for comparison.
 */
#ifdef HAVE_INT64_TIMESTAMP
#define INTERVAL_TO_SEC(ivp) \
	(((double) (ivp)->time) / ((double) USECS_PER_SEC) + \
	 (ivp)->day * (24.0 * SECS_PER_HOUR) + \
	 (ivp)->month * (30.0 * SECS_PER_DAY))
#else
#define INTERVAL_TO_SEC(ivp) \
	((ivp)->time + \
	 (ivp)->day * (24.0 * SECS_PER_HOUR) + \
	 (ivp)->month * (30.0 * SECS_PER_DAY))
#endif


Bruce Momjian's avatar
Bruce Momjian committed
88 89 90
extern bool gbt_num_consistent(const GBT_NUMKEY_R * key, const void *query,
				   const StrategyNumber *strategy, bool is_leaf,
				   const gbtree_ninfo * tinfo);
91

Bruce Momjian's avatar
Bruce Momjian committed
92 93
extern GIST_SPLITVEC *gbt_num_picksplit(const GistEntryVector *entryvec, GIST_SPLITVEC *v,
				  const gbtree_ninfo * tinfo);
94

Bruce Momjian's avatar
Bruce Momjian committed
95 96
extern GISTENTRY *gbt_num_compress(GISTENTRY *retval, GISTENTRY *entry,
				 const gbtree_ninfo * tinfo);
97 98


Bruce Momjian's avatar
Bruce Momjian committed
99 100
extern void *gbt_num_union(GBT_NUMKEY * out, const GistEntryVector *entryvec,
			  const gbtree_ninfo * tinfo);
101

Bruce Momjian's avatar
Bruce Momjian committed
102 103
extern bool gbt_num_same(const GBT_NUMKEY * a, const GBT_NUMKEY * b,
			 const gbtree_ninfo * tinfo);
104

Bruce Momjian's avatar
Bruce Momjian committed
105 106
extern void gbt_num_bin_union(Datum *u, GBT_NUMKEY * e,
				  const gbtree_ninfo * tinfo);
107 108

#endif