|
@@ -84,7 +84,7 @@ static int debug_level = -1;
|
|
|
static int ident(double x1, double y1, double x2, double y2, double thresh);
|
|
|
#endif
|
|
|
static int cross_seg(int id, struct RTree_Rect rect, int *arg);
|
|
|
-static int find_cross(int id, struct RTree_Rect rect, int *arg);
|
|
|
+static int find_cross(int id, const struct RTree_Rect *rect, int *arg);
|
|
|
|
|
|
#define D ((ax2-ax1)*(by1-by2) - (ay2-ay1)*(bx1-bx2))
|
|
|
#define D1 ((bx1-ax1)*(by1-by2) - (by1-ay1)*(bx1-bx2))
|
|
@@ -1089,7 +1089,7 @@ static struct line_pnts *APnts, *BPnts, *IPnts;
|
|
|
static int cross_found; /* set by find_cross() */
|
|
|
|
|
|
/* break segments (called by rtree search) */
|
|
|
-static int find_cross(int id, struct RTree_Rect rect, int *arg)
|
|
|
+static int find_cross(int id, const struct RTree_Rect *rect, int *arg)
|
|
|
{
|
|
|
double x1, y1, z1, x2, y2, z2;
|
|
|
int i, j, ret;
|