ac92bfd911
- fix a bug when removing nodes from huge dir - only one `system` call for git status - add relative paths to nodes - parse git status from relative paths
141 lines
3.6 KiB
Lua
141 lines
3.6 KiB
Lua
local api = vim.api
|
|
local function syslist(v) return api.nvim_call_function('systemlist', { v }) end
|
|
local get_root_path = require 'lib/conf'.get_root_path
|
|
local get_git_attr = require 'lib/git'.get_git_attr
|
|
|
|
local Tree = {}
|
|
|
|
local function is_dir(path)
|
|
local stat = vim.loop.fs_stat(path)
|
|
return stat and stat.type == 'directory' or false
|
|
end
|
|
|
|
local function check_dir_access(path)
|
|
return vim.loop.fs_access(path, 'R') == true
|
|
end
|
|
|
|
local function list_dirs(path)
|
|
local ls_cmd = 'ls -A --ignore=.git '
|
|
if path == nil then
|
|
return syslist(ls_cmd)
|
|
elseif check_dir_access(path) == false then
|
|
-- TODO: display an error here (permission denied)
|
|
return {}
|
|
else
|
|
return syslist(ls_cmd .. path)
|
|
end
|
|
end
|
|
|
|
local function sort_dirs(dirs)
|
|
local sorted_tree = {}
|
|
for _, node in pairs(dirs) do
|
|
if node.dir == true then
|
|
table.insert(sorted_tree, 1, node)
|
|
else
|
|
table.insert(sorted_tree, node)
|
|
end
|
|
end
|
|
|
|
return sorted_tree
|
|
end
|
|
|
|
local function create_nodes(path, relpath, depth, dirs)
|
|
local tree = {}
|
|
|
|
if not string.find(path, '^.*/$') then path = path .. '/' end
|
|
if not string.find(relpath, '^.*/$') and depth > 0 then relpath = relpath .. '/' end
|
|
|
|
for i, name in pairs(dirs) do
|
|
local dir = is_dir(path..name)
|
|
local rel_path = relpath ..name
|
|
tree[i] = {
|
|
path = path,
|
|
relpath = rel_path,
|
|
name = name,
|
|
depth = depth,
|
|
dir = dir,
|
|
open = false,
|
|
icon = true,
|
|
git = get_git_attr(rel_path, dir)
|
|
}
|
|
end
|
|
|
|
return sort_dirs(tree)
|
|
end
|
|
|
|
local function init_tree()
|
|
local ROOT_PATH = get_root_path()
|
|
Tree = create_nodes(ROOT_PATH, '', 0, list_dirs())
|
|
if ROOT_PATH ~= '/' then
|
|
table.insert(Tree, 1, {
|
|
path = ROOT_PATH,
|
|
name = '..',
|
|
depth = 0,
|
|
dir = true,
|
|
open = false,
|
|
icon = false,
|
|
git = ''
|
|
})
|
|
end
|
|
end
|
|
|
|
local function refresh_tree()
|
|
local cache = {}
|
|
|
|
for _, v in pairs(Tree) do
|
|
if v.dir == true and v.open == true then
|
|
table.insert(cache, v.path .. v.name)
|
|
end
|
|
end
|
|
|
|
init_tree()
|
|
|
|
for i, node in pairs(Tree) do
|
|
if node.dir == true then
|
|
for _, path in pairs(cache) do
|
|
if node.path .. node.name == path then
|
|
node.open = true
|
|
local dirs = list_dirs(path)
|
|
for j, n in pairs(create_nodes(path, node.relpath, node.depth + 1, dirs)) do
|
|
table.insert(Tree, i + j, n)
|
|
end
|
|
end
|
|
end
|
|
end
|
|
end
|
|
end
|
|
|
|
local function open_dir(tree_index)
|
|
local node = Tree[tree_index];
|
|
node.open = not node.open
|
|
|
|
if node.open == false then
|
|
local next_index = tree_index + 1;
|
|
local next_node = Tree[next_index]
|
|
|
|
while next_node ~= nil and next_node.depth > node.depth do
|
|
table.remove(Tree, next_index)
|
|
next_node = Tree[next_index]
|
|
end
|
|
else
|
|
local dirlist = list_dirs(node.path .. node.name)
|
|
local child_dirs = create_nodes(node.path .. node.name .. '/', node.relpath, node.depth + 1, dirlist)
|
|
|
|
for i, n in pairs(child_dirs) do
|
|
table.insert(Tree, tree_index + i, n)
|
|
end
|
|
end
|
|
end
|
|
|
|
local function get_tree()
|
|
return Tree
|
|
end
|
|
|
|
return {
|
|
init_tree = init_tree;
|
|
get_tree = get_tree;
|
|
refresh_tree = refresh_tree;
|
|
open_dir = open_dir;
|
|
check_dir_access = check_dir_access;
|
|
}
|