(Not specifically to you, Horstl)
Although you have a limit on size in a hash table, you can store a binary value to the hash table if you need more data on each item. This does, however, limit searching if you don't know which item to look in ($hfind doesn't help if you're using binary values). I didn't go through the entire thread, but just from the last posts, I don't think this was mentioned. Whether or not that's any use here, or if it's faster to split the items, I'm not sure. Just thought I'd throw it out for anyone who didn't know they can do that.
