/*
- * Copyright (C) 1994-1995, Index Data I/S
+ * Copyright (C) 1994-1998, Index Data I/S
* All rights reserved.
* Sebastian Hammer, Adam Dickmeiss
*
* $Log: kcompare.c,v $
- * Revision 1.13 1995-10-27 14:00:11 adam
+ * Revision 1.23 1998-03-05 08:45:12 adam
+ * New result set model and modular ranking system. Moved towards
+ * descent server API. System information stored as "SGML" records.
+ *
+ * Revision 1.22 1997/09/22 12:39:06 adam
+ * Added get_pos method for the ranked result sets.
+ *
+ * Revision 1.21 1997/09/17 12:19:13 adam
+ * Zebra version corresponds to YAZ version 1.4.
+ * Changed Zebra server so that it doesn't depend on global common_resource.
+ *
+ * Revision 1.20 1996/12/23 15:30:44 adam
+ * Work on truncation.
+ * Bug fix: result sets weren't deleted after server shut down.
+ *
+ * Revision 1.19 1996/12/11 12:08:00 adam
+ * Added better compression.
+ *
+ * Revision 1.18 1996/10/29 14:09:44 adam
+ * Use of cisam system - enabled if setting isamc is 1.
+ *
+ * Revision 1.17 1996/06/04 10:18:58 adam
+ * Minor changes - removed include of ctype.h.
+ *
+ * Revision 1.16 1996/05/13 14:23:05 adam
+ * Work on compaction of set/use bytes in dictionary.
+ *
+ * Revision 1.15 1995/11/20 16:59:46 adam
+ * New update method: the 'old' keys are saved for each records.
+ *
+ * Revision 1.14 1995/10/30 15:08:08 adam
+ * Bug fixes.
+ *
+ * Revision 1.13 1995/10/27 14:00:11 adam
* Implemented detection of database availability.
*
* Revision 1.12 1995/10/17 18:02:08 adam
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
-#include <ctype.h>
#include <assert.h>
#include "index.h"
logf (logmask, "%7d s=%-4d", key.sysno, key.seqno);
}
-int key_compare (const void *p1, const void *p2)
+int key_compare_it (const void *p1, const void *p2)
{
- const struct it_key *i1 = p1, *i2 = p2;
- if (i1->sysno != i2->sysno)
+ if (((struct it_key *) p1)->sysno != ((struct it_key *) p2)->sysno)
{
- if (i1->sysno > i2->sysno)
+ if (((struct it_key *) p1)->sysno > ((struct it_key *) p2)->sysno)
return 2;
else
return -2;
}
-#if IT_KEY_HAVE_SEQNO
- if (i1->seqno != i2->seqno)
+ if (((struct it_key *) p1)->seqno != ((struct it_key *) p2)->seqno)
{
- if (i1->seqno > i2->seqno)
+ if (((struct it_key *) p1)->seqno > ((struct it_key *) p2)->seqno)
return 1;
else
return -1;
}
-#else
- if (i1->freq != i2->freq)
+ return 0;
+}
+
+int key_compare (const void *p1, const void *p2)
+{
+ struct it_key i1, i2;
+ memcpy (&i1, p1, sizeof(i1));
+ memcpy (&i2, p2, sizeof(i2));
+ if (i1.sysno != i2.sysno)
+ {
+ if (i1.sysno > i2.sysno)
+ return 2;
+ else
+ return -2;
+ }
+ if (i1.seqno != i2.seqno)
{
- if (i1->freq > i2->freq)
+ if (i1.seqno > i2.seqno)
return 1;
else
return -1;
}
-#endif
return 0;
}
return cp1[l] - cp2[l];
}
-int index_char_cvt (int c)
+int key_get_pos (const void *p)
+{
+ struct it_key key;
+ memcpy (&key, p, sizeof(key));
+ return key.seqno;
+}
+
+struct iscz1_code_info {
+ struct it_key key;
+};
+
+static void *iscz1_code_start (int mode)
+{
+ struct iscz1_code_info *p = xmalloc (sizeof(*p));
+ p->key.sysno = 0;
+ p->key.seqno = 0;
+ return p;
+}
+
+static void iscz1_code_stop (int mode, void *p)
{
- return tolower (c);
+ xfree (p);
}
-int index_word_prefix (char *string, int attset_ordinal,
- int local_attribute,
- char *databaseName)
+void iscz1_encode_int (unsigned d, char **dst)
{
- int i;
- sprintf (string, "%s@%c%04d", databaseName,
- attset_ordinal + '0', local_attribute);
- for (i = 0; string[i]; i++)
- string[i] = index_char_cvt (string[i]);
- return i;
+ unsigned char *bp = (unsigned char*) *dst;
+
+ if (d <= 63)
+ *bp++ = d;
+ else if (d <= 16383)
+ {
+ *bp++ = 64 + (d>>8);
+ *bp++ = d & 255;
+ }
+ else if (d <= 4194303)
+ {
+ *bp++ = 128 + (d>>16);
+ *bp++ = (d>>8) & 255;
+ *bp++ = d & 255;
+ }
+ else
+ {
+ *bp++ = 192 + (d>>24);
+ *bp++ = (d>>16) & 255;
+ *bp++ = (d>>8) & 255;
+ *bp++ = d & 255;
+ }
+ *dst = (char *) bp;
+}
+
+int iscz1_decode_int (unsigned char **src)
+{
+ unsigned c = *(*src)++;
+ switch (c & 192)
+ {
+ case 0:
+ return c;
+ case 64:
+ return ((c & 63) << 8) + *(*src)++;
+ case 128:
+ c = ((c & 63) << 8) + *(*src)++;
+ c = (c << 8) + *(*src)++;
+ return c;
+ }
+ c = ((c & 63) << 8) + *(*src)++;
+ c = (c << 8) + *(*src)++;
+ c = (c << 8) + *(*src)++;
+ return c;
+}
+
+static void iscz1_code_item (int mode, void *vp, char **dst, char **src)
+{
+ struct iscz1_code_info *p = vp;
+ struct it_key tkey;
+ int d;
+
+ if (mode == ISAMC_ENCODE)
+ {
+ memcpy (&tkey, *src, sizeof(struct it_key));
+ d = tkey.sysno - p->key.sysno;
+ if (d)
+ {
+ iscz1_encode_int (2*tkey.seqno + 1, dst);
+ iscz1_encode_int (d, dst);
+ p->key.sysno += d;
+ p->key.seqno = tkey.seqno;
+ }
+ else
+ {
+ iscz1_encode_int (2*(tkey.seqno - p->key.seqno), dst);
+ p->key.seqno = tkey.seqno;
+ }
+ (*src) += sizeof(struct it_key);
+ }
+ else
+ {
+ d = iscz1_decode_int ((unsigned char **) src);
+ if (d & 1)
+ {
+ p->key.seqno = d>>1;
+ p->key.sysno += iscz1_decode_int ((unsigned char **) src);
+ }
+ else
+ p->key.seqno += d>>1;
+ memcpy (*dst, &p->key, sizeof(struct it_key));
+ (*dst) += sizeof(struct it_key);
+ }
+}
+
+ISAMC_M key_isamc_m (Res res)
+{
+ static ISAMC_M me = NULL;
+
+ if (me)
+ return me;
+
+ me = isc_getmethod ();
+
+ me->compare_item = key_compare;
+
+ me->code_start = iscz1_code_start;
+ me->code_item = iscz1_code_item;
+ me->code_stop = iscz1_code_stop;
+
+ me->debug = atoi(res_get_def (res, "isamcDebug", "0"));
+
+ return me;
}
projects / idzebra-moved-to-github.git / blobdiff