On Thu, Dec 12, 2019 at 5:00 PM Thomas Munro <thomas.mu...@gmail.com> wrote: > Then, as a special case, there is the collation of the actual indexed > value, because that will implicitly be used as input to the btree ops > that would be collation sensitive. [...]
Erm, but I shouldn't have to reindex my hash indexes (at least not until someone invents collation-based equality and therefore necessarily also collation-based hashing). How can we exclude that? amcanorder seems somehow right but also wrong.
