I have been attempting to create an associative array that keeps track of window IDs by inserting the ID as the key and a data object as the value. When a window I am tracking is closed I remove it from the array. What I've found is that when using the array.Remove(key), all of the keys with a key ID that is greater than the one being removed (or inserted) are adjusted up/down by one. So now if I have a bunch of tracked windows and close one with an ID in the middle - all of the IDs higher end up getting deleted also since the ID is now corrupted.
Here is an example of what I'm doing:
Code:
Array := {1: 1, 2: 2, 3: 3, 4: 4}
output =
enum := Array._NewEnum()
While enum[key, value]
output = %output%`nkey(%key%) value(%value%)
MsgBox, %output%
MsgBox, Remove key 2
Array.Remove(2)
output =
enum := Array._NewEnum()
While enum[key, value]
output = %output%`nkey(%key%) value(%value%)
MsgBox, %output%
; chrome
The basis for this code was taken directly out of the AHK_L description for associative arrays - What am I missing here - Associative arrays shouldn't work this way
Login
Register
FAQ
Search
