Phil Runninger 23000acd7f Refactor sort comparison functions, removing redundancy (#1166) ... * Add a function to compare path objects. * Remove redundant node comparison function, and rename the ones left. * Remove the compareTo function in the Path object. Use nerdtree#compareNodePaths(p1,p2) instead. There was no need for two comparison functions that do the same thing. They were a little different in their details, but that shouldn't be the case. Having only one such function makes better sense and is easier to maintain. * Update version number in change log.		2020-08-14 18:06:03 -04:00
..
nerdtree	Fix the scope of several key mappings (#1151)	2020-07-12 10:03:24 -04:00
nerdtree.vim	Refactor sort comparison functions, removing redundancy (#1166)	2020-08-14 18:06:03 -04:00