2 * Copyright (C) 1994-1995, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.10 1995-09-29 14:01:41 adam
10 * Revision 1.9 1995/09/28 12:10:32 adam
11 * Bug fixes. Field prefix used in queries.
13 * Revision 1.8 1995/09/28 09:19:42 adam
14 * xfree/xmalloc used everywhere.
15 * Extract/retrieve method seems to work for text records.
17 * Revision 1.7 1995/09/27 12:22:28 adam
18 * More work on extract in record control.
19 * Field name is not in isam keys but in prefix in dictionary words.
21 * Revision 1.6 1995/09/14 07:48:23 adam
22 * Record control management.
24 * Revision 1.5 1995/09/11 13:09:34 adam
25 * More work on relevance feedback.
27 * Revision 1.4 1995/09/08 14:52:27 adam
28 * Minor changes. Dictionary is lower case now.
30 * Revision 1.3 1995/09/07 13:58:36 adam
31 * New parameter: result-set file descriptor (RSFD) to support multiple
32 * positions within the same result-set.
33 * Boolean operators: and, or, not implemented.
34 * Result-set references.
36 * Revision 1.2 1995/09/06 16:11:17 adam
37 * Option: only one word key per file.
39 * Revision 1.1 1995/09/04 09:10:36 adam
40 * More work on index add/del/update.
41 * Merge sort implemented.
42 * Initial work on z39 server.
54 void key_logdump (int logmask, const void *p)
58 memcpy (&key, p, sizeof(key));
59 logf (logmask, "%7d s=%-4d", key.sysno, key.seqno);
62 int key_compare (const void *p1, const void *p2)
64 const struct it_key *i1 = p1, *i2 = p2;
65 if (i1->sysno != i2->sysno)
67 if (i1->sysno > i2->sysno)
73 if (i1->seqno != i2->seqno)
75 if (i1->seqno > i2->seqno)
81 if (i1->freq != i2->freq)
83 if (i1->freq > i2->freq)
92 int key_qsort_compare (const void *p1, const void *p2)
96 char *cp1 = *(char **) p1;
97 char *cp2 = *(char **) p2;
99 if ((r = strcmp (cp1, cp2)))
102 if ((r = key_compare (cp1+l+1, cp2+l+1)))
104 return cp1[l] - cp2[l];
107 int index_char_cvt (int c)
112 int index_word_prefix (char *string, int attrSet, int attrUse)
114 sprintf (string, "%c%04d", attrSet + '0', attrUse);