21 #include <grass/gis.h>
22 #include <grass/Vect.h>
23 #include <grass/glocale.h>
40 struct line_pnts *APoints, *BPoints;
41 struct line_cats *ACats, *BCats, *Cats;
42 int i, j, c, atype, btype, bline;
43 int nlines, nbcats_orig;
58 G_debug(1,
"nlines = %d", nlines);
66 for (i = 1; i <= nlines; i++) {
77 G_debug(3,
" %d lines selected by box", List->n_values);
79 for (j = 0; j < List->n_values; j++) {
80 bline = List->value[j];
81 G_debug(3,
" j = %d bline = %d", j, bline);
99 nbcats_orig = BCats->n_cats;
101 for (c = 0; c < ACats->n_cats; c++)
104 if (BCats->n_cats > nbcats_orig) {
105 G_debug(4,
"cats merged: n_cats %d -> %d", nbcats_orig,
115 G_debug(3,
"nlines = %d\n", nlines);
129 const struct line_pnts *BPoints,
int with_z)
135 if (APoints->n_points != BPoints->n_points)
138 npoints = APoints->n_points;
142 for (k = 0; k < APoints->n_points; k++) {
143 if (APoints->x[k] != BPoints->x[k] ||
144 APoints->y[k] != BPoints->y[k] ||
145 (with_z && APoints->z[k] != BPoints->z[k])) {
153 for (k = 0; k < APoints->n_points; k++) {
154 if (APoints->x[k] != BPoints->x[npoints - k - 1] ||
155 APoints->y[k] != BPoints->y[npoints - k - 1] ||
156 (with_z && APoints->z[k] != BPoints->z[npoints - k - 1])) {