1 /* $Id: rankstatic.c,v 1.6 2006-05-10 08:13:22 adam Exp $
2 Copyright (C) 1995-2005
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
36 static int log_level = 0;
37 static int log_initialized = 0;
39 struct rank_set_info {
44 * create: Creates/Initialises this rank handler. This routine is
45 * called exactly once. The routine returns the class_handle.
47 static void *create (ZebraHandle zh)
51 log_level = yaz_log_module_level("rankstatic");
54 yaz_log(log_level, "rank-static create");
59 * destroy: Destroys this rank handler. This routine is called
60 * when the handler is no longer needed - i.e. when the server
61 * dies. The class_handle was previously returned by create.
63 static void destroy (struct zebra_register *reg, void *class_handle)
65 yaz_log(log_level, "rank-static destroy");
70 * begin: Prepares beginning of "real" ranking. Called once for
71 * each result set. The returned handle is a "set handle" and
72 * will be used in each of the handlers below.
74 static void *begin (struct zebra_register *reg,
75 void *class_handle, RSET rset, NMEM nmem,
76 TERMID *terms, int numterms)
78 struct rank_set_info *si =
79 (struct rank_set_info *) nmem_malloc (nmem, sizeof(*si));
82 yaz_log(log_level, "rank-static begin");
83 /* count how many terms are ranked (2=102 or similar) */
84 si->no_rank_entries = 0;
85 for (i = 0; i < numterms; i++)
87 struct ord_list *ol = terms[i]->ol;
89 yaz_log(log_level, "i=%d flags=%s '%s'", i,
90 terms[i]->flags, terms[i]->name );
92 for (; ol; ol = ol->next)
96 const char *string_index = 0;
100 zebraExplain_lookup_ord(reg->zei,
101 ol->ord, &index_type, &db, &set, &use,
105 yaz_log(log_level, " ord=%d index_type=%c db=%s str-index=%s",
106 ol->ord, index_type, db, string_index);
108 yaz_log(log_level, " ord=%d index_type=%c db=%s set=%d use=%d",
109 ol->ord, index_type, db, set, use);
111 if (!strncmp (terms[i]->flags, "rank,", 5))
112 (si->no_rank_entries)++;
118 * end: Terminates ranking process. Called after a result set
121 static void end (struct zebra_register *reg, void *set_handle)
123 yaz_log(log_level, "rank-static end");
128 * add: Called for each word occurence in a result set. This routine
129 * should be as fast as possible. This routine should "incrementally"
132 static void add (void *set_handle, int seqno, TERMID term)
137 * calc: Called for each document in a result. This handler should
138 * produce a score based on previous call(s) to the add handler. The
139 * score should be between 0 and 1000. If score cannot be obtained
140 * -1 should be returned.
142 static int calc (void *set_handle, zint sysno, zint staticrank,
145 struct rank_set_info *si = (struct rank_set_info *) set_handle;
147 if (!si->no_rank_entries)
148 return -1; /* ranking not enabled for any terms */
150 /* if we set *stop_flag = 1, we stop processing (of result set list) */
151 /* staticrank = 0 is highest, MAXINT lowest */
152 return INT_MAX - staticrank; /* but score is reverse (logical) */
156 * Pseudo-meta code with sequence of calls as they occur in a
157 * server. Handlers are prefixed by --:
173 static struct rank_control rank_control = {
183 struct rank_control *rank_static_class = &rank_control;
187 * indent-tabs-mode: nil
189 * vim: shiftwidth=4 tabstop=8 expandtab