1 /* $Id: zsets.c,v 1.115 2007-01-15 15:10:17 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;
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(void)
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");
98 ZEBRA_RES resultSetSearch(ZebraHandle zh, NMEM nmem, NMEM rset_nmem,
99 Z_RPNQuery *rpn, ZebraSet sset)
103 Z_SortKeySpecList *sort_sequence;
105 ZEBRA_RES res = ZEBRA_OK;
109 sort_sequence = (Z_SortKeySpecList *)
110 nmem_malloc(nmem, sizeof(*sort_sequence));
111 sort_sequence->num_specs = 10; /* FIXME - Hard-coded number */
112 sort_sequence->specs = (Z_SortKeySpec **)
113 nmem_malloc(nmem, sort_sequence->num_specs *
114 sizeof(*sort_sequence->specs));
115 for (i = 0; i<sort_sequence->num_specs; i++)
116 sort_sequence->specs[i] = 0;
118 attrset = oid_getentbyoid (rpn->attributeSetId);
120 rpn_get_top_approx_limit(zh, rpn->RPNStructure, &sset->approx_limit);
122 res = rpn_search_top(zh, rpn->RPNStructure, attrset->value,
125 sset->num_bases, sset->basenames,
132 for (i = 0; sort_sequence->specs[i]; i++)
134 sort_sequence->num_specs = i;
135 rset->hits_limit = sset->approx_limit;
138 res = resultSetRank (zh, sset, rset, rset_nmem);
142 res = resultSetSortSingle (zh, nmem, sset, rset,
143 sort_sequence, &sort_status);
150 ZEBRA_RES resultSetAddRPN (ZebraHandle zh, NMEM m, Z_RPNQuery *rpn,
151 int num_bases, char **basenames,
160 zebraSet = resultSetAdd(zh, setname, 1);
163 zebraSet->locked = 1;
166 zebraSet->rset_nmem = nmem_create();
168 zebraSet->num_bases = num_bases;
169 zebraSet->basenames =
170 nmem_malloc (zebraSet->nmem, num_bases * sizeof(*zebraSet->basenames));
171 for (i = 0; i<num_bases; i++)
172 zebraSet->basenames[i] = nmem_strdup(zebraSet->nmem, basenames[i]);
174 res = resultSetSearch(zh, zebraSet->nmem, zebraSet->rset_nmem,
176 zh->hits = zebraSet->hits;
179 zebraSet->locked = 0;
185 void resultSetAddTerm(ZebraHandle zh, ZebraSet s, int reg_type,
186 const char *db, const char *index_name,
189 assert(zh); /* compiler shut up */
191 s->nmem = nmem_create ();
192 if (!s->term_entries)
195 s->term_entries_max = 1000;
197 nmem_malloc (s->nmem, s->term_entries_max *
198 sizeof(*s->term_entries));
199 for (i = 0; i < s->term_entries_max; i++)
200 s->term_entries[i].term = 0;
202 if (s->hits < s->term_entries_max)
204 s->term_entries[s->hits].reg_type = reg_type;
205 s->term_entries[s->hits].db = nmem_strdup (s->nmem, db);
206 s->term_entries[s->hits].index_name = nmem_strdup(s->nmem, index_name);
207 s->term_entries[s->hits].term = nmem_strdup(s->nmem, term);
212 ZebraSet resultSetAdd(ZebraHandle zh, const char *name, int ov)
217 for (s = zh->sets; s; s = s->next)
218 if (!strcmp (s->name, name))
225 yaz_log(log_level_resultsets, "updating result set %s", name);
226 if (!ov || s->locked)
231 rset_close(s->cache_rfd);
232 rset_delete (s->rset);
235 nmem_destroy (s->rset_nmem);
237 nmem_destroy (s->nmem);
241 const char *sort_max_str = zebra_get_resource(zh, "sortmax", "1000");
243 yaz_log(log_level_resultsets, "adding result set %s", name);
244 s = (ZebraSet) xmalloc (sizeof(*s));
247 s->name = (char *) xmalloc (strlen(name)+1);
248 strcpy (s->name, 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;
279 ZebraSet resultSetGet(ZebraHandle zh, const char *name)
283 for (s = zh->sets; s; s = s->next)
284 if (!strcmp (s->name, name))
286 if (!s->term_entries && !s->rset && s->rpn)
288 NMEM nmem = nmem_create ();
289 yaz_log(log_level_resultsets, "research %s", name);
291 s->rset_nmem=nmem_create();
292 resultSetSearch(zh, nmem, s->rset_nmem, s->rpn, s);
293 if (s->rset && s->sortSpec)
296 yaz_log(log_level_resultsets, "resort %s", name);
297 resultSetSortSingle (zh, nmem, s, s->rset, s->sortSpec,
307 void resultSetInvalidate (ZebraHandle zh)
309 ZebraSet s = zh->sets;
311 yaz_log(log_level_resultsets, "invalidating result sets");
312 for (; s; s = s->next)
317 rset_close(s->cache_rfd);
318 rset_delete (s->rset);
322 s->cache_position = 0;
324 nmem_destroy(s->rset_nmem);
329 void resultSetDestroy(ZebraHandle zh, int num, char **names,int *statuses)
331 ZebraSet * ss = &zh->sets;
335 for (i = 0; i<num; i++)
336 statuses[i] = Z_DeleteStatus_resultSetDidNotExist;
343 for (i = 0; i<num; i++)
344 if (!strcmp (s->name, names[i]))
347 statuses[i] = Z_DeleteStatus_success;
356 xfree (s->sort_info->all_entries);
357 xfree (s->sort_info->entries);
358 xfree (s->sort_info);
361 nmem_destroy (s->nmem);
365 rset_close(s->cache_rfd);
366 rset_delete (s->rset);
369 nmem_destroy(s->rset_nmem);
378 ZebraMetaRecord *zebra_meta_records_create_range(ZebraHandle zh,
383 zint *pos = pos_small;
387 if (num > 10000 || num <= 0)
391 pos = xmalloc(sizeof(*pos) * num);
393 for (i = 0; i<num; i++)
396 mr = zebra_meta_records_create(zh, name, num, pos);
403 ZebraMetaRecord *zebra_meta_records_create(ZebraHandle zh, const char *name,
404 int num, zint *positions)
407 ZebraMetaRecord *sr = 0;
410 struct zset_sort_info *sort_info;
411 size_t sysno_mem_index = 0;
413 if (zh->m_staticrank)
418 if (!(sset = resultSetGet (zh, name)))
420 if (!(rset = sset->rset))
422 if (!sset->term_entries)
424 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
425 for (i = 0; i<num; i++)
432 if (positions[i] <= sset->term_entries_max)
434 sr[i].term = sset->term_entries[positions[i]-1].term;
435 sr[i].db = sset->term_entries[positions[i]-1].db;
441 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
442 for (i = 0; i<num; i++)
449 sort_info = sset->sort_info;
454 for (i = 0; i<num; i++)
456 position = positions[i];
457 if (position > 0 && position <= sort_info->num_entries)
459 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT
460 " (sorted)", position);
461 sr[i].sysno = sort_info->entries[position-1]->sysno;
462 sr[i].score = sort_info->entries[position-1]->score;
466 /* did we really get all entries using sort ? */
467 for (i = 0; i<num; i++)
472 if (i < num) /* nope, get the rest, unsorted - sorry */
481 position = sort_info->num_entries;
482 while (num_i < num && positions[num_i] <= position)
485 if (sset->cache_rfd &&
486 num_i < num && positions[num_i] > sset->cache_position)
488 position = sset->cache_position;
489 rfd = sset->cache_rfd;
490 psysno = sset->cache_psysno;
495 rset_close(sset->cache_rfd);
496 rfd = rset_open (rset, RSETF_READ);
498 while (num_i < num && rset_read (rfd, &key, 0))
500 zint this_sys = key.mem[sysno_mem_index];
501 if (this_sys != psysno)
506 /* determine we alreay have this in our set */
507 for (i = sort_info->num_entries; --i >= 0; )
508 if (psysno == sort_info->entries[i]->sysno)
514 assert (num_i < num);
515 if (position == positions[num_i])
517 sr[num_i].sysno = psysno;
518 yaz_log(log_level_sort, "got pos=" ZINT_FORMAT " (unsorted)", position);
519 sr[num_i].score = -1;
524 sset->cache_position = position;
525 sset->cache_psysno = psysno;
526 sset->cache_rfd = rfd;
532 void zebra_meta_records_destroy (ZebraHandle zh, ZebraMetaRecord *records,
535 assert(zh); /* compiler shut up about unused arg */
546 void resultSetInsertSort(ZebraHandle zh, ZebraSet sset,
547 struct sortKeyInfo *criteria, int num_criteria,
549 char *cmp_buf[], char *tmp_cmp_buf[])
551 struct zset_sort_entry *new_entry = NULL;
552 struct zset_sort_info *sort_info = sset->sort_info;
555 zebra_sort_sysno(zh->reg->sort_index, sysno);
556 for (i = 0; i<num_criteria; i++)
558 char *this_entry_buf = tmp_cmp_buf[i];
559 memset(this_entry_buf, '\0', SORT_IDX_ENTRYSIZE);
560 if (criteria[i].ord != -1)
562 zebra_sort_type(zh->reg->sort_index, criteria[i].ord);
563 zebra_sort_read(zh->reg->sort_index, this_entry_buf);
566 i = sort_info->num_entries;
570 for (j = 0; j<num_criteria; j++)
572 char *this_entry_buf = tmp_cmp_buf[j];
573 char *other_entry_buf =
574 cmp_buf[j] + i * SORT_IDX_ENTRYSIZE;
575 if (criteria[j].numerical)
577 char this_entry_org[1024];
578 char other_entry_org[1024];
580 int index_type = criteria[j].index_type;
581 zebra_term_untrans(zh, index_type, this_entry_org,
583 zebra_term_untrans(zh, index_type, other_entry_org,
585 diff = atof(this_entry_org) - atof(other_entry_org);
596 rel = memcmp(this_entry_buf, other_entry_buf,
604 if (criteria[j].relation == 'A')
609 else if (criteria[j].relation == 'D')
616 j = sort_info->max_entries;
620 if (sort_info->num_entries == j)
623 j = (sort_info->num_entries)++;
624 new_entry = sort_info->entries[j];
628 for (k = 0; k<num_criteria; k++)
630 char *j_buf = cmp_buf[k] + j * SORT_IDX_ENTRYSIZE;
631 char *j_1_buf = cmp_buf[k] + (j-1) * SORT_IDX_ENTRYSIZE;
632 memcpy(j_buf, j_1_buf, SORT_IDX_ENTRYSIZE);
634 sort_info->entries[j] = sort_info->entries[j-1];
637 sort_info->entries[i] = new_entry;
639 for (i = 0; i<num_criteria; i++)
641 char *new_entry_buf = cmp_buf[i] + j * SORT_IDX_ENTRYSIZE;
642 char *this_entry_buf = tmp_cmp_buf[i];
643 memcpy(new_entry_buf, this_entry_buf, SORT_IDX_ENTRYSIZE);
645 new_entry->sysno = sysno;
646 new_entry->score = -1;
649 void resultSetInsertRank(ZebraHandle zh, struct zset_sort_info *sort_info,
650 zint sysno, int score, int relation)
652 struct zset_sort_entry *new_entry = NULL;
654 assert(zh); /* compiler shut up about unused arg */
656 i = sort_info->num_entries;
661 rel = score - sort_info->entries[i]->score;
668 else if (relation == 'A')
675 j = sort_info->max_entries;
679 if (sort_info->num_entries == j)
682 j = (sort_info->num_entries)++;
684 new_entry = sort_info->entries[j];
687 sort_info->entries[j] = sort_info->entries[j-1];
690 sort_info->entries[i] = new_entry;
692 new_entry->sysno = sysno;
693 new_entry->score = score;
696 static Z_RPNQuery *copy_RPNQuery(Z_RPNQuery *src, NMEM nmem)
699 ODR encode = odr_createmem(ODR_ENCODE);
700 ODR decode = odr_createmem(ODR_DECODE);
702 if (z_RPNQuery(encode, &src, 0, 0))
705 char *buf = odr_getbuf(encode, &len, 0);
709 odr_setbuf(decode, buf, len, 0);
710 z_RPNQuery(decode, &dst, 0, 0);
713 nmem_transfer(nmem, decode->mem);
719 static Z_SortKeySpecList *copy_SortKeySpecList(Z_SortKeySpecList *src, NMEM nmem)
721 Z_SortKeySpecList *dst = 0;
722 ODR encode = odr_createmem(ODR_ENCODE);
723 ODR decode = odr_createmem(ODR_DECODE);
725 if (z_SortKeySpecList(encode, &src, 0, 0))
728 char *buf = odr_getbuf(encode, &len, 0);
732 odr_setbuf(decode, buf, len, 0);
733 z_SortKeySpecList(decode, &dst, 0, 0);
736 nmem_transfer(nmem, decode->mem);
742 ZebraSet resultSetClone(ZebraHandle zh, const char *setname,
748 nset = resultSetAdd(zh, setname, 1);
752 nset->nmem = nmem_create();
754 nset->num_bases = rset->num_bases;
756 nmem_malloc (nset->nmem, nset->num_bases * sizeof(*rset->basenames));
757 for (i = 0; i<rset->num_bases; i++)
758 nset->basenames[i] = nmem_strdup(nset->nmem, rset->basenames[i]);
761 nset->rset = rset_dup(rset->rset);
763 nset->rpn = copy_RPNQuery(rset->rpn, nset->nmem);
767 ZEBRA_RES resultSetSort(ZebraHandle zh, NMEM nmem,
768 int num_input_setnames, const char **input_setnames,
769 const char *output_setname,
770 Z_SortKeySpecList *sort_sequence, int *sort_status)
775 if (num_input_setnames == 0)
777 zebra_setError(zh, YAZ_BIB1_NO_RESULT_SET_NAME_SUPPLIED_ON_SORT, 0);
780 if (num_input_setnames > 1)
782 zebra_setError(zh, YAZ_BIB1_SORT_TOO_MANY_INPUT_RESULTS, 0);
787 yaz_log(log_level_sort, "result set sort input=%s output=%s",
788 *input_setnames, output_setname);
789 sset = resultSetGet (zh, input_setnames[0]);
792 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
796 if (!(rset = sset->rset))
798 zebra_setError(zh, YAZ_BIB1_SPECIFIED_RESULT_SET_DOES_NOT_EXIST,
802 if (strcmp (output_setname, input_setnames[0]))
803 sset = resultSetClone(zh, output_setname, sset);
804 sset->sortSpec = copy_SortKeySpecList(sort_sequence, sset->nmem);
805 return resultSetSortSingle (zh, nmem, sset, rset, sort_sequence,
809 ZEBRA_RES resultSetSortSingle(ZebraHandle zh, NMEM nmem,
810 ZebraSet sset, RSET rset,
811 Z_SortKeySpecList *sort_sequence,
819 struct sortKeyInfo sort_criteria[ZSET_SORT_MAX_LEVEL];
820 char *cmp_buf[ZSET_SORT_MAX_LEVEL];
821 char *tmp_cmp_buf[ZSET_SORT_MAX_LEVEL];
827 size_t sysno_mem_index = 0;
829 if (zh->m_staticrank)
832 assert(nmem); /* compiler shut up about unused param */
833 sset->sort_info->num_entries = 0;
835 rset_getterms(rset, 0, 0, &n);
836 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
837 rset_getterms(rset, terms, n, &numTerms);
840 num_criteria = sort_sequence->num_specs;
841 if (num_criteria > ZSET_SORT_MAX_LEVEL)
842 num_criteria = ZSET_SORT_MAX_LEVEL;
843 for (i = 0; i < num_criteria; i++)
845 Z_SortKeySpec *sks = sort_sequence->specs[i];
849 sort_criteria[i].ord = -1;
850 sort_criteria[i].numerical = 0;
852 if (sks->which == Z_SortKeySpec_missingValueData)
854 zebra_setError(zh, YAZ_BIB1_UNSUPP_MISSING_DATA_ACTION, 0);
857 if (*sks->sortRelation == Z_SortKeySpec_ascending)
858 sort_criteria[i].relation = 'A';
859 else if (*sks->sortRelation == Z_SortKeySpec_descending)
860 sort_criteria[i].relation = 'D';
863 zebra_setError(zh, YAZ_BIB1_ILLEGAL_SORT_RELATION, 0);
866 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
868 zebra_setError(zh, YAZ_BIB1_DATABASE_SPECIFIC_SORT_UNSUPP, 0);
871 else if (sks->sortElement->which != Z_SortElement_generic)
873 zebra_setError(zh, YAZ_BIB1_SORT_ILLEGAL_SORT, 0);
876 sk = sks->sortElement->u.generic;
879 case Z_SortKey_sortField:
880 yaz_log(log_level_sort, "key %d is of type sortField",
882 sort_criteria[i].numerical = 0;
883 sort_criteria[i].ord =
884 zebraExplain_lookup_attr_str(zh->reg->zei,
885 zinfo_index_category_sort,
886 -1, sk->u.sortField);
887 if (sks->which != Z_SortKeySpec_null
888 && sort_criteria[i].ord == -1)
891 YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
895 case Z_SortKey_elementSpec:
896 yaz_log(log_level_sort, "key %d is of type elementSpec",
898 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
900 case Z_SortKey_sortAttributes:
901 yaz_log(log_level_sort, "key %d is of type sortAttributes", i+1);
902 res = zebra_sort_get_ord(zh, sk->u.sortAttributes,
904 &sort_criteria[i].ord,
905 &sort_criteria[i].numerical);
906 if (sks->which != Z_SortKeySpec_null && res != ZEBRA_OK)
910 if (zebraExplain_lookup_ord(zh->reg->zei, sort_criteria[i].ord,
911 &sort_criteria[i].index_type,
914 zebra_setError(zh, YAZ_BIB1_CANNOT_SORT_ACCORDING_TO_SEQUENCE, 0);
918 /* allocate space for each cmpare buf + one extra for tmp comparison */
919 for (i = 0; i<num_criteria; i++)
921 cmp_buf[i] = xmalloc(sset->sort_info->max_entries
922 * SORT_IDX_ENTRYSIZE);
923 tmp_cmp_buf[i] = xmalloc(SORT_IDX_ENTRYSIZE);
925 rfd = rset_open (rset, RSETF_READ);
926 while (rset_read (rfd, &key, &termid))
928 zint this_sys = key.mem[sysno_mem_index];
929 if (log_level_searchhits)
930 key_logdump_txt(log_level_searchhits, &key, termid->name);
932 if (this_sys != psysno)
936 resultSetInsertSort(zh, sset,
937 sort_criteria, num_criteria, psysno, cmp_buf,
943 for (i = 0; i<num_criteria; i++)
946 xfree(tmp_cmp_buf[i]);
949 yaz_log(log_level_sort, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
951 for (i = 0; i < numTerms; i++)
952 yaz_log(log_level_sort, "term=\"%s\" type=%s count=" ZINT_FORMAT,
953 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
954 *sort_status = Z_SortResponse_success;
958 RSET resultSetRef(ZebraHandle zh, const char *resultSetId)
962 if ((s = resultSetGet (zh, resultSetId)))
967 ZEBRA_RES resultSetRank(ZebraHandle zh, ZebraSet zebraSet,
968 RSET rset, NMEM nmem)
977 ZebraRankClass rank_class;
978 struct zset_sort_info *sort_info;
979 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
980 size_t sysno_mem_index = 0;
982 if (zh->m_staticrank)
987 sort_info = zebraSet->sort_info;
988 sort_info->num_entries = 0;
990 rset_getterms(rset, 0, 0, &n);
991 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
992 rset_getterms(rset, terms, n, &numTerms);
995 rank_class = zebraRankLookup(zh, rank_handler_name);
998 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
999 zebra_setError(zh, YAZ_BIB1_UNSUPP_SEARCH, "Cannot find rank handler");
1004 RSFD rfd = rset_open(rset, RSETF_READ);
1005 struct rank_control *rc = rank_class->control;
1010 (*rc->begin) (zh->reg, rank_class->class_handle, rset, nmem,
1012 zint psysno = 0; /* previous doc id / sys no */
1013 zint pstaticrank = 0; /* previous static rank */
1015 while (rset_read(rfd, &key, &termid))
1017 zint this_sys = key.mem[sysno_mem_index];
1019 zint seqno = key.mem[key.len-1];
1021 if (log_level_searchhits)
1022 key_logdump_txt(log_level_searchhits, &key, termid->name);
1023 if (this_sys != psysno)
1024 { /* new record .. */
1025 if (rfd->counted_items > rset->hits_limit)
1028 { /* only if we did have a previous record */
1029 score = (*rc->calc) (handle, psysno, pstaticrank,
1031 /* insert the hit. A=Ascending */
1032 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
1038 if (zh->m_staticrank)
1039 pstaticrank = key.mem[0];
1041 (*rc->add) (handle, CAST_ZINT_TO_INT(seqno), termid);
1045 { /* we had - at least - one record */
1046 score = (*rc->calc)(handle, psysno, pstaticrank, &stop_flag);
1047 /* insert the hit. A=Ascending */
1048 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
1051 (*rc->end) (zh->reg, handle);
1054 zebraSet->hits = rset->hits_count;
1056 yaz_log(log_level_searchterms, ZINT_FORMAT " keys, "
1057 ZINT_FORMAT " sysnos, rank", kno, zebraSet->hits);
1058 for (i = 0; i < numTerms; i++)
1060 yaz_log(log_level_searchterms, "term=\"%s\" type=%s count="
1062 terms[i]->name, terms[i]->flags, terms[i]->rset->hits_count);
1067 ZebraRankClass zebraRankLookup(ZebraHandle zh, const char *name)
1069 ZebraRankClass p = zh->reg->rank_classes;
1070 while (p && strcmp (p->control->name, name))
1072 if (p && !p->init_flag)
1074 if (p->control->create)
1075 p->class_handle = (*p->control->create)(zh);
1081 void zebraRankInstall(struct zebra_register *reg, struct rank_control *ctrl)
1083 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
1084 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
1085 memcpy (p->control, ctrl, sizeof(*p->control));
1086 p->control->name = xstrdup (ctrl->name);
1088 p->next = reg->rank_classes;
1089 reg->rank_classes = p;
1092 void zebraRankDestroy(struct zebra_register *reg)
1094 ZebraRankClass p = reg->rank_classes;
1097 ZebraRankClass p_next = p->next;
1098 if (p->init_flag && p->control->destroy)
1099 (*p->control->destroy)(reg, p->class_handle);
1100 xfree(p->control->name);
1105 reg->rank_classes = NULL;
1108 static int trav_rset_for_termids(RSET rset, TERMID *termid_array,
1109 zint *hits_array, int *approx_array)
1113 for (i = 0; i<rset->no_children; i++)
1114 no += trav_rset_for_termids(rset->children[i],
1115 (termid_array ? termid_array + no : 0),
1116 (hits_array ? hits_array + no : 0),
1117 (approx_array ? approx_array + no : 0));
1121 termid_array[no] = rset->term;
1123 hits_array[no] = rset->hits_count;
1125 approx_array[no] = rset->hits_approx;
1127 yaz_log(YLOG_LOG, "rset=%p term=%s limit=" ZINT_FORMAT
1128 " count=" ZINT_FORMAT,
1129 rset, rset->term->name, rset->hits_limit, rset->hits_count);
1136 ZEBRA_RES zebra_result_set_term_no(ZebraHandle zh, const char *setname,
1139 ZebraSet sset = resultSetGet(zh, setname);
1143 *num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1149 ZEBRA_RES zebra_result_set_term_info(ZebraHandle zh, const char *setname,
1150 int no, zint *count, int *approx,
1151 char *termbuf, size_t *termlen,
1152 const char **term_ref_id)
1154 ZebraSet sset = resultSetGet(zh, setname);
1157 int num_terms = trav_rset_for_termids(sset->rset, 0, 0, 0);
1158 if (no >= 0 && no < num_terms)
1160 TERMID *term_array = xmalloc(num_terms * sizeof(*term_array));
1161 zint *hits_array = xmalloc(num_terms * sizeof(*hits_array));
1162 int *approx_array = xmalloc(num_terms * sizeof(*approx_array));
1164 trav_rset_for_termids(sset->rset, term_array,
1165 hits_array, approx_array);
1168 *count = hits_array[no];
1170 *approx = approx_array[no];
1173 char *inbuf = term_array[no]->name;
1174 size_t inleft = strlen(inbuf);
1175 size_t outleft = *termlen - 1;
1177 if (zh->iconv_from_utf8 != 0)
1179 char *outbuf = termbuf;
1182 ret = yaz_iconv(zh->iconv_from_utf8, &inbuf, &inleft,
1184 if (ret == (size_t)(-1))
1187 *termlen = outbuf - termbuf;
1191 if (inleft > outleft)
1194 memcpy(termbuf, inbuf, *termlen);
1196 termbuf[*termlen] = '\0';
1199 *term_ref_id = term_array[no]->ref_id;
1203 xfree(approx_array);
1210 ZEBRA_RES zebra_snippets_hit_vector(ZebraHandle zh, const char *setname,
1211 zint sysno, zebra_snippets *snippets)
1213 ZebraSet sset = resultSetGet(zh, setname);
1214 yaz_log(YLOG_DEBUG, "zebra_get_hit_vector setname=%s zysno=" ZINT_FORMAT,
1220 struct rset_key_control *kc = zebra_key_control_create(zh);
1221 NMEM nmem = nmem_create();
1223 RSET rsets[2], rset_comb;
1224 RSET rset_temp = rset_create_temp(nmem, kc, kc->scope,
1225 res_get (zh->res, "setTmpDir"),0 );
1228 RSFD rsfd = rset_open(rset_temp, RSETF_WRITE);
1235 rset_write (rsfd, &key);
1238 rsets[0] = rset_temp;
1239 rsets[1] = rset_dup(sset->rset);
1241 rset_comb = rset_create_and(nmem, kc, kc->scope, 2, rsets);
1243 rsfd = rset_open(rset_comb, RSETF_READ);
1245 while (rset_read(rsfd, &key, &termid))
1249 struct ord_list *ol;
1250 for (ol = termid->ol; ol; ol = ol->next)
1252 zebra_snippets_append(snippets, key.mem[key.len-1],
1253 ol->ord, termid->name);
1259 rset_delete(rset_comb);
1269 * indent-tabs-mode: nil
1271 * vim: shiftwidth=4 tabstop=8 expandtab