1 /* $Id: rset.h,v 1.50 2005-04-26 10:09:38 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
26 #include <yaz/yaz-util.h>
27 /* unfortunately we need the isam includes here, for the arguments for */
29 #include <idzebra/isamb.h>
30 #include <idzebra/isamc.h>
31 #include <idzebra/isams.h>
35 typedef struct rsfd *RSFD; /* Rset "file descriptor" */
36 typedef struct rset *RSET; /* Result set */
40 * rset_term is all we need to know of a term to do ranking etc.
41 * As far as the rsets are concerned, it is just a dummy pointer to
46 /** the term itself */
50 /** the rset corresponding to this term */
52 /** private stuff for the ranking algorithm */
56 typedef struct rset_term *TERMID;
57 TERMID rset_term_create (const char *name, int length, const char *flags,
60 /** rsfd is a "file descriptor" for reading from a rset */
61 struct rsfd { /* the stuff common to all rsfd's. */
62 RSET rset; /* ptr to the rset this FD is opened to */
63 void *priv; /* private parameters for this type */
64 RSFD next; /* to keep lists of used/free rsfd's */
69 * rset_control has function pointers to all the important functions
70 * of a rset. Each type of rset will have its own control block, pointing
71 * to the functions for that type. They all have their own create function
72 * which is not part of the control block, as it takes different args for
77 /** text description of set type (for debugging) */
79 /* RSET rs_something_create(const struct rset_control *sel, ...); */
80 void (*f_delete)(RSET ct);
82 /** recursively fills the terms array with terms. call with curterm=0 */
83 /* always counts them all into cur, but of course won't touch the term */
84 /* array past max. You can use this to count, set max=0 */
85 void (*f_getterms)(RSET ct, TERMID *terms, int maxterms, int *curterm);
87 RSFD (*f_open)(RSET ct, int wflag);
88 void (*f_close)(RSFD rfd);
89 /** forward behaves like a read, but it skips some items first */
90 int (*f_forward)(RSFD rfd, void *buf, TERMID *term, const void *untilbuf);
91 void (*f_pos)(RSFD rfd, double *current, double *total);
92 /* returns -1,-1 if pos function not implemented for this type */
93 int (*f_read)(RSFD rfd, void *buf, TERMID *term);
94 int (*f_write)(RSFD rfd, const void *buf);
97 /** rset_default_forward implements a generic forward with a read-loop */
98 int rset_default_forward(RSFD rfd, void *buf, TERMID *term,
99 const void *untilbuf);
101 /** rset_get_no_terms is a getterms function for those that don't have any */
102 void rset_get_no_terms(RSET ct, TERMID *terms, int maxterms, int *curterm);
105 * rset_get_one_term is a getterms function for those rsets that have
106 * exactly one term, like all rsisamX types.
108 void rset_get_one_term(RSET ct,TERMID *terms,int maxterms,int *curterm);
111 * key_control contains all there is to know about the keys stored in
112 * an isam, and therefore operated by the rsets. Other than this info,
113 * all we assume is that all keys are the same size, and they can be
118 int scope; /* default for what level we operate (book/chapter/verse) on*/
119 /* usual sysno/seqno is 2 */
120 int (*cmp) (const void *p1, const void *p2);
121 void (*key_logdump_txt) (int logmask, const void *p, const char *txt);
122 zint (*getseq)(const void *p);
123 /* FIXME - Should not need a getseq, it won't make much sense with */
124 /* higher-order keys. Use a (generalized) cmp instead, or something */
125 /* FIXME - decode and encode, and lots of other stuff */
129 * A rset is an ordered sequence of keys, either directly from an underlaying
130 * isam, or from one of the higher-level operator rsets (and, or, ...).
131 * Actually, it is "virtual base class", no pure rsets exist in the system,
132 * they all are of some derived type.
136 const struct rset_control *control;
137 const struct key_control *keycontrol;
138 int count; /* reference count */
139 void *priv; /* stuff private to the given type of rset */
140 NMEM nmem; /* nibble memory for various allocs */
141 char my_nmem; /* Should the nmem be destroyed with the rset? */
142 /* 1 if created with it, 0 if passed from above */
143 RSFD free_list; /* all rfd's allocated but not currently in use */
144 RSFD use_list; /* all rfd's in use */
145 int scope; /* On what level do we count hits and compare them? */
146 TERMID term; /* the term thing for ranking etc */
148 /* rset is a "virtual base class", which will never exist on its own
149 * all instances are rsets of some specific type, like rsisamb, or rsbool
150 * They keep their own stuff behind the priv pointer. */
152 /* On the old sysno-seqno type isams, the scope was hard-coded to be 2.
153 * This means that we count hits on the sysno level, and when matching an
154 * 'and', we consider it a match if both term occur within the same sysno.
155 * In more complex isams we can specify on what level we wish to do the
156 * matching and counting of hits. For example, we can have book / chapter /
157 * verse, and a seqno. Scope 2 means then "give me all verses that match",
158 * 3 would be chapters, 4 books.
159 * The resolution tells how much of the occurences we need to return. If we
160 * are doing some sort of proximity, we need to get the seqnos of all
161 * occurences, whereas if we are only counting hits, we do not need anything
162 * below the scope. Again 1 is seqnos, 2 sysnos (or verses), 3 books, etc.
165 RSFD rfd_create_base(RSET rs);
166 void rfd_delete_base(RSFD rfd);
167 int rfd_is_last(RSFD rfd);
169 RSET rset_create_base(const struct rset_control *sel,
171 const struct key_control *kcontrol,
175 void rset_delete(RSET rs);
176 RSET rset_dup (RSET rs);
180 #define RSETF_WRITE 1
181 /* RSFD rset_open(RSET rs, int wflag); */
182 #define rset_open(rs, wflag) (*(rs)->control->f_open)((rs), (wflag))
184 /* void rset_close(RSFD rfd); */
185 #define rset_close(rfd) (*(rfd)->rset->control->f_close)(rfd)
187 /* int rset_forward(RSFD rfd, void *buf, TERMID term, void *untilbuf); */
188 #define rset_forward(rfd, buf, term, untilbuf) \
189 (*(rfd)->rset->control->f_forward)((rfd),(buf),(term),(untilbuf))
191 /* void rset_getterms(RSET ct, TERMID *terms, int maxterms, int *curterm); */
192 #define rset_getterms(ct, terms, maxterms, curterm) \
193 (*(ct)->control->f_getterms)((ct),(terms),(maxterms),(curterm))
195 /* int rset_pos(RSFD fd, double *current, double *total); */
196 #define rset_pos(rfd,cur,tot) \
197 (*(rfd)->rset->control->f_pos)((rfd),(cur),(tot))
199 /* int rset_read(RSFD rfd, void *buf, TERMID term); */
200 #define rset_read(rfd, buf, term) \
201 (*(rfd)->rset->control->f_read)((rfd), (buf), (term))
203 /* int rset_write(RSFD rfd, const void *buf); */
204 #define rset_write(rfd, buf) (*(rfd)->rset->control->f_write)((rfd), (buf))
206 /* int rset_type (RSET) */
207 #define rset_type(rs) ((rs)->control->desc)
209 /** rset_count counts or estimates the keys in it*/
210 zint rset_count(RSET rs);
212 RSET rstemp_create(NMEM nmem, const struct key_control *kcontrol,
213 int scope, const char *temp_path, TERMID term);
215 RSET rsnull_create(NMEM nmem, const struct key_control *kcontrol);
217 RSET rsbool_create_and(NMEM nmem, const struct key_control *kcontrol,
218 int scope, RSET rset_l, RSET rset_r);
220 RSET rsbool_create_or (NMEM nmem, const struct key_control *kcontrol,
221 int scope, RSET rset_l, RSET rset_r);
223 RSET rsbool_create_not(NMEM nmem, const struct key_control *kcontrol,
224 int scope, RSET rset_l, RSET rset_r);
226 RSET rsbetween_create(NMEM nmem, const struct key_control *kcontrol,
227 int scope, RSET rset_l, RSET rset_m, RSET rset_r,
230 RSET rsmulti_or_create(NMEM nmem, const struct key_control *kcontrol,
231 int scope, int no_rsets, RSET* rsets);
233 RSET rsmulti_and_create(NMEM nmem, const struct key_control *kcontrol,
234 int scope, int no_rsets, RSET* rsets);
236 RSET rsprox_create(NMEM nmem, const struct key_control *kcontrol,
237 int scope, int rset_no, RSET *rset,
238 int ordered, int exclusion, int relation, int distance);
240 RSET rsisamb_create(NMEM nmem, const struct key_control *kcontrol,
241 int scope, ISAMB is, ISAM_P pos, TERMID term);
243 RSET rsisamc_create(NMEM nmem, const struct key_control *kcontrol,
244 int scope, ISAMC is, ISAM_P pos, TERMID term);
246 RSET rsisams_create(NMEM nmem, const struct key_control *kcontrol,
247 int scope, ISAMS is, ISAM_P pos, TERMID term);