Tables PreviousNext

Tables are data structures whose items are accessible by keys. One possible implementation of tables is hash tables. No optimization effort has been made when writing DS_HASH_TABLE. In particular it doesn't take advantage of the well known algorithm using prime numbers when collisions occur. The implementation used here is very simple and was deemed satisfactory enough for its usage in the Gobo Eiffel Lexical Library. It is likely though that this class will be improved in future releases.


Copyright © 1997, Eric Bezault
mailto:
ericb@gobo.demon.co.uk
http:
//www.gobo.demon.co.uk
Last Updated: 17 December 1997

HomeTocPreviousNext