mirror of
				https://github.com/amix/vimrc
				synced 2025-10-31 06:33:35 +08:00 
			
		
		
		
	Updated plugins
This commit is contained in:
		| @ -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 | ||||
|  | ||||
| @ -233,7 +233,6 @@ endfunction | ||||
|  | ||||
| " FUNCTION: Opener.open(target) {{{1 | ||||
| function! s:Opener.open(target) | ||||
|  | ||||
|     if self._path.isDirectory | ||||
|         call self._openDirectory(a:target) | ||||
|         return | ||||
| @ -303,7 +302,7 @@ endfunction | ||||
|  | ||||
| " FUNCTION: Opener._restoreCursorPos() {{{1 | ||||
| function! s:Opener._restoreCursorPos() | ||||
|     call nerdtree#exec('normal ' . self._tabnr . 'gt') | ||||
|     call nerdtree#exec(self._tabnr . 'tabnext') | ||||
|     call nerdtree#exec(bufwinnr(self._bufnr) . 'wincmd w') | ||||
| endfunction | ||||
|  | ||||
| @ -332,7 +331,7 @@ function! s:Opener._reuseWindow() | ||||
|     let tabnr = self._path.tabnr() | ||||
|     if tabnr | ||||
|         call self._checkToCloseTree(1) | ||||
|         call nerdtree#exec('normal! ' . tabnr . 'gt') | ||||
|         call nerdtree#exec(tabnr . 'tabnext') | ||||
|         let winnr = bufwinnr('^' . self._path.str() . '$') | ||||
|         call nerdtree#exec(winnr . "wincmd w") | ||||
|         return 1 | ||||
|  | ||||
| @ -7,10 +7,6 @@ | ||||
| " ============================================================================ | ||||
|  | ||||
|  | ||||
| " This constant is used throughout this script for sorting purposes. | ||||
| let s:NERDTreeSortStarIndex = index(g:NERDTreeSortOrder, '*') | ||||
| lockvar s:NERDTreeSortStarIndex | ||||
|  | ||||
| let s:Path = {} | ||||
| let g:NERDTreePath = s:Path | ||||
|  | ||||
| @ -374,7 +370,8 @@ function! s:Path.getSortOrderIndex() | ||||
|         endif | ||||
|         let i = i + 1 | ||||
|     endwhile | ||||
|     return s:NERDTreeSortStarIndex | ||||
|  | ||||
|     return index(g:NERDTreeSortOrder, '*') | ||||
| endfunction | ||||
|  | ||||
| " FUNCTION: Path._splitChunks(path) {{{1 | ||||
| @ -395,7 +392,7 @@ endfunction | ||||
| " FUNCTION: Path.getSortKey() {{{1 | ||||
| " returns a key used in compare function for sorting | ||||
| function! s:Path.getSortKey() | ||||
|     if !exists("self._sortKey") | ||||
|     if !exists("self._sortKey") || g:NERDTreeSortOrder !=# g:NERDTreeOldSortOrder | ||||
|         let path = self.getLastPathComponent(1) | ||||
|         if !g:NERDTreeSortHiddenFirst | ||||
|             let path = substitute(path, '^[._]', '', '') | ||||
| @ -820,7 +817,7 @@ function! s:Path.tabnr() | ||||
|     let str = self.str() | ||||
|     for t in range(tabpagenr('$')) | ||||
|         for b in tabpagebuflist(t+1) | ||||
|             if str == expand('#' . b . ':p') | ||||
|             if str ==# expand('#' . b . ':p') | ||||
|                 return t+1 | ||||
|             endif | ||||
|         endfor | ||||
|  | ||||
| @ -247,7 +247,7 @@ function! s:TreeDirNode._glob(pattern, all) | ||||
|     if self.path.str() == getcwd() | ||||
|         let l:pathSpec = ',' | ||||
|     else | ||||
|         let l:pathSpec = fnamemodify(self.path.str({'format': 'Glob'}), ':.') | ||||
|         let l:pathSpec = escape(fnamemodify(self.path.str({'format': 'Glob'}), ':.'), ',') | ||||
|  | ||||
|         " On Windows, the drive letter may be removed by "fnamemodify()". | ||||
|         if nerdtree#runningWindows() && l:pathSpec[0] == g:NERDTreePath.Slash() | ||||
| @ -607,8 +607,12 @@ endfunction | ||||
| " FUNCTION: TreeDirNode.sortChildren() {{{1 | ||||
| " Sort "self.children" by alphabetical order and directory priority. | ||||
| function! s:TreeDirNode.sortChildren() | ||||
|     if count(g:NERDTreeSortOrder, '*') < 1 | ||||
|         call add(g:NERDTreeSortOrder, '*') | ||||
|     endif | ||||
|     let CompareFunc = function("nerdtree#compareNodesBySortKey") | ||||
|     call sort(self.children, CompareFunc) | ||||
|     let g:NERDTreeOldSortOrder = g:NERDTreeSortOrder | ||||
| endfunction | ||||
|  | ||||
| " FUNCTION: TreeDirNode.toggleOpen([options]) {{{1 | ||||
|  | ||||
| @ -475,15 +475,23 @@ function! s:UI.toggleIgnoreFilter() | ||||
| endfunction | ||||
|  | ||||
| " FUNCTION: s:UI.toggleShowBookmarks() {{{1 | ||||
| " toggles the display of bookmarks | ||||
| " Toggle the visibility of the Bookmark table. | ||||
| function! s:UI.toggleShowBookmarks() | ||||
|     let self._showBookmarks = !self._showBookmarks | ||||
|  | ||||
|     if self.getShowBookmarks() | ||||
|         call self.nerdtree.render() | ||||
|         call g:NERDTree.CursorToBookmarkTable() | ||||
|     else | ||||
|  | ||||
|         if empty(g:NERDTreeFileNode.GetSelected()) | ||||
|             call b:NERDTree.root.putCursorHere(0, 0) | ||||
|             normal! 0 | ||||
|         endif | ||||
|  | ||||
|         call self.renderViewSavingPosition() | ||||
|     endif | ||||
|  | ||||
|     call self.centerView() | ||||
| endfunction | ||||
|  | ||||
|  | ||||
| @ -164,7 +164,7 @@ function! NERDTreeMoveNode() | ||||
|         "if the node is open in a buffer, ask the user if they want to | ||||
|         "close that buffer | ||||
|         if bufnum != -1 | ||||
|             let prompt = "\nNode renamed.\n\nThe old file is open in buffer ". bufnum . (bufwinnr(bufnum) ==# -1 ? " (hidden)" : "") .". Replace this buffer with a new file? (yN)" | ||||
|             let prompt = "\nNode renamed.\n\nThe old file is open in buffer ". bufnum . (bufwinnr(bufnum) ==# -1 ? " (hidden)" : "") .". Replace this buffer with the new file? (yN)" | ||||
|             call s:promptToRenameBuffer(bufnum,  prompt, newNodePath) | ||||
|         endif | ||||
|  | ||||
|  | ||||
| @ -81,12 +81,8 @@ call s:initVariable("g:NERDTreeCascadeSingleChildDir", 1) | ||||
|  | ||||
| if !exists("g:NERDTreeSortOrder") | ||||
|     let g:NERDTreeSortOrder = ['\/$', '*', '\.swp$',  '\.bak$', '\~$'] | ||||
| else | ||||
|     "if there isnt a * in the sort sequence then add one | ||||
|     if count(g:NERDTreeSortOrder, '*') < 1 | ||||
|         call add(g:NERDTreeSortOrder, '*') | ||||
|     endif | ||||
| endif | ||||
| let g:NERDTreeOldSortOrder = [] | ||||
|  | ||||
| call s:initVariable("g:NERDTreeGlyphReadOnly", "RO") | ||||
|  | ||||
|  | ||||
		Reference in New Issue
	
	Block a user
	 Amir Salihefendic
					Amir Salihefendic