granicus.if.org Git - postgresql/blob - src/test/regress/regress.c

   1 /*
   2  * $Header: /cvsroot/pgsql/src/test/regress/regress.c,v 1.11 1997/09/08 02:40:56 momjian Exp $
   3  */
   4
   5 #include <float.h>                              /* faked on sunos */
   6 #include <stdio.h>
   7 #include <string.h>                             /* for memset() */
   8
   9 #include <postgres.h>
  10
  11 #include "utils/geo_decls.h"    /* includes <math.h> */
  12 #include "executor/executor.h"  /* For GetAttributeByName */
  13
  14 #define P_MAXDIG 12
  15 #define LDELIM                  '('
  16 #define RDELIM                  ')'
  17 #define DELIM                   ','
  18
  19 typedef void *TUPLE;
  20
  21 extern double *regress_dist_ptpath(Point * pt, PATH * path);
  22 extern double *regress_path_dist(PATH * p1, PATH * p2);
  23 extern PATH *poly2path(POLYGON * poly);
  24 extern Point *interpt_pp(PATH * p1, PATH * p2);
  25 extern void regress_lseg_construct(LSEG * lseg, Point * pt1, Point * pt2);
  26 extern char overpaid(TUPLE tuple);
  27 extern int      boxarea(BOX * box);
  28 extern char *reverse_c16(char *string);
  29
  30 /*
  31 ** Distance from a point to a path
  32 */
  33 double     *
  34 regress_dist_ptpath(pt, path)
  35 Point      *pt;
  36 PATH       *path;
  37 {
  38         double     *result;
  39         double     *tmp;
  40         int                     i;
  41         LSEG            lseg;
  42
  43         switch (path->npts)
  44         {
  45                 case 0:
  46                         result = PALLOCTYPE(double);
  47                         *result = Abs((double) DBL_MAX);        /* +infinity */
  48                         break;
  49                 case 1:
  50                         result = point_distance(pt, &path->p[0]);
  51                         break;
  52                 default:
  53
  54                         /*
  55                          * the distance from a point to a path is the smallest
  56                          * distance from the point to any of its constituent segments.
  57                          */
  58                         Assert(path->npts > 1);
  59                         result = PALLOCTYPE(double);
  60                         for (i = 0; i < path->npts - 1; ++i)
  61                         {
  62                                 regress_lseg_construct(&lseg, &path->p[i], &path->p[i + 1]);
  63                                 tmp = dist_ps(pt, &lseg);
  64                                 if (i == 0 || *tmp < *result)
  65                                         *result = *tmp;
  66                                 PFREE(tmp);
  67
  68                         }
  69                         break;
  70         }
  71         return (result);
  72 }
  73
  74 /* this essentially does a cartesian product of the lsegs in the
  75    two paths, and finds the min distance between any two lsegs */
  76 double     *
  77 regress_path_dist(p1, p2)
  78 PATH       *p1;
  79 PATH       *p2;
  80 {
  81         double     *min,
  82                            *tmp;
  83         int                     i,
  84                                 j;
  85         LSEG            seg1,
  86                                 seg2;
  87
  88         regress_lseg_construct(&seg1, &p1->p[0], &p1->p[1]);
  89         regress_lseg_construct(&seg2, &p2->p[0], &p2->p[1]);
  90         min = lseg_distance(&seg1, &seg2);
  91
  92         for (i = 0; i < p1->npts - 1; i++)
  93                 for (j = 0; j < p2->npts - 1; j++)
  94                 {
  95                         regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i + 1]);
  96                         regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j + 1]);
  97
  98                         if (*min < *(tmp = lseg_distance(&seg1, &seg2)))
  99                                 *min = *tmp;
 100                         PFREE(tmp);
 101                 }
 102
 103         return (min);
 104 }
 105
 106 PATH       *
 107 poly2path(poly)
 108 POLYGON    *poly;
 109 {
 110         int                     i;
 111         char       *output = (char *) PALLOC(2 * (P_MAXDIG + 1) * poly->npts + 64);
 112         char            buf[2 * (P_MAXDIG) + 20];
 113
 114         sprintf(output, "(1, %*d", P_MAXDIG, poly->npts);
 115
 116         for (i = 0; i < poly->npts; i++)
 117         {
 118                 sprintf(buf, ",%*g,%*g", P_MAXDIG, poly->p[i].x, P_MAXDIG, poly->p[i].y);
 119                 strcat(output, buf);
 120         }
 121
 122         sprintf(buf, "%c", RDELIM);
 123         strcat(output, buf);
 124         return (path_in(output));
 125 }
 126
 127 /* return the point where two paths intersect.  Assumes that they do. */
 128 Point      *
 129 interpt_pp(p1, p2)
 130 PATH       *p1;
 131 PATH       *p2;
 132 {
 133
 134         Point      *retval;
 135         int                     i,
 136                                 j;
 137         LSEG            seg1,
 138                                 seg2;
 139
 140 #if FALSE
 141         LINE       *ln;
 142
 143 #endif
 144         bool            found;                  /* We've found the intersection */
 145
 146         found = false;                          /* Haven't found it yet */
 147
 148         for (i = 0; i < p1->npts - 1 && !found; i++)
 149                 for (j = 0; j < p2->npts - 1 && !found; j++)
 150                 {
 151                         regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i + 1]);
 152                         regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j + 1]);
 153                         if (lseg_intersect(&seg1, &seg2))
 154                                 found = true;
 155                 }
 156
 157 #if FALSE
 158         ln = line_construct_pp(&seg2.p[0], &seg2.p[1]);
 159         retval = interpt_sl(&seg1, ln);
 160 #endif
 161         retval = lseg_interpt(&seg1, &seg2);
 162
 163         return (retval);
 164 }
 165
 166
 167 /* like lseg_construct, but assume space already allocated */
 168 void
 169 regress_lseg_construct(lseg, pt1, pt2)
 170 LSEG       *lseg;
 171 Point      *pt1;
 172 Point      *pt2;
 173 {
 174         lseg->p[0].x = pt1->x;
 175         lseg->p[0].y = pt1->y;
 176         lseg->p[1].x = pt2->x;
 177         lseg->p[1].y = pt2->y;
 178         lseg->m = point_sl(pt1, pt2);
 179 }
 180
 181
 182 char
 183 overpaid(tuple)
 184 TUPLE           tuple;
 185 {
 186         bool            isnull;
 187         long            salary;
 188
 189         salary = (long) GetAttributeByName(tuple, "salary", &isnull);
 190         return (salary > 699);
 191 }
 192
 193 /* New type "widget"
 194  * This used to be "circle", but I added circle to builtins,
 195  *      so needed to make sure the names do not collide. - tgl 97/04/21
 196  */
 197
 198 typedef struct
 199 {
 200         Point           center;
 201         double          radius;
 202 }                       WIDGET;
 203
 204 WIDGET     *widget_in(char *str);
 205 char       *widget_out(WIDGET * widget);
 206 int                     pt_in_widget(Point * point, WIDGET * widget);
 207
 208 #define NARGS   3
 209
 210 WIDGET     *
 211 widget_in(str)
 212 char       *str;
 213 {
 214         char       *p,
 215                            *coord[NARGS],
 216                                 buf2[1000];
 217         int                     i;
 218         WIDGET     *result;
 219
 220         if (str == NULL)
 221                 return (NULL);
 222         for (i = 0, p = str; *p && i < NARGS && *p != RDELIM; p++)
 223                 if (*p == ',' || (*p == LDELIM && !i))
 224                         coord[i++] = p + 1;
 225         if (i < NARGS - 1)
 226                 return (NULL);
 227         result = (WIDGET *) palloc(sizeof(WIDGET));
 228         result->center.x = atof(coord[0]);
 229         result->center.y = atof(coord[1]);
 230         result->radius = atof(coord[2]);
 231
 232         sprintf(buf2, "widget_in: read (%f, %f, %f)\n", result->center.x,
 233                         result->center.y, result->radius);
 234         return (result);
 235 }
 236
 237 char       *
 238 widget_out(widget)
 239 WIDGET     *widget;
 240 {
 241         char       *result;
 242
 243         if (widget == NULL)
 244                 return (NULL);
 245
 246         result = (char *) palloc(60);
 247         sprintf(result, "(%g,%g,%g)",
 248                         widget->center.x, widget->center.y, widget->radius);
 249         return (result);
 250 }
 251
 252 int
 253 pt_in_widget(point, widget)
 254 Point      *point;
 255 WIDGET     *widget;
 256 {
 257         extern double point_dt();
 258
 259         return (point_dt(point, &widget->center) < widget->radius);
 260 }
 261
 262 #define ABS(X) ((X) > 0 ? (X) : -(X))
 263
 264 int
 265 boxarea(box)
 266
 267 BOX                *box;
 268
 269 {
 270         int                     width,
 271                                 height;
 272
 273         width = ABS(box->high.x - box->low.x);
 274         height = ABS(box->high.y - box->low.y);
 275         return (width * height);
 276 }
 277
 278 char       *
 279 reverse_c16(string)
 280 char       *string;
 281 {
 282         register        i;
 283         int                     len;
 284         char       *new_string;
 285
 286         if (!(new_string = palloc(16)))
 287         {
 288                 fprintf(stderr, "reverse_c16: palloc failed\n");
 289                 return (NULL);
 290         }
 291         memset(new_string, 0, 16);
 292         for (i = 0; i < 16 && string[i]; ++i)
 293                 ;
 294         if (i == 16 || !string[i])
 295                 --i;
 296         len = i;
 297         for (; i >= 0; --i)
 298                 new_string[len - i] = string[i];
 299         return (new_string);
 300 }