Teodor Sigaev <teo...@sigaev.ru> writes: > Tom Lane wrote: >> 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?
> Do you suggest something like merge join of two sorted lists? ie: > ... > Such algorithm finds closest pair of (Lpos, Rpos) but satisfying pair could > be > not closest, example: to_tsvector('simple', '1 2 1 2') @@ '1 <3> 2'; Oh ... the indexes in the lists don't have much to do with the distances, do they. OK, maybe it's not quite as easy as I was thinking. I'm okay with the patch as presented. regards, tom lane -- Sent via pgsql-hackers mailing list (email@example.com) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers