vim/nerdtree
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Correctly check the type of the sort key's value. Fixes #842.

Browse Source
This commit is contained in:
Phil Runninger (mac) 2018-07-01 19:55:26 -04:00
parent d6032c876c
commit 703e1ef4fe
1 changed files with 2 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
autoload/nerdtree.vim
View File

@ -61,7 +61,6 @@ endfunction
function! nerdtree#compareNodesBySortKey(n1, n2)
let sortKey1 = a:n1.path.getSortKey()
let sortKey2 = a:n2.path.getSortKey()
let i = 0
while i < min([len(sortKey1), len(sortKey2)])
" Compare chunks upto common length.
@ -73,9 +72,9 @@ function! nerdtree#compareNodesBySortKey(n1, n2)
elseif sortKey1[i] ># sortKey2[i]
return 1
endif
elseif sortKey1[i] == type(0)
elseif type(sortKey1[i]) == v:t_number
return -1
elseif sortKey2[i] == type(0)
elseif type(sortKey2[i]) == v:t_number
return 1
endif
let i = i + 1