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;
47 struct record_cluster *record;
48 struct reclist_bucket *hnext;
49 struct reclist_bucket *snext;
50 struct reclist_sortparms *sort_parms;
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 reclist_sortparms *sortparms =
124 (*(struct reclist_bucket **) p1)->sort_parms;
125 struct record_cluster *r1 = (*(struct reclist_bucket**) p1)->record;
126 struct record_cluster *r2 = (*(struct reclist_bucket**) p2)->record;
127 struct reclist_sortparms *s;
130 for (s = sortparms; s && res == 0; s = s->next)
132 union data_types *ut1 = r1->sortkeys[s->offset];
133 union data_types *ut2 = r2->sortkeys[s->offset];
137 case Metadata_sortkey_relevance:
138 res = r2->relevance_score - r1->relevance_score;
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);
171 res = strcmp(r1->recid, r2->recid);
175 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
177 struct reclist_bucket **flatlist = xmalloc(sizeof(*flatlist) * l->num_records);
178 struct reclist_bucket *ptr;
179 struct reclist_bucket **prev;
184 ptr = l->sorted_list;
185 prev = &l->sorted_list;
188 ptr->sort_parms = parms;
193 assert(i == l->num_records);
195 qsort(flatlist, l->num_records, sizeof(*flatlist), reclist_cmp);
196 for (i = 0; i < l->num_records; i++)
199 prev = &flatlist[i]->snext;
209 struct record_cluster *reclist_read_record(struct reclist *l)
211 if (l && l->sorted_ptr)
213 struct record_cluster *t = l->sorted_ptr->record;
214 l->sorted_ptr = l->sorted_ptr->snext;
221 void reclist_enter(struct reclist *l)
223 yaz_mutex_enter(l->mutex);
225 l->sorted_ptr = l->sorted_list;
229 void reclist_leave(struct reclist *l)
231 yaz_mutex_leave(l->mutex);
233 l->sorted_ptr = l->sorted_list;
237 struct reclist *reclist_create(NMEM nmem)
239 struct reclist *res = nmem_malloc(nmem, sizeof(struct reclist));
240 res->hash_size = 399;
242 = nmem_malloc(nmem, res->hash_size * sizeof(struct reclist_bucket*));
243 memset(res->hashtable, 0, res->hash_size * sizeof(struct reclist_bucket*));
247 res->sorted_list = 0;
248 res->last = &res->sorted_list;
250 res->num_records = 0;
252 yaz_mutex_create(&res->mutex);
253 yaz_mutex_set_name(res->mutex, "reclist");
257 void reclist_destroy(struct reclist *l)
260 yaz_mutex_destroy(&l->mutex);
263 int reclist_get_num_records(struct reclist *l)
266 return l->num_records;
270 // Insert a record. Return record cluster (newly formed or pre-existing)
271 struct record_cluster *reclist_insert(struct reclist *l,
272 struct conf_service *service,
273 struct record *record,
274 const char *merge_key, int *total)
277 struct reclist_bucket **p;
278 struct record_cluster *cluster = 0;
286 bucket = jenkins_hash((unsigned char*) merge_key) % l->hash_size;
288 yaz_mutex_enter(l->mutex);
289 for (p = &l->hashtable[bucket]; *p; p = &(*p)->hnext)
291 // We found a matching record. Merge them
292 if (!strcmp(merge_key, (*p)->record->merge_key))
294 struct record_cluster *existing = (*p)->record;
295 record->next = existing->records;
296 existing->records = record;
303 struct reclist_bucket *new =
304 nmem_malloc(l->nmem, sizeof(*new));
306 cluster = nmem_malloc(l->nmem, sizeof(*cluster));
309 new->record = cluster;
311 cluster->records = record;
312 cluster->merge_key = nmem_strdup(l->nmem, merge_key);
313 cluster->relevance_score = 0;
314 cluster->term_frequency_vec = 0;
315 cluster->recid = nmem_strdup(l->nmem, merge_key);
319 sizeof(struct record_metadata*) * service->num_metadata);
320 memset(cluster->metadata, 0,
321 sizeof(struct record_metadata*) * service->num_metadata);
323 nmem_malloc(l->nmem, sizeof(struct record_metadata*) * service->num_sortkeys);
324 memset(cluster->sortkeys, 0,
325 sizeof(union data_types*) * service->num_sortkeys);
327 /* attach to hash list */
330 /* append to sorted_list */
332 l->last = &new->snext;
333 l->sorted_ptr = l->sorted_list;
338 yaz_mutex_leave(l->mutex);
345 * c-file-style: "Stroustrup"
346 * indent-tabs-mode: nil
348 * vim: shiftwidth=4 tabstop=8 expandtab