More flexible sorted ranges?

[via Digitalmars-d-learn]

On Sunday, 2 November 2014 at 21:35:00 UTC, Xinok wrote:
> 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

It is always easier to look for the examples :-).

> In terms of what to call it, perhaps what you're looking for is 
> "upper set"?
>
> https://en.wikipedia.org/wiki/Upper_set

Hm… I think an "upper set" requires that element is present it in 
the set. I assume you want to be able to do something like:

a.lowerBounded(2).upperBounded(10) and then get "for all x in a 
where 2 <= x <= 10".