Re: [PATCH] `completing-read` - allow history=t, sorting improvements

[Stefan Monnier]

> N is not that large. I want the sorting to be reasonably fast for the the
> candidate sets which occur now in Emacs.

Yes, but the log N factor in sorting is even much smaller.
You can basically treat it as a constant.

> But if this get improved, people may throw more candidates at it and
> then we will end up again with a threshold.

That's the main point, indeed: rather than try to handle larger sets, we
want to avoid larger sets.  That's why we have
`icomplete-show-matches-on-no-input` and `company-minimum-prefix-length`
(tho there can be other approaches like pushing the processing of sets
to a separate async process).


        Stefan