@tslite/parser 1.9.0 → 1.12.0

package/LICENSE

@@ -0,0 +1,55 @@
+Apache License
+
+Version 2.0, January 2004
+
+http://www.apache.org/licenses/ 
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+You must cause any modified files to carry prominent notices stating that You changed the files; and
+
+You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+
+If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS

package/NOTICE

@@ -0,0 +1,14 @@
+TypeScript 3.9.10 — a parse tree do compilador (src/compiler e src/shims), copiada da tag v3.9.10
+(commit b7de5e3c4cd) de https://github.com/microsoft/TypeScript.
+
+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 (o texto está em LICENSE).
+
+Todos os arquivos de src/ foram modificados: o namespace `ts` do outFile virou
+módulo ES, com os imports explícitos, por um codemod (packages/codemod deste
+repositório). Cada arquivo diz de qual arquivo da tag veio, na primeira linha.
+As mudanças seguintes a essa conversão (os cortes do recorte da Linguagem, do legado,
+da configuração fixa, do host e do emit) estão registradas no §6 do
+docs/ARCHITECTURE.md do pacote do checker (packages/checker).

package/dist/_namespaces/ts.d.ts

@@ -0,0 +1,18 @@
+export * from "../shims/mapShim.js";
+export * from "../corePublic.js";
+export * from "../core.js";
+export * from "../debug.js";
+export * from "../performanceTimestamp.js";
+export * as performance from "./ts.performance.js";
+export * from "../perfLogger.js";
+export * from "../types.js";
+export * from "../path.js";
+export * from "../diagnosticInformationMap.generated.js";
+export * from "../scanner.js";
+export * from "../utilitiesPublic.js";
+export * from "../utilities.js";
+export * from "../parser.js";
+export * from "../factoryPublic.js";
+export * from "../factory.js";
+export * from "../visitorPublic.js";
+export * from "../visitor.js";

package/dist/_namespaces/ts.js

@@ -0,0 +1,21 @@
+// O namespace `ts` do outFile da tag, na parte da parse tree, na ordem do `src/compiler/tsconfig.json`: carregar este
+// barril avalia os arquivos nessa ordem. O binder e o checker estendem o namespace nos barris deles, como os projetos
+// da tag estendiam o mesmo `namespace ts`.
+export * from "../shims/mapShim.js";
+export * from "../corePublic.js";
+export * from "../core.js";
+export * from "../debug.js";
+export * from "../performanceTimestamp.js";
+export * as performance from "./ts.performance.js";
+export * from "../perfLogger.js";
+export * from "../types.js";
+export * from "../path.js";
+export * from "../diagnosticInformationMap.generated.js";
+export * from "../scanner.js";
+export * from "../utilitiesPublic.js";
+export * from "../utilities.js";
+export * from "../parser.js";
+export * from "../factoryPublic.js";
+export * from "../factory.js";
+export * from "../visitorPublic.js";
+export * from "../visitor.js";

package/dist/_namespaces/ts.performance.d.ts

@@ -0,0 +1 @@
+export * from "../performance.js";

package/dist/_namespaces/ts.performance.js

@@ -0,0 +1,2 @@
+// O namespace `ts.performance` do outFile da tag.
+export * from "../performance.js";

package/dist/core.d.ts

@@ -0,0 +1,450 @@
+import { Comparison, Map } from "./_namespaces/ts.js";
+import type { Comparer, EqualityComparer, Iterator, MapLike, ReadonlyMap, Push, SortedArray, SortedReadonlyArray, UnderscoreEscapedMap, __String } from "./_namespaces/ts.js";
+export declare const emptyArray: never[];
+/** Create a new map. */
+export declare function createMap<T>(): Map<T>;
+/** Create a new map from an array of entries. */
+export declare function createMapFromEntries<T>(entries: [string, T][]): Map<T>;
+/** Create a new map from a template object is provided, the map will copy entries from it. */
+export declare function createMapFromTemplate<T>(template: MapLike<T>): Map<T>;
+export declare function length(array: readonly any[] | undefined): number;
+/**
+ * Iterates through 'array' by index and performs the callback on each element of array until the callback
+ * returns a truthy value, then returns that value.
+ * If no such value is found, the callback is applied to each element of array and undefined is returned.
+ */
+export declare function forEach<T, U>(array: readonly T[] | undefined, callback: (element: T, index: number) => U | undefined): U | undefined;
+/**
+ * Like `forEach`, but iterates in reverse order.
+ */
+export declare function forEachRight<T, U>(array: readonly T[] | undefined, callback: (element: T, index: number) => U | undefined): U | undefined;
+/** Like `forEach`, but suitable for use with numbers and strings (which may be falsy). */
+export declare function firstDefined<T, U>(array: readonly T[] | undefined, callback: (element: T, index: number) => U | undefined): U | undefined;
+/**
+ * Iterates through `array` by index and performs the callback on each element of array until the callback
+ * returns a falsey value, then returns false.
+ * If no such value is found, the callback is applied to each element of array and `true` is returned.
+ */
+export declare function every<T>(array: readonly T[], callback: (element: T, index: number) => boolean): boolean;
+/** Works like Array.prototype.find, returning `undefined` if no element satisfying the predicate is found. */
+export declare function find<T, U extends T>(array: readonly T[], predicate: (element: T, index: number) => element is U): U | undefined;
+export declare function find<T>(array: readonly T[], predicate: (element: T, index: number) => boolean): T | undefined;
+export declare function findLast<T, U extends T>(array: readonly T[], predicate: (element: T, index: number) => element is U): U | undefined;
+export declare function findLast<T>(array: readonly T[], predicate: (element: T, index: number) => boolean): T | undefined;
+/** Works like Array.prototype.findIndex, returning `-1` if no element satisfying the predicate is found. */
+export declare function findIndex<T>(array: readonly T[], predicate: (element: T, index: number) => boolean, startIndex?: number): number;
+export declare function findLastIndex<T>(array: readonly T[], predicate: (element: T, index: number) => boolean, startIndex?: number): number;
+export declare function contains<T>(array: readonly T[] | undefined, value: T, equalityComparer?: EqualityComparer<T>): boolean;
+export declare function arraysEqual<T>(a: readonly T[], b: readonly T[], equalityComparer?: EqualityComparer<T>): boolean;
+export declare function countWhere<T>(array: readonly T[], predicate: (x: T, i: number) => boolean): number;
+/**
+ * Filters an array by a predicate function. Returns the same array instance if the predicate is
+ * true for all elements, otherwise returns a new array instance containing the filtered subset.
+ */
+export declare function filter<T, U extends T>(array: T[], f: (x: T) => x is U): U[];
+export declare function filter<T>(array: T[], f: (x: T) => boolean): T[];
+export declare function filter<T, U extends T>(array: readonly T[], f: (x: T) => x is U): readonly U[];
+export declare function filter<T>(array: readonly T[], f: (x: T) => boolean): readonly T[];
+export declare function filter<T, U extends T>(array: T[] | undefined, f: (x: T) => x is U): U[] | undefined;
+export declare function filter<T>(array: T[] | undefined, f: (x: T) => boolean): T[] | undefined;
+export declare function filter<T, U extends T>(array: readonly T[] | undefined, f: (x: T) => x is U): readonly U[] | undefined;
+export declare function filter<T>(array: readonly T[] | undefined, f: (x: T) => boolean): readonly T[] | undefined;
+export declare function filterMutate<T>(array: T[], f: (x: T, i: number, array: T[]) => boolean): void;
+export declare function clear(array: {}[]): void;
+export declare function map<T, U>(array: readonly T[], f: (x: T, i: number) => U): U[];
+export declare function map<T, U>(array: readonly T[] | undefined, f: (x: T, i: number) => U): U[] | undefined;
+export declare function sameMap<T>(array: T[], f: (x: T, i: number) => T): T[];
+export declare function sameMap<T>(array: readonly T[], f: (x: T, i: number) => T): readonly T[];
+export declare function sameMap<T>(array: T[] | undefined, f: (x: T, i: number) => T): T[] | undefined;
+export declare function sameMap<T>(array: readonly T[] | undefined, f: (x: T, i: number) => T): readonly T[] | undefined;
+/**
+ * Flattens an array containing a mix of array or non-array elements.
+ *
+ * @param array The array to flatten.
+ */
+export declare function flatten<T>(array: T[][] | readonly (T | readonly T[] | undefined)[]): T[];
+/**
+ * Maps an array. If the mapped value is an array, it is spread into the result.
+ *
+ * @param array The array to map.
+ * @param mapfn The callback used to map the result into one or more values.
+ */
+export declare function flatMap<T, U>(array: readonly T[] | undefined, mapfn: (x: T, i: number) => U | readonly U[] | undefined): readonly U[];
+export declare function flatMapToMutable<T, U>(array: readonly T[] | undefined, mapfn: (x: T, i: number) => U | readonly U[] | undefined): U[];
+export declare function flatMapIterator<T, U>(iter: Iterator<T>, mapfn: (x: T) => readonly U[] | Iterator<U> | undefined): Iterator<U>;
+/**
+ * Maps an array. If the mapped value is an array, it is spread into the result.
+ * Avoids allocation if all elements map to themselves.
+ *
+ * @param array The array to map.
+ * @param mapfn The callback used to map the result into one or more values.
+ */
+export declare function sameFlatMap<T>(array: T[], mapfn: (x: T, i: number) => T | readonly T[]): T[];
+export declare function sameFlatMap<T>(array: readonly T[], mapfn: (x: T, i: number) => T | readonly T[]): readonly T[];
+export declare function mapDefined<T, U>(array: readonly T[] | undefined, mapFn: (x: T, i: number) => U | undefined): U[];
+export declare const emptyIterator: Iterator<never>;
+export declare function mapEntries<T, U>(map: ReadonlyMap<T>, f: (key: string, value: T) => [string, U]): Map<U>;
+export declare function mapEntries<T, U>(map: ReadonlyMap<T> | undefined, f: (key: string, value: T) => [string, U]): Map<U> | undefined;
+export declare function some<T>(array: readonly T[] | undefined): array is readonly T[];
+export declare function some<T>(array: readonly T[] | undefined, predicate: (value: T) => boolean): boolean;
+/** Calls the callback with (start, afterEnd) index pairs for each range where 'pred' is true. */
+export declare function getRangesWhere<T>(arr: readonly T[], pred: (t: T) => boolean, cb: (start: number, afterEnd: number) => void): void;
+export declare function concatenate<T>(array1: T[], array2: T[]): T[];
+export declare function concatenate<T>(array1: readonly T[], array2: readonly T[]): readonly T[];
+export declare function concatenate<T>(array1: T[] | undefined, array2: T[] | undefined): T[];
+export declare function concatenate<T>(array1: readonly T[] | undefined, array2: readonly T[] | undefined): readonly T[];
+export declare function indicesOf(array: readonly unknown[]): number[];
+/**
+ * Deduplicates an unsorted array.
+ * @param equalityComparer An `EqualityComparer` used to determine if two values are duplicates.
+ * @param comparer An optional `Comparer` used to sort entries before comparison, though the
+ * result will remain in the original order in `array`.
+ */
+export declare function deduplicate<T>(array: readonly T[], equalityComparer: EqualityComparer<T>, comparer?: Comparer<T>): T[];
+export declare function insertSorted<T>(array: SortedArray<T>, insert: T, compare: Comparer<T>): void;
+export declare function sortAndDeduplicate(array: readonly string[]): SortedReadonlyArray<string>;
+export declare function sortAndDeduplicate<T>(array: readonly T[], comparer: Comparer<T>, equalityComparer?: EqualityComparer<T>): SortedReadonlyArray<T>;
+export declare function arrayIsEqualTo<T>(array1: readonly T[] | undefined, array2: readonly T[] | undefined, equalityComparer?: (a: T, b: T, index: number) => boolean): boolean;
+/**
+ * Compacts an array, removing any falsey elements.
+ */
+export declare function compact<T>(array: (T | undefined | null | false | 0 | "")[]): T[];
+export declare function compact<T>(array: readonly (T | undefined | null | false | 0 | "")[]): readonly T[];
+export declare function compact<T>(array: T[]): T[];
+export declare function compact<T>(array: readonly T[]): readonly T[];
+/**
+ * Gets the relative complement of `arrayA` with respect to `arrayB`, returning the elements that
+ * are not present in `arrayA` but are present in `arrayB`. Assumes both arrays are sorted
+ * based on the provided comparer.
+ */
+export declare function relativeComplement<T>(arrayA: T[] | undefined, arrayB: T[] | undefined, comparer: Comparer<T>): T[] | undefined;
+/**
+ * Appends a value to an array, returning the array.
+ *
+ * @param to The array to which `value` is to be appended. If `to` is `undefined`, a new array
+ * is created if `value` was appended.
+ * @param value The value to append to the array. If `value` is `undefined`, nothing is
+ * appended.
+ */
+export declare function append<TArray extends any[] | undefined, TValue extends NonNullable<TArray>[number] | undefined>(to: TArray, value: TValue): [undefined, undefined] extends [TArray, TValue] ? TArray : NonNullable<TArray>[number][];
+export declare function append<T>(to: T[], value: T | undefined): T[];
+export declare function append<T>(to: T[] | undefined, value: T): T[];
+export declare function append<T>(to: T[] | undefined, value: T | undefined): T[] | undefined;
+export declare function append<T>(to: Push<T>, value: T | undefined): void;
+/**
+ * Combines two arrays, values, or undefineds into the smallest container that can accommodate the resulting set:
+ *
+ * ```
+ * undefined -> undefined -> undefined
+ * T -> undefined -> T
+ * T -> T -> T[]
+ * T[] -> undefined -> T[] (no-op)
+ * T[] -> T -> T[]         (append)
+ * T[] -> T[] -> T[]       (concatenate)
+ * ```
+ */
+export declare function combine<T>(xs: T | readonly T[] | undefined, ys: T | readonly T[] | undefined): T | readonly T[] | undefined;
+export declare function combine<T>(xs: T | T[] | undefined, ys: T | T[] | undefined): T | T[] | undefined;
+/**
+ * Appends a range of value to an array, returning the array.
+ *
+ * @param to The array to which `value` is to be appended. If `to` is `undefined`, a new array
+ * is created if `value` was appended.
+ * @param from The values to append to the array. If `from` is `undefined`, nothing is
+ * appended. If an element of `from` is `undefined`, that element is not appended.
+ * @param start The offset in `from` at which to start copying values.
+ * @param end The offset in `from` at which to stop copying values (non-inclusive).
+ */
+export declare function addRange<T>(to: T[], from: readonly T[] | undefined, start?: number, end?: number): T[];
+export declare function addRange<T>(to: T[] | undefined, from: readonly T[] | undefined, start?: number, end?: number): T[] | undefined;
+/**
+ * @return Whether the value was added.
+ */
+export declare function pushIfUnique<T>(array: T[], toAdd: T, equalityComparer?: EqualityComparer<T>): boolean;
+/**
+ * Unlike `pushIfUnique`, this can take `undefined` as an input, and returns a new array.
+ */
+export declare function appendIfUnique<T>(array: T[] | undefined, toAdd: T, equalityComparer?: EqualityComparer<T>): T[];
+/**
+ * Returns a new sorted array.
+ */
+export declare function sort<T>(array: readonly T[], comparer?: Comparer<T>): SortedReadonlyArray<T>;
+export declare function arrayIterator<T>(array: readonly T[]): Iterator<T>;
+/**
+ * Stable sort of an array. Elements equal to each other maintain their relative position in the array.
+ */
+export declare function stableSort<T>(array: readonly T[], comparer: Comparer<T>): SortedReadonlyArray<T>;
+export declare function rangeEquals<T>(array1: readonly T[], array2: readonly T[], pos: number, end: number): boolean;
+/**
+ * Returns the element at a specific offset in an array if non-empty, `undefined` otherwise.
+ * A negative offset indicates the element should be retrieved from the end of the array.
+ */
+export declare function elementAt<T>(array: readonly T[] | undefined, offset: number): T | undefined;
+/**
+ * Returns the first element of an array if non-empty, `undefined` otherwise.
+ */
+export declare function firstOrUndefined<T>(array: readonly T[]): T | undefined;
+export declare function first<T>(array: readonly T[]): T;
+/**
+ * Returns the last element of an array if non-empty, `undefined` otherwise.
+ */
+export declare function lastOrUndefined<T>(array: readonly T[]): T | undefined;
+export declare function last<T>(array: readonly T[]): T;
+/**
+ * Returns the only element of an array if it contains only one element, `undefined` otherwise.
+ */
+export declare function singleOrUndefined<T>(array: readonly T[] | undefined): T | undefined;
+export declare function replaceElement<T>(array: readonly T[], index: number, value: T): T[];
+/**
+ * Performs a binary search, finding the index at which `value` occurs in `array`.
+ * If no such index is found, returns the 2's-complement of first index at which
+ * `array[index]` exceeds `value`.
+ * @param array A sorted array whose first element must be no larger than number
+ * @param value The value to be searched for in the array.
+ * @param keySelector A callback used to select the search key from `value` and each element of
+ * `array`.
+ * @param keyComparer A callback used to compare two keys in a sorted array.
+ * @param offset An offset into `array` at which to start the search.
+ */
+export declare function binarySearch<T, U>(array: readonly T[], value: T, keySelector: (v: T) => U, keyComparer: Comparer<U>, offset?: number): number;
+/**
+ * Performs a binary search, finding the index at which an object with `key` occurs in `array`.
+ * If no such index is found, returns the 2's-complement of first index at which
+ * `array[index]` exceeds `key`.
+ * @param array A sorted array whose first element must be no larger than number
+ * @param key The key to be searched for in the array.
+ * @param keySelector A callback used to select the search key from each element of `array`.
+ * @param keyComparer A callback used to compare two keys in a sorted array.
+ * @param offset An offset into `array` at which to start the search.
+ */
+export declare function binarySearchKey<T, U>(array: readonly T[], key: U, keySelector: (v: T) => U, keyComparer: Comparer<U>, offset?: number): number;
+export declare function reduceLeft<T, U>(array: readonly T[] | undefined, f: (memo: U, value: T, i: number) => U, initial: U, start?: number, count?: number): U;
+export declare function reduceLeft<T>(array: readonly T[], f: (memo: T, value: T, i: number) => T): T | undefined;
+/**
+ * Indicates whether a map-like contains an own property with the specified key.
+ *
+ * @param map A map-like.
+ * @param key A property key.
+ */
+export declare function hasProperty(map: MapLike<any>, key: string): boolean;
+/**
+ * Gets the value of an owned property in a map-like.
+ *
+ * @param map A map-like.
+ * @param key A property key.
+ */
+export declare function getProperty<T>(map: MapLike<T>, key: string): T | undefined;
+/**
+ * Gets the owned, enumerable property keys of a map-like.
+ */
+export declare function getOwnKeys<T>(map: MapLike<T>): string[];
+export declare function getOwnValues<T>(sparseArray: T[]): T[];
+/** Shims `Array.from`. */
+export declare function arrayFrom<T, U>(iterator: Iterator<T> | IterableIterator<T>, map: (t: T) => U): U[];
+export declare function arrayFrom<T>(iterator: Iterator<T> | IterableIterator<T>): T[];
+export declare function assign<T extends object>(t: T, ...args: (T | undefined)[]): T;
+/**
+ * O mapa dos elementos de um array, cada um sob a chave que o `makeKey` dá a ele. Dois elementos com a mesma chave não
+ * são erro: fica o de índice maior.
+ */
+export declare function arrayToMap<T>(array: readonly T[], makeKey: (value: T) => string | undefined): Map<T>;
+export declare function arrayToMap<T, U>(array: readonly T[], makeKey: (value: T) => string | undefined, makeValue: (value: T) => U): Map<U>;
+export declare function arrayToMultiMap<T>(values: readonly T[], makeKey: (value: T) => string): MultiMap<T>;
+export declare function arrayToMultiMap<T, U>(values: readonly T[], makeKey: (value: T) => string, makeValue: (value: T) => U): MultiMap<U>;
+export declare function group<T>(values: readonly T[], getGroupId: (value: T) => string): readonly (readonly T[])[];
+export declare function group<T, R>(values: readonly T[], getGroupId: (value: T) => string, resultSelector: (values: readonly T[]) => R): R[];
+export declare function clone<T>(object: T): T;
+/**
+ * Creates a new object by adding the own properties of `second`, then the own properties of `first`.
+ *
+ * NOTE: This means that if a property exists in both `first` and `second`, the property in `first` will be chosen.
+ */
+export declare function extend<T1, T2>(first: T1, second: T2): T1 & T2;
+export declare function maybeBind<T, A extends any[], R>(obj: T, fn: ((this: T, ...args: A) => R) | undefined): ((...args: A) => R) | undefined;
+export interface MultiMap<T> extends Map<T[]> {
+    /**
+     * Adds the value to an array of values associated with the key, and returns the array.
+     * Creates the array if it does not already exist.
+     */
+    add(key: string, value: T): T[];
+    /**
+     * Removes a value from an array of values associated with the key.
+     * Does not preserve the order of those values.
+     * Does nothing if `key` is not in `map`, or `value` is not in `map[key]`.
+     */
+    remove(key: string, value: T): void;
+}
+export declare function createMultiMap<T>(): MultiMap<T>;
+export interface UnderscoreEscapedMultiMap<T> extends UnderscoreEscapedMap<T[]> {
+    /**
+     * Adds the value to an array of values associated with the key, and returns the array.
+     * Creates the array if it does not already exist.
+     */
+    add(key: __String, value: T): T[];
+    /**
+     * Removes a value from an array of values associated with the key.
+     * Does not preserve the order of those values.
+     * Does nothing if `key` is not in `map`, or `value` is not in `map[key]`.
+     */
+    remove(key: __String, value: T): void;
+}
+export declare function createUnderscoreEscapedMultiMap<T>(): UnderscoreEscapedMultiMap<T>;
+/**
+ * Tests whether a value is an array.
+ */
+export declare function isArray(value: any): value is readonly unknown[];
+export declare function toArray<T>(value: T | T[]): T[];
+export declare function toArray<T>(value: T | readonly T[]): readonly T[];
+/**
+ * Tests whether a value is string
+ */
+export declare function isString(text: unknown): text is string;
+export declare function isNumber(x: unknown): x is number;
+export declare function tryCast<TOut extends TIn, TIn = any>(value: TIn | undefined, test: (value: TIn) => value is TOut): TOut | undefined;
+export declare function tryCast<T>(value: T, test: (value: T) => boolean): T | undefined;
+export declare function cast<TOut extends TIn, TIn = any>(value: TIn | undefined, test: (value: TIn) => value is TOut): TOut;
+/** Does nothing. */
+export declare function noop(_?: {} | null | undefined): void;
+export declare function returnTrue(): true;
+/** Do nothing and return undefined */
+export declare function returnUndefined(): undefined;
+/** Returns its argument. */
+export declare function identity<T>(x: T): T;
+/** Returns lower case string */
+export declare function toLowerCase(x: string): string;
+/**
+ * Case insensitive file systems have descripencies in how they handle some characters (eg. turkish Upper case I with dot on top - \u0130)
+ * This function is used in places where we want to make file name as a key on these systems
+ * It is possible on mac to be able to refer to file name with I with dot on top as a fileName with its lower case form
+ * But on windows we cannot. Windows can have fileName with I with dot on top next to its lower case and they can not each be referred with the lowercase forms
+ * Technically we would want this function to be platform sepcific as well but
+ * our api has till now only taken caseSensitive as the only input and just for some characters we dont want to update API and ensure all customers use those api
+ * We could use upper case and we would still need to deal with the descripencies but
+ * we want to continue using lower case since in most cases filenames are lowercasewe and wont need any case changes and avoid having to store another string for the key
+ * So for this function purpose, we go ahead and assume character I with dot on top it as case sensitive since its very unlikely to use lower case form of that special character
+ */
+export declare function toFileNameLowerCase(x: string): string;
+/** Throws an error because a function is not implemented. */
+export declare function notImplemented(): never;
+export declare function memoize<T>(callback: () => T): () => T;
+/**
+ * High-order function, composes functions. Note that functions are composed inside-out;
+ * for example, `compose(a, b)` is the equivalent of `x => b(a(x))`.
+ *
+ * @param args The functions to compose.
+ */
+export declare function compose<T>(...args: ((t: T) => T)[]): (t: T) => T;
+export declare enum AssertionLevel {
+    None = 0,
+    Normal = 1,
+    Aggressive = 2,
+    VeryAggressive = 3
+}
+/**
+ * Safer version of `Function` which should not be called.
+ * Every function should be assignable to this, but this should not be assignable to every function.
+ */
+export type AnyFunction = (...args: never[]) => void;
+export declare function equateValues<T>(a: T, b: T): boolean;
+/**
+ * Compare the equality of two strings using a case-sensitive ordinal comparison.
+ *
+ * Case-sensitive comparisons compare both strings one code-point at a time using the integer
+ * value of each code-point after applying `toUpperCase` to each string. We always map both
+ * strings to their upper-case form as some unicode characters do not properly round-trip to
+ * lowercase (such as `ẞ` (German sharp capital s)).
+ */
+export declare function equateStringsCaseInsensitive(a: string, b: string): boolean;
+/**
+ * Compare the equality of two strings using a case-sensitive ordinal comparison.
+ *
+ * Case-sensitive comparisons compare both strings one code-point at a time using the
+ * integer value of each code-point.
+ */
+export declare function equateStringsCaseSensitive(a: string, b: string): boolean;
+/**
+ * Compare two numeric values for their order relative to each other.
+ * To compare strings, use any of the `compareStrings` functions.
+ */
+export declare function compareValues(a: number | undefined, b: number | undefined): Comparison;
+export declare function min<T>(a: T, b: T, compare: Comparer<T>): T;
+/**
+ * Compare two strings using a case-insensitive ordinal comparison.
+ *
+ * Ordinal comparisons are based on the difference between the unicode code points of both
+ * strings. Characters with multiple unicode representations are considered unequal. Ordinal
+ * comparisons provide predictable ordering, but place "a" after "B".
+ *
+ * Case-insensitive comparisons compare both strings one code-point at a time using the integer
+ * value of each code-point after applying `toUpperCase` to each string. We always map both
+ * strings to their upper-case form as some unicode characters do not properly round-trip to
+ * lowercase (such as `ẞ` (German sharp capital s)).
+ */
+export declare function compareStringsCaseInsensitive(a: string, b: string): Comparison;
+/**
+ * Compare two strings using a case-sensitive ordinal comparison.
+ *
+ * Ordinal comparisons are based on the difference between the unicode code points of both
+ * strings. Characters with multiple unicode representations are considered unequal. Ordinal
+ * comparisons provide predictable ordering, but place "a" after "B".
+ *
+ * Case-sensitive comparisons compare both strings one code-point at a time using the integer
+ * value of each code-point.
+ */
+export declare function compareStringsCaseSensitive(a: string | undefined, b: string | undefined): Comparison;
+export declare function getStringComparer(ignoreCase?: boolean): typeof compareStringsCaseInsensitive;
+/**
+ * Compare two strings in a using the case-sensitive sort behavior of the UI locale.
+ *
+ * Ordering is not predictable between different host locales, but is best for displaying
+ * ordered data for UI presentation. Characters with multiple unicode representations may
+ * be considered equal.
+ *
+ * Case-sensitive comparisons compare strings that differ in base characters, or
+ * accents/diacritic marks, or case as unequal.
+ */
+export declare function compareStringsCaseSensitiveUI(a: string, b: string): Comparison;
+export declare function compareProperties<T extends {}, K extends keyof T>(a: T | undefined, b: T | undefined, key: K, comparer: Comparer<T[K]>): Comparison;
+/** True is greater than false. */
+export declare function compareBooleans(a: boolean, b: boolean): Comparison;
+/**
+ * Given a name and a list of names that are *not* equal to the name, return a spelling suggestion if there is one that is close enough.
+ * Names less than length 3 only check for case-insensitive equality, not Levenshtein distance.
+ *
+ * If there is a candidate that's the same except for case, return that.
+ * If there is a candidate that's within one edit of the name, return that.
+ * Otherwise, return the candidate with the smallest Levenshtein distance,
+ *    except for candidates:
+ *      * With no name
+ *      * Whose length differs from the target name by more than 0.34 of the length of the name.
+ *      * Whose levenshtein distance is more than 0.4 of the length of the name
+ *        (0.4 allows 1 substitution/transposition for every 5 characters,
+ *         and 1 insertion/deletion at 3 characters)
+ */
+export declare function getSpellingSuggestion<T>(name: string, candidates: T[], getName: (candidate: T) => string | undefined): T | undefined;
+export declare function endsWith(str: string, suffix: string): boolean;
+export declare function removeSuffix(str: string, suffix: string): string;
+export declare function tryRemoveSuffix(str: string, suffix: string): string | undefined;
+export declare function stringContains(str: string, substring: string): boolean;
+/** Remove an item by index from an array, moving everything to its right one space left. */
+export declare function orderedRemoveItemAt<T>(array: T[], index: number): void;
+export declare function unorderedRemoveItemAt<T>(array: T[], index: number): void;
+/** Remove the *first* occurrence of `item` from the array. */
+export declare function unorderedRemoveItem<T>(array: T[], item: T): boolean;
+export type GetCanonicalFileName = (fileName: string) => string;
+export declare function createGetCanonicalFileName(useCaseSensitiveFileNames: boolean): GetCanonicalFileName;
+/** Represents a "prefix*suffix" pattern. */
+export interface Pattern {
+    prefix: string;
+    suffix: string;
+}
+export declare function startsWith(str: string, prefix: string): boolean;
+export declare function removePrefix(str: string, prefix: string): string;
+export declare function tryRemovePrefix(str: string, prefix: string, getCanonicalFileName?: GetCanonicalFileName): string | undefined;
+export declare function and<T>(f: (arg: T) => boolean, g: (arg: T) => boolean): (arg: T) => boolean;
+export declare function or<T extends unknown[]>(...fs: ((...args: T) => boolean)[]): (...args: T) => boolean;
+export declare function not<T extends unknown[]>(fn: (...args: T) => boolean): (...args: T) => boolean;
+export declare function assertType<T>(_: T): void;
+export declare function singleElementArray<T>(t: T | undefined): T[] | undefined;
+export declare function fill<T>(length: number, cb: (index: number) => T): T[];
+export declare function cartesianProduct<T>(arrays: readonly T[][]): T[][];