mirror of
https://github.com/neovim/neovim
synced 2025-07-16 01:01:49 +00:00
e00d67ef31
Problem: :checkhealth vim.treesitter sorts parser entries solely by path, splitting duplicates and reducing clarity. Solution: Sort entries first by name, then by path, so that duplicates are grouped.
64 lines
1.6 KiB
Lua
64 lines
1.6 KiB
Lua
local M = {}
|
|
local ts = vim.treesitter
|
|
local health = vim.health
|
|
|
|
--- Performs a healthcheck for treesitter integration
|
|
function M.check()
|
|
health.start('Treesitter features')
|
|
|
|
health.info(
|
|
string.format(
|
|
'Treesitter ABI support: min %d, max %d',
|
|
vim.treesitter.minimum_language_version,
|
|
ts.language_version
|
|
)
|
|
)
|
|
|
|
local can_wasm = vim._ts_add_language_from_wasm ~= nil
|
|
health.info(string.format('WASM parser support: %s', tostring(can_wasm)))
|
|
|
|
health.start('Treesitter parsers')
|
|
local parsers = vim.api.nvim_get_runtime_file('parser/*', true)
|
|
|
|
---@class ParserEntry
|
|
---@field name string
|
|
---@field path string
|
|
|
|
local sorted_parsers = {} ---@type ParserEntry[]
|
|
|
|
for _, parser in ipairs(parsers) do
|
|
local parsername = vim.fn.fnamemodify(parser, ':t:r')
|
|
table.insert(sorted_parsers, { name = parsername, path = parser })
|
|
end
|
|
|
|
table.sort(sorted_parsers, function(a, b)
|
|
if a.name == b.name then
|
|
return a.path < b.path
|
|
else
|
|
return a.name < b.name
|
|
end
|
|
end)
|
|
|
|
for _, parser in ipairs(sorted_parsers) do
|
|
local is_loadable, err_or_nil = pcall(ts.language.add, parser.name)
|
|
|
|
if not is_loadable then
|
|
health.error(
|
|
string.format(
|
|
'Parser "%s" failed to load (path: %s): %s',
|
|
parser.name,
|
|
parser.path,
|
|
err_or_nil or '?'
|
|
)
|
|
)
|
|
else
|
|
local lang = ts.language.inspect(parser.name)
|
|
health.ok(
|
|
string.format('Parser: %-20s ABI: %d, path: %s', parser.name, lang.abi_version, parser.path)
|
|
)
|
|
end
|
|
end
|
|
end
|
|
|
|
return M
|