Sorted Array Wrapper Range

["Nordlöw" via Digitalmars-d-learn]

Have anybody written a generic automatically sorted range wrapper 
for RandomAccessRanges?

I guess

http://dlang.org/library/std/range/assumeSorted.html

should play a key role.

I see two typical variants:

- Direct: Always sorts on write() and modify()
- Lazy: Sorts lazily on read()

read() of course uses binarySearch