X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~mdw/git/mLib/blobdiff_plain/fbf20b5bd30e237c383ed290428261f28dfa5803..6f444bda1b7deb31cf7fb2395cb0993c3e3b8c42:/man/sym.3

diff --git a/man/sym.3 b/man/sym.3
index fb45af9..967d024 100644
--- a/man/sym.3
+++ b/man/sym.3
@@ -224,10 +224,13 @@ for (sym_mkiter(&i, t); (v = sym_next(&i)) != 0; ) {
 .VE
 That ought to be enough examples to be getting on with.
 .SS Implementation
-The symbol table is an extensible hashtable, using a 32-bit CRC as the
-hash function.  The hash chains are kept very short (probably too short,
-actually).  Every time a symbol is found, its block is promoted to the
-front of its bin chain so it gets found faster next time.
+The symbol table is an extensible hashtable, using the universal hash
+function described in
+.BR unihash (3)
+and the global hashing key.  The hash chains are kept very short
+(probably too short, actually).  Every time a symbol is found, its block
+is promoted to the front of its bin chain so it gets found faster next
+time.
 .SH SEE ALSO
 .BR hash (3),
 .BR mLib (3).