chore: reindent sibling function
This commit is contained in:
@@ -71,28 +71,28 @@ function M.sibling(direction)
|
|||||||
|
|
||||||
-- Check if current node is already at root entries
|
-- Check if current node is already at root entries
|
||||||
for index, entry in ipairs(lib().Tree.entries) do
|
for index, entry in ipairs(lib().Tree.entries) do
|
||||||
if node_path == entry.absolute_path then
|
if node_path == entry.absolute_path then
|
||||||
line = index
|
line = index
|
||||||
end
|
end
|
||||||
end
|
end
|
||||||
|
|
||||||
if line > 0 then
|
if line > 0 then
|
||||||
parent = lib().Tree
|
parent = lib().Tree
|
||||||
else
|
else
|
||||||
_, parent = iter(lib().Tree.entries, true)
|
_, parent = iter(lib().Tree.entries, true)
|
||||||
if parent ~= nil and #parent.entries > 1 then
|
if parent ~= nil and #parent.entries > 1 then
|
||||||
line, _ = get_line_from_node(node)(parent.entries)
|
line, _ = get_line_from_node(node)(parent.entries)
|
||||||
end
|
end
|
||||||
|
|
||||||
-- Ignore parent line count
|
-- Ignore parent line count
|
||||||
line = line - 1
|
line = line - 1
|
||||||
end
|
end
|
||||||
|
|
||||||
local index = line + direction
|
local index = line + direction
|
||||||
if index < 1 then
|
if index < 1 then
|
||||||
index = 1
|
index = 1
|
||||||
elseif index > #parent.entries then
|
elseif index > #parent.entries then
|
||||||
index = #parent.entries
|
index = #parent.entries
|
||||||
end
|
end
|
||||||
local target_node = parent.entries[index]
|
local target_node = parent.entries[index]
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user