Thanks Kelder, that cleared a lot of things up. So technically there is no relationship to the number of entries in a hash table and the amount of time it takes to search it with something like hfind? fex it should take no longer to search a 4000 slot table with 40,000 items than it would to to search a 40 slot table with 400 items?
And yeah, was there a second part to the last sentance in your post "You should realize that if the hash function..."
