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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
//
// "$Id: Hill.cxx,v 1.11 2005/05/08 18:02:38 hofmann Exp $"
//
// PSEditWidget routines.
//
// Copyright 2004 by Johannes Hofmann
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Library General Public
// License as published by the Free Software Foundation; either
// version 2 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Library General Public License for more details.
//
// You should have received a copy of the GNU Library General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA.
//
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "Hill.H"
Hill::Hill(const char *n, double p, double l, double h) {
name = strdup(n);
phi = p;
lam = l;
height = h;
alph = 0.0;
x = 0;
y = 0;
}
Hill::Hill(int x_tmp, int y_tmp) {
name = "";
phi = 0.0;
lam = 0.0;
height = 0.0;
alph = 0.0;
x = x_tmp;
y = y_tmp;
}
Hill::~Hill() {
if (name) {
free(name);
}
}
Hills::Hills() {
num = 0;
cap = 100;
m = (Hill **) malloc(cap * sizeof(Hill *));
}
Hills::~Hills() {
if (m) {
free(m);
}
}
void
Hills::add(Hill *m1) {
if (num >= cap) {
cap = cap?cap * 2:100;
m = (Hill **) realloc(m, cap * sizeof(Hill *));
}
m[num++] = m1;
}
static int
comp_mountains(const void *n1, const void *n2) {
Hill *m1 = *(Hill **)n1;
Hill *m2 = *(Hill **)n2;
if (m1 && m2) {
if (m1->alph < m2->alph) {
return 1;
} else if (m1->alph > m2->alph) {
return -1;
} else {
return 0;
}
} else {
return 0;
}
}
void
Hills::sort() {
if (!m) {
return;
}
qsort(m, num, sizeof(Hill *), comp_mountains);
}
void
Hills::clear() {
if (m) {
free(m);
m = NULL;
}
cap = 0;
num = 0;
}
void
Hills::clobber() {
int i;
for(i=0; i<get_num();i++) {
if (get(i)) {
delete(get(i));
}
}
clear();
}
int
Hills::get_num() {
return num;
}
Hill *
Hills::get(int n) {
if (n < 0 || n >= num) {
return NULL;
} else {
return m[n];
}
}
|
