1 /* $Id: zsets.c,v 1.49 2004-06-13 18:45:25 adam Exp $
2 Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
5 This file is part of the Zebra server.
7 Zebra is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with Zebra; see the file LICENSE.zebra. If not, write to the
19 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
35 #define SORT_IDX_ENTRYSIZE 64
36 #define ZSET_SORT_MAX_LEVEL 3
38 struct zebra_set_term_entry {
53 struct zset_sort_info *sort_info;
54 struct zebra_set_term_entry *term_entries;
56 struct zebra_set *next;
60 struct zset_sort_entry {
63 char buf[ZSET_SORT_MAX_LEVEL][SORT_IDX_ENTRYSIZE];
66 struct zset_sort_info {
69 struct zset_sort_entry *all_entries;
70 struct zset_sort_entry **entries;
73 ZebraSet resultSetAddRPN (ZebraHandle zh, NMEM m,
74 Z_RPNQuery *rpn, int num_bases,
85 zebraSet = resultSetAdd (zh, setname, 1);
92 zebraSet->num_bases = num_bases;
94 nmem_malloc (zebraSet->nmem, num_bases * sizeof(*zebraSet->basenames));
95 for (i = 0; i<num_bases; i++)
96 zebraSet->basenames[i] = nmem_strdup (zebraSet->nmem, basenames[i]);
99 zebraSet->rset = rpn_search (zh, zebraSet->nmem, rpn,
101 zebraSet->basenames, zebraSet->name,
103 zh->hits = zebraSet->hits;
106 zebraSet->locked = 0;
110 void resultSetAddTerm (ZebraHandle zh, ZebraSet s, int reg_type,
111 const char *db, int set,
112 int use, const char *term)
115 s->nmem = nmem_create ();
116 if (!s->term_entries)
119 s->term_entries_max = 1000;
121 nmem_malloc (s->nmem, s->term_entries_max *
122 sizeof(*s->term_entries));
123 for (i = 0; i < s->term_entries_max; i++)
124 s->term_entries[i].term = 0;
126 if (s->hits < s->term_entries_max)
128 s->term_entries[s->hits].reg_type = reg_type;
129 s->term_entries[s->hits].db = nmem_strdup (s->nmem, db);
130 s->term_entries[s->hits].set = set;
131 s->term_entries[s->hits].use = use;
132 s->term_entries[s->hits].term = nmem_strdup (s->nmem, term);
138 int zebra_resultSetTerms (ZebraHandle zh, const char *setname,
140 int *type, char *out, size_t *len)
142 ZebraSet s = resultSetGet (zh, setname);
149 no_max = s->rset->no_rset_terms;
150 if (no < 0 || no >= no_max)
153 *count = s->rset->rset_terms[no]->count;
155 *type = s->rset->rset_terms[no]->type;
159 char *inbuf = s->rset->rset_terms[no]->name;
160 size_t inleft = strlen(inbuf);
161 size_t outleft = *len - 1;
164 if (zh->iconv_from_utf8 != 0)
169 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
171 if (ret == (size_t)(-1))
179 if (inleft > outleft)
182 memcpy (out, inbuf, *len);
190 ZebraSet resultSetAdd (ZebraHandle zh, const char *name, int ov)
195 for (s = zh->sets; s; s = s->next)
196 if (!strcmp (s->name, name))
200 yaz_log (LOG_DEBUG, "updating result set %s", name);
201 if (!ov || s->locked)
204 rset_delete (s->rset);
206 nmem_destroy (s->nmem);
210 const char *sort_max_str = zebra_get_resource(zh, "sortmax", "1000");
212 yaz_log (LOG_DEBUG, "adding result set %s", name);
213 s = (ZebraSet) xmalloc (sizeof(*s));
216 s->name = (char *) xmalloc (strlen(name)+1);
217 strcpy (s->name, name);
219 s->sort_info = (struct zset_sort_info *)
220 xmalloc (sizeof(*s->sort_info));
221 s->sort_info->max_entries = atoi(sort_max_str);
222 if (s->sort_info->max_entries < 2)
223 s->sort_info->max_entries = 2;
225 s->sort_info->entries = (struct zset_sort_entry **)
226 xmalloc (sizeof(*s->sort_info->entries) *
227 s->sort_info->max_entries);
228 s->sort_info->all_entries = (struct zset_sort_entry *)
229 xmalloc (sizeof(*s->sort_info->all_entries) *
230 s->sort_info->max_entries);
231 for (i = 0; i < s->sort_info->max_entries; i++)
232 s->sort_info->entries[i] = s->sort_info->all_entries + i;
243 ZebraSet resultSetGet (ZebraHandle zh, const char *name)
247 for (s = zh->sets; s; s = s->next)
248 if (!strcmp (s->name, name))
250 if (!s->term_entries && !s->rset && s->rpn)
252 NMEM nmem = nmem_create ();
253 yaz_log (LOG_LOG, "research %s", name);
255 rpn_search (zh, nmem, s->rpn, s->num_bases,
256 s->basenames, s->name, s);
264 void resultSetInvalidate (ZebraHandle zh)
266 ZebraSet s = zh->sets;
268 for (; s; s = s->next)
271 rset_delete (s->rset);
276 void resultSetDestroy (ZebraHandle zh, int num, char **names,int *statuses)
278 ZebraSet * ss = &zh->sets;
282 for (i = 0; i<num; i++)
283 statuses[i] = Z_DeleteStatus_resultSetDidNotExist;
285 zh->errString = NULL;
292 for (i = 0; i<num; i++)
293 if (!strcmp (s->name, names[i]))
296 statuses[i] = Z_DeleteStatus_success;
305 xfree (s->sort_info->all_entries);
306 xfree (s->sort_info->entries);
307 xfree (s->sort_info);
310 nmem_destroy (s->nmem);
312 rset_delete (s->rset);
321 ZebraPosSet zebraPosSetCreate (ZebraHandle zh, const char *name,
322 int num, int *positions)
328 struct zset_sort_info *sort_info;
330 if (!(sset = resultSetGet (zh, name)))
332 if (!(rset = sset->rset))
334 if (!sset->term_entries)
336 sr = (ZebraPosSet) xmalloc (sizeof(*sr) * num);
337 for (i = 0; i<num; i++)
344 if (positions[i] <= sset->term_entries_max)
346 sr[i].term = sset->term_entries[positions[i]-1].term;
347 sr[i].db = sset->term_entries[positions[i]-1].db;
353 sr = (ZebraPosSet) xmalloc (sizeof(*sr) * num);
354 for (i = 0; i<num; i++)
361 sort_info = sset->sort_info;
366 for (i = 0; i<num; i++)
368 position = positions[i];
369 if (position > 0 && position <= sort_info->num_entries)
371 yaz_log (LOG_DEBUG, "got pos=%d (sorted)", position);
372 sr[i].sysno = sort_info->entries[position-1]->sysno;
373 sr[i].score = sort_info->entries[position-1]->score;
377 /* did we really get all entries using sort ? */
378 for (i = 0; i<num; i++)
383 if (i < num) /* nope, get the rest, unsorted - sorry */
393 position = sort_info->num_entries;
394 while (num_i < num && positions[num_i] < position)
396 rfd = rset_open (rset, RSETF_READ);
397 while (num_i < num && rset_read (rset, rfd, &key, &term_index))
399 if (key.sysno != psysno)
404 /* determine we alreay have this in our set */
405 for (i = sort_info->num_entries; --i >= 0; )
406 if (psysno == sort_info->entries[i]->sysno)
412 assert (num_i < num);
413 if (position == positions[num_i])
415 sr[num_i].sysno = psysno;
416 yaz_log (LOG_DEBUG, "got pos=%d (unsorted)", position);
417 sr[num_i].score = -1;
422 rset_close (rset, rfd);
428 void zebraPosSetDestroy (ZebraHandle zh, ZebraPosSet records, int num)
439 void resultSetInsertSort (ZebraHandle zh, ZebraSet sset,
440 struct sortKeyInfo *criteria, int num_criteria,
443 struct zset_sort_entry this_entry;
444 struct zset_sort_entry *new_entry = NULL;
445 struct zset_sort_info *sort_info = sset->sort_info;
448 sortIdx_sysno (zh->reg->sortIdx, sysno);
449 for (i = 0; i<num_criteria; i++)
451 sortIdx_type (zh->reg->sortIdx, criteria[i].attrUse);
452 sortIdx_read (zh->reg->sortIdx, this_entry.buf[i]);
454 i = sort_info->num_entries;
458 for (j = 0; j<num_criteria; j++)
460 if (criteria[j].numerical)
462 double diff = atof(this_entry.buf[j]) -
463 atof(sort_info->entries[i]->buf[j]);
472 rel = memcmp (this_entry.buf[j], sort_info->entries[i]->buf[j],
480 if (criteria[j].relation == 'A')
485 else if (criteria[j].relation == 'D')
492 j = sort_info->max_entries;
496 if (sort_info->num_entries == j)
499 j = (sort_info->num_entries)++;
500 new_entry = sort_info->entries[j];
503 sort_info->entries[j] = sort_info->entries[j-1];
506 sort_info->entries[i] = new_entry;
508 for (i = 0; i<num_criteria; i++)
509 memcpy (new_entry->buf[i], this_entry.buf[i], SORT_IDX_ENTRYSIZE);
510 new_entry->sysno = sysno;
511 new_entry->score = -1;
514 void resultSetInsertRank (ZebraHandle zh, struct zset_sort_info *sort_info,
515 int sysno, int score, int relation)
517 struct zset_sort_entry *new_entry = NULL;
520 i = sort_info->num_entries;
525 rel = score - sort_info->entries[i]->score;
532 else if (relation == 'A')
539 j = sort_info->max_entries;
543 if (sort_info->num_entries == j)
546 j = (sort_info->num_entries)++;
548 new_entry = sort_info->entries[j];
551 sort_info->entries[j] = sort_info->entries[j-1];
554 sort_info->entries[i] = new_entry;
556 new_entry->sysno = sysno;
557 new_entry->score = score;
560 void resultSetSort (ZebraHandle zh, NMEM nmem,
561 int num_input_setnames, const char **input_setnames,
562 const char *output_setname,
563 Z_SortKeySpecList *sort_sequence, int *sort_status)
568 if (num_input_setnames == 0)
573 if (num_input_setnames > 1)
578 yaz_log (LOG_DEBUG, "result set sort input=%s output=%s",
579 *input_setnames, output_setname);
580 sset = resultSetGet (zh, input_setnames[0]);
584 zh->errString = nmem_strdup (nmem, input_setnames[0]);
587 if (!(rset = sset->rset))
590 zh->errString = nmem_strdup (nmem, input_setnames[0]);
593 if (strcmp (output_setname, input_setnames[0]))
595 rset = rset_dup (rset);
596 sset = resultSetAdd (zh, output_setname, 1);
599 resultSetSortSingle (zh, nmem, sset, rset, sort_sequence, sort_status);
602 void resultSetSortSingle (ZebraHandle zh, NMEM nmem,
603 ZebraSet sset, RSET rset,
604 Z_SortKeySpecList *sort_sequence, int *sort_status)
608 struct sortKeyInfo sort_criteria[3];
613 yaz_log (LOG_LOG, "resultSetSortSingle start");
614 sset->sort_info->num_entries = 0;
617 num_criteria = sort_sequence->num_specs;
618 if (num_criteria > 3)
620 for (i = 0; i < num_criteria; i++)
622 Z_SortKeySpec *sks = sort_sequence->specs[i];
625 if (*sks->sortRelation == Z_SortKeySpec_ascending)
626 sort_criteria[i].relation = 'A';
627 else if (*sks->sortRelation == Z_SortKeySpec_descending)
628 sort_criteria[i].relation = 'D';
634 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
639 else if (sks->sortElement->which != Z_SortElement_generic)
644 sk = sks->sortElement->u.generic;
647 case Z_SortKey_sortField:
648 yaz_log (LOG_DEBUG, "Sort: key %d is of type sortField", i+1);
651 case Z_SortKey_elementSpec:
652 yaz_log (LOG_DEBUG, "Sort: key %d is of type elementSpec", i+1);
655 case Z_SortKey_sortAttributes:
656 yaz_log (LOG_DEBUG, "Sort: key %d is of type sortAttributes", i+1);
657 sort_criteria[i].attrUse =
658 zebra_maps_sort (zh->reg->zebra_maps,
659 sk->u.sortAttributes,
660 &sort_criteria[i].numerical);
661 yaz_log (LOG_DEBUG, "use value = %d", sort_criteria[i].attrUse);
662 if (sort_criteria[i].attrUse == -1)
667 if (sortIdx_type (zh->reg->sortIdx, sort_criteria[i].attrUse))
675 rfd = rset_open (rset, RSETF_READ);
676 while (rset_read (rset, rfd, &key, &term_index))
678 if (key.sysno != psysno)
682 resultSetInsertSort (zh, sset,
683 sort_criteria, num_criteria, psysno);
686 rset_close (rset, rfd);
688 for (i = 0; i < rset->no_rset_terms; i++)
689 yaz_log (LOG_LOG, "term=\"%s\" nn=%d type=%s count=%d",
690 rset->rset_terms[i]->name,
691 rset->rset_terms[i]->nn,
692 rset->rset_terms[i]->flags,
693 rset->rset_terms[i]->count);
695 *sort_status = Z_SortResponse_success;
696 yaz_log (LOG_LOG, "resultSetSortSingle end");
699 RSET resultSetRef (ZebraHandle zh, const char *resultSetId)
703 if ((s = resultSetGet (zh, resultSetId)))
708 void resultSetRank (ZebraHandle zh, ZebraSet zebraSet, RSET rset)
714 ZebraRankClass rank_class;
715 struct rank_control *rc;
716 struct zset_sort_info *sort_info;
717 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
719 sort_info = zebraSet->sort_info;
720 sort_info->num_entries = 0;
722 rfd = rset_open (rset, RSETF_READ);
724 yaz_log (LOG_LOG, "resultSetRank");
726 rank_class = zebraRankLookup (zh, rank_handler_name);
729 yaz_log (LOG_WARN, "No such rank handler: %s", rank_handler_name);
732 rc = rank_class->control;
734 if (rset_read (rset, rfd, &key, &term_index))
736 int psysno = key.sysno;
739 (*rc->begin) (zh->reg, rank_class->class_handle, rset);
744 if (key.sysno != psysno)
746 score = (*rc->calc) (handle, psysno);
748 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
752 (*rc->add) (handle, key.seqno, term_index);
754 while (rset_read (rset, rfd, &key, &term_index));
755 score = (*rc->calc) (handle, psysno);
756 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
757 (*rc->end) (zh->reg, handle);
759 rset_close (rset, rfd);
761 for (i = 0; i < rset->no_rset_terms; i++)
762 yaz_log (LOG_LOG, "term=\"%s\" nn=%d type=%s count=%d",
763 rset->rset_terms[i]->name,
764 rset->rset_terms[i]->nn,
765 rset->rset_terms[i]->flags,
766 rset->rset_terms[i]->count);
768 yaz_log (LOG_LOG, "%d keys, %d distinct sysnos", kno, zebraSet->hits);
771 ZebraRankClass zebraRankLookup (ZebraHandle zh, const char *name)
773 ZebraRankClass p = zh->reg->rank_classes;
774 while (p && strcmp (p->control->name, name))
776 if (p && !p->init_flag)
778 if (p->control->create)
779 p->class_handle = (*p->control->create)(zh);
785 void zebraRankInstall (struct zebra_register *reg, struct rank_control *ctrl)
787 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
788 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
789 memcpy (p->control, ctrl, sizeof(*p->control));
790 p->control->name = xstrdup (ctrl->name);
792 p->next = reg->rank_classes;
793 reg->rank_classes = p;
796 void zebraRankDestroy (struct zebra_register *reg)
798 ZebraRankClass p = reg->rank_classes;
801 ZebraRankClass p_next = p->next;
802 if (p->init_flag && p->control->destroy)
803 (*p->control->destroy)(reg, p->class_handle);
804 xfree (p->control->name);
809 reg->rank_classes = NULL;