On 9/9/2015 6:54 AM, Eduardo Morras wrote: > Yes, the comparison operators work correctly and the b-tree binary search > should give correct answers, the only tweak is in xCompare, that returns 0 > when left(x) and rigth($value) expressions distance is lower than a threshold.
A comparison like this would not generally be a proper collation. The equivalence relation it induces is not transitive - it's possible to have A == B and B == C but A != C (when A is "close enough" to B and B is "close enough" to C, but A and C are just far enough from each other). -- Igor Tandetnik
