Uses new record management system in both indexer and server.

[idzebra-moved-to-github.git] / index / index.h

diff --git a/index/index.h b/index/index.h
index 1d8ea48..9ebf430 100644 (file)
--- a/index/index.h
+++ b/index/index.h
@@ -4,7 +4,31 @@
  * Sebastian Hammer, Adam Dickmeiss
  *
  * $Log: index.h,v $
- * Revision 1.13  1995-09-28 14:22:56  adam
+ * Revision 1.21  1995-11-16 15:34:55  adam
+ * Uses new record management system in both indexer and server.
+ *
+ * Revision 1.20  1995/11/15  14:46:18  adam
+ * Started work on better record management system.
+ *
+ * Revision 1.19  1995/10/27  14:00:11  adam
+ * Implemented detection of database availability.
+ *
+ * Revision 1.18  1995/10/17  18:02:08  adam
+ * New feature: databases. Implemented as prefix to words in dictionary.
+ *
+ * Revision 1.17  1995/10/13  16:01:49  adam
+ * Work on relations.
+ *
+ * Revision 1.16  1995/10/10  12:24:38  adam
+ * Temporary sort files are compressed.
+ *
+ * Revision 1.15  1995/10/04  16:57:19  adam
+ * Key input and merge sort in one pass.
+ *
+ * Revision 1.14  1995/09/29  14:01:40  adam
+ * Bug fixes.
+ *
+ * Revision 1.13  1995/09/28  14:22:56  adam
  * Sort uses smaller temporary files.
  *
  * Revision 1.12  1995/09/28  12:10:32  adam
@@ -57,8 +81,8 @@
 #define IT_KEY_HAVE_FIELD 0
 
 struct it_key {
-    int   sysno : 24;
-    int   seqno : 16;
+    int   sysno;
+    int   seqno;
 };
 
 struct dir_entry {
@@ -68,25 +92,33 @@ struct dir_entry {
 struct dir_entry *dir_open (const char *rep);
 void dir_sort (struct dir_entry *e);
 void dir_free (struct dir_entry **e_p);
-void repository (int cmd, const char *rep, const char *base_path);
+void repository (int cmd, const char *rep, const char *base_path,
+                 char *databaseName);
 
-void file_extract (int cmd, const char *fname, const char *kname);
+void file_extract (int cmd, const char *fname, const char *kname,
+                   char *databaseName);
 
 void key_open (int mem);
 int key_close (void);
 void key_write (int cmd, struct it_key *k, const char *str);
 int key_compare (const void *p1, const void *p2);
+int key_qsort_compare (const void *p1, const void *p2);
 void key_logdump (int mask, const void *p);
-void key_input (const char *dict_fname, const char *isam_fname, 
-                const char *key_fname, int cache);
+void key_input (const char *dict_fname, const char *isam_fname,
+                 int nkeys, int cache);
 int merge_sort (char **buf, int from, int to);
 
 #define TEMP_FNAME  "keys%d.tmp"
 #define FNAME_WORD_DICT "worddict"
 #define FNAME_WORD_ISAM "wordisam"
 #define FNAME_FILE_DICT "filedict"
+
+#define RECORD_BASE 1
+
+#if !RECORD_BASE
 #define FNAME_SYS_IDX "sysidx"
 #define SYS_IDX_ENTRY_LEN 120
+#endif
 
 struct strtab *strtab_mk (void);
 int strtab_src (struct strtab *t, const char *name, void ***infop);
@@ -94,4 +126,6 @@ void strtab_del (struct strtab *t,
                  void (*func)(const char *name, void *info, void *data),
                  void *data);
 int index_char_cvt (int c);
-int index_word_prefix (char *string, int attrSet, int attrUse);
+int index_word_prefix (char *string, int attset_ordinal,
+                       int local_attribute, char *databaseName);
+