Can vanilla Mafia add more data structures via ASH?

I find the fact that we only have arrays and TreeMaps to be extremely limiting in terms of data processing. For example, there's no way to have a variable-length list. Being able to use ordered mutable lists, sets, etc. would be extremely helpful to data processing. In addition, unordered data types in Java such as HashMaps and HashSets would greatly enhance the speed of some operations.

However, I don't know how to add these data structures or make an efficient facsimile out of the maps and arrays provided.

What are you really asking?

Is this a feature request for more flexibility in user defined data structures in ash?
Is this a feature request to expose Java functionality in ash?
Is this a request for programming help because if you think the only way to do something is a variable length list then you either need to expand the techniques in your tool box or learn how to wrap an array to provide the same capability?
Perhaps this is a request for some kind of ash library, similar to zlib?
Have you perhaps begun premature optimization, asserting that things you haven't measured can none the less be made more efficient?

professorjellybean said:

Mafia data structures. They kind of suck.

Click to expand...

The above comment, in conjunction with your questions suggests that asking questions concerning how to script something in ash might eventually prove more fruitful than asking for language changes.

The volcano mining script also includes this lovely gem:
Starting out by being insulting isn't a good way to get people to care about what you want. And that function seems pointless to begin with (except for convenience perhaps, but why specify a color for spaces?).