The implementation is not complete. Many decisions have been left to
the user, including:
.hP \*o
-How keys should be represented, hashed and compared.
+how keys should be represented, hashed and compared;
.hP \*o
-How objects contained within the table should be allocated.
+how objects contained within the table should be allocated; and
.hP \*o
-When the hashtable should be extended.
+when the hashtable should be extended.
.PP
A complete hashtable implementation will need to take the above
decisions. If you just want a prepackaged solution, see
.BR sym (3),
.BR mLib (3).
.SH "AUTHOR"
-Mark Wooding, <mdw@nsict.org>
+Mark Wooding, <mdw@distorted.org.uk>