1 /* $Id: reclists.c,v 1.14 2007-04-25 09:23:03 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,
129 r1->sortkeys[s->offset]->text);
131 case Metadata_sortkey_numeric:
135 yaz_log(YLOG_FATAL, "Bad sort type: %d", s->type);
148 void reclist_sort(struct reclist *l, struct reclist_sortparms *parms)
151 qsort(l->flatlist, l->num_records,
152 sizeof(struct record_cluster*), reclist_cmp);
156 struct record_cluster *reclist_read_record(struct reclist *l)
158 if (l->pointer < l->num_records)
159 return l->flatlist[l->pointer++];
164 void reclist_rewind(struct reclist *l)
169 // Jenkins one-at-a-time hash (from wikipedia)
170 static unsigned int hash(const unsigned char *key)
172 unsigned int hash = 0;
177 hash += (hash << 10);
181 hash ^= (hash >> 11);
182 hash += (hash << 15);
186 struct reclist *reclist_create(NMEM nmem, int numrecs)
192 while (hashsize < numrecs)
194 res = nmem_malloc(nmem, sizeof(struct reclist));
196 = nmem_malloc(nmem, hashsize * sizeof(struct reclist_bucket*));
197 memset(res->hashtable, 0, hashsize * sizeof(struct reclist_bucket*));
198 res->hashtable_size = hashsize;
200 res->hashmask = hashsize - 1; // Creates a bitmask
202 res->num_records = 0;
203 res->flatlist = nmem_malloc(nmem, numrecs * sizeof(struct record_cluster*));
204 res->flatlist_size = numrecs;
209 // Insert a record. Return record cluster (newly formed or pre-existing)
210 struct record_cluster *reclist_insert( struct reclist *l,
211 struct conf_service *service,
212 struct record *record,
213 const char *merge_key, int *total)
216 struct reclist_bucket **p;
217 struct record_cluster *cluster = 0;
225 bucket = hash((unsigned char*) merge_key) & l->hashmask;
227 for (p = &l->hashtable[bucket]; *p; p = &(*p)->next)
229 // We found a matching record. Merge them
230 if (!strcmp(merge_key, (*p)->record->merge_key))
232 struct record_cluster *existing = (*p)->record;
233 record->next = existing->records;
234 existing->records = record;
239 if (!cluster && l->num_records < l->flatlist_size)
241 struct reclist_bucket *new =
242 nmem_malloc(l->nmem, sizeof(struct reclist_bucket));
243 struct record_cluster *newc =
244 nmem_malloc(l->nmem, sizeof(struct record_cluster));
249 newc->records = record;
250 newc->merge_key = (char *) merge_key;
252 newc->term_frequency_vec = 0;
253 newc->recid = (*total)++;
254 newc->metadata = nmem_malloc(l->nmem,
255 sizeof(struct record_metadata*) * service->num_metadata);
256 memset(newc->metadata, 0,
257 sizeof(struct record_metadata*) * service->num_metadata);
258 newc->sortkeys = nmem_malloc(l->nmem,
259 sizeof(struct record_metadata*) * service->num_sortkeys);
260 memset(newc->sortkeys, 0,
261 sizeof(union data_types*) * service->num_sortkeys);
264 l->flatlist[l->num_records++] = newc;
274 * indent-tabs-mode: nil
276 * vim: shiftwidth=4 tabstop=8 expandtab