forked from ppdewolf/libnumericalmu
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Numerical.cpp
432 lines (346 loc) · 12 KB
/
Numerical.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
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
/*
* Argus Open Source
* Software to apply Statistical Disclosure Control techniques
*
* Copyright 2014 Statistics Netherlands
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the European Union Public Licence
* (EUPL) version 1.1, as published by the European Commission.
*
* You can find the text of the EUPL v1.1 on
* https://joinup.ec.europa.eu/software/page/eupl/licence-eupl
*
* This software is distributed on an "AS IS" basis without
* warranties or conditions of any kind, either express or implied.
*/
#include <math.h>
#include "Numerical.h"
#include "MicroAggregation.h"
#include "recordSwap.h"
#include <float.h>
#include <locale.h>
#include <string>
/////////////////////////////////////////////////////////////////////////////
// Targeted record swapping
// TODO: add multiple similarity profiles, how to link with Java still to be found
// int* similar is pointer to _all_ profiles: similar[0]...similar[nSim[0]-1], similar[nSim[0]]...similar[nSim[0]+nSim[1]-1], etc.
void Numerical::DoTargetedRecordSwap(/*[in]*/ std::string inFileName, /*[in]*/ std::string outFileName,
/*[in]*/ std::string separator, /*[in]*/ int numVar, /*[in]*/ double swaprate,
/*[in]*/ int nProfiles, /*[in]*/ int* similar, /*[in]*/ int* nSim,
///*[in]*/ int* similar, /*[in]*/ int nSim,
/*[in]*/ int* hierarchy, /*[in]*/ int nHier,
/*[in]*/ int* riskVars, /*[in]*/ int nRisk, /*[in]*/ int* carry, /*[in]*/ int nCarry,
/*[in]*/ int hhID, /*[in]*/ int k_anonymity, /*[out]*/ int* count_swapped_records,
/*[out]*/ int* count_swapped_hid, /*[in]*/ int seed, /*[in,out]*/ long* errorCode,
/*[in]*/ std::string logFileName){
long numberOfLines;
std::vector< std::vector<int> > inputdata = ReadFromFileForTRS(inFileName, separator, numVar, &numberOfLines, errorCode);
if (errorCode[0] != 0)
return;
/* //std::vector<int> similarRS(nSim);
std::vector< std::vector<int> > similarRS(1); // Only one similarity profile for now
similarRS[0].resize(nSim); // Only one similarity profile for now
*/
std::vector< std::vector<int> > similarRS(nProfiles);
for (int i=0; i<nProfiles; i++){
similarRS[i].resize(nSim[i]);
}
std::vector< std::vector<double> > risk; // not yet implemented => risk.size() = 0
double risk_threshold = 0; // not yet implemented => risk_threshold = 0
std::vector<int> hierarchyRS(nHier);
std::vector<int> riskRS(nRisk);
std::vector<int> carryRS(nCarry);
//for (int i=0; i<nSim; i++) similarRS[0][i] = similar[i]; // Only one similarity profile for now
int k = 0;
for (int i=0; i<nProfiles; i++){
for (int j=0; j<nSim[i]; j++){
similarRS[i][j] = similar[k+j];
}
k += nSim[i];
}
for (int i=0; i<nHier; i++) hierarchyRS[i] = hierarchy[i]; // Hierarchy variables (regions for swapping)
for (int i=0; i<nRisk; i++) riskRS[i] = riskVars[i]; // Risk variables for k-anonymity
for (int i=0; i<nCarry; i++) carryRS[i] = carry[i]; // Variables to be "carried along" while swapping
//inputdata = recordSwap(inputdata, similarRS, hierarchyRS, riskRS, hhID, th, swaprate, carryRS, seed);
// recordSwap(std::vector< std::vector<int> > data,
// int hid,
// std::vector<int> hierarchy,
// std::vector< std::vector<int> > similar,
// double swaprate,
// std::vector< std::vector<double> > risk,
// double risk_threshold,
// int k_anonymity,
// std::vector<int> risk_variables,
// std::vector<int> carry_along,
// int &count_swapped_records,
// int &count_swapped_hid,
// std::string logFileName,
// int seed = 123456)
inputdata = recordSwap(inputdata, hhID, hierarchyRS, similarRS, swaprate, risk, risk_threshold, k_anonymity, riskRS, carryRS,
*count_swapped_records, *count_swapped_hid, logFileName, seed);
WriteOutputTRS(outFileName, separator, numVar, numberOfLines, inputdata);
}
/////////////////////////////////////////////////////////////////////////////
// CCatalaanCtrl
//void CCatalaanCtrl::FireUpdateProgress (short Perc)
//{ Fire_UpdateProgress(Perc); }
void Numerical::DoMicroAggregation(std::string inFileName, std::string outFileName,
std::string separator, long nVar,
long nMinRecPerGr, long nGroupsPerVar,
long typeSolution, long *nColumnsPerGr,
long *errorCode) {
long numberOfRecords;
double** inputData = ReadFromFile(inFileName, separator, nVar, &numberOfRecords, errorCode);
if (inputData == NULL) {
return;
}
long* var;
//The variables are already sorted in the inputfile
var = new long [nVar];
for (int i = 0; i < nVar; i++) {
var[i] = i;
}
CMicroAggregation microAggr;
long result = microAggr.Microaggregation(nVar, numberOfRecords, nMinRecPerGr,
nGroupsPerVar, nColumnsPerGr, var,
inputData, typeSolution);
if (result != MIC_OK) {
*errorCode = result;
return;
}
WriteOutput(outFileName, separator, nVar, numberOfRecords, inputData);
//Do The deletes
//NB: var was already deleted in the MicroAggregation function;
for (int i = 0; i < numberOfRecords; i++) {
delete[] inputData[i];
}
delete[] inputData;
*errorCode = 0;
}
void Numerical::SetProgressListener(IProgressListener2* progressListener) {
//TODO
;
}
void Numerical::DoRankSwap(std::string inFileName,
std::string outFileName,
std::string separator,
long numVar,
long perc,
long *errorCode) {
long numberOfLines;
double** inputdata = ReadFromFile(inFileName, separator, numVar, &numberOfLines, errorCode);
if (inputdata == NULL)
return;
CRankSwap oRankSwap;
long progress = 0;
long result = oRankSwap.rankswap(inputdata, numberOfLines, numVar, perc, &progress);
if (result != MIC_OK) {
*errorCode = result;
return;
}
WriteOutput(outFileName, separator, numVar, numberOfLines, inputdata);
for (int i = 0; i < numberOfLines; i++) {
delete inputdata[i];
}
delete inputdata;
*errorCode = 0;
}
double** Numerical::ReadFromFile(std::string inFileName,
std::string separator,
long nVar,
long* numberOfLines,
long* errorCode) {
FILE *fdin;
char str[MAXRECORDLENGTH];
std::string stempstr;
std::string stemp;
int iseppos;
double **inputdata;
double d;
setlocale(LC_NUMERIC, "C");
fdin = fopen (inFileName.c_str(), "r");
if (fdin == 0) {
*errorCode = -1;
return NULL;
}
str[0] = 0;
fgets((char *)str, MAXRECORDLENGTH, fdin);
if (str[0] == 0) {
*errorCode = -1;
return NULL;
}
rewind(fdin);
long icount = 0; // length of file
while (!feof(fdin)) {
fgets((char *) str, MAXRECORDLENGTH, fdin);
icount ++;
}
*numberOfLines = icount;
inputdata = new double*[*numberOfLines];
for (long i=0; i<*numberOfLines; i++) {
inputdata[i] = new double [nVar];
if (!inputdata[i])
{
*errorCode = MIC_OUT_MEM;
return NULL;
}
}
rewind(fdin);
long recnr = 0;
while (!feof(fdin)) {
fgets((char *)str, MAXRECORDLENGTH, fdin);
stempstr = std::string(str);
iseppos = stempstr.find(separator,0);
int pos = 0;
icount = 0;
while (iseppos != -1) {
stemp=stempstr.substr(pos,iseppos);
//sVariableCode.SetAt(icount,stemp);
//Check if it is a numerical value
//inputdata[recnr][icount] = strtod(stemp,&stop);
if (!ConvertNumeric(stemp.c_str(), d) ) {
//return ISNOTNUMERIC; // is not numeric! (variabelenummer meegeven voor gebruiker)
}
inputdata[recnr][icount] = d;
icount ++;
pos = iseppos+1;
iseppos = stempstr.find(separator,pos);
}
stemp = stempstr.substr(pos);
if ((stempstr.length() == 0) || (icount < nVar-1) || (icount > nVar))
{
//return false;
}
else
{
// sVariableCode.SetAt(icount,stempstr);
if (!ConvertNumeric(stemp.c_str(), d) ) {
//return ISNOTNUMERIC; // is not numeric! (variabelenummer meegeven voor gebruiker)
}
inputdata[recnr][icount] = d;
}
recnr++;
}
fclose(fdin);
*errorCode = 0;
return inputdata;
}
std::vector< std::vector<int> > Numerical::ReadFromFileForTRS(std::string inFileName,
std::string separator, long nVar, long* numberOfLines, long* errorCode) {
FILE *fdin;
char str[MAXRECORDLENGTH];
std::string stempstr;
std::string stemp;
int iseppos;
std::vector< std::vector<int> > inputdata;
int d;
setlocale(LC_NUMERIC, "C");
fdin = fopen (inFileName.c_str(), "r");
if (fdin == 0) {
*errorCode = -1;
return inputdata;
}
str[0] = 0;
fgets((char *)str, MAXRECORDLENGTH, fdin);
if (str[0] == 0) {
*errorCode = -1;
return inputdata;
}
rewind(fdin);
long icount = 0; // length of file
while (!feof(fdin)) {
fgets((char *) str, MAXRECORDLENGTH, fdin);
icount ++;
}
*numberOfLines = icount;
// For time being:
// inputdata is transposed datafile !!!!
inputdata.resize(*numberOfLines);
for (long i=0; i<*numberOfLines; i++) {
inputdata[i].resize(nVar);
}
rewind(fdin);
long recnr = 0;
while (!feof(fdin)) {
fgets((char *)str, MAXRECORDLENGTH, fdin);
stempstr = std::string(str);
iseppos = stempstr.find(separator,0);
int pos = 0;
icount = 0;
while (iseppos != -1) {
stemp=stempstr.substr(pos,iseppos);
inputdata[recnr][icount] = atoi(stemp.c_str());
//inputdata[icount][recnr] = atoi(stemp.c_str()); // Transpose matrix for time being, see line 327 as well
icount ++;
pos = iseppos+1;
iseppos = stempstr.find(separator,pos);
}
stemp = stempstr.substr(pos);
if ((stempstr.length() == 0) || (icount < nVar-1) || (icount > nVar))
{
//return false;
}
else
{
inputdata[recnr][icount] = atoi(stemp.c_str());
//inputdata[icount][recnr] = atoi(stemp.c_str()); // Transpose matrix for time being
}
recnr++;
}
fclose(fdin);
*errorCode = 0;
return inputdata;
}
bool Numerical::ConvertNumeric(const char* code, double &d)
{ char *stop;
d = strtod(code, &stop);
if (*stop != 0) {
while (*(stop) == ' ') stop++;
if (*stop != 0) {
return false;
}
}
return true;
}
void Numerical::WriteOutput(std::string outFileName, std::string seperator,
long nVar, long nRec,
double **out_Data)
{
FILE *fdout;
long i,j;
fdout = fopen(outFileName.c_str(),"w");
for (i=0; i<nRec; i++) {
for (j=0; j <nVar; j++) {
fprintf(fdout,"%f", out_Data[i][j]);
if (j <nVar-1) {
fprintf(fdout,"%s",seperator.c_str());
}
}
if (i<nRec-1) {
fprintf(fdout,"\n");
}
}
fclose (fdout);
}
void Numerical::WriteOutputTRS(std::string outFileName, std::string seperator,
long nVar, long nRec,
std::vector< std::vector<int> > out_Data)
{
FILE *fdout;
long i,j;
fdout = fopen(outFileName.c_str(),"w");
for (i=0; i<nRec; i++) {
for (j=0; j <nVar; j++) {
fprintf(fdout,"%d", out_Data[i][j]);
//fprintf(fdout,"%d", out_Data[j][i]); // Transpose back
if (j <nVar-1) {
fprintf(fdout,"%s",seperator.c_str());
}
}
if (i<nRec-1) {
fprintf(fdout,"\n");
}
}
fclose (fdout);
}