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.