forked from microsoft/vscode-python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtextRangeCollection.ts
More file actions
106 lines (86 loc) · 2.55 KB
/
textRangeCollection.ts
File metadata and controls
106 lines (86 loc) · 2.55 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
'use strict';
import { ITextRange, ITextRangeCollection } from './types';
export class TextRangeCollection<T extends ITextRange> implements ITextRangeCollection<T> {
private items: T[];
constructor(items: T[]) {
this.items = items;
}
public get start(): number {
return this.items.length > 0 ? this.items[0].start : 0;
}
public get end(): number {
return this.items.length > 0 ? this.items[this.items.length - 1].end : 0;
}
public get length(): number {
return this.end - this.start;
}
public get count(): number {
return this.items.length;
}
public contains(position: number): boolean {
return position >= this.start && position < this.end;
}
public getItemAt(index: number): T {
if (index < 0 || index >= this.items.length) {
throw new Error('index is out of range');
}
return this.items[index];
}
public getItemAtPosition(position: number): number {
if (this.count === 0) {
return -1;
}
if (position < this.start) {
return -1;
}
if (position >= this.end) {
return -1;
}
let min = 0;
let max = this.count - 1;
while (min <= max) {
const mid = Math.floor(min + (max - min) / 2);
const item = this.items[mid];
if (item.start === position) {
return mid;
}
if (position < item.start) {
max = mid - 1;
} else {
min = mid + 1;
}
}
return -1;
}
public getItemContaining(position: number): number {
if (this.count === 0) {
return -1;
}
if (position < this.start) {
return -1;
}
if (position > this.end) {
return -1;
}
let min = 0;
let max = this.count - 1;
while (min <= max) {
const mid = Math.floor(min + (max - min) / 2);
const item = this.items[mid];
if (item.contains(position)) {
return mid;
}
if (mid < this.count - 1 && item.end <= position && position < this.items[mid + 1].start) {
return -1;
}
if (position < item.start) {
max = mid - 1;
} else {
min = mid + 1;
}
}
return -1;
}
}