2 * Copyright (C) 1994-1999, Index Data
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.32 1999-07-13 13:21:15 heikki
8 * Managing negative deltas
10 * Revision 1.31 1999/07/06 09:37:04 heikki
11 * Working on isamh - not ready yet.
13 * Revision 1.30 1999/06/30 15:07:23 heikki
16 * Revision 1.29 1999/06/30 09:08:23 adam
17 * Added coder to reset.
19 * Revision 1.28 1999/05/26 07:49:13 adam
22 * Revision 1.27 1999/05/12 13:08:06 adam
23 * First version of ISAMS.
25 * Revision 1.26 1999/02/02 14:50:54 adam
26 * Updated WIN32 code specific sections. Changed header.
28 * Revision 1.25 1998/06/08 15:26:06 adam
31 * Revision 1.24 1998/06/08 14:43:12 adam
32 * Added suport for EXPLAIN Proxy servers - added settings databasePath
33 * and explainDatabase to facilitate this. Increased maximum number
34 * of databases and attributes in one register.
36 * Revision 1.23 1998/03/05 08:45:12 adam
37 * New result set model and modular ranking system. Moved towards
38 * descent server API. System information stored as "SGML" records.
40 * Revision 1.22 1997/09/22 12:39:06 adam
41 * Added get_pos method for the ranked result sets.
43 * Revision 1.21 1997/09/17 12:19:13 adam
44 * Zebra version corresponds to YAZ version 1.4.
45 * Changed Zebra server so that it doesn't depend on global common_resource.
47 * Revision 1.20 1996/12/23 15:30:44 adam
49 * Bug fix: result sets weren't deleted after server shut down.
51 * Revision 1.19 1996/12/11 12:08:00 adam
52 * Added better compression.
54 * Revision 1.18 1996/10/29 14:09:44 adam
55 * Use of cisam system - enabled if setting isamc is 1.
57 * Revision 1.17 1996/06/04 10:18:58 adam
58 * Minor changes - removed include of ctype.h.
60 * Revision 1.16 1996/05/13 14:23:05 adam
61 * Work on compaction of set/use bytes in dictionary.
63 * Revision 1.15 1995/11/20 16:59:46 adam
64 * New update method: the 'old' keys are saved for each records.
66 * Revision 1.14 1995/10/30 15:08:08 adam
69 * Revision 1.13 1995/10/27 14:00:11 adam
70 * Implemented detection of database availability.
72 * Revision 1.12 1995/10/17 18:02:08 adam
73 * New feature: databases. Implemented as prefix to words in dictionary.
75 * Revision 1.11 1995/10/06 16:33:37 adam
76 * Use attribute mappings.
78 * Revision 1.10 1995/09/29 14:01:41 adam
81 * Revision 1.9 1995/09/28 12:10:32 adam
82 * Bug fixes. Field prefix used in queries.
84 * Revision 1.8 1995/09/28 09:19:42 adam
85 * xfree/xmalloc used everywhere.
86 * Extract/retrieve method seems to work for text records.
88 * Revision 1.7 1995/09/27 12:22:28 adam
89 * More work on extract in record control.
90 * Field name is not in isam keys but in prefix in dictionary words.
92 * Revision 1.6 1995/09/14 07:48:23 adam
93 * Record control management.
95 * Revision 1.5 1995/09/11 13:09:34 adam
96 * More work on relevance feedback.
98 * Revision 1.4 1995/09/08 14:52:27 adam
99 * Minor changes. Dictionary is lower case now.
101 * Revision 1.3 1995/09/07 13:58:36 adam
102 * New parameter: result-set file descriptor (RSFD) to support multiple
103 * positions within the same result-set.
104 * Boolean operators: and, or, not implemented.
105 * Result-set references.
107 * Revision 1.2 1995/09/06 16:11:17 adam
108 * Option: only one word key per file.
110 * Revision 1.1 1995/09/04 09:10:36 adam
111 * More work on index add/del/update.
112 * Merge sort implemented.
113 * Initial work on z39 server.
124 void key_logdump (int logmask, const void *p)
128 memcpy (&key, p, sizeof(key));
129 logf (logmask, "%7d s=%-4d", key.sysno, key.seqno);
132 int key_compare_it (const void *p1, const void *p2)
134 if (((struct it_key *) p1)->sysno != ((struct it_key *) p2)->sysno)
136 if (((struct it_key *) p1)->sysno > ((struct it_key *) p2)->sysno)
141 if (((struct it_key *) p1)->seqno != ((struct it_key *) p2)->seqno)
143 if (((struct it_key *) p1)->seqno > ((struct it_key *) p2)->seqno)
151 int key_compare (const void *p1, const void *p2)
153 struct it_key i1, i2;
154 memcpy (&i1, p1, sizeof(i1));
155 memcpy (&i2, p2, sizeof(i2));
156 if (i1.sysno != i2.sysno)
158 if (i1.sysno > i2.sysno)
163 if (i1.seqno != i2.seqno)
165 if (i1.seqno > i2.seqno)
173 int key_qsort_compare (const void *p1, const void *p2)
177 char *cp1 = *(char **) p1;
178 char *cp2 = *(char **) p2;
180 if ((r = strcmp (cp1, cp2)))
183 if ((r = key_compare (cp1+l+1, cp2+l+1)))
185 return cp1[l] - cp2[l];
188 int key_get_pos (const void *p)
191 memcpy (&key, p, sizeof(key));
195 struct iscz1_code_info {
199 static void *iscz1_code_start (int mode)
201 struct iscz1_code_info *p = (struct iscz1_code_info *)
202 xmalloc (sizeof(*p));
208 static void iscz1_code_reset (void *vp)
210 struct iscz1_code_info *p = (struct iscz1_code_info *) vp;
215 static void iscz1_code_stop (int mode, void *p)
220 void iscz1_encode_int (unsigned d, char **dst)
222 unsigned char *bp = (unsigned char*) *dst;
231 else if (d <= 4194303)
233 *bp++ = 128 | (d>>16);
234 *bp++ = (d>>8) & 255;
239 *bp++ = 192 | (d>>24);
240 *bp++ = (d>>16) & 255;
241 *bp++ = (d>>8) & 255;
247 int iscz1_decode_int (unsigned char **src)
249 unsigned c = *(*src)++;
255 return ((c & 63) << 8) + *(*src)++;
257 c = ((c & 63) << 8) + *(*src)++;
258 c = (c << 8) + *(*src)++;
261 if (c&32) /* expand sign bit to high bits */
262 c = ((c | 63) << 8) + *(*src)++;
264 c = ((c & 63) << 8) + *(*src)++;
265 c = (c << 8) + *(*src)++;
266 c = (c << 8) + *(*src)++;
271 static void iscz1_code_item (int mode, void *vp, char **dst, char **src)
273 struct iscz1_code_info *p = (struct iscz1_code_info *) vp;
277 if (mode == ISAMC_ENCODE)
279 memcpy (&tkey, *src, sizeof(struct it_key));
280 d = tkey.sysno - p->key.sysno;
283 iscz1_encode_int (2*tkey.seqno + 1, dst);
284 iscz1_encode_int (d, dst);
286 p->key.seqno = tkey.seqno;
290 iscz1_encode_int (2*(tkey.seqno - p->key.seqno), dst);
291 p->key.seqno = tkey.seqno;
293 (*src) += sizeof(struct it_key);
297 d = iscz1_decode_int ((unsigned char **) src);
301 p->key.sysno += iscz1_decode_int ((unsigned char **) src);
304 p->key.seqno += d>>1;
305 memcpy (*dst, &p->key, sizeof(struct it_key));
306 (*dst) += sizeof(struct it_key);
310 ISAMC_M key_isamc_m (Res res)
312 static ISAMC_M me = NULL;
317 me = isc_getmethod ();
319 me->compare_item = key_compare;
321 me->code_start = iscz1_code_start;
322 me->code_item = iscz1_code_item;
323 me->code_stop = iscz1_code_stop;
324 me->code_reset = iscz1_code_reset;
326 me->debug = atoi(res_get_def (res, "isamcDebug", "0"));
331 ISAMS_M key_isams_m (Res res)
333 static ISAMS_M me = NULL;
338 me = isams_getmethod ();
340 me->compare_item = key_compare;
342 me->code_start = iscz1_code_start;
343 me->code_item = iscz1_code_item;
344 me->code_stop = iscz1_code_stop;
346 me->debug = atoi(res_get_def (res, "isamsDebug", "0"));
351 ISAMH_M key_isamh_m (Res res)
353 static ISAMH_M me = NULL;
358 me = isamh_getmethod ();
360 me->compare_item = key_compare;
362 me->code_start = iscz1_code_start;
363 me->code_item = iscz1_code_item;
364 me->code_stop = iscz1_code_stop;
365 me->code_reset = iscz1_code_reset;
367 me->debug = atoi(res_get_def (res, "isamhDebug", "9"));
373 int key_SU_code (int ch, char *out)
379 out[i] = 128 + (ch & 63);