Jesse Farmer wrote:
> And arrays ARE the fastest form of managing lists of data in Ada right? As
> opposed to linked lists (which are faster in C)?
If you turn off Ada's run-time checks, both arrays and linked lists
should be just as fast in Ada as in C.
> This is probably the best way to do this isn't it? Via global arrays?
I don't really know what he's trying to accomplish, so I can't say what
the best way to do it is. If I did say what the best way is, I'm sure
others would disagree. I have never encountered a situation in which
global variables were necessary or the best way to do something.
"You empty-headed animal-food-trough wiper."
Monty Python & the Holy Grail