Gecko [ gandhischool.edu.np ]

Name	Size	Permission
cs	[ DIR ]	dr-xr-xr-x
de	[ DIR ]	dr-xr-xr-x
es	[ DIR ]	dr-xr-xr-x
fr	[ DIR ]	dr-xr-xr-x
it	[ DIR ]	dr-xr-xr-x
ja	[ DIR ]	dr-xr-xr-x
ko	[ DIR ]	dr-xr-xr-x
pl	[ DIR ]	dr-xr-xr-x
pt-br	[ DIR ]	dr-xr-xr-x
ru	[ DIR ]	dr-xr-xr-x
tr	[ DIR ]	dr-xr-xr-x
zh-cn	[ DIR ]	dr-xr-xr-x
zh-tw	[ DIR ]	dr-xr-xr-x
README.md	270 B	-rw-rw-rw-
cancellationToken.js	2.83 KB	-rw-rw-rw-
dynamicImportCompat.js	1.04 KB	-rw-rw-rw-
lib.d.ts	999 B	-rw-rw-rw-
lib.dom.d.ts	797.64 KB	-rw-rw-rw-
lib.dom.iterable.d.ts	16.17 KB	-rw-rw-rw-
lib.es2015.collection.d.ts	5.21 KB	-rw-rw-rw-
lib.es2015.core.d.ts	21.26 KB	-rw-rw-rw-
lib.es2015.d.ts	1.22 KB	-rw-rw-rw-
lib.es2015.generator.d.ts	2.55 KB	-rw-rw-rw-
lib.es2015.iterable.d.ts	15.01 KB	-rw-rw-rw-
lib.es2015.promise.d.ts	3.19 KB	-rw-rw-rw-
lib.es2015.proxy.d.ts	5.24 KB	-rw-rw-rw-
lib.es2015.reflect.d.ts	6.47 KB	-rw-rw-rw-
lib.es2015.symbol.d.ts	1.64 KB	-rw-rw-rw-
lib.es2015.symbol.wellknown.d....	10.55 KB	-rw-rw-rw-
lib.es2016.array.include.d.ts	4.84 KB	-rw-rw-rw-
lib.es2016.d.ts	932 B	-rw-rw-rw-
lib.es2016.full.d.ts	1.01 KB	-rw-rw-rw-
lib.es2017.d.ts	1.07 KB	-rw-rw-rw-
lib.es2017.full.d.ts	1.01 KB	-rw-rw-rw-
lib.es2017.intl.d.ts	1.43 KB	-rw-rw-rw-
lib.es2017.object.d.ts	2.43 KB	-rw-rw-rw-
lib.es2017.sharedmemory.d.ts	6.2 KB	-rw-rw-rw-
lib.es2017.string.d.ts	2.35 KB	-rw-rw-rw-
lib.es2017.typedarrays.d.ts	1.43 KB	-rw-rw-rw-
lib.es2018.asyncgenerator.d.ts	2.68 KB	-rw-rw-rw-
lib.es2018.asynciterable.d.ts	1.74 KB	-rw-rw-rw-
lib.es2018.d.ts	1.07 KB	-rw-rw-rw-
lib.es2018.full.d.ts	1.01 KB	-rw-rw-rw-
lib.es2018.intl.d.ts	3.06 KB	-rw-rw-rw-
lib.es2018.promise.d.ts	1.33 KB	-rw-rw-rw-
lib.es2018.regexp.d.ts	1.22 KB	-rw-rw-rw-
lib.es2019.array.d.ts	3.17 KB	-rw-rw-rw-
lib.es2019.d.ts	1.05 KB	-rw-rw-rw-
lib.es2019.full.d.ts	1.02 KB	-rw-rw-rw-
lib.es2019.intl.d.ts	963 B	-rw-rw-rw-
lib.es2019.object.d.ts	1.46 KB	-rw-rw-rw-
lib.es2019.string.d.ts	1.51 KB	-rw-rw-rw-
lib.es2019.symbol.d.ts	1015 B	-rw-rw-rw-
lib.es2020.bigint.d.ts	35.23 KB	-rw-rw-rw-
lib.es2020.d.ts	1.18 KB	-rw-rw-rw-
lib.es2020.date.d.ts	2.91 KB	-rw-rw-rw-
lib.es2020.full.d.ts	1.02 KB	-rw-rw-rw-
lib.es2020.intl.d.ts	20.91 KB	-rw-rw-rw-
lib.es2020.number.d.ts	1.56 KB	-rw-rw-rw-
lib.es2020.promise.d.ts	1.79 KB	-rw-rw-rw-
lib.es2020.sharedmemory.d.ts	4.72 KB	-rw-rw-rw-
lib.es2020.string.d.ts	1.22 KB	-rw-rw-rw-
lib.es2020.symbol.wellknown.d....	1.44 KB	-rw-rw-rw-
lib.es2021.d.ts	1.02 KB	-rw-rw-rw-
lib.es2021.full.d.ts	1.02 KB	-rw-rw-rw-
lib.es2021.intl.d.ts	7.78 KB	-rw-rw-rw-
lib.es2021.promise.d.ts	2.24 KB	-rw-rw-rw-
lib.es2021.string.d.ts	1.57 KB	-rw-rw-rw-
lib.es2021.weakref.d.ts	2.73 KB	-rw-rw-rw-
lib.es2022.array.d.ts	4.26 KB	-rw-rw-rw-
lib.es2022.d.ts	1.1 KB	-rw-rw-rw-
lib.es2022.error.d.ts	2.34 KB	-rw-rw-rw-
lib.es2022.full.d.ts	1.02 KB	-rw-rw-rw-
lib.es2022.intl.d.ts	5.52 KB	-rw-rw-rw-
lib.es2022.object.d.ts	1.07 KB	-rw-rw-rw-
lib.es2022.sharedmemory.d.ts	1.27 KB	-rw-rw-rw-
lib.es2022.string.d.ts	1.14 KB	-rw-rw-rw-
lib.es5.d.ts	212.58 KB	-rw-rw-rw-
lib.es6.d.ts	1.02 KB	-rw-rw-rw-
lib.esnext.d.ts	925 B	-rw-rw-rw-
lib.esnext.full.d.ts	1.01 KB	-rw-rw-rw-
lib.esnext.intl.d.ts	1.18 KB	-rw-rw-rw-
lib.esnext.promise.d.ts	1.74 KB	-rw-rw-rw-
lib.esnext.string.d.ts	1.56 KB	-rw-rw-rw-
lib.esnext.weakref.d.ts	2.67 KB	-rw-rw-rw-
lib.scripthost.d.ts	9.53 KB	-rw-rw-rw-
lib.webworker.d.ts	265.88 KB	-rw-rw-rw-
lib.webworker.importscripts.d....	1.03 KB	-rw-rw-rw-
lib.webworker.iterable.d.ts	11.85 KB	-rw-rw-rw-
protocol.d.ts	103.67 KB	-rw-rw-rw-
tsc.js	5.87 MB	-rw-rw-rw-
tsserver.js	11.14 MB	-rw-rw-rw-
tsserverlibrary.d.ts	644.91 KB	-rw-rw-rw-
tsserverlibrary.js	11.08 MB	-rw-rw-rw-
typesMap.json	16.88 KB	-rw-rw-rw-
typescript.d.ts	501.83 KB	-rw-rw-rw-
typescript.js	10.44 MB	-rw-rw-rw-
typescriptServices.d.ts	501.82 KB	-rw-rw-rw-
typescriptServices.js	10.44 MB	-rw-rw-rw-
typingsInstaller.js	7.77 MB	-rw-rw-rw-
watchGuard.js	1.11 KB	-rw-rw-rw-

Code Editor : lib.es2015.collection.d.ts

/*! *****************************************************************************
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 Map<K, V> {

clear(): void;
    /**
     * @returns true if an element in the Map existed and has been removed, or false if the element does not exist.
     */
    delete(key: K): boolean;
    /**
     * Executes a provided function once per each key/value pair in the Map, in insertion order.
     */
    forEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void;
    /**
     * Returns a specified element from the Map object. If the value that is associated to the provided key is an object, then you will get a reference to that object and any change made to that object will effectively modify it inside the Map.
     * @returns Returns the element associated with the specified key. If no element is associated with the specified key, undefined is returned.
     */
    get(key: K): V | undefined;
    /**
     * @returns boolean indicating whether an element with the specified key exists or not.
     */
    has(key: K): boolean;
    /**
     * Adds a new element with a specified key and value to the Map. If an element with the same key already exists, the element will be updated.
     */
    set(key: K, value: V): this;
    /**
     * @returns the number of elements in the Map.
     */
    readonly size: number;
}

interface MapConstructor {
    new(): Map<any, any>;
    new <K, V>(entries?: readonly (readonly [K, V])[] | null): Map<K, V>;
    readonly prototype: Map<any, any>;
}
declare var Map: MapConstructor;

interface ReadonlyMap<K, V> {
    forEach(callbackfn: (value: V, key: K, map: ReadonlyMap<K, V>) => void, thisArg?: any): void;
    get(key: K): V | undefined;
    has(key: K): boolean;
    readonly size: number;
}

interface WeakMap<K extends object, V> {
    /**
     * Removes the specified element from the WeakMap.
     * @returns true if the element was successfully removed, or false if it was not present.
     */
    delete(key: K): boolean;
    /**
     * @returns a specified element.
     */
    get(key: K): V | undefined;
    /**
     * @returns a boolean indicating whether an element with the specified key exists or not.
     */
    has(key: K): boolean;
    /**
     * Adds a new element with a specified key and value.
     * @param key Must be an object.
     */
    set(key: K, value: V): this;
}

interface WeakMapConstructor {
    new <K extends object = object, V = any>(entries?: readonly [K, V][] | null): WeakMap<K, V>;
    readonly prototype: WeakMap<object, any>;
}
declare var WeakMap: WeakMapConstructor;

interface Set<T> {
    /**
     * Appends a new element with a specified value to the end of the Set.
     */
    add(value: T): this;

clear(): void;
    /**
     * Removes a specified value from the Set.
     * @returns Returns true if an element in the Set existed and has been removed, or false if the element does not exist.
     */
    delete(value: T): boolean;
    /**
     * Executes a provided function once per each value in the Set object, in insertion order.
     */
    forEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void;
    /**
     * @returns a boolean indicating whether an element with the specified value exists in the Set or not.
     */
    has(value: T): boolean;
    /**
     * @returns the number of (unique) elements in Set.
     */
    readonly size: number;
}

interface SetConstructor {
    new <T = any>(values?: readonly T[] | null): Set<T>;
    readonly prototype: Set<any>;
}
declare var Set: SetConstructor;

interface ReadonlySet<T> {
    forEach(callbackfn: (value: T, value2: T, set: ReadonlySet<T>) => void, thisArg?: any): void;
    has(value: T): boolean;
    readonly size: number;
}

interface WeakSet<T extends object> {
    /**
     * Appends a new object to the end of the WeakSet.
     */
    add(value: T): this;
    /**
     * Removes the specified element from the WeakSet.
     * @returns Returns true if the element existed and has been removed, or false if the element does not exist.
     */
    delete(value: T): boolean;
    /**
     * @returns a boolean indicating whether an object exists in the WeakSet or not.
     */
    has(value: T): boolean;
}

interface WeakSetConstructor {
    new <T extends object = object>(values?: readonly T[] | null): WeakSet<T>;
    readonly prototype: WeakSet<object>;
}
declare var WeakSet: WeakSetConstructor;

${this.title}

Code Editor : lib.es2015.collection.d.ts