1 /* $Id: medsel.c,v 1.5 2005-02-26 10:13:51 chris 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
22 static char rcsid[] = "$Id: medsel.c,v 1.5 2005-02-26 10:13:51 chris Exp $";
49 typedef struct sort_element {
54 //compare the distance of two segments. slow, since it computes the
56 int segdist_cmp(sort_element *s0,sort_element *s1)
58 return (s0->dist==s1->dist)?0:((s0->dist<s1->dist)?-1:1);
63 //find the distance between a segment and a point
64 fix compute_dist(segment *seg,vms_vector *pos)
68 compute_segment_center(&delta,seg);
69 vm_vec_sub2(&delta,pos);
71 return vm_vec_mag(&delta);
75 //sort a list of segments, in order of closeness to pos
76 void sort_seg_list(int n_segs,short *segnumlist,vms_vector *pos)
79 sort_element *sortlist;
81 sortlist = d_calloc(n_segs, sizeof(*sortlist));
83 for (i=0;i<n_segs;i++) {
84 sortlist[i].segnum = segnumlist[i];
85 sortlist[i].dist = compute_dist(&Segments[segnumlist[i]],pos);
88 qsort(sortlist,n_segs,sizeof(*sortlist),(int (*)(const void *, const void *))segdist_cmp);
90 for (i=0;i<n_segs;i++)
91 segnumlist[i] = sortlist[i].segnum;
96 int SortSelectedList(void)
98 sort_seg_list(N_selected_segs,Selected_segs,&ConsoleObject->pos);
99 editor_status("%i element selected list sorted.",N_selected_segs);
104 int SelectNextFoundSeg(void)
106 if (++Found_seg_index >= N_found_segs)
109 Cursegp = &Segments[Found_segs[Found_seg_index]];
110 med_create_new_segment_from_cursegp();
112 Update_flags |= UF_WORLD_CHANGED;
114 if (Lock_view_to_cursegp)
115 set_view_target_from_segment(Cursegp);
117 editor_status("Curseg assigned to next found segment.");
122 int SelectPreviousFoundSeg(void)
124 if (Found_seg_index > 0)
127 Found_seg_index = N_found_segs-1;
129 Cursegp = &Segments[Found_segs[Found_seg_index]];
130 med_create_new_segment_from_cursegp();
132 Update_flags |= UF_WORLD_CHANGED;
134 if (Lock_view_to_cursegp)
135 set_view_target_from_segment(Cursegp);
137 editor_status("Curseg assigned to previous found segment.");