New result set model and modular ranking system. Moved towards

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

diff --git a/index/recindxp.h b/index/recindxp.h
index a0d9d4c..8776726 100644 (file)
--- a/index/recindxp.h
+++ b/index/recindxp.h
@@ -4,7 +4,21 @@
  * Sebastian Hammer, Adam Dickmeiss
  *
  * $Log: recindxp.h,v $
- * Revision 1.1  1995-12-06 12:41:25  adam
+ * Revision 1.4  1998-03-05 08:45:12  adam
+ * New result set model and modular ranking system. Moved towards
+ * descent server API. System information stored as "SGML" records.
+ *
+ * Revision 1.3  1995/12/11 11:45:55  adam
+ * Removed commented code.
+ *
+ * Revision 1.2  1995/12/11  09:12:51  adam
+ * The rec_get function returns NULL if record doesn't exist - will
+ * happen in the server if the result set records have been deleted since
+ * the creation of the set (i.e. the search).
+ * The server saves a result temporarily if it is 'volatile', i.e. the
+ * set is register dependent.
+ *
+ * Revision 1.1  1995/12/06  12:41:25  adam
  * New command 'stat' for the index program.
  * Filenames can be read from stdin by specifying '-'.
  * Bug fix/enhancement of the transformation from terms to regular
@@ -25,7 +39,6 @@ struct records_info {
     char *index_fname;
     BFile index_BFile;
 
-
     char *data_fname[REC_BLOCK_TYPES];
     BFile data_BFile[REC_BLOCK_TYPES];
 
@@ -62,14 +75,7 @@ struct record_cache_entry {
 };
 
 struct record_index_entry {
-    union {
-        struct {
-            int next;
-            int size;
-        } used;
-        struct {
-            int next;
-        } free;
-    } u;
+    int next;         /* first block of record info / next free entry */
+    int size;         /* size of record or 0 if free entry */
 };