1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/*
THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
*/
/*
*
* Routines stripped from med.c for segment selection
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include "gr.h"
#include "ui.h"
#include "key.h"
#include "dxxerror.h"
#include "u_mem.h"
#include "inferno.h"
#include "editor.h"
#include "editor/esegment.h"
#include "segment.h"
#include "object.h"
typedef struct sort_element {
short segnum;
fix dist;
} sort_element;
//compare the distance of two segments. slow, since it computes the
//distance each time
int segdist_cmp(sort_element *s0,sort_element *s1)
{
return (s0->dist==s1->dist)?0:((s0->dist<s1->dist)?-1:1);
}
//find the distance between a segment and a point
fix compute_dist(segment *seg,vms_vector *pos)
{
vms_vector delta;
compute_segment_center(&delta,seg);
vm_vec_sub2(&delta,pos);
return vm_vec_mag(&delta);
}
//sort a list of segments, in order of closeness to pos
void sort_seg_list(int n_segs,short *segnumlist,vms_vector *pos)
{
int i;
sort_element *sortlist;
sortlist = d_calloc(n_segs, sizeof(*sortlist));
for (i=0;i<n_segs;i++) {
sortlist[i].segnum = segnumlist[i];
sortlist[i].dist = compute_dist(&Segments[segnumlist[i]],pos);
}
qsort(sortlist,n_segs,sizeof(*sortlist),(int (*)(const void *, const void *))segdist_cmp);
for (i=0;i<n_segs;i++)
segnumlist[i] = sortlist[i].segnum;
d_free(sortlist);
}
int SortSelectedList(void)
{
sort_seg_list(N_selected_segs,Selected_segs,&ConsoleObject->pos);
editor_status_fmt("%i element selected list sorted.",N_selected_segs);
return 1;
}
int SelectNextFoundSeg(void)
{
if (++Found_seg_index >= N_found_segs)
Found_seg_index = 0;
Cursegp = &Segments[Found_segs[Found_seg_index]];
med_create_new_segment_from_cursegp();
Update_flags |= UF_WORLD_CHANGED;
if (Lock_view_to_cursegp)
set_view_target_from_segment(Cursegp);
editor_status("Curseg assigned to next found segment.");
return 1;
}
int SelectPreviousFoundSeg(void)
{
if (Found_seg_index > 0)
Found_seg_index--;
else
Found_seg_index = N_found_segs-1;
Cursegp = &Segments[Found_segs[Found_seg_index]];
med_create_new_segment_from_cursegp();
Update_flags |= UF_WORLD_CHANGED;
if (Lock_view_to_cursegp)
set_view_target_from_segment(Cursegp);
editor_status("Curseg assigned to previous found segment.");
return 1;
}
|
