* Sebastian Hammer, Adam Dickmeiss
*
* $Log: rsisam.c,v $
- * Revision 1.14 1995-12-11 09:15:24 adam
+ * Revision 1.17 1997-12-18 10:54:25 adam
+ * New method result set method rs_hits that returns the number of
+ * hits in result-set (if known). The ranked result set returns real
+ * number of hits but only when not combined with other operands.
+ *
+ * Revision 1.16 1997/10/31 12:37:01 adam
+ * Code calls xfree() instead of free().
+ *
+ * Revision 1.15 1996/10/29 13:55:22 adam
+ * Include of zebrautl.h instead of alexutil.h.
+ *
+ * Revision 1.14 1995/12/11 09:15:24 adam
* New set types: sand/sor/snot - ranked versions of and/or/not in
* ranked/semi-ranked result sets.
* Note: the snot not finished yet.
#include <stdio.h>
#include <assert.h>
#include <rsisam.h>
-#include <alexutil.h>
+#include <zebrautl.h>
static void *r_create(const struct rset_control *sel, void *parms,
int *flags);
static void r_delete (RSET ct);
static void r_rewind (RSFD rfd);
static int r_count (RSET ct);
+static int r_hits (RSET ct, void *oi);
static int r_read (RSFD rfd, void *buf);
static int r_write (RSFD rfd, const void *buf);
static int r_score (RSFD rfd, int *score);
r_delete,
r_rewind,
r_count,
+ r_hits,
r_read,
r_write,
r_score
{
is_pt_free ((*ptinfop)->pt);
*ptinfop = (*ptinfop)->next;
- free (rfd);
+ xfree (rfd);
return;
}
logf (LOG_FATAL, "r_close but no rfd match!");
return 0;
}
+static int r_hits (RSET ct, void *oi)
+{
+ return -1;
+}
+
static int r_read (RSFD rfd, void *buf)
{
return is_readkey( ((struct rset_ispt_info*) rfd)->pt, buf);