mirror of
https://github.com/SpaceVim/SpaceVim.git
synced 2025-01-24 02:10:05 +08:00
95 lines
2.4 KiB
Lua
95 lines
2.4 KiB
Lua
local util = require("trouble.util")
|
|
local qf = require("trouble.providers.qf")
|
|
local telescope = require("trouble.providers.telescope")
|
|
local lsp = require("trouble.providers.lsp")
|
|
local diagnostic = require("trouble.providers.diagnostic")
|
|
|
|
local M = {}
|
|
|
|
M.providers = {
|
|
workspace_diagnostics = diagnostic.diagnostics,
|
|
document_diagnostics = diagnostic.diagnostics,
|
|
lsp_references = lsp.references,
|
|
lsp_implementations = lsp.implementations,
|
|
lsp_definitions = lsp.definitions,
|
|
lsp_type_definitions = lsp.type_definitions,
|
|
quickfix = qf.qflist,
|
|
loclist = qf.loclist,
|
|
telescope = telescope.telescope,
|
|
}
|
|
|
|
---@param options TroubleOptions
|
|
function M.get(win, buf, cb, options)
|
|
local name = options.mode
|
|
local provider = M.providers[name]
|
|
|
|
if not provider then
|
|
local ok, mod = pcall(require, "trouble.providers." .. name)
|
|
if ok then
|
|
M.providers[name] = mod
|
|
provider = mod
|
|
end
|
|
end
|
|
|
|
if not provider then
|
|
util.error(("invalid provider %q"):format(name))
|
|
return {}
|
|
end
|
|
|
|
local sort_keys = vim.list_extend({
|
|
function(item)
|
|
local cwd = vim.loop.fs_realpath(vim.fn.getcwd())
|
|
local path = vim.loop.fs_realpath(item.filename)
|
|
if not path then
|
|
return 200
|
|
end
|
|
local ret = string.find(path, cwd, 1, true) == 1 and 10 or 100
|
|
-- prefer non-hidden files
|
|
if string.find(path, ".") then
|
|
ret = ret + 1
|
|
end
|
|
return ret
|
|
end,
|
|
}, options.sort_keys)
|
|
|
|
provider(win, buf, function(items)
|
|
table.sort(items, function(a, b)
|
|
for _, key in ipairs(sort_keys) do
|
|
local ak = type(key) == "string" and a[key] or key(a)
|
|
local bk = type(key) == "string" and b[key] or key(b)
|
|
if ak ~= bk then
|
|
return ak < bk
|
|
end
|
|
end
|
|
end)
|
|
cb(items)
|
|
end, options)
|
|
end
|
|
|
|
---@param items Item[]
|
|
---@return table<string, Item[]>
|
|
function M.group(items)
|
|
local keys = {}
|
|
local keyid = 0
|
|
local groups = {}
|
|
for _, item in ipairs(items) do
|
|
if groups[item.filename] == nil then
|
|
groups[item.filename] = { filename = item.filename, items = {} }
|
|
keys[item.filename] = keyid
|
|
keyid = keyid + 1
|
|
end
|
|
table.insert(groups[item.filename].items, item)
|
|
end
|
|
|
|
local ret = {}
|
|
for _, group in pairs(groups) do
|
|
table.insert(ret, group)
|
|
end
|
|
table.sort(ret, function(a, b)
|
|
return keys[a.filename] < keys[b.filename]
|
|
end)
|
|
return ret
|
|
end
|
|
|
|
return M
|