it's due to the way hash tables are stored internally. every item name you add is passed through a simple hashing algorithm to produce an integer whose range of values is exactly the number of 'slots' in your hash table. if the resulting integer collides with another previously hashed item name, the corresponding data is stored at the same location and is linked to the ones that already exist. this linked list does preserve order, with the obvious trade off of mIRC having to traverse a list to retrieve data from an item name. you lose the actual utility of a hash table, which is its ability to reference data from the item name in constant time. the time it takes with a size 1 hash table is now proportional to the number of items in the table

if you need some semblance of order, you're better of using a @window which allows you to insert/remove items comfortably



"The only excuse for making a useless script is that one admires it intensely" - Oscar Wilde