Will that bug be fixed?
The problem is that if I use partial indexes I will have to create 3 of them:
CREATE INDEX partial_1 ON public.t USING btree (ci, co) WHERE cb IS TRUE;
CREATE INDEX partial_2 ON public.t USING btree (ci, co) WHERE cb IS FALSE;
CREATE INDEX partial_3 ON public.t USING btree (ci, co) WHERE cb IS NULL;
And if I have 2 booleans columns in index, then it will be 9 combinations.