ossp-pkg/act/act_hash_lh.c 1.5 -> 1.6
--- act_hash_lh.c 2000/08/19 10:37:17 1.5
+++ act_hash_lh.c 2000/08/19 14:21:08 1.6
@@ -33,6 +33,27 @@
** collision chains as the backend data structure. Some ideas were
** taken over from MIKAEL PETTERSON's Linear Hashing enhancements
** (1993).
+**
+** The internal structure of the linear hashing table is illustrated in
+** the following figure:
+**
+** -----BEGIN EMBEDDED OBJECT-----
+** Content-type: application/fig
+** Description: linear hashing structure layout
+** Version: eo/1.0
+** H4sIAKaXnjkCA5WRzwrCMAyHz+YpAp430nR/3FlQBrv5BGMWFWSI2/tjG9uuNy2l
+** 9Gt/5SMk+1N/Rl0yDON8XabxZeBo5tW8oZ+nu1lgMKu9IYIiKong8phvTwMFg2Ii
+** ZGBkJFR2t1iTPQrL9qfD78WuGnZY2dTtjrYzZZ//L1TaG1WTgtQl2UZZXla+Gq5S
+** ELlkG+V5D75MTZRA49rooghZVq2DLDRYwMkkipBnbYMsjEZAZG2dQJa14jDnMDoB
+** J5MoQv681IHCnCJJeyXdyKVWrX+rtVOLsAtNFYpv8AGUMVDTPQMAAA==
+** -----END EMBEDDED OBJECT-----
+**
+** As you can see, it consists of four levels of memory chunks:
+** 1. the top-level structure one sees in the API
+** 2. the hash table consisting of a single directory and one or
+** more directory segments
+** 3. the collision chain consisting of element structures
+** 4. the actual elements consisting of key and value structures
*/
#include "act_p.h"
|
|
