2 THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
3 SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
4 END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
5 ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
6 IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
7 SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
8 FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
9 CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
10 AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
11 COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
16 * Routines stripped from med.c for segment selection
42 typedef struct sort_element {
47 //compare the distance of two segments. slow, since it computes the
49 int segdist_cmp(sort_element *s0,sort_element *s1)
51 return (s0->dist==s1->dist)?0:((s0->dist<s1->dist)?-1:1);
56 //find the distance between a segment and a point
57 fix compute_dist(segment *seg,vms_vector *pos)
61 compute_segment_center(&delta,seg);
62 vm_vec_sub2(&delta,pos);
64 return vm_vec_mag(&delta);
68 //sort a list of segments, in order of closeness to pos
69 void sort_seg_list(int n_segs,short *segnumlist,vms_vector *pos)
72 sort_element *sortlist;
74 sortlist = d_calloc(n_segs, sizeof(*sortlist));
76 for (i=0;i<n_segs;i++) {
77 sortlist[i].segnum = segnumlist[i];
78 sortlist[i].dist = compute_dist(&Segments[segnumlist[i]],pos);
81 qsort(sortlist,n_segs,sizeof(*sortlist),(int (*)(const void *, const void *))segdist_cmp);
83 for (i=0;i<n_segs;i++)
84 segnumlist[i] = sortlist[i].segnum;
89 int SortSelectedList(void)
91 sort_seg_list(N_selected_segs,Selected_segs,&ConsoleObject->pos);
92 editor_status("%i element selected list sorted.",N_selected_segs);
97 int SelectNextFoundSeg(void)
99 if (++Found_seg_index >= N_found_segs)
102 Cursegp = &Segments[Found_segs[Found_seg_index]];
103 med_create_new_segment_from_cursegp();
105 Update_flags |= UF_WORLD_CHANGED;
107 if (Lock_view_to_cursegp)
108 set_view_target_from_segment(Cursegp);
110 editor_status("Curseg assigned to next found segment.");
115 int SelectPreviousFoundSeg(void)
117 if (Found_seg_index > 0)
120 Found_seg_index = N_found_segs-1;
122 Cursegp = &Segments[Found_segs[Found_seg_index]];
123 med_create_new_segment_from_cursegp();
125 Update_flags |= UF_WORLD_CHANGED;
127 if (Lock_view_to_cursegp)
128 set_view_target_from_segment(Cursegp);
130 editor_status("Curseg assigned to previous found segment.");