mirror of
https://github.com/ckaczor/azuredatastudio.git
synced 2026-02-11 10:38:31 -05:00
Merge from vscode a5cf1da01d5db3d2557132be8d30f89c38019f6c (#8525)
* Merge from vscode a5cf1da01d5db3d2557132be8d30f89c38019f6c * remove files we don't want * fix hygiene * update distro * update distro * fix hygiene * fix strict nulls * distro * distro * fix tests * fix tests * add another edit * fix viewlet icon * fix azure dialog * fix some padding * fix more padding issues
This commit is contained in:
@@ -577,23 +577,34 @@ export class PieceTreeBase {
|
||||
|
||||
let m: RegExpExecArray | null;
|
||||
// Reset regex to search from the beginning
|
||||
searcher.reset(start);
|
||||
let ret: BufferCursor = { line: 0, column: 0 };
|
||||
let searchText: string;
|
||||
let offsetInBuffer: (offset: number) => number;
|
||||
|
||||
if (searcher._wordSeparators) {
|
||||
searchText = buffer.buffer.substring(start, end);
|
||||
offsetInBuffer = (offset: number) => offset + start;
|
||||
searcher.reset(-1);
|
||||
} else {
|
||||
searchText = buffer.buffer;
|
||||
offsetInBuffer = (offset: number) => offset;
|
||||
searcher.reset(start);
|
||||
}
|
||||
|
||||
do {
|
||||
m = searcher.next(buffer.buffer);
|
||||
m = searcher.next(searchText);
|
||||
|
||||
if (m) {
|
||||
if (m.index >= end) {
|
||||
if (offsetInBuffer(m.index) >= end) {
|
||||
return resultLen;
|
||||
}
|
||||
this.positionInBuffer(node, m.index - startOffsetInBuffer, ret);
|
||||
this.positionInBuffer(node, offsetInBuffer(m.index) - startOffsetInBuffer, ret);
|
||||
let lineFeedCnt = this.getLineFeedCnt(node.piece.bufferIndex, startCursor, ret);
|
||||
let retStartColumn = ret.line === startCursor.line ? ret.column - startCursor.column + startColumn : ret.column + 1;
|
||||
let retEndColumn = retStartColumn + m[0].length;
|
||||
result[resultLen++] = createFindMatch(new Range(startLineNumber + lineFeedCnt, retStartColumn, startLineNumber + lineFeedCnt, retEndColumn), m, captureMatches);
|
||||
|
||||
if (m.index + m[0].length >= end) {
|
||||
if (offsetInBuffer(m.index) + m[0].length >= end) {
|
||||
return resultLen;
|
||||
}
|
||||
if (resultLen >= limitResultCount) {
|
||||
|
||||
@@ -57,7 +57,7 @@ export class PieceTreeTextBufferFactory implements ITextBufferFactory {
|
||||
}
|
||||
|
||||
public getFirstLineText(lengthLimit: number): string {
|
||||
return this._chunks[0].buffer.substr(0, 100).split(/\r\n|\r|\n/)[0];
|
||||
return this._chunks[0].buffer.substr(0, lengthLimit).split(/\r\n|\r|\n/)[0];
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user