This commit is contained in:
Kiyan 2021-06-29 23:13:28 +02:00 committed by GitHub
parent 62cfaaef4f
commit a80ea23b4c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 32 additions and 32 deletions

View File

@ -1,6 +1,6 @@
name: Linting and style checking
on: [push, pull_request]
on: [push]
jobs:
luacheck:

View File

@ -69,8 +69,8 @@ end
function M.use_git()
return M.get_icon_state().show_git_icon
or vim.g.nvim_tree_git_hl == 1
or vim.g.nvim_tree_gitignore == 1
or vim.g.nvim_tree_git_hl == 1
or vim.g.nvim_tree_gitignore == 1
end
function M.nvim_tree_callback(callback_name)

View File

@ -369,37 +369,37 @@ end
local M = {}
function M.draw_help()
local help_lines = {'HELP'}
local help_hl = {{'NvimTreeRootFolder', 0, 0, string.len('HELP')}}
local bindings = view.View.bindings
local processed = {}
for i, v in pairs(bindings) do
if v:sub(1,35) == view.nvim_tree_callback('test'):sub(1,35) then
v = v:match("'[^']+'[^']*$")
v = v:match("'[^']+'")
table.insert(processed,{i,v,true})
else
v = '"' .. v .. '"'
table.insert(processed,{i,v,false})
end
local help_lines = {'HELP'}
local help_hl = {{'NvimTreeRootFolder', 0, 0, string.len('HELP')}}
local bindings = view.View.bindings
local processed = {}
for i, v in pairs(bindings) do
if v:sub(1,35) == view.nvim_tree_callback('test'):sub(1,35) then
v = v:match("'[^']+'[^']*$")
v = v:match("'[^']+'")
table.insert(processed,{i,v,true})
else
v = '"' .. v .. '"'
table.insert(processed,{i,v,false})
end
table.sort(processed,function(a,b)
return (a[3]==b[3] and (a[2]<b[2] or (a[2]==b[2] and #a[1]<#b[1]))) or (a[3] and not b[3])
end)
local i, v, builtin
for num, val in pairs(processed) do
i = val[1]
v = val[2]
builtin = val[3]
local bind_string = string.format("%6s : %s",i,v)
table.insert(help_lines,bind_string)
local hl_len = math.max(6,#i)+2
table.insert(help_hl,{'NvimTreeFolderName', num, 0, hl_len})
if not builtin then
table.insert(help_hl,{'NvimTreeFileRenamed', num, hl_len, -1})
end
end
table.sort(processed,function(a,b)
return (a[3]==b[3] and (a[2]<b[2] or (a[2]==b[2] and #a[1]<#b[1]))) or (a[3] and not b[3])
end)
local i, v, builtin
for num, val in pairs(processed) do
i = val[1]
v = val[2]
builtin = val[3]
local bind_string = string.format("%6s : %s",i,v)
table.insert(help_lines,bind_string)
local hl_len = math.max(6,#i)+2
table.insert(help_hl,{'NvimTreeFolderName', num, 0, hl_len})
if not builtin then
table.insert(help_hl,{'NvimTreeFileRenamed', num, hl_len, -1})
end
return help_lines, help_hl
end
return help_lines, help_hl
end
function M.draw(tree, reload)