I think I'll have to whip up some test code for my THashtables for that next test of yours bradford. :)
Actually, what you should do is a test where you have to scan through the data type for an arbitrary piece of data, and then run tests where that data is at the front of the data type and at the end of the data type. That way you'll have numbers for best case and worst case access times. Of course, I should admit that part of the reason I"m proposing this test is because with data types of any significant size my hash table should be the fastest. ;)
Actually, what you should do is a test where you have to scan through the data type for an arbitrary piece of data, and then run tests where that data is at the front of the data type and at the end of the data type. That way you'll have numbers for best case and worst case access times. Of course, I should admit that part of the reason I"m proposing this test is because with data types of any significant size my hash table should be the fastest. ;)