admin管理员组

文章数量:1434949

I'm currently thinking about how to efficiently implement autocomplete/intellisense in a language server environment.

The task would be to find all symbols/identifiers (e.g. type names, function, constants, etc.) that match a user-typed string. Both the input and the symbols/identifiers are expected to be quite short but some degree of typos should be tolerated.

What should also be accounted for is that in a development environment the actively developed module changes often and rapidly while e.g. imported libraries remain mostly static.

What kind of data-structure / algorithm is favorable in such an application?

I found some older discussion (1 ,2) that suggests Tries and Ngrams but would be happy about an opinion on this (and if there are other ways to do this in 2024).

本文标签： algorithmEfficient autocomplete for a language serverStack Overflow

版权声明：本文标题：algorithm - Efficient autocomplete for a language server - Stack Overflow 内容由网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：http://www.betaflare.com/web/1745630512a2667245.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。