liquid_feedback_core

annotate lf_update_suggestion_order.c @ 369:cad83f274b79

find changesets by author, revision, files, or words in the commit message
Bugfix: Numerical ordering of suggestion_id in "lf_update_suggestion_order"
author jbe
date Sun Mar 17 16:06:16 2013 +0100 (2013-03-17)
parents 18289b64def1
children 794974af6d6d
rev   line source
jbe@352 1 #include <stdlib.h>
jbe@352 2 #include <stdio.h>
jbe@352 3 #include <string.h>
jbe@352 4 #include <libpq-fe.h>
jbe@352 5 #include <search.h>
jbe@352 6
jbe@352 7 static char *escapeLiteral(PGconn *conn, const char *str, size_t len) {
jbe@352 8 // provides compatibility for PostgreSQL versions prior 9.0
jbe@352 9 // in future: return PQescapeLiteral(conn, str, len);
jbe@352 10 char *res;
jbe@352 11 size_t res_len;
jbe@352 12 res = malloc(2*len+3);
jbe@358 13 if (!res) return NULL;
jbe@352 14 res[0] = '\'';
jbe@352 15 res_len = PQescapeStringConn(conn, res+1, str, len, NULL);
jbe@352 16 res[res_len+1] = '\'';
jbe@352 17 res[res_len+2] = 0;
jbe@352 18 return res;
jbe@352 19 }
jbe@352 20
jbe@352 21 static void freemem(void *ptr) {
jbe@352 22 // to be used for "escapeLiteral" function
jbe@352 23 // provides compatibility for PostgreSQL versions prior 9.0
jbe@352 24 // in future: PQfreemem(ptr);
jbe@352 25 free(ptr);
jbe@352 26 }
jbe@352 27
jbe@352 28 #define COL_MEMBER_ID 0
jbe@352 29 #define COL_WEIGHT 1
jbe@352 30 #define COL_PREFERENCE 2
jbe@352 31 #define COL_SUGGESTION_ID 3
jbe@352 32
jbe@353 33 struct candidate {
jbe@353 34 char *key;
jbe@356 35 double score_per_step;
jbe@356 36 int reaches_score;
jbe@353 37 double score;
jbe@353 38 int seat;
jbe@353 39 };
jbe@353 40
jbe@369 41 static int compare_id(char *id1, char *id2) {
jbe@369 42 int ldiff;
jbe@369 43 ldiff = strlen(id1) - strlen(id2);
jbe@369 44 if (ldiff) return ldiff;
jbe@369 45 else return strcmp(id1, id2);
jbe@369 46 }
jbe@369 47
jbe@353 48 static int compare_candidate(struct candidate *c1, struct candidate *c2) {
jbe@369 49 return compare_id(c1->key, c2->key);
jbe@353 50 }
jbe@352 51
jbe@353 52 static int candidate_count;
jbe@353 53 static struct candidate *candidates;
jbe@353 54
jbe@353 55 static void register_candidate(char **candidate_key, VISIT visit, int level) {
jbe@352 56 if (visit == postorder || visit == leaf) {
jbe@353 57 struct candidate *candidate;
jbe@353 58 candidate = candidates + (candidate_count++);
jbe@353 59 candidate->key = *candidate_key;
jbe@353 60 candidate->seat = 0;
jbe@352 61 }
jbe@352 62 }
jbe@352 63
jbe@353 64 static struct candidate *candidate_by_key(char *candidate_key) {
jbe@353 65 struct candidate *candidate;
jbe@353 66 struct candidate compare;
jbe@353 67 compare.key = candidate_key;
jbe@353 68 candidate = bsearch(&compare, candidates, candidate_count, sizeof(struct candidate), (void *)compare_candidate);
jbe@353 69 if (!candidate) {
jbe@356 70 fprintf(stderr, "Candidate not found (should not happen).\n");
jbe@352 71 abort();
jbe@352 72 }
jbe@353 73 return candidate;
jbe@352 74 }
jbe@352 75
jbe@352 76 struct ballot_section {
jbe@352 77 int count;
jbe@353 78 struct candidate **candidates;
jbe@352 79 };
jbe@352 80
jbe@352 81 struct ballot {
jbe@352 82 int weight;
jbe@352 83 struct ballot_section sections[4];
jbe@352 84 };
jbe@352 85
jbe@356 86 static struct candidate *loser(int round_number, struct ballot *ballots, int ballot_count) {
jbe@356 87 int i, j, k;
jbe@356 88 int remaining;
jbe@356 89 for (i=0; i<candidate_count; i++) {
jbe@356 90 candidates[i].score = 0.0;
jbe@356 91 }
jbe@356 92 remaining = candidate_count - round_number;
jbe@356 93 while (1) {
jbe@356 94 double scale;
jbe@356 95 if (remaining <= 1) break;
jbe@356 96 for (i=0; i<candidate_count; i++) {
jbe@356 97 candidates[i].score_per_step = 0.0;
jbe@356 98 candidates[i].reaches_score = 0;
jbe@356 99 }
jbe@356 100 for (i=0; i<ballot_count; i++) {
jbe@356 101 for (j=0; j<4; j++) {
jbe@356 102 int matches = 0;
jbe@356 103 for (k=0; k<ballots[i].sections[j].count; k++) {
jbe@356 104 struct candidate *candidate;
jbe@356 105 candidate = ballots[i].sections[j].candidates[k];
jbe@356 106 if (candidate->score < 1.0 && !candidate->seat) matches++;
jbe@356 107 }
jbe@356 108 if (matches) {
jbe@356 109 double score_inc;
jbe@368 110 score_inc = (double)ballots[i].weight / (double)matches;
jbe@356 111 for (k=0; k<ballots[i].sections[j].count; k++) {
jbe@356 112 struct candidate *candidate;
jbe@356 113 candidate = ballots[i].sections[j].candidates[k];
jbe@356 114 if (candidate->score < 1.0 && !candidate->seat) {
jbe@356 115 candidate->score_per_step += score_inc;
jbe@356 116 }
jbe@356 117 }
jbe@356 118 break;
jbe@356 119 }
jbe@356 120 }
jbe@356 121 }
jbe@368 122 scale = (double)0.0;
jbe@356 123 for (i=0; i<candidate_count; i++) {
jbe@356 124 double max_scale;
jbe@356 125 if (candidates[i].score_per_step > 0.0) {
jbe@356 126 max_scale = (1.0-candidates[i].score) / candidates[i].score_per_step;
jbe@368 127 if (scale == 0.0 || max_scale <= scale) {
jbe@356 128 scale = max_scale;
jbe@356 129 candidates[i].reaches_score = 1;
jbe@356 130 }
jbe@356 131 }
jbe@356 132 }
jbe@356 133 for (i=0; i<candidate_count; i++) {
jbe@356 134 if (candidates[i].score_per_step > 0.0) {
jbe@356 135 if (candidates[i].reaches_score) {
jbe@356 136 candidates[i].score = 1.0;
jbe@356 137 remaining--;
jbe@356 138 } else {
jbe@356 139 candidates[i].score += scale * candidates[i].score_per_step;
jbe@356 140 if (candidates[i].score >= 1.0) remaining--;
jbe@356 141 }
jbe@356 142 if (remaining <= 1) break;
jbe@356 143 }
jbe@356 144 }
jbe@356 145 }
jbe@356 146 for (i=candidate_count-1; i>=0; i--) {
jbe@356 147 if (candidates[i].score < 1.0 && !candidates[i].seat) return candidates+i;
jbe@356 148 }
jbe@356 149 fprintf(stderr, "No remaining candidate (should not happen).");
jbe@356 150 abort();
jbe@356 151 }
jbe@356 152
jbe@359 153 static int write_ranks(PGconn *db, char *escaped_initiative_id, int final) {
jbe@358 154 PGresult *res;
jbe@358 155 char *cmd;
jbe@358 156 int i;
jbe@359 157 if (final) {
jbe@359 158 if (asprintf(&cmd, "BEGIN; UPDATE \"initiative\" SET \"final_suggestion_order_calculated\" = TRUE WHERE \"id\" = %s; UPDATE \"suggestion\" SET \"proportional_order\" = NULL WHERE \"initiative_id\" = %s", escaped_initiative_id, escaped_initiative_id) < 0) {
jbe@359 159 fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@359 160 abort();
jbe@359 161 }
jbe@359 162 } else {
jbe@359 163 if (asprintf(&cmd, "BEGIN; UPDATE \"suggestion\" SET \"proportional_order\" = NULL WHERE \"initiative_id\" = %s", escaped_initiative_id) < 0) {
jbe@359 164 fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@359 165 abort();
jbe@359 166 }
jbe@358 167 }
jbe@358 168 res = PQexec(db, cmd);
jbe@358 169 free(cmd);
jbe@358 170 if (!res) {
jbe@358 171 fprintf(stderr, "Error in pqlib while sending SQL command to initiate suggestion update.\n");
jbe@358 172 return 1;
jbe@358 173 } else if (
jbe@358 174 PQresultStatus(res) != PGRES_COMMAND_OK &&
jbe@358 175 PQresultStatus(res) != PGRES_TUPLES_OK
jbe@358 176 ) {
jbe@358 177 fprintf(stderr, "Error while executing SQL command to initiate suggestion update:\n%s", PQresultErrorMessage(res));
jbe@358 178 PQclear(res);
jbe@358 179 return 1;
jbe@358 180 } else {
jbe@358 181 PQclear(res);
jbe@358 182 }
jbe@358 183 for (i=0; i<candidate_count; i++) {
jbe@358 184 char *escaped_suggestion_id;
jbe@358 185 escaped_suggestion_id = escapeLiteral(db, candidates[i].key, strlen(candidates[i].key));
jbe@358 186 if (!escaped_suggestion_id) {
jbe@358 187 fprintf(stderr, "Could not escape literal in memory.\n");
jbe@358 188 abort();
jbe@358 189 }
jbe@358 190 if (asprintf(&cmd, "UPDATE \"suggestion\" SET \"proportional_order\" = %i WHERE \"id\" = %s", candidates[i].seat, escaped_suggestion_id) < 0) {
jbe@358 191 fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@358 192 abort();
jbe@358 193 }
jbe@358 194 freemem(escaped_suggestion_id);
jbe@358 195 res = PQexec(db, cmd);
jbe@358 196 free(cmd);
jbe@358 197 if (!res) {
jbe@358 198 fprintf(stderr, "Error in pqlib while sending SQL command to update suggestion order.\n");
jbe@358 199 } else if (
jbe@358 200 PQresultStatus(res) != PGRES_COMMAND_OK &&
jbe@358 201 PQresultStatus(res) != PGRES_TUPLES_OK
jbe@358 202 ) {
jbe@358 203 fprintf(stderr, "Error while executing SQL command to update suggestion order:\n%s", PQresultErrorMessage(res));
jbe@358 204 PQclear(res);
jbe@358 205 } else {
jbe@358 206 PQclear(res);
jbe@358 207 continue;
jbe@358 208 }
jbe@358 209 res = PQexec(db, "ROLLBACK");
jbe@358 210 if (res) PQclear(res);
jbe@358 211 return 1;
jbe@358 212 }
jbe@358 213 res = PQexec(db, "COMMIT");
jbe@358 214 if (!res) {
jbe@358 215 fprintf(stderr, "Error in pqlib while sending SQL command to commit transaction.\n");
jbe@358 216 return 1;
jbe@358 217 } else if (
jbe@358 218 PQresultStatus(res) != PGRES_COMMAND_OK &&
jbe@358 219 PQresultStatus(res) != PGRES_TUPLES_OK
jbe@358 220 ) {
jbe@358 221 fprintf(stderr, "Error while executing SQL command to commit transaction:\n%s", PQresultErrorMessage(res));
jbe@358 222 PQclear(res);
jbe@358 223 return 1;
jbe@358 224 } else {
jbe@358 225 PQclear(res);
jbe@358 226 return 0;
jbe@358 227 }
jbe@358 228 }
jbe@358 229
jbe@359 230 static int process_initiative(PGconn *db, PGresult *res, char *escaped_initiative_id, int final) {
jbe@358 231 int err;
jbe@366 232 int ballot_count = 1;
jbe@356 233 struct ballot *ballots;
jbe@355 234 int i;
jbe@355 235 {
jbe@355 236 void *candidate_tree = NULL;
jbe@355 237 int tuple_count;
jbe@355 238 char *old_member_id = NULL;
jbe@355 239 struct ballot *ballot;
jbe@355 240 int candidates_in_sections[4] = {0, };
jbe@367 241 candidate_count = 0;
jbe@359 242 tuple_count = PQntuples(res);
jbe@359 243 if (!tuple_count) {
jbe@359 244 if (final) {
jbe@359 245 printf("No suggestions found, but marking initiative as finally calculated.\n");
jbe@359 246 err = write_ranks(db, escaped_initiative_id, final);
jbe@359 247 printf("Done.\n");
jbe@359 248 return err;
jbe@359 249 } else {
jbe@359 250 printf("Nothing to do.\n");
jbe@359 251 return 0;
jbe@359 252 }
jbe@359 253 }
jbe@366 254 for (i=0; i<tuple_count; i++) {
jbe@355 255 char *member_id, *suggestion_id;
jbe@366 256 member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@366 257 suggestion_id = PQgetvalue(res, i, COL_SUGGESTION_ID);
jbe@369 258 if (!candidate_tree || !tfind(suggestion_id, &candidate_tree, (void *)compare_id)) {
jbe@366 259 candidate_count++;
jbe@369 260 if (!tsearch(suggestion_id, &candidate_tree, (void *)compare_id)) {
jbe@366 261 fprintf(stderr, "Insufficient memory while inserting into candidate tree.\n");
jbe@366 262 abort();
jbe@352 263 }
jbe@352 264 }
jbe@366 265 if (old_member_id && strcmp(old_member_id, member_id)) ballot_count++;
jbe@355 266 old_member_id = member_id;
jbe@352 267 }
jbe@355 268 printf("Candidate count: %i\n", candidate_count);
jbe@355 269 candidates = malloc(candidate_count * sizeof(struct candidate));
jbe@355 270 if (!candidates) {
jbe@356 271 fprintf(stderr, "Insufficient memory while creating candidate list.\n");
jbe@353 272 abort();
jbe@352 273 }
jbe@355 274 candidate_count = 0;
jbe@355 275 twalk(candidate_tree, (void *)register_candidate);
jbe@369 276 while (candidate_tree) tdelete(*(void **)candidate_tree, &candidate_tree, (void *)compare_id);
jbe@355 277 printf("Ballot count: %i\n", ballot_count);
jbe@355 278 ballots = calloc(ballot_count, sizeof(struct ballot));
jbe@355 279 if (!ballots) {
jbe@356 280 fprintf(stderr, "Insufficient memory while creating ballot list.\n");
jbe@353 281 abort();
jbe@352 282 }
jbe@355 283 ballot = ballots;
jbe@365 284 old_member_id = NULL;
jbe@355 285 for (i=0; i<tuple_count; i++) {
jbe@363 286 char *member_id;
jbe@355 287 int weight, preference;
jbe@352 288 member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@355 289 weight = (int)strtol(PQgetvalue(res, i, COL_WEIGHT), (char **)NULL, 10);
jbe@355 290 if (weight <= 0) {
jbe@356 291 fprintf(stderr, "Unexpected weight value.\n");
jbe@358 292 free(ballots);
jbe@358 293 free(candidates);
jbe@358 294 return 1;
jbe@355 295 }
jbe@352 296 preference = (int)strtol(PQgetvalue(res, i, COL_PREFERENCE), (char **)NULL, 10);
jbe@352 297 if (preference < 1 || preference > 4) {
jbe@356 298 fprintf(stderr, "Unexpected preference value.\n");
jbe@358 299 free(ballots);
jbe@358 300 free(candidates);
jbe@358 301 return 1;
jbe@352 302 }
jbe@352 303 preference--;
jbe@366 304 if (old_member_id && strcmp(old_member_id, member_id)) ballot++;
jbe@355 305 ballot->weight = weight;
jbe@355 306 ballot->sections[preference].count++;
jbe@355 307 old_member_id = member_id;
jbe@355 308 }
jbe@355 309 for (i=0; i<ballot_count; i++) {
jbe@355 310 int j;
jbe@355 311 for (j=0; j<4; j++) {
jbe@355 312 if (ballots[i].sections[j].count) {
jbe@355 313 ballots[i].sections[j].candidates = malloc(ballots[i].sections[j].count * sizeof(struct candidate *));
jbe@355 314 if (!ballots[i].sections[j].candidates) {
jbe@356 315 fprintf(stderr, "Insufficient memory while creating ballot section.\n");
jbe@355 316 abort();
jbe@355 317 }
jbe@355 318 }
jbe@355 319 }
jbe@352 320 }
jbe@365 321 old_member_id = NULL;
jbe@355 322 ballot = ballots;
jbe@365 323 for (i=0; i<tuple_count; i++) {
jbe@355 324 char *member_id, *suggestion_id;
jbe@355 325 int preference;
jbe@366 326 member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@366 327 suggestion_id = PQgetvalue(res, i, COL_SUGGESTION_ID);
jbe@366 328 preference = (int)strtol(PQgetvalue(res, i, COL_PREFERENCE), (char **)NULL, 10);
jbe@366 329 preference--;
jbe@366 330 if (old_member_id && strcmp(old_member_id, member_id)) {
jbe@366 331 ballot++;
jbe@366 332 candidates_in_sections[0] = 0;
jbe@366 333 candidates_in_sections[1] = 0;
jbe@366 334 candidates_in_sections[2] = 0;
jbe@366 335 candidates_in_sections[3] = 0;
jbe@355 336 }
jbe@366 337 ballot->sections[preference].candidates[candidates_in_sections[preference]++] = candidate_by_key(suggestion_id);
jbe@355 338 old_member_id = member_id;
jbe@352 339 }
jbe@352 340 }
jbe@355 341
jbe@356 342 for (i=0; i<candidate_count; i++) {
jbe@356 343 struct candidate *candidate = loser(i, ballots, ballot_count);
jbe@356 344 candidate->seat = candidate_count - i;
jbe@358 345 printf("Assigning rank #%i to suggestion #%s.\n", candidate_count - i, candidate->key);
jbe@356 346 }
jbe@356 347
jbe@354 348 for (i=0; i<ballot_count; i++) {
jbe@354 349 int j;
jbe@354 350 for (j=0; j<4; j++) {
jbe@354 351 if (ballots[i].sections[j].count) {
jbe@354 352 free(ballots[i].sections[j].candidates);
jbe@354 353 }
jbe@354 354 }
jbe@354 355 }
jbe@354 356 free(ballots);
jbe@358 357
jbe@361 358 if (final) {
jbe@361 359 printf("Writing final ranks to database.\n");
jbe@361 360 } else {
jbe@361 361 printf("Writing ranks to database.\n");
jbe@361 362 }
jbe@359 363 err = write_ranks(db, escaped_initiative_id, final);
jbe@358 364 printf("Done.\n");
jbe@358 365
jbe@358 366 free(candidates);
jbe@358 367
jbe@358 368 return err;
jbe@352 369 }
jbe@352 370
jbe@352 371 int main(int argc, char **argv) {
jbe@352 372
jbe@352 373 // variable declarations:
jbe@352 374 int err = 0;
jbe@352 375 int i, count;
jbe@352 376 char *conninfo;
jbe@352 377 PGconn *db;
jbe@352 378 PGresult *res;
jbe@352 379
jbe@352 380 // parse command line:
jbe@352 381 if (argc == 0) return 1;
jbe@352 382 if (argc == 1 || !strcmp(argv[1], "-h") || !strcmp(argv[1], "--help")) {
jbe@352 383 FILE *out;
jbe@352 384 out = argc == 1 ? stderr : stdout;
jbe@362 385 fprintf(out, "\n");
jbe@362 386 fprintf(out, "Usage: %s <conninfo>\n", argv[0]);
jbe@362 387 fprintf(out, "\n");
jbe@362 388 fprintf(out, "<conninfo> is specified by PostgreSQL's libpq,\n");
jbe@362 389 fprintf(out, "see http://www.postgresql.org/docs/9.1/static/libpq-connect.html\n");
jbe@362 390 fprintf(out, "\n");
jbe@362 391 fprintf(out, "Example: %s dbname=liquid_feedback\n", argv[0]);
jbe@362 392 fprintf(out, "\n");
jbe@352 393 return argc == 1 ? 1 : 0;
jbe@352 394 }
jbe@352 395 {
jbe@352 396 size_t len = 0;
jbe@352 397 for (i=1; i<argc; i++) len += strlen(argv[i]) + 1;
jbe@352 398 conninfo = malloc(len * sizeof(char));
jbe@352 399 if (!conninfo) {
jbe@358 400 fprintf(stderr, "Error: Could not allocate memory for conninfo string.\n");
jbe@358 401 abort();
jbe@352 402 }
jbe@352 403 conninfo[0] = 0;
jbe@352 404 for (i=1; i<argc; i++) {
jbe@352 405 if (i>1) strcat(conninfo, " ");
jbe@352 406 strcat(conninfo, argv[i]);
jbe@352 407 }
jbe@352 408 }
jbe@352 409
jbe@352 410 // connect to database:
jbe@352 411 db = PQconnectdb(conninfo);
jbe@352 412 if (!db) {
jbe@358 413 fprintf(stderr, "Error: Could not create database handle.\n");
jbe@352 414 return 1;
jbe@352 415 }
jbe@352 416 if (PQstatus(db) != CONNECTION_OK) {
jbe@352 417 fprintf(stderr, "Could not open connection:\n%s", PQerrorMessage(db));
jbe@352 418 return 1;
jbe@352 419 }
jbe@352 420
jbe@352 421 // check initiatives:
jbe@352 422 res = PQexec(db, "SELECT \"initiative_id\", \"final\" FROM \"initiative_suggestion_order_calculation\"");
jbe@352 423 if (!res) {
jbe@358 424 fprintf(stderr, "Error in pqlib while sending SQL command selecting initiatives to process.\n");
jbe@352 425 err = 1;
jbe@352 426 } else if (PQresultStatus(res) != PGRES_TUPLES_OK) {
jbe@358 427 fprintf(stderr, "Error while executing SQL command selecting initiatives to process:\n%s", PQresultErrorMessage(res));
jbe@352 428 err = 1;
jbe@352 429 PQclear(res);
jbe@359 430 } else if (PQnfields(res) < 2) {
jbe@359 431 fprintf(stderr, "Too few columns returned by SQL command selecting initiatives to process.\n");
jbe@359 432 err = 1;
jbe@359 433 PQclear(res);
jbe@352 434 } else {
jbe@352 435 count = PQntuples(res);
jbe@352 436 printf("Number of initiatives to process: %i\n", count);
jbe@352 437 for (i=0; i<count; i++) {
jbe@352 438 char *initiative_id, *escaped_initiative_id;
jbe@359 439 int final;
jbe@352 440 char *cmd;
jbe@352 441 PGresult *res2;
jbe@352 442 initiative_id = PQgetvalue(res, i, 0);
jbe@359 443 final = (PQgetvalue(res, i, 1)[0] == 't') ? 1 : 0;
jbe@352 444 printf("Processing initiative_id: %s\n", initiative_id);
jbe@352 445 escaped_initiative_id = escapeLiteral(db, initiative_id, strlen(initiative_id));
jbe@358 446 if (!escaped_initiative_id) {
jbe@358 447 fprintf(stderr, "Could not escape literal in memory.\n");
jbe@358 448 abort();
jbe@358 449 }
jbe@352 450 if (asprintf(&cmd, "SELECT \"member_id\", \"weight\", \"preference\", \"suggestion_id\" FROM \"individual_suggestion_ranking\" WHERE \"initiative_id\" = %s ORDER BY \"member_id\", \"preference\"", escaped_initiative_id) < 0) {
jbe@352 451 fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@355 452 abort();
jbe@352 453 }
jbe@352 454 res2 = PQexec(db, cmd);
jbe@352 455 free(cmd);
jbe@352 456 if (!res2) {
jbe@358 457 fprintf(stderr, "Error in pqlib while sending SQL command selecting individual suggestion rankings.\n");
jbe@352 458 err = 1;
jbe@352 459 } else if (PQresultStatus(res2) != PGRES_TUPLES_OK) {
jbe@358 460 fprintf(stderr, "Error while executing SQL command selecting individual suggestion rankings:\n%s", PQresultErrorMessage(res));
jbe@352 461 err = 1;
jbe@352 462 PQclear(res2);
jbe@356 463 } else if (PQnfields(res2) < 4) {
jbe@358 464 fprintf(stderr, "Too few columns returned by SQL command selecting individual suggestion rankings.\n");
jbe@356 465 err = 1;
jbe@356 466 PQclear(res2);
jbe@352 467 } else {
jbe@359 468 if (process_initiative(db, res2, escaped_initiative_id, final)) err = 1;
jbe@352 469 PQclear(res2);
jbe@352 470 }
jbe@352 471 freemem(escaped_initiative_id);
jbe@352 472 }
jbe@352 473 PQclear(res);
jbe@352 474 }
jbe@352 475
jbe@352 476 // cleanup and exit
jbe@352 477 PQfinish(db);
jbe@358 478 if (!err) printf("Successfully terminated.\n");
jbe@358 479 else fprintf(stderr, "Exiting with error code #%i.\n", err);
jbe@352 480 return err;
jbe@352 481
jbe@352 482 }

Impressum / About Us