liquid_feedback_core

annotate lf_update_suggestion_order.c @ 355:accffcefeff7

find changesets by author, revision, files, or words in the commit message
Code cleanup in "lf_update_suggestion_order" (own block for preparation of the ballot data)
author jbe
date Sat Mar 16 18:29:55 2013 +0100 (2013-03-16)
parents c23bb5ebcdec
children 4698b68e0942
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@352 13 res[0] = '\'';
jbe@352 14 res_len = PQescapeStringConn(conn, res+1, str, len, NULL);
jbe@352 15 res[res_len+1] = '\'';
jbe@352 16 res[res_len+2] = 0;
jbe@352 17 return res;
jbe@352 18 }
jbe@352 19
jbe@352 20 static void freemem(void *ptr) {
jbe@352 21 // to be used for "escapeLiteral" function
jbe@352 22 // provides compatibility for PostgreSQL versions prior 9.0
jbe@352 23 // in future: PQfreemem(ptr);
jbe@352 24 free(ptr);
jbe@352 25 }
jbe@352 26
jbe@352 27 #define COL_MEMBER_ID 0
jbe@352 28 #define COL_WEIGHT 1
jbe@352 29 #define COL_PREFERENCE 2
jbe@352 30 #define COL_SUGGESTION_ID 3
jbe@352 31
jbe@353 32 struct candidate {
jbe@353 33 char *key;
jbe@353 34 double score;
jbe@353 35 int seat;
jbe@353 36 };
jbe@353 37
jbe@353 38 static int compare_candidate(struct candidate *c1, struct candidate *c2) {
jbe@353 39 return strcmp(c1->key, c2->key);
jbe@353 40 }
jbe@352 41
jbe@353 42 static int candidate_count;
jbe@353 43 static struct candidate *candidates;
jbe@353 44
jbe@353 45 static void register_candidate(char **candidate_key, VISIT visit, int level) {
jbe@352 46 if (visit == postorder || visit == leaf) {
jbe@353 47 struct candidate *candidate;
jbe@353 48 candidate = candidates + (candidate_count++);
jbe@353 49 candidate->key = *candidate_key;
jbe@353 50 candidate->score = 0.0;
jbe@353 51 candidate->seat = 0;
jbe@352 52 }
jbe@352 53 }
jbe@352 54
jbe@353 55 static struct candidate *candidate_by_key(char *candidate_key) {
jbe@353 56 struct candidate *candidate;
jbe@353 57 struct candidate compare;
jbe@353 58 compare.key = candidate_key;
jbe@353 59 candidate = bsearch(&compare, candidates, candidate_count, sizeof(struct candidate), (void *)compare_candidate);
jbe@353 60 if (!candidate) {
jbe@352 61 fprintf(stderr, "Candidate not found (should not happen)\n");
jbe@352 62 abort();
jbe@352 63 }
jbe@353 64 return candidate;
jbe@352 65 }
jbe@352 66
jbe@352 67 struct ballot_section {
jbe@352 68 int count;
jbe@353 69 struct candidate **candidates;
jbe@352 70 };
jbe@352 71
jbe@352 72 struct ballot {
jbe@352 73 int weight;
jbe@352 74 struct ballot_section sections[4];
jbe@352 75 };
jbe@352 76
jbe@352 77 static void process_initiative(PGresult *res) {
jbe@352 78 int ballot_count = 0;
jbe@355 79 int i;
jbe@355 80 struct ballot *ballots;
jbe@355 81 {
jbe@355 82 void *candidate_tree = NULL;
jbe@355 83 int tuple_count;
jbe@355 84 char *old_member_id = NULL;
jbe@355 85 struct ballot *ballot;
jbe@355 86 int candidates_in_sections[4] = {0, };
jbe@355 87 candidate_count = 0;
jbe@355 88 tuple_count = PQntuples(res);
jbe@355 89 for (i=0; i<=tuple_count; i++) {
jbe@355 90 char *member_id, *suggestion_id;
jbe@355 91 if (i<tuple_count) {
jbe@355 92 member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@355 93 suggestion_id = PQgetvalue(res, i, COL_SUGGESTION_ID);
jbe@355 94 if (!candidate_tree || !tfind(suggestion_id, &candidate_tree, (void *)strcmp)) {
jbe@355 95 candidate_count++;
jbe@355 96 if (!tsearch(suggestion_id, &candidate_tree, (void *)strcmp)) {
jbe@355 97 fprintf(stderr, "Insufficient memory\n");
jbe@355 98 abort();
jbe@355 99 }
jbe@352 100 }
jbe@352 101 }
jbe@355 102 if (i==tuple_count || (old_member_id && strcmp(old_member_id, member_id))) {
jbe@355 103 ballot_count++;
jbe@355 104 }
jbe@355 105 old_member_id = member_id;
jbe@352 106 }
jbe@355 107 printf("Candidate count: %i\n", candidate_count);
jbe@355 108 candidates = malloc(candidate_count * sizeof(struct candidate));
jbe@355 109 if (!candidates) {
jbe@355 110 fprintf(stderr, "Insufficient memory\n");
jbe@353 111 abort();
jbe@352 112 }
jbe@355 113 candidate_count = 0;
jbe@355 114 twalk(candidate_tree, (void *)register_candidate);
jbe@355 115 while (candidate_tree) tdelete(*(void **)candidate_tree, &candidate_tree, (void *)strcmp);
jbe@355 116 printf("Ballot count: %i\n", ballot_count);
jbe@355 117 ballots = calloc(ballot_count, sizeof(struct ballot));
jbe@355 118 if (!ballots) {
jbe@355 119 fprintf(stderr, "Insufficient memory\n");
jbe@353 120 abort();
jbe@352 121 }
jbe@355 122 ballot = ballots;
jbe@355 123 for (i=0; i<tuple_count; i++) {
jbe@355 124 char *member_id, *suggestion_id;
jbe@355 125 int weight, preference;
jbe@352 126 member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@352 127 suggestion_id = PQgetvalue(res, i, COL_SUGGESTION_ID);
jbe@355 128 weight = (int)strtol(PQgetvalue(res, i, COL_WEIGHT), (char **)NULL, 10);
jbe@355 129 if (weight <= 0) {
jbe@355 130 fprintf(stderr, "Unexpected weight value\n");
jbe@355 131 abort();
jbe@355 132 }
jbe@352 133 preference = (int)strtol(PQgetvalue(res, i, COL_PREFERENCE), (char **)NULL, 10);
jbe@352 134 if (preference < 1 || preference > 4) {
jbe@352 135 fprintf(stderr, "Unexpected preference value\n");
jbe@352 136 abort();
jbe@352 137 }
jbe@352 138 preference--;
jbe@355 139 ballot->weight = weight;
jbe@355 140 ballot->sections[preference].count++;
jbe@355 141 if (old_member_id && strcmp(old_member_id, member_id)) ballot++;
jbe@355 142 old_member_id = member_id;
jbe@355 143 }
jbe@355 144 for (i=0; i<ballot_count; i++) {
jbe@355 145 int j;
jbe@355 146 for (j=0; j<4; j++) {
jbe@355 147 if (ballots[i].sections[j].count) {
jbe@355 148 ballots[i].sections[j].candidates = malloc(ballots[i].sections[j].count * sizeof(struct candidate *));
jbe@355 149 if (!ballots[i].sections[j].candidates) {
jbe@355 150 fprintf(stderr, "Insufficient memory\n");
jbe@355 151 abort();
jbe@355 152 }
jbe@355 153 }
jbe@355 154 }
jbe@352 155 }
jbe@355 156 ballot = ballots;
jbe@355 157 for (i=0; i<=tuple_count; i++) {
jbe@355 158 char *member_id, *suggestion_id;
jbe@355 159 int preference;
jbe@355 160 if (i<tuple_count) {
jbe@355 161 member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@355 162 suggestion_id = PQgetvalue(res, i, COL_SUGGESTION_ID);
jbe@355 163 preference = (int)strtol(PQgetvalue(res, i, COL_PREFERENCE), (char **)NULL, 10);
jbe@355 164 if (preference < 1 || preference > 4) {
jbe@355 165 fprintf(stderr, "Unexpected preference value\n");
jbe@355 166 abort();
jbe@355 167 }
jbe@355 168 preference--;
jbe@355 169 ballot->sections[preference].candidates[candidates_in_sections[preference]++] = candidate_by_key(suggestion_id);
jbe@355 170 }
jbe@355 171 if (i==tuple_count || (old_member_id && strcmp(old_member_id, member_id))) {
jbe@355 172 ballot++;
jbe@355 173 candidates_in_sections[0] = 0;
jbe@355 174 candidates_in_sections[1] = 0;
jbe@355 175 candidates_in_sections[2] = 0;
jbe@355 176 candidates_in_sections[3] = 0;
jbe@355 177 }
jbe@355 178 old_member_id = member_id;
jbe@352 179 }
jbe@352 180 }
jbe@355 181
jbe@354 182 free(candidates);
jbe@354 183 for (i=0; i<ballot_count; i++) {
jbe@354 184 int j;
jbe@354 185 for (j=0; j<4; j++) {
jbe@354 186 if (ballots[i].sections[j].count) {
jbe@354 187 free(ballots[i].sections[j].candidates);
jbe@354 188 }
jbe@354 189 }
jbe@354 190 }
jbe@354 191 free(ballots);
jbe@352 192 }
jbe@352 193
jbe@352 194 int main(int argc, char **argv) {
jbe@352 195
jbe@352 196 // variable declarations:
jbe@352 197 int err = 0;
jbe@352 198 int i, count;
jbe@352 199 char *conninfo;
jbe@352 200 PGconn *db;
jbe@352 201 PGresult *res;
jbe@352 202
jbe@352 203 // parse command line:
jbe@352 204 if (argc == 0) return 1;
jbe@352 205 if (argc == 1 || !strcmp(argv[1], "-h") || !strcmp(argv[1], "--help")) {
jbe@352 206 FILE *out;
jbe@352 207 out = argc == 1 ? stderr : stdout;
jbe@352 208 fprintf(stdout, "\n");
jbe@352 209 fprintf(stdout, "Usage: %s <conninfo>\n", argv[0]);
jbe@352 210 fprintf(stdout, "\n");
jbe@352 211 fprintf(stdout, "<conninfo> is specified by PostgreSQL's libpq,\n");
jbe@352 212 fprintf(stdout, "see http://www.postgresql.org/docs/9.1/static/libpq-connect.html\n");
jbe@352 213 fprintf(stdout, "\n");
jbe@352 214 fprintf(stdout, "Example: %s dbname=liquid_feedback\n", argv[0]);
jbe@352 215 fprintf(stdout, "\n");
jbe@352 216 return argc == 1 ? 1 : 0;
jbe@352 217 }
jbe@352 218 {
jbe@352 219 size_t len = 0;
jbe@352 220 for (i=1; i<argc; i++) len += strlen(argv[i]) + 1;
jbe@352 221 conninfo = malloc(len * sizeof(char));
jbe@352 222 if (!conninfo) {
jbe@352 223 fprintf(stderr, "Error: Could not allocate memory for conninfo string\n");
jbe@352 224 return 1;
jbe@352 225 }
jbe@352 226 conninfo[0] = 0;
jbe@352 227 for (i=1; i<argc; i++) {
jbe@352 228 if (i>1) strcat(conninfo, " ");
jbe@352 229 strcat(conninfo, argv[i]);
jbe@352 230 }
jbe@352 231 }
jbe@352 232
jbe@352 233 // connect to database:
jbe@352 234 db = PQconnectdb(conninfo);
jbe@352 235 if (!db) {
jbe@352 236 fprintf(stderr, "Error: Could not create database handle\n");
jbe@352 237 return 1;
jbe@352 238 }
jbe@352 239 if (PQstatus(db) != CONNECTION_OK) {
jbe@352 240 fprintf(stderr, "Could not open connection:\n%s", PQerrorMessage(db));
jbe@352 241 return 1;
jbe@352 242 }
jbe@352 243
jbe@352 244 // check initiatives:
jbe@352 245 res = PQexec(db, "SELECT \"initiative_id\", \"final\" FROM \"initiative_suggestion_order_calculation\"");
jbe@352 246 if (!res) {
jbe@352 247 fprintf(stderr, "Error in pqlib while sending SQL command selecting open issues\n");
jbe@352 248 err = 1;
jbe@352 249 } else if (PQresultStatus(res) != PGRES_TUPLES_OK) {
jbe@352 250 fprintf(stderr, "Error while executing SQL command selecting open issues:\n%s", PQresultErrorMessage(res));
jbe@352 251 err = 1;
jbe@352 252 PQclear(res);
jbe@352 253 } else {
jbe@352 254 count = PQntuples(res);
jbe@352 255 printf("Number of initiatives to process: %i\n", count);
jbe@352 256 for (i=0; i<count; i++) {
jbe@352 257 char *initiative_id, *escaped_initiative_id;
jbe@352 258 char *cmd;
jbe@352 259 PGresult *res2;
jbe@352 260 initiative_id = PQgetvalue(res, i, 0);
jbe@352 261 printf("Processing initiative_id: %s\n", initiative_id);
jbe@352 262 escaped_initiative_id = escapeLiteral(db, initiative_id, strlen(initiative_id));
jbe@352 263 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 264 fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@355 265 abort();
jbe@352 266 }
jbe@352 267 res2 = PQexec(db, cmd);
jbe@352 268 free(cmd);
jbe@352 269 if (!res2) {
jbe@352 270 fprintf(stderr, "Error in pqlib while sending SQL command selecting open issues\n");
jbe@352 271 err = 1;
jbe@352 272 } else if (PQresultStatus(res2) != PGRES_TUPLES_OK) {
jbe@352 273 fprintf(stderr, "Error while executing SQL command selecting open issues:\n%s", PQresultErrorMessage(res));
jbe@352 274 err = 1;
jbe@352 275 PQclear(res2);
jbe@352 276 } else {
jbe@352 277 if (PQntuples(res2) == 0) {
jbe@352 278 printf("Nothing to do.\n");
jbe@352 279 } else {
jbe@352 280 process_initiative(res2);
jbe@352 281 }
jbe@352 282 PQclear(res2);
jbe@352 283 }
jbe@352 284 freemem(escaped_initiative_id);
jbe@352 285 }
jbe@352 286 PQclear(res);
jbe@352 287 }
jbe@352 288
jbe@352 289 // cleanup and exit
jbe@352 290 PQfinish(db);
jbe@352 291 return err;
jbe@352 292
jbe@352 293 }

Impressum / About Us