Selaa lähdekoodia

change boxlist_add args

git-svn-id: https://svn.osgeo.org/grass/grass/trunk@53353 15284696-431f-4ddb-bdfa-cd5b030d7da7
Markus Metz 12 vuotta sitten
vanhempi
commit
e70a921252

+ 1 - 1
include/defs/vector.h

@@ -119,7 +119,7 @@ void Vect_destroy_list(struct ilist *);
 
 
 /* List of bounding boxes with ids */
 /* List of bounding boxes with ids */
 struct boxlist *Vect_new_boxlist(int);
 struct boxlist *Vect_new_boxlist(int);
-int Vect_boxlist_append(struct boxlist *, int, struct bound_box);
+int Vect_boxlist_append(struct boxlist *, int, const struct bound_box *);
 int Vect_boxlist_append_boxlist(struct boxlist *, const struct boxlist *);
 int Vect_boxlist_append_boxlist(struct boxlist *, const struct boxlist *);
 int Vect_boxlist_delete(struct boxlist *, int);
 int Vect_boxlist_delete(struct boxlist *, int);
 int Vect_boxlist_delete_boxlist(struct boxlist *, const struct boxlist *);
 int Vect_boxlist_delete_boxlist(struct boxlist *, const struct boxlist *);

+ 1 - 1
include/vect/dig_externs.h

@@ -90,7 +90,7 @@ int dig_set_distance_to_line_tolerance(double);
 
 
 /* list.c */
 /* list.c */
 int dig_init_boxlist(struct boxlist *, int);
 int dig_init_boxlist(struct boxlist *, int);
-int dig_boxlist_add(struct boxlist *, int, struct bound_box);
+int dig_boxlist_add(struct boxlist *, int, const struct bound_box *);
 
 
 /* plus.c */
 /* plus.c */
 int dig_init_plus(struct Plus_head *);
 int dig_init_plus(struct Plus_head *);

+ 4 - 4
lib/vector/Vlib/list.c

@@ -285,7 +285,7 @@ void Vect_destroy_boxlist(struct boxlist *list)
  * \return 0 on success
  * \return 0 on success
  * \return 1 on error
  * \return 1 on error
  */
  */
-int Vect_boxlist_append(struct boxlist *list, int id, struct bound_box box)
+int Vect_boxlist_append(struct boxlist *list, int id, const struct bound_box *box)
 {
 {
     int i;
     int i;
     size_t size;
     size_t size;
@@ -312,7 +312,7 @@ int Vect_boxlist_append(struct boxlist *list, int id, struct bound_box box)
 
 
     list->id[list->n_values] = id;
     list->id[list->n_values] = id;
     if (list->have_boxes)
     if (list->have_boxes)
-	list->box[list->n_values] = box;
+	list->box[list->n_values] = *box;
     list->n_values++;
     list->n_values++;
 
 
     return 0;
     return 0;
@@ -336,14 +336,14 @@ int Vect_boxlist_append_boxlist(struct boxlist *alist, const struct boxlist *bli
 
 
     if (blist->have_boxes) {
     if (blist->have_boxes) {
 	for (i = 0; i < blist->n_values; i++)
 	for (i = 0; i < blist->n_values; i++)
-	    Vect_boxlist_append(alist, blist->id[i], blist->box[i]);
+	    Vect_boxlist_append(alist, blist->id[i], &blist->box[i]);
     }
     }
     else {
     else {
 	struct bound_box box;
 	struct bound_box box;
 
 
 	box.E = box.W = box.N = box.S = box.T = box.B = 0;
 	box.E = box.W = box.N = box.S = box.T = box.B = 0;
 	for (i = 0; i < blist->n_values; i++)
 	for (i = 0; i < blist->n_values; i++)
-	    Vect_boxlist_append(alist, blist->id[i], box);
+	    Vect_boxlist_append(alist, blist->id[i], &box);
     }
     }
 
 
     return 0;
     return 0;

+ 1 - 1
lib/vector/Vlib/sindex.c

@@ -61,7 +61,7 @@ Vect_select_lines_by_box(struct Map_info *Map, const struct bound_box *Box,
 	Line = plus->Line[line];
 	Line = plus->Line[line];
 	if (!(Line->type & type))
 	if (!(Line->type & type))
 	    continue;
 	    continue;
-	dig_boxlist_add(list, line, LocList->box[i]);
+	dig_boxlist_add(list, line, &LocList->box[i]);
     }
     }
 
 
     G_debug(3, "  %d lines of requested type", list->n_values);
     G_debug(3, "  %d lines of requested type", list->n_values);

+ 2 - 2
lib/vector/diglib/list.c

@@ -31,7 +31,7 @@ int dig_init_boxlist(struct boxlist *list, int have_boxes)
 }
 }
 
 
 /* Add item to box list, does not check for duplicates */
 /* Add item to box list, does not check for duplicates */
-int dig_boxlist_add(struct boxlist *list, int id, struct bound_box box)
+int dig_boxlist_add(struct boxlist *list, int id, const struct bound_box *box)
 {
 {
     if (list->n_values == list->alloc_values) {
     if (list->n_values == list->alloc_values) {
 	size_t size = (list->n_values + 1000) * sizeof(int);
 	size_t size = (list->n_values + 1000) * sizeof(int);
@@ -55,7 +55,7 @@ int dig_boxlist_add(struct boxlist *list, int id, struct bound_box box)
 
 
     list->id[list->n_values] = id;
     list->id[list->n_values] = id;
     if (list->have_boxes)
     if (list->have_boxes)
-	list->box[list->n_values] = box;
+	list->box[list->n_values] = *box;
     list->n_values++;
     list->n_values++;
 
 
     return 1;
     return 1;

+ 1 - 1
lib/vector/diglib/spindex.c

@@ -590,7 +590,7 @@ static int _add_item_with_box(int id, const struct RTree_Rect *rect,
     box.N = rect->boundary[4];
     box.N = rect->boundary[4];
     box.T = rect->boundary[5];
     box.T = rect->boundary[5];
 
 
-    dig_boxlist_add(list, id, box);
+    dig_boxlist_add(list, id, &box);
     return 1;
     return 1;
 }
 }