179 lines
4.2 KiB
Lua
179 lines
4.2 KiB
Lua
local ls = require "luasnip"
|
|
|
|
local sn = ls.sn
|
|
|
|
local s = ls.s
|
|
local i = ls.insert_node
|
|
local t = ls.text_node
|
|
local d = ls.dynamic_node
|
|
local c = ls.choice_node
|
|
local fmta = require("luasnip.extras.fmt").fmta
|
|
local rep = require("luasnip.extras").rep
|
|
|
|
local get_node_text = vim.treesitter.get_node_text
|
|
|
|
local default_values = {
|
|
int = "0",
|
|
int8 = "0",
|
|
int16 = "0",
|
|
int32 = "0",
|
|
int64 = "0",
|
|
uint = "0",
|
|
uint8 = "0",
|
|
uint16 = "0",
|
|
uint32 = "0",
|
|
uint64 = "0",
|
|
["time.Time"] = "time.Time{}",
|
|
["time.Duration"] = "time.Duration(0)",
|
|
bool = "false",
|
|
string = [[""]],
|
|
float32 = "0",
|
|
float64 = "0",
|
|
error = function(_, info)
|
|
if info then
|
|
info.index = info.index + 1
|
|
|
|
return c(info.index, {
|
|
t(info.err_name),
|
|
t(string.format('errors.Wrap(%s, "%s")', info.err_name, info.func_name)),
|
|
})
|
|
else
|
|
return t "err"
|
|
end
|
|
end,
|
|
|
|
-- Types with a "*" mean they are pointers, so return nil
|
|
[function(text)
|
|
return string.find(text, "*", 1, true) ~= nil
|
|
end] = function(_, _)
|
|
return t "nil"
|
|
end,
|
|
|
|
[function(text)
|
|
return not string.find(text, "*", 1, true) and string.upper(string.sub(text, 1, 1)) == string.sub(text, 1, 1)
|
|
end] = function(text, info)
|
|
info.index = info.index + 1
|
|
return sn(info.index, {
|
|
c(1, {
|
|
t(text .. "{}"),
|
|
i(2, text),
|
|
}),
|
|
})
|
|
end,
|
|
}
|
|
|
|
local transform = function(text, info)
|
|
local condition_matches = function(condition, ...)
|
|
if type(condition) == "string" then
|
|
return condition == text
|
|
else
|
|
return condition(...)
|
|
end
|
|
end
|
|
|
|
for condition, result in pairs(default_values) do
|
|
if condition_matches(condition, text, info) then
|
|
if type(result) == "string" then
|
|
return t(result)
|
|
end
|
|
return result(text, info)
|
|
end
|
|
end
|
|
info.index = info.index + 1
|
|
return sn(info.index, {
|
|
c(1, {
|
|
t(text .. "{}"),
|
|
i(2, text),
|
|
}),
|
|
})
|
|
end
|
|
|
|
local handlers = {
|
|
parameter_list = function(node, info)
|
|
local result = {}
|
|
|
|
local count = node:named_child_count()
|
|
for idx = 0, count - 1 do
|
|
local matching_node = node:named_child(idx)
|
|
local type_node = matching_node:field("type")[1]
|
|
table.insert(result, transform(get_node_text(type_node, 0), info))
|
|
if idx ~= count - 1 then
|
|
table.insert(result, t { ", " })
|
|
end
|
|
end
|
|
|
|
return result
|
|
end,
|
|
|
|
type_identifier = function(node, info)
|
|
local text = get_node_text(node, 0)
|
|
return { transform(text, info) }
|
|
end,
|
|
}
|
|
|
|
local function_node_types = {
|
|
function_declaration = true,
|
|
method_declaration = true,
|
|
func_literal = true,
|
|
}
|
|
|
|
local function go_result_type(info)
|
|
local node = vim.treesitter.get_node()
|
|
while node ~= nil do
|
|
if function_node_types[node:type()] then
|
|
break
|
|
end
|
|
node = node:parent()
|
|
end
|
|
if not node then
|
|
vim.notify("Not inside a function", vim.log.levels.ERROR, { title = "Snippet" })
|
|
return t ""
|
|
end
|
|
|
|
local query = assert(vim.treesitter.query.get("go", "return-snippet"), "No Query")
|
|
|
|
for _, capture in query:iter_captures(node, 0) do
|
|
if handlers[capture:type()] then
|
|
return handlers[capture:type()](capture, info)
|
|
end
|
|
end
|
|
|
|
info.index = info.index + 1
|
|
return { i(info.index, "nil") }
|
|
end
|
|
|
|
local go_return_values = function(args)
|
|
return sn(
|
|
nil,
|
|
go_result_type {
|
|
index = 0,
|
|
err_name = args[1][1],
|
|
func_name = args[2][1],
|
|
}
|
|
)
|
|
end
|
|
|
|
ls.add_snippets("go", {
|
|
s(
|
|
"efi",
|
|
fmta(
|
|
[[
|
|
<val>, <err> := <f>(<args>)
|
|
if <err_same> != nil {
|
|
return <result>
|
|
}
|
|
<finish>
|
|
]],
|
|
{
|
|
val = i(1),
|
|
err = i(2, "err"),
|
|
f = i(3),
|
|
args = i(4),
|
|
err_same = rep(2),
|
|
result = d(5, go_return_values, { 2, 3 }),
|
|
finish = i(0),
|
|
}
|
|
)
|
|
),
|
|
})
|