Manfred Koizar <mkoi-pg@aon.at> writes:
> comparetup_index() compares two IndexTuples. The structure
> IndexTupleData consists basically of not much more than an ItemPointer,
> and the patch is not much more than adding a comparison of two
> ItemPointers. So how does the patch introduce a new low level
> implementation dependency?
Because it sorts on tuple position, which is certainly about as low
level as you can get. More to the point, though, no evidence has been
provided that this is a good idea.
regards, tom lane