1 /* $Id: zsets.c,v 1.125 2007-11-01 15:59:47 adam Exp $
2 Copyright (C) 1995-2007
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;
61 int estimated_hit_count;
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 {
74 struct zset_sort_info {
77 struct zset_sort_entry *all_entries;
78 struct zset_sort_entry **entries;
81 static int log_level_set=0;
82 static int log_level_sort=0;
83 static int log_level_searchhits=0;
84 static int log_level_searchterms=0;
85 static int log_level_resultsets=0;
87 static void loglevels(void)
91 log_level_sort = yaz_log_module_level("sorting");
92 log_level_searchhits = yaz_log_module_level("searchhits");
93 log_level_searchterms = yaz_log_module_level("searchterms");
94 log_level_resultsets = yaz_log_module_level("resultsets");
99 static ZEBRA_RES resultSetSearch(ZebraHandle zh, NMEM nmem, NMEM rset_nmem,
100 Z_RPNQuery *rpn, ZebraSet sset)
103 Z_SortKeySpecList *sort_sequence;
105 ZEBRA_RES res = ZEBRA_OK;
107 sort_sequence = (Z_SortKeySpecList *)
108 nmem_malloc(nmem, sizeof(*sort_sequence));
109 sort_sequence->num_specs = 10; /* FIXME - Hard-coded number */
110 sort_sequence->specs = (Z_SortKeySpec **)
111 nmem_malloc(nmem, sort_sequence->num_specs *
112 sizeof(*sort_sequence->specs));
113 for (i = 0; i<sort_sequence->num_specs; i++)
114 sort_sequence->specs[i] = 0;
116 rpn_get_top_approx_limit(zh, rpn->RPNStructure, &sset->approx_limit);
118 res = rpn_search_top(zh, rpn->RPNStructure, rpn->attributeSetId,
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,
149 zint *hits, int *estimated_hit_count)
156 *estimated_hit_count = 0;
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 *hits = zebraSet->hits;
175 if (zebraSet->estimated_hit_count)
176 *estimated_hit_count = 1;
180 zebraSet->locked = 0;
186 void resultSetAddTerm(ZebraHandle zh, ZebraSet s, int reg_type,
187 const char *db, const char *index_name,
190 assert(zh); /* compiler shut up */
192 s->nmem = nmem_create();
193 if (!s->term_entries)
196 s->term_entries_max = 1000;
198 nmem_malloc(s->nmem, s->term_entries_max *
199 sizeof(*s->term_entries));
200 for (i = 0; i < s->term_entries_max; i++)
201 s->term_entries[i].term = 0;
203 if (s->hits < s->term_entries_max)
205 s->term_entries[s->hits].reg_type = reg_type;
206 s->term_entries[s->hits].db = nmem_strdup(s->nmem, db);
207 s->term_entries[s->hits].index_name = nmem_strdup(s->nmem, index_name);
208 s->term_entries[s->hits].term = nmem_strdup(s->nmem, term);
213 ZebraSet resultSetAdd(ZebraHandle zh, const char *name, int ov)
218 for (s = zh->sets; s; s = s->next)
219 if (!strcmp(s->name, name))
226 yaz_log(log_level_resultsets, "updating result set %s", name);
227 if (!ov || s->locked)
232 rset_close(s->cache_rfd);
233 rset_delete(s->rset);
236 nmem_destroy(s->rset_nmem);
238 nmem_destroy(s->nmem);
242 const char *sort_max_str = zebra_get_resource(zh, "sortmax", "1000");
244 yaz_log(log_level_resultsets, "adding result set %s", name);
245 s = (ZebraSet) xmalloc(sizeof(*s));
248 s->name = xstrdup(name);
250 s->sort_info = (struct zset_sort_info *)
251 xmalloc(sizeof(*s->sort_info));
252 s->sort_info->max_entries = atoi(sort_max_str);
253 if (s->sort_info->max_entries < 2)
254 s->sort_info->max_entries = 2;
256 s->sort_info->entries = (struct zset_sort_entry **)
257 xmalloc(sizeof(*s->sort_info->entries) *
258 s->sort_info->max_entries);
259 s->sort_info->all_entries = (struct zset_sort_entry *)
260 xmalloc(sizeof(*s->sort_info->all_entries) *
261 s->sort_info->max_entries);
262 for (i = 0; i < s->sort_info->max_entries; i++)
263 s->sort_info->entries[i] = s->sort_info->all_entries + i;
273 s->cache_position = 0;
275 s->approx_limit = zh->approx_limit;
276 s->estimated_hit_count = 0;
280 ZebraSet resultSetGet(ZebraHandle zh, const char *name)
284 for (s = zh->sets; s; s = s->next)
285 if (!strcmp(s->name, name))
287 if (!s->term_entries && !s->rset && s->rpn)
289 NMEM nmem = nmem_create();
290 yaz_log(log_level_resultsets, "research %s", name);
292 s->rset_nmem = nmem_create();
293 resultSetSearch(zh, nmem, s->rset_nmem, s->rpn, s);
294 if (s->rset && s->sortSpec)
297 yaz_log(log_level_resultsets, "resort %s", name);
298 resultSetSortSingle(zh, nmem, s, s->rset, s->sortSpec,
308 void resultSetInvalidate(ZebraHandle zh)
310 ZebraSet s = zh->sets;
312 yaz_log(log_level_resultsets, "invalidating result sets");
313 for (; s; s = s->next)
318 rset_close(s->cache_rfd);
319 rset_delete(s->rset);
323 s->cache_position = 0;
325 nmem_destroy(s->rset_nmem);
330 void resultSetDestroy(ZebraHandle zh, int num, char **names,int *statuses)
332 ZebraSet * ss = &zh->sets;
336 for (i = 0; i<num; i++)
337 statuses[i] = Z_DeleteStatus_resultSetDidNotExist;
344 for (i = 0; i<num; i++)
345 if (!strcmp(s->name, names[i]))
348 statuses[i] = Z_DeleteStatus_success;
357 xfree(s->sort_info->all_entries);
358 xfree(s->sort_info->entries);
362 nmem_destroy(s->nmem);
366 rset_close(s->cache_rfd);
367 rset_delete(s->rset);
370 nmem_destroy(s->rset_nmem);
379 ZebraMetaRecord *zebra_meta_records_create_range(ZebraHandle zh,
384 zint *pos = pos_small;
388 if (num > 10000 || num <= 0)
392 pos = xmalloc(sizeof(*pos) * num);
394 for (i = 0; i<num; i++)
397 mr = zebra_meta_records_create(zh, name, num, pos);
404 ZebraMetaRecord *zebra_meta_records_create(ZebraHandle zh, const char *name,
405 int num, zint *positions)
408 ZebraMetaRecord *sr = 0;
411 struct zset_sort_info *sort_info;
412 size_t sysno_mem_index = 0;
414 if (zh->m_staticrank)
419 if (!(sset = resultSetGet(zh, name)))
421 if (!(rset = sset->rset))
423 if (!sset->term_entries)
425 sr = (ZebraMetaRecord *) xmalloc(sizeof(*sr) * num);
426 for (i = 0; i<num; i++)
433 if (positions[i] <= sset->term_entries_max)
435 sr[i].term = sset->term_entries[positions[i]-1].term;
436 sr[i].db = sset->term_entries[positions[i]-1].db;
442 sr = (ZebraMetaRecord *) xmalloc(sizeof(*sr) * num);
443 for (i = 0; i<num; i++)
450 sort_info = sset->sort_info;
455 for (i = 0; i<num; i++)
457 position = positions[i];
458 if (position > 0 && position <= sort_info->num_entries)
460 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT
461 " (sorted)", position);
462 sr[i].sysno = sort_info->entries[position-1]->sysno;
463 sr[i].score = sort_info->entries[position-1]->score;
467 /* did we really get all entries using sort ? */
468 for (i = 0; i<num; i++)
473 if (i < num) /* nope, get the rest, unsorted - sorry */
482 position = sort_info->num_entries;
483 while (num_i < num && positions[num_i] <= position)
486 if (sset->cache_rfd &&
487 num_i < num && positions[num_i] > sset->cache_position)
489 position = sset->cache_position;
490 rfd = sset->cache_rfd;
491 psysno = sset->cache_psysno;
496 rset_close(sset->cache_rfd);
497 rfd = rset_open(rset, RSETF_READ);
499 while (num_i < num && rset_read(rfd, &key, 0))
501 zint this_sys = key.mem[sysno_mem_index];
502 if (this_sys != psysno)
507 /* determine we alreay have this in our set */
508 for (i = sort_info->num_entries; --i >= 0; )
509 if (psysno == sort_info->entries[i]->sysno)
516 if (position == positions[num_i])
518 sr[num_i].sysno = psysno;
519 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT " (unsorted)", position);
520 sr[num_i].score = -1;
525 sset->cache_position = position;
526 sset->cache_psysno = psysno;
527 sset->cache_rfd = rfd;
533 void zebra_meta_records_destroy(ZebraHandle zh, ZebraMetaRecord *records,
536 assert(zh); /* compiler shut up about unused arg */
544 const char *index_type;
547 void resultSetInsertSort(ZebraHandle zh, ZebraSet sset,
548 struct sortKeyInfo *criteria, int num_criteria,
550 char *cmp_buf[], char *tmp_cmp_buf[])
552 struct zset_sort_entry *new_entry = NULL;
553 struct zset_sort_info *sort_info = sset->sort_info;
556 zebra_sort_sysno(zh->reg->sort_index, sysno);
557 for (i = 0; i<num_criteria; i++)
559 char *this_entry_buf = tmp_cmp_buf[i];
560 memset(this_entry_buf, '\0', SORT_IDX_ENTRYSIZE);
561 if (criteria[i].ord != -1)
563 zebra_sort_type(zh->reg->sort_index, criteria[i].ord);
564 zebra_sort_read(zh->reg->sort_index, this_entry_buf);
567 i = sort_info->num_entries;
571 for (j = 0; j<num_criteria; j++)
573 char *this_entry_buf = tmp_cmp_buf[j];
574 char *other_entry_buf =
575 cmp_buf[j] + i * SORT_IDX_ENTRYSIZE;
576 if (criteria[j].numerical)
578 char this_entry_org[1024];
579 char other_entry_org[1024];
581 const char *index_type = criteria[j].index_type;
582 zebra_term_untrans(zh, index_type, this_entry_org,
584 zebra_term_untrans(zh, index_type, other_entry_org,
586 diff = atof(this_entry_org) - atof(other_entry_org);
597 rel = memcmp(this_entry_buf, other_entry_buf,
605 if (criteria[j].relation == 'A')
610 else if (criteria[j].relation == 'D')
617 j = sort_info->max_entries;
621 if (sort_info->num_entries == j)
624 j = (sort_info->num_entries)++;
625 new_entry = sort_info->entries[j];
629 for (k = 0; k<num_criteria; k++)
631 char *j_buf = cmp_buf[k] + j * SORT_IDX_ENTRYSIZE;
632 char *j_1_buf = cmp_buf[k] + (j-1) * SORT_IDX_ENTRYSIZE;
633 memcpy(j_buf, j_1_buf, SORT_IDX_ENTRYSIZE);
635 sort_info->entries[j] = sort_info->entries[j-1];
638 sort_info->entries[i] = new_entry;
640 for (i = 0; i<num_criteria; i++)
642 char *new_entry_buf = cmp_buf[i] + j * SORT_IDX_ENTRYSIZE;
643 char *this_entry_buf = tmp_cmp_buf[i];
644 memcpy(new_entry_buf, this_entry_buf, SORT_IDX_ENTRYSIZE);
646 new_entry->sysno = sysno;
647 new_entry->score = -1;
650 void resultSetInsertRank(ZebraHandle zh, struct zset_sort_info *sort_info,
651 zint sysno, int score, int relation)
653 struct zset_sort_entry *new_entry = NULL;
655 assert(zh); /* compiler shut up about unused arg */
657 i = sort_info->num_entries;
662 rel = score - sort_info->entries[i]->score;
669 else if (relation == 'A')
676 j = sort_info->max_entries;
680 if (sort_info->num_entries == j)
683 j = (sort_info->num_entries)++;
685 new_entry = sort_info->entries[j];
688 sort_info->entries[j] = sort_info->entries[j-1];
691 sort_info->entries[i] = new_entry;
693 new_entry->sysno = sysno;
694 new_entry->score = score;
697 static Z_RPNQuery *copy_RPNQuery(Z_RPNQuery *src, NMEM nmem)
700 ODR encode = odr_createmem(ODR_ENCODE);
701 ODR decode = odr_createmem(ODR_DECODE);
703 if (z_RPNQuery(encode, &src, 0, 0))
706 char *buf = odr_getbuf(encode, &len, 0);
710 odr_setbuf(decode, buf, len, 0);
711 z_RPNQuery(decode, &dst, 0, 0);
714 nmem_transfer(nmem, decode->mem);
720 static Z_SortKeySpecList *copy_SortKeySpecList(Z_SortKeySpecList *src, NMEM nmem)
722 Z_SortKeySpecList *dst = 0;
723 ODR encode = odr_createmem(ODR_ENCODE);
724 ODR decode = odr_createmem(ODR_DECODE);
726 if (z_SortKeySpecList(encode, &src, 0, 0))
729 char *buf = odr_getbuf(encode, &len, 0);
733 odr_setbuf(decode, buf, len, 0);
734 z_SortKeySpecList(decode, &dst, 0, 0);
737 nmem_transfer(nmem, decode->mem);
743 ZebraSet resultSetClone(ZebraHandle zh, const char *setname,
749 nset = resultSetAdd(zh, setname, 1);
753 nset->nmem = nmem_create();
755 nset->num_bases = rset->num_bases;
757 nmem_malloc(nset->nmem, nset->num_bases * sizeof(*rset->basenames));
758 for (i = 0; i<rset->num_bases; i++)
759 nset->basenames[i] = nmem_strdup(nset->nmem, rset->basenames[i]);
762 nset->rset = rset_dup(rset->rset);
764 nset->rpn = copy_RPNQuery(rset->rpn, nset->nmem);
768 ZEBRA_RES resultSetSort(ZebraHandle zh, NMEM nmem,
769 int num_input_setnames, const char **input_setnames,
770 const char *output_setname,
771 Z_SortKeySpecList *sort_sequence, int *sort_status)
776 if (num_input_setnames == 0)
778 zebra_setError(zh, YAZ_BIB1_NO_RESULT_SET_NAME_SUPPLIED_ON_SORT, 0);
781 if (num_input_setnames > 1)
783 zebra_setError(zh, YAZ_BIB1_SORT_TOO_MANY_INPUT_RESULTS, 0);
788 yaz_log(log_level_sort, "result set sort input=%s output=%s",
789 *input_setnames, output_setname);
790 sset = resultSetGet(zh, input_setnames[0]);
793 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
797 if (!(rset = sset->rset))
799 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
803 if (strcmp(output_setname, input_setnames[0]))
804 sset = resultSetClone(zh, output_setname, sset);
805 sset->sortSpec = copy_SortKeySpecList(sort_sequence, sset->nmem);
806 return resultSetSortSingle (zh, nmem, sset, rset, sort_sequence,
810 ZEBRA_RES resultSetSortSingle(ZebraHandle zh, NMEM nmem,
811 ZebraSet sset, RSET rset,
812 Z_SortKeySpecList *sort_sequence,
820 struct sortKeyInfo sort_criteria[ZSET_SORT_MAX_LEVEL];
821 char *cmp_buf[ZSET_SORT_MAX_LEVEL];
822 char *tmp_cmp_buf[ZSET_SORT_MAX_LEVEL];
828 size_t sysno_mem_index = 0;
830 if (zh->m_staticrank)
833 assert(nmem); /* compiler shut up about unused param */
834 sset->sort_info->num_entries = 0;
836 rset_getterms(rset, 0, 0, &n);
837 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
838 rset_getterms(rset, terms, n, &numTerms);
841 num_criteria = sort_sequence->num_specs;
842 if (num_criteria > ZSET_SORT_MAX_LEVEL)
843 num_criteria = ZSET_SORT_MAX_LEVEL;
844 for (i = 0; i < num_criteria; i++)
846 Z_SortKeySpec *sks = sort_sequence->specs[i];
850 sort_criteria[i].ord = -1;
851 sort_criteria[i].numerical = 0;
853 if (sks->which == Z_SortKeySpec_missingValueData)
855 zebra_setError(zh, YAZ_BIB1_UNSUPP_MISSING_DATA_ACTION, 0);
858 if (*sks->sortRelation == Z_SortKeySpec_ascending)
859 sort_criteria[i].relation = 'A';
860 else if (*sks->sortRelation == Z_SortKeySpec_descending)
861 sort_criteria[i].relation = 'D';
864 zebra_setError(zh, YAZ_BIB1_ILLEGAL_SORT_RELATION, 0);
867 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
869 zebra_setError(zh, YAZ_BIB1_DATABASE_SPECIFIC_SORT_UNSUPP, 0);
872 else if (sks->sortElement->which != Z_SortElement_generic)
874 zebra_setError(zh, YAZ_BIB1_SORT_ILLEGAL_SORT, 0);
877 sk = sks->sortElement->u.generic;
880 case Z_SortKey_sortField:
881 yaz_log(log_level_sort, "key %d is of type sortField",
883 sort_criteria[i].numerical = 0;
884 sort_criteria[i].ord =
885 zebraExplain_lookup_attr_str(zh->reg->zei,
886 zinfo_index_category_sort,
888 if (sks->which != Z_SortKeySpec_null
889 && sort_criteria[i].ord == -1)
892 YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
896 case Z_SortKey_elementSpec:
897 yaz_log(log_level_sort, "key %d is of type elementSpec",
899 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
901 case Z_SortKey_sortAttributes:
902 yaz_log(log_level_sort, "key %d is of type sortAttributes", i+1);
903 res = zebra_sort_get_ord(zh, sk->u.sortAttributes,
905 &sort_criteria[i].ord,
906 &sort_criteria[i].numerical);
907 if (sks->which != Z_SortKeySpec_null && res != ZEBRA_OK)
911 if (zebraExplain_lookup_ord(zh->reg->zei, sort_criteria[i].ord,
912 &sort_criteria[i].index_type,
915 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
919 /* allocate space for each cmpare buf + one extra for tmp comparison */
920 for (i = 0; i<num_criteria; i++)
922 cmp_buf[i] = xmalloc(sset->sort_info->max_entries
923 * SORT_IDX_ENTRYSIZE);
924 tmp_cmp_buf[i] = xmalloc(SORT_IDX_ENTRYSIZE);
926 rfd = rset_open(rset, RSETF_READ);
927 while (rset_read(rfd, &key, &termid))
929 zint this_sys = key.mem[sysno_mem_index];
930 if (log_level_searchhits)
931 key_logdump_txt(log_level_searchhits, &key, termid->name);
933 if (this_sys != psysno)
935 if ((sset->hits & 255) == 0 && zh->break_handler_func)
937 if (zh->break_handler_func(zh->break_handler_data))
939 rset_set_hits_limit(rset, 0);
945 resultSetInsertSort(zh, sset,
946 sort_criteria, num_criteria, psysno, cmp_buf,
952 for (i = 0; i<num_criteria; i++)
955 xfree(tmp_cmp_buf[i]);
958 yaz_log(log_level_sort, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
960 for (i = 0; i < numTerms; i++)
961 yaz_log(log_level_sort, "term=\"%s\" type=%s count=" ZINT_FORMAT,
962 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
963 *sort_status = Z_SortResponse_success;
967 RSET resultSetRef(ZebraHandle zh, const char *resultSetId)
971 if ((s = resultSetGet(zh, resultSetId)))
976 ZEBRA_RES resultSetRank(ZebraHandle zh, ZebraSet zebraSet,
977 RSET rset, NMEM nmem)
986 ZebraRankClass rank_class;
987 struct zset_sort_info *sort_info;
988 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
989 size_t sysno_mem_index = 0;
991 if (zh->m_staticrank)
996 sort_info = zebraSet->sort_info;
997 sort_info->num_entries = 0;
999 zebraSet->estimated_hit_count = 0;
1000 rset_getterms(rset, 0, 0, &n);
1001 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
1002 rset_getterms(rset, terms, n, &numTerms);
1004 rank_class = zebraRankLookup(zh, rank_handler_name);
1007 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
1008 zebra_setError(zh, YAZ_BIB1_UNSUPP_SEARCH, "Cannot find rank handler");
1013 RSFD rfd = rset_open(rset, RSETF_READ);
1014 struct rank_control *rc = rank_class->control;
1017 void *handle = (*rc->begin) (zh->reg, rank_class->class_handle, rset,
1018 nmem, terms, numTerms);
1019 zint psysno = 0; /* previous doc id / sys no */
1020 zint pstaticrank = 0; /* previous static rank */
1022 while (rset_read(rfd, &key, &termid))
1024 zint this_sys = key.mem[sysno_mem_index];
1026 zint seqno = key.mem[key.len-1];
1028 if (log_level_searchhits)
1029 key_logdump_txt(log_level_searchhits, &key, termid->name);
1030 if (this_sys != psysno)
1031 { /* new record .. */
1032 if (!(rfd->counted_items & 255) && zh->break_handler_func)
1034 if (zh->break_handler_func(zh->break_handler_data))
1036 yaz_log(YLOG_LOG, "Aborted search");
1040 if (rfd->counted_items > rset->hits_limit)
1043 { /* only if we did have a previous record */
1044 score = (*rc->calc)(handle, psysno, pstaticrank,
1046 /* insert the hit. A=Ascending */
1047 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
1052 zebraSet->estimated_hit_count = 1;
1053 rset_set_hits_limit(rset, 0);
1057 if (zh->m_staticrank)
1058 pstaticrank = key.mem[0];
1060 (*rc->add)(handle, CAST_ZINT_TO_INT(seqno), termid);
1064 { /* we had - at least - one record */
1065 score = (*rc->calc)(handle, psysno, pstaticrank, &stop_flag);
1066 /* insert the hit. A=Ascending */
1067 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
1070 (*rc->end)(zh->reg, handle);
1073 zebraSet->hits = rset->hits_count;
1075 yaz_log(log_level_searchterms, ZINT_FORMAT " keys, "
1076 ZINT_FORMAT " sysnos, rank", kno, zebraSet->hits);
1077 for (i = 0; i < numTerms; i++)
1079 yaz_log(log_level_searchterms, "term=\"%s\" type=%s count="
1081 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
1086 ZebraRankClass zebraRankLookup(ZebraHandle zh, const char *name)
1088 ZebraRankClass p = zh->reg->rank_classes;
1089 while (p && strcmp(p->control->name, name))
1091 if (p && !p->init_flag)
1093 if (p->control->create)
1094 p->class_handle = (*p->control->create)(zh);
1100 void zebraRankInstall(struct zebra_register *reg, struct rank_control *ctrl)
1102 ZebraRankClass p = (ZebraRankClass) xmalloc(sizeof(*p));
1103 p->control = (struct rank_control *) xmalloc(sizeof(*p->control));
1104 memcpy(p->control, ctrl, sizeof(*p->control));
1105 p->control->name = xstrdup(ctrl->name);
1107 p->next = reg->rank_classes;
1108 reg->rank_classes = p;
1111 void zebraRankDestroy(struct zebra_register *reg)
1113 ZebraRankClass p = reg->rank_classes;
1116 ZebraRankClass p_next = p->next;
1117 if (p->init_flag && p->control->destroy)
1118 (*p->control->destroy)(reg, p->class_handle);
1119 xfree(p->control->name);
1124 reg->rank_classes = NULL;
1127 static int trav_rset_for_termids(RSET rset, TERMID *termid_array,
1128 zint *hits_array, int *approx_array)
1132 for (i = 0; i<rset->no_children; i++)
1133 no += trav_rset_for_termids(rset->children[i],
1134 (termid_array ? termid_array + no : 0),
1135 (hits_array ? hits_array + no : 0),
1136 (approx_array ? approx_array + no : 0));
1140 termid_array[no] = rset->term;
1142 hits_array[no] = rset->hits_count;
1144 approx_array[no] = rset->hits_approx;
1146 yaz_log(YLOG_LOG, "rset=%p term=%s limit=" ZINT_FORMAT
1147 " count=" ZINT_FORMAT,
1148 rset, rset->term->name, rset->hits_limit, rset->hits_count);
1155 ZEBRA_RES zebra_result_set_term_no(ZebraHandle zh, const char *setname,
1158 ZebraSet sset = resultSetGet(zh, setname);
1162 *num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1168 ZEBRA_RES zebra_result_set_term_info(ZebraHandle zh, const char *setname,
1169 int no, zint *count, int *approx,
1170 char *termbuf, size_t *termlen,
1171 const char **term_ref_id)
1173 ZebraSet sset = resultSetGet(zh, setname);
1176 int num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1177 if (no >= 0 && no < num_terms)
1179 TERMID *term_array = xmalloc(num_terms * sizeof(*term_array));
1180 zint *hits_array = xmalloc(num_terms * sizeof(*hits_array));
1181 int *approx_array = xmalloc(num_terms * sizeof(*approx_array));
1183 trav_rset_for_termids(sset->rset, term_array,
1184 hits_array, approx_array);
1187 *count = hits_array[no];
1189 *approx = approx_array[no];
1192 char *inbuf = term_array[no]->name;
1193 size_t inleft = strlen(inbuf);
1194 size_t outleft = *termlen - 1;
1196 if (zh->iconv_from_utf8 != 0)
1198 char *outbuf = termbuf;
1201 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
1203 if (ret == (size_t)(-1))
1207 yaz_iconv(zh->iconv_from_utf8, 0, 0,
1209 *termlen = outbuf - termbuf;
1214 if (inleft > outleft)
1217 memcpy(termbuf, inbuf, *termlen);
1219 termbuf[*termlen] = '\0';
1222 *term_ref_id = term_array[no]->ref_id;
1226 xfree(approx_array);
1233 ZEBRA_RES zebra_snippets_hit_vector(ZebraHandle zh, const char *setname,
1234 zint sysno, zebra_snippets *snippets)
1236 ZebraSet sset = resultSetGet(zh, setname);
1237 yaz_log(YLOG_DEBUG, "zebra_get_hit_vector setname=%s zysno=" ZINT_FORMAT,
1243 struct rset_key_control *kc = zebra_key_control_create(zh);
1244 NMEM nmem = nmem_create();
1246 RSET rsets[2], rset_comb;
1247 RSET rset_temp = rset_create_temp(nmem, kc, kc->scope,
1248 res_get(zh->res, "setTmpDir"),0 );
1251 RSFD rsfd = rset_open(rset_temp, RSETF_WRITE);
1258 rset_write(rsfd, &key);
1261 rsets[0] = rset_temp;
1262 rsets[1] = rset_dup(sset->rset);
1264 rset_comb = rset_create_and(nmem, kc, kc->scope, 2, rsets);
1266 rsfd = rset_open(rset_comb, RSETF_READ);
1268 while (rset_read(rsfd, &key, &termid))
1272 struct ord_list *ol;
1273 for (ol = termid->ol; ol; ol = ol->next)
1275 zebra_snippets_append(snippets, key.mem[key.len-1], 0,
1276 ol->ord, termid->name);
1282 rset_delete(rset_comb);
1292 * indent-tabs-mode: nil
1294 * vim: shiftwidth=4 tabstop=8 expandtab