What's the least memory intensive data structure in i7?

[quotes]
Hm, so are lists memory-hoggy?
[/quotes]
Lists are memory-hoggy because I7 doesn’t just reserve memory for the data, it reserves memory for how much you might expand the lists dynamically during the game. Of course it’s only guessing about this, and it doesn’t know when you create a list that you intend to never expand. The memory usage increases in jumps, so I’m not sure how to estimate it (estimating I7’s estimate!) but that’s what’s going on.

Tables don’t have this problem. If you wanted to be really parsimonious, you’d make a new data structure based on static I6 arrays, but it doesn’t sound like you’ve got so much data that you’d need to think about that.