1 /* $Id: zsets.c,v 1.109 2006-08-07 10:14:59 adam Exp $
2 Copyright (C) 1995-2006
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
34 #include <yaz/diagbib1.h>
37 #define ZSET_SORT_MAX_LEVEL 10
39 struct zebra_set_term_entry {
50 NMEM rset_nmem; /* for creating the rsets in */
55 Z_SortKeySpecList *sortSpec;
56 struct zset_sort_info *sort_info;
57 struct zebra_set_term_entry *term_entries;
59 struct zebra_set *next;
62 zint cache_position; /* last position */
63 RSFD cache_rfd; /* rfd (NULL if not existing) */
64 zint cache_psysno; /* sysno for last position */
65 zint approx_limit; /* limit before we do approx */
68 struct zset_sort_entry {
73 struct zset_sort_info {
76 struct zset_sort_entry *all_entries;
77 struct zset_sort_entry **entries;
80 static int log_level_set=0;
81 static int log_level_sort=0;
82 static int log_level_searchhits=0;
83 static int log_level_searchterms=0;
84 static int log_level_resultsets=0;
86 static void loglevels()
90 log_level_sort = yaz_log_module_level("sorting");
91 log_level_searchhits = yaz_log_module_level("searchhits");
92 log_level_searchterms = yaz_log_module_level("searchterms");
93 log_level_resultsets = yaz_log_module_level("resultsets");
97 ZEBRA_RES resultSetSearch(ZebraHandle zh, NMEM nmem, NMEM rset_nmem,
98 Z_RPNQuery *rpn, ZebraSet sset)
102 Z_SortKeySpecList *sort_sequence;
104 ZEBRA_RES res = ZEBRA_OK;
108 sort_sequence = (Z_SortKeySpecList *)
109 nmem_malloc(nmem, sizeof(*sort_sequence));
110 sort_sequence->num_specs = 10; /* FIXME - Hard-coded number */
111 sort_sequence->specs = (Z_SortKeySpec **)
112 nmem_malloc(nmem, sort_sequence->num_specs *
113 sizeof(*sort_sequence->specs));
114 for (i = 0; i<sort_sequence->num_specs; i++)
115 sort_sequence->specs[i] = 0;
117 attrset = oid_getentbyoid (rpn->attributeSetId);
118 res = rpn_search_top(zh, rpn->RPNStructure, attrset->value,
121 sset->num_bases, sset->basenames,
128 for (i = 0; sort_sequence->specs[i]; i++)
130 sort_sequence->num_specs = i;
131 rset->hits_limit = sset->approx_limit;
134 res = resultSetRank (zh, sset, rset, rset_nmem);
138 res = resultSetSortSingle (zh, nmem, sset, rset,
139 sort_sequence, &sort_status);
146 ZEBRA_RES resultSetAddRPN (ZebraHandle zh, NMEM m, Z_RPNQuery *rpn,
147 int num_bases, char **basenames,
156 zebraSet = resultSetAdd(zh, setname, 1);
159 zebraSet->locked = 1;
162 zebraSet->rset_nmem = nmem_create();
164 zebraSet->num_bases = num_bases;
165 zebraSet->basenames =
166 nmem_malloc (zebraSet->nmem, num_bases * sizeof(*zebraSet->basenames));
167 for (i = 0; i<num_bases; i++)
168 zebraSet->basenames[i] = nmem_strdup(zebraSet->nmem, basenames[i]);
170 res = resultSetSearch(zh, zebraSet->nmem, zebraSet->rset_nmem,
172 zh->hits = zebraSet->hits;
175 zebraSet->locked = 0;
181 void resultSetAddTerm(ZebraHandle zh, ZebraSet s, int reg_type,
182 const char *db, const char *index_name,
185 assert(zh); /* compiler shut up */
187 s->nmem = nmem_create ();
188 if (!s->term_entries)
191 s->term_entries_max = 1000;
193 nmem_malloc (s->nmem, s->term_entries_max *
194 sizeof(*s->term_entries));
195 for (i = 0; i < s->term_entries_max; i++)
196 s->term_entries[i].term = 0;
198 if (s->hits < s->term_entries_max)
200 s->term_entries[s->hits].reg_type = reg_type;
201 s->term_entries[s->hits].db = nmem_strdup (s->nmem, db);
202 s->term_entries[s->hits].index_name = nmem_strdup(s->nmem, index_name);
203 s->term_entries[s->hits].term = nmem_strdup(s->nmem, term);
208 ZebraSet resultSetAdd(ZebraHandle zh, const char *name, int ov)
213 for (s = zh->sets; s; s = s->next)
214 if (!strcmp (s->name, name))
221 yaz_log(log_level_resultsets, "updating result set %s", name);
222 if (!ov || s->locked)
227 rset_close(s->cache_rfd);
228 rset_delete (s->rset);
231 nmem_destroy (s->rset_nmem);
233 nmem_destroy (s->nmem);
237 const char *sort_max_str = zebra_get_resource(zh, "sortmax", "1000");
239 yaz_log(log_level_resultsets, "adding result set %s", name);
240 s = (ZebraSet) xmalloc (sizeof(*s));
243 s->name = (char *) xmalloc (strlen(name)+1);
244 strcpy (s->name, name);
246 s->sort_info = (struct zset_sort_info *)
247 xmalloc (sizeof(*s->sort_info));
248 s->sort_info->max_entries = atoi(sort_max_str);
249 if (s->sort_info->max_entries < 2)
250 s->sort_info->max_entries = 2;
252 s->sort_info->entries = (struct zset_sort_entry **)
253 xmalloc (sizeof(*s->sort_info->entries) *
254 s->sort_info->max_entries);
255 s->sort_info->all_entries = (struct zset_sort_entry *)
256 xmalloc (sizeof(*s->sort_info->all_entries) *
257 s->sort_info->max_entries);
258 for (i = 0; i < s->sort_info->max_entries; i++)
259 s->sort_info->entries[i] = s->sort_info->all_entries + i;
269 s->cache_position = 0;
271 s->approx_limit = zh->approx_limit;
275 ZebraSet resultSetGet(ZebraHandle zh, const char *name)
279 for (s = zh->sets; s; s = s->next)
280 if (!strcmp (s->name, name))
282 if (!s->term_entries && !s->rset && s->rpn)
284 NMEM nmem = nmem_create ();
285 yaz_log(log_level_resultsets, "research %s", name);
287 s->rset_nmem=nmem_create();
288 resultSetSearch(zh, nmem, s->rset_nmem, s->rpn, s);
289 if (s->rset && s->sortSpec)
292 yaz_log(log_level_resultsets, "resort %s", name);
293 resultSetSortSingle (zh, nmem, s, s->rset, s->sortSpec,
303 void resultSetInvalidate (ZebraHandle zh)
305 ZebraSet s = zh->sets;
307 yaz_log(log_level_resultsets, "invalidating result sets");
308 for (; s; s = s->next)
313 rset_close(s->cache_rfd);
314 rset_delete (s->rset);
318 s->cache_position = 0;
320 nmem_destroy(s->rset_nmem);
325 void resultSetDestroy(ZebraHandle zh, int num, char **names,int *statuses)
327 ZebraSet * ss = &zh->sets;
331 for (i = 0; i<num; i++)
332 statuses[i] = Z_DeleteStatus_resultSetDidNotExist;
339 for (i = 0; i<num; i++)
340 if (!strcmp (s->name, names[i]))
343 statuses[i] = Z_DeleteStatus_success;
352 xfree (s->sort_info->all_entries);
353 xfree (s->sort_info->entries);
354 xfree (s->sort_info);
357 nmem_destroy (s->nmem);
361 rset_close(s->cache_rfd);
362 rset_delete (s->rset);
365 nmem_destroy(s->rset_nmem);
374 ZebraMetaRecord *zebra_meta_records_create_range(ZebraHandle zh,
379 zint *pos = pos_small;
383 if (num > 10000 || num <= 0)
387 pos = xmalloc(sizeof(*pos) * num);
389 for (i = 0; i<num; i++)
392 mr = zebra_meta_records_create(zh, name, num, pos);
399 ZebraMetaRecord *zebra_meta_records_create(ZebraHandle zh, const char *name,
400 int num, zint *positions)
403 ZebraMetaRecord *sr = 0;
406 struct zset_sort_info *sort_info;
407 size_t sysno_mem_index = 0;
409 if (zh->m_staticrank)
414 if (!(sset = resultSetGet (zh, name)))
416 if (!(rset = sset->rset))
418 if (!sset->term_entries)
420 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
421 for (i = 0; i<num; i++)
428 if (positions[i] <= sset->term_entries_max)
430 sr[i].term = sset->term_entries[positions[i]-1].term;
431 sr[i].db = sset->term_entries[positions[i]-1].db;
437 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
438 for (i = 0; i<num; i++)
445 sort_info = sset->sort_info;
450 for (i = 0; i<num; i++)
452 position = positions[i];
453 if (position > 0 && position <= sort_info->num_entries)
455 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT
456 " (sorted)", position);
457 sr[i].sysno = sort_info->entries[position-1]->sysno;
458 sr[i].score = sort_info->entries[position-1]->score;
462 /* did we really get all entries using sort ? */
463 for (i = 0; i<num; i++)
468 if (i < num) /* nope, get the rest, unsorted - sorry */
477 position = sort_info->num_entries;
478 while (num_i < num && positions[num_i] <= position)
481 if (sset->cache_rfd &&
482 num_i < num && positions[num_i] > sset->cache_position)
484 position = sset->cache_position;
485 rfd = sset->cache_rfd;
486 psysno = sset->cache_psysno;
491 rset_close(sset->cache_rfd);
492 rfd = rset_open (rset, RSETF_READ);
494 while (num_i < num && rset_read (rfd, &key, 0))
496 zint this_sys = key.mem[sysno_mem_index];
497 if (this_sys != psysno)
502 /* determine we alreay have this in our set */
503 for (i = sort_info->num_entries; --i >= 0; )
504 if (psysno == sort_info->entries[i]->sysno)
510 assert (num_i < num);
511 if (position == positions[num_i])
513 sr[num_i].sysno = psysno;
514 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT " (unsorted)", position);
515 sr[num_i].score = -1;
520 sset->cache_position = position;
521 sset->cache_psysno = psysno;
522 sset->cache_rfd = rfd;
528 void zebra_meta_records_destroy (ZebraHandle zh, ZebraMetaRecord *records,
531 assert(zh); /* compiler shut up about unused arg */
545 void resultSetInsertSort(ZebraHandle zh, ZebraSet sset,
546 struct sortKeyInfo *criteria, int num_criteria,
548 char *cmp_buf[], char *tmp_cmp_buf[])
550 struct zset_sort_entry *new_entry = NULL;
551 struct zset_sort_info *sort_info = sset->sort_info;
554 sortIdx_sysno (zh->reg->sortIdx, sysno);
555 for (i = 0; i<num_criteria; i++)
557 char *this_entry_buf = tmp_cmp_buf[i];
558 memset(this_entry_buf, '\0', SORT_IDX_ENTRYSIZE);
559 if (criteria[i].ord != -1)
561 sortIdx_type(zh->reg->sortIdx, criteria[i].ord);
562 sortIdx_read(zh->reg->sortIdx, this_entry_buf);
565 i = sort_info->num_entries;
569 for (j = 0; j<num_criteria; j++)
571 char *this_entry_buf = tmp_cmp_buf[j];
572 char *other_entry_buf =
573 cmp_buf[j] + i * SORT_IDX_ENTRYSIZE;
574 if (criteria[j].numerical)
576 double diff = atof(this_entry_buf) - atof(other_entry_buf);
585 rel = memcmp(this_entry_buf, other_entry_buf,
593 if (criteria[j].relation == 'A')
598 else if (criteria[j].relation == 'D')
605 j = sort_info->max_entries;
609 if (sort_info->num_entries == j)
612 j = (sort_info->num_entries)++;
613 new_entry = sort_info->entries[j];
617 for (k = 0; k<num_criteria; k++)
619 char *j_buf = cmp_buf[k] + j * SORT_IDX_ENTRYSIZE;
620 char *j_1_buf = cmp_buf[k] + (j-1) * SORT_IDX_ENTRYSIZE;
621 memcpy(j_buf, j_1_buf, SORT_IDX_ENTRYSIZE);
623 sort_info->entries[j] = sort_info->entries[j-1];
626 sort_info->entries[i] = new_entry;
628 for (i = 0; i<num_criteria; i++)
630 char *new_entry_buf = cmp_buf[i] + j * SORT_IDX_ENTRYSIZE;
631 char *this_entry_buf = tmp_cmp_buf[i];
632 memcpy(new_entry_buf, this_entry_buf, SORT_IDX_ENTRYSIZE);
634 new_entry->sysno = sysno;
635 new_entry->score = -1;
638 void resultSetInsertRank(ZebraHandle zh, struct zset_sort_info *sort_info,
639 zint sysno, int score, int relation)
641 struct zset_sort_entry *new_entry = NULL;
643 assert(zh); /* compiler shut up about unused arg */
645 i = sort_info->num_entries;
650 rel = score - sort_info->entries[i]->score;
657 else if (relation == 'A')
664 j = sort_info->max_entries;
668 if (sort_info->num_entries == j)
671 j = (sort_info->num_entries)++;
673 new_entry = sort_info->entries[j];
676 sort_info->entries[j] = sort_info->entries[j-1];
679 sort_info->entries[i] = new_entry;
681 new_entry->sysno = sysno;
682 new_entry->score = score;
685 static Z_RPNQuery *copy_RPNQuery(Z_RPNQuery *src, NMEM nmem)
688 ODR encode = odr_createmem(ODR_ENCODE);
689 ODR decode = odr_createmem(ODR_DECODE);
691 if (z_RPNQuery(encode, &src, 0, 0))
694 char *buf = odr_getbuf(encode, &len, 0);
698 odr_setbuf(decode, buf, len, 0);
699 z_RPNQuery(decode, &dst, 0, 0);
702 nmem_transfer(nmem, decode->mem);
708 static Z_SortKeySpecList *copy_SortKeySpecList(Z_SortKeySpecList *src, NMEM nmem)
710 Z_SortKeySpecList *dst = 0;
711 ODR encode = odr_createmem(ODR_ENCODE);
712 ODR decode = odr_createmem(ODR_DECODE);
714 if (z_SortKeySpecList(encode, &src, 0, 0))
717 char *buf = odr_getbuf(encode, &len, 0);
721 odr_setbuf(decode, buf, len, 0);
722 z_SortKeySpecList(decode, &dst, 0, 0);
725 nmem_transfer(nmem, decode->mem);
731 ZebraSet resultSetClone(ZebraHandle zh, const char *setname,
737 nset = resultSetAdd(zh, setname, 1);
741 nset->nmem = nmem_create();
743 nset->num_bases = rset->num_bases;
745 nmem_malloc (nset->nmem, nset->num_bases * sizeof(*rset->basenames));
746 for (i = 0; i<rset->num_bases; i++)
747 nset->basenames[i] = nmem_strdup(nset->nmem, rset->basenames[i]);
750 nset->rset = rset_dup(rset->rset);
752 nset->rpn = copy_RPNQuery(rset->rpn, nset->nmem);
756 ZEBRA_RES resultSetSort(ZebraHandle zh, NMEM nmem,
757 int num_input_setnames, const char **input_setnames,
758 const char *output_setname,
759 Z_SortKeySpecList *sort_sequence, int *sort_status)
764 if (num_input_setnames == 0)
766 zebra_setError(zh, YAZ_BIB1_NO_RESULT_SET_NAME_SUPPLIED_ON_SORT, 0);
769 if (num_input_setnames > 1)
771 zebra_setError(zh, YAZ_BIB1_SORT_TOO_MANY_INPUT_RESULTS, 0);
776 yaz_log(log_level_sort, "result set sort input=%s output=%s",
777 *input_setnames, output_setname);
778 sset = resultSetGet (zh, input_setnames[0]);
781 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
785 if (!(rset = sset->rset))
787 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
791 if (strcmp (output_setname, input_setnames[0]))
792 sset = resultSetClone(zh, output_setname, sset);
793 sset->sortSpec = copy_SortKeySpecList(sort_sequence, sset->nmem);
794 return resultSetSortSingle (zh, nmem, sset, rset, sort_sequence,
798 ZEBRA_RES resultSetSortSingle(ZebraHandle zh, NMEM nmem,
799 ZebraSet sset, RSET rset,
800 Z_SortKeySpecList *sort_sequence,
808 struct sortKeyInfo sort_criteria[ZSET_SORT_MAX_LEVEL];
809 char *cmp_buf[ZSET_SORT_MAX_LEVEL];
810 char *tmp_cmp_buf[ZSET_SORT_MAX_LEVEL];
816 size_t sysno_mem_index = 0;
818 if (zh->m_staticrank)
821 assert(nmem); /* compiler shut up about unused param */
822 sset->sort_info->num_entries = 0;
824 rset_getterms(rset, 0, 0, &n);
825 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
826 rset_getterms(rset, terms, n, &numTerms);
829 num_criteria = sort_sequence->num_specs;
830 if (num_criteria > ZSET_SORT_MAX_LEVEL)
831 num_criteria = ZSET_SORT_MAX_LEVEL;
832 for (i = 0; i < num_criteria; i++)
834 Z_SortKeySpec *sks = sort_sequence->specs[i];
838 sort_criteria[i].ord = -1;
839 sort_criteria[i].numerical = 0;
841 if (sks->which == Z_SortKeySpec_missingValueData)
843 zebra_setError(zh, YAZ_BIB1_UNSUPP_MISSING_DATA_ACTION, 0);
846 if (*sks->sortRelation == Z_SortKeySpec_ascending)
847 sort_criteria[i].relation = 'A';
848 else if (*sks->sortRelation == Z_SortKeySpec_descending)
849 sort_criteria[i].relation = 'D';
852 zebra_setError(zh, YAZ_BIB1_ILLEGAL_SORT_RELATION, 0);
855 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
857 zebra_setError(zh, YAZ_BIB1_DATABASE_SPECIFIC_SORT_UNSUPP, 0);
860 else if (sks->sortElement->which != Z_SortElement_generic)
862 zebra_setError(zh, YAZ_BIB1_SORT_ILLEGAL_SORT, 0);
865 sk = sks->sortElement->u.generic;
868 case Z_SortKey_sortField:
869 yaz_log(log_level_sort, "key %d is of type sortField",
871 sort_criteria[i].numerical = 0;
872 sort_criteria[i].ord =
873 zebraExplain_lookup_attr_str(zh->reg->zei,
874 zinfo_index_category_sort,
877 if (sks->which != Z_SortKeySpec_null
878 && sort_criteria[i].ord == -1)
881 YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
885 case Z_SortKey_elementSpec:
886 yaz_log(log_level_sort, "key %d is of type elementSpec",
888 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
890 case Z_SortKey_sortAttributes:
891 yaz_log(log_level_sort, "key %d is of type sortAttributes", i+1);
892 res = zebra_sort_get_ord(zh, sk->u.sortAttributes,
893 &sort_criteria[i].ord,
894 &sort_criteria[i].numerical);
895 if (sks->which != Z_SortKeySpec_null && res != ZEBRA_OK)
900 /* allocate space for each cmpare buf + one extra for tmp comparison */
901 for (i = 0; i<num_criteria; i++)
903 cmp_buf[i] = xmalloc(sset->sort_info->max_entries
904 * SORT_IDX_ENTRYSIZE);
905 tmp_cmp_buf[i] = xmalloc(SORT_IDX_ENTRYSIZE);
907 rfd = rset_open (rset, RSETF_READ);
908 while (rset_read (rfd, &key, &termid))
910 zint this_sys = key.mem[sysno_mem_index];
911 if (log_level_searchhits)
912 key_logdump_txt(log_level_searchhits, &key, termid->name);
914 if (this_sys != psysno)
918 resultSetInsertSort(zh, sset,
919 sort_criteria, num_criteria, psysno, cmp_buf,
925 for (i = 0; i<num_criteria; i++)
928 xfree(tmp_cmp_buf[i]);
931 yaz_log(log_level_sort, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
933 for (i = 0; i < numTerms; i++)
934 yaz_log(log_level_sort, "term=\"%s\" type=%s count=" ZINT_FORMAT,
935 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
936 *sort_status = Z_SortResponse_success;
940 RSET resultSetRef(ZebraHandle zh, const char *resultSetId)
944 if ((s = resultSetGet (zh, resultSetId)))
949 ZEBRA_RES resultSetRank(ZebraHandle zh, ZebraSet zebraSet,
950 RSET rset, NMEM nmem)
959 ZebraRankClass rank_class;
960 struct zset_sort_info *sort_info;
961 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
962 size_t sysno_mem_index = 0;
964 if (zh->m_staticrank)
969 sort_info = zebraSet->sort_info;
970 sort_info->num_entries = 0;
972 rset_getterms(rset, 0, 0, &n);
973 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
974 rset_getterms(rset, terms, n, &numTerms);
977 rank_class = zebraRankLookup(zh, rank_handler_name);
980 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
981 zebra_setError(zh, YAZ_BIB1_UNSUPP_SEARCH, "Cannot find rank handler");
986 RSFD rfd = rset_open(rset, RSETF_READ);
987 struct rank_control *rc = rank_class->control;
992 (*rc->begin) (zh->reg, rank_class->class_handle, rset, nmem,
994 zint psysno = 0; /* previous doc id / sys no */
995 zint pstaticrank = 0; /* previous static rank */
997 while (rset_read(rfd, &key, &termid))
999 zint this_sys = key.mem[sysno_mem_index];
1001 zint seqno = key.mem[key.len-1];
1003 if (log_level_searchhits)
1004 key_logdump_txt(log_level_searchhits, &key, termid->name);
1005 if (this_sys != psysno)
1006 { /* new record .. */
1007 if (rfd->counted_items > rset->hits_limit)
1010 { /* only if we did have a previous record */
1011 score = (*rc->calc) (handle, psysno, pstaticrank,
1013 /* insert the hit. A=Ascending */
1014 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
1020 if (zh->m_staticrank)
1021 pstaticrank = key.mem[0];
1023 (*rc->add) (handle, CAST_ZINT_TO_INT(seqno), termid);
1027 { /* we had - at least - one record */
1028 score = (*rc->calc)(handle, psysno, pstaticrank, &stop_flag);
1029 /* insert the hit. A=Ascending */
1030 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
1033 (*rc->end) (zh->reg, handle);
1036 zebraSet->hits = rset->hits_count;
1038 yaz_log(log_level_searchterms, ZINT_FORMAT " keys, "
1039 ZINT_FORMAT " sysnos, rank", kno, zebraSet->hits);
1040 for (i = 0; i < numTerms; i++)
1042 yaz_log(log_level_searchterms, "term=\"%s\" type=%s count="
1044 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
1049 ZebraRankClass zebraRankLookup(ZebraHandle zh, const char *name)
1051 ZebraRankClass p = zh->reg->rank_classes;
1052 while (p && strcmp (p->control->name, name))
1054 if (p && !p->init_flag)
1056 if (p->control->create)
1057 p->class_handle = (*p->control->create)(zh);
1063 void zebraRankInstall(struct zebra_register *reg, struct rank_control *ctrl)
1065 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
1066 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
1067 memcpy (p->control, ctrl, sizeof(*p->control));
1068 p->control->name = xstrdup (ctrl->name);
1070 p->next = reg->rank_classes;
1071 reg->rank_classes = p;
1074 void zebraRankDestroy(struct zebra_register *reg)
1076 ZebraRankClass p = reg->rank_classes;
1079 ZebraRankClass p_next = p->next;
1080 if (p->init_flag && p->control->destroy)
1081 (*p->control->destroy)(reg, p->class_handle);
1082 xfree(p->control->name);
1087 reg->rank_classes = NULL;
1090 static int trav_rset_for_termids(RSET rset, TERMID *termid_array,
1091 zint *hits_array, int *approx_array)
1095 for (i = 0; i<rset->no_children; i++)
1096 no += trav_rset_for_termids(rset->children[i],
1097 (termid_array ? termid_array + no : 0),
1098 (hits_array ? hits_array + no : 0),
1099 (approx_array ? approx_array + no : 0));
1103 termid_array[no] = rset->term;
1105 hits_array[no] = rset->hits_count;
1107 approx_array[no] = rset->hits_approx;
1109 yaz_log(YLOG_LOG, "rset=%p term=%s limit=" ZINT_FORMAT
1110 " count=" ZINT_FORMAT,
1111 rset, rset->term->name, rset->hits_limit, rset->hits_count);
1118 ZEBRA_RES zebra_result_set_term_no(ZebraHandle zh, const char *setname,
1121 ZebraSet sset = resultSetGet(zh, setname);
1125 *num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1131 ZEBRA_RES zebra_result_set_term_info(ZebraHandle zh, const char *setname,
1132 int no, zint *count, int *approx,
1133 char *termbuf, size_t *termlen,
1134 const char **term_ref_id)
1136 ZebraSet sset = resultSetGet(zh, setname);
1139 int num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1140 if (no >= 0 && no < num_terms)
1142 TERMID *term_array = xmalloc(num_terms * sizeof(*term_array));
1143 zint *hits_array = xmalloc(num_terms * sizeof(*hits_array));
1144 int *approx_array = xmalloc(num_terms * sizeof(*approx_array));
1146 trav_rset_for_termids(sset->rset, term_array,
1147 hits_array, approx_array);
1150 *count = hits_array[no];
1152 *approx = approx_array[no];
1155 char *inbuf = term_array[no]->name;
1156 size_t inleft = strlen(inbuf);
1157 size_t outleft = *termlen - 1;
1159 if (zh->iconv_from_utf8 != 0)
1161 char *outbuf = termbuf;
1164 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
1166 if (ret == (size_t)(-1))
1169 *termlen = outbuf - termbuf;
1173 if (inleft > outleft)
1176 memcpy(termbuf, inbuf, *termlen);
1178 termbuf[*termlen] = '\0';
1181 *term_ref_id = term_array[no]->ref_id;
1185 xfree(approx_array);
1192 ZEBRA_RES zebra_snippets_hit_vector(ZebraHandle zh, const char *setname,
1193 zint sysno, zebra_snippets *snippets)
1195 ZebraSet sset = resultSetGet(zh, setname);
1196 yaz_log(YLOG_DEBUG, "zebra_get_hit_vector setname=%s zysno=" ZINT_FORMAT,
1202 struct rset_key_control *kc = zebra_key_control_create(zh);
1203 NMEM nmem = nmem_create();
1205 RSET rsets[2], rset_comb;
1206 RSET rset_temp = rset_create_temp(nmem, kc, kc->scope,
1207 res_get (zh->res, "setTmpDir"),0 );
1210 RSFD rsfd = rset_open(rset_temp, RSETF_WRITE);
1217 rset_write (rsfd, &key);
1220 rsets[0] = rset_temp;
1221 rsets[1] = rset_dup(sset->rset);
1223 rset_comb = rset_create_and(nmem, kc, kc->scope, 2, rsets);
1225 rsfd = rset_open(rset_comb, RSETF_READ);
1227 while (rset_read(rsfd, &key, &termid))
1231 struct ord_list *ol;
1232 for (ol = termid->ol; ol; ol = ol->next)
1234 zebra_snippets_append(snippets, key.mem[key.len-1],
1235 ol->ord, termid->name);
1241 rset_delete(rset_comb);
1251 * indent-tabs-mode: nil
1253 * vim: shiftwidth=4 tabstop=8 expandtab