Skip to content

Commit 00bf32c

Browse files
DanielRosenwasserDanielRosenwasser
committed
Update LKG.
1 parent b1a73ab commit 00bf32c

26 files changed

+22498
-11075
lines changed

‎lib/enu/diagnosticMessages.generated.json.lcg

Lines changed: 171 additions & 57 deletions
Large diffs are not rendered by default.

‎lib/lib.dom.d.ts

Lines changed: 658 additions & 214 deletions
Large diffs are not rendered by default.

‎lib/lib.dom.iterable.d.ts

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -116,6 +116,13 @@ interface Headers {
116116
values(): IterableIterator<string>;
117117
}
118118

119+
interface MediaKeyStatusMap {
120+
[Symbol.iterator](): IterableIterator<[BufferSource, MediaKeyStatus]>;
121+
entries(): IterableIterator<[BufferSource, MediaKeyStatus]>;
122+
keys(): IterableIterator<BufferSource>;
123+
values(): IterableIterator<MediaKeyStatus>;
124+
}
125+
119126
interface MediaList {
120127
[Symbol.iterator](): IterableIterator<string>;
121128
}

‎lib/lib.es2017.sharedmemory.d.ts

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -123,7 +123,7 @@ interface Atomics {
123123
* Wakes up sleeping agents that are waiting on the given index of the array, returning the
124124
* number of agents that were awoken.
125125
*/
126-
wake(typedArray: Int32Array, index: number, count: number): number;
126+
notify(typedArray: Int32Array, index: number, count: number): number;
127127

128128
/**
129129
* Stores the bitwise XOR of a value with the value at the given position in the array,
@@ -135,4 +135,4 @@ interface Atomics {
135135
readonly [Symbol.toStringTag]: "Atomics";
136136
}
137137

138-
declare var Atomics: Atomics;
138+
declare var Atomics: Atomics;

‎lib/lib.es2018.asynciterable.d.ts

Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
/*! *****************************************************************************
2+
Copyright (c) Microsoft Corporation. All rights reserved.
3+
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
4+
this file except in compliance with the License. You may obtain a copy of the
5+
License at http://www.apache.org/licenses/LICENSE-2.0
6+
7+
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
8+
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
9+
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
10+
MERCHANTABLITY OR NON-INFRINGEMENT.
11+
12+
See the Apache Version 2.0 License for specific language governing permissions
13+
and limitations under the License.
14+
***************************************************************************** */
15+
16+
17+
18+
/// <reference no-default-lib="true"/>
19+
20+
21+
/// <reference lib="es2015.symbol" />
22+
/// <reference lib="es2015.iterable" />
23+
24+
interface SymbolConstructor {
25+
/**
26+
* A method that returns the default async iterator for an object. Called by the semantics of
27+
* the for-await-of statement.
28+
*/
29+
readonly asyncIterator: symbol;
30+
}
31+
32+
interface AsyncIterator<T> {
33+
next(value?: any): Promise<IteratorResult<T>>;
34+
return?(value?: any): Promise<IteratorResult<T>>;
35+
throw?(e?: any): Promise<IteratorResult<T>>;
36+
}
37+
38+
interface AsyncIterable<T> {
39+
[Symbol.asyncIterator](): AsyncIterator<T>;
40+
}
41+
42+
interface AsyncIterableIterator<T> extends AsyncIterator<T> {
43+
[Symbol.asyncIterator](): AsyncIterableIterator<T>;
44+
}

‎lib/lib.es2018.d.ts

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -19,6 +19,7 @@ and limitations under the License.
1919

2020

2121
/// <reference lib="es2017" />
22+
/// <reference lib="es2018.asynciterable" />
2223
/// <reference lib="es2018.promise" />
2324
/// <reference lib="es2018.regexp" />
2425
/// <reference lib="es2018.intl" />

‎lib/lib.es2019.array.d.ts

Lines changed: 223 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,223 @@
1+
/*! *****************************************************************************
2+
Copyright (c) Microsoft Corporation. All rights reserved.
3+
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
4+
this file except in compliance with the License. You may obtain a copy of the
5+
License at http://www.apache.org/licenses/LICENSE-2.0
6+
7+
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
8+
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
9+
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
10+
MERCHANTABLITY OR NON-INFRINGEMENT.
11+
12+
See the Apache Version 2.0 License for specific language governing permissions
13+
and limitations under the License.
14+
***************************************************************************** */
15+
16+
17+
18+
/// <reference no-default-lib="true"/>
19+
20+
21+
interface ReadonlyArray<T> {
22+
23+
/**
24+
* Calls a defined callback function on each element of an array. Then, flattens the result into
25+
* a new array.
26+
* This is identical to a map followed by flat with depth 1.
27+
*
28+
* @param callback A function that accepts up to three arguments. The flatMap method calls the
29+
* callback function one time for each element in the array.
30+
* @param thisArg An object to which the this keyword can refer in the callback function. If
31+
* thisArg is omitted, undefined is used as the this value.
32+
*/
33+
flatMap<U, This = undefined> (
34+
callback: (this: This, value: T, index: number, array: T[]) => U|ReadonlyArray<U>,
35+
thisArg?: This
36+
): U[]
37+
38+
39+
/**
40+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
41+
* specified depth.
42+
*
43+
* @param depth The maximum recursion depth
44+
*/
45+
flat<U>(this:
46+
ReadonlyArray<U[][][][]> |
47+
48+
ReadonlyArray<ReadonlyArray<U[][][]>> |
49+
ReadonlyArray<ReadonlyArray<U[][]>[]> |
50+
ReadonlyArray<ReadonlyArray<U[]>[][]> |
51+
ReadonlyArray<ReadonlyArray<U>[][][]> |
52+
53+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U[][]>>> |
54+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[][]>> |
55+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[][]> |
56+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>[]> |
57+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>[]> |
58+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>[]>> |
59+
60+
ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>>> |
61+
ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>>> |
62+
ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[]>> |
63+
ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>[]> |
64+
65+
ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>>>,
66+
depth: 4): U[];
67+
68+
/**
69+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
70+
* specified depth.
71+
*
72+
* @param depth The maximum recursion depth
73+
*/
74+
flat<U>(this:
75+
ReadonlyArray<U[][][]> |
76+
77+
ReadonlyArray<ReadonlyArray<U>[][]> |
78+
ReadonlyArray<ReadonlyArray<U[]>[]> |
79+
ReadonlyArray<ReadonlyArray<U[][]>> |
80+
81+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>> |
82+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>> |
83+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[]> |
84+
85+
ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>>,
86+
depth: 3): U[];
87+
88+
/**
89+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
90+
* specified depth.
91+
*
92+
* @param depth The maximum recursion depth
93+
*/
94+
flat<U>(this:
95+
ReadonlyArray<U[][]> |
96+
97+
ReadonlyArray<ReadonlyArray<U[]>> |
98+
ReadonlyArray<ReadonlyArray<U>[]> |
99+
100+
ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>,
101+
depth: 2): U[];
102+
103+
/**
104+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
105+
* specified depth.
106+
*
107+
* @param depth The maximum recursion depth
108+
*/
109+
flat<U>(this:
110+
ReadonlyArray<U[]> |
111+
ReadonlyArray<ReadonlyArray<U>>,
112+
depth?: 1
113+
): U[];
114+
115+
/**
116+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
117+
* specified depth.
118+
*
119+
* @param depth The maximum recursion depth
120+
*/
121+
flat<U>(this:
122+
ReadonlyArray<U>,
123+
depth: 0
124+
): U[];
125+
126+
/**
127+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
128+
* specified depth. If no depth is provided, flat method defaults to the depth of 1.
129+
*
130+
* @param depth The maximum recursion depth
131+
*/
132+
flat<U>(depth?: number): any[];
133+
}
134+
135+
interface Array<T> {
136+
137+
/**
138+
* Calls a defined callback function on each element of an array. Then, flattens the result into
139+
* a new array.
140+
* This is identical to a map followed by flat with depth 1.
141+
*
142+
* @param callback A function that accepts up to three arguments. The flatMap method calls the
143+
* callback function one time for each element in the array.
144+
* @param thisArg An object to which the this keyword can refer in the callback function. If
145+
* thisArg is omitted, undefined is used as the this value.
146+
*/
147+
flatMap<U, This = undefined> (
148+
callback: (this: This, value: T, index: number, array: T[]) => U|ReadonlyArray<U>,
149+
thisArg?: This
150+
): U[]
151+
152+
/**
153+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
154+
* specified depth.
155+
*
156+
* @param depth The maximum recursion depth
157+
*/
158+
flat<U>(this: U[][][][][][][][], depth: 7): U[];
159+
160+
/**
161+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
162+
* specified depth.
163+
*
164+
* @param depth The maximum recursion depth
165+
*/
166+
flat<U>(this: U[][][][][][][], depth: 6): U[];
167+
168+
/**
169+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
170+
* specified depth.
171+
*
172+
* @param depth The maximum recursion depth
173+
*/
174+
flat<U>(this: U[][][][][][], depth: 5): U[];
175+
176+
/**
177+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
178+
* specified depth.
179+
*
180+
* @param depth The maximum recursion depth
181+
*/
182+
flat<U>(this: U[][][][][], depth: 4): U[];
183+
184+
/**
185+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
186+
* specified depth.
187+
*
188+
* @param depth The maximum recursion depth
189+
*/
190+
flat<U>(this: U[][][][], depth: 3): U[];
191+
192+
/**
193+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
194+
* specified depth.
195+
*
196+
* @param depth The maximum recursion depth
197+
*/
198+
flat<U>(this: U[][][], depth: 2): U[];
199+
200+
/**
201+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
202+
* specified depth.
203+
*
204+
* @param depth The maximum recursion depth
205+
*/
206+
flat<U>(this: U[][], depth?: 1): U[];
207+
208+
/**
209+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
210+
* specified depth.
211+
*
212+
* @param depth The maximum recursion depth
213+
*/
214+
flat<U>(this: U[], depth: 0): U[];
215+
216+
/**
217+
* Returns a new array with all sub-array elements concatenated into it recursively up to the
218+
* specified depth. If no depth is provided, flat method defaults to the depth of 1.
219+
*
220+
* @param depth The maximum recursion depth
221+
*/
222+
flat<U>(depth?: number): any[];
223+
}

‎lib/lib.es2019.d.ts

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
/*! *****************************************************************************
2+
Copyright (c) Microsoft Corporation. All rights reserved.
3+
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
4+
this file except in compliance with the License. You may obtain a copy of the
5+
License at http://www.apache.org/licenses/LICENSE-2.0
6+
7+
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
8+
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
9+
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
10+
MERCHANTABLITY OR NON-INFRINGEMENT.
11+
12+
See the Apache Version 2.0 License for specific language governing permissions
13+
and limitations under the License.
14+
***************************************************************************** */
15+
16+
17+
18+
/// <reference no-default-lib="true"/>
19+
20+
21+
/// <reference lib="es2018" />
22+
/// <reference lib="es2019.array" />
23+
/// <reference lib="es2019.string" />
24+
/// <reference lib="es2019.symbol" />

‎lib/lib.es2019.full.d.ts

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
/*! *****************************************************************************
2+
Copyright (c) Microsoft Corporation. All rights reserved.
3+
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
4+
this file except in compliance with the License. You may obtain a copy of the
5+
License at http://www.apache.org/licenses/LICENSE-2.0
6+
7+
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
8+
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
9+
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
10+
MERCHANTABLITY OR NON-INFRINGEMENT.
11+
12+
See the Apache Version 2.0 License for specific language governing permissions
13+
and limitations under the License.
14+
***************************************************************************** */
15+
16+
17+
18+
/// <reference no-default-lib="true"/>
19+
20+
21+
/// <reference lib="es2019" />
22+
/// <reference lib="dom" />
23+
/// <reference lib="webworker.importscripts" />
24+
/// <reference lib="scripthost" />
25+
/// <reference lib="dom.iterable" />

‎lib/lib.es2019.string.d.ts

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
/*! *****************************************************************************
2+
Copyright (c) Microsoft Corporation. All rights reserved.
3+
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
4+
this file except in compliance with the License. You may obtain a copy of the
5+
License at http://www.apache.org/licenses/LICENSE-2.0
6+
7+
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
8+
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
9+
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
10+
MERCHANTABLITY OR NON-INFRINGEMENT.
11+
12+
See the Apache Version 2.0 License for specific language governing permissions
13+
and limitations under the License.
14+
***************************************************************************** */
15+
16+
17+
18+
/// <reference no-default-lib="true"/>
19+
20+
21+
interface String {
22+
/** Removes the trailing white space and line terminator characters from a string. */
23+
trimEnd(): string;
24+
25+
/** Removes the leading white space and line terminator characters from a string. */
26+
trimStart(): string;
27+
28+
/** Removes the trailing white space and line terminator characters from a string. */
29+
trimLeft(): string;
30+
31+
/** Removes the leading white space and line terminator characters from a string. */
32+
trimRight(): string;
33+
}

0 commit comments

Comments
 (0)