Isn't that the whole point? I mean every time you modify an element in a list, a new
list is created and the old is put in garbage collection queue, where as Herman's struct
would not have that overhead, It seems that Herman's struct would be more efficient than a
list at using memory.
IMHO, the problem is the overhead of getval/setval may be greater than creating a new list.. we shall see
Please continue, I look forward in seeing your results