pub const STACK_GRAPHS_BUILTINS_SOURCE: &str = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\ninterface IteratorYieldResult<TYield> {\n done?: false;\n value: TYield;\n}\n\ninterface IteratorReturnResult<TReturn> {\n done: true;\n value: TReturn;\n}\n\ntype IteratorResult<T, TReturn = any> = IteratorYieldResult<T> | IteratorReturnResult<TReturn>;\n\ninterface Iterator<T, TReturn = any, TNext = undefined> {\n next(...args: [] | [TNext]): IteratorResult<T, TReturn>;\n return?(value?: TReturn): IteratorResult<T, TReturn>;\n throw?(e?: any): IteratorResult<T, TReturn>;\n}\n\ninterface Iterable<T> {\n [Symbol.iterator](): Iterator<T>;\n}\n\ninterface IterableIterator<T> extends Iterator<T> {\n [Symbol.iterator](): IterableIterator<T>;\n}\n\ninterface ArrayLike<T> {\n readonly length: number;\n readonly [n: number]: T;\n}\n\ninterface Array<T> {\n length: number;\n toString(): string;\n toLocaleString(): string;\n pop(): T | undefined;\n push(...items: T[]): number;\n concat(...items: ConcatArray<T>[]): T[];\n concat(...items: (T | ConcatArray<T>)[]): T[];\n join(separator?: string): string;\n reverse(): T[];\n shift(): T | undefined;\n slice(start?: number, end?: number): T[];\n sort(compareFn?: (a: T, b: T) => number): this;\n splice(start: number, deleteCount?: number): T[];\n splice(start: number, deleteCount: number, ...items: T[]): T[];\n unshift(...items: T[]): number;\n indexOf(searchElement: T, fromIndex?: number): number;\n lastIndexOf(searchElement: T, fromIndex?: number): number;\n every<S extends T>(predicate: (value: T, index: number, array: T[]) => value is S, thisArg?: any): this is S[];\n every(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): boolean;\n some(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): boolean;\n forEach(callbackfn: (value: T, index: number, array: T[]) => void, thisArg?: any): void;\n map<U>(callbackfn: (value: T, index: number, array: T[]) => U, thisArg?: any): U[];\n filter<S extends T>(predicate: (value: T, index: number, array: T[]) => value is S, thisArg?: any): S[];\n filter(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): T[];\n reduce(callbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: T[]) => T): T;\n reduce(callbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: T[]) => T, initialValue: T): T;\n reduce<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: T[]) => U, initialValue: U): U;\n reduceRight(callbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: T[]) => T): T;\n reduceRight(callbackfn: (previousValue: T, currentValue: T, currentIndex: number, array: T[]) => T, initialValue: T): T;\n reduceRight<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: T[]) => U, initialValue: U): U;\n [n: number]: T;\n\n find<S extends T>(predicate: (this: void, value: T, index: number, obj: T[]) => value is S, thisArg?: any): S | undefined;\n find(predicate: (value: T, index: number, obj: T[]) => unknown, thisArg?: any): T | undefined;\n findIndex(predicate: (value: T, index: number, obj: T[]) => unknown, thisArg?: any): number;\n fill(value: T, start?: number, end?: number): this;\n copyWithin(target: number, start: number, end?: number): this;\n\n [Symbol.iterator](): IterableIterator<T>;\n entries(): IterableIterator<[number, T]>;\n keys(): IterableIterator<number>;\n values(): IterableIterator<T>;\n}\n\ninterface ArrayConstructor {\n new(arrayLength?: number): any[];\n new <T>(arrayLength: number): T[];\n new <T>(...items: T[]): T[];\n (arrayLength?: number): any[];\n <T>(arrayLength: number): T[];\n <T>(...items: T[]): T[];\n isArray(arg: any): arg is any[];\n readonly prototype: any[];\n}\ndeclare var Array: ArrayConstructor;\n\ninterface Map<K, V> {\n clear(): void;\n delete(key: K): boolean;\n forEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void;\n get(key: K): V | undefined;\n has(key: K): boolean;\n set(key: K, value: V): this;\n readonly size: number;\n\n [Symbol.iterator](): IterableIterator<[K, V]>;\n entries(): IterableIterator<[K, V]>;\n keys(): IterableIterator<K>;\n values(): IterableIterator<V>;\n}\n\ninterface MapConstructor {\n new(): Map<any, any>;\n new<K, V>(entries?: readonly (readonly [K, V])[] | null): Map<K, V>;\n readonly prototype: Map<any, any>;\n}\ndeclare var Map: MapConstructor;\n\ninterface ReadonlyMap<K, V> {\n forEach(callbackfn: (value: V, key: K, map: ReadonlyMap<K, V>) => void, thisArg?: any): void;\n get(key: K): V | undefined;\n has(key: K): boolean;\n readonly size: number;\n}\n\ninterface WeakMap<K extends object, V> {\n delete(key: K): boolean;\n get(key: K): V | undefined;\n has(key: K): boolean;\n set(key: K, value: V): this;\n}\n\ninterface WeakMapConstructor {\n new <K extends object = object, V = any>(entries?: readonly [K, V][] | null): WeakMap<K, V>;\n readonly prototype: WeakMap<object, any>;\n}\ndeclare var WeakMap: WeakMapConstructor;\n\ninterface Set<T> {\n add(value: T): this;\n clear(): void;\n delete(value: T): boolean;\n forEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void;\n has(value: T): boolean;\n readonly size: number;\n\n [Symbol.iterator](): IterableIterator<T>;\n entries(): IterableIterator<[T, T]>;\n keys(): IterableIterator<T>;\n values(): IterableIterator<T>;\n}\n\ninterface SetConstructor {\n new <T = any>(values?: readonly T[] | null): Set<T>;\n readonly prototype: Set<any>;\n}\ndeclare var Set: SetConstructor;\n\ninterface ReadonlySet<T> {\n forEach(callbackfn: (value: T, value2: T, set: ReadonlySet<T>) => void, thisArg?: any): void;\n has(value: T): boolean;\n readonly size: number;\n}\n\ninterface WeakSet<T extends object> {\n add(value: T): this;\n delete(value: T): boolean;\n has(value: T): boolean;\n}\n\ninterface WeakSetConstructor {\n new <T extends object = object>(values?: readonly T[] | null): WeakSet<T>;\n readonly prototype: WeakSet<object>;\n}\ndeclare var WeakSet: WeakSetConstructor;\n\ninterface PromiseLike<T> {\n then<TResult1 = T, TResult2 = never>(onfulfilled?: ((value: T) => TResult1 | PromiseLike<TResult1>) | undefined | null, onrejected?: ((reason: any) => TResult2 | PromiseLike<TResult2>) | undefined | null): PromiseLike<TResult1 | TResult2>;\n}\n\ninterface Promise<T> {\n $Promise$T: T;\n then<TResult1 = T, TResult2 = never>(onfulfilled?: ((value: T) => TResult1 | PromiseLike<TResult1>) | undefined | null, onrejected?: ((reason: any) => TResult2 | PromiseLike<TResult2>) | undefined | null): Promise<TResult1 | TResult2>;\n catch<TResult = never>(onrejected?: ((reason: any) => TResult | PromiseLike<TResult>) | undefined | null): Promise<T | TResult>;\n}\ninterface PromiseConstructor {\n new <T>(executor: (resolve: (value: T | PromiseLike<T>) => void, reject: (reason?: any) => void) => void): Promise<T>;\n all<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike<T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>, T8 | PromiseLike<T8>, T9 | PromiseLike<T9>, T10 | PromiseLike<T10>]): Promise<[T1, T2, T3, T4,\nT5, T6, T7, T8, T9, T10]>;\n all<T1, T2, T3, T4, T5, T6, T7, T8, T9>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike<T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>, T8 | PromiseLike<T8>, T9 | PromiseLike<T9>]): Promise<[T1, T2, T3, T4, T5, T6, T7, T8, T9]>;\n all<T1, T2, T3, T4, T5, T6, T7, T8>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike<T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>, T8 | PromiseLike<T8>]): Promise<[T1, T2, T3, T4, T5, T6, T7, T8]>;\n all<T1, T2, T3, T4, T5, T6, T7>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike<T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>]): Promise<[T1, T2, T3, T4, T5, T6, T7]>;\n all<T1, T2, T3, T4, T5, T6>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike<T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>]): Promise<[T1, T2, T3, T4, T5, T6]>;\n all<T1, T2, T3, T4, T5>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike<T4>, T5 | PromiseLike<T5>]): Promise<[T1, T2, T3, T4, T5]>;\n all<T1, T2, T3, T4>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike<T4>]): Promise<[T1, T2, T3, T4]>;\n all<T1, T2, T3>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>]): Promise<[T1, T2, T3]>;\n all<T1, T2>(values: readonly [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>]): Promise<[T1, T2]>;\n all<T>(values: readonly (T | PromiseLike<T>)[]): Promise<T[]>;\n\n all<T>(values: Iterable<T | PromiseLike<T>>): Promise<T[]>;\n race<T>(values: Iterable<T>): Promise<T extends PromiseLike<infer U> ? U : T>;\n race<T>(values: Iterable<T | PromiseLike<T>>): Promise<T>;\n race<T>(values: readonly T[]): Promise<T extends PromiseLike<infer U> ? U : T>;\n\n reject<T = never>(reason?: any): Promise<T>;\n resolve(): Promise<void>;\n resolve<T>(value: T | PromiseLike<T>): Promise<T>;\n};\n\ndeclare var Promise: PromiseConstructor;";Expand description
The stack graphs builtins source for this language