X-Git-Url: http://lists.indexdata.com/cgi-bin?a=blobdiff_plain;f=src%2Frelevance.c;h=3eba7cf533d1db10e8556d17479daf87d5e4765d;hb=6576c41731395b1fe85ede4556892c3034960592;hp=708f2bac231275c5d25610fe45cfa9b2f9d7cdb4;hpb=9e586c9793e3f4846f7307ac3a76537dec1aa43d;p=pazpar2-moved-to-github.git diff --git a/src/relevance.c b/src/relevance.c index 708f2ba..3eba7cf 100644 --- a/src/relevance.c +++ b/src/relevance.c @@ -1,5 +1,5 @@ /* This file is part of Pazpar2. - Copyright (C) 2006-2011 Index Data + Copyright (C) 2006-2012 Index Data Pazpar2 is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free @@ -120,8 +120,8 @@ void relevance_countwords(struct relevance *r, struct record_cluster *cluster, cluster->term_frequency_vec[0] += length; } -struct relevance *relevance_create(pp2_charset_fact_t pft, - NMEM nmem, const char **terms) +static struct relevance *relevance_create(pp2_charset_fact_t pft, + NMEM nmem, const char **terms) { struct relevance *res = nmem_malloc(nmem, sizeof(struct relevance)); const char **p; @@ -138,6 +138,47 @@ struct relevance *relevance_create(pp2_charset_fact_t pft, return res; } +// Recursively traverse query structure to extract terms. +static void pull_terms(NMEM nmem, struct ccl_rpn_node *n, + char **termlist, int *num, int max_terms) +{ + char **words; + int numwords; + int i; + + switch (n->kind) + { + case CCL_RPN_AND: + case CCL_RPN_OR: + case CCL_RPN_NOT: + case CCL_RPN_PROX: + pull_terms(nmem, n->u.p[0], termlist, num, max_terms); + pull_terms(nmem, n->u.p[1], termlist, num, max_terms); + break; + case CCL_RPN_TERM: + nmem_strsplit(nmem, " ", n->u.t.term, &words, &numwords); + for (i = 0; i < numwords; i++) + { + if (*num < max_terms) + termlist[(*num)++] = words[i]; + } + break; + default: // NOOP + break; + } +} + +struct relevance *relevance_create_ccl(pp2_charset_fact_t pft, + NMEM nmem, struct ccl_rpn_node *query) +{ + char *termlist[512]; + int num = 0; + + pull_terms(nmem, query, termlist, &num, sizeof(termlist)/sizeof(*termlist)); + termlist[num] = 0; + return relevance_create(pft, nmem, (const char **) termlist); +} + void relevance_destroy(struct relevance **rp) { if (*rp)