forks/ale
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Add some unit tests for the BinarySearch function.

Browse source
This commit is contained in:
w0rp 2016-10-13 21:24:47 +01:00
parent f506887b28
commit a089fabb5c
3 changed files with 62 additions and 36 deletions
Download patch file Download diff file Expand all files Collapse all files

26
test/test_loclist_binary_search.vader Normal file
View file

@ -0,0 +1,26 @@
Before:
let g:loclist = [
\ {'lnum': 2, 'col': 10},
\ {'lnum': 3, 'col': 2},
\ {'lnum': 3, 'col': 10},
\ {'lnum': 3, 'col': 12},
\ {'lnum': 3, 'col': 25},
\ {'lnum': 5, 'col': 4},
\ {'lnum': 5, 'col': 5},
\]
Execute (Exact column matches should be correct):
AssertEqual ale#util#BinarySearch(g:loclist, 3, 2), 1
Execute (Off lines, there should be no match):
AssertEqual ale#util#BinarySearch(g:loclist, 4, 2), -1
Execute (Near column matches should be taken):
AssertEqual ale#util#BinarySearch(g:loclist, 3, 11), 2
AssertEqual ale#util#BinarySearch(g:loclist, 3, 13), 4
Execute (Columns before should be taken when the cursor is far ahead):
AssertEqual ale#util#BinarySearch(g:loclist, 3, 300), 4
After:
unlet g:loclist