1 /* $Id: medsel.c,v 1.2 2004-12-19 14:52:48 btb Exp $ */
3 THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
4 SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
5 END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
6 ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
7 IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
8 SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
9 FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
10 CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
11 AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
12 COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
17 * Routines stripped from med.c for segment selection
23 static char rcsid[] = "$Id: medsel.c,v 1.2 2004-12-19 14:52:48 btb Exp $";
46 typedef struct sort_element {
51 //compare the distance of two segments. slow, since it computes the
53 int segdist_cmp(sort_element *s0,sort_element *s1)
55 return (s0->dist==s1->dist)?0:((s0->dist<s1->dist)?-1:1);
60 //find the distance between a segment and a point
61 fix compute_dist(segment *seg,vms_vector *pos)
65 compute_segment_center(&delta,seg);
66 vm_vec_sub2(&delta,pos);
68 return vm_vec_mag(&delta);
72 //sort a list of segments, in order of closeness to pos
73 void sort_seg_list(int n_segs,short *segnumlist,vms_vector *pos)
76 sort_element *sortlist;
78 sortlist = calloc(n_segs,sizeof(*sortlist));
80 for (i=0;i<n_segs;i++) {
81 sortlist[i].segnum = segnumlist[i];
82 sortlist[i].dist = compute_dist(&Segments[segnumlist[i]],pos);
85 qsort(sortlist,n_segs,sizeof(*sortlist),(int (*)(const void *, const void *))segdist_cmp);
87 for (i=0;i<n_segs;i++)
88 segnumlist[i] = sortlist[i].segnum;
93 int SortSelectedList(void)
95 sort_seg_list(N_selected_segs,Selected_segs,&ConsoleObject->pos);
96 editor_status("%i element selected list sorted.",N_selected_segs);
101 int SelectNextFoundSeg(void)
103 if (++Found_seg_index >= N_found_segs)
106 Cursegp = &Segments[Found_segs[Found_seg_index]];
107 med_create_new_segment_from_cursegp();
109 Update_flags |= UF_WORLD_CHANGED;
111 if (Lock_view_to_cursegp)
112 set_view_target_from_segment(Cursegp);
114 editor_status("Curseg assigned to next found segment.");
119 int SelectPreviousFoundSeg(void)
121 if (Found_seg_index > 0)
124 Found_seg_index = N_found_segs-1;
126 Cursegp = &Segments[Found_segs[Found_seg_index]];
127 med_create_new_segment_from_cursegp();
129 Update_flags |= UF_WORLD_CHANGED;
131 if (Lock_view_to_cursegp)
132 set_view_target_from_segment(Cursegp);
134 editor_status("Curseg assigned to previous found segment.");