On May 8, 2009, at 12:38 PM, Jeff Johnson wrote:

>
> On May 8, 2009, at 12:29 PM, Jeff Johnson wrote:
>>
>>
>> RPM versions are inequalities represented as half-planes, not points.
>
> "half-planes" is of course neither precise nor correct. But
> RPM EVR inequalities do not always have measure == 0 like
> points do.
>

My other explanantion may have not been specfic to the
single point ;-) my comment was directed at.

My specific comment was trying to point out  that the inequality itself,
not the EVR end-point, with all the gory details of versioning,
is a cleaner abstraction.

Exposing a boolean method to evaluate
	Do inequality ranges overlap?
with a TRUE/FALSE result is intrinsically simpler design
than all the gory details of EVR precedence and internal structure.

The inequalities already have all the necessary details to
evaluate
	Do inequality ranges overlap?
that otherwise need to be retrofitted around a comparison scheme
using (*rpmvercmp) and some data points and flags used to qualify
how the comparison(s) should be done.

But sure, one can quite easily describe inequalities knowing
their boundary point (if supplied enough other qualifying details)

73 de Jeff