Microsoft/vscode
1
0
Fork 0
mirror of https://github.com/microsoft/vscode.git synced 2025-12-25 04:36:23 +00:00
Code Issues Packages Projects Releases Wiki Activity

re #45770. Test case for chunk based search.

Browse Source
This commit is contained in:
Peng Lyu
2018-03-16 15:23:39 -07:00
parent eb2b0dfc20
commit d4841fd59c
1 changed files with 23 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
src/vs/editor/test/common/model/pieceTreeTextBuffer/pieceTreeTextBuffer.test.ts
View File

@@ -1787,4 +1787,27 @@ suite('chunk based search', () => {
let ret = pieceTree.findMatchesLineByLine(new Range(1, 1, 1, 1), new SearchData(/abc/, new WordCharacterClassifier(',./'), 'abc'), true, 1000);
assert.equal(ret.length, 0);
});
test('#45770. FindInNode should not cross node boundary.', () => {
let pieceTree = createTextBuffer([
[
'balabalababalabalababalabalaba',
'balabalababalabalababalabalaba',
'',
'* [ ] task1',
'* [x] task2 balabalaba',
'* [ ] task 3'
].join('\n')
]);
pieceTree.delete(0, 62);
pieceTree.delete(16, 1);
pieceTree.insert(16, ' ');
let ret = pieceTree.findMatchesLineByLine(new Range(1, 1, 4, 13), new SearchData(/\[/gi, new WordCharacterClassifier(',./'), '['), true, 1000);
assert.equal(ret.length, 3);
assert.deepEqual(ret[0].range, new Range(2, 3, 2, 4));
assert.deepEqual(ret[1].range, new Range(3, 3, 3, 4));
assert.deepEqual(ret[2].range, new Range(4, 3, 4, 4));
});
});