Tansin A. Darcos (TDARCOS) wrote:

Entropy Stew wrote:

Read a book, read a book, read a motherfucking book.

I suggest that you learn something about programming, I don't need to "read a book" in this instance because it is clear that you do not know what you're talking about and I'll take real-world, operating code that works over some claims that do not relate to reality.

A hash table is used where someone uses a hash function to determine the insertion point of an item.

I do not use the array as a hash table because I never insert anything into the table/array. The array of pointers just makes it easier to separate items by the first character.

This is why I don't have to use a tree structure, I use the array of pointers to select by the first letter.

I never store any items in the array, thus it is neither a hash table nor are any of the elements hash buckets.

If you want to argue that a linked list of pointers might represent a hash table, since it is using an index into memory (the pointer) that I might agree on. But not in this case.