1 /* This file is part of Pazpar2.
2 Copyright (C) 2006-2009 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;
39 struct reclist_bucket *sorted_list;
40 struct reclist_bucket *sorted_ptr;
41 struct reclist_bucket **last;
45 static struct reclist_sortparms *qsort_sortparms = 0; /* thread pr */
49 struct record_cluster *record;
50 struct reclist_bucket *hnext;
51 struct reclist_bucket *snext;
54 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms,
55 struct conf_service *service)
57 struct reclist_sortparms *res = 0;
58 struct reclist_sortparms **rp = &res;
60 if (strlen(parms) > 256)
70 enum conf_sortkey_type type;
71 struct reclist_sortparms *new;
73 if (!(cpp = strchr(parms, ',')))
74 cpp = parms + strlen(parms);
75 strncpy(parm, parms, cpp - parms);
76 parm[cpp-parms] = '\0';
78 if ((pp = strchr(parm, ':')))
80 increasing = pp[1] == '1' ? 1 : 0;
85 if (!strcmp(parm, "relevance"))
87 type = Metadata_sortkey_relevance;
91 for (i = 0; i < service->num_sortkeys; i++)
93 struct conf_sortkey *sk = &service->sortkeys[i];
94 if (!strcmp(sk->name, parm))
97 if (type == Metadata_sortkey_skiparticle)
98 type = Metadata_sortkey_string;
102 if (i >= service->num_sortkeys)
104 yaz_log(YLOG_FATAL, "Bad sortkey: %s", parm);
110 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
112 new->offset = offset;
114 new->increasing = increasing;
122 static int reclist_cmp(const void *p1, const void *p2)
124 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
125 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
126 struct reclist_sortparms *s;
129 for (s = qsort_sortparms; s && res == 0; s = s->next)
131 union data_types *ut1 = r1->sortkeys[s->offset];
132 union data_types *ut2 = r2->sortkeys[s->offset];
137 case Metadata_sortkey_relevance:
138 res = r2->relevance - r1->relevance;
140 case Metadata_sortkey_string:
141 s1 = ut1 ? ut1->text.sort : "";
142 s2 = ut2 ? ut2->text.sort : "";
143 res = strcmp(s2, s1);
150 case Metadata_sortkey_numeric:
154 res = ut1->number.min - ut2->number.min;
156 res = ut2->number.max - ut1->number.max;
158 else if (ut1 && !ut2)
160 else if (!ut1 && ut2)
166 yaz_log(YLOG_WARN, "Bad sort type: %d", s->type);
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, int numrecs)
226 while (hashsize < numrecs)
228 res = nmem_malloc(nmem, sizeof(struct reclist));
230 = nmem_malloc(nmem, hashsize * sizeof(struct reclist_bucket*));
231 memset(res->hashtable, 0, hashsize * sizeof(struct reclist_bucket*));
232 res->hashtable_size = hashsize;
234 res->hashmask = hashsize - 1; // Creates a bitmask
237 res->sorted_list = 0;
238 res->last = &res->sorted_list;
240 res->num_records = 0;
244 int reclist_get_num_records(struct reclist *l)
247 return l->num_records;
251 // Insert a record. Return record cluster (newly formed or pre-existing)
252 struct record_cluster *reclist_insert( struct reclist *l,
253 struct conf_service *service,
254 struct record *record,
255 char *merge_key, int *total)
258 struct reclist_bucket **p;
259 struct record_cluster *cluster = 0;
267 bucket = jenkins_hash((unsigned char*) merge_key) & l->hashmask;
269 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hnext)
271 // We found a matching record. Merge them
272 if (!strcmp(merge_key, (*p)->record->merge_key))
274 struct record_cluster *existing = (*p)->record;
275 record->next = existing->records;
276 existing->records = record;
283 struct reclist_bucket *new =
284 nmem_malloc(l->nmem, sizeof(*new));
286 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
289 new->record = cluster;
291 cluster->records = record;
292 cluster->merge_key = merge_key;
293 cluster->relevance = 0;
294 cluster->term_frequency_vec = 0;
295 cluster->recid = merge_key;
299 sizeof(struct record_metadata*) * service->num_metadata);
300 memset(cluster->metadata, 0,
301 sizeof(struct record_metadata*) * service->num_metadata);
303 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
304 memset(cluster->sortkeys, 0,
305 sizeof(union data_types*) * service->num_sortkeys);
307 /* attach to hash list */
310 /* append to sorted_list */
312 l->last = &new->snext;
313 l->sorted_ptr = l->sorted_list;
325 * c-file-style: "Stroustrup"
326 * indent-tabs-mode: nil
328 * vim: shiftwidth=4 tabstop=8 expandtab