mirror of
https://github.com/neovim/neovim.git
synced 2025-09-27 13:38:34 +00:00
perf(keycodes): use hashy for string lookup
This is slightly faster than the binary search as per the benchmark, and allows handling the vim/vim#16821 situation in generator code.
This commit is contained in:
@@ -1,5 +1,7 @@
|
||||
return {
|
||||
--- @type [string, string][] List of [key, name] tuples.
|
||||
--- For keys with multiple names, put the preferred name first.
|
||||
--- For multiple keys with the same name, put the preferred key first.
|
||||
names = {
|
||||
{ [[' ']], 'Space' },
|
||||
{ [[TAB]], 'Tab' },
|
||||
|
Reference in New Issue
Block a user