Skip to content

Extend static completions with candidates from tags table #1228

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 22, 2016
Merged

Extend static completions with candidates from tags table #1228

merged 1 commit into from
Mar 22, 2016

Conversation

geraldus
Copy link
Contributor

Related #1184

I thought to add tags-completion-at-point-function to completion-at-point-functions hook at first, but this approach is not good enough because in this case completion functions are run sequentially and candidates are not merged. So, if haskell completion function will go first and it is able to complete thing at point there is no candidates from tags and vice versa. And it is not clear what function should go first.

Fortunately, I've discovered tags-completion-table function, with it now it's possible to merge tags completions with keyword completions.

One question: should we revisit tags table automatically when it is regenerated (in haskell-mode-generate-tags)?

@gracjan
Copy link
Contributor

gracjan commented Mar 22, 2016

Nice.

gracjan added a commit that referenced this pull request Mar 22, 2016
…ions

Extend static completions with candidates from tags table
@gracjan gracjan merged commit 2f1c969 into haskell:master Mar 22, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants