.RE
.sp 1
..
-.TH sym 3 "8 May 1999" mLib
+.TH sym 3 "8 May 1999" "Straylight/Edgeware" "mLib utilities library"
.SH NAME
sym \- symbol table manager
.\" @sym_create
to a symbol table entry,
.BI SYM_LEN( s )
returns the length of the symbol's name (excluding any terminating null
-byte);
+byte);
.BI SYM_NAME( s )
returns a pointer to the symbol's name; and
.BI SYM_HASH( s )
.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).
.SH AUTHOR
-Mark Wooding, <mdw@nsict.org>
+Mark Wooding, <mdw@distorted.org.uk>