Andrew Dunstan <andrew@dunslane.net> writes:
> If you have want to work on it and prove it's going to be better, please
> do. I'm not convinced it will do a whole lot better than a binary search
> that in most cases will do no more than a handful of probes.
Yeah, that's a good point. There's a range of table sizes where hashing
is faster than binary search, but I'm not sure that typical enums will
fall into that range.
regards, tom lane
