TypeScript/src/server/scriptVersionCache.ts at master · mkusher/TypeScript · GitHub

History

948 lines (868 loc) · 36.9 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

/// <reference path="..\compiler\commandLineParser.ts" />

/// <reference path="..\services\services.ts" />

/// <reference path="session.ts" />

namespace ts.server {

const lineCollectionCapacity = 4;

export interface LineCollection {

charCount(): number;

lineCount(): number;

isLeaf(): boolean;

walk(rangeStart: number, rangeLength: number, walkFns: ILineIndexWalker): void;

}

export interface ILineInfo {

line: number;

offset: number;

text?: string;

leaf?: LineLeaf;

}

export enum CharRangeSection {

PreStart,

Start,

Entire,

Mid,

End,

PostEnd

}

export interface ILineIndexWalker {

goSubtree: boolean;

done: boolean;

leaf(relativeStart: number, relativeLength: number, lineCollection: LineLeaf): void;

pre?(relativeStart: number, relativeLength: number, lineCollection: LineCollection,

parent: LineNode, nodeType: CharRangeSection): LineCollection;

post?(relativeStart: number, relativeLength: number, lineCollection: LineCollection,

parent: LineNode, nodeType: CharRangeSection): LineCollection;

}

class BaseLineIndexWalker implements ILineIndexWalker {

goSubtree = true;

done = false;

leaf(_rangeStart: number, _rangeLength: number, _ll: LineLeaf) {

}

class EditWalker extends BaseLineIndexWalker {

lineIndex = new LineIndex();

// path to start of range

startPath: LineCollection[];

endBranch: LineCollection[] = [];

branchNode: LineNode;

// path to current node

stack: LineNode[];

state = CharRangeSection.Entire;

lineCollectionAtBranch: LineCollection;

initialText = "";

trailingText = "";

suppressTrailingText = false;

constructor() {

super();

this.lineIndex.root = new LineNode();

this.startPath = [this.lineIndex.root];

this.stack = [this.lineIndex.root];

}

insertLines(insertedText: string) {

if (this.suppressTrailingText) {

this.trailingText = "";

}

if (insertedText) {

insertedText = this.initialText + insertedText + this.trailingText;

}

else {

insertedText = this.initialText + this.trailingText;

}

const lm = LineIndex.linesFromText(insertedText);

const lines = lm.lines;

if (lines.length > 1) {

if (lines[lines.length - 1] == "") {

lines.length--;

}

let branchParent: LineNode;

let lastZeroCount: LineCollection;

for (let k = this.endBranch.length - 1; k >= 0; k--) {

(<LineNode>this.endBranch[k]).updateCounts();

if (this.endBranch[k].charCount() === 0) {

lastZeroCount = this.endBranch[k];

if (k > 0) {

branchParent = <LineNode>this.endBranch[k - 1];

}

else {

branchParent = this.branchNode;

}

if (lastZeroCount) {

branchParent.remove(lastZeroCount);

}

// path at least length two (root and leaf)

let insertionNode = <LineNode>this.startPath[this.startPath.length - 2];

const leafNode = <LineLeaf>this.startPath[this.startPath.length - 1];

const len = lines.length;

if (len > 0) {

leafNode.text = lines[0];

if (len > 1) {

let insertedNodes = <LineCollection[]>new Array(len - 1);

let startNode = <LineCollection>leafNode;

for (let i = 1; i < lines.length; i++) {

insertedNodes[i - 1] = new LineLeaf(lines[i]);

}

let pathIndex = this.startPath.length - 2;

while (pathIndex >= 0) {

insertionNode = <LineNode>this.startPath[pathIndex];

insertedNodes = insertionNode.insertAt(startNode, insertedNodes);

pathIndex--;

startNode = insertionNode;

}

let insertedNodesLen = insertedNodes.length;

while (insertedNodesLen > 0) {

const newRoot = new LineNode();

newRoot.add(this.lineIndex.root);

insertedNodes = newRoot.insertAt(this.lineIndex.root, insertedNodes);

insertedNodesLen = insertedNodes.length;

this.lineIndex.root = newRoot;

}

this.lineIndex.root.updateCounts();

}

else {

for (let j = this.startPath.length - 2; j >= 0; j--) {

(<LineNode>this.startPath[j]).updateCounts();

}

else {

// no content for leaf node, so delete it

insertionNode.remove(leafNode);

for (let j = this.startPath.length - 2; j >= 0; j--) {

(<LineNode>this.startPath[j]).updateCounts();

}

return this.lineIndex;

}

post(_relativeStart: number, _relativeLength: number, lineCollection: LineCollection): LineCollection {

// have visited the path for start of range, now looking for end

// if range is on single line, we will never make this state transition

if (lineCollection === this.lineCollectionAtBranch) {

this.state = CharRangeSection.End;

}

// always pop stack because post only called when child has been visited

this.stack.length--;

return undefined;

}

pre(_relativeStart: number, _relativeLength: number, lineCollection: LineCollection, _parent: LineCollection, nodeType: CharRangeSection) {

// currentNode corresponds to parent, but in the new tree

const currentNode = this.stack[this.stack.length - 1];

if ((this.state === CharRangeSection.Entire) && (nodeType === CharRangeSection.Start)) {

// if range is on single line, we will never make this state transition

this.state = CharRangeSection.Start;

this.branchNode = currentNode;

this.lineCollectionAtBranch = lineCollection;

}

let child: LineCollection;

function fresh(node: LineCollection): LineCollection {

if (node.isLeaf()) {

return new LineLeaf("");

}

else return new LineNode();

}

switch (nodeType) {

case CharRangeSection.PreStart:

this.goSubtree = false;

if (this.state !== CharRangeSection.End) {

currentNode.add(lineCollection);

}

break;

case CharRangeSection.Start:

if (this.state === CharRangeSection.End) {

this.goSubtree = false;

}

else {

child = fresh(lineCollection);

currentNode.add(child);

this.startPath[this.startPath.length] = child;

}

break;

case CharRangeSection.Entire:

if (this.state !== CharRangeSection.End) {

child = fresh(lineCollection);

currentNode.add(child);

this.startPath[this.startPath.length] = child;

}

else {

if (!lineCollection.isLeaf()) {

child = fresh(lineCollection);

currentNode.add(child);

this.endBranch[this.endBranch.length] = child;

}

break;

case CharRangeSection.Mid:

this.goSubtree = false;

break;

case CharRangeSection.End:

if (this.state !== CharRangeSection.End) {

this.goSubtree = false;

}

else {

if (!lineCollection.isLeaf()) {

child = fresh(lineCollection);

currentNode.add(child);

this.endBranch[this.endBranch.length] = child;

}

break;

case CharRangeSection.PostEnd:

this.goSubtree = false;

if (this.state !== CharRangeSection.Start) {

currentNode.add(lineCollection);

}

break;

}

if (this.goSubtree) {

this.stack[this.stack.length] = <LineNode>child;

}

return lineCollection;

}

// just gather text from the leaves

leaf(relativeStart: number, relativeLength: number, ll: LineLeaf) {

if (this.state === CharRangeSection.Start) {

this.initialText = ll.text.substring(0, relativeStart);

}

else if (this.state === CharRangeSection.Entire) {

this.initialText = ll.text.substring(0, relativeStart);

this.trailingText = ll.text.substring(relativeStart + relativeLength);

}

else {

// state is CharRangeSection.End

this.trailingText = ll.text.substring(relativeStart + relativeLength);

}

// text change information

export class TextChange {

constructor(public pos: number, public deleteLen: number, public insertedText?: string) {

}

getTextChangeRange() {

return ts.createTextChangeRange(ts.createTextSpan(this.pos, this.deleteLen),

this.insertedText ? this.insertedText.length : 0);

}

export class ScriptVersionCache {

changes: TextChange[] = [];

versions: LineIndexSnapshot[] = new Array<LineIndexSnapshot>(ScriptVersionCache.maxVersions);

minVersion = 0; // no versions earlier than min version will maintain change history

private host: ServerHost;

private currentVersion = 0;

static changeNumberThreshold = 8;

static changeLengthThreshold = 256;

static maxVersions = 8;

private versionToIndex(version: number) {

if (version < this.minVersion || version > this.currentVersion) {

return undefined;

}

return version % ScriptVersionCache.maxVersions;

}

private currentVersionToIndex() {

return this.currentVersion % ScriptVersionCache.maxVersions;

}

// REVIEW: can optimize by coalescing simple edits

edit(pos: number, deleteLen: number, insertedText?: string) {

this.changes[this.changes.length] = new TextChange(pos, deleteLen, insertedText);

if ((this.changes.length > ScriptVersionCache.changeNumberThreshold) ||

(deleteLen > ScriptVersionCache.changeLengthThreshold) ||

(insertedText && (insertedText.length > ScriptVersionCache.changeLengthThreshold))) {

this.getSnapshot();

}

latest() {

return this.versions[this.currentVersionToIndex()];

}

latestVersion() {

if (this.changes.length > 0) {

this.getSnapshot();

}

return this.currentVersion;

}

reloadFromFile(filename: string) {

let content = this.host.readFile(filename);

// If the file doesn't exist or cannot be read, we should

// wipe out its cached content on the server to avoid side effects.

if (!content) {

content = "";

}

this.reload(content);

}

// reload whole script, leaving no change history behind reload

reload(script: string) {

this.currentVersion++;

this.changes = []; // history wiped out by reload

const snap = new LineIndexSnapshot(this.currentVersion, this);

// delete all versions

for (let i = 0; i < this.versions.length; i++) {

this.versions[i] = undefined;

}

this.versions[this.currentVersionToIndex()] = snap;

snap.index = new LineIndex();

const lm = LineIndex.linesFromText(script);

snap.index.load(lm.lines);

this.minVersion = this.currentVersion;

}

getSnapshot() {

let snap = this.versions[this.currentVersionToIndex()];

if (this.changes.length > 0) {

let snapIndex = snap.index;

for (const change of this.changes) {

snapIndex = snapIndex.edit(change.pos, change.deleteLen, change.insertedText);

}

snap = new LineIndexSnapshot(this.currentVersion + 1, this);

snap.index = snapIndex;

snap.changesSincePreviousVersion = this.changes;

this.currentVersion = snap.version;

this.versions[this.currentVersionToIndex()] = snap;

this.changes = [];

if ((this.currentVersion - this.minVersion) >= ScriptVersionCache.maxVersions) {

this.minVersion = (this.currentVersion - ScriptVersionCache.maxVersions) + 1;

}

return snap;

}

getTextChangesBetweenVersions(oldVersion: number, newVersion: number) {

if (oldVersion < newVersion) {

if (oldVersion >= this.minVersion) {

const textChangeRanges: ts.TextChangeRange[] = [];

for (let i = oldVersion + 1; i <= newVersion; i++) {

const snap = this.versions[this.versionToIndex(i)];

for (const textChange of snap.changesSincePreviousVersion) {

textChangeRanges[textChangeRanges.length] = textChange.getTextChangeRange();

}

return ts.collapseTextChangeRangesAcrossMultipleVersions(textChangeRanges);

}

else {

return undefined;

}

else {

return ts.unchangedTextChangeRange;

}

static fromString(host: ServerHost, script: string) {

const svc = new ScriptVersionCache();

const snap = new LineIndexSnapshot(0, svc);

svc.versions[svc.currentVersion] = snap;

svc.host = host;

snap.index = new LineIndex();

const lm = LineIndex.linesFromText(script);

snap.index.load(lm.lines);

return svc;

}

export class LineIndexSnapshot implements ts.IScriptSnapshot {

index: LineIndex;

changesSincePreviousVersion: TextChange[] = [];

constructor(readonly version: number, readonly cache: ScriptVersionCache) {

}

getText(rangeStart: number, rangeEnd: number) {

return this.index.getText(rangeStart, rangeEnd - rangeStart);

}

getLength() {

return this.index.root.charCount();

}

// this requires linear space so don't hold on to these

getLineStartPositions(): number[] {

const starts: number[] = [-1];

let count = 1;

let pos = 0;

this.index.every(ll => {

starts[count] = pos;

count++;

pos += ll.text.length;

return true;

}, 0);

return starts;

}

getLineMapper() {

return (line: number) => {

return this.index.lineNumberToInfo(line).offset;

};

}

getTextChangeRangeSinceVersion(scriptVersion: number) {

if (this.version <= scriptVersion) {

return ts.unchangedTextChangeRange;

}

else {

return this.cache.getTextChangesBetweenVersions(scriptVersion, this.version);

}

getChangeRange(oldSnapshot: ts.IScriptSnapshot): ts.TextChangeRange {

if (oldSnapshot instanceof LineIndexSnapshot && this.cache === oldSnapshot.cache) {

return this.getTextChangeRangeSinceVersion(oldSnapshot.version);

}

export class LineIndex {

root: LineNode;

// set this to true to check each edit for accuracy

checkEdits = false;

charOffsetToLineNumberAndPos(charOffset: number) {

return this.root.charOffsetToLineNumberAndPos(1, charOffset);

}

lineNumberToInfo(lineNumber: number): ILineInfo {

const lineCount = this.root.lineCount();

if (lineNumber <= lineCount) {

const lineInfo = this.root.lineNumberToInfo(lineNumber, 0);

lineInfo.line = lineNumber;

return lineInfo;

}

else {

return {

line: lineNumber,

offset: this.root.charCount()

};

}

load(lines: string[]) {

if (lines.length > 0) {

const leaves: LineLeaf[] = [];

for (let i = 0; i < lines.length; i++) {

leaves[i] = new LineLeaf(lines[i]);

}

this.root = LineIndex.buildTreeFromBottom(leaves);

}

else {

this.root = new LineNode();

}

walk(rangeStart: number, rangeLength: number, walkFns: ILineIndexWalker) {

this.root.walk(rangeStart, rangeLength, walkFns);

}

getText(rangeStart: number, rangeLength: number) {

let accum = "";

if ((rangeLength > 0) && (rangeStart < this.root.charCount())) {

this.walk(rangeStart, rangeLength, {

goSubtree: true,

done: false,

leaf: (relativeStart: number, relativeLength: number, ll: LineLeaf) => {

accum = accum.concat(ll.text.substring(relativeStart, relativeStart + relativeLength));

}

});

}

return accum;

}

getLength(): number {

return this.root.charCount();

}

every(f: (ll: LineLeaf, s: number, len: number) => boolean, rangeStart: number, rangeEnd?: number) {

if (!rangeEnd) {

rangeEnd = this.root.charCount();

}

const walkFns = {

goSubtree: true,

done: false,

leaf: function (this: ILineIndexWalker, relativeStart: number, relativeLength: number, ll: LineLeaf) {

if (!f(ll, relativeStart, relativeLength)) {

this.done = true;

}

};

this.walk(rangeStart, rangeEnd - rangeStart, walkFns);

return !walkFns.done;

}

edit(pos: number, deleteLength: number, newText?: string) {

function editFlat(source: string, s: number, dl: number, nt = "") {

return source.substring(0, s) + nt + source.substring(s + dl, source.length);

}

if (this.root.charCount() === 0) {

// TODO: assert deleteLength === 0

if (newText !== undefined) {

this.load(LineIndex.linesFromText(newText).lines);

return this;

}

else {

let checkText: string;

if (this.checkEdits) {

checkText = editFlat(this.getText(0, this.root.charCount()), pos, deleteLength, newText);

}

const walker = new EditWalker();

if (pos >= this.root.charCount()) {

// insert at end

pos = this.root.charCount() - 1;

const endString = this.getText(pos, 1);

if (newText) {

newText = endString + newText;

}

else {

newText = endString;

}

deleteLength = 0;

walker.suppressTrailingText = true;

}

else if (deleteLength > 0) {

// check whether last characters deleted are line break

const e = pos + deleteLength;

const lineInfo = this.charOffsetToLineNumberAndPos(e);

if ((lineInfo && (lineInfo.offset === 0))) {

// move range end just past line that will merge with previous line

deleteLength += lineInfo.text.length;

// store text by appending to end of insertedText

if (newText) {

newText = newText + lineInfo.text;

}

else {

newText = lineInfo.text;

}

if (pos < this.root.charCount()) {

this.root.walk(pos, deleteLength, walker);

walker.insertLines(newText);

}

if (this.checkEdits) {

const updatedText = this.getText(0, this.root.charCount());

Debug.assert(checkText == updatedText, "buffer edit mismatch");

}

return walker.lineIndex;

}

static buildTreeFromBottom(nodes: LineCollection[]): LineNode {

const nodeCount = Math.ceil(nodes.length / lineCollectionCapacity);

const interiorNodes: LineNode[] = [];

let nodeIndex = 0;

for (let i = 0; i < nodeCount; i++) {

interiorNodes[i] = new LineNode();

let charCount = 0;

let lineCount = 0;

for (let j = 0; j < lineCollectionCapacity; j++) {

if (nodeIndex < nodes.length) {

interiorNodes[i].add(nodes[nodeIndex]);

charCount += nodes[nodeIndex].charCount();

lineCount += nodes[nodeIndex].lineCount();

}

else {

break;

}

nodeIndex++;

}

interiorNodes[i].totalChars = charCount;

interiorNodes[i].totalLines = lineCount;

}

if (interiorNodes.length === 1) {

return interiorNodes[0];

}

else {

return this.buildTreeFromBottom(interiorNodes);

}

static linesFromText(text: string) {

const lineStarts = ts.computeLineStarts(text);

if (lineStarts.length === 0) {

return { lines: <string[]>[], lineMap: lineStarts };

}

const lines = <string[]>new Array(lineStarts.length);

const lc = lineStarts.length - 1;

for (let lmi = 0; lmi < lc; lmi++) {

lines[lmi] = text.substring(lineStarts[lmi], lineStarts[lmi + 1]);

}

const endText = text.substring(lineStarts[lc]);

if (endText.length > 0) {

lines[lc] = endText;

}

else {

lines.length--;

}

return { lines: lines, lineMap: lineStarts };

}

export class LineNode implements LineCollection {

totalChars = 0;

totalLines = 0;

children: LineCollection[] = [];

isLeaf() {

return false;

}

updateCounts() {

this.totalChars = 0;

this.totalLines = 0;

for (const child of this.children) {

this.totalChars += child.charCount();

this.totalLines += child.lineCount();

}

execWalk(rangeStart: number, rangeLength: number, walkFns: ILineIndexWalker, childIndex: number, nodeType: CharRangeSection) {

if (walkFns.pre) {

walkFns.pre(rangeStart, rangeLength, this.children[childIndex], this, nodeType);

}

if (walkFns.goSubtree) {

this.children[childIndex].walk(rangeStart, rangeLength, walkFns);

if (walkFns.post) {

walkFns.post(rangeStart, rangeLength, this.children[childIndex], this, nodeType);

}

else {

walkFns.goSubtree = true;

}

return walkFns.done;

}

skipChild(relativeStart: number, relativeLength: number, childIndex: number, walkFns: ILineIndexWalker, nodeType: CharRangeSection) {

if (walkFns.pre && (!walkFns.done)) {

walkFns.pre(relativeStart, relativeLength, this.children[childIndex], this, nodeType);

walkFns.goSubtree = true;

}

walk(rangeStart: number, rangeLength: number, walkFns: ILineIndexWalker) {

// assume (rangeStart < this.totalChars) && (rangeLength <= this.totalChars)

let childIndex = 0;

let child = this.children[0];

let childCharCount = child.charCount();

// find sub-tree containing start

let adjustedStart = rangeStart;

while (adjustedStart >= childCharCount) {

this.skipChild(adjustedStart, rangeLength, childIndex, walkFns, CharRangeSection.PreStart);

adjustedStart -= childCharCount;

childIndex++;

child = this.children[childIndex];

childCharCount = child.charCount();

}

// Case I: both start and end of range in same subtree

if ((adjustedStart + rangeLength) <= childCharCount) {

if (this.execWalk(adjustedStart, rangeLength, walkFns, childIndex, CharRangeSection.Entire)) {

return;

}

else {

// Case II: start and end of range in different subtrees (possibly with subtrees in the middle)

if (this.execWalk(adjustedStart, childCharCount - adjustedStart, walkFns, childIndex, CharRangeSection.Start)) {

return;

}

let adjustedLength = rangeLength - (childCharCount - adjustedStart);

childIndex++;

child = this.children[childIndex];

childCharCount = child.charCount();

while (adjustedLength > childCharCount) {

if (this.execWalk(0, childCharCount, walkFns, childIndex, CharRangeSection.Mid)) {

return;

}

adjustedLength -= childCharCount;

childIndex++;

child = this.children[childIndex];

childCharCount = child.charCount();

}

if (adjustedLength > 0) {

if (this.execWalk(0, adjustedLength, walkFns, childIndex, CharRangeSection.End)) {

return;

}

// Process any subtrees after the one containing range end

if (walkFns.pre) {

const clen = this.children.length;

if (childIndex < (clen - 1)) {

for (let ej = childIndex + 1; ej < clen; ej++) {

this.skipChild(0, 0, ej, walkFns, CharRangeSection.PostEnd);

}

charOffsetToLineNumberAndPos(lineNumber: number, charOffset: number): ILineInfo {

const childInfo = this.childFromCharOffset(lineNumber, charOffset);

if (!childInfo.child) {

return {

line: lineNumber,

offset: charOffset,

};

}

else if (childInfo.childIndex < this.children.length) {

if (childInfo.child.isLeaf()) {

return {

line: childInfo.lineNumber,

offset: childInfo.charOffset,

text: (<LineLeaf>(childInfo.child)).text,

leaf: (<LineLeaf>(childInfo.child))

};

}

else {

const lineNode = <LineNode>(childInfo.child);

return lineNode.charOffsetToLineNumberAndPos(childInfo.lineNumber, childInfo.charOffset);

}

else {

const lineInfo = this.lineNumberToInfo(this.lineCount(), 0);

return { line: this.lineCount(), offset: lineInfo.leaf.charCount() };

}

lineNumberToInfo(lineNumber: number, charOffset: number): ILineInfo {

const childInfo = this.childFromLineNumber(lineNumber, charOffset);

if (!childInfo.child) {

return {

line: lineNumber,

offset: charOffset

};

}

else if (childInfo.child.isLeaf()) {

return {

line: lineNumber,

offset: childInfo.charOffset,

text: (<LineLeaf>(childInfo.child)).text,

leaf: (<LineLeaf>(childInfo.child))

};

}

else {

const lineNode = <LineNode>(childInfo.child);

return lineNode.lineNumberToInfo(childInfo.relativeLineNumber, childInfo.charOffset);

}

childFromLineNumber(lineNumber: number, charOffset: number) {

let child: LineCollection;

let relativeLineNumber = lineNumber;

let i: number;

let len: number;

for (i = 0, len = this.children.length; i < len; i++) {

child = this.children[i];

const childLineCount = child.lineCount();

if (childLineCount >= relativeLineNumber) {

break;

}

else {

relativeLineNumber -= childLineCount;

charOffset += child.charCount();

}

return {

child: child,

childIndex: i,

relativeLineNumber: relativeLineNumber,

charOffset: charOffset

};

}

childFromCharOffset(lineNumber: number, charOffset: number) {

let child: LineCollection;

let i: number;

let len: number;

for (i = 0, len = this.children.length; i < len; i++) {

child = this.children[i];

if (child.charCount() > charOffset) {

break;

}

else {

charOffset -= child.charCount();

lineNumber += child.lineCount();

}

return {

child: child,

childIndex: i,

charOffset: charOffset,

lineNumber: lineNumber

};

}

splitAfter(childIndex: number) {

let splitNode: LineNode;

const clen = this.children.length;

childIndex++;

const endLength = childIndex;

if (childIndex < clen) {

splitNode = new LineNode();

while (childIndex < clen) {

splitNode.add(this.children[childIndex]);

childIndex++;

}

splitNode.updateCounts();

}

this.children.length = endLength;

return splitNode;

}

remove(child: LineCollection) {

const childIndex = this.findChildIndex(child);

const clen = this.children.length;

if (childIndex < (clen - 1)) {

for (let i = childIndex; i < (clen - 1); i++) {

this.children[i] = this.children[i + 1];

}

this.children.length--;

}

findChildIndex(child: LineCollection) {

let childIndex = 0;

const clen = this.children.length;

while ((this.children[childIndex] !== child) && (childIndex < clen)) childIndex++;

return childIndex;

}

insertAt(child: LineCollection, nodes: LineCollection[]) {

let childIndex = this.findChildIndex(child);

const clen = this.children.length;

const nodeCount = nodes.length;

// if child is last and there is more room and only one node to place, place it

if ((clen < lineCollectionCapacity) && (childIndex === (clen - 1)) && (nodeCount === 1)) {

this.add(nodes[0]);

this.updateCounts();

return [];

}

else {

const shiftNode = this.splitAfter(childIndex);

let nodeIndex = 0;

childIndex++;

while ((childIndex < lineCollectionCapacity) && (nodeIndex < nodeCount)) {

this.children[childIndex] = nodes[nodeIndex];

childIndex++;

nodeIndex++;

}

let splitNodes: LineNode[] = [];

let splitNodeCount = 0;

if (nodeIndex < nodeCount) {

splitNodeCount = Math.ceil((nodeCount - nodeIndex) / lineCollectionCapacity);

splitNodes = <LineNode[]>new Array(splitNodeCount);

let splitNodeIndex = 0;

for (let i = 0; i < splitNodeCount; i++) {

splitNodes[i] = new LineNode();

}

let splitNode = <LineNode>splitNodes[0];

while (nodeIndex < nodeCount) {

splitNode.add(nodes[nodeIndex]);

nodeIndex++;

if (splitNode.children.length === lineCollectionCapacity) {

splitNodeIndex++;

splitNode = <LineNode>splitNodes[splitNodeIndex];

}

for (let i = splitNodes.length - 1; i >= 0; i--) {

if (splitNodes[i].children.length === 0) {

splitNodes.length--;

}

if (shiftNode) {

splitNodes[splitNodes.length] = shiftNode;

}

this.updateCounts();

for (let i = 0; i < splitNodeCount; i++) {

(<LineNode>splitNodes[i]).updateCounts();

}

return splitNodes;

}

// assume there is room for the item; return true if more room

add(collection: LineCollection) {

this.children[this.children.length] = collection;

return (this.children.length < lineCollectionCapacity);

}

charCount() {

return this.totalChars;

}

lineCount() {

return this.totalLines;

}

export class LineLeaf implements LineCollection {

constructor(public text: string) {

}

isLeaf() {

return true;

}

walk(rangeStart: number, rangeLength: number, walkFns: ILineIndexWalker) {

walkFns.leaf(rangeStart, rangeLength, this);

}

charCount() {

return this.text.length;

}

lineCount() {

return 1;

}

TypeScript/src/server/scriptVersionCache.ts at master · mkusher/TypeScript · GitHub

Expand file tree

Breadcrumbs

scriptVersionCache.ts

Latest commit

History

Breadcrumbs

scriptVersionCache.ts

File metadata and controls