More flexible sorted ranges?

[Xinok via Digitalmars-d-learn]

On Sunday, 2 November 2014 at 20:06:51 UTC, Ola Fosheim Grøstad 
wrote:
> On Sunday, 2 November 2014 at 19:54:38 UTC, Xinok wrote:
>> D got it right. C++ returns an iterator which can be a bit 
>> confusing. D returns a slice so it's meaning is much clearer.
>>
>
> No, according to docs D has defined the lower bound to be the 
> negation of the lower bound…
>

Sorry, you're right, it's not an "upper bound". I read that 
definition a few times over and still got it wrong. O_o

In terms of what to call it, perhaps what you're looking for is 
"upper set"?

https://en.wikipedia.org/wiki/Upper_set