diff options
author | mattkae <mattkae@protonmail.com> | 2022-06-07 08:21:30 -0400 |
---|---|---|
committer | mattkae <mattkae@protonmail.com> | 2022-06-07 08:21:30 -0400 |
commit | b07628dddf418d4f47b858e6c35fd3520fbaeed2 (patch) | |
tree | 376cd7b4b5daed06ac397ac23ae041e4b365ad08 /elpa/tide-20220514.614/tsserver/lib.esnext.array.d.ts | |
parent | becff06c71d277647eda4378203d03ab36e141eb (diff) |
Flycheck mode and typescript
Diffstat (limited to 'elpa/tide-20220514.614/tsserver/lib.esnext.array.d.ts')
-rw-r--r-- | elpa/tide-20220514.614/tsserver/lib.esnext.array.d.ts | 223 |
1 files changed, 223 insertions, 0 deletions
diff --git a/elpa/tide-20220514.614/tsserver/lib.esnext.array.d.ts b/elpa/tide-20220514.614/tsserver/lib.esnext.array.d.ts new file mode 100644 index 0000000..6c75122 --- /dev/null +++ b/elpa/tide-20220514.614/tsserver/lib.esnext.array.d.ts @@ -0,0 +1,223 @@ +/*! ***************************************************************************** +Copyright (c) Microsoft Corporation. All rights reserved. +Licensed under the Apache License, Version 2.0 (the "License"); you may not use +this file except in compliance with the License. You may obtain a copy of the +License at http://www.apache.org/licenses/LICENSE-2.0 + +THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY +KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED +WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE, +MERCHANTABLITY OR NON-INFRINGEMENT. + +See the Apache Version 2.0 License for specific language governing permissions +and limitations under the License. +***************************************************************************** */ + + + +/// <reference no-default-lib="true"/> + + +interface ReadonlyArray<T> { + + /** + * Calls a defined callback function on each element of an array. Then, flattens the result into + * a new array. + * This is identical to a map followed by flat with depth 1. + * + * @param callback A function that accepts up to three arguments. The flatMap method calls the + * callback function one time for each element in the array. + * @param thisArg An object to which the this keyword can refer in the callback function. If + * thisArg is omitted, undefined is used as the this value. + */ + flatMap<U, This = undefined> ( + callback: (this: This, value: T, index: number, array: T[]) => U|ReadonlyArray<U>, + thisArg?: This + ): U[] + + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: + ReadonlyArray<U[][][][]> | + + ReadonlyArray<ReadonlyArray<U[][][]>> | + ReadonlyArray<ReadonlyArray<U[][]>[]> | + ReadonlyArray<ReadonlyArray<U[]>[][]> | + ReadonlyArray<ReadonlyArray<U>[][][]> | + + ReadonlyArray<ReadonlyArray<ReadonlyArray<U[][]>>> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[][]>> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[][]> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>[]> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>[]> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>[]>> | + + ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>>> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>>> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[]>> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>[]> | + + ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>>>, + depth: 4): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: + ReadonlyArray<U[][][]> | + + ReadonlyArray<ReadonlyArray<U>[][]> | + ReadonlyArray<ReadonlyArray<U[]>[]> | + ReadonlyArray<ReadonlyArray<U[][]>> | + + ReadonlyArray<ReadonlyArray<ReadonlyArray<U[]>>> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<U>[]>> | + ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>[]> | + + ReadonlyArray<ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>>, + depth: 3): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: + ReadonlyArray<U[][]> | + + ReadonlyArray<ReadonlyArray<U[]>> | + ReadonlyArray<ReadonlyArray<U>[]> | + + ReadonlyArray<ReadonlyArray<ReadonlyArray<U>>>, + depth: 2): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: + ReadonlyArray<U[]> | + ReadonlyArray<ReadonlyArray<U>>, + depth?: 1 + ): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: + ReadonlyArray<U>, + depth: 0 + ): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. If no depth is provided, flat method defaults to the depth of 1. + * + * @param depth The maximum recursion depth + */ + flat<U>(depth?: number): any[]; + } + +interface Array<T> { + + /** + * Calls a defined callback function on each element of an array. Then, flattens the result into + * a new array. + * This is identical to a map followed by flat with depth 1. + * + * @param callback A function that accepts up to three arguments. The flatMap method calls the + * callback function one time for each element in the array. + * @param thisArg An object to which the this keyword can refer in the callback function. If + * thisArg is omitted, undefined is used as the this value. + */ + flatMap<U, This = undefined> ( + callback: (this: This, value: T, index: number, array: T[]) => U|ReadonlyArray<U>, + thisArg?: This + ): U[] + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[][][][][][][][], depth: 7): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[][][][][][][], depth: 6): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[][][][][][], depth: 5): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[][][][][], depth: 4): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[][][][], depth: 3): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[][][], depth: 2): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[][], depth?: 1): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. + * + * @param depth The maximum recursion depth + */ + flat<U>(this: U[], depth: 0): U[]; + + /** + * Returns a new array with all sub-array elements concatenated into it recursively up to the + * specified depth. If no depth is provided, flat method defaults to the depth of 1. + * + * @param depth The maximum recursion depth + */ + flat<U>(depth?: number): any[]; +} |