提交 d4841fd5 编写于 作者: P Peng Lyu

re #45770. Test case for chunk based search.

上级 eb2b0dfc
......@@ -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));
});
});
\ No newline at end of file
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册