[Date Prev][Date Next]
Re: ordered indexing for integers
Howard Chu writes:
> I was thinking of a fixed word size. Anything with variable length
> will require a custom B-tree sort function, and we really don't want
> to go there. 8-byte keys representing 64 bit integers would do. (In
> fact we could leave the presence index unchanged in that case.) We'd
> have to use a negated 2's complement representation, since the B-tree
> sorts keys as unsigned characters.
value + 1<<63, not negated. (Otherwise we get -2 > -1 or something.)
And a min and max value for huge integers.