On 2005-11-22, at 15:45, Tom Lane wrote:

"Kevin McArthur" <[EMAIL PROTECTED]> writes:
This is acceptable to create a unique constraint, however, we cannot mark the column unique, without defining btree operators, which clearly are not possible for sorting. Is there any way to base the operators based on the text representation of the type for strict equality (not to be confused with same or equivilent) and thus use that not as an ordering method, but as a
simple equality for uniqueness.

Translation: you do know how to define a sortable order (ie, generate
the text version and compare); you're just too lazy to create the
operators to do it ...
We do have WORKING < , > , etc operators, and ::text cast already.
Thing is, can I have btree and gist indexes at the same time ?


--
GJ

"If we knew what we were doing, it wouldn't be called Research, would it?" - AE




---------------------------(end of broadcast)---------------------------
TIP 5: don't forget to increase your free space map settings

Reply via email to