diff options
| author | Rudi Grinberg | 2020-07-16 18:14:09 -0700 |
|---|---|---|
| committer | Justin Burkett | 2020-07-21 15:27:24 -0400 |
| commit | 3642c11d5ef9be3c6fb9edb8fd5ec3c370abd889 (patch) | |
| tree | ffd66522da0ae19bc1a58d6923160d0a8e7ad1fc /java | |
| parent | ce25fb260003eb965e1c104804f690d9405ec8b4 (diff) | |
| download | emacs-3642c11d5ef9be3c6fb9edb8fd5ec3c370abd889.tar.gz emacs-3642c11d5ef9be3c6fb9edb8fd5ec3c370abd889.zip | |
Speed up which-key--maybe-replace
The first optimization is avoiding the intermediate list created by
append. Instead we just iterate over the two lists in turn
The second opimitization occurs where
which-key-allow-multiple-replacements is nil, in which case we can stop
the iteration once we've found a replacement
Signed-off-by: Rudi Grinberg <me@rgrinberg.com>
Diffstat (limited to 'java')
0 files changed, 0 insertions, 0 deletions