1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
local names_file = arg[1]
local hashy = require('gen.hashy')
local keycodes = require('nvim.keycodes')
local keycode_names = keycodes.names
local hashorder = {} --- @type string[]
--- @type table<string,integer[]>
--- Maps lower-case key names to their original indexes.
--- When multiple keys have the same name (e.g. TAB and K_TAB),
--- the name will have multiple original indexes.
local name_orig_idx = {}
--- @type table<string,integer>
--- Maps keys to the original indexes of their preferred names.
local key_orig_idx = {}
for i, keycode in ipairs(keycode_names) do
local key = keycode[1]
local name = keycode[2]
local name_lower = name:lower()
table.insert(hashorder, name_lower)
if name_orig_idx[name_lower] == nil then
name_orig_idx[name_lower] = { i }
else
table.insert(name_orig_idx[name_lower], i)
end
if key_orig_idx[key] == nil then
key_orig_idx[key] = i
end
end
table.sort(hashorder)
local hashfun
hashorder, hashfun = hashy.hashy_hash('get_special_key_code', hashorder, function(idx)
return 'key_names_table[' .. idx .. '].name.data'
end, true)
local names_tgt = assert(io.open(names_file, 'w'))
names_tgt:write([[
static const struct key_name_entry {
int key; ///< Special key code or ascii value
bool is_alt; ///< Is an alternative name
String name; ///< Name of key
} key_names_table[] = {]])
local name_orig_idx_ = vim.deepcopy(name_orig_idx)
for _, lower_name in ipairs(hashorder) do
local orig_idx = table.remove(name_orig_idx_[lower_name], 1)
local keycode = keycode_names[orig_idx]
local key = keycode[1]
local name = keycode[2]
names_tgt:write(
('\n {%s, %s, {"%s", %u}},'):format(
key,
key_orig_idx[key] == orig_idx and 'false' or 'true',
name,
#name
)
)
end
assert(vim.iter(vim.tbl_values(name_orig_idx_)):all(vim.tbl_isempty))
names_tgt:write('\n};\n\n')
names_tgt:write('static ' .. hashfun)
names_tgt:close()
|
