1 /* $Id: reclists.c,v 1.9 2007-04-16 13:22:17 marc 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 *reclist_parse_sortparms(NMEM nmem, const char *parms)
46 struct reclist_sortparms *res = 0;
47 struct reclist_sortparms **rp = &res;
48 struct conf_service *service = config->servers->service;
50 if (strlen(parms) > 256)
60 enum conf_sortkey_type type;
61 struct reclist_sortparms *new;
63 if (!(cpp = strchr(parms, ',')))
64 cpp = parms + strlen(parms);
65 strncpy(parm, parms, cpp - parms);
66 parm[cpp-parms] = '\0';
68 if ((pp = strchr(parm, ':')))
70 increasing = pp[1] == '1' ? 1 : 0;
75 if (!strcmp(parm, "relevance"))
77 type = Metadata_sortkey_relevance;
82 for (i = 0; i < service->num_sortkeys; i++)
84 struct conf_sortkey *sk = &service->sortkeys[i];
85 if (!strcmp(sk->name, parm))
88 if (type == Metadata_sortkey_skiparticle)
89 type = Metadata_sortkey_string;
93 if (i >= service->num_sortkeys)
95 yaz_log(YLOG_FATAL, "Bad sortkey: %s", parm);
101 new = *rp = nmem_malloc(nmem, sizeof(struct reclist_sortparms));
103 new->offset = offset;
105 new->increasing = increasing;
113 static int reclist_cmp(const void *p1, const void *p2)
115 struct record_cluster *r1 = (*(struct record_cluster**) p1);
116 struct record_cluster *r2 = (*(struct record_cluster**) p2);
117 struct reclist_sortparms *s;
119 for (s = sortparms; s; s = s->next)
124 case Metadata_sortkey_relevance:
125 res = r2->relevance - r1->relevance;
127 case Metadata_sortkey_string:
128 res = strcmp(r2->sortkeys[s->offset]->text, r1->sortkeys[s->offset]->text);
130 case Metadata_sortkey_numeric:
134 yaz_log(YLOG_FATAL, "Bad sort type: %d", s->type);
147 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
150 qsort(l->flatlist, l->num_records, sizeof(struct record_cluster*), reclist_cmp);
154 struct record_cluster *reclist_read_record(struct reclist *l)
156 if (l->pointer < l->num_records)
157 return l->flatlist[l->pointer++];
162 void reclist_rewind(struct reclist *l)
167 // Jenkins one-at-a-time hash (from wikipedia)
168 static unsigned int hash(const unsigned char *key)
170 unsigned int hash = 0;
175 hash += (hash << 10);
179 hash ^= (hash >> 11);
180 hash += (hash << 15);
184 struct reclist *reclist_create(NMEM nmem, int numrecs)
190 while (hashsize < numrecs)
192 res = nmem_malloc(nmem, sizeof(struct reclist));
193 res->hashtable = nmem_malloc(nmem, hashsize * sizeof(struct reclist_bucket*));
194 memset(res->hashtable, 0, hashsize * sizeof(struct reclist_bucket*));
195 res->hashtable_size = hashsize;
197 res->hashmask = hashsize - 1; // Creates a bitmask
199 res->num_records = 0;
200 res->flatlist = nmem_malloc(nmem, numrecs * sizeof(struct record_cluster*));
201 res->flatlist_size = numrecs;
206 // Insert a record. Return record cluster (newly formed or pre-existing)
207 struct record_cluster *reclist_insert( struct conf_service *service,
209 struct record *record,
210 char *merge_key, int *total)
213 struct reclist_bucket **p;
214 struct record_cluster *cluster = 0;
215 /*struct conf_service *service = global_parameters.server->service;*/
217 bucket = hash((unsigned char*) merge_key) & l->hashmask;
218 for (p = &l->hashtable[bucket]; *p; p = &(*p)->next)
220 // We found a matching record. Merge them
221 if (!strcmp(merge_key, (*p)->record->merge_key))
223 struct record_cluster *existing = (*p)->record;
224 record->next = existing->records;
225 existing->records = record;
230 if (!cluster && l->num_records < l->flatlist_size)
232 struct reclist_bucket *new =
233 nmem_malloc(l->nmem, sizeof(struct reclist_bucket));
234 struct record_cluster *newc =
235 nmem_malloc(l->nmem, sizeof(struct record_cluster));
240 newc->records = record;
241 newc->merge_key = merge_key;
243 newc->term_frequency_vec = 0;
244 newc->recid = (*total)++;
245 newc->metadata = nmem_malloc(l->nmem,
246 sizeof(struct record_metadata*) * service->num_metadata);
247 memset(newc->metadata, 0, sizeof(struct record_metadata*) * service->num_metadata);
248 newc->sortkeys = nmem_malloc(l->nmem,
249 sizeof(struct record_metadata*) * service->num_sortkeys);
250 memset(newc->sortkeys, 0, sizeof(union data_types*) * service->num_sortkeys);
253 l->flatlist[l->num_records++] = newc;
263 * indent-tabs-mode: nil
265 * vim: shiftwidth=4 tabstop=8 expandtab