Randy Kramer wrote:
> But (just asking), what about performance?  Is an entire new array created, or 
> is the new stuff (only) put in a newly allocated piece of memory and a 
> pointer/reference/whatever inserted into (maybe a linked list which 
> implements) the array?

Don't know. Don't care. Do you think your application's performance will 
be dominated by array insertions and deletions?

Not too mention, the standard Array methods are written in C. I have no 
reason to think that manipulating a Ruby-based linked list with Ruby 
code would be faster.