"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 ... regards, tom lane ---------------------------(end of broadcast)--------------------------- TIP 1: if posting/reading through Usenet, please send an appropriate subscribe-nomail command to [EMAIL PROTECTED] so that your message can get through to the mailing list cleanly