Teodor Sigaev <teodor@sigaev.ru> writes:
>> So I think there's a reasonable case for decreeing that <N> should only
>> match lexemes *exactly* N apart. If we did that, we would no longer have
>> the misbehavior that Jean-Pierre is complaining about, and we'd not need
>> to argue about whether <0> needs to be treated specially.
> Agree, seems that's easy to change.
> ...
> Patch is attached
Hmm, couldn't the loop logic be simplified a great deal if this is the
definition? Or are you leaving it like that with the idea that we might
later introduce another operator with the less-than-or-equal behavior?
regards, tom lane
