reformat, refactor code, run fs command with luv.spawn
This commit is contained in:
kiyan42
@@ -1,19 +1,14 @@
|
||||
local api = vim.api
|
||||
local utils = require'lib.utils'
|
||||
local gitutils = require 'lib.git'
|
||||
local fs = require 'lib.fs'
|
||||
|
||||
local function syslist(v) return api.nvim_call_function('systemlist', { v }) end
|
||||
local M = {}
|
||||
|
||||
local get_git_attr = require 'lib/git'.get_git_attr
|
||||
local fs = require 'lib/fs'
|
||||
local is_dir = fs.is_dir
|
||||
local is_symlink = fs.is_symlink
|
||||
local get_cwd = fs.get_cwd
|
||||
local link_to = fs.link_to
|
||||
local ROOT_PATH = fs.get_cwd() .. '/'
|
||||
|
||||
local ROOT_PATH = get_cwd() .. '/'
|
||||
|
||||
local function set_root_path(path)
|
||||
ROOT_PATH = path
|
||||
function M.set_root_path(path)
|
||||
ROOT_PATH = path
|
||||
end
|
||||
|
||||
local Tree = {}
|
||||
@@ -24,100 +19,99 @@ local MACOS = api.nvim_call_function('has', { 'macunix' }) == 1
|
||||
|
||||
-- --ignore does not work with mac ls
|
||||
if not MACOS and api.nvim_call_function('exists', { 'g:lua_tree_ignore' }) == 1 then
|
||||
local ignore_patterns = api.nvim_get_var('lua_tree_ignore')
|
||||
if type(ignore_patterns) == 'table' then
|
||||
for _, pattern in pairs(ignore_patterns) do
|
||||
IGNORE_LIST = IGNORE_LIST .. '--ignore='..pattern..' '
|
||||
end
|
||||
local ignore_patterns = api.nvim_get_var('lua_tree_ignore')
|
||||
if type(ignore_patterns) == 'table' then
|
||||
for _, pattern in pairs(ignore_patterns) do
|
||||
IGNORE_LIST = IGNORE_LIST .. '--ignore='..pattern..' '
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
local function list_dirs(path)
|
||||
local ls_cmd = 'ls -A '..IGNORE_LIST..path
|
||||
return syslist(ls_cmd)
|
||||
return api.nvim_call_function('systemlist', { 'ls -A '..IGNORE_LIST..path })
|
||||
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
|
||||
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
|
||||
return sorted_tree
|
||||
end
|
||||
|
||||
local function create_nodes(path, relpath, depth, dirs)
|
||||
local tree = {}
|
||||
local tree = {}
|
||||
|
||||
if not path:find('^.*/$') then path = path .. '/' end
|
||||
if not relpath:find('^.*/$') and depth > 0 then relpath = relpath .. '/' end
|
||||
if not path:find('^.*/$') then path = path .. '/' end
|
||||
if not relpath:find('^.*/$') and depth > 0 then relpath = relpath .. '/' end
|
||||
|
||||
for i, name in pairs(dirs) do
|
||||
local full_path = path..name
|
||||
local dir = is_dir(full_path)
|
||||
local link = is_symlink(full_path)
|
||||
local linkto = link == true and link_to(full_path) or nil
|
||||
local rel_path = relpath ..name
|
||||
tree[i] = {
|
||||
path = path,
|
||||
relpath = rel_path,
|
||||
link = link,
|
||||
linkto = linkto,
|
||||
name = name,
|
||||
depth = depth,
|
||||
dir = dir,
|
||||
open = false,
|
||||
icon = true,
|
||||
git = get_git_attr(rel_path, dir)
|
||||
}
|
||||
end
|
||||
for i, name in pairs(dirs) do
|
||||
local full_path = path..name
|
||||
local dir = fs.is_dir(full_path)
|
||||
local link = fs.is_symlink(full_path)
|
||||
local linkto = link == true and fs.link_to(full_path) or nil
|
||||
local rel_path = relpath ..name
|
||||
tree[i] = {
|
||||
path = path,
|
||||
relpath = rel_path,
|
||||
link = link,
|
||||
linkto = linkto,
|
||||
name = name,
|
||||
depth = depth,
|
||||
dir = dir,
|
||||
open = false,
|
||||
icon = true,
|
||||
git = gitutils.get_git_attr(rel_path, dir)
|
||||
}
|
||||
end
|
||||
|
||||
return sort_dirs(tree)
|
||||
return sort_dirs(tree)
|
||||
end
|
||||
|
||||
local function init_tree()
|
||||
Tree = create_nodes(ROOT_PATH, '', 0, list_dirs(ROOT_PATH))
|
||||
if ROOT_PATH ~= '/' then
|
||||
table.insert(Tree, 1, {
|
||||
path = ROOT_PATH,
|
||||
name = '..',
|
||||
depth = 0,
|
||||
dir = true,
|
||||
open = false,
|
||||
icon = false,
|
||||
git = ''
|
||||
})
|
||||
end
|
||||
function M.init_tree()
|
||||
Tree = create_nodes(ROOT_PATH, '', 0, list_dirs(ROOT_PATH))
|
||||
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 = {}
|
||||
function M.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
|
||||
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()
|
||||
M.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
|
||||
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 clone(obj)
|
||||
@@ -127,63 +121,55 @@ local function clone(obj)
|
||||
return res
|
||||
end
|
||||
|
||||
local function find_file(path)
|
||||
local relpath = string.sub(path, #ROOT_PATH + 1, -1)
|
||||
function M.find_file(path)
|
||||
local relpath = string.sub(path, #ROOT_PATH + 1, -1)
|
||||
|
||||
local tree_copy = clone(Tree)
|
||||
local tree_copy = clone(Tree)
|
||||
|
||||
for i, node in pairs(tree_copy) do
|
||||
if node.relpath and relpath:find(utils.path_to_matching_str(node.relpath)) then
|
||||
if node.relpath == relpath then
|
||||
Tree = clone(tree_copy)
|
||||
return i
|
||||
end
|
||||
if node.dir and not node.open then
|
||||
local path = node.path .. node.name
|
||||
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_copy, i + j, n)
|
||||
end
|
||||
end
|
||||
for i, node in pairs(tree_copy) do
|
||||
if node.relpath and relpath:find(utils.path_to_matching_str(node.relpath)) then
|
||||
if node.relpath == relpath then
|
||||
Tree = clone(tree_copy)
|
||||
return i
|
||||
end
|
||||
if node.dir and not node.open then
|
||||
local dirpath = node.path .. node.name
|
||||
node.open = true
|
||||
local dirs = list_dirs(dirpath)
|
||||
for j, n in pairs(create_nodes(dirpath, node.relpath, node.depth + 1, dirs)) do
|
||||
table.insert(tree_copy, i + j, n)
|
||||
end
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
return nil
|
||||
return nil
|
||||
end
|
||||
|
||||
local function open_dir(tree_index)
|
||||
local node = Tree[tree_index];
|
||||
node.open = not node.open
|
||||
function M.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]
|
||||
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
|
||||
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(tostring(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
|
||||
function M.get_tree()
|
||||
return Tree
|
||||
end
|
||||
|
||||
return {
|
||||
init_tree = init_tree;
|
||||
get_tree = get_tree;
|
||||
refresh_tree = refresh_tree;
|
||||
open_dir = open_dir;
|
||||
set_root_path = set_root_path;
|
||||
get_cwd = get_cwd;
|
||||
find_file = find_file;
|
||||
}
|
||||
return M
|
||||
|
||||
Reference in New Issue
Block a user