1 /* $Id: zsets.c,v 1.111 2006-09-20 10:51:25 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 this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
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 */
542 void resultSetInsertSort(ZebraHandle zh, ZebraSet sset,
543 struct sortKeyInfo *criteria, int num_criteria,
545 char *cmp_buf[], char *tmp_cmp_buf[])
547 struct zset_sort_entry *new_entry = NULL;
548 struct zset_sort_info *sort_info = sset->sort_info;
551 sortIdx_sysno (zh->reg->sortIdx, sysno);
552 for (i = 0; i<num_criteria; i++)
554 char *this_entry_buf = tmp_cmp_buf[i];
555 memset(this_entry_buf, '\0', SORT_IDX_ENTRYSIZE);
556 if (criteria[i].ord != -1)
558 sortIdx_type(zh->reg->sortIdx, criteria[i].ord);
559 sortIdx_read(zh->reg->sortIdx, this_entry_buf);
562 i = sort_info->num_entries;
566 for (j = 0; j<num_criteria; j++)
568 char *this_entry_buf = tmp_cmp_buf[j];
569 char *other_entry_buf =
570 cmp_buf[j] + i * SORT_IDX_ENTRYSIZE;
571 if (criteria[j].numerical)
573 char this_entry_org[1024];
574 char other_entry_org[1024];
576 int index_type = criteria[j].index_type;
577 zebra_term_untrans(zh, index_type, this_entry_org,
579 zebra_term_untrans(zh, index_type, other_entry_org,
581 diff = atof(this_entry_org) - atof(other_entry_org);
592 rel = memcmp(this_entry_buf, other_entry_buf,
600 if (criteria[j].relation == 'A')
605 else if (criteria[j].relation == 'D')
612 j = sort_info->max_entries;
616 if (sort_info->num_entries == j)
619 j = (sort_info->num_entries)++;
620 new_entry = sort_info->entries[j];
624 for (k = 0; k<num_criteria; k++)
626 char *j_buf = cmp_buf[k] + j * SORT_IDX_ENTRYSIZE;
627 char *j_1_buf = cmp_buf[k] + (j-1) * SORT_IDX_ENTRYSIZE;
628 memcpy(j_buf, j_1_buf, SORT_IDX_ENTRYSIZE);
630 sort_info->entries[j] = sort_info->entries[j-1];
633 sort_info->entries[i] = new_entry;
635 for (i = 0; i<num_criteria; i++)
637 char *new_entry_buf = cmp_buf[i] + j * SORT_IDX_ENTRYSIZE;
638 char *this_entry_buf = tmp_cmp_buf[i];
639 memcpy(new_entry_buf, this_entry_buf, SORT_IDX_ENTRYSIZE);
641 new_entry->sysno = sysno;
642 new_entry->score = -1;
645 void resultSetInsertRank(ZebraHandle zh, struct zset_sort_info *sort_info,
646 zint sysno, int score, int relation)
648 struct zset_sort_entry *new_entry = NULL;
650 assert(zh); /* compiler shut up about unused arg */
652 i = sort_info->num_entries;
657 rel = score - sort_info->entries[i]->score;
664 else if (relation == 'A')
671 j = sort_info->max_entries;
675 if (sort_info->num_entries == j)
678 j = (sort_info->num_entries)++;
680 new_entry = sort_info->entries[j];
683 sort_info->entries[j] = sort_info->entries[j-1];
686 sort_info->entries[i] = new_entry;
688 new_entry->sysno = sysno;
689 new_entry->score = score;
692 static Z_RPNQuery *copy_RPNQuery(Z_RPNQuery *src, NMEM nmem)
695 ODR encode = odr_createmem(ODR_ENCODE);
696 ODR decode = odr_createmem(ODR_DECODE);
698 if (z_RPNQuery(encode, &src, 0, 0))
701 char *buf = odr_getbuf(encode, &len, 0);
705 odr_setbuf(decode, buf, len, 0);
706 z_RPNQuery(decode, &dst, 0, 0);
709 nmem_transfer(nmem, decode->mem);
715 static Z_SortKeySpecList *copy_SortKeySpecList(Z_SortKeySpecList *src, NMEM nmem)
717 Z_SortKeySpecList *dst = 0;
718 ODR encode = odr_createmem(ODR_ENCODE);
719 ODR decode = odr_createmem(ODR_DECODE);
721 if (z_SortKeySpecList(encode, &src, 0, 0))
724 char *buf = odr_getbuf(encode, &len, 0);
728 odr_setbuf(decode, buf, len, 0);
729 z_SortKeySpecList(decode, &dst, 0, 0);
732 nmem_transfer(nmem, decode->mem);
738 ZebraSet resultSetClone(ZebraHandle zh, const char *setname,
744 nset = resultSetAdd(zh, setname, 1);
748 nset->nmem = nmem_create();
750 nset->num_bases = rset->num_bases;
752 nmem_malloc (nset->nmem, nset->num_bases * sizeof(*rset->basenames));
753 for (i = 0; i<rset->num_bases; i++)
754 nset->basenames[i] = nmem_strdup(nset->nmem, rset->basenames[i]);
757 nset->rset = rset_dup(rset->rset);
759 nset->rpn = copy_RPNQuery(rset->rpn, nset->nmem);
763 ZEBRA_RES resultSetSort(ZebraHandle zh, NMEM nmem,
764 int num_input_setnames, const char **input_setnames,
765 const char *output_setname,
766 Z_SortKeySpecList *sort_sequence, int *sort_status)
771 if (num_input_setnames == 0)
773 zebra_setError(zh, YAZ_BIB1_NO_RESULT_SET_NAME_SUPPLIED_ON_SORT, 0);
776 if (num_input_setnames > 1)
778 zebra_setError(zh, YAZ_BIB1_SORT_TOO_MANY_INPUT_RESULTS, 0);
783 yaz_log(log_level_sort, "result set sort input=%s output=%s",
784 *input_setnames, output_setname);
785 sset = resultSetGet (zh, input_setnames[0]);
788 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
792 if (!(rset = sset->rset))
794 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
798 if (strcmp (output_setname, input_setnames[0]))
799 sset = resultSetClone(zh, output_setname, sset);
800 sset->sortSpec = copy_SortKeySpecList(sort_sequence, sset->nmem);
801 return resultSetSortSingle (zh, nmem, sset, rset, sort_sequence,
805 ZEBRA_RES resultSetSortSingle(ZebraHandle zh, NMEM nmem,
806 ZebraSet sset, RSET rset,
807 Z_SortKeySpecList *sort_sequence,
815 struct sortKeyInfo sort_criteria[ZSET_SORT_MAX_LEVEL];
816 char *cmp_buf[ZSET_SORT_MAX_LEVEL];
817 char *tmp_cmp_buf[ZSET_SORT_MAX_LEVEL];
823 size_t sysno_mem_index = 0;
825 if (zh->m_staticrank)
828 assert(nmem); /* compiler shut up about unused param */
829 sset->sort_info->num_entries = 0;
831 rset_getterms(rset, 0, 0, &n);
832 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
833 rset_getterms(rset, terms, n, &numTerms);
836 num_criteria = sort_sequence->num_specs;
837 if (num_criteria > ZSET_SORT_MAX_LEVEL)
838 num_criteria = ZSET_SORT_MAX_LEVEL;
839 for (i = 0; i < num_criteria; i++)
841 Z_SortKeySpec *sks = sort_sequence->specs[i];
845 sort_criteria[i].ord = -1;
846 sort_criteria[i].numerical = 0;
848 if (sks->which == Z_SortKeySpec_missingValueData)
850 zebra_setError(zh, YAZ_BIB1_UNSUPP_MISSING_DATA_ACTION, 0);
853 if (*sks->sortRelation == Z_SortKeySpec_ascending)
854 sort_criteria[i].relation = 'A';
855 else if (*sks->sortRelation == Z_SortKeySpec_descending)
856 sort_criteria[i].relation = 'D';
859 zebra_setError(zh, YAZ_BIB1_ILLEGAL_SORT_RELATION, 0);
862 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
864 zebra_setError(zh, YAZ_BIB1_DATABASE_SPECIFIC_SORT_UNSUPP, 0);
867 else if (sks->sortElement->which != Z_SortElement_generic)
869 zebra_setError(zh, YAZ_BIB1_SORT_ILLEGAL_SORT, 0);
872 sk = sks->sortElement->u.generic;
875 case Z_SortKey_sortField:
876 yaz_log(log_level_sort, "key %d is of type sortField",
878 sort_criteria[i].numerical = 0;
879 sort_criteria[i].ord =
880 zebraExplain_lookup_attr_str(zh->reg->zei,
881 zinfo_index_category_sort,
882 -1, sk->u.sortField);
883 if (sks->which != Z_SortKeySpec_null
884 && sort_criteria[i].ord == -1)
887 YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
891 case Z_SortKey_elementSpec:
892 yaz_log(log_level_sort, "key %d is of type elementSpec",
894 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
896 case Z_SortKey_sortAttributes:
897 yaz_log(log_level_sort, "key %d is of type sortAttributes", i+1);
898 res = zebra_sort_get_ord(zh, sk->u.sortAttributes,
900 &sort_criteria[i].ord,
901 &sort_criteria[i].numerical);
902 if (sks->which != Z_SortKeySpec_null && res != ZEBRA_OK)
906 if (zebraExplain_lookup_ord(zh->reg->zei, sort_criteria[i].ord,
907 &sort_criteria[i].index_type,
910 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
914 /* allocate space for each cmpare buf + one extra for tmp comparison */
915 for (i = 0; i<num_criteria; i++)
917 cmp_buf[i] = xmalloc(sset->sort_info->max_entries
918 * SORT_IDX_ENTRYSIZE);
919 tmp_cmp_buf[i] = xmalloc(SORT_IDX_ENTRYSIZE);
921 rfd = rset_open (rset, RSETF_READ);
922 while (rset_read (rfd, &key, &termid))
924 zint this_sys = key.mem[sysno_mem_index];
925 if (log_level_searchhits)
926 key_logdump_txt(log_level_searchhits, &key, termid->name);
928 if (this_sys != psysno)
932 resultSetInsertSort(zh, sset,
933 sort_criteria, num_criteria, psysno, cmp_buf,
939 for (i = 0; i<num_criteria; i++)
942 xfree(tmp_cmp_buf[i]);
945 yaz_log(log_level_sort, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
947 for (i = 0; i < numTerms; i++)
948 yaz_log(log_level_sort, "term=\"%s\" type=%s count=" ZINT_FORMAT,
949 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
950 *sort_status = Z_SortResponse_success;
954 RSET resultSetRef(ZebraHandle zh, const char *resultSetId)
958 if ((s = resultSetGet (zh, resultSetId)))
963 ZEBRA_RES resultSetRank(ZebraHandle zh, ZebraSet zebraSet,
964 RSET rset, NMEM nmem)
973 ZebraRankClass rank_class;
974 struct zset_sort_info *sort_info;
975 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
976 size_t sysno_mem_index = 0;
978 if (zh->m_staticrank)
983 sort_info = zebraSet->sort_info;
984 sort_info->num_entries = 0;
986 rset_getterms(rset, 0, 0, &n);
987 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
988 rset_getterms(rset, terms, n, &numTerms);
991 rank_class = zebraRankLookup(zh, rank_handler_name);
994 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
995 zebra_setError(zh, YAZ_BIB1_UNSUPP_SEARCH, "Cannot find rank handler");
1000 RSFD rfd = rset_open(rset, RSETF_READ);
1001 struct rank_control *rc = rank_class->control;
1006 (*rc->begin) (zh->reg, rank_class->class_handle, rset, nmem,
1008 zint psysno = 0; /* previous doc id / sys no */
1009 zint pstaticrank = 0; /* previous static rank */
1011 while (rset_read(rfd, &key, &termid))
1013 zint this_sys = key.mem[sysno_mem_index];
1015 zint seqno = key.mem[key.len-1];
1017 if (log_level_searchhits)
1018 key_logdump_txt(log_level_searchhits, &key, termid->name);
1019 if (this_sys != psysno)
1020 { /* new record .. */
1021 if (rfd->counted_items > rset->hits_limit)
1024 { /* only if we did have a previous record */
1025 score = (*rc->calc) (handle, psysno, pstaticrank,
1027 /* insert the hit. A=Ascending */
1028 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
1034 if (zh->m_staticrank)
1035 pstaticrank = key.mem[0];
1037 (*rc->add) (handle, CAST_ZINT_TO_INT(seqno), termid);
1041 { /* we had - at least - one record */
1042 score = (*rc->calc)(handle, psysno, pstaticrank, &stop_flag);
1043 /* insert the hit. A=Ascending */
1044 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
1047 (*rc->end) (zh->reg, handle);
1050 zebraSet->hits = rset->hits_count;
1052 yaz_log(log_level_searchterms, ZINT_FORMAT " keys, "
1053 ZINT_FORMAT " sysnos, rank", kno, zebraSet->hits);
1054 for (i = 0; i < numTerms; i++)
1056 yaz_log(log_level_searchterms, "term=\"%s\" type=%s count="
1058 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
1063 ZebraRankClass zebraRankLookup(ZebraHandle zh, const char *name)
1065 ZebraRankClass p = zh->reg->rank_classes;
1066 while (p && strcmp (p->control->name, name))
1068 if (p && !p->init_flag)
1070 if (p->control->create)
1071 p->class_handle = (*p->control->create)(zh);
1077 void zebraRankInstall(struct zebra_register *reg, struct rank_control *ctrl)
1079 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
1080 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
1081 memcpy (p->control, ctrl, sizeof(*p->control));
1082 p->control->name = xstrdup (ctrl->name);
1084 p->next = reg->rank_classes;
1085 reg->rank_classes = p;
1088 void zebraRankDestroy(struct zebra_register *reg)
1090 ZebraRankClass p = reg->rank_classes;
1093 ZebraRankClass p_next = p->next;
1094 if (p->init_flag && p->control->destroy)
1095 (*p->control->destroy)(reg, p->class_handle);
1096 xfree(p->control->name);
1101 reg->rank_classes = NULL;
1104 static int trav_rset_for_termids(RSET rset, TERMID *termid_array,
1105 zint *hits_array, int *approx_array)
1109 for (i = 0; i<rset->no_children; i++)
1110 no += trav_rset_for_termids(rset->children[i],
1111 (termid_array ? termid_array + no : 0),
1112 (hits_array ? hits_array + no : 0),
1113 (approx_array ? approx_array + no : 0));
1117 termid_array[no] = rset->term;
1119 hits_array[no] = rset->hits_count;
1121 approx_array[no] = rset->hits_approx;
1123 yaz_log(YLOG_LOG, "rset=%p term=%s limit=" ZINT_FORMAT
1124 " count=" ZINT_FORMAT,
1125 rset, rset->term->name, rset->hits_limit, rset->hits_count);
1132 ZEBRA_RES zebra_result_set_term_no(ZebraHandle zh, const char *setname,
1135 ZebraSet sset = resultSetGet(zh, setname);
1139 *num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1145 ZEBRA_RES zebra_result_set_term_info(ZebraHandle zh, const char *setname,
1146 int no, zint *count, int *approx,
1147 char *termbuf, size_t *termlen,
1148 const char **term_ref_id)
1150 ZebraSet sset = resultSetGet(zh, setname);
1153 int num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1154 if (no >= 0 && no < num_terms)
1156 TERMID *term_array = xmalloc(num_terms * sizeof(*term_array));
1157 zint *hits_array = xmalloc(num_terms * sizeof(*hits_array));
1158 int *approx_array = xmalloc(num_terms * sizeof(*approx_array));
1160 trav_rset_for_termids(sset->rset, term_array,
1161 hits_array, approx_array);
1164 *count = hits_array[no];
1166 *approx = approx_array[no];
1169 char *inbuf = term_array[no]->name;
1170 size_t inleft = strlen(inbuf);
1171 size_t outleft = *termlen - 1;
1173 if (zh->iconv_from_utf8 != 0)
1175 char *outbuf = termbuf;
1178 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
1180 if (ret == (size_t)(-1))
1183 *termlen = outbuf - termbuf;
1187 if (inleft > outleft)
1190 memcpy(termbuf, inbuf, *termlen);
1192 termbuf[*termlen] = '\0';
1195 *term_ref_id = term_array[no]->ref_id;
1199 xfree(approx_array);
1206 ZEBRA_RES zebra_snippets_hit_vector(ZebraHandle zh, const char *setname,
1207 zint sysno, zebra_snippets *snippets)
1209 ZebraSet sset = resultSetGet(zh, setname);
1210 yaz_log(YLOG_DEBUG, "zebra_get_hit_vector setname=%s zysno=" ZINT_FORMAT,
1216 struct rset_key_control *kc = zebra_key_control_create(zh);
1217 NMEM nmem = nmem_create();
1219 RSET rsets[2], rset_comb;
1220 RSET rset_temp = rset_create_temp(nmem, kc, kc->scope,
1221 res_get (zh->res, "setTmpDir"),0 );
1224 RSFD rsfd = rset_open(rset_temp, RSETF_WRITE);
1231 rset_write (rsfd, &key);
1234 rsets[0] = rset_temp;
1235 rsets[1] = rset_dup(sset->rset);
1237 rset_comb = rset_create_and(nmem, kc, kc->scope, 2, rsets);
1239 rsfd = rset_open(rset_comb, RSETF_READ);
1241 while (rset_read(rsfd, &key, &termid))
1245 struct ord_list *ol;
1246 for (ol = termid->ol; ol; ol = ol->next)
1248 zebra_snippets_append(snippets, key.mem[key.len-1],
1249 ol->ord, termid->name);
1255 rset_delete(rset_comb);
1265 * indent-tabs-mode: nil
1267 * vim: shiftwidth=4 tabstop=8 expandtab