This is a package to provide a completion-style
to Emacs that is able to
leverage flx as well as various other
fuzzy matching scoring packages to provide intelligent scoring and sorting.
This package is intended to be used with packages that leverage
completion-styles
, e.g. completing-read
and completion-at-point-functions
.
It is usable with icomplete
(as well as fido-mode
), selectrum
,
vertico
, corfu
, helm
and company-mode
’s company-capf
.
It is not currently usable with ido
which doesn’t support
completion-styles
and has its own sorting and filtering system. In
addition to those packages, other company-mode
backends will not hook into
this package. ivy
support can be somewhat baked in following
https://github.com/jojojames/fussy#ivy-integration but the
performance gains may not be as high as the other completion-read
APIs.
M-x package-install RET fussy RET
Or clone / download this repository and modify your load-path
:
(add-to-list 'load-path (expand-file-name "/path/to/fussy/" user-emacs-directory))
(add-to-list 'package-archives '("melpa" . "https://melpa.org/packages/"))
(require 'package)
(package-initialize)
(package-refresh-contents)
(unless (package-installed-p 'fussy)
(package-install 'fussy))
(add-to-list 'completion-styles 'fussy t)
(use-package fussy
:ensure t
:config
(push 'fussy completion-styles)
(setq
;; For example, project-find-file uses 'project-files which uses
;; substring completion by default. Set to nil to make sure it's using
;; flx.
completion-category-defaults nil
completion-category-overrides nil))
We default to flx for scoring matches but additional (listed below) scoring functions/backends can be used.
flx is a dependency of fussy
and the default
scoring algorithm.
flx
has a great scoring algorithm but is one of the slower implementations
compared to the other scoring backends written as native modules.
flx-rs is a native module written in Rust
that matches the original flx
scoring algorithm. It is about 10 times faster
than the original implementation written in Emacs Lisp. We can use this package
instead for extra performance with the same scoring strategy.
One downside of this package is that it doesn’t yet support using flx
’s file
cache so filename matching is currently slightly worse than the original Emacs
lisp implementation.
(use-package flx-rs
:ensure t
:straight
(flx-rs
:repo "jcs-elpa/flx-rs"
:fetcher github
:files (:defaults "bin"))
:config
(setq fussy-score-fn 'fussy-flx-rs-score)
(flx-rs-load-dyn))
Use fzf-native for scoring.
Provides fuzzy matching scoring based on the fzf
algorithm (by
junegunn) through a dynamic module
for a native C implementation of fzf
,
telescope-fzf-native.nvim.
(use-package fzf-native
:ensure t
:straight
(fzf-native
:repo "dangduc/fzf-native"
:host github
:files (:defaults "bin"))
:config
(setq fussy-score-fn 'fussy-fzf-native-score)
(fzf-native-load-dyn))
Another option is to use the fuz library (also in Rust) for scoring.
This library has two fuzzy matching algorithms, skim
and clangd
.
Skim: Just like fzf v2, the algorithm is based on Smith-Waterman algorithm which is normally used in DNA sequence alignment
Clangd: The algorithm is based on clangd’s FuzzyMatch.cpp.
For more information: fuzzy-matcher
(use-package fuz
:ensure nil
:straight (fuz :type git :host github :repo "rustify-emacs/fuz.el")
:config
(setq fussy-score-fn 'fussy-fuz-score)
(unless (require 'fuz-core nil t)
(fuz-build-and-load-dymod)))
;; Same as fuz but with prebuilt binaries.
(use-package fuz-bin
:ensure t
:straight
(fuz-bin
:repo "jcs-elpa/fuz-bin"
:fetcher github
:files (:defaults "bin"))
:config
(setq fussy-score-fn 'fussy-fuz-bin-score)
(fuz-bin-load-dyn))
This is the algorithm used by the old lusty-explorer.
A mimetic poly-alloy of the Quicksilver scoring algorithm, essentially LiquidMetal.
Flex matching short abbreviations against longer strings is a boon in productivity for typists. Applications like Quicksilver, Alfred, LaunchBar, and Launchy have made this method of keyboard entry a popular one. It’s time to bring this same functionality to web controls. LiquidMetal makes scoring long strings against abbreviations easy.
For more information: liquidmetal
(use-package liquidmetal
:ensure t
:straight t
:config
(setq fussy-score-fn 'fussy-liquidmetal-score))
Fuzzy matching algorithm based on Sublime Text’s string search. Iterates through characters of a search string and calculates a score. This is another fuzzy implementation written in Rust.
For more information: fuzzy-rs
(use-package sublime-fuzzy
:ensure t
:straight
(sublime-fuzzy
:repo "jcs-elpa/sublime-fuzzy"
:fetcher github
:files (:defaults "bin"))
:config
(setq fussy-score-fn 'fussy-sublime-fuzzy-score)
(sublime-fuzzy-load-dyn))
This is a fuzzy Emacs completion style similar to the built-in flex style, but with a better scoring algorithm. Specifically, it is non-greedy and ranks completions that match at word; path component; or camelCase boundaries higher.
For more information: hotfuzz
Note, hotfuzz
has its own completion-style
that may be worth using over this one.
(use-package hotfuzz
:ensure t
:straight t
:config
(setq fussy-score-fn 'fussy-hotfuzz-score))
Results and filtering can be cached for improved performance by setting
fussy-use-cache
to t (NOTE: in the future this will be default to t).
With this set to t:
If user already entered the same query:
e.g. User types “a” -> “ab” and then backspaces into “a” again.
Results from the originally entered “a” will be used for the second entered “a”.
If user is entering a new query but there exists results from a previous query in the cache:
e.g. User types “a” and then “ab”. Results from “a” will then be used for filtering in “ab”.
To use this with company
and corfu
, use an advice to reset the cache upon
new completion requests.
(advice-add 'corfu--capf-wrapper :before 'fussy-wipe-cache)
(advice-add 'company-auto-begin :before 'fussy-wipe-cache)
Before scoring and sorting candidates, we must somehow filter them from the completion table. The approaches below are several ways to do that, each with varying advantages and disadvantages.
For the choices below, we benchmark the functions by benchmarking the entire
fussy-all-completions
function with the below macro calling M-x
describe-symbol (30000 candidates)
in the scratch buffer.
(defmacro fussy--measure-time (&rest body)
"Measure the time it takes to evaluate BODY.
https://lists.gnu.org/archive/html/help-gnu-emacs/2008-06/msg00087.html"
`(let ((time (current-time)))
(let ((result ,@body))
(message "%.06f" (float-time (time-since time)))
result)))
This is the default filtering method and is 1:1 to the filtering done
when using the flex
completion-style
. Advantages are no additional
dependencies (e.g. orderless
) and likely bug-free/stable to use.
The only disadvantage is that it’s the slowest of the filtering methods.
;; Flex
(setq fussy-filter-fn 'fussy-filter-flex)
;; Type Letter a
;; 0.078952
;; Type Letter b
;; 0.052590
;; Type Letter c
;; 0.065808
;; Type Letter d
;; 0.061254
;; Type Letter e
;; 0.098000
;; Type Letter f
;; 0.053321
;; Type Letter g
;; 0.050180
This is another usable filtering method and leverages the all-completions
API
written in C to do its filtering. It seems to be the fastest of the filtering
methods from quick benchmarking as well as requiring no additional dependencies
(e.g. orderless
).
Implementation may be buggy though, so use with caution.
;; Fast
(setq fussy-filter-fn 'fussy-filter-default)
;; Type Letter a
;; 0.030671
;; Type Letter b
;; 0.030247
;; Type Letter c
;; 0.036047
;; Type Letter d
;; 0.032071
;; Type Letter e
;; 0.034785
;; Type Letter f
;; 0.030392
;; Type Letter g
;; 0.033473
orderless can also be used for
filtering. It uses the all-completions
API like fussy-filter-default
so is
also faster than the default filtering but has a dependency on orderless
.
;; Orderless
(setq fussy-filter-fn 'fussy-filter-orderless-flex)
;; Type Letter a
;; 0.065390
;; Type Letter b
;; 0.036942
;; Type Letter c
;; 0.054091
;; Type Letter d
;; 0.048816
;; Type Letter e
;; 0.074258
;; Type Letter f
;; 0.040900
;; Type Letter g
;; 0.037928
To use orderless filtering:
(use-package orderless
:straight t
:ensure t
:commands (orderless-filter))
(setq fussy-filter-fn 'fussy-filter-orderless)
Use an advice to enable fussy
.
(defun j-company-capf (f &rest args)
"Manage `completion-styles'."
(if (length= company-prefix 0)
;; Don't use `company' for 0 length prefixes.
(let ((completion-styles (remq 'fussy completion-styles)))
(apply f args))
(let ((fussy-max-candidate-limit 5000)
(fussy-default-regex-fn 'fussy-pattern-first-letter)
(fussy-prefer-prefix nil))
(apply f args))))
(defun j-company-transformers (f &rest args)
"Manage `company-transformers'."
(if (length= company-prefix 0)
;; Don't use `company' for 0 length prefixes.
(apply f args)
(let ((company-transformers '(fussy-company-sort-by-completion-score)))
(apply f args))))
(advice-add 'company-auto-begin :before 'fussy-wipe-cache)
(advice-add 'company--transform-candidates :around 'j-company-transformers)
(advice-add 'company-capf :around 'j-company-capf)
The company-transformer
advice is needed to actually sort the scored
matches.
Fuzzy completion may or may not be too slow when completing with company-mode.
For this, we can advise company-capf
to skip fussy
when desired.
The snippet below only uses fuzzy filtering and scoring when the prefix length is 2.
(defun bb-company-capf (f &rest args)
"Manage `completion-styles'."
(if (length< company-prefix 2)
(let ((completion-styles (remq 'fussy completion-styles)))
(apply f args))
(let ((fussy-max-candidate-limit 5000)
(fussy-default-regex-fn 'fussy-pattern-first-letter)
(fussy-prefer-prefix nil))
(apply f args))))
(defun bb-company-transformers (f &rest args)
"Manage `company-transformers'."
(if (length< company-prefix 2)
(apply f args)
(let ((company-transformers '(fussy-company-sort-by-completion-score)))
(apply f args))))
(advice-add 'company--transform-candidates :around 'bb-company-transformers)
(advice-add 'company-capf :around 'bb-company-capf)
;; For cache functionality.
(advice-add 'company-auto-begin :before 'fussy-wipe-cache)
;; For cache functionality.
(advice-add 'corfu--capf-wrapper :before 'fussy-wipe-cache)
(add-hook 'corfu-mode-hook
(lambda ()
(setq-local fussy-max-candidate-limit 5000
fussy-default-regex-fn 'fussy-pattern-first-letter
fussy-prefer-prefix nil)))
Eglot by default uses flex
in completion-category-defaults
.
Use this to override that.
(with-eval-after-load 'eglot
(add-to-list 'completion-category-overrides
'(eglot (styles fussy basic))))
Integration with helm is possible by
setting helm-completion-style
to emacs
instead of helm
.
(setq helm-completion-style 'emacs)
For more information: https://github.com/emacs-helm/helm/blob/master/helm-mode.el#L269
fido
uses the built in flex
completion-style
by default. We can advise
icomplete
’s setup hook to set up fussy
with fido-mode
.
(use-package icomplete
:ensure nil
:straight nil
:config
(defun fussy-fido-setup ()
"Use `fussy' with `fido-mode'."
(setq-local completion-styles '(fussy basic)))
(advice-add 'icomplete--fido-mode-setup :after 'fussy-fido-setup)
(setq icomplete-tidy-shadowed-file-names t
icomplete-show-matches-on-no-input t
icomplete-compute-delay 0
icomplete-delay-completions-threshold 50)
;; Or `fido-mode'.
(fido-vertical-mode))
Since ivy
doesn’t support completion-styles
, we have to hack fussy
into it.
We can advise ivy--flx-sort
and replace it with our own sorting function.
(defun ivy--fussy-sort (name cands)
"Sort according to closeness to string NAME the string list CANDS."
(condition-case nil
(let* ((bolp (= (string-to-char name) ?^))
;; An optimized regex for fuzzy matching
;; "abc" → "^[^a]*a[^b]*b[^c]*c"
(fuzzy-regex (concat "\\`"
(and bolp (regexp-quote (substring name 1 2)))
(mapconcat
(lambda (x)
(setq x (char-to-string x))
(concat "[^" x "]*" (regexp-quote x)))
(if bolp (substring name 2) name)
"")))
;; Strip off the leading "^" for flx matching
(flx-name (if bolp (substring name 1) name))
cands-left
cands-to-sort)
;; Filter out non-matching candidates
(dolist (cand cands)
(when (string-match-p fuzzy-regex cand)
(push cand cands-left)))
;; pre-sort the candidates by length before partitioning
(setq cands-left (cl-sort cands-left #'< :key #'length))
;; partition the candidates into sorted and unsorted groups
(dotimes (_ (min (length cands-left) ivy-flx-limit))
(push (pop cands-left) cands-to-sort))
(nconc
;; Compute all of the flx scores in one pass and sort
(mapcar #'car
(sort (mapcar
(lambda (cand)
(cons cand
(car
(funcall
fussy-score-fn
cand flx-name
ivy--flx-cache))))
cands-to-sort)
(lambda (c1 c2)
;; Break ties by length
(if (/= (cdr c1) (cdr c2))
(> (cdr c1)
(cdr c2))
(< (length (car c1))
(length (car c2)))))))
;; Add the unsorted candidates
cands-left))
(error cands)))
(advice-add 'ivy--flx-sort :override 'ivy--fussy-sort)
For more information: abo-abo/swiper#848 (comment)
fussy
is written to be configure-less by the user. For defaults, it uses the
built-in flex
algorithm for filtering and flx
for scoring and sorting.
However, users are encouraged to try the various available scoring backends.
These scoring backends are configured through fussy-score-fn
. See its docstring
for configuration.
For improved performance, use a scoring backend backed by a native module. Examples include but are not limited to:
flx-rs
fuz/fuz-bin
fzf-native
flx-rs
will provide an algorithm that matches the original flx
algorithm
while the other two matches other popular packages (skim
and fzf
).
Below is a sample config that uses flx-rs
for improved performance.
fuz-bin
or fuz
may be a better choice for performance than flx-rs
but uses
a different algorithm.
(use-package orderless
:straight t
:ensure t
:commands (orderless-filter))
(use-package flx-rs
:ensure t
:straight
(flx-rs
:repo "jcs-elpa/flx-rs"
:fetcher github
:files (:defaults "bin"))
:config
(setq fussy-score-fn 'fussy-flx-rs-score)
(flx-rs-load-dyn))
(use-package fussy
:ensure t
:straight
(fussy :type git :host github :repo "jojojames/fussy")
:config
(setq fussy-score-fn 'fussy-flx-rs-score)
(setq fussy-filter-fn 'fussy-filter-orderless-flex)
(push 'fussy completion-styles)
(setq
;; For example, project-find-file uses 'project-files which uses
;; substring completion by default. Set to nil to make sure it's using
;; flx.
completion-category-defaults nil
completion-category-overrides nil)
;; `eglot' defaults to flex, so set an override to point to fussy instead.
(with-eval-after-load 'eglot
(add-to-list 'completion-category-overrides
'(eglot (styles fussy basic)))))
Documenting my configuration for the users that may want to copy. Unlike the
former configuration, this section will be kept up to date with my init.el
.
(use-package fussy
:ensure t
:straight
(fussy :type git :host github :repo "jojojames/fussy")
:config
(setq fussy-filter-fn 'fussy-filter-default)
(setq fussy-use-cache t)
(setq fussy-compare-same-score-fn 'fussy-histlen->strlen<)
(push 'fussy completion-styles)
(setq
;; For example, project-find-file uses 'project-files which uses
;; substring completion by default. Set to nil to make sure it's using
;; flx.
completion-category-defaults nil
completion-category-overrides nil)
;; `eglot' defaults to flex, so set an override to point to flx instead.
(with-eval-after-load 'eglot
(add-to-list 'completion-category-overrides
'(eglot (styles fussy basic)))))
(use-package company
:config
(defun j-company-capf (f &rest args)
"Manage `completion-styles'."
(if (length= company-prefix 0)
;; Don't use `company' for 0 length prefixes.
(let ((completion-styles (remq 'fussy completion-styles)))
(apply f args))
(let ((fussy-max-candidate-limit 5000)
(fussy-default-regex-fn 'fussy-pattern-first-letter)
(fussy-prefer-prefix nil))
(apply f args))))
(defun j-company-transformers (f &rest args)
"Manage `company-transformers'."
(if (length= company-prefix 0)
;; Don't use `company' for 0 length prefixes.
(apply f args)
(let ((company-transformers '(fussy-company-sort-by-completion-score)))
(apply f args))))
(advice-add 'company-auto-begin :before 'fussy-wipe-cache)
(advice-add 'company--transform-candidates :around 'j-company-transformers)
(advice-add 'company-capf :around 'j-company-capf)
(global-company-mode))
Listed below are samples of scores that backends return given a candidate string and a search string to match against it. This may help in determining a preferred scoring backend.
Please PR other examples as they come up. This score can be obtained by commenting out the log message in fussy-score
.
Another way to do it is to feed candidates and queries into fussy-score
with the desired fussy-score-fn
.
;; candidate: Makefile query: mkfile score 77
;; candidate: fork/yasnippet-snippets/snippets/chef-mode/cookbook_file query: mkfile score 68
;; candidate: Makefile query: mkfile 118
;; candidate: fork/yasnippet-snippets/snippets/chef-mode/cookbook_file query: mkfile 128
Set up eask
.
$ brew install node
$ npm install -g @emacs-eask/eask
make test
lewang/flx#54 company-mode/company-mode#47 abo-abo/swiper#207 abo-abo/swiper#2321 abo-abo/swiper#848 melpa/melpa#8029 emacs-helm/helm#2165