On Sun, Feb 18, 2007 at 08:14:00PM +0200, Hannu Krosing wrote:
> > but I can promise you you can't make it work with btree.
> Sorry to hear that. btree seemed like the best candidate for doing it.

The problem with btree is that it's designed to work with a compare
function which compares two datums and returns greater than, equal to
or less than. You can't build such an operator for intervals, so
there's a problem.

However, if you decree that a zero return value mean "collision for the
purposes of a unique index" then you could probably make it work.
*However* using it for lookups probably won't work very well then...

Have a nice day,
Martijn van Oosterhout   <kleptog@svana.org>   http://svana.org/kleptog/
> From each according to his ability. To each according to his ability to 
> litigate.

Attachment: signature.asc
Description: Digital signature

Reply via email to