1 /* $Id: zsets.c,v 1.107 2006-06-07 10:14:42 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 memset(this_entry.buf[i], '\0', SORT_IDX_ENTRYSIZE);
560 if (criteria[i].ord != -1)
562 sortIdx_type (zh->reg->sortIdx, criteria[i].ord);
563 sortIdx_read (zh->reg->sortIdx, this_entry.buf[i]);
566 i = sort_info->num_entries;
570 for (j = 0; j<num_criteria; j++)
572 if (criteria[j].numerical)
574 double diff = atof(this_entry.buf[j]) -
575 atof(sort_info->entries[i]->buf[j]);
584 rel = memcmp (this_entry.buf[j], sort_info->entries[i]->buf[j],
592 if (criteria[j].relation == 'A')
597 else if (criteria[j].relation == 'D')
604 j = sort_info->max_entries;
608 if (sort_info->num_entries == j)
611 j = (sort_info->num_entries)++;
612 new_entry = sort_info->entries[j];
615 sort_info->entries[j] = sort_info->entries[j-1];
618 sort_info->entries[i] = new_entry;
620 for (i = 0; i<num_criteria; i++)
621 memcpy (new_entry->buf[i], this_entry.buf[i], SORT_IDX_ENTRYSIZE);
622 new_entry->sysno = sysno;
623 new_entry->score = -1;
626 void resultSetInsertRank (ZebraHandle zh, struct zset_sort_info *sort_info,
627 zint sysno, int score, int relation)
629 struct zset_sort_entry *new_entry = NULL;
631 assert(zh); /* compiler shut up about unused arg */
633 i = sort_info->num_entries;
638 rel = score - sort_info->entries[i]->score;
645 else if (relation == 'A')
652 j = sort_info->max_entries;
656 if (sort_info->num_entries == j)
659 j = (sort_info->num_entries)++;
661 new_entry = sort_info->entries[j];
664 sort_info->entries[j] = sort_info->entries[j-1];
667 sort_info->entries[i] = new_entry;
669 new_entry->sysno = sysno;
670 new_entry->score = score;
673 static Z_RPNQuery *copy_RPNQuery(Z_RPNQuery *src, NMEM nmem)
676 ODR encode = odr_createmem(ODR_ENCODE);
677 ODR decode = odr_createmem(ODR_DECODE);
679 if (z_RPNQuery(encode, &src, 0, 0))
682 char *buf = odr_getbuf(encode, &len, 0);
686 odr_setbuf(decode, buf, len, 0);
687 z_RPNQuery(decode, &dst, 0, 0);
690 nmem_transfer(nmem, decode->mem);
696 static Z_SortKeySpecList *copy_SortKeySpecList(Z_SortKeySpecList *src, NMEM nmem)
698 Z_SortKeySpecList *dst = 0;
699 ODR encode = odr_createmem(ODR_ENCODE);
700 ODR decode = odr_createmem(ODR_DECODE);
702 if (z_SortKeySpecList(encode, &src, 0, 0))
705 char *buf = odr_getbuf(encode, &len, 0);
709 odr_setbuf(decode, buf, len, 0);
710 z_SortKeySpecList(decode, &dst, 0, 0);
713 nmem_transfer(nmem, decode->mem);
719 ZebraSet resultSetClone(ZebraHandle zh, const char *setname,
725 nset = resultSetAdd(zh, setname, 1);
729 nset->nmem = nmem_create();
731 nset->num_bases = rset->num_bases;
733 nmem_malloc (nset->nmem, nset->num_bases * sizeof(*rset->basenames));
734 for (i = 0; i<rset->num_bases; i++)
735 nset->basenames[i] = nmem_strdup(nset->nmem, rset->basenames[i]);
738 nset->rset = rset_dup(rset->rset);
740 nset->rpn = copy_RPNQuery(rset->rpn, nset->nmem);
744 ZEBRA_RES resultSetSort(ZebraHandle zh, NMEM nmem,
745 int num_input_setnames, const char **input_setnames,
746 const char *output_setname,
747 Z_SortKeySpecList *sort_sequence, int *sort_status)
752 if (num_input_setnames == 0)
754 zebra_setError(zh, YAZ_BIB1_NO_RESULT_SET_NAME_SUPPLIED_ON_SORT, 0);
757 if (num_input_setnames > 1)
759 zebra_setError(zh, YAZ_BIB1_SORT_TOO_MANY_INPUT_RESULTS, 0);
764 yaz_log(log_level_sort, "result set sort input=%s output=%s",
765 *input_setnames, output_setname);
766 sset = resultSetGet (zh, input_setnames[0]);
769 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
773 if (!(rset = sset->rset))
775 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
779 if (strcmp (output_setname, input_setnames[0]))
780 sset = resultSetClone(zh, output_setname, sset);
781 sset->sortSpec = copy_SortKeySpecList(sort_sequence, sset->nmem);
782 return resultSetSortSingle (zh, nmem, sset, rset, sort_sequence,
786 ZEBRA_RES resultSetSortSingle(ZebraHandle zh, NMEM nmem,
787 ZebraSet sset, RSET rset,
788 Z_SortKeySpecList *sort_sequence,
796 struct sortKeyInfo sort_criteria[3];
802 size_t sysno_mem_index = 0;
804 if (zh->m_staticrank)
807 assert(nmem); /* compiler shut up about unused param */
808 sset->sort_info->num_entries = 0;
810 rset_getterms(rset, 0, 0, &n);
811 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
812 rset_getterms(rset, terms, n, &numTerms);
815 num_criteria = sort_sequence->num_specs;
816 if (num_criteria > 3)
818 for (i = 0; i < num_criteria; i++)
820 Z_SortKeySpec *sks = sort_sequence->specs[i];
824 sort_criteria[i].ord = -1;
825 sort_criteria[i].numerical = 0;
827 if (sks->which == Z_SortKeySpec_missingValueData)
829 zebra_setError(zh, YAZ_BIB1_UNSUPP_MISSING_DATA_ACTION, 0);
832 if (*sks->sortRelation == Z_SortKeySpec_ascending)
833 sort_criteria[i].relation = 'A';
834 else if (*sks->sortRelation == Z_SortKeySpec_descending)
835 sort_criteria[i].relation = 'D';
838 zebra_setError(zh, YAZ_BIB1_ILLEGAL_SORT_RELATION, 0);
841 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
843 zebra_setError(zh, YAZ_BIB1_DATABASE_SPECIFIC_SORT_UNSUPP, 0);
846 else if (sks->sortElement->which != Z_SortElement_generic)
848 zebra_setError(zh, YAZ_BIB1_SORT_ILLEGAL_SORT, 0);
851 sk = sks->sortElement->u.generic;
854 case Z_SortKey_sortField:
855 yaz_log(log_level_sort, "key %d is of type sortField",
857 sort_criteria[i].numerical = 0;
858 sort_criteria[i].ord =
859 zebraExplain_lookup_attr_str(zh->reg->zei, 's',
861 if (sks->which != Z_SortKeySpec_null
862 && sort_criteria[i].ord == -1)
865 YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
869 case Z_SortKey_elementSpec:
870 yaz_log(log_level_sort, "key %d is of type elementSpec",
872 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
874 case Z_SortKey_sortAttributes:
875 yaz_log(log_level_sort, "key %d is of type sortAttributes", i+1);
876 res = zebra_sort_get_ord(zh, sk->u.sortAttributes,
877 &sort_criteria[i].ord,
878 &sort_criteria[i].numerical);
879 if (sks->which != Z_SortKeySpec_null && res != ZEBRA_OK)
884 rfd = rset_open (rset, RSETF_READ);
885 while (rset_read (rfd, &key, &termid))
887 zint this_sys = key.mem[sysno_mem_index];
888 if (log_level_searchhits)
889 key_logdump_txt(log_level_searchhits, &key, termid->name);
891 if (this_sys != psysno)
895 resultSetInsertSort (zh, sset,
896 sort_criteria, num_criteria, psysno);
900 yaz_log(log_level_sort, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
902 for (i = 0; i < numTerms; i++)
903 yaz_log(log_level_sort, "term=\"%s\" type=%s count=" ZINT_FORMAT,
904 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
905 *sort_status = Z_SortResponse_success;
909 RSET resultSetRef(ZebraHandle zh, const char *resultSetId)
913 if ((s = resultSetGet (zh, resultSetId)))
918 ZEBRA_RES resultSetRank(ZebraHandle zh, ZebraSet zebraSet,
919 RSET rset, NMEM nmem)
928 ZebraRankClass rank_class;
929 struct zset_sort_info *sort_info;
930 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
931 size_t sysno_mem_index = 0;
933 if (zh->m_staticrank)
938 sort_info = zebraSet->sort_info;
939 sort_info->num_entries = 0;
941 rset_getterms(rset, 0, 0, &n);
942 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
943 rset_getterms(rset, terms, n, &numTerms);
946 rank_class = zebraRankLookup(zh, rank_handler_name);
949 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
950 zebra_setError(zh, YAZ_BIB1_UNSUPP_SEARCH, "Cannot find rank handler");
955 RSFD rfd = rset_open(rset, RSETF_READ);
956 struct rank_control *rc = rank_class->control;
961 (*rc->begin) (zh->reg, rank_class->class_handle, rset, nmem,
963 zint psysno = 0; /* previous doc id / sys no */
964 zint pstaticrank = 0; /* previous static rank */
966 while (rset_read(rfd, &key, &termid))
968 zint this_sys = key.mem[sysno_mem_index];
970 zint seqno = key.mem[key.len-1];
972 if (log_level_searchhits)
973 key_logdump_txt(log_level_searchhits, &key, termid->name);
974 if (this_sys != psysno)
975 { /* new record .. */
976 if (rfd->counted_items > rset->hits_limit)
979 { /* only if we did have a previous record */
980 score = (*rc->calc) (handle, psysno, pstaticrank,
982 /* insert the hit. A=Ascending */
983 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
989 if (zh->m_staticrank)
990 pstaticrank = key.mem[0];
992 (*rc->add) (handle, CAST_ZINT_TO_INT(seqno), termid);
996 { /* we had - at least - one record */
997 score = (*rc->calc)(handle, psysno, pstaticrank, &stop_flag);
998 /* insert the hit. A=Ascending */
999 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
1002 (*rc->end) (zh->reg, handle);
1005 zebraSet->hits = rset->hits_count;
1007 yaz_log(log_level_searchterms, ZINT_FORMAT " keys, "
1008 ZINT_FORMAT " sysnos, rank", kno, zebraSet->hits);
1009 for (i = 0; i < numTerms; i++)
1011 yaz_log(log_level_searchterms, "term=\"%s\" type=%s count="
1013 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
1018 ZebraRankClass zebraRankLookup(ZebraHandle zh, const char *name)
1020 ZebraRankClass p = zh->reg->rank_classes;
1021 while (p && strcmp (p->control->name, name))
1023 if (p && !p->init_flag)
1025 if (p->control->create)
1026 p->class_handle = (*p->control->create)(zh);
1032 void zebraRankInstall(struct zebra_register *reg, struct rank_control *ctrl)
1034 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
1035 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
1036 memcpy (p->control, ctrl, sizeof(*p->control));
1037 p->control->name = xstrdup (ctrl->name);
1039 p->next = reg->rank_classes;
1040 reg->rank_classes = p;
1043 void zebraRankDestroy(struct zebra_register *reg)
1045 ZebraRankClass p = reg->rank_classes;
1048 ZebraRankClass p_next = p->next;
1049 if (p->init_flag && p->control->destroy)
1050 (*p->control->destroy)(reg, p->class_handle);
1051 xfree(p->control->name);
1056 reg->rank_classes = NULL;
1059 static int trav_rset_for_termids(RSET rset, TERMID *termid_array,
1060 zint *hits_array, int *approx_array)
1064 for (i = 0; i<rset->no_children; i++)
1065 no += trav_rset_for_termids(rset->children[i],
1066 (termid_array ? termid_array + no : 0),
1067 (hits_array ? hits_array + no : 0),
1068 (approx_array ? approx_array + no : 0));
1072 termid_array[no] = rset->term;
1074 hits_array[no] = rset->hits_count;
1076 approx_array[no] = rset->hits_approx;
1078 yaz_log(YLOG_LOG, "rset=%p term=%s limit=" ZINT_FORMAT
1079 " count=" ZINT_FORMAT,
1080 rset, rset->term->name, rset->hits_limit, rset->hits_count);
1087 ZEBRA_RES zebra_result_set_term_no(ZebraHandle zh, const char *setname,
1090 ZebraSet sset = resultSetGet(zh, setname);
1094 *num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1100 ZEBRA_RES zebra_result_set_term_info(ZebraHandle zh, const char *setname,
1101 int no, zint *count, int *approx,
1102 char *termbuf, size_t *termlen,
1103 const char **term_ref_id)
1105 ZebraSet sset = resultSetGet(zh, setname);
1108 int num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1109 if (no >= 0 && no < num_terms)
1111 TERMID *term_array = xmalloc(num_terms * sizeof(*term_array));
1112 zint *hits_array = xmalloc(num_terms * sizeof(*hits_array));
1113 int *approx_array = xmalloc(num_terms * sizeof(*approx_array));
1115 trav_rset_for_termids(sset->rset, term_array,
1116 hits_array, approx_array);
1119 *count = hits_array[no];
1121 *approx = approx_array[no];
1124 char *inbuf = term_array[no]->name;
1125 size_t inleft = strlen(inbuf);
1126 size_t outleft = *termlen - 1;
1128 if (zh->iconv_from_utf8 != 0)
1130 char *outbuf = termbuf;
1133 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
1135 if (ret == (size_t)(-1))
1138 *termlen = outbuf - termbuf;
1142 if (inleft > outleft)
1145 memcpy(termbuf, inbuf, *termlen);
1147 termbuf[*termlen] = '\0';
1150 *term_ref_id = term_array[no]->ref_id;
1154 xfree(approx_array);
1161 ZEBRA_RES zebra_snippets_hit_vector(ZebraHandle zh, const char *setname,
1162 zint sysno, zebra_snippets *snippets)
1164 ZebraSet sset = resultSetGet(zh, setname);
1165 yaz_log(YLOG_DEBUG, "zebra_get_hit_vector setname=%s zysno=" ZINT_FORMAT,
1171 struct rset_key_control *kc = zebra_key_control_create(zh);
1172 NMEM nmem = nmem_create();
1174 RSET rsets[2], rset_comb;
1175 RSET rset_temp = rset_create_temp(nmem, kc, kc->scope,
1176 res_get (zh->res, "setTmpDir"),0 );
1179 RSFD rsfd = rset_open(rset_temp, RSETF_WRITE);
1186 rset_write (rsfd, &key);
1189 rsets[0] = rset_temp;
1190 rsets[1] = rset_dup(sset->rset);
1192 rset_comb = rset_create_and(nmem, kc, kc->scope, 2, rsets);
1194 rsfd = rset_open(rset_comb, RSETF_READ);
1196 while (rset_read(rsfd, &key, &termid))
1200 struct ord_list *ol;
1201 for (ol = termid->ol; ol; ol = ol->next)
1203 zebra_snippets_append(snippets, key.mem[key.len-1],
1204 ol->ord, termid->name);
1210 rset_delete(rset_comb);
1220 * indent-tabs-mode: nil
1222 * vim: shiftwidth=4 tabstop=8 expandtab