unison/unison-src/transcripts/lsp-name-completion.md

scratch/main> builtins.merge lib.builtins

foldMap = "top-level"
nested.deeply.foldMap = "nested"
lib.base.foldMap = "lib"
lib.dep.lib.transitive.foldMap = "transitive-lib"
-- A deeply nested definition with the same hash as the top level one.
-- This should not be included in the completion results if a better name with the same hash IS included.
lib.dep.lib.transitive_same_hash.foldMap = "top-level"
foldMapWith = "partial match"

other = "other"

scratch/main> add

Completion should find all the foldMap definitions in the codebase, sorted by number of name segments, shortest first.

Individual LSP clients may still handle sorting differently, e.g. doing a fuzzy match over returned results, or prioritizing exact matches over partial matches. We don't have any control over that.

scratch/main> debug.lsp-name-completion foldMap

Should still find the term which has a matching hash to a better name if the better name doesn't match.

scratch/main> debug.lsp-name-completion transitive_same_hash.foldMap