Dynamic arrays in D 1.0

[Me Here]

boyd wrote:

> Delete and Insert on the other hand are higher level and generally more  
> intuitive. They leave optimization to the compiler/library. And I think  
> most D-users like more control of optimizations than users of more high  
> level languages.

You really think that slice and join will be more efficient, or afford greater
opportunities for optimisation than insert & delete?

Can I suggest that you produce a simple (or complex) benchmark to demonstrate
that?

b.
--