sunil_h_v wrote: > hi everyone, > > I am interested in knowing what a hash table is, its use, its > implementation. > > what is the difference between a hash table and a hash function ? > > Is hash table similar to a look up table ? > > How should i go about implementing a hash table ? > Is the table a data structure by itself or should i implement is using > linked lists or arrays for that matter ? > > Regards, > > Sunil.
http://en.wikipedia.org/wiki/Hash_table Personally, I have two hash table templates I use: FastPartialHash<> and FastCompleteHash<> (plus two slower variations I don't really use any more). Partial hash tables are extremely useful in caching situations. Complete hash tables are useful in scenarios where everything has to be stored. FastPartialHash<> is just a flat array. FastCompleteHash<> is a flat array that uses a linked list for each array element to manage hash collisions (Wikipedia calls this "chained hashing" - I prefer the term "complete hash" - my brain comprehends it better). -- Thomas Hruska CubicleSoft President Ph: 517-803-4197 *NEW* MyTaskFocus 1.1 Get on task. Stay on task. http://www.CubicleSoft.com/MyTaskFocus/
