I've been benchmarking a bit to see how different things work (in Arturo) and one of these is: concatenation/appending-to an array vs a string.
The exact same operation is slower for arrays than for strings. Which is not so surprising. What _is_ surprising is that what I'm calculating is roughly ~150 times slower. And yes, there must be some Arturo-related overhead, but I assure you it has nothing to do with such a difference. So... obviously, I look into it array implementation and the culprit seems to be a constant copying of the array in question - which is not the case for strings, although supposedly we are talking about something extremely similar (arrays of characters vs arrays of something else). So... the question is... is there any other approach to this, so that the 2 operations don't differ in performance in such an extreme way?
