2 * $Header: /cvsroot/pgsql/src/test/regress/regress.c,v 1.3 1996/11/12 11:09:13 bryanh Exp $
5 #include <float.h> /* faked on sunos */
7 #include <string.h> /* for memset() */
12 #include "utils/geo-decls.h" /* includes <math.h> */
13 #include "executor/executor.h" /* For GetAttributeByName */
20 extern double *regress_dist_ptpath (Point *pt, PATH *path);
21 extern double *regress_path_dist (PATH *p1, PATH *p2);
22 extern PATH *poly2path (POLYGON *poly);
23 extern Point *interpt_pp (PATH *p1, PATH *p2);
24 extern void regress_lseg_construct (LSEG *lseg, Point *pt1, Point *pt2);
25 extern char overpaid (TUPLE tuple);
26 extern int boxarea (BOX *box);
27 extern char *reverse_c16 (char *string);
30 ** Distance from a point to a path
33 regress_dist_ptpath(pt, path)
44 result = PALLOCTYPE(double);
45 *result = Abs((double) DBL_MAX); /* +infinity */
48 result = point_distance(pt, &path->p[0]);
52 * the distance from a point to a path is the smallest distance
53 * from the point to any of its constituent segments.
55 Assert(path->npts > 1);
56 result = PALLOCTYPE(double);
57 for (i = 0; i < path->npts - 1; ++i) {
58 regress_lseg_construct(&lseg, &path->p[i], &path->p[i+1]);
59 tmp = dist_ps(pt, &lseg);
60 if (i == 0 || *tmp < *result)
70 /* this essentially does a cartesian product of the lsegs in the
71 two paths, and finds the min distance between any two lsegs */
73 regress_path_dist(p1, p2)
81 regress_lseg_construct(&seg1, &p1->p[0], &p1->p[1]);
82 regress_lseg_construct(&seg2, &p2->p[0], &p2->p[1]);
83 min = lseg_distance(&seg1, &seg2);
85 for (i = 0; i < p1->npts - 1; i++)
86 for (j = 0; j < p2->npts - 1; j++)
88 regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i+1]);
89 regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j+1]);
91 if (*min < *(tmp = lseg_distance(&seg1, &seg2)))
104 char *output = (char *)PALLOC(2*(P_MAXDIG + 1)*poly->npts + 64);
105 char *outptr = output;
108 sprintf(outptr, "(1, %*d", P_MAXDIG, poly->npts);
109 xp = (double *) poly->pts;
110 yp = (double *) (poly->pts + (poly->npts * sizeof(double *)));
112 for (i=1; i<poly->npts; i++,xp++,yp++)
114 sprintf(outptr, ",%*g,%*g", P_MAXDIG, *xp, P_MAXDIG, *yp);
115 outptr += 2*(P_MAXDIG + 1);
120 return(path_in(outptr));
123 /* return the point where two paths intersect. Assumes that they do. */
134 bool found; /* We've found the intersection */
136 found = false; /* Haven't found it yet */
138 for (i = 0; i < p1->npts - 1 && !found; i++)
139 for (j = 0; j < p2->npts - 1 && !found; j++)
141 regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i+1]);
142 regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j+1]);
143 if (lseg_intersect(&seg1, &seg2)) found = true;
146 ln = line_construct_pp(&seg2.p[0], &seg2.p[1]);
147 retval = interpt_sl(&seg1, ln);
153 /* like lseg_construct, but assume space already allocated */
155 regress_lseg_construct(lseg, pt1, pt2)
160 lseg->p[0].x = pt1->x;
161 lseg->p[0].y = pt1->y;
162 lseg->p[1].x = pt2->x;
163 lseg->p[1].y = pt2->y;
164 lseg->m = point_sl(pt1, pt2);
174 salary = (long)GetAttributeByName(tuple, "salary", &isnull);
175 return(salary > 699);
183 extern CIRCLE *circle_in (char *str);
184 extern char *circle_out (CIRCLE *circle);
185 extern int pt_in_circle (Point *point, CIRCLE *circle);
193 char *p, *coord[NARGS], buf2[1000];
199 for (i = 0, p = str; *p && i < NARGS && *p != RDELIM; p++)
200 if (*p == ',' || (*p == LDELIM && !i))
204 result = (CIRCLE *) palloc(sizeof(CIRCLE));
205 result->center.x = atof(coord[0]);
206 result->center.y = atof(coord[1]);
207 result->radius = atof(coord[2]);
209 sprintf(buf2, "circle_in: read (%f, %f, %f)\n", result->center.x,
210 result->center.y,result->radius);
223 result = (char *) palloc(60);
224 (void) sprintf(result, "(%g,%g,%g)",
225 circle->center.x, circle->center.y, circle->radius);
230 pt_in_circle(point, circle)
234 extern double point_dt();
236 return( point_dt(point, &circle->center) < circle->radius );
239 #define ABS(X) ((X) > 0 ? (X) : -(X))
249 width = ABS(box->xh - box->xl);
250 height = ABS(box->yh - box->yl);
251 return (width * height);
262 if (!(new_string = palloc(16))) {
263 fprintf(stderr, "reverse_c16: palloc failed\n");
266 memset(new_string, 0, 16);
267 for (i = 0; i < 16 && string[i]; ++i)
269 if (i == 16 || !string[i])
273 new_string[len-i] = string[i];