mirror of
https://github.com/neovim/neovim.git
synced 2026-02-03 02:24:29 +00:00
1f004970f0
NEW BUILD SYSTEM!
This is a MVP implementation which supports building the "nvim" binary,
including cross-compilation for some targets.
As an example, you can build a aarch64-macos binary from
an x86-64-linux-gnu host, or vice versa
Add CI target for build.zig currently for functionaltests on linux
x86_64 only
Follow up items:
- praxis for version and dependency bumping
- windows 💀
- full integration of libintl and gettext (or a desicion not to)
- update help and API metadata files
- installation into a $PREFIX
- more tests and linters
70 lines
1.9 KiB
Lua
70 lines
1.9 KiB
Lua
local names_file = arg[1]
|
|
local keycodes_file = arg[2]
|
|
|
|
local hashy = require('gen.hashy')
|
|
local keycodes = loadfile(keycodes_file)()
|
|
|
|
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()
|