fix(module): stabilize fuzzy require resolution across duplicate suffix matches#969
Conversation
Summary of ChangesHello @lewis6991, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed! This pull request resolves an issue where fuzzy module resolution could be non-deterministic, leading to inconsistent module loading when multiple modules shared similar trailing paths. The changes introduce a robust selection mechanism to ensure that the same module is always chosen under identical conditions, improving reliability and predictability in module imports. Highlights
🧠 New Feature in Public Preview: You can now enable Memory to help Gemini Code Assist learn from your team's feedback. This makes future code reviews more consistent and personalized to your project's style. Click here to enable Memory in your admin console. Changelog
Activity
Using Gemini Code AssistThe full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips. Invoking Gemini You can request assistance from Gemini at any point by creating a comment using either
Customization To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a Limitations & Feedback Gemini Code Assist may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments. If you're interested in giving your feedback about your experience with Gemini Code Assist for Github and other Google products, sign up here. You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension. Footnotes
|
There was a problem hiding this comment.
Code Review
This pull request introduces a deterministic approach for fuzzy module resolution when multiple candidates match a suffix, which is a great improvement. The logic correctly uses the leading segment count and lexicographical sorting to find the best match, resolving potential flakiness. The new tests adequately cover the implemented logic. My review includes a couple of suggestions to improve code clarity and reduce duplication.
ddecb05 to
10a3bed
Compare
…ix matches
When multiple indexed modules share the same trailing require path (for
example plugin/treesitter-context.lua and lua/treesitter-context.lua),
fuzzy lookup previously returned the first inserted candidate. Because
indexing/insertion order can vary, require('treesitter-context') could
intermittently resolve to different files and sometimes degrade to any
when a non-exporting candidate won.
This change makes fuzzy resolution deterministic by selecting the best
match using:
- smallest leading-segment count before the requested module path
- lexicographic full-module-name tie-break for stable ordering
This preserves existing fuzzy behavior while removing insertion-order
flakiness.
10a3bed to
f6ab61c
Compare
When multiple indexed modules share the same trailing require path (for
example plugin/treesitter-context.lua and lua/treesitter-context.lua),
fuzzy lookup previously returned the first inserted candidate. Because
indexing/insertion order can vary, require('treesitter-context') could
intermittently resolve to different files and sometimes degrade to any
when a non-exporting candidate won.
This change makes fuzzy resolution deterministic by selecting the best
match using:
This preserves existing fuzzy behavior while removing insertion-order
flakiness.