RepoMirrors/ale
1
0
Fork 0
mirror of https://github.com/dense-analysis/ale synced 2024-12-24 07:02:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Simplify the loclist jumping code a little

Browse Source
This commit is contained in:
w0rp 2017-08-13 13:06:22 +01:00
parent c6d11f4281
commit f67fc43d9b
1 changed files with 4 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
autoload/ale/loclist_jumping.vim
View File

@ -13,16 +13,13 @@ function! ale#loclist_jumping#FindNearest(direction, wrap) abort
let l:buffer = bufnr('')
let l:pos = getcurpos()
let l:info = get(g:ale_buffer_info, bufnr('%'), {'loclist': []})
" This list will have already been sorted.
let l:loclist = l:info.loclist
" Copy the list and filter to only the items in this buffer.
let l:loclist = filter(copy(l:info.loclist), 'v:val.bufnr == l:buffer')
let l:search_item = {'bufnr': l:buffer, 'lnum': l:pos[1], 'col': l:pos[2]}
" Copy the List and filter it to only items in this buffer.
let l:loclist = filter(copy(l:loclist), 'v:val.bufnr == l:buffer')
" When searching backwards, so we can find the next smallest match.
if a:direction is# 'before'
let l:loclist = reverse(l:loclist)
call reverse(l:loclist)
endif
" Look for items before or after the current position.
@ -76,8 +73,7 @@ endfunction
function! ale#loclist_jumping#JumpToIndex(index) abort
let l:buffer = bufnr('')
let l:info = get(g:ale_buffer_info, l:buffer, {'loclist': []})
let l:loclist = l:info.loclist
let l:loclist = filter(copy(l:loclist), 'v:val.bufnr == l:buffer')
let l:loclist = filter(copy(l:info.loclist), 'v:val.bufnr == l:buffer')
if empty(l:loclist)
return