Fully Generic, Fully Dynamic Hash Tables

   Author  : Eric C. Wentz
   Phone   : 1-703-860-3807  (Before 11 P.M. Eastern)
   C_Serve : 72070,1015

   UNIT REQUIREMENTS:  Requires Unit GENDATUM
                       HTable.Arc Includes version 1.1
                       of Unit GenDatum -- previously
                       uploaded in GENERI.ARC -- soon to
                       be uploaded in GENER2.ARC.
                       (GenTable will work just fine
                       with either version of GenDatum)
                       Also requires the all-pervasive
                       Unit FLEXPNTR -- found in unit
                       GENERI.ARC (GenDatum needs it)
                       You're right -- shameless of me
                       to force you to download another
                       of my uploads!

   For all you "OverLay Cowboys" out there, GenTable IS
   compiled in the O+ state.


Implements a String-keyed Hash Table of Generic Datum Objects

The Hash Tables defined herein use the External Chaining solution
for hashing. The Hashing Function used IS case-sensitive.

Data to be entered into the Hash Table is loaded into a Generic
Object (EntryRec) and then the EntryRec is Inserted/Appended into
the Hash Table location determined by the Key string associated
with the entry.  Retrieval is accomplished by a similar, albeit
reversed, process -- with the obvious exception that the entry is
not deleted.  Keys may be examined for Membership in the Hash
Table, or a boolean Found may be returned by Retrieve.  Duplicate
Keys will not be inserted,