The current implementation uses string comparison to match autocomplete options. We may dramatically improve performance, especially for a large set of options, by leveraging prefix tree algorithm.
(Un)fortunately, I have a very limited amount of options (up to 100) in my primary project, so I am not motivated to invest more time to improve things, however, I would be more than happy to get some help :)
yury-dymov
commented
1 year ago
The current implementation uses string comparison to match autocomplete options. We may dramatically improve performance, especially for a large set of options, by leveraging prefix tree algorithm.
(Un)fortunately, I have a very limited amount of options (up to 100) in my primary project, so I am not motivated to invest more time to improve things, however, I would be more than happy to get some help :)