golang/go

x/tools/gopls: Symbols: use Levenshtein distance for ranking

Open

#74,793 创建于 2025年7月29日

在 GitHub 查看
 (8 评论) (2 反应) (0 负责人)Go (133,883 star) (19,008 fork)batch import
FeatureRequestToolsgoplshelp wanted

描述

I just sought the symbol testincreemntalnope and got an empty result, even though TestIncrementalNope exists. It's 2025, I shouldn't have to spell correctly. Let's rank candidates by Levenshtein distance from the search term and include the closest n results.

See Starlark's spell.Nearest for an implementation we can use.

贡献者指南

技术栈
go
领域
developer experiencetooling
议题类型
feature
难度面向新贡献者的预计实现难度，1 表示很小改动，5 表示专家级工作。
3
预计时间有经验贡献者完成调查、实现、测试并准备 pull request 的粗略时间范围。
1-3 hours
活动状态议题当前的可参与程度：新鲜、活跃、陈旧、阻塞或等待维护者输入。
active
清晰度议题是否清楚说明期望改动、验收标准和下一步。
clear
前置要求
GogoplsLevenshtein distance
新手友好度1-100 的估计分数，表示该议题对首次贡献者的友好程度。
70
研究方向
The implementation should add Levenshtein distance ranking to gopls symbol search. An existing implementation can be found in Starlark's spell.Nearest (go.starlark.net/internal/spell). The goal is to modify the symbol ranking function in gopls to compute distances and include the closest candidates. Look for the symbol search logic in the gopls package, likely in the symbols handling files.