* Sebastian Hammer, Adam Dickmeiss
*
* $Log: index.h,v $
- * Revision 1.15 1995-10-04 16:57:19 adam
+ * 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
#define IT_KEY_HAVE_FIELD 0
struct it_key {
- int sysno : 24;
- int seqno : 16;
+ int sysno;
+ int seqno;
};
struct dir_entry {
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_input2 (const char *dict_fname, const char *isam_fname,
+void key_input (const char *dict_fname, const char *isam_fname,
int nkeys, int cache);
int merge_sort (char **buf, int from, int to);