Licensed under the Academic Free License version 1.1.
http://opensource.org/licenses/academic.php
-$Id: livcode.c,v 1.2 2004-08-04 08:35:23 adam Exp $
+$Id: livcode.c,v 1.4 2004-10-26 15:32:11 heikki Exp $
*/
+#ifdef SKIPTHIS /* Need to fix the interface - FIXME */
+
#include <stdlib.h>
#include <stdio.h>
#ifdef WIN32
int last_pos;
int no_entries;
int no_rank_entries;
+ NMEM nmem;
struct rank_term_info *entries;
};
* each result set. The returned handle is a "set handle" and
* will be used in each of the handlers below.
*/
-static void *begin (struct zebra_register *reg, void *class_handle, RSET rset)
+static void *begin (struct zebra_register *reg, void *class_handle,
+ RSET rset, NMEM nmem)
{
struct rank_set_info *si = (struct rank_set_info *) xmalloc (sizeof(*si));
int i;
logf (LOG_DEBUG, "livrank begin");
- si->no_entries = rset->no_rset_terms;
+ /* FIXME - Now that we don't have term counts in rsets, what do we */
+ /* do about this ??? */
+ si->no_entries = 0; /* rset->no_rset_terms; */ /* FIXME ??? */
si->no_rank_entries = 0;
+ si->nmem=nmem;
si->entries = (struct rank_term_info *)
xmalloc (sizeof(*si->entries)*si->no_entries);
for (i = 0; i < si->no_entries; i++)
{
- const char *flags = rset->rset_terms[i]->flags;
- int g = rset->rset_terms[i]->nn;
+ const char *flags = ""; /* rset->rset_terms[i]->flags; *//* FIXME ???*/
+ int g = 0; /* rset->rset_terms[i]->nn; */ /* FIXME ??? */
const char *cp = strstr(flags, ",u=");
si->entries[i].rank_flag = 1;
};
struct rank_control *rankliv_class = &rank_control;
+#endif
+