Phil Runninger f98078d3ae Force sort to recalculate the cached sortKey. (#898) ... * Force sort to recalculate the cached sortKey. The problem in issue #880 was caused by the sort using the old sortKey. For example, given nodes A, B, and C, if B were renamed to D, the sort was still using B as its sortKey, thus not moving it. It's a bit of a hack, but if we set g:NERDTreeOldSortOrder to an empty list, the cached sortKey will be recalculated. I did the same thing for both the Copy and Add functions as well. * Add a comment to explain the let ... = [] statement.		2018-10-18 16:13:15 -04:00
..
exec_menuitem.vim	remove some unneeded header comments	2015-11-13 16:54:47 +00:00
fs_menu.vim	Force sort to recalculate the cached sortKey. (#898)	2018-10-18 16:13:15 -04:00