liquid_feedback_core

annotate lf_update_suggestion_order.c @ 352:98c14d8d07f1

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

Impressum / About Us