Sorted Array Wrapper Range

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

On Saturday, 6 December 2014 at 14:14:18 UTC, Tobias Pankrath 
wrote:
> Because a RandomAccessRange has no means to grow in general. 
> Compare your proposed wrapper to 
> http://dlang.org/phobos/std_container.html#.BinaryHeap

So what should the basic operations in a SortedRange wrapper 
template be? And how should the wrapped type be restricted?