I know everyone loves hash tables when dealing with arrays in mIRC because its "faster" and more "efficient". My question is, has anyone ever actually benchmarked this time difference, and if so, could they post the results?
I'm really not buying the whole hash tables are oh so much better belief, since generally, most speedups in mIRC script are non-noticeable. My hypothesis is that any array with elements under a couple hundred would be accessed just as quickly as a hash table with as many elements.. Can someone prove/disprove this?
