-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmodel.cpp
417 lines (355 loc) · 8.39 KB
/
model.cpp
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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
/*
Copyright (C) 2018-2019 Michelle Blom
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include<fstream>
#include<algorithm>
#include<iostream>
#include<sstream>
#include<time.h>
#include<stdlib.h>
#include<cstdio>
#include<memory>
#include<stdexcept>
#include<string>
#include<array>
#include "model.h"
using namespace std;
typedef boost::char_separator<char> boostcharsep;
int RandInRange(int a, int b){
if(a == b) return a;
if(b + 1 == a){
if(rand() <= 0.5)
return a;
else
return b;
}
return a + rand() % ((b + 1) - a);
}
void TwoRandInRange(int a, int b, int &first, int &second){
first = RandInRange(a, b);
if(first == a){
second = RandInRange(a+1, b);
}
else if(first == b){
second = RandInRange(a, b-1);
}
else{
int s1 = RandInRange(a, first-1);
int s2 = RandInRange(first+1, b);
if(RandInRange(0,1) == 0)
second = s1;
else
second = s2;
}
}
std::string exec(const char* cmd) {
std::array<char, 128> buffer;
std::string result;
std::shared_ptr<FILE> pipe(popen(cmd, "r"), pclose);
if (!pipe) throw std::runtime_error("popen() failed!");
while (!feof(pipe.get())) {
if (fgets(buffer.data(), 128, pipe.get()) != nullptr)
result += buffer.data();
}
return result;
}
void select_random_ballots(int nballots, long seed, Ints &r){
stringstream ss;
// IMPORTANT: replace python3.6 with your python version.
ss << "python3.6 Sampler.py " << seed << " " << nballots;
auto x = ss.str();
cout << ss.str() << endl;
string res = exec(x.c_str());
boostcharsep spcom(",");
Split2Ints(res, spcom, r);
}
void GetTime(struct mytimespec *t)
{
#ifndef _WIN32
struct timeval tv;
gettimeofday(&tv, NULL);
t->seconds = tv.tv_sec + (tv.tv_usec/1E6);
#else
t->seconds = clock()/CLOCKS_PER_SEC;
#endif
}
template <typename T>
T ToType(const std::string &s)
{
try
{
return boost::lexical_cast<T>(s);
}
catch(...)
{
throw STVException("Lexical cast problem");
}
}
void Split2Ints(const string &line, const boostcharsep &sep, Ints &r)
{
try
{
vector<string> result;
boost::tokenizer<boostcharsep> tokens(line, sep);
result.assign(tokens.begin(), tokens.end());
for(int i = 0; i < result.size(); ++i)
{
boost::algorithm::trim(result[i]);
int v = ToType<int>(result[i]);
r.push_back(v);
}
}
catch(exception &e)
{
stringstream ss;
ss << e.what();
throw STVException(ss.str());
}
catch(STVException &e)
{
throw e;
}
catch(...)
{
throw STVException("Error in Split Function.");
}
}
void Split(const string &line, const boostcharsep &sep, vector<string> &r)
{
try
{
boost::tokenizer<boostcharsep> tokens(line, sep);
r.assign(tokens.begin(), tokens.end());
for(int i = 0; i < r.size(); ++i)
{
boost::algorithm::trim(r[i]);
}
}
catch(exception &e)
{
stringstream ss;
ss << e.what();
throw STVException(ss.str());
}
catch(STVException &e)
{
throw e;
}
catch(...)
{
throw STVException("Error in Split Function.");
}
}
bool ReadReportedBallots(const char *path, Ballots &ballots,
Candidates &candidates, Config &config, double errorp)
{
try
{
ifstream infile(path);
// First line is list of candidates.
boostcharsep spcom(",");
string line;
getline(infile, line);
vector<string> columns;
Split(line, spcom, columns);
config.ncandidates = columns.size();
for(int i = 0; i < columns.size(); ++i)
{
int id = ToType<int>(columns[i]);
Candidate c;
c.index = i;
c.id = id;
candidates.push_back(c);
config.id2index.insert(pair<int,int>(id,i));
}
// Skip next line (separator)
getline(infile, line);
boostcharsep sp(",():");
int num_errors = 0;
int cntr = ballots.size();
while(getline(infile, line))
{
vector<string> columns;
Split(line, sp, columns);
int votes = ToType<double>(columns.back());
Ints prefs;
Ballot b;
b.tag = cntr;
b.votes = ToType<double>(columns.back());
for(int i = 0; i < columns.size()-1; ++i)
{
if(columns[i] == "") continue;
int ccode = ToType<int>(columns[i]);
int index = config.id2index.find(ccode)->second;
if(find(prefs.begin(),
prefs.end(), index) != prefs.end())
{
continue;
}
prefs.push_back(index);
}
//if(prefs.empty()) continue;
for(int j = 0; j < votes; ++j){
Ballot b;
b.tag = cntr;
b.prefs = prefs;
b.votes = 1;
double roll = rand() / ((double)RAND_MAX);
if(!prefs.empty() && roll <= errorp){
roll = rand() / ((double)RAND_MAX);
Ints cands_in(config.ncandidates, 0);
for(int k = 0; k < prefs.size(); ++k){
cands_in[prefs[k]] = 1;
}
Ints cands_out;
for(int k = 0; k < config.ncandidates; ++k){
if(cands_in[k] == 0)
cands_out.push_back(k);
}
if(b.prefs.size() == 1){
int idx = RandInRange(0, cands_out.size()-1);
if(roll <= 0.50){
// Replace candidate
b.prefs[0] = cands_out[idx];
}
else{
// Add random candidate
int pos = RandInRange(0, 1);
if(pos == 0){
b.prefs.insert(b.prefs.begin(),cands_out[idx]);
}
else{
b.prefs.push_back(cands_out[idx]);
}
}
}
else{
if(roll <= 0.33){
// Flip two candidates
int f = 0, s = 1;
TwoRandInRange(0, b.prefs.size()-1, f, s);
int fval = b.prefs[f];
b.prefs[f] = b.prefs[s];
b.prefs[s] = fval;
}
else if(roll <= 0.66 && cands_out.size() != 0){
// Add random candidate into random position
int idx = RandInRange(0, cands_out.size()-1);
int pos = RandInRange(0, b.prefs.size()-1);
if(pos == 0)
b.prefs.insert(b.prefs.begin(),cands_out[idx]);
else
b.prefs.insert(b.prefs.begin()+pos,cands_out[idx]);
}
else{
// Subtract candidate from random position
int pos = RandInRange(0, b.prefs.size()-1);
if(pos == 0)
b.prefs.erase(b.prefs.begin());
else
b.prefs.erase(b.prefs.begin()+pos);
}
}
num_errors += 1;
}
ballots.push_back(b);
if(!b.prefs.empty()){
Candidate &cand = candidates[b.prefs.front()];
cand.sum_votes += 1;
}
config.totalvotes += 1;
++cntr;
}
}
cout << num_errors << " errors added." << endl;
infile.close();
}
catch(exception &e)
{
throw e;
}
catch(STVException &e)
{
throw e;
}
catch(...)
{
cout << "Unexpected error reading in reported ballots." << endl;
return false;
}
return true;
}
// Assumed input format:
// (first_id, second_id, third_id, ...) : #appears
bool ReadActualBallots(const char *path, Ballots &ballots,
const Candidates &candidates, const Config &config)
{
try
{
ifstream infile(path);
// First line is list of candidates.
boostcharsep spcom(",");
string line;
getline(infile, line);
// Skip next line (separator)
getline(infile, line);
boostcharsep sp(",():");
int cntr = ballots.size();
while(getline(infile, line))
{
vector<string> columns;
Split(line, sp, columns);
int votes = ToType<double>(columns.back());
Ints prefs;
Ballot b;
b.tag = cntr;
b.votes = ToType<double>(columns.back());
for(int i = 0; i < columns.size()-1; ++i)
{
if(columns[i] == "") continue;
int ccode = ToType<int>(columns[i]);
int index = config.id2index.find(ccode)->second;
if(find(prefs.begin(),
prefs.end(), index) != prefs.end())
{
continue;
}
prefs.push_back(index);
}
//if(prefs.empty()) continue;
for(int j = 0; j < votes; ++j){
Ballot b;
b.tag = cntr;
b.prefs = prefs;
b.votes = 1;
ballots.push_back(b);
++cntr;
}
}
infile.close();
}
catch(exception &e)
{
throw e;
}
catch(STVException &e)
{
throw e;
}
catch(...)
{
cout << "Unexpected error reading in ballots." << endl;
return false;
}
return true;
}