I dont see any possible advantage of alphanumeric sorting of hash tables, or even ini files.
The only way to achieve any level of hash table sorting (without somewhat defeating the purpose of using a hash table to begin with) is to lable the item names accordingly (i have often just used generic item names, a string of numbers, increasing each time something is added). To sort you simply have to use a /filter on the 'data' parts from the hash table, then write it back to the hash table line by line using a unique auto incrementing id as the item name (or any other ascending string). Check out /filter -k
Text files can easily be sorted with the use of /filter and /f* file commands.
Given the way ini files and read from and written to, it makes the order in which data is stored somewhat meaningless. I can not think of any reason for mirc to specifically implement and sorting function for it. However, you could most likely shove something together with the use of the $ini identifier. With the $ini identifier you can count the number of sections in an ini file... read the name of each section, sort them, then for each section you do the same with the item names, counting/reading/sorting, then use readini/writeini to rewrite the file in the new order. (actually, you can use this method on hash tables also, by sorting the saved ini file and reloading it after, but its certainly more effort than the other method)
Last edited by Om3n; 14/04/07 02:40 PM.