1 /* $Id: zsets.c,v 1.104 2006-05-19 23:20:24 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 SORT_IDX_ENTRYSIZE 64
38 #define ZSET_SORT_MAX_LEVEL 3
40 struct zebra_set_term_entry {
51 NMEM rset_nmem; /* for creating the rsets in */
56 Z_SortKeySpecList *sortSpec;
57 struct zset_sort_info *sort_info;
58 struct zebra_set_term_entry *term_entries;
60 struct zebra_set *next;
63 zint cache_position; /* last position */
64 RSFD cache_rfd; /* rfd (NULL if not existing) */
65 zint cache_psysno; /* sysno for last position */
66 zint approx_limit; /* limit before we do approx */
69 struct zset_sort_entry {
72 char buf[ZSET_SORT_MAX_LEVEL][SORT_IDX_ENTRYSIZE];
75 struct zset_sort_info {
78 struct zset_sort_entry *all_entries;
79 struct zset_sort_entry **entries;
82 static int log_level_set=0;
83 static int log_level_sort=0;
84 static int log_level_searchhits=0;
85 static int log_level_searchterms=0;
86 static int log_level_resultsets=0;
88 static void loglevels()
92 log_level_sort = yaz_log_module_level("sorting");
93 log_level_searchhits = yaz_log_module_level("searchhits");
94 log_level_searchterms = yaz_log_module_level("searchterms");
95 log_level_resultsets = yaz_log_module_level("resultsets");
99 ZEBRA_RES resultSetSearch(ZebraHandle zh, NMEM nmem, NMEM rset_nmem,
100 Z_RPNQuery *rpn, ZebraSet sset)
104 Z_SortKeySpecList *sort_sequence;
106 ZEBRA_RES res = ZEBRA_OK;
110 sort_sequence = (Z_SortKeySpecList *)
111 nmem_malloc(nmem, sizeof(*sort_sequence));
112 sort_sequence->num_specs = 10; /* FIXME - Hard-coded number */
113 sort_sequence->specs = (Z_SortKeySpec **)
114 nmem_malloc(nmem, sort_sequence->num_specs *
115 sizeof(*sort_sequence->specs));
116 for (i = 0; i<sort_sequence->num_specs; i++)
117 sort_sequence->specs[i] = 0;
119 attrset = oid_getentbyoid (rpn->attributeSetId);
120 res = rpn_search_top(zh, rpn->RPNStructure, attrset->value,
123 sset->num_bases, sset->basenames,
130 for (i = 0; sort_sequence->specs[i]; i++)
132 sort_sequence->num_specs = i;
133 rset->hits_limit = sset->approx_limit;
136 res = resultSetRank (zh, sset, rset, rset_nmem);
140 res = resultSetSortSingle (zh, nmem, sset, rset,
141 sort_sequence, &sort_status);
148 ZEBRA_RES resultSetAddRPN (ZebraHandle zh, NMEM m, Z_RPNQuery *rpn,
149 int num_bases, char **basenames,
158 zebraSet = resultSetAdd(zh, setname, 1);
161 zebraSet->locked = 1;
164 zebraSet->rset_nmem = nmem_create();
166 zebraSet->num_bases = num_bases;
167 zebraSet->basenames =
168 nmem_malloc (zebraSet->nmem, num_bases * sizeof(*zebraSet->basenames));
169 for (i = 0; i<num_bases; i++)
170 zebraSet->basenames[i] = nmem_strdup(zebraSet->nmem, basenames[i]);
172 res = resultSetSearch(zh, zebraSet->nmem, zebraSet->rset_nmem,
174 zh->hits = zebraSet->hits;
177 zebraSet->locked = 0;
183 void resultSetAddTerm(ZebraHandle zh, ZebraSet s, int reg_type,
184 const char *db, const char *index_name,
187 assert(zh); /* compiler shut up */
189 s->nmem = nmem_create ();
190 if (!s->term_entries)
193 s->term_entries_max = 1000;
195 nmem_malloc (s->nmem, s->term_entries_max *
196 sizeof(*s->term_entries));
197 for (i = 0; i < s->term_entries_max; i++)
198 s->term_entries[i].term = 0;
200 if (s->hits < s->term_entries_max)
202 s->term_entries[s->hits].reg_type = reg_type;
203 s->term_entries[s->hits].db = nmem_strdup (s->nmem, db);
204 s->term_entries[s->hits].index_name = nmem_strdup(s->nmem, index_name);
205 s->term_entries[s->hits].term = nmem_strdup(s->nmem, term);
210 ZebraSet resultSetAdd(ZebraHandle zh, const char *name, int ov)
215 for (s = zh->sets; s; s = s->next)
216 if (!strcmp (s->name, name))
223 yaz_log(log_level_resultsets, "updating result set %s", name);
224 if (!ov || s->locked)
229 rset_close(s->cache_rfd);
230 rset_delete (s->rset);
233 nmem_destroy (s->rset_nmem);
235 nmem_destroy (s->nmem);
239 const char *sort_max_str = zebra_get_resource(zh, "sortmax", "1000");
241 yaz_log(log_level_resultsets, "adding result set %s", name);
242 s = (ZebraSet) xmalloc (sizeof(*s));
245 s->name = (char *) xmalloc (strlen(name)+1);
246 strcpy (s->name, name);
248 s->sort_info = (struct zset_sort_info *)
249 xmalloc (sizeof(*s->sort_info));
250 s->sort_info->max_entries = atoi(sort_max_str);
251 if (s->sort_info->max_entries < 2)
252 s->sort_info->max_entries = 2;
254 s->sort_info->entries = (struct zset_sort_entry **)
255 xmalloc (sizeof(*s->sort_info->entries) *
256 s->sort_info->max_entries);
257 s->sort_info->all_entries = (struct zset_sort_entry *)
258 xmalloc (sizeof(*s->sort_info->all_entries) *
259 s->sort_info->max_entries);
260 for (i = 0; i < s->sort_info->max_entries; i++)
261 s->sort_info->entries[i] = s->sort_info->all_entries + i;
271 s->cache_position = 0;
273 s->approx_limit = zh->approx_limit;
277 ZebraSet resultSetGet(ZebraHandle zh, const char *name)
281 for (s = zh->sets; s; s = s->next)
282 if (!strcmp (s->name, name))
284 if (!s->term_entries && !s->rset && s->rpn)
286 NMEM nmem = nmem_create ();
287 yaz_log(log_level_resultsets, "research %s", name);
289 s->rset_nmem=nmem_create();
290 resultSetSearch(zh, nmem, s->rset_nmem, s->rpn, s);
291 if (s->rset && s->sortSpec)
294 yaz_log(log_level_resultsets, "resort %s", name);
295 resultSetSortSingle (zh, nmem, s, s->rset, s->sortSpec,
305 void resultSetInvalidate (ZebraHandle zh)
307 ZebraSet s = zh->sets;
309 yaz_log(log_level_resultsets, "invalidating result sets");
310 for (; s; s = s->next)
315 rset_close(s->cache_rfd);
316 rset_delete (s->rset);
320 s->cache_position = 0;
322 nmem_destroy(s->rset_nmem);
327 void resultSetDestroy(ZebraHandle zh, int num, char **names,int *statuses)
329 ZebraSet * ss = &zh->sets;
333 for (i = 0; i<num; i++)
334 statuses[i] = Z_DeleteStatus_resultSetDidNotExist;
341 for (i = 0; i<num; i++)
342 if (!strcmp (s->name, names[i]))
345 statuses[i] = Z_DeleteStatus_success;
354 xfree (s->sort_info->all_entries);
355 xfree (s->sort_info->entries);
356 xfree (s->sort_info);
359 nmem_destroy (s->nmem);
363 rset_close(s->cache_rfd);
364 rset_delete (s->rset);
367 nmem_destroy(s->rset_nmem);
376 ZebraMetaRecord *zebra_meta_records_create_range(ZebraHandle zh,
381 zint *pos = pos_small;
385 if (num > 10000 || num <= 0)
389 pos = xmalloc(sizeof(*pos) * num);
391 for (i = 0; i<num; i++)
394 mr = zebra_meta_records_create(zh, name, num, pos);
401 ZebraMetaRecord *zebra_meta_records_create(ZebraHandle zh, const char *name,
402 int num, zint *positions)
405 ZebraMetaRecord *sr = 0;
408 struct zset_sort_info *sort_info;
409 size_t sysno_mem_index = 0;
411 if (zh->m_staticrank)
416 if (!(sset = resultSetGet (zh, name)))
418 if (!(rset = sset->rset))
420 if (!sset->term_entries)
422 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
423 for (i = 0; i<num; i++)
430 if (positions[i] <= sset->term_entries_max)
432 sr[i].term = sset->term_entries[positions[i]-1].term;
433 sr[i].db = sset->term_entries[positions[i]-1].db;
439 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
440 for (i = 0; i<num; i++)
447 sort_info = sset->sort_info;
452 for (i = 0; i<num; i++)
454 position = positions[i];
455 if (position > 0 && position <= sort_info->num_entries)
457 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT
458 " (sorted)", position);
459 sr[i].sysno = sort_info->entries[position-1]->sysno;
460 sr[i].score = sort_info->entries[position-1]->score;
464 /* did we really get all entries using sort ? */
465 for (i = 0; i<num; i++)
470 if (i < num) /* nope, get the rest, unsorted - sorry */
479 position = sort_info->num_entries;
480 while (num_i < num && positions[num_i] <= position)
483 if (sset->cache_rfd &&
484 num_i < num && positions[num_i] > sset->cache_position)
486 position = sset->cache_position;
487 rfd = sset->cache_rfd;
488 psysno = sset->cache_psysno;
493 rset_close(sset->cache_rfd);
494 rfd = rset_open (rset, RSETF_READ);
496 while (num_i < num && rset_read (rfd, &key, 0))
498 zint this_sys = key.mem[sysno_mem_index];
499 if (this_sys != psysno)
504 /* determine we alreay have this in our set */
505 for (i = sort_info->num_entries; --i >= 0; )
506 if (psysno == sort_info->entries[i]->sysno)
512 assert (num_i < num);
513 if (position == positions[num_i])
515 sr[num_i].sysno = psysno;
516 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT " (unsorted)", position);
517 sr[num_i].score = -1;
522 sset->cache_position = position;
523 sset->cache_psysno = psysno;
524 sset->cache_rfd = rfd;
530 void zebra_meta_records_destroy (ZebraHandle zh, ZebraMetaRecord *records,
533 assert(zh); /* compiler shut up about unused arg */
547 void resultSetInsertSort (ZebraHandle zh, ZebraSet sset,
548 struct sortKeyInfo *criteria, int num_criteria,
551 struct zset_sort_entry this_entry;
552 struct zset_sort_entry *new_entry = NULL;
553 struct zset_sort_info *sort_info = sset->sort_info;
556 sortIdx_sysno (zh->reg->sortIdx, sysno);
557 for (i = 0; i<num_criteria; i++)
559 sortIdx_type (zh->reg->sortIdx, criteria[i].ord);
560 sortIdx_read (zh->reg->sortIdx, this_entry.buf[i]);
562 i = sort_info->num_entries;
566 for (j = 0; j<num_criteria; j++)
568 if (criteria[j].numerical)
570 double diff = atof(this_entry.buf[j]) -
571 atof(sort_info->entries[i]->buf[j]);
580 rel = memcmp (this_entry.buf[j], sort_info->entries[i]->buf[j],
588 if (criteria[j].relation == 'A')
593 else if (criteria[j].relation == 'D')
600 j = sort_info->max_entries;
604 if (sort_info->num_entries == j)
607 j = (sort_info->num_entries)++;
608 new_entry = sort_info->entries[j];
611 sort_info->entries[j] = sort_info->entries[j-1];
614 sort_info->entries[i] = new_entry;
616 for (i = 0; i<num_criteria; i++)
617 memcpy (new_entry->buf[i], this_entry.buf[i], SORT_IDX_ENTRYSIZE);
618 new_entry->sysno = sysno;
619 new_entry->score = -1;
622 void resultSetInsertRank (ZebraHandle zh, struct zset_sort_info *sort_info,
623 zint sysno, int score, int relation)
625 struct zset_sort_entry *new_entry = NULL;
627 assert(zh); /* compiler shut up about unused arg */
629 i = sort_info->num_entries;
634 rel = score - sort_info->entries[i]->score;
641 else if (relation == 'A')
648 j = sort_info->max_entries;
652 if (sort_info->num_entries == j)
655 j = (sort_info->num_entries)++;
657 new_entry = sort_info->entries[j];
660 sort_info->entries[j] = sort_info->entries[j-1];
663 sort_info->entries[i] = new_entry;
665 new_entry->sysno = sysno;
666 new_entry->score = score;
669 static Z_RPNQuery *copy_RPNQuery(Z_RPNQuery *src, NMEM nmem)
672 ODR encode = odr_createmem(ODR_ENCODE);
673 ODR decode = odr_createmem(ODR_DECODE);
675 if (z_RPNQuery(encode, &src, 0, 0))
678 char *buf = odr_getbuf(encode, &len, 0);
682 odr_setbuf(decode, buf, len, 0);
683 z_RPNQuery(decode, &dst, 0, 0);
686 nmem_transfer(nmem, decode->mem);
692 static Z_SortKeySpecList *copy_SortKeySpecList(Z_SortKeySpecList *src, NMEM nmem)
694 Z_SortKeySpecList *dst = 0;
695 ODR encode = odr_createmem(ODR_ENCODE);
696 ODR decode = odr_createmem(ODR_DECODE);
698 if (z_SortKeySpecList(encode, &src, 0, 0))
701 char *buf = odr_getbuf(encode, &len, 0);
705 odr_setbuf(decode, buf, len, 0);
706 z_SortKeySpecList(decode, &dst, 0, 0);
709 nmem_transfer(nmem, decode->mem);
715 ZebraSet resultSetClone(ZebraHandle zh, const char *setname,
721 nset = resultSetAdd(zh, setname, 1);
725 nset->nmem = nmem_create();
727 nset->num_bases = rset->num_bases;
729 nmem_malloc (nset->nmem, nset->num_bases * sizeof(*rset->basenames));
730 for (i = 0; i<rset->num_bases; i++)
731 nset->basenames[i] = nmem_strdup(nset->nmem, rset->basenames[i]);
734 nset->rset = rset_dup(rset->rset);
736 nset->rpn = copy_RPNQuery(rset->rpn, nset->nmem);
740 ZEBRA_RES resultSetSort(ZebraHandle zh, NMEM nmem,
741 int num_input_setnames, const char **input_setnames,
742 const char *output_setname,
743 Z_SortKeySpecList *sort_sequence, int *sort_status)
748 if (num_input_setnames == 0)
750 zebra_setError(zh, YAZ_BIB1_NO_RESULT_SET_NAME_SUPPLIED_ON_SORT, 0);
753 if (num_input_setnames > 1)
755 zebra_setError(zh, YAZ_BIB1_SORT_TOO_MANY_INPUT_RESULTS, 0);
760 yaz_log(log_level_sort, "result set sort input=%s output=%s",
761 *input_setnames, output_setname);
762 sset = resultSetGet (zh, input_setnames[0]);
765 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
769 if (!(rset = sset->rset))
771 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
775 if (strcmp (output_setname, input_setnames[0]))
776 sset = resultSetClone(zh, output_setname, sset);
777 sset->sortSpec = copy_SortKeySpecList(sort_sequence, sset->nmem);
778 return resultSetSortSingle (zh, nmem, sset, rset, sort_sequence,
782 ZEBRA_RES resultSetSortSingle(ZebraHandle zh, NMEM nmem,
783 ZebraSet sset, RSET rset,
784 Z_SortKeySpecList *sort_sequence,
792 struct sortKeyInfo sort_criteria[3];
798 size_t sysno_mem_index = 0;
800 if (zh->m_staticrank)
803 assert(nmem); /* compiler shut up about unused param */
804 sset->sort_info->num_entries = 0;
806 rset_getterms(rset, 0, 0, &n);
807 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
808 rset_getterms(rset, terms, n, &numTerms);
811 num_criteria = sort_sequence->num_specs;
812 if (num_criteria > 3)
814 for (i = 0; i < num_criteria; i++)
816 Z_SortKeySpec *sks = sort_sequence->specs[i];
819 if (*sks->sortRelation == Z_SortKeySpec_ascending)
820 sort_criteria[i].relation = 'A';
821 else if (*sks->sortRelation == Z_SortKeySpec_descending)
822 sort_criteria[i].relation = 'D';
825 zebra_setError(zh, YAZ_BIB1_ILLEGAL_SORT_RELATION, 0);
828 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
830 zebra_setError(zh, YAZ_BIB1_DATABASE_SPECIFIC_SORT_UNSUPP, 0);
833 else if (sks->sortElement->which != Z_SortElement_generic)
835 zebra_setError(zh, YAZ_BIB1_SORT_ILLEGAL_SORT, 0);
838 sk = sks->sortElement->u.generic;
841 case Z_SortKey_sortField:
842 yaz_log(log_level_sort, "key %d is of type sortField",
844 sort_criteria[i].numerical = 0;
845 sort_criteria[i].ord =
846 zebraExplain_lookup_attr_str(zh->reg->zei, 's',
848 if (sort_criteria[i].ord == -1)
851 YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
855 case Z_SortKey_elementSpec:
856 yaz_log(log_level_sort, "key %d is of type elementSpec",
858 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
860 case Z_SortKey_sortAttributes:
861 yaz_log(log_level_sort, "key %d is of type sortAttributes", i+1);
862 if (zebra_sort_get_ord(zh, sk->u.sortAttributes,
863 &sort_criteria[i].ord,
864 &sort_criteria[i].numerical)
870 rfd = rset_open (rset, RSETF_READ);
871 while (rset_read (rfd, &key, &termid))
873 zint this_sys = key.mem[sysno_mem_index];
874 if (log_level_searchhits)
875 key_logdump_txt(log_level_searchhits, &key, termid->name);
877 if (this_sys != psysno)
881 resultSetInsertSort (zh, sset,
882 sort_criteria, num_criteria, psysno);
886 yaz_log(log_level_sort, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
888 for (i = 0; i < numTerms; i++)
889 yaz_log(log_level_sort, "term=\"%s\" type=%s count=" ZINT_FORMAT,
890 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
891 *sort_status = Z_SortResponse_success;
895 RSET resultSetRef(ZebraHandle zh, const char *resultSetId)
899 if ((s = resultSetGet (zh, resultSetId)))
904 ZEBRA_RES resultSetRank(ZebraHandle zh, ZebraSet zebraSet,
905 RSET rset, NMEM nmem)
914 ZebraRankClass rank_class;
915 struct zset_sort_info *sort_info;
916 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
917 size_t sysno_mem_index = 0;
919 if (zh->m_staticrank)
924 sort_info = zebraSet->sort_info;
925 sort_info->num_entries = 0;
927 rset_getterms(rset, 0, 0, &n);
928 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
929 rset_getterms(rset, terms, n, &numTerms);
932 rank_class = zebraRankLookup(zh, rank_handler_name);
935 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
936 zebra_setError(zh, YAZ_BIB1_UNSUPP_SEARCH, "Cannot find rank handler");
941 RSFD rfd = rset_open(rset, RSETF_READ);
942 struct rank_control *rc = rank_class->control;
947 (*rc->begin) (zh->reg, rank_class->class_handle, rset, nmem,
949 zint psysno = 0; /* previous doc id / sys no */
950 zint pstaticrank = 0; /* previous static rank */
952 while (rset_read(rfd, &key, &termid))
954 zint this_sys = key.mem[sysno_mem_index];
956 zint seqno = key.mem[key.len-1];
958 if (log_level_searchhits)
959 key_logdump_txt(log_level_searchhits, &key, termid->name);
960 if (this_sys != psysno)
961 { /* new record .. */
962 if (rfd->counted_items > rset->hits_limit)
965 { /* only if we did have a previous record */
966 score = (*rc->calc) (handle, psysno, pstaticrank,
968 /* insert the hit. A=Ascending */
969 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
975 if (zh->m_staticrank)
976 pstaticrank = key.mem[0];
978 (*rc->add) (handle, CAST_ZINT_TO_INT(seqno), termid);
982 { /* we had - at least - one record */
983 score = (*rc->calc)(handle, psysno, pstaticrank, &stop_flag);
984 /* insert the hit. A=Ascending */
985 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
988 (*rc->end) (zh->reg, handle);
991 zebraSet->hits = rset->hits_count;
993 yaz_log(log_level_searchterms, ZINT_FORMAT " keys, "
994 ZINT_FORMAT " sysnos, rank", kno, zebraSet->hits);
995 for (i = 0; i < numTerms; i++)
997 yaz_log(log_level_searchterms, "term=\"%s\" type=%s count="
999 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
1004 ZebraRankClass zebraRankLookup(ZebraHandle zh, const char *name)
1006 ZebraRankClass p = zh->reg->rank_classes;
1007 while (p && strcmp (p->control->name, name))
1009 if (p && !p->init_flag)
1011 if (p->control->create)
1012 p->class_handle = (*p->control->create)(zh);
1018 void zebraRankInstall(struct zebra_register *reg, struct rank_control *ctrl)
1020 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
1021 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
1022 memcpy (p->control, ctrl, sizeof(*p->control));
1023 p->control->name = xstrdup (ctrl->name);
1025 p->next = reg->rank_classes;
1026 reg->rank_classes = p;
1029 void zebraRankDestroy(struct zebra_register *reg)
1031 ZebraRankClass p = reg->rank_classes;
1034 ZebraRankClass p_next = p->next;
1035 if (p->init_flag && p->control->destroy)
1036 (*p->control->destroy)(reg, p->class_handle);
1037 xfree(p->control->name);
1042 reg->rank_classes = NULL;
1045 static int trav_rset_for_termids(RSET rset, TERMID *termid_array,
1046 zint *hits_array, int *approx_array)
1050 for (i = 0; i<rset->no_children; i++)
1051 no += trav_rset_for_termids(rset->children[i],
1052 (termid_array ? termid_array + no : 0),
1053 (hits_array ? hits_array + no : 0),
1054 (approx_array ? approx_array + no : 0));
1058 termid_array[no] = rset->term;
1060 hits_array[no] = rset->hits_count;
1062 approx_array[no] = rset->hits_approx;
1064 yaz_log(YLOG_LOG, "rset=%p term=%s limit=" ZINT_FORMAT
1065 " count=" ZINT_FORMAT,
1066 rset, rset->term->name, rset->hits_limit, rset->hits_count);
1073 ZEBRA_RES zebra_result_set_term_no(ZebraHandle zh, const char *setname,
1076 ZebraSet sset = resultSetGet(zh, setname);
1080 *num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1086 ZEBRA_RES zebra_result_set_term_info(ZebraHandle zh, const char *setname,
1087 int no, zint *count, int *approx,
1088 char *termbuf, size_t *termlen,
1089 const char **term_ref_id)
1091 ZebraSet sset = resultSetGet(zh, setname);
1094 int num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1095 if (no >= 0 && no < num_terms)
1097 TERMID *term_array = xmalloc(num_terms * sizeof(*term_array));
1098 zint *hits_array = xmalloc(num_terms * sizeof(*hits_array));
1099 int *approx_array = xmalloc(num_terms * sizeof(*approx_array));
1101 trav_rset_for_termids(sset->rset, term_array,
1102 hits_array, approx_array);
1105 *count = hits_array[no];
1107 *approx = approx_array[no];
1110 char *inbuf = term_array[no]->name;
1111 size_t inleft = strlen(inbuf);
1112 size_t outleft = *termlen - 1;
1114 if (zh->iconv_from_utf8 != 0)
1116 char *outbuf = termbuf;
1119 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
1121 if (ret == (size_t)(-1))
1124 *termlen = outbuf - termbuf;
1128 if (inleft > outleft)
1131 memcpy(termbuf, inbuf, *termlen);
1133 termbuf[*termlen] = '\0';
1136 *term_ref_id = term_array[no]->ref_id;
1140 xfree(approx_array);
1147 ZEBRA_RES zebra_snippets_hit_vector(ZebraHandle zh, const char *setname,
1148 zint sysno, zebra_snippets *snippets)
1150 ZebraSet sset = resultSetGet(zh, setname);
1151 yaz_log(YLOG_DEBUG, "zebra_get_hit_vector setname=%s zysno=" ZINT_FORMAT,
1157 struct rset_key_control *kc = zebra_key_control_create(zh);
1158 NMEM nmem = nmem_create();
1160 RSET rsets[2], rset_comb;
1161 RSET rset_temp = rstemp_create(nmem, kc, kc->scope,
1162 res_get (zh->res, "setTmpDir"),0 );
1165 RSFD rsfd = rset_open(rset_temp, RSETF_WRITE);
1172 rset_write (rsfd, &key);
1175 rsets[0] = rset_temp;
1176 rsets[1] = rset_dup(sset->rset);
1178 rset_comb = rsmulti_and_create(nmem, kc, kc->scope, 2, rsets);
1180 rsfd = rset_open(rset_comb, RSETF_READ);
1182 while (rset_read(rsfd, &key, &termid))
1186 struct ord_list *ol;
1187 for (ol = termid->ol; ol; ol = ol->next)
1189 zebra_snippets_append(snippets, key.mem[key.len-1],
1190 ol->ord, termid->name);
1196 rset_delete(rset_comb);
1206 * indent-tabs-mode: nil
1208 * vim: shiftwidth=4 tabstop=8 expandtab