1 /* This file is part of Pazpar2.
2 Copyright (C) 2006-2010 Index Data
4 Pazpar2 is free software; you can redistribute it and/or modify it under
5 the terms of the GNU General Public License as published by the Free
6 Software Foundation; either version 2, or (at your option) any later
9 Pazpar2 is distributed in the hope that it will be useful, but WITHOUT ANY
10 WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
26 #include <yaz/yaz-util.h>
30 #include "jenkins_hash.h"
34 struct reclist_bucket **hashtable;
38 struct reclist_bucket *sorted_list;
39 struct reclist_bucket *sorted_ptr;
40 struct reclist_bucket **last;
44 static struct reclist_sortparms *qsort_sortparms = 0; /* thread pr */
48 struct record_cluster *record;
49 struct reclist_bucket *hnext;
50 struct reclist_bucket *snext;
53 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
54 struct conf_service *service)
56 struct reclist_sortparms *res = 0;
57 struct reclist_sortparms **rp = &res;
59 if (strlen(parms) > 256)
69 enum conf_sortkey_type type;
70 struct reclist_sortparms *new;
72 if (!(cpp = strchr(parms, ',')))
73 cpp = parms + strlen(parms);
74 strncpy(parm, parms, cpp - parms);
75 parm[cpp-parms] = '\0';
77 if ((pp = strchr(parm, ':')))
79 increasing = pp[1] == '1' ? 1 : 0;
84 if (!strcmp(parm, "relevance"))
86 type = Metadata_sortkey_relevance;
90 for (i = 0; i < service->num_sortkeys; i++)
92 struct conf_sortkey *sk = &service->sortkeys[i];
93 if (!strcmp(sk->name, parm))
96 if (type == Metadata_sortkey_skiparticle)
97 type = Metadata_sortkey_string;
101 if (i >= service->num_sortkeys)
103 yaz_log(YLOG_FATAL, "Bad sortkey: %s", parm);
109 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
111 new->offset = offset;
113 new->increasing = increasing;
121 static int reclist_cmp(const void *p1, const void *p2)
123 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
124 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
125 struct reclist_sortparms *s;
128 for (s = qsort_sortparms; s && res == 0; s = s->next)
130 union data_types *ut1 = r1->sortkeys[s->offset];
131 union data_types *ut2 = r2->sortkeys[s->offset];
135 case Metadata_sortkey_relevance:
136 res = r2->relevance - r1->relevance;
138 case Metadata_sortkey_string:
139 s1 = ut1 ? ut1->text.sort : "";
140 s2 = ut2 ? ut2->text.sort : "";
141 res = strcmp(s2, s1);
148 case Metadata_sortkey_numeric:
152 res = ut1->number.min - ut2->number.min;
154 res = ut2->number.max - ut1->number.max;
156 else if (ut1 && !ut2)
158 else if (!ut1 && ut2)
164 yaz_log(YLOG_WARN, "Bad sort type: %d", s->type);
169 res = strcmp(r1->recid, r2->recid);
173 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
175 struct reclist_bucket **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
176 struct reclist_bucket *ptr = l->sorted_list;
177 struct reclist_bucket **prev = &l->sorted_list;
185 assert(i == l->num_records);
187 qsort_sortparms = parms;
188 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
189 for (i = 0; i < l->num_records; i++)
192 prev = &flatlist[i]->snext;
202 struct record_cluster *reclist_read_record(struct reclist *l)
204 if (l && l->sorted_ptr)
206 struct record_cluster *t = l->sorted_ptr->record;
207 l->sorted_ptr = l->sorted_ptr->snext;
214 void reclist_rewind(struct reclist *l)
217 l->sorted_ptr = l->sorted_list;
220 struct reclist *reclist_create(NMEM nmem)
222 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
223 res->hash_size = 399;
225 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
226 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
230 res->sorted_list = 0;
231 res->last = &res->sorted_list;
233 res->num_records = 0;
237 int reclist_get_num_records(struct reclist *l)
240 return l->num_records;
244 // Insert a record. Return record cluster (newly formed or pre-existing)
245 struct record_cluster *reclist_insert( struct reclist *l,
246 struct conf_service *service,
247 struct record *record,
248 char *merge_key, int *total)
251 struct reclist_bucket **p;
252 struct record_cluster *cluster = 0;
260 bucket = jenkins_hash((unsigned char*) merge_key) % l->hash_size;
262 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hnext)
264 // We found a matching record. Merge them
265 if (!strcmp(merge_key, (*p)->record->merge_key))
267 struct record_cluster *existing = (*p)->record;
268 record->next = existing->records;
269 existing->records = record;
276 struct reclist_bucket *new =
277 nmem_malloc(l->nmem, sizeof(*new));
279 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
282 new->record = cluster;
284 cluster->records = record;
285 cluster->merge_key = merge_key;
286 cluster->relevance = 0;
287 cluster->term_frequency_vec = 0;
288 cluster->recid = merge_key;
292 sizeof(struct record_metadata*) * service->num_metadata);
293 memset(cluster->metadata, 0,
294 sizeof(struct record_metadata*) * service->num_metadata);
296 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
297 memset(cluster->sortkeys, 0,
298 sizeof(union data_types*) * service->num_sortkeys);
300 /* attach to hash list */
303 /* append to sorted_list */
305 l->last = &new->snext;
306 l->sorted_ptr = l->sorted_list;
318 * c-file-style: "Stroustrup"
319 * indent-tabs-mode: nil
321 * vim: shiftwidth=4 tabstop=8 expandtab