1 /* $Id: reclists.c,v 1.16 2007-05-01 05:02:54 quinn Exp $
2 Copyright (c) 2006-2007, Index Data.
4 This file is part of Pazpar2.
6 Pazpar2 is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 2, or (at your option) any later
11 Pazpar2 is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with Pazpar2; see the file LICENSE. If not, write to the
18 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
28 #include <yaz/yaz-util.h>
33 extern struct parameters global_parameters;
36 static struct reclist_sortparms *sortparms = 0;
40 struct record_cluster *record;
41 struct reclist_bucket *next;
44 struct reclist_sortparms *
45 reclist_sortparms_insert_field_id(NMEM nmem,
46 struct reclist_sortparms **sortparms,
48 enum conf_sortkey_type type,
51 struct reclist_sortparms * tmp_rlsp = 0;
54 if(!sortparms || field_id < 0)
57 // construct new reclist_sortparms
58 tmp_rlsp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
59 tmp_rlsp->offset = field_id;
60 tmp_rlsp->type = type;
61 tmp_rlsp->increasing = increasing;
64 // insert in *sortparms place, moving *sortparms one down the list
65 tmp_rlsp->next = *sortparms;
66 *sortparms = tmp_rlsp;
72 struct reclist_sortparms *
73 reclist_sortparms_insert(NMEM nmem,
74 struct reclist_sortparms **sortparms,
75 struct conf_service * service,
81 if (!sortparms || !service || !name)
84 field_id = conf_service_sortkey_field_id(service, name);
89 return reclist_sortparms_insert_field_id(nmem, sortparms, field_id,
90 service->sortkeys[field_id].type,
96 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms)
98 struct reclist_sortparms *res = 0;
99 struct reclist_sortparms **rp = &res;
100 struct conf_service *service = config->servers->service;
102 if (strlen(parms) > 256)
112 enum conf_sortkey_type type;
113 struct reclist_sortparms *new;
115 if (!(cpp = strchr(parms, ',')))
116 cpp = parms + strlen(parms);
117 strncpy(parm, parms, cpp - parms);
118 parm[cpp-parms] = '\0';
120 if ((pp = strchr(parm, ':')))
122 increasing = pp[1] == '1' ? 1 : 0;
127 if (!strcmp(parm, "relevance"))
129 type = Metadata_sortkey_relevance;
134 for (i = 0; i < service->num_sortkeys; i++)
136 struct conf_sortkey *sk = &service->sortkeys[i];
137 if (!strcmp(sk->name, parm))
140 if (type == Metadata_sortkey_skiparticle)
141 type = Metadata_sortkey_string;
145 if (i >= service->num_sortkeys)
147 yaz_log(YLOG_FATAL, "Bad sortkey: %s", parm);
153 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
155 new->offset = offset;
157 new->increasing = increasing;
165 static int reclist_cmp(const void *p1, const void *p2)
167 struct record_cluster *r1 = (*(struct record_cluster**) p1);
168 struct record_cluster *r2 = (*(struct record_cluster**) p2);
169 struct reclist_sortparms *s;
171 for (s = sortparms; s; s = s->next)
178 case Metadata_sortkey_relevance:
179 res = r2->relevance - r1->relevance;
181 case Metadata_sortkey_string:
182 s1 = r1->sortkeys[s->offset] ? r1->sortkeys[s->offset]->text : "";
183 s2 = r2->sortkeys[s->offset] ? r2->sortkeys[s->offset]->text : "";
184 res = strcmp(s2, s1);
186 case Metadata_sortkey_numeric:
190 yaz_log(YLOG_FATAL, "Bad sort type: %d", s->type);
203 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
206 qsort(l->flatlist, l->num_records,
207 sizeof(struct record_cluster*), reclist_cmp);
211 struct record_cluster *reclist_read_record(struct reclist *l)
213 if (l->pointer < l->num_records)
214 return l->flatlist[l->pointer++];
219 void reclist_rewind(struct reclist *l)
224 // Jenkins one-at-a-time hash (from wikipedia)
225 static unsigned int hash(const unsigned char *key)
227 unsigned int hash = 0;
232 hash += (hash << 10);
236 hash ^= (hash >> 11);
237 hash += (hash << 15);
241 struct reclist *reclist_create(NMEM nmem, int numrecs)
247 while (hashsize < numrecs)
249 res = nmem_malloc(nmem, sizeof(struct reclist));
251 = nmem_malloc(nmem, hashsize * sizeof(struct reclist_bucket*));
252 memset(res->hashtable, 0, hashsize * sizeof(struct reclist_bucket*));
253 res->hashtable_size = hashsize;
255 res->hashmask = hashsize - 1; // Creates a bitmask
257 res->num_records = 0;
258 res->flatlist = nmem_malloc(nmem, numrecs * sizeof(struct record_cluster*));
259 res->flatlist_size = numrecs;
264 // Insert a record. Return record cluster (newly formed or pre-existing)
265 struct record_cluster *reclist_insert( struct reclist *l,
266 struct conf_service *service,
267 struct record *record,
268 const char *merge_key, int *total)
271 struct reclist_bucket **p;
272 struct record_cluster *cluster = 0;
280 bucket = hash((unsigned char*) merge_key) & l->hashmask;
282 for (p = &l->hashtable[bucket]; *p; p = &(*p)->next)
284 // We found a matching record. Merge them
285 if (!strcmp(merge_key, (*p)->record->merge_key))
287 struct record_cluster *existing = (*p)->record;
288 record->next = existing->records;
289 existing->records = record;
294 if (!cluster && l->num_records < l->flatlist_size)
296 struct reclist_bucket *new =
297 nmem_malloc(l->nmem, sizeof(struct reclist_bucket));
298 struct record_cluster *newc =
299 nmem_malloc(l->nmem, sizeof(struct record_cluster));
304 newc->records = record;
305 newc->merge_key = (char *) merge_key;
307 newc->term_frequency_vec = 0;
308 newc->recid = (*total)++;
309 newc->metadata = nmem_malloc(l->nmem,
310 sizeof(struct record_metadata*) * service->num_metadata);
311 memset(newc->metadata, 0,
312 sizeof(struct record_metadata*) * service->num_metadata);
313 newc->sortkeys = nmem_malloc(l->nmem,
314 sizeof(struct record_metadata*) * service->num_sortkeys);
315 memset(newc->sortkeys, 0,
316 sizeof(union data_types*) * service->num_sortkeys);
319 l->flatlist[l->num_records++] = newc;
329 * indent-tabs-mode: nil
331 * vim: shiftwidth=4 tabstop=8 expandtab