nerdtree

Index Commits Files Refs

commit 703e1ef4fe8350afbc61ce8271f72cef2d5c363a
parent d6032c876c6d6932ab7f07e262a16c9a85a31d5b
Author: Phil Runninger (mac) <prunninger@vhtcx.com>
Date:   Sun,  1 Jul 2018 19:55:26 -0400

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

Diffstat:
M
autoload/nerdtree.vim
 | 
5
++---

1 file changed, 2 insertions(+), 3 deletions(-)
diff --git a/autoload/nerdtree.vim b/autoload/nerdtree.vim
@@ -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