Re: Sorted Array Wrapper Range

[Nordlöw]

On Thursday, 4 December 2014 at 07:58:25 UTC, Tobias Pankrath 
wrote:
I see two typical variants:

- Direct: Always sorts on write() and modify()
- Lazy: Sorts lazily on read()
read() of course uses binarySearch

You won't be able to grow that range, would you?

Why, because of slice invalidation?