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

[capmikee]

@matt w

Hm, so are lists memory-hoggy? My IF-Demo busted right through the z-machine limits with eight objects, each associated with one table with between four and ten rows – but each row has a list with between two and five elements. [Besides this, there’s pretty much the bare minimum – a starting location and a yourself object, both completely nominal.]

Given that the lists are static but I need to access them randomly, is there a more efficient way to do it? It seems like the most ideal thing would be some kind of table within a table, but the only way I can think of to do that is to replace every list entry with a pointer to a new table, and the prospect of coding 62 more tables makes me want to curl up into a ball.

Table access is pretty fast. Can you make a big table that has a two-column key?