1 /* $Id: reclists.c,v 1.17 2007-05-11 06:48:32 adam 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;
45 struct reclist_sortparms *
46 reclist_sortparms_insert_field_id(NMEM nmem,
47 struct reclist_sortparms **sortparms,
49 enum conf_sortkey_type type,
52 struct reclist_sortparms * tmp_rlsp = 0;
55 if(!sortparms || field_id < 0)
58 // construct new reclist_sortparms
59 tmp_rlsp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
60 tmp_rlsp->offset = field_id;
61 tmp_rlsp->type = type;
62 tmp_rlsp->increasing = increasing;
65 // insert in *sortparms place, moving *sortparms one down the list
66 tmp_rlsp->next = *sortparms;
67 *sortparms = tmp_rlsp;
74 struct reclist_sortparms *
75 reclist_sortparms_insert(NMEM nmem,
76 struct reclist_sortparms **sortparms,
77 struct conf_service * service,
83 if (!sortparms || !service || !name)
86 field_id = conf_service_sortkey_field_id(service, name);
91 return reclist_sortparms_insert_field_id(nmem, sortparms, field_id,
92 service->sortkeys[field_id].type,
98 struct reclist_sortparms *reclist_parse_sortparms(NMEM nmem, const char *parms)
100 struct reclist_sortparms *res = 0;
101 struct reclist_sortparms **rp = &res;
102 struct conf_service *service = config->servers->service;
104 if (strlen(parms) > 256)
114 enum conf_sortkey_type type;
115 struct reclist_sortparms *new;
117 if (!(cpp = strchr(parms, ',')))
118 cpp = parms + strlen(parms);
119 strncpy(parm, parms, cpp - parms);
120 parm[cpp-parms] = '\0';
122 if ((pp = strchr(parm, ':')))
124 increasing = pp[1] == '1' ? 1 : 0;
129 if (!strcmp(parm, "relevance"))
131 type = Metadata_sortkey_relevance;
136 for (i = 0; i < service->num_sortkeys; i++)
138 struct conf_sortkey *sk = &service->sortkeys[i];
139 if (!strcmp(sk->name, parm))
142 if (type == Metadata_sortkey_skiparticle)
143 type = Metadata_sortkey_string;
147 if (i >= service->num_sortkeys)
149 yaz_log(YLOG_FATAL, "Bad sortkey: %s", parm);
155 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
157 new->offset = offset;
159 new->increasing = increasing;
167 static int reclist_cmp(const void *p1, const void *p2)
169 struct record_cluster *r1 = (*(struct record_cluster**) p1);
170 struct record_cluster *r2 = (*(struct record_cluster**) p2);
171 struct reclist_sortparms *s;
173 for (s = sortparms; s; s = s->next)
180 case Metadata_sortkey_relevance:
181 res = r2->relevance - r1->relevance;
183 case Metadata_sortkey_string:
184 s1 = r1->sortkeys[s->offset] ? r1->sortkeys[s->offset]->text : "";
185 s2 = r2->sortkeys[s->offset] ? r2->sortkeys[s->offset]->text : "";
186 res = strcmp(s2, s1);
188 case Metadata_sortkey_numeric:
192 yaz_log(YLOG_FATAL, "Bad sort type: %d", s->type);
205 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
208 qsort(l->flatlist, l->num_records,
209 sizeof(struct record_cluster*), reclist_cmp);
213 struct record_cluster *reclist_read_record(struct reclist *l)
215 if (l->pointer < l->num_records)
216 return l->flatlist[l->pointer++];
221 void reclist_rewind(struct reclist *l)
226 // Jenkins one-at-a-time hash (from wikipedia)
227 static unsigned int hash(const unsigned char *key)
229 unsigned int hash = 0;
234 hash += (hash << 10);
238 hash ^= (hash >> 11);
239 hash += (hash << 15);
243 struct reclist *reclist_create(NMEM nmem, int numrecs)
249 while (hashsize < numrecs)
251 res = nmem_malloc(nmem, sizeof(struct reclist));
253 = nmem_malloc(nmem, hashsize * sizeof(struct reclist_bucket*));
254 memset(res->hashtable, 0, hashsize * sizeof(struct reclist_bucket*));
255 res->hashtable_size = hashsize;
257 res->hashmask = hashsize - 1; // Creates a bitmask
259 res->num_records = 0;
260 res->flatlist = nmem_malloc(nmem, numrecs * sizeof(struct record_cluster*));
261 res->flatlist_size = numrecs;
266 // Insert a record. Return record cluster (newly formed or pre-existing)
267 struct record_cluster *reclist_insert( struct reclist *l,
268 struct conf_service *service,
269 struct record *record,
270 const char *merge_key, int *total)
273 struct reclist_bucket **p;
274 struct record_cluster *cluster = 0;
282 bucket = hash((unsigned char*) merge_key) & l->hashmask;
284 for (p = &l->hashtable[bucket]; *p; p = &(*p)->next)
286 // We found a matching record. Merge them
287 if (!strcmp(merge_key, (*p)->record->merge_key))
289 struct record_cluster *existing = (*p)->record;
290 record->next = existing->records;
291 existing->records = record;
296 if (!cluster && l->num_records < l->flatlist_size)
298 struct reclist_bucket *new =
299 nmem_malloc(l->nmem, sizeof(struct reclist_bucket));
300 struct record_cluster *newc =
301 nmem_malloc(l->nmem, sizeof(struct record_cluster));
306 newc->records = record;
307 newc->merge_key = (char *) merge_key;
309 newc->term_frequency_vec = 0;
310 newc->recid = (*total)++;
311 newc->metadata = nmem_malloc(l->nmem,
312 sizeof(struct record_metadata*) * service->num_metadata);
313 memset(newc->metadata, 0,
314 sizeof(struct record_metadata*) * service->num_metadata);
315 newc->sortkeys = nmem_malloc(l->nmem,
316 sizeof(struct record_metadata*) * service->num_sortkeys);
317 memset(newc->sortkeys, 0,
318 sizeof(union data_types*) * service->num_sortkeys);
321 l->flatlist[l->num_records++] = newc;
331 * indent-tabs-mode: nil
333 * vim: shiftwidth=4 tabstop=8 expandtab