Skip to content

Path.getSortOrderIndex() optimisation. #1429

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Sep 26, 2025
Merged

Path.getSortOrderIndex() optimisation. #1429

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b98c51a
speedup: Path.getSortOrderIndex() optimisation.
Eugenij-W Aug 24, 2024
26340e0
refactor: remove the redundant new line
rzvxa Sep 26, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion lib/nerdtree/path.vim
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -362,9 +362,10 @@ endfunction
" returns the index of the pattern in g:NERDTreeSortOrder that this path matches
function! s:Path.getSortOrderIndex()
let i = 0
let l:lpc = self.getLastPathComponent(1)
while i < len(g:NERDTreeSortOrder)
if g:NERDTreeSortOrder[i] !~? '\[\[-\?\(timestamp\|size\|extension\)\]\]' &&
\ self.getLastPathComponent(1) =~# g:NERDTreeSortOrder[i]
\ l:lpc =~# g:NERDTreeSortOrder[i]
return i
endif
let i = i + 1
Expand All @@ -373,6 +374,7 @@ function! s:Path.getSortOrderIndex()
return index(g:NERDTreeSortOrder, '*')
endfunction


" FUNCTION: Path._splitChunks(path) {{{1
" returns a list of path chunks
function! s:Path._splitChunks(path)
Expand Down
Loading