2020-05-08 11:22:59 +02:00
|
|
|
local api = vim.api
|
|
|
|
|
|
2020-06-19 13:45:33 +02:00
|
|
|
local parsers = require'nvim-treesitter.parsers'
|
2020-05-08 11:22:59 +02:00
|
|
|
|
|
|
|
|
local M = {}
|
|
|
|
|
|
|
|
|
|
--- Gets the actual text content of a node
|
|
|
|
|
-- @param node the node to get the text from
|
|
|
|
|
-- @param bufnr the buffer containing the node
|
|
|
|
|
-- @return list of lines of text of the node
|
|
|
|
|
function M.get_node_text(node, bufnr)
|
|
|
|
|
local bufnr = bufnr or api.nvim_get_current_buf()
|
|
|
|
|
if not node then return {} end
|
|
|
|
|
|
|
|
|
|
-- We have to remember that end_col is end-exclusive
|
|
|
|
|
local start_row, start_col, end_row, end_col = node:range()
|
2020-06-26 11:11:21 -05:00
|
|
|
|
2020-05-08 11:22:59 +02:00
|
|
|
if start_row ~= end_row then
|
|
|
|
|
local lines = api.nvim_buf_get_lines(bufnr, start_row, end_row+1, false)
|
|
|
|
|
lines[1] = string.sub(lines[1], start_col+1)
|
|
|
|
|
lines[#lines] = string.sub(lines[#lines], 1, end_col)
|
|
|
|
|
return lines
|
|
|
|
|
else
|
2020-06-26 11:11:21 -05:00
|
|
|
local line = api.nvim_buf_get_lines(bufnr, start_row, start_row+1, false)[1]
|
|
|
|
|
-- If line is nil then the line is empty
|
|
|
|
|
return line and { string.sub(line, start_col+1, end_col) } or {}
|
2020-05-08 11:22:59 +02:00
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
|
2020-06-21 20:38:00 +02:00
|
|
|
--- Determines whether a node is the parent of another
|
2020-05-08 11:22:59 +02:00
|
|
|
-- @param dest the possible parent
|
|
|
|
|
-- @param source the possible child node
|
|
|
|
|
function M.is_parent(dest, source)
|
|
|
|
|
if not (dest and source) then return false end
|
|
|
|
|
|
|
|
|
|
local current = source
|
|
|
|
|
while current ~= nil do
|
|
|
|
|
if current == dest then
|
|
|
|
|
return true
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
current = current:parent()
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
return false
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
--- Get next node with same parent
|
|
|
|
|
-- @param node node
|
|
|
|
|
-- @param allow_switch_parents allow switching parents if last node
|
|
|
|
|
-- @param allow_next_parent allow next parent if last node and next parent without children
|
|
|
|
|
function M.get_next_node(node, allow_switch_parents, allow_next_parent)
|
|
|
|
|
local destination_node
|
|
|
|
|
local parent = node:parent()
|
|
|
|
|
|
|
|
|
|
if not parent then return end
|
|
|
|
|
local found_pos = 0
|
|
|
|
|
for i = 0,parent:named_child_count()-1,1 do
|
|
|
|
|
if parent:named_child(i) == node then
|
|
|
|
|
found_pos = i
|
|
|
|
|
break
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
if parent:named_child_count() > found_pos + 1 then
|
|
|
|
|
destination_node = parent:named_child(found_pos + 1)
|
|
|
|
|
elseif allow_switch_parents then
|
|
|
|
|
local next_node = M.get_next_node(node:parent())
|
|
|
|
|
if next_node and next_node:named_child_count() > 0 then
|
|
|
|
|
destination_node = next_node:named_child(0)
|
|
|
|
|
elseif next_node and allow_next_parent then
|
|
|
|
|
destination_node = next_node
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
return destination_node
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
--- Get previous node with same parent
|
|
|
|
|
-- @param node node
|
|
|
|
|
-- @param allow_switch_parents allow switching parents if first node
|
|
|
|
|
-- @param allow_previous_parent allow previous parent if first node and previous parent without children
|
|
|
|
|
function M.get_previous_node(node, allow_switch_parents, allow_previous_parent)
|
|
|
|
|
local destination_node
|
|
|
|
|
local parent = node:parent()
|
|
|
|
|
if not parent then return end
|
|
|
|
|
|
|
|
|
|
local found_pos = 0
|
|
|
|
|
for i = 0,parent:named_child_count()-1,1 do
|
|
|
|
|
if parent:named_child(i) == node then
|
|
|
|
|
found_pos = i
|
|
|
|
|
break
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
if 0 < found_pos then
|
|
|
|
|
destination_node = parent:named_child(found_pos - 1)
|
|
|
|
|
elseif allow_switch_parents then
|
|
|
|
|
local previous_node = M.get_previous_node(node:parent())
|
|
|
|
|
if previous_node and previous_node:named_child_count() > 0 then
|
|
|
|
|
destination_node = previous_node:named_child(previous_node:named_child_count() - 1)
|
|
|
|
|
elseif previous_node and allow_previous_parent then
|
|
|
|
|
destination_node = previous_node
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
return destination_node
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
function M.get_named_children(node)
|
|
|
|
|
local nodes = {}
|
|
|
|
|
for i=0,node:named_child_count() - 1,1 do
|
|
|
|
|
nodes[i+1] = node:named_child(i)
|
|
|
|
|
end
|
|
|
|
|
return nodes
|
|
|
|
|
end
|
|
|
|
|
|
2020-06-19 14:13:23 +02:00
|
|
|
function M.get_node_at_cursor(winnr)
|
|
|
|
|
local cursor = api.nvim_win_get_cursor(winnr or 0)
|
2020-07-15 09:29:12 +02:00
|
|
|
local root = parsers.get_parser():parse():root()
|
2020-06-19 13:45:33 +02:00
|
|
|
return root:named_descendant_for_range(cursor[1]-1,cursor[2],cursor[1]-1,cursor[2])
|
|
|
|
|
end
|
|
|
|
|
|
2020-07-12 16:11:11 +02:00
|
|
|
function M.highlight_node(node, buf, hl_namespace, hl_group)
|
|
|
|
|
if not node then return end
|
|
|
|
|
M.highlight_range({node:range()}, buf, hl_namespace, hl_group)
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
function M.highlight_range(range, buf, hl_namespace, hl_group)
|
|
|
|
|
local start_row, start_col, end_row, end_col = unpack(range)
|
|
|
|
|
vim.highlight.range(buf, hl_namespace, hl_group, {start_row, start_col}, {end_row, end_col})
|
|
|
|
|
end
|
|
|
|
|
|
2020-06-21 20:38:00 +02:00
|
|
|
-- Set visual selection to node
|
|
|
|
|
function M.update_selection(buf, node)
|
2020-07-15 19:32:41 +02:00
|
|
|
local start_row, start_col, end_row, end_col
|
|
|
|
|
if type(node) == 'table' then
|
|
|
|
|
start_row, start_col, end_row, end_col = unpack(node)
|
|
|
|
|
else
|
|
|
|
|
start_row, start_col, end_row, end_col = node:range()
|
|
|
|
|
end
|
2020-06-21 20:38:00 +02:00
|
|
|
|
|
|
|
|
if end_row == vim.fn.line('$') then
|
|
|
|
|
end_col = #vim.fn.getline('$')
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
-- Convert to 1-based indices
|
|
|
|
|
start_row = start_row + 1
|
|
|
|
|
start_col = start_col + 1
|
|
|
|
|
end_row = end_row + 1
|
|
|
|
|
end_col = end_col + 1
|
|
|
|
|
|
|
|
|
|
vim.fn.setpos(".", { buf, start_row, start_col, 0 })
|
|
|
|
|
vim.fn.nvim_exec("normal v", false)
|
|
|
|
|
|
|
|
|
|
-- Convert exclusive end position to inclusive
|
|
|
|
|
if end_col == 1 then
|
|
|
|
|
vim.fn.setpos(".", { buf, end_row - 1, -1, 0 })
|
|
|
|
|
else
|
|
|
|
|
vim.fn.setpos(".", { buf, end_row, end_col - 1, 0 })
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
-- Byte length of node range
|
|
|
|
|
function M.node_length(node)
|
|
|
|
|
local _, _, start_byte = node:start()
|
|
|
|
|
local _, _, end_byte = node:end_()
|
|
|
|
|
return end_byte - start_byte
|
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
--- Determines whether (line, col) position is in node range
|
|
|
|
|
-- @param node Node defining the range
|
|
|
|
|
-- @param line A line (0-based)
|
|
|
|
|
-- @param col A column (0-based)
|
|
|
|
|
function M.is_in_node_range(node, line, col)
|
|
|
|
|
local start_line, start_col, end_line, end_col = node:range()
|
|
|
|
|
if line >= start_line and line <= end_line then
|
|
|
|
|
if line == start_line and line == end_line then
|
|
|
|
|
return col >= start_col and col < end_col
|
|
|
|
|
elseif line == start_line then
|
|
|
|
|
return col >= start_col
|
|
|
|
|
elseif line == end_line then
|
|
|
|
|
return col < end_col
|
|
|
|
|
else
|
|
|
|
|
return true
|
|
|
|
|
end
|
|
|
|
|
else
|
|
|
|
|
return false
|
|
|
|
|
end
|
|
|
|
|
end
|
|
|
|
|
|
2020-05-08 11:22:59 +02:00
|
|
|
return M
|