Hi hackers!
Currently GiST treats NaN penalty as zero penalty, in terms of
generalized tree this means "perfect fit". I think that this situation
should be considered "worst fit" instead.
Here is a patch to highlight place in the code.
I could not construct test to generate bad tree, which would be fixed
by this patch. There is not so much of cases when you get NaN. None of
them can be a result of usual additions and multiplications of real
values.
Do I miss something? Is there any case when NaN should be considered good fit?
Greg Stark was talking about this in
BANLkTi=d+bPpS1cM4YC8KuKHj63Hwj4LMA@mail.gmail.com but that topic
didn't go far (due to triangles). I'm currently messing with floats in
penalties, very close to NaNs, and I think this question can be
settled.
Regrads, Andrey Borodin.
