-
Notifications
You must be signed in to change notification settings - Fork 0
/
wsarray.h
242 lines (116 loc) · 2.97 KB
/
wsarray.h
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
#if !defined(WSARRAY_INCLUDED)
#define WSARRAY_INCLUDED
// this class is a container of int and double;
// it needs a preallocation when constructing the class;
// then you need to use the function push_back() to insert the numbers; this is the only way
// once you did, you can freeze the numbers; multiple entries are neglected; the preallocation can be reduced; you cannot use push_back anymore
// find returns the position of the integer you are looking for;
// posweightof returns a pair position-weight
// to access the integers use l[] and w[]
class wsarray {
public:
wsarray(int a);
~wsarray();
int find(int);
pair <int, pair<int, double> > posweightof(int x);
int size() { return position; };
void freeze();
void push_back(int, int, double);
pair<int, double> * w;
int* l;
private:
int _size_;
int position;
};
wsarray::wsarray(int a) {
position=0;
_size_=a;
l=new int[_size_];
w=new pair<int, double>[_size_];
}
wsarray::~wsarray() {
delete[] l;
l = NULL;
delete[] w;
w = NULL;
}
pair <int, pair<int, double> > wsarray::posweightof(int x) {
int i=find(x);
if (i==-1)
return (make_pair(-1, make_pair(0, 0.)));
return (make_pair(i, w[i]));
}
int wsarray::find(int a) {
int one=0;
int two=position-1;
if(position==0)
return -1;
if (a<l[one] || a>l[two])
return -1;
if (a==l[one])
return one;
if (a==l[two])
return two;
while (two-one>1) {
int middle=(two-one)/2 + one;
if (a==l[middle])
return middle;
if (a>l[middle])
one=middle;
else
two=middle;
}
return -1;
}
void wsarray::push_back(int a, int bb, double b) {
l[position]=a;
w[position++]=make_pair(bb, b);
}
void wsarray::freeze() {
map<int, pair<int, double> > M;
for(int i=0; i<position; i++) {
/* //this is to sum up multiple entries
map<int, double>::iterator itf=M.find(l[i]);
if (itf==M.end())
M.insert(make_pair(l[i], w[i]));
else
itf->second+=w[i];
//*/
M.insert(make_pair(l[i], make_pair(w[i].first, w[i].second)));
}
if(_size_!=int(M.size())) {
delete[] l;
l = NULL;
delete[] w;
w = NULL;
_size_=M.size();
position=M.size();
l=new int[_size_];
w=new pair<int, double>[_size_];
}
int poi=0;
for(map<int, pair<int, double> >::iterator itm=M.begin(); itm!=M.end(); itm++) {
l[poi]=itm->first;
w[poi]=itm->second;
poi++;
}
}
void prints(wsarray &a) {
for (int i=0; i<a.size(); i++)
cout<<a.l[i]<<"\t"<<a.w[i].first<<" "<<a.w[i].second<<endl;
cout<<endl;
}
void prints(wsarray &a, ostream & pout) {
for (int i=0; i<a.size(); i++)
cout<<a.l[i]<<"\t"<<a.w[i].first<<" "<<a.w[i].second<<endl;
pout<<endl;
}
void prints(wsarray *a, ostream & pout) {
for (int i=0; i<a->size(); i++)
cout<<a->l[i]<<"\t"<<a->w[i].first<<" "<<a->w[i].second<<endl;
pout<<endl;
}
void prints(wsarray *a) {
prints(a, cout);
}
#endif