Originally Posted By: hixxy
I'd love to see an array structure with similar implementation to hashtables.

/amake <name>
/aadd [-m] <name> [index] <data> ** if [index] is specified it will overwrite that index.
/adel <name> <index>
/ainsert [-m] <name> <index> <data> ** [-m] means the same as it does with hashtables. Create array if it doesn't already exist.
/afree <name>
$aget(name,index)
$afind(name,text[,nwWrR])[.data]

With an array being a list that maintains order then obviously insert/overwrite commands would be beneficial too. Then a switch for /filter to act on arrays would be good.
I've just seen your ideas, what's the difference with what you suggest and hash table method ? I've don't see any difference, it does exactly the same thing, just have to suggest /hins [-m] <name> <item> <data>, assuming that you're using number as item (would be a nice idea).
However, the switch for /filter could be very useful, how you think it would work ? I have an idea, but just to see if it's the same, this could be very very useful as well smile


Looking for a good help channel about mIRC? Check #mircscripting @ irc.swiftirc.net