2 * Copyright (C) 1994-1995, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.16 1996-05-13 14:23:05 adam
8 * Work on compaction of set/use bytes in dictionary.
10 * Revision 1.15 1995/11/20 16:59:46 adam
11 * New update method: the 'old' keys are saved for each records.
13 * Revision 1.14 1995/10/30 15:08:08 adam
16 * Revision 1.13 1995/10/27 14:00:11 adam
17 * Implemented detection of database availability.
19 * Revision 1.12 1995/10/17 18:02:08 adam
20 * New feature: databases. Implemented as prefix to words in dictionary.
22 * Revision 1.11 1995/10/06 16:33:37 adam
23 * Use attribute mappings.
25 * Revision 1.10 1995/09/29 14:01:41 adam
28 * Revision 1.9 1995/09/28 12:10:32 adam
29 * Bug fixes. Field prefix used in queries.
31 * Revision 1.8 1995/09/28 09:19:42 adam
32 * xfree/xmalloc used everywhere.
33 * Extract/retrieve method seems to work for text records.
35 * Revision 1.7 1995/09/27 12:22:28 adam
36 * More work on extract in record control.
37 * Field name is not in isam keys but in prefix in dictionary words.
39 * Revision 1.6 1995/09/14 07:48:23 adam
40 * Record control management.
42 * Revision 1.5 1995/09/11 13:09:34 adam
43 * More work on relevance feedback.
45 * Revision 1.4 1995/09/08 14:52:27 adam
46 * Minor changes. Dictionary is lower case now.
48 * Revision 1.3 1995/09/07 13:58:36 adam
49 * New parameter: result-set file descriptor (RSFD) to support multiple
50 * positions within the same result-set.
51 * Boolean operators: and, or, not implemented.
52 * Result-set references.
54 * Revision 1.2 1995/09/06 16:11:17 adam
55 * Option: only one word key per file.
57 * Revision 1.1 1995/09/04 09:10:36 adam
58 * More work on index add/del/update.
59 * Merge sort implemented.
60 * Initial work on z39 server.
72 void key_logdump (int logmask, const void *p)
76 memcpy (&key, p, sizeof(key));
77 logf (logmask, "%7d s=%-4d", key.sysno, key.seqno);
80 int key_compare (const void *p1, const void *p2)
83 memcpy (&i1, p1, sizeof(i1));
84 memcpy (&i2, p2, sizeof(i2));
85 if (i1.sysno != i2.sysno)
87 if (i1.sysno > i2.sysno)
93 if (i1.seqno != i2.seqno)
95 if (i1.seqno > i2.seqno)
101 if (i1.freq != i2.freq)
103 if (i1.freq > i2.freq)
112 int key_qsort_compare (const void *p1, const void *p2)
116 char *cp1 = *(char **) p1;
117 char *cp2 = *(char **) p2;
119 if ((r = strcmp (cp1, cp2)))
122 if ((r = key_compare (cp1+l+1, cp2+l+1)))
124 return cp1[l] - cp2[l];
127 int index_char_cvt (int c)
133 int index_word_prefix (char *string, int attset_ordinal,
135 const char *databaseName)
138 sprintf (string, "%s@%c%04d", databaseName,
139 attset_ordinal + '0', local_attribute);
140 for (i = 0; string[i]; i++)
141 string[i] = index_char_cvt (string[i]);