X-Git-Url: http://jsfdemo.indexdata.com/?a=blobdiff_plain;f=index%2Fkcompare.c;h=3ca6daac23f6567377acb8e12996f50a6e2a11d0;hb=e8acd5b751eb2e7e7fc0470309185984406f561b;hp=c32998e3c8fc88c57ccaa3a6c5136fafe6c27bc6;hpb=6617321a09d4d5bf442feaea2d7f1347acd82e3c;p=idzebra-moved-to-github.git diff --git a/index/kcompare.c b/index/kcompare.c index c32998e..3ca6daa 100644 --- a/index/kcompare.c +++ b/index/kcompare.c @@ -4,7 +4,16 @@ * Sebastian Hammer, Adam Dickmeiss * * $Log: kcompare.c,v $ - * Revision 1.13 1995-10-27 14:00:11 adam + * 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 @@ -70,26 +79,28 @@ void key_logdump (int logmask, const void *p) int key_compare (const void *p1, const void *p2) { - const struct it_key *i1 = p1, *i2 = p2; - if (i1->sysno != i2->sysno) + 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) + if (i1.sysno > i2.sysno) return 2; else return -2; } #if IT_KEY_HAVE_SEQNO - if (i1->seqno != i2->seqno) + if (i1.seqno != i2.seqno) { - if (i1->seqno > i2->seqno) + if (i1.seqno > i2.seqno) return 1; else return -1; } #else - if (i1->freq != i2->freq) + if (i1.freq != i2.freq) { - if (i1->freq > i2->freq) + if (i1.freq > i2.freq) return 1; else return -1; @@ -118,9 +129,10 @@ int index_char_cvt (int c) return tolower (c); } +#if 1 int index_word_prefix (char *string, int attset_ordinal, int local_attribute, - char *databaseName) + const char *databaseName) { int i; sprintf (string, "%s@%c%04d", databaseName, @@ -129,4 +141,4 @@ int index_word_prefix (char *string, int attset_ordinal, string[i] = index_char_cvt (string[i]); return i; } - +#endif