Vihren Atlas

offsetRange.ts ×40

Code frontier

unlabeled · c_26fa480decac

3777 tests · 3510 LOC · 19 files · introduces 0 tests · 132 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
40 ranges132 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
520 ranges3510 lines · 19 files · Browse complete extent
All tests (intent)
3777 testsBrowse complete intent

Neighbourhood graph

The orange circle is the focus. Violet and green circles are every ancestor and descendant, broader and narrower, at any distance; blue squares and pink diamonds are the introduced files and exact introduced tests of every visible concept, not only the focus's. Arrows point from broader to narrower concepts and bridge only concepts omitted from this view. Undirected links show source or test introduction. Concept and file size follows LOC; exact test nodes use test-count units.

Introduced files, introduced tests, and structurally relevant concept specialization

In the embedded map, ordinary wheel input scrolls the page; use the visible controls to zoom and drag to pan. Open the full-screen map for canvas navigation: wheel pans, Ctrl/Command plus wheel zooms, and arrow keys pan when this region is focused. On touch screens, open the full-screen map to pan or pinch. If JavaScript or WebGL is unavailable, use the native relationship evidence on this page.

Graph controls are ready.

Interactive rendering requires JavaScript and WebGL. Use the native relationship evidence on this page while the interactive map is unavailable.

Native relationship evidence

Every exact file and test below is linked only from the concept that introduces it.

Introduced tests

Every collected test enters the hierarchy at exactly one concept.

No tests are introduced at this concept. Its intent tests are introduced by other concepts.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

1 file ranked by introduced lines: 132 introduced LOC across 40 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/editor/common/core/ranges/offsetRange.ts 132 introduced LOC · 40 ranges

Open complete file

1 > /*--------------------------------------------------------------------------------------------- offsetRange.ts
2 > * Copyright (c) Microsoft Corporation. All rights reserved.
3 > * Licensed under the MIT License. See License.txt in the project root for license information.
4 > *--------------------------------------------------------------------------------------------*/
5 >
6 > import { BugIndicatingError } from '../../../../base/common/errors.js';
7 >
8 > export interface IOffsetRange {
9 > readonly start: number;
10 > readonly endExclusive: number;
11 > }
12 >
13 > /**
14 > * A range of offsets (0-based).
15 > */
16 > export class OffsetRange implements IOffsetRange {
17 > public static fromTo(start: number, endExclusive: number): OffsetRange {
18 > return new OffsetRange(start, endExclusive);
19 > }
20 >
21 > public static equals(r1: IOffsetRange, r2: IOffsetRange): boolean {
22 return r1.start === r2.start && r1.endExclusive === r2.endExclusive;
23 }
24 > offsetRange.ts
25 > public static addRange(range: OffsetRange, sortedRanges: OffsetRange[]): void {
26 let i = 0;
27 while (i < sortedRanges.length && sortedRanges[i].endExclusive < range.start) {
40 }
41 }
42 > offsetRange.ts
43 > public static tryCreate(start: number, endExclusive: number): OffsetRange | undefined {
44 if (start > endExclusive) {
45 return undefined;
47 return new OffsetRange(start, endExclusive);
48 }
49 > offsetRange.ts
50 > public static ofLength(length: number): OffsetRange {
51 return new OffsetRange(0, length);
52 }
53 > offsetRange.ts
54 > public static ofStartAndLength(start: number, length: number): OffsetRange {
55 return new OffsetRange(start, start + length);
56 }
57 > offsetRange.ts
58 > public static emptyAt(offset: number): OffsetRange {
59 return new OffsetRange(offset, offset);
60 }
61 > offsetRange.ts
62 > constructor(public readonly start: number, public readonly endExclusive: number) {
63 if (start > endExclusive) {
64 throw new BugIndicatingError(`Invalid range: ${this.toString()}`);
65 }
66 }
67 > offsetRange.ts
68 > get isEmpty(): boolean {
69 return this.start === this.endExclusive;
70 }
71 > offsetRange.ts
72 > public delta(offset: number): OffsetRange {
73 return new OffsetRange(this.start + offset, this.endExclusive + offset);
74 }
75 > offsetRange.ts
76 > public deltaStart(offset: number): OffsetRange {
77 return new OffsetRange(this.start + offset, this.endExclusive);
78 }
79 > offsetRange.ts
80 > public deltaEnd(offset: number): OffsetRange {
81 return new OffsetRange(this.start, this.endExclusive + offset);
82 }
83 > offsetRange.ts
84 > public get length(): number {
85 return this.endExclusive - this.start;
86 }
87 > offsetRange.ts
88 > public toString() {
89 return `[${this.start}, ${this.endExclusive})`;
90 }
91 > offsetRange.ts
92 > public equals(other: OffsetRange): boolean {
93 return this.start === other.start && this.endExclusive === other.endExclusive;
94 }
95 > offsetRange.ts
96 > public containsRange(other: OffsetRange): boolean {
97 return this.start <= other.start && other.endExclusive <= this.endExclusive;
98 }
99 > offsetRange.ts
100 > public contains(offset: number): boolean {
101 return this.start <= offset && offset < this.endExclusive;
102 }
103 > offsetRange.ts
104 > /**
105 > * for all numbers n: range1.contains(n) or range2.contains(n) => range1.join(range2).contains(n)
106 > * The joined range is the smallest range that contains both ranges.
107 > */
108 > public join(other: OffsetRange): OffsetRange {
109 return new OffsetRange(Math.min(this.start, other.start), Math.max(this.endExclusive, other.endExclusive));
110 }
111 > offsetRange.ts
112 > /**
113 > * for all numbers n: range1.contains(n) and range2.contains(n) <=> range1.intersect(range2).contains(n)
114 > *
115 > * The resulting range is empty if the ranges do not intersect, but touch.
116 > * If the ranges don't even touch, the result is undefined.
117 > */
118 > public intersect(other: OffsetRange): OffsetRange | undefined {
119 const start = Math.max(this.start, other.start);
120 const end = Math.min(this.endExclusive, other.endExclusive);
124 return undefined;
125 }
126 > offsetRange.ts
127 > public intersectionLength(range: OffsetRange): number {
128 const start = Math.max(this.start, range.start);
129 const end = Math.min(this.endExclusive, range.endExclusive);
130 return Math.max(0, end - start);
131 }
132 > offsetRange.ts
133 > /**
134 > * `a.intersects(b)` iff there exists a number n so that `a.contains(n)` and `b.contains(n)`.
135 > * Warning: If one range is empty, this method returns always false.
136 > */
137 > public intersects(other: OffsetRange): boolean {
138 const start = Math.max(this.start, other.start);
139 const end = Math.min(this.endExclusive, other.endExclusive);
140 return start < end;
141 }
142 > offsetRange.ts
143 > public intersectsOrTouches(other: OffsetRange): boolean {
144 const start = Math.max(this.start, other.start);
145 const end = Math.min(this.endExclusive, other.endExclusive);
146 return start <= end;
147 }
148 > offsetRange.ts
149 > public isBefore(other: OffsetRange): boolean {
150 return this.endExclusive <= other.start;
151 }
152 > offsetRange.ts
153 > public isAfter(other: OffsetRange): boolean {
154 return this.start >= other.endExclusive;
155 }
156 > offsetRange.ts
157 > public slice<T>(arr: readonly T[]): T[] {
158 return arr.slice(this.start, this.endExclusive);
159 }
160 > offsetRange.ts
161 > public substring(str: string): string {
162 return str.substring(this.start, this.endExclusive);
163 }
164 > offsetRange.ts
165 > /**
166 > * Returns the given value if it is contained in this instance, otherwise the closest value that is contained.
167 > * The range must not be empty.
168 > */
169 > public clip(value: number): number {
170 if (this.isEmpty) {
171 throw new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);
173 return Math.max(this.start, Math.min(this.endExclusive - 1, value));
174 }
175 > offsetRange.ts
176 > /**
177 > * Returns `r := value + k * length` such that `r` is contained in this range.
178 > * The range must not be empty.
179 > *
180 > * E.g. `[5, 10).clipCyclic(10) === 5`, `[5, 10).clipCyclic(11) === 6` and `[5, 10).clipCyclic(4) === 9`.
181 > */
182 > public clipCyclic(value: number): number {
183 if (this.isEmpty) {
184 throw new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);
192 return value;
193 }
194 > offsetRange.ts
195 > public map<T>(f: (offset: number) => T): T[] {
196 const result: T[] = [];
197 for (let i = this.start; i < this.endExclusive; i++) {
200 return result;
201 }
202 > offsetRange.ts
203 > public forEach(f: (offset: number) => void): void {
204 for (let i = this.start; i < this.endExclusive; i++) {
205 f(i);
206 }
207 }
208 > offsetRange.ts
209 > /**
210 > * this: [ 5, 10), range: [10, 15) => [5, 15)]
211 > * Throws if the ranges are not touching.
212 > */
213 > public joinRightTouching(range: OffsetRange): OffsetRange {
214 if (this.endExclusive !== range.start) {
215 throw new BugIndicatingError(`Invalid join: ${this.toString()} and ${range.toString()}`);
217 return new OffsetRange(this.start, range.endExclusive);
218 }
219 > offsetRange.ts
220 > public withMargin(margin: number): OffsetRange;
221 > public withMargin(marginStart: number, marginEnd: number): OffsetRange;
222 > public withMargin(marginStart: number, marginEnd?: number): OffsetRange {
223 if (marginEnd === undefined) {
224 marginEnd = marginStart;
226 return new OffsetRange(this.start - marginStart, this.endExclusive + marginEnd);
227 }
228 > } offsetRange.ts
229 >
230 > export class OffsetRangeSet {
231 private readonly _sortedRanges: OffsetRange[] = [];
232 > offsetRange.ts
233 > public get ranges(): OffsetRange[] {
234 return [...this._sortedRanges];
235 }
236 > offsetRange.ts
237 > public addRange(range: OffsetRange): void {
238 let i = 0;
239 while (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive < range.start) {
252 }
253 }
254 > offsetRange.ts
255 > public toString(): string {
256 return this._sortedRanges.map(r => r.toString()).join(', ');
257 }
258 > offsetRange.ts
259 > /**
260 > * Returns if there is a value that is contained in this instance and the given range.
261 > */
262 > public intersectsStrict(other: OffsetRange): boolean {
263 // TODO use binary search
264 let i = 0;
268 return i < this._sortedRanges.length && this._sortedRanges[i].start < other.endExclusive;
269 }
270 > offsetRange.ts
271 > public intersectWithRange(other: OffsetRange): OffsetRangeSet {
272 // TODO use binary search + slice
273 const result = new OffsetRangeSet();
280 return result;
281 }
282 > offsetRange.ts
283 > public intersectWithRangeLength(other: OffsetRange): number {
284 return this.intersectWithRange(other).length;
285 }
286 > offsetRange.ts
287 > public get length(): number {
288 return this._sortedRanges.reduce((prev, cur) => prev + cur.length, 0);
289 }
290 > } offsetRange.ts

Direct hierarchy

Parents

Children