liquid_feedback_core

annotate lf_update_suggestion_order.c @ 361:3bb60d324a22

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

Impressum / About Us