* All rights reserved.
* Sebastian Hammer, Adam Dickmeiss, Heikki Levanto
*
- * $Id: rsbetween.h,v 1.2 2002-04-12 14:51:34 heikki Exp $
+ * $Id: rsbetween.h,v 1.3 2002-04-12 14:55:22 adam Exp $
*
* Result set that returns anything in between two things,
* typically start-tag, stuff, end-tag.
RSET rset_m;
RSET rset_r;
int (*cmp)(const void *p1, const void *p2);
- char* (*printer)(void *p,char *buf); /* prints p into buf and returns buf */
+ char* (*printer)(const void *p,char *buf); /* prints p into buf and returns buf */
} rset_between_parms;
#ifdef __cplusplus
* Copyright (C) 1995-2002, Index Data
* All rights reserved.
* Sebastian Hammer, Adam Dickmeiss, Heikki Levanto
- * $Id: index.h,v 1.78 2002-04-12 14:40:42 adam Exp $
+ * $Id: index.h,v 1.79 2002-04-12 14:55:22 adam Exp $
*/
#ifndef INDEX_H
int key_open (ZebraHandle zh, int mem);
int key_close (ZebraHandle zh);
int key_compare (const void *p1, const void *p2);
+char *key_print_it (const void *p, char *buf);
int key_get_pos (const void *p);
int key_compare_it (const void *p1, const void *p2);
int key_qsort_compare (const void *p1, const void *p2);
return 0;
}
+char *key_print_it (const void *p, char *buf)
+{
+ const struct it_key *i = p;
+ sprintf (buf, "%d:%d", i->sysno, i->seqno);
+ return buf;
+}
+
int key_compare (const void *p1, const void *p2)
{
struct it_key i1, i2;
/*
* $Log: kcompare.c,v $
- * Revision 1.38 2002-04-05 08:46:26 adam
+ * Revision 1.39 2002-04-12 14:55:22 adam
+ * key_print_it
+ *
+ * Revision 1.38 2002/04/05 08:46:26 adam
* Zebra with full functionality
*
* Revision 1.37 2001/11/19 23:08:30 adam
* All rights reserved.
* Sebastian Hammer, Adam Dickmeiss
*
- * $Id: zrpn.c,v 1.113 2002-04-12 14:40:42 adam Exp $
+ * $Id: zrpn.c,v 1.114 2002-04-12 14:55:22 adam Exp $
*/
#include <stdio.h>
#include <assert.h>
parms.rset_l = rset_start_tag;
parms.rset_m = rset;
parms.rset_r = rset_end_tag;
+ parms.printer = key_print_it;
yaz_log (LOG_LOG, "rpn_search_xpath 4");
rset = rset_create (rset_kind_between, &parms);
}