mirror of
https://github.com/ckaczor/azuredatastudio.git
synced 2026-02-11 02:32:35 -05:00
180 lines
5.3 KiB
TypeScript
180 lines
5.3 KiB
TypeScript
/*---------------------------------------------------------------------------------------------
|
|
* Copyright (c) Microsoft Corporation. All rights reserved.
|
|
* Licensed under the Source EULA. See License.txt in the project root for license information.
|
|
*--------------------------------------------------------------------------------------------*/
|
|
|
|
import { CharCode } from 'vs/base/common/charCode';
|
|
import * as strings from 'vs/base/common/strings';
|
|
import { DefaultEndOfLine, ITextBuffer, ITextBufferBuilder, ITextBufferFactory } from 'vs/editor/common/model';
|
|
import { StringBuffer, createLineStarts, createLineStartsFast } from 'vs/editor/common/model/pieceTreeTextBuffer/pieceTreeBase';
|
|
import { PieceTreeTextBuffer } from 'vs/editor/common/model/pieceTreeTextBuffer/pieceTreeTextBuffer';
|
|
|
|
export class PieceTreeTextBufferFactory implements ITextBufferFactory {
|
|
|
|
constructor(
|
|
private readonly _chunks: StringBuffer[],
|
|
private readonly _bom: string,
|
|
private readonly _cr: number,
|
|
private readonly _lf: number,
|
|
private readonly _crlf: number,
|
|
private readonly _containsRTL: boolean,
|
|
private readonly _isBasicASCII: boolean,
|
|
private readonly _normalizeEOL: boolean
|
|
) { }
|
|
|
|
private _getEOL(defaultEOL: DefaultEndOfLine): '\r\n' | '\n' {
|
|
const totalEOLCount = this._cr + this._lf + this._crlf;
|
|
const totalCRCount = this._cr + this._crlf;
|
|
if (totalEOLCount === 0) {
|
|
// This is an empty file or a file with precisely one line
|
|
return (defaultEOL === DefaultEndOfLine.LF ? '\n' : '\r\n');
|
|
}
|
|
if (totalCRCount > totalEOLCount / 2) {
|
|
// More than half of the file contains \r\n ending lines
|
|
return '\r\n';
|
|
}
|
|
// At least one line more ends in \n
|
|
return '\n';
|
|
}
|
|
|
|
public create(defaultEOL: DefaultEndOfLine): ITextBuffer {
|
|
const eol = this._getEOL(defaultEOL);
|
|
let chunks = this._chunks;
|
|
|
|
if (this._normalizeEOL &&
|
|
((eol === '\r\n' && (this._cr > 0 || this._lf > 0))
|
|
|| (eol === '\n' && (this._cr > 0 || this._crlf > 0)))
|
|
) {
|
|
// Normalize pieces
|
|
for (let i = 0, len = chunks.length; i < len; i++) {
|
|
let str = chunks[i].buffer.replace(/\r\n|\r|\n/g, eol);
|
|
let newLineStart = createLineStartsFast(str);
|
|
chunks[i] = new StringBuffer(str, newLineStart);
|
|
}
|
|
}
|
|
|
|
return new PieceTreeTextBuffer(chunks, this._bom, eol, this._containsRTL, this._isBasicASCII, this._normalizeEOL);
|
|
}
|
|
|
|
public getFirstLineText(lengthLimit: number): string {
|
|
return this._chunks[0].buffer.substr(0, 100).split(/\r\n|\r|\n/)[0];
|
|
}
|
|
}
|
|
|
|
export class PieceTreeTextBufferBuilder implements ITextBufferBuilder {
|
|
private chunks: StringBuffer[];
|
|
private BOM: string;
|
|
|
|
private _hasPreviousChar: boolean;
|
|
private _previousChar: number;
|
|
private _tmpLineStarts: number[];
|
|
|
|
private cr: number;
|
|
private lf: number;
|
|
private crlf: number;
|
|
private containsRTL: boolean;
|
|
private isBasicASCII: boolean;
|
|
|
|
constructor() {
|
|
this.chunks = [];
|
|
this.BOM = '';
|
|
|
|
this._hasPreviousChar = false;
|
|
this._previousChar = 0;
|
|
this._tmpLineStarts = [];
|
|
|
|
this.cr = 0;
|
|
this.lf = 0;
|
|
this.crlf = 0;
|
|
this.containsRTL = false;
|
|
this.isBasicASCII = true;
|
|
}
|
|
|
|
public acceptChunk(chunk: string): void {
|
|
if (chunk.length === 0) {
|
|
return;
|
|
}
|
|
|
|
if (this.chunks.length === 0) {
|
|
if (strings.startsWithUTF8BOM(chunk)) {
|
|
this.BOM = strings.UTF8_BOM_CHARACTER;
|
|
chunk = chunk.substr(1);
|
|
}
|
|
}
|
|
|
|
const lastChar = chunk.charCodeAt(chunk.length - 1);
|
|
if (lastChar === CharCode.CarriageReturn || (lastChar >= 0xd800 && lastChar <= 0xdbff)) {
|
|
// last character is \r or a high surrogate => keep it back
|
|
this._acceptChunk1(chunk.substr(0, chunk.length - 1), false);
|
|
this._hasPreviousChar = true;
|
|
this._previousChar = lastChar;
|
|
} else {
|
|
this._acceptChunk1(chunk, false);
|
|
this._hasPreviousChar = false;
|
|
this._previousChar = lastChar;
|
|
}
|
|
}
|
|
|
|
private _acceptChunk1(chunk: string, allowEmptyStrings: boolean): void {
|
|
if (!allowEmptyStrings && chunk.length === 0) {
|
|
// Nothing to do
|
|
return;
|
|
}
|
|
|
|
if (this._hasPreviousChar) {
|
|
this._acceptChunk2(String.fromCharCode(this._previousChar) + chunk);
|
|
} else {
|
|
this._acceptChunk2(chunk);
|
|
}
|
|
}
|
|
|
|
private _acceptChunk2(chunk: string): void {
|
|
const lineStarts = createLineStarts(this._tmpLineStarts, chunk);
|
|
|
|
this.chunks.push(new StringBuffer(chunk, lineStarts.lineStarts));
|
|
this.cr += lineStarts.cr;
|
|
this.lf += lineStarts.lf;
|
|
this.crlf += lineStarts.crlf;
|
|
|
|
if (this.isBasicASCII) {
|
|
this.isBasicASCII = lineStarts.isBasicASCII;
|
|
}
|
|
if (!this.isBasicASCII && !this.containsRTL) {
|
|
// No need to check if is basic ASCII
|
|
this.containsRTL = strings.containsRTL(chunk);
|
|
}
|
|
}
|
|
|
|
public finish(normalizeEOL: boolean = true): PieceTreeTextBufferFactory {
|
|
this._finish();
|
|
return new PieceTreeTextBufferFactory(
|
|
this.chunks,
|
|
this.BOM,
|
|
this.cr,
|
|
this.lf,
|
|
this.crlf,
|
|
this.containsRTL,
|
|
this.isBasicASCII,
|
|
normalizeEOL
|
|
);
|
|
}
|
|
|
|
private _finish(): void {
|
|
if (this.chunks.length === 0) {
|
|
this._acceptChunk1('', true);
|
|
}
|
|
|
|
if (this._hasPreviousChar) {
|
|
this._hasPreviousChar = false;
|
|
// recreate last chunk
|
|
let lastChunk = this.chunks[this.chunks.length - 1];
|
|
lastChunk.buffer += String.fromCharCode(this._previousChar);
|
|
let newLineStarts = createLineStartsFast(lastChunk.buffer);
|
|
lastChunk.lineStarts = newLineStarts;
|
|
if (this._previousChar === CharCode.CarriageReturn) {
|
|
this.cr++;
|
|
}
|
|
}
|
|
}
|
|
}
|