From ae8fce14da334c1e525aa2515bbc494073448232 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Thu, 10 Dec 2015 09:37:39 +1100
Subject: [PATCH 001/278] Update definitions for ES6 compatability,

NOTE: Confusion over cryptojs vs crypto-js. I would suggest merging the two projects but this needs to happen on the npm repository first...
---
 crypto-js/crypto-js.d.ts | 579 +++++++++++++++++++++++++++++++++++----
 1 file changed, 520 insertions(+), 59 deletions(-)

diff --git a/crypto-js/crypto-js.d.ts b/crypto-js/crypto-js.d.ts
index 0f02514027..cde0abd9b9 100644
--- a/crypto-js/crypto-js.d.ts
+++ b/crypto-js/crypto-js.d.ts
@@ -1,67 +1,528 @@
-// Type definitions for crypto-js v3.1.3
+// Type definitions for crypto-js v3.1.5
 // Project: https://github.com/evanvosberg/crypto-js
-// Definitions by: Michael Zabka <https://github.com/misak113/>
+// Definitions by: Michael Zabka <https://github.com/misak113/> , Jason Turner <https://github.com/brewsoftware/>
 // Definitions: https://github.com/borisyankov/DefinitelyTyped
 
-declare module CryptoJS {
-	type Hash = (message: string, key?: string, ...options: any[]) => string;
+declare module CryptoJSLocal{
+    module lib{
+        interface Base{
+            extend(overrides: Object): Object
+            init(...args: any[]): void
+            //arguments of create() is same as init(). This is true for all subclasses
+            create(...args: any[]): Base
+            mixIn(properties: Object): void
+            clone(): Base
+        }
 
-	export interface Hashes {
-		MD5: Hash;
-		SHA1: Hash;
-		SHA256: Hash;
-		SHA224: Hash;
-		SHA512: Hash;
-		SHA384: Hash;
-		SHA3: Hash;
-		RIPEMD160: Hash;
-		HmacMD5: Hash;
-		HmacSHA1: Hash;
-		HmacSHA256: Hash;
-		HmacSHA224: Hash;
-		HmacSHA512: Hash;
-		HmacSHA384: Hash;
-		HmacSHA3: Hash;
-		HmacRIPEMD160: Hash;
-		PBKDF2: Hash;
-		AES: Hash;
-		TripleDES: Hash;
-		RC4: Hash;
-		Rabbit: Hash;
-		RabbitLegacy: Hash;
-		EvpKDF: Hash;
-		format: {
-			OpenSSL: Hash;
-			Hex: Hash;
-		};
-		enc: {
-			Latin1: Hash;
-			Utf8: Hash;
-			Hex: Hash;
-			Utf16: Hash;
-			Base64: Hash;
-		};
-		mode: {
-			CFB: Hash;
-			CTR: Hash;
-			CTRGladman: Hash;
-			OFB: Hash;
-			ECB: Hash;
-		};
-		pad: {
-			Pkcs7: Hash;
-			Ansix923: Hash;
-			Iso10126: Hash;
-			Iso97971: Hash;
-			ZeroPadding: Hash;
-			NoPadding: Hash;
-		};
-	}
+        interface WordArray extends Base{
+            words: number[]
+            sigBytes: number
+            init(words?: number[], sigBytes?: number): void
+            create(words?: number[], sigBytes?: number): WordArray
 
-	export var hashes: Hashes;
+            init(typedArray: ArrayBuffer): void
+            init(typedArray: Int8Array): void
+
+            //Because TypeScript uses a structural type system then we don't need (& can't)
+            //declare oveload function init, create for the following type (same as Int8Array):
+            //then Uint8Array, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array
+            //Note also: Uint8ClampedArray is not defined in lib.d.ts & not supported in IE
+            //@see http://compatibility.shwups-cms.ch/en/home?&property=Uint8ClampedArray
+
+            create(typedArray: ArrayBuffer): WordArray
+            create(typedArray: Int8Array): WordArray
+
+            toString(encoder?: enc.IEncoder): string
+            concat(wordArray: WordArray): WordArray
+            clamp(): void
+            clone(): WordArray
+            random(nBytes: number): WordArray
+        }
+
+        interface BufferedBlockAlgorithm extends Base{
+            reset(): void
+            clone(): BufferedBlockAlgorithm
+        }
+
+        //tparam C - Configuration type
+        interface IHasher<C> extends BufferedBlockAlgorithm{
+            cfg: C
+            init(cfg?: C): void
+            create(cfg?: C): IHasher<C>
+
+            update(messageUpdate: string): Hasher
+            update(messageUpdate: WordArray): Hasher
+
+            finalize(messageUpdate?: string): WordArray
+            finalize(messageUpdate?: WordArray): WordArray
+
+            blockSize: number
+
+            _createHelper(hasher: Hasher): IHasherHelper<C>
+            _createHmacHelper(hasher: Hasher): IHasherHmacHelper
+
+            clone(): IHasher<C>
+        }
+        interface Hasher extends IHasher<Object>{}
+
+        //tparam C - Configuration type
+        interface IHasherHelper<C>{
+            (message: string, cfg?: C): WordArray
+            (message: WordArray, cfg?: C): WordArray
+        }
+        interface HasherHelper extends IHasherHelper<Object>{}
+
+        interface IHasherHmacHelper{
+            (message: string,     key: string): WordArray
+            (message: string,     key: WordArray): WordArray
+            (message: WordArray,  key: string): WordArray
+            (message: WordArray,  key: WordArray): WordArray
+        }
+
+        //tparam C - Configuration type
+        interface ICipher<C> extends BufferedBlockAlgorithm{
+            cfg: C
+            createEncryptor(key: WordArray, cfg?: C): ICipher<C>
+            createDecryptor(key: WordArray, cfg?: C): ICipher<C>
+
+            create(xformMode?: number, key?: WordArray, cfg?: C): ICipher<C>
+            init(xformMode?: number, key?: WordArray, cfg?: C): void
+
+            process(dataUpdate: string): WordArray
+            process(dataUpdate: WordArray): WordArray
+
+            finalize(dataUpdate?: string): WordArray
+            finalize(dataUpdate?: WordArray): WordArray
+
+            keySize: number
+            ivSize: number
+
+            _createHelper(cipher: Cipher): ICipherHelper<C>
+
+            clone(): ICipher<C>
+        }
+        interface Cipher extends ICipher<Object>{}
+
+        interface IStreamCipher<C> extends ICipher<C>{
+            drop?: number;
+
+            createEncryptor(key: WordArray, cfg?: C): IStreamCipher<C>
+            createDecryptor(key: WordArray, cfg?: C): IStreamCipher<C>
+
+            create(xformMode?: number, key?: WordArray, cfg?: C): IStreamCipher<C>
+
+            blockSize: number
+        }
+        interface StreamCipher extends IStreamCipher<Object>{}
+
+        interface BlockCipherMode extends Base{
+            createEncryptor(cipher: Cipher, iv: number[]): mode.IBlockCipherEncryptor
+            createDecryptor(cipher: Cipher, iv: number[]): mode.IBlockCipherDecryptor
+            init(cipher?: Cipher, iv?: number[]): void
+            create(cipher?: Cipher, iv?: number[]): BlockCipherMode
+        }
+
+        //BlockCipher has interface same as IStreamCipher
+        interface BlockCipher extends IStreamCipher<IBlockCipherCfg>{}
+
+        interface IBlockCipherCfg {
+            iv?: WordArray;
+            mode?: mode.IBlockCipherModeImpl //default CBC
+            padding?: pad.IPaddingImpl //default Pkcs7
+        }
+
+        interface CipherParamsData {
+            ciphertext?: lib.WordArray
+            key?: lib.WordArray
+            iv?: lib.WordArray
+            salt?: lib.WordArray
+            algorithm?: Cipher
+            mode?: mode.IBlockCipherModeImpl
+            padding?: pad.IPaddingImpl
+            blockSize?: number
+            formatter?: format.IFormatter
+        }
+
+        interface CipherParams extends Base, CipherParamsData{
+            init(cipherParams?: CipherParamsData): void
+            create(cipherParams?: CipherParamsData): CipherParams
+            toString(formatter?: format.IFormatter): string
+        }
+
+        //tparam C - Configuration type
+        interface ISerializableCipher<C extends ISerializableCipherCfg> extends Base{
+            cfg: C
+            encrypt(cipher: Cipher, message: WordArray, key: WordArray, cfg?: C): CipherParams
+            encrypt(cipher: Cipher, message: string,    key: WordArray, cfg?: C): CipherParams
+
+            decrypt(cipher: Cipher, ciphertext: CipherParamsData, key: WordArray, cfg?: C): WordArray
+            decrypt(cipher: Cipher, ciphertext: string,       key: WordArray, cfg?: C): WordArray
+        }
+
+        interface SerializableCipher extends ISerializableCipher<ISerializableCipherCfg>{}
+        interface ISerializableCipherCfg{
+            format?: format.IFormatter //default OpenSSLFormatter
+            iv?: WordArray;
+            mode?: mode.IBlockCipherModeImpl;
+            padding?: pad.IPaddingImpl;
+        }
+
+        interface IPasswordBasedCipher<C extends IPasswordBasedCipherCfg> extends Base{
+            cfg: C
+            encrypt(cipher: Cipher, message: WordArray, password: string, cfg?: C): CipherParams
+            encrypt(cipher: Cipher, message: string,    password: string, cfg?: C): CipherParams
+
+            decrypt(cipher: Cipher, ciphertext: CipherParamsData, password: string, cfg?: C): WordArray
+            decrypt(cipher: Cipher, ciphertext: string,       password: string, cfg?: C): WordArray
+        }
+
+        interface PasswordBasedCipher extends IPasswordBasedCipher<IPasswordBasedCipherCfg>{}
+        interface IPasswordBasedCipherCfg extends ISerializableCipherCfg{
+            kdf?: kdf.IKdfImpl //default OpenSSLKdf
+            mode?: mode.IBlockCipherModeImpl;
+            padding?: pad.IPaddingImpl;
+        }
+
+        /** see Cipher._createHelper */
+        interface ICipherHelper<C>{
+            encrypt(message: string,    password: string, cfg?: C): CipherParams
+            encrypt(message: string,    key: WordArray, cfg?: C): CipherParams
+            encrypt(message: WordArray, password: string, cfg?: C): CipherParams
+            encrypt(message: WordArray, key: WordArray, cfg?: C): CipherParams
+
+            decrypt(ciphertext: string,       password: string, cfg?: C): WordArray
+            decrypt(ciphertext: string,       key: WordArray, cfg?: C): WordArray
+            decrypt(ciphertext: CipherParamsData, password: string, cfg?: C): WordArray
+            decrypt(ciphertext: CipherParamsData, key: WordArray, cfg?: C): WordArray
+        }
+
+        interface CipherHelper extends ICipherHelper<Object>{}
+        interface LibStatic{
+            Base: lib.Base
+            WordArray: lib.WordArray
+            CipherParams: lib.CipherParams
+            SerializableCipher: lib.SerializableCipher
+            PasswordBasedCipher: lib.PasswordBasedCipher
+        }
+    }
+
+    module enc{
+        interface IEncoder{
+            stringify(wordArray: lib.WordArray): string
+        }
+        interface IDecoder{
+            parse(s: string): lib.WordArray
+        }
+        interface ICoder extends IEncoder, IDecoder {}
+
+        interface EncStatic{
+            Hex: ICoder
+            Latin1: ICoder
+            Utf8: ICoder
+            Base64: ICoder
+            Utf16: ICoder
+            Utf16BE: ICoder
+            Utf16LE: ICoder
+        }
+    }
+
+    module kdf{
+        interface KdfStatic{
+            OpenSSL: IKdfImpl
+        }
+
+        interface IKdfImpl{
+            execute(password: string, keySize: number, ivSize: number, salt?: string): lib.CipherParams
+            execute(password: string, keySize: number, ivSize: number, salt?: lib.WordArray): lib.CipherParams
+        }
+    }
+
+    module format{
+        interface FormatStatic{
+            OpenSSL: IFormatter
+            Hex: IFormatter
+        }
+
+        interface IFormatter{
+            stringify(cipherParams: lib.CipherParamsData): string
+            parse(s: string): lib.CipherParams
+        }
+    }
+
+    module algo{
+        interface AlgoStatic{
+            AES: algo.AES
+            DES: algo.DES
+            TripleDES: algo.TripleDES
+
+            RabbitLegacy: algo.RabbitLegacy
+            Rabbit: algo.Rabbit
+            RC4: algo.RC4
+
+            MD5: algo.MD5
+            RIPEMD160: algo.RIPEMD160
+            SHA1: algo.SHA1
+            SHA256: algo.SHA256
+            SHA224: algo.SHA224
+            SHA384: algo.SHA384
+            SHA512: algo.SHA512
+
+            SHA3: algo.SHA3
+
+            HMAC: algo.HMAC
+
+            EvpKDF: algo.EvpKDF
+            PBKDF2: algo.PBKDF2
+
+            RC4Drop: algo.RC4Drop
+        }
+
+        interface IBlockCipherImpl extends lib.BlockCipher{
+            encryptBlock(M: number[], offset: number): void
+            decryptBlock(M: number[], offset: number): void
+
+            createEncryptor(key: lib.WordArray, cfg?: lib.CipherParamsData): IBlockCipherImpl
+            createDecryptor(key: lib.WordArray, cfg?: lib.CipherParamsData): IBlockCipherImpl
+
+            create(xformMode?: number, key?: lib.WordArray, cfg?: lib.IBlockCipherCfg): IBlockCipherImpl
+        }
+
+        interface AES extends IBlockCipherImpl{}
+        interface DES extends IBlockCipherImpl{}
+        interface TripleDES extends IBlockCipherImpl{}
+
+        interface RabbitLegacy extends lib.StreamCipher{}
+        interface Rabbit extends lib.StreamCipher{}
+        interface RC4 extends lib.StreamCipher{}
+
+        interface MD5 extends lib.Hasher{}
+        interface RIPEMD160 extends lib.Hasher{}
+        interface SHA1 extends lib.Hasher{}
+        interface SHA256 extends lib.Hasher{}
+        interface SHA224 extends lib.Hasher{}
+        interface SHA384 extends lib.Hasher{}
+        interface SHA512 extends lib.Hasher{}
+
+        interface SHA3 extends lib.IHasher<ISHA3Cfg>{}
+        interface ISHA3Cfg{
+            outputLength?: number //default 512
+        }
+
+        interface HMAC extends lib.Base{
+            init(hasher?: lib.Hasher, key?: string): void
+            init(hasher?: lib.Hasher, key?: lib.WordArray): void
+            create(hasher?: lib.Hasher, key?: string): HMAC
+            create(hasher?: lib.Hasher, key?: lib.WordArray): HMAC
+
+            update(messageUpdate: string): HMAC
+            update(messageUpdate: lib.WordArray): HMAC
+
+            finalize(messageUpdate?: string): lib.WordArray
+            finalize(messageUpdate?: lib.WordArray): lib.WordArray
+        }
+
+        interface EvpKDF extends lib.Base{
+            cfg: IEvpKDFCfg
+            init(cfg?: IEvpKDFCfg): void
+            create(cfg?: IEvpKDFCfg): EvpKDF
+            compute(password: string,         salt: string): lib.WordArray
+            compute(password: string,         salt: lib.WordArray): lib.WordArray
+            compute(password: lib.WordArray,  salt: string): lib.WordArray
+            compute(password: lib.WordArray,  salt: lib.WordArray): lib.WordArray
+        }
+        interface IEvpKDFCfg{
+            keySize?: number //default 128/32
+            hasher?: lib.Hasher //default MD5, or SHA1 with PBKDF2
+            iterations?: number //default 1
+        }
+        interface IEvpKDFHelper{
+            (password: string,         salt: string,        cfg?: IEvpKDFCfg): lib.WordArray
+            (password: string,         salt: lib.WordArray, cfg?: IEvpKDFCfg): lib.WordArray
+            (password: lib.WordArray,  salt: string,        cfg?: IEvpKDFCfg): lib.WordArray
+            (password: lib.WordArray,  salt: lib.WordArray, cfg?: IEvpKDFCfg): lib.WordArray
+        }
+
+        interface PBKDF2 extends EvpKDF{} //PBKDF2 is same as EvpKDF
+
+        interface RC4Drop extends RC4 { }
+    }
+
+    module mode{
+        interface ModeStatic{
+            CBC: mode.CBC
+            CFB: mode.CFB
+            CTR: mode.CTR
+            CTRGladman: mode.CTRGladman
+            ECB: mode.ECB
+            OFB: mode.OFB
+        }
+
+        interface IBlockCipherEncryptor extends lib.BlockCipherMode{
+            processBlock(words: number[], offset: number): void
+        }
+        interface IBlockCipherDecryptor extends lib.BlockCipherMode{ //exactly as IBlockCipherEncryptor
+            processBlock(words: number[], offset: number): void
+        }
+        interface IBlockCipherModeImpl extends lib.BlockCipherMode{
+            Encryptor: IBlockCipherEncryptor
+            Decryptor: IBlockCipherDecryptor
+        }
+
+        interface CBC extends IBlockCipherModeImpl{}
+        interface CFB extends IBlockCipherModeImpl{}
+        interface CTR extends IBlockCipherModeImpl{}
+        interface CTRGladman extends IBlockCipherModeImpl{}
+        interface ECB extends IBlockCipherModeImpl{}
+        interface OFB extends IBlockCipherModeImpl{}
+    }
+
+    module pad{
+        interface PadStatic{
+            Pkcs7: pad.Pkcs7
+            AnsiX923: pad.AnsiX923
+            Iso10126: pad.Iso10126
+            Iso97971: pad.Iso97971
+            ZeroPadding: pad.ZeroPadding
+            NoPadding: pad.NoPadding
+        }
+
+        interface IPaddingImpl{
+            pad(data: lib.WordArray, blockSize: number): void
+            unpad(data: lib.WordArray): void
+        }
+
+        interface Pkcs7 extends IPaddingImpl{}
+        interface AnsiX923 extends IPaddingImpl{}
+        interface Iso10126 extends IPaddingImpl{}
+        interface Iso97971 extends IPaddingImpl{}
+        interface ZeroPadding extends IPaddingImpl{}
+        interface NoPadding extends IPaddingImpl{}
+    }
+
+    module x64{
+        interface X64Static{
+            Word: x64.Word
+            WordArray: x64.WordArray
+        }
+
+        interface Word extends lib.Base{
+            high: number
+            low: number
+
+            init(high?: number, low?: number): void
+            create(high?: number, low?: number): Word
+        }
+
+        interface WordArray extends lib.Base{
+            words: Word[]
+            sigBytes: number
+
+            init(words?: Word[], sigBytes?: number): void
+            create(words?: Word[], sigBytes?: number): WordArray
+            toX32(): lib.WordArray
+            clone(): WordArray
+        }
+    }
+
+    interface CryptoJSStatic{
+        lib: lib.LibStatic
+        enc: enc.EncStatic
+        kdf: kdf.KdfStatic
+        format: format.FormatStatic
+        algo: algo.AlgoStatic
+        mode: mode.ModeStatic
+        pad: pad.PadStatic
+        x64: x64.X64Static
+
+        AES: CryptoJSLocal.lib.ICipherHelper<CryptoJSLocal.lib.IBlockCipherCfg>
+        DES: CryptoJSLocal.lib.ICipherHelper<CryptoJSLocal.lib.IBlockCipherCfg>
+        TripleDES: CryptoJSLocal.lib.ICipherHelper<CryptoJSLocal.lib.IBlockCipherCfg>
+
+        RabbitLegacy: CryptoJSLocal.lib.CipherHelper
+        Rabbit: CryptoJSLocal.lib.CipherHelper
+        RC4: CryptoJSLocal.lib.CipherHelper
+        RC4Drop: CryptoJSLocal.lib.ICipherHelper<Object>
+
+        MD5: CryptoJSLocal.lib.HasherHelper
+        HmacMD5: CryptoJSLocal.lib.IHasherHmacHelper
+        RIPEMD160: CryptoJSLocal.lib.HasherHelper
+        HmacRIPEMD160: CryptoJSLocal.lib.IHasherHmacHelper
+        SHA1: CryptoJSLocal.lib.HasherHelper
+        HmacSHA1: CryptoJSLocal.lib.IHasherHmacHelper
+        SHA256: CryptoJSLocal.lib.HasherHelper
+        HmacSHA256: CryptoJSLocal.lib.IHasherHmacHelper
+        SHA224: CryptoJSLocal.lib.HasherHelper
+        HmacSHA224: CryptoJSLocal.lib.IHasherHmacHelper
+        SHA512: CryptoJSLocal.lib.HasherHelper
+        HmacSHA512: CryptoJSLocal.lib.IHasherHmacHelper
+        SHA384: CryptoJSLocal.lib.HasherHelper
+        HmacSHA384: CryptoJSLocal.lib.IHasherHmacHelper
+
+        SHA3: CryptoJSLocal.lib.IHasherHelper<CryptoJSLocal.algo.ISHA3Cfg>
+        HmacSHA3: CryptoJSLocal.lib.IHasherHmacHelper
+
+        EvpKDF: CryptoJSLocal.algo.IEvpKDFHelper
+        PBKDF2: CryptoJSLocal.algo.IEvpKDFHelper //PBKDF2 is same as EvpKDF
+    }
+    type Hash = (message: string, key?: string, ...options: any[]) => string;
+
+    export interface Hashes {
+        MD5: Hash;
+        SHA1: Hash;
+        SHA256: Hash;
+        SHA224: Hash;
+        SHA512: Hash;
+        SHA384: Hash;
+        SHA3: Hash;
+        RIPEMD160: Hash;
+        HmacMD5: Hash;
+        HmacSHA1: Hash;
+        HmacSHA256: Hash;
+        HmacSHA224: Hash;
+        HmacSHA512: Hash;
+        HmacSHA384: Hash;
+        HmacSHA3: Hash;
+        HmacRIPEMD160: Hash;
+        PBKDF2: Hash;
+        AES: Hash;
+        TripleDES: Hash;
+        RC4: Hash;
+        Rabbit: Hash;
+        RabbitLegacy: Hash;
+        EvpKDF: Hash;
+        format: {
+            OpenSSL: Hash;
+            Hex: Hash;
+        };
+        enc: {
+            Latin1: Hash;
+            Utf8: Hash;
+            Hex: Hash;
+            Utf16: Hash;
+            Base64: Hash;
+        };
+        mode: {
+            CFB: Hash;
+            CTR: Hash;
+            CTRGladman: Hash;
+            OFB: Hash;
+            ECB: Hash;
+        };
+        pad: {
+            Pkcs7: Hash;
+            Ansix923: Hash;
+            Iso10126: Hash;
+            Iso97971: Hash;
+            ZeroPadding: Hash;
+            NoPadding: Hash;
+        };
+    }
+
+    export var hashes: Hashes;
 }
 
-declare module 'crypto-js' {
-	import hashes = CryptoJS.hashes;
-	export = hashes;
+declare var CryptoJS: CryptoJSLocal.CryptoJSStatic;
+
+declare module "crypto-js" {
+    export = CryptoJS;
 }

From ff75d43ec14eb0d457231790b36e68b347c54016 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Thu, 10 Dec 2015 11:04:01 +1100
Subject: [PATCH 002/278] Updated to include interceptor defintiions...

---
 axios/axios.d.ts | 289 ++++++++++++++++++++++++++---------------------
 1 file changed, 159 insertions(+), 130 deletions(-)

diff --git a/axios/axios.d.ts b/axios/axios.d.ts
index 48f57a73a3..86414bde6b 100644
--- a/axios/axios.d.ts
+++ b/axios/axios.d.ts
@@ -1,162 +1,191 @@
+
 // Type definitions for axios 0.5.2
 // Project: https://github.com/mzabriskie/axios
-// Definitions by: Marcel Buesing <https://github.com/marcelbuesing>
+// Definitions by: Marcel Buesing <https://github.com/marcelbuesing>, Jason Turner<https://github.com/brewsoftware>
 // Definitions: https://github.com/borisyankov/DefinitelyTyped
 
 /// <reference path="../es6-promise/es6-promise.d.ts"/>
 
 declare module Axios {
 
-  /**
-   * <T> - request body data type
-   */
-  interface AxiosXHRConfigBase<T> {
+    /**
+     * <T> - request body data type
+     */
+    interface AxiosXHRConfigBase<T> {
+
+        /**
+         * Change the request data before it is sent to the server.
+         * This is only applicable for request methods 'PUT', 'POST', and 'PATCH'
+         * The last function in the array must return a string or an ArrayBuffer
+         */
+        transformRequest?: (<U>(data: T) => U) | [<U>(data: T) => U];
+
+        /**
+         * change the response data to be made before it is passed to then/catch
+         */
+        transformResponse?: <U>(data: T) => U;
+
+        /**
+         * custom headers to be sent
+         */
+        headers?: Object;
+
+        /**
+         * URL parameters to be sent with the request
+         */
+        params?: Object;
+
+        /**
+         * indicates whether or not cross-site Access-Control requests
+         * should be made using credentials
+         */
+        withCredentials?: boolean;
+
+        /**
+         * indicates the type of data that the server will respond with
+         * options are 'arraybuffer', 'blob', 'document', 'json', 'text'
+         */
+        responseType?: string;
+
+        /**
+         * name of the cookie to use as a value for xsrf token
+         */
+        xsrfCookieName?: string;
+
+        /**
+         * name of the http header that carries the xsrf token value
+         */
+        xsrfHeaderName?: string;
+
+    }
 
     /**
-     * Change the request data before it is sent to the server.
-     * This is only applicable for request methods 'PUT', 'POST', and 'PATCH'
-     * The last function in the array must return a string or an ArrayBuffer
+     * <T> - request body data type
      */
-    transformRequest?: (<U>(data:T) => U)|[<U>(data:T) => U];
+    interface AxiosXHRConfig<T> extends AxiosXHRConfigBase<T> {
+        /**
+         * server URL that will be used for the request, options are:
+         * GET, PUT, POST, DELETE, CONNECT, HEAD, OPTIONS, TRACE, PATCH
+         */
+        url: string;
+
+        /**
+         * request method to be used when making the request
+         */
+        method?: string;
+
+        /**
+         * data to be sent as the request body
+         * Only applicable for request methods 'PUT', 'POST', and 'PATCH'
+         * When no `transformRequest` is set, must be a string, an ArrayBuffer or a hash
+         */
+        data?: T;
+    }
 
     /**
-     * change the response data to be made before it is passed to then/catch
+     * <T> - expected response type, 
+     * <U> - request body data type
      */
-    transformResponse?: <U>(data:T) => U;
+    interface AxiosXHR<T> {
+        /**
+         * Response that was provided by the server
+         */
+        data: T;
+
+        /**
+         * HTTP status code from the server response
+         */
+        status: number;
+
+        /**
+         * HTTP status message from the server response
+         */
+        statusText: string;
+
+        /**
+         * headers that the server responded with
+         */
+        headers: Object;
+
+        /**
+         * config that was provided to `axios` for the request
+         */
+        config: AxiosXHRConfig<T>;
+    }
 
     /**
-     * custom headers to be sent
+     * <T> - expected response type, 
+     * <U> - request body data type
      */
-    headers?: Object;
+    interface AxiosStatic {
 
-    /**
-     * URL parameters to be sent with the request
-     */
-    params?: Object;
+        <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
 
-    /**
-     * indicates whether or not cross-site Access-Control requests
-     * should be made using credentials
-     */
-    withCredentials?: boolean;
+        new <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
 
-    /**
-     * indicates the type of data that the server will respond with
-     * options are 'arraybuffer', 'blob', 'document', 'json', 'text'
-     */
-    responseType?: string;
-
-    /**
-     * name of the cookie to use as a value for xsrf token
-     */
-    xsrfCookieName?: string;
-
-    /**
-     * name of the http header that carries the xsrf token value
-     */
-    xsrfHeaderName?: string;
-
-  }
-
-  /**
-   * <T> - request body data type
-   */
-  interface AxiosXHRConfig<T> extends AxiosXHRConfigBase<T>  {
-      /**
-       * server URL that will be used for the request, options are:
-       * GET, PUT, POST, DELETE, CONNECT, HEAD, OPTIONS, TRACE, PATCH
-       */
-      url: string;
-
-      /**
-       * request method to be used when making the request
-       */
-      method?: string;
-
-      /**
-       * data to be sent as the request body
-       * Only applicable for request methods 'PUT', 'POST', and 'PATCH'
-       * When no `transformRequest` is set, must be a string, an ArrayBuffer or a hash
-       */
-      data?: T;
-  }
-
-  /**
-   * <T> - expected response type, 
-   * <U> - request body data type
-   */
-  interface AxiosXHR<T> {
-      /**
-       * Response that was provided by the server
-       */
-      data: T;
-
-      /**
-       * HTTP status code from the server response
-       */
-      status: number;
-
-      /**
-       * HTTP status message from the server response
-       */
-      statusText: string;
-
-      /**
-       * headers that the server responded with
-       */
-      headers: Object;
-
-      /**
-       * config that was provided to `axios` for the request
-       */
-      config: AxiosXHRConfig<T>;
-  }
-
-  /**
-   * <T> - expected response type, 
-   * <U> - request body data type
-   */
-  interface AxiosStatic {
-
-    <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
-
-    new <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
-
-    /**
-     * convenience alias, method = GET
-     */
-    get<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+        /**
+         * convenience alias, method = GET
+         */
+        get<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
 
-    /**
-     * convenience alias, method = DELETE
-     */
-    delete<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+        /**
+         * convenience alias, method = DELETE
+         */
+        delete<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-    /**
-     * convenience alias, method = HEAD
-     */
-    head<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+        /**
+         * convenience alias, method = HEAD
+         */
+        head<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-    /**
-     * convenience alias, method = POST
-     */
-    post<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+        /**
+         * convenience alias, method = POST
+         */
+        post<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-    /**
-     * convenience alias, method = PUT
-     */
-    put<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+        /**
+         * convenience alias, method = PUT
+         */
+        put<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-    /**
-     * convenience alias, method = PATCH
-     */
-    patch<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
-  }
+        /**
+         * convenience alias, method = PATCH
+         */
+        patch<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+        interceptors: {
+            request: Interceptor,
+            response: Interceptor
+        }
+    }
+
+
+
+    export interface Response {
+        data?: any;
+        status?: number;
+        statusText?: string;
+        headers?: any;
+        config?: any;
+    }
+    export interface success {
+        (response: Response): void
+    }
+    export interface error {
+        (response: Axios.Response): void;
+    }
+
+    export interface Interceptor {
+        use(success: success, error?: error): void;
+        eject(interceptor: Interceptor);
+    }
 }
 
 declare var axios: Axios.AxiosStatic;
 
 declare module "axios" {
-  export = axios;
+    export = axios;
 }
+
+
+

From 02941d70e88487358f99e3b5700baf5411dc17c3 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 14 Dec 2015 15:34:11 +1100
Subject: [PATCH 003/278] Added react bootstrap validation

---
 .../react-bootstrap-validation.d.ts           | 83 +++++++++++++++++++
 1 file changed, 83 insertions(+)
 create mode 100644 react-bootstrap-validation/react-bootstrap-validation.d.ts

diff --git a/react-bootstrap-validation/react-bootstrap-validation.d.ts b/react-bootstrap-validation/react-bootstrap-validation.d.ts
new file mode 100644
index 0000000000..9eeee01c1f
--- /dev/null
+++ b/react-bootstrap-validation/react-bootstrap-validation.d.ts
@@ -0,0 +1,83 @@
+///<reference path="../typings/react-bootstrap/react-bootstrap.d.ts"/>
+
+declare module  ReactBootstrapValidation{
+    
+    export interface Form {
+         model;
+         validateOne: any;
+         validateAll: any;
+         errorHelp: string | any;
+         validationEvent: string;
+         onValidSubmit: any;
+
+     }
+    export interface ValidatedInput 
+     {
+
+         name: string;
+         validationEvent: string;
+         validate: any;
+
+         type: any;
+         label: any;
+         errorHelp: any;
+     }
+
+    export interface Radio extends ValidatedInput {
+
+     }
+
+
+    export interface RadioGroup extends  ValidatedInput {
+         validationEvent: any;
+     }
+
+    export interface Validator {
+
+         required(val: String);
+         //Returns true if the value is not null.Can be used as an alias to !isNull validation rule.
+         isChecked(val: String);
+
+     }
+
+    export interface FileValidator extends Validator {
+         ref: any;
+         name: any;
+         type :any;
+         label:any;
+         multiple: any;
+         validate: any;
+
+         isEmpty(files: FileList);
+
+         /// Returns true if there are no files in file list.
+         isSingle(files: FileList);
+
+         // Returns true if files count equals to 1.
+         isMultiple(files: FileList);
+
+         //Returns true if files count is more than 1.
+         isFilesCount(files: FileList, min: Number, max:Array<Number> );
+
+         //Returns true if files count is within allowed range.If max is not supplied, checks if files count equals min.
+         isTotalSize(files: FileList, min: Number, max: Array<Number>);
+
+         //Returns true if total size of all files is within allowed range.
+         isEachFileSize(files: FileList, min: Number, max: Array<Number>);
+
+         //Returns true if each file's size is within allowed range.
+         isExtension(files: FileList, extensions: Array<any>);
+
+         //Returns true if each file's extension is in the extensions array.
+         isType(files: FileList, types: Array<any>);
+     }
+
+    export interface InputContainer {
+
+     }
+ }
+
+
+declare module 'react-bootstrap-validation' {
+    export = ReactBootstrapValidation;
+}
\ No newline at end of file

From 06336e28fcead25080b58e7c5aae073b78cfe3c1 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@brewsoftware.com.au>
Date: Sun, 20 Dec 2015 10:46:02 +1100
Subject: [PATCH 004/278] Revert "Merge branch 'master' of
 https://github.com/brewsoftware/DefinitelyTyped"

This reverts commit 0adfcd3dfd9860cef6b73762fa8c1eb5c4886dad, reversing
changes made to 40c60850ad6c8175a62d5ab48c4e016ea5b3dffe.
---
 axios/axios.d.ts                              | 289 ++++-----
 crypto-js/crypto-js.d.ts                      | 583 ++----------------
 .../react-bootstrap-validation.d.ts           |  83 ---
 3 files changed, 191 insertions(+), 764 deletions(-)
 delete mode 100644 react-bootstrap-validation/react-bootstrap-validation.d.ts

diff --git a/axios/axios.d.ts b/axios/axios.d.ts
index 86414bde6b..48f57a73a3 100644
--- a/axios/axios.d.ts
+++ b/axios/axios.d.ts
@@ -1,191 +1,162 @@
-
 // Type definitions for axios 0.5.2
 // Project: https://github.com/mzabriskie/axios
-// Definitions by: Marcel Buesing <https://github.com/marcelbuesing>, Jason Turner<https://github.com/brewsoftware>
+// Definitions by: Marcel Buesing <https://github.com/marcelbuesing>
 // Definitions: https://github.com/borisyankov/DefinitelyTyped
 
 /// <reference path="../es6-promise/es6-promise.d.ts"/>
 
 declare module Axios {
 
-    /**
-     * <T> - request body data type
-     */
-    interface AxiosXHRConfigBase<T> {
-
-        /**
-         * Change the request data before it is sent to the server.
-         * This is only applicable for request methods 'PUT', 'POST', and 'PATCH'
-         * The last function in the array must return a string or an ArrayBuffer
-         */
-        transformRequest?: (<U>(data: T) => U) | [<U>(data: T) => U];
-
-        /**
-         * change the response data to be made before it is passed to then/catch
-         */
-        transformResponse?: <U>(data: T) => U;
-
-        /**
-         * custom headers to be sent
-         */
-        headers?: Object;
-
-        /**
-         * URL parameters to be sent with the request
-         */
-        params?: Object;
-
-        /**
-         * indicates whether or not cross-site Access-Control requests
-         * should be made using credentials
-         */
-        withCredentials?: boolean;
-
-        /**
-         * indicates the type of data that the server will respond with
-         * options are 'arraybuffer', 'blob', 'document', 'json', 'text'
-         */
-        responseType?: string;
-
-        /**
-         * name of the cookie to use as a value for xsrf token
-         */
-        xsrfCookieName?: string;
-
-        /**
-         * name of the http header that carries the xsrf token value
-         */
-        xsrfHeaderName?: string;
-
-    }
+  /**
+   * <T> - request body data type
+   */
+  interface AxiosXHRConfigBase<T> {
 
     /**
-     * <T> - request body data type
+     * Change the request data before it is sent to the server.
+     * This is only applicable for request methods 'PUT', 'POST', and 'PATCH'
+     * The last function in the array must return a string or an ArrayBuffer
      */
-    interface AxiosXHRConfig<T> extends AxiosXHRConfigBase<T> {
-        /**
-         * server URL that will be used for the request, options are:
-         * GET, PUT, POST, DELETE, CONNECT, HEAD, OPTIONS, TRACE, PATCH
-         */
-        url: string;
-
-        /**
-         * request method to be used when making the request
-         */
-        method?: string;
-
-        /**
-         * data to be sent as the request body
-         * Only applicable for request methods 'PUT', 'POST', and 'PATCH'
-         * When no `transformRequest` is set, must be a string, an ArrayBuffer or a hash
-         */
-        data?: T;
-    }
+    transformRequest?: (<U>(data:T) => U)|[<U>(data:T) => U];
 
     /**
-     * <T> - expected response type, 
-     * <U> - request body data type
+     * change the response data to be made before it is passed to then/catch
      */
-    interface AxiosXHR<T> {
-        /**
-         * Response that was provided by the server
-         */
-        data: T;
-
-        /**
-         * HTTP status code from the server response
-         */
-        status: number;
-
-        /**
-         * HTTP status message from the server response
-         */
-        statusText: string;
-
-        /**
-         * headers that the server responded with
-         */
-        headers: Object;
-
-        /**
-         * config that was provided to `axios` for the request
-         */
-        config: AxiosXHRConfig<T>;
-    }
+    transformResponse?: <U>(data:T) => U;
 
     /**
-     * <T> - expected response type, 
-     * <U> - request body data type
+     * custom headers to be sent
      */
-    interface AxiosStatic {
+    headers?: Object;
 
-        <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
+    /**
+     * URL parameters to be sent with the request
+     */
+    params?: Object;
 
-        new <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
+    /**
+     * indicates whether or not cross-site Access-Control requests
+     * should be made using credentials
+     */
+    withCredentials?: boolean;
 
-        /**
-         * convenience alias, method = GET
-         */
-        get<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+    /**
+     * indicates the type of data that the server will respond with
+     * options are 'arraybuffer', 'blob', 'document', 'json', 'text'
+     */
+    responseType?: string;
+
+    /**
+     * name of the cookie to use as a value for xsrf token
+     */
+    xsrfCookieName?: string;
+
+    /**
+     * name of the http header that carries the xsrf token value
+     */
+    xsrfHeaderName?: string;
+
+  }
+
+  /**
+   * <T> - request body data type
+   */
+  interface AxiosXHRConfig<T> extends AxiosXHRConfigBase<T>  {
+      /**
+       * server URL that will be used for the request, options are:
+       * GET, PUT, POST, DELETE, CONNECT, HEAD, OPTIONS, TRACE, PATCH
+       */
+      url: string;
+
+      /**
+       * request method to be used when making the request
+       */
+      method?: string;
+
+      /**
+       * data to be sent as the request body
+       * Only applicable for request methods 'PUT', 'POST', and 'PATCH'
+       * When no `transformRequest` is set, must be a string, an ArrayBuffer or a hash
+       */
+      data?: T;
+  }
+
+  /**
+   * <T> - expected response type, 
+   * <U> - request body data type
+   */
+  interface AxiosXHR<T> {
+      /**
+       * Response that was provided by the server
+       */
+      data: T;
+
+      /**
+       * HTTP status code from the server response
+       */
+      status: number;
+
+      /**
+       * HTTP status message from the server response
+       */
+      statusText: string;
+
+      /**
+       * headers that the server responded with
+       */
+      headers: Object;
+
+      /**
+       * config that was provided to `axios` for the request
+       */
+      config: AxiosXHRConfig<T>;
+  }
+
+  /**
+   * <T> - expected response type, 
+   * <U> - request body data type
+   */
+  interface AxiosStatic {
+
+    <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
+
+    new <T>(config: AxiosXHRConfig<T>): Promise<AxiosXHR<T>>;
+
+    /**
+     * convenience alias, method = GET
+     */
+    get<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
 
-        /**
-         * convenience alias, method = DELETE
-         */
-        delete<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+    /**
+     * convenience alias, method = DELETE
+     */
+    delete<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-        /**
-         * convenience alias, method = HEAD
-         */
-        head<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+    /**
+     * convenience alias, method = HEAD
+     */
+    head<T>(url: string, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-        /**
-         * convenience alias, method = POST
-         */
-        post<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+    /**
+     * convenience alias, method = POST
+     */
+    post<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-        /**
-         * convenience alias, method = PUT
-         */
-        put<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+    /**
+     * convenience alias, method = PUT
+     */
+    put<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
 
-        /**
-         * convenience alias, method = PATCH
-         */
-        patch<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
-        interceptors: {
-            request: Interceptor,
-            response: Interceptor
-        }
-    }
-
-
-
-    export interface Response {
-        data?: any;
-        status?: number;
-        statusText?: string;
-        headers?: any;
-        config?: any;
-    }
-    export interface success {
-        (response: Response): void
-    }
-    export interface error {
-        (response: Axios.Response): void;
-    }
-
-    export interface Interceptor {
-        use(success: success, error?: error): void;
-        eject(interceptor: Interceptor);
-    }
+    /**
+     * convenience alias, method = PATCH
+     */
+    patch<T>(url: string, data?: any, config?: AxiosXHRConfigBase<T>): Promise<AxiosXHR<T>>;
+  }
 }
 
 declare var axios: Axios.AxiosStatic;
 
 declare module "axios" {
-    export = axios;
+  export = axios;
 }
-
-
-
diff --git a/crypto-js/crypto-js.d.ts b/crypto-js/crypto-js.d.ts
index cde0abd9b9..0f02514027 100644
--- a/crypto-js/crypto-js.d.ts
+++ b/crypto-js/crypto-js.d.ts
@@ -1,528 +1,67 @@
-// Type definitions for crypto-js v3.1.5
+// Type definitions for crypto-js v3.1.3
 // Project: https://github.com/evanvosberg/crypto-js
-// Definitions by: Michael Zabka <https://github.com/misak113/> , Jason Turner <https://github.com/brewsoftware/>
+// Definitions by: Michael Zabka <https://github.com/misak113/>
 // Definitions: https://github.com/borisyankov/DefinitelyTyped
 
-declare module CryptoJSLocal{
-    module lib{
-        interface Base{
-            extend(overrides: Object): Object
-            init(...args: any[]): void
-            //arguments of create() is same as init(). This is true for all subclasses
-            create(...args: any[]): Base
-            mixIn(properties: Object): void
-            clone(): Base
-        }
-
-        interface WordArray extends Base{
-            words: number[]
-            sigBytes: number
-            init(words?: number[], sigBytes?: number): void
-            create(words?: number[], sigBytes?: number): WordArray
-
-            init(typedArray: ArrayBuffer): void
-            init(typedArray: Int8Array): void
-
-            //Because TypeScript uses a structural type system then we don't need (& can't)
-            //declare oveload function init, create for the following type (same as Int8Array):
-            //then Uint8Array, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array
-            //Note also: Uint8ClampedArray is not defined in lib.d.ts & not supported in IE
-            //@see http://compatibility.shwups-cms.ch/en/home?&property=Uint8ClampedArray
-
-            create(typedArray: ArrayBuffer): WordArray
-            create(typedArray: Int8Array): WordArray
-
-            toString(encoder?: enc.IEncoder): string
-            concat(wordArray: WordArray): WordArray
-            clamp(): void
-            clone(): WordArray
-            random(nBytes: number): WordArray
-        }
-
-        interface BufferedBlockAlgorithm extends Base{
-            reset(): void
-            clone(): BufferedBlockAlgorithm
-        }
-
-        //tparam C - Configuration type
-        interface IHasher<C> extends BufferedBlockAlgorithm{
-            cfg: C
-            init(cfg?: C): void
-            create(cfg?: C): IHasher<C>
-
-            update(messageUpdate: string): Hasher
-            update(messageUpdate: WordArray): Hasher
-
-            finalize(messageUpdate?: string): WordArray
-            finalize(messageUpdate?: WordArray): WordArray
-
-            blockSize: number
-
-            _createHelper(hasher: Hasher): IHasherHelper<C>
-            _createHmacHelper(hasher: Hasher): IHasherHmacHelper
-
-            clone(): IHasher<C>
-        }
-        interface Hasher extends IHasher<Object>{}
-
-        //tparam C - Configuration type
-        interface IHasherHelper<C>{
-            (message: string, cfg?: C): WordArray
-            (message: WordArray, cfg?: C): WordArray
-        }
-        interface HasherHelper extends IHasherHelper<Object>{}
-
-        interface IHasherHmacHelper{
-            (message: string,     key: string): WordArray
-            (message: string,     key: WordArray): WordArray
-            (message: WordArray,  key: string): WordArray
-            (message: WordArray,  key: WordArray): WordArray
-        }
-
-        //tparam C - Configuration type
-        interface ICipher<C> extends BufferedBlockAlgorithm{
-            cfg: C
-            createEncryptor(key: WordArray, cfg?: C): ICipher<C>
-            createDecryptor(key: WordArray, cfg?: C): ICipher<C>
-
-            create(xformMode?: number, key?: WordArray, cfg?: C): ICipher<C>
-            init(xformMode?: number, key?: WordArray, cfg?: C): void
-
-            process(dataUpdate: string): WordArray
-            process(dataUpdate: WordArray): WordArray
-
-            finalize(dataUpdate?: string): WordArray
-            finalize(dataUpdate?: WordArray): WordArray
-
-            keySize: number
-            ivSize: number
-
-            _createHelper(cipher: Cipher): ICipherHelper<C>
-
-            clone(): ICipher<C>
-        }
-        interface Cipher extends ICipher<Object>{}
-
-        interface IStreamCipher<C> extends ICipher<C>{
-            drop?: number;
-
-            createEncryptor(key: WordArray, cfg?: C): IStreamCipher<C>
-            createDecryptor(key: WordArray, cfg?: C): IStreamCipher<C>
-
-            create(xformMode?: number, key?: WordArray, cfg?: C): IStreamCipher<C>
-
-            blockSize: number
-        }
-        interface StreamCipher extends IStreamCipher<Object>{}
-
-        interface BlockCipherMode extends Base{
-            createEncryptor(cipher: Cipher, iv: number[]): mode.IBlockCipherEncryptor
-            createDecryptor(cipher: Cipher, iv: number[]): mode.IBlockCipherDecryptor
-            init(cipher?: Cipher, iv?: number[]): void
-            create(cipher?: Cipher, iv?: number[]): BlockCipherMode
-        }
-
-        //BlockCipher has interface same as IStreamCipher
-        interface BlockCipher extends IStreamCipher<IBlockCipherCfg>{}
-
-        interface IBlockCipherCfg {
-            iv?: WordArray;
-            mode?: mode.IBlockCipherModeImpl //default CBC
-            padding?: pad.IPaddingImpl //default Pkcs7
-        }
-
-        interface CipherParamsData {
-            ciphertext?: lib.WordArray
-            key?: lib.WordArray
-            iv?: lib.WordArray
-            salt?: lib.WordArray
-            algorithm?: Cipher
-            mode?: mode.IBlockCipherModeImpl
-            padding?: pad.IPaddingImpl
-            blockSize?: number
-            formatter?: format.IFormatter
-        }
-
-        interface CipherParams extends Base, CipherParamsData{
-            init(cipherParams?: CipherParamsData): void
-            create(cipherParams?: CipherParamsData): CipherParams
-            toString(formatter?: format.IFormatter): string
-        }
-
-        //tparam C - Configuration type
-        interface ISerializableCipher<C extends ISerializableCipherCfg> extends Base{
-            cfg: C
-            encrypt(cipher: Cipher, message: WordArray, key: WordArray, cfg?: C): CipherParams
-            encrypt(cipher: Cipher, message: string,    key: WordArray, cfg?: C): CipherParams
-
-            decrypt(cipher: Cipher, ciphertext: CipherParamsData, key: WordArray, cfg?: C): WordArray
-            decrypt(cipher: Cipher, ciphertext: string,       key: WordArray, cfg?: C): WordArray
-        }
-
-        interface SerializableCipher extends ISerializableCipher<ISerializableCipherCfg>{}
-        interface ISerializableCipherCfg{
-            format?: format.IFormatter //default OpenSSLFormatter
-            iv?: WordArray;
-            mode?: mode.IBlockCipherModeImpl;
-            padding?: pad.IPaddingImpl;
-        }
-
-        interface IPasswordBasedCipher<C extends IPasswordBasedCipherCfg> extends Base{
-            cfg: C
-            encrypt(cipher: Cipher, message: WordArray, password: string, cfg?: C): CipherParams
-            encrypt(cipher: Cipher, message: string,    password: string, cfg?: C): CipherParams
-
-            decrypt(cipher: Cipher, ciphertext: CipherParamsData, password: string, cfg?: C): WordArray
-            decrypt(cipher: Cipher, ciphertext: string,       password: string, cfg?: C): WordArray
-        }
-
-        interface PasswordBasedCipher extends IPasswordBasedCipher<IPasswordBasedCipherCfg>{}
-        interface IPasswordBasedCipherCfg extends ISerializableCipherCfg{
-            kdf?: kdf.IKdfImpl //default OpenSSLKdf
-            mode?: mode.IBlockCipherModeImpl;
-            padding?: pad.IPaddingImpl;
-        }
-
-        /** see Cipher._createHelper */
-        interface ICipherHelper<C>{
-            encrypt(message: string,    password: string, cfg?: C): CipherParams
-            encrypt(message: string,    key: WordArray, cfg?: C): CipherParams
-            encrypt(message: WordArray, password: string, cfg?: C): CipherParams
-            encrypt(message: WordArray, key: WordArray, cfg?: C): CipherParams
-
-            decrypt(ciphertext: string,       password: string, cfg?: C): WordArray
-            decrypt(ciphertext: string,       key: WordArray, cfg?: C): WordArray
-            decrypt(ciphertext: CipherParamsData, password: string, cfg?: C): WordArray
-            decrypt(ciphertext: CipherParamsData, key: WordArray, cfg?: C): WordArray
-        }
-
-        interface CipherHelper extends ICipherHelper<Object>{}
-        interface LibStatic{
-            Base: lib.Base
-            WordArray: lib.WordArray
-            CipherParams: lib.CipherParams
-            SerializableCipher: lib.SerializableCipher
-            PasswordBasedCipher: lib.PasswordBasedCipher
-        }
-    }
-
-    module enc{
-        interface IEncoder{
-            stringify(wordArray: lib.WordArray): string
-        }
-        interface IDecoder{
-            parse(s: string): lib.WordArray
-        }
-        interface ICoder extends IEncoder, IDecoder {}
-
-        interface EncStatic{
-            Hex: ICoder
-            Latin1: ICoder
-            Utf8: ICoder
-            Base64: ICoder
-            Utf16: ICoder
-            Utf16BE: ICoder
-            Utf16LE: ICoder
-        }
-    }
-
-    module kdf{
-        interface KdfStatic{
-            OpenSSL: IKdfImpl
-        }
-
-        interface IKdfImpl{
-            execute(password: string, keySize: number, ivSize: number, salt?: string): lib.CipherParams
-            execute(password: string, keySize: number, ivSize: number, salt?: lib.WordArray): lib.CipherParams
-        }
-    }
-
-    module format{
-        interface FormatStatic{
-            OpenSSL: IFormatter
-            Hex: IFormatter
-        }
-
-        interface IFormatter{
-            stringify(cipherParams: lib.CipherParamsData): string
-            parse(s: string): lib.CipherParams
-        }
-    }
-
-    module algo{
-        interface AlgoStatic{
-            AES: algo.AES
-            DES: algo.DES
-            TripleDES: algo.TripleDES
-
-            RabbitLegacy: algo.RabbitLegacy
-            Rabbit: algo.Rabbit
-            RC4: algo.RC4
-
-            MD5: algo.MD5
-            RIPEMD160: algo.RIPEMD160
-            SHA1: algo.SHA1
-            SHA256: algo.SHA256
-            SHA224: algo.SHA224
-            SHA384: algo.SHA384
-            SHA512: algo.SHA512
-
-            SHA3: algo.SHA3
-
-            HMAC: algo.HMAC
-
-            EvpKDF: algo.EvpKDF
-            PBKDF2: algo.PBKDF2
-
-            RC4Drop: algo.RC4Drop
-        }
-
-        interface IBlockCipherImpl extends lib.BlockCipher{
-            encryptBlock(M: number[], offset: number): void
-            decryptBlock(M: number[], offset: number): void
-
-            createEncryptor(key: lib.WordArray, cfg?: lib.CipherParamsData): IBlockCipherImpl
-            createDecryptor(key: lib.WordArray, cfg?: lib.CipherParamsData): IBlockCipherImpl
-
-            create(xformMode?: number, key?: lib.WordArray, cfg?: lib.IBlockCipherCfg): IBlockCipherImpl
-        }
-
-        interface AES extends IBlockCipherImpl{}
-        interface DES extends IBlockCipherImpl{}
-        interface TripleDES extends IBlockCipherImpl{}
-
-        interface RabbitLegacy extends lib.StreamCipher{}
-        interface Rabbit extends lib.StreamCipher{}
-        interface RC4 extends lib.StreamCipher{}
-
-        interface MD5 extends lib.Hasher{}
-        interface RIPEMD160 extends lib.Hasher{}
-        interface SHA1 extends lib.Hasher{}
-        interface SHA256 extends lib.Hasher{}
-        interface SHA224 extends lib.Hasher{}
-        interface SHA384 extends lib.Hasher{}
-        interface SHA512 extends lib.Hasher{}
-
-        interface SHA3 extends lib.IHasher<ISHA3Cfg>{}
-        interface ISHA3Cfg{
-            outputLength?: number //default 512
-        }
-
-        interface HMAC extends lib.Base{
-            init(hasher?: lib.Hasher, key?: string): void
-            init(hasher?: lib.Hasher, key?: lib.WordArray): void
-            create(hasher?: lib.Hasher, key?: string): HMAC
-            create(hasher?: lib.Hasher, key?: lib.WordArray): HMAC
-
-            update(messageUpdate: string): HMAC
-            update(messageUpdate: lib.WordArray): HMAC
-
-            finalize(messageUpdate?: string): lib.WordArray
-            finalize(messageUpdate?: lib.WordArray): lib.WordArray
-        }
-
-        interface EvpKDF extends lib.Base{
-            cfg: IEvpKDFCfg
-            init(cfg?: IEvpKDFCfg): void
-            create(cfg?: IEvpKDFCfg): EvpKDF
-            compute(password: string,         salt: string): lib.WordArray
-            compute(password: string,         salt: lib.WordArray): lib.WordArray
-            compute(password: lib.WordArray,  salt: string): lib.WordArray
-            compute(password: lib.WordArray,  salt: lib.WordArray): lib.WordArray
-        }
-        interface IEvpKDFCfg{
-            keySize?: number //default 128/32
-            hasher?: lib.Hasher //default MD5, or SHA1 with PBKDF2
-            iterations?: number //default 1
-        }
-        interface IEvpKDFHelper{
-            (password: string,         salt: string,        cfg?: IEvpKDFCfg): lib.WordArray
-            (password: string,         salt: lib.WordArray, cfg?: IEvpKDFCfg): lib.WordArray
-            (password: lib.WordArray,  salt: string,        cfg?: IEvpKDFCfg): lib.WordArray
-            (password: lib.WordArray,  salt: lib.WordArray, cfg?: IEvpKDFCfg): lib.WordArray
-        }
-
-        interface PBKDF2 extends EvpKDF{} //PBKDF2 is same as EvpKDF
-
-        interface RC4Drop extends RC4 { }
-    }
-
-    module mode{
-        interface ModeStatic{
-            CBC: mode.CBC
-            CFB: mode.CFB
-            CTR: mode.CTR
-            CTRGladman: mode.CTRGladman
-            ECB: mode.ECB
-            OFB: mode.OFB
-        }
-
-        interface IBlockCipherEncryptor extends lib.BlockCipherMode{
-            processBlock(words: number[], offset: number): void
-        }
-        interface IBlockCipherDecryptor extends lib.BlockCipherMode{ //exactly as IBlockCipherEncryptor
-            processBlock(words: number[], offset: number): void
-        }
-        interface IBlockCipherModeImpl extends lib.BlockCipherMode{
-            Encryptor: IBlockCipherEncryptor
-            Decryptor: IBlockCipherDecryptor
-        }
-
-        interface CBC extends IBlockCipherModeImpl{}
-        interface CFB extends IBlockCipherModeImpl{}
-        interface CTR extends IBlockCipherModeImpl{}
-        interface CTRGladman extends IBlockCipherModeImpl{}
-        interface ECB extends IBlockCipherModeImpl{}
-        interface OFB extends IBlockCipherModeImpl{}
-    }
-
-    module pad{
-        interface PadStatic{
-            Pkcs7: pad.Pkcs7
-            AnsiX923: pad.AnsiX923
-            Iso10126: pad.Iso10126
-            Iso97971: pad.Iso97971
-            ZeroPadding: pad.ZeroPadding
-            NoPadding: pad.NoPadding
-        }
-
-        interface IPaddingImpl{
-            pad(data: lib.WordArray, blockSize: number): void
-            unpad(data: lib.WordArray): void
-        }
-
-        interface Pkcs7 extends IPaddingImpl{}
-        interface AnsiX923 extends IPaddingImpl{}
-        interface Iso10126 extends IPaddingImpl{}
-        interface Iso97971 extends IPaddingImpl{}
-        interface ZeroPadding extends IPaddingImpl{}
-        interface NoPadding extends IPaddingImpl{}
-    }
-
-    module x64{
-        interface X64Static{
-            Word: x64.Word
-            WordArray: x64.WordArray
-        }
-
-        interface Word extends lib.Base{
-            high: number
-            low: number
-
-            init(high?: number, low?: number): void
-            create(high?: number, low?: number): Word
-        }
-
-        interface WordArray extends lib.Base{
-            words: Word[]
-            sigBytes: number
-
-            init(words?: Word[], sigBytes?: number): void
-            create(words?: Word[], sigBytes?: number): WordArray
-            toX32(): lib.WordArray
-            clone(): WordArray
-        }
-    }
-
-    interface CryptoJSStatic{
-        lib: lib.LibStatic
-        enc: enc.EncStatic
-        kdf: kdf.KdfStatic
-        format: format.FormatStatic
-        algo: algo.AlgoStatic
-        mode: mode.ModeStatic
-        pad: pad.PadStatic
-        x64: x64.X64Static
-
-        AES: CryptoJSLocal.lib.ICipherHelper<CryptoJSLocal.lib.IBlockCipherCfg>
-        DES: CryptoJSLocal.lib.ICipherHelper<CryptoJSLocal.lib.IBlockCipherCfg>
-        TripleDES: CryptoJSLocal.lib.ICipherHelper<CryptoJSLocal.lib.IBlockCipherCfg>
-
-        RabbitLegacy: CryptoJSLocal.lib.CipherHelper
-        Rabbit: CryptoJSLocal.lib.CipherHelper
-        RC4: CryptoJSLocal.lib.CipherHelper
-        RC4Drop: CryptoJSLocal.lib.ICipherHelper<Object>
-
-        MD5: CryptoJSLocal.lib.HasherHelper
-        HmacMD5: CryptoJSLocal.lib.IHasherHmacHelper
-        RIPEMD160: CryptoJSLocal.lib.HasherHelper
-        HmacRIPEMD160: CryptoJSLocal.lib.IHasherHmacHelper
-        SHA1: CryptoJSLocal.lib.HasherHelper
-        HmacSHA1: CryptoJSLocal.lib.IHasherHmacHelper
-        SHA256: CryptoJSLocal.lib.HasherHelper
-        HmacSHA256: CryptoJSLocal.lib.IHasherHmacHelper
-        SHA224: CryptoJSLocal.lib.HasherHelper
-        HmacSHA224: CryptoJSLocal.lib.IHasherHmacHelper
-        SHA512: CryptoJSLocal.lib.HasherHelper
-        HmacSHA512: CryptoJSLocal.lib.IHasherHmacHelper
-        SHA384: CryptoJSLocal.lib.HasherHelper
-        HmacSHA384: CryptoJSLocal.lib.IHasherHmacHelper
-
-        SHA3: CryptoJSLocal.lib.IHasherHelper<CryptoJSLocal.algo.ISHA3Cfg>
-        HmacSHA3: CryptoJSLocal.lib.IHasherHmacHelper
-
-        EvpKDF: CryptoJSLocal.algo.IEvpKDFHelper
-        PBKDF2: CryptoJSLocal.algo.IEvpKDFHelper //PBKDF2 is same as EvpKDF
-    }
-    type Hash = (message: string, key?: string, ...options: any[]) => string;
-
-    export interface Hashes {
-        MD5: Hash;
-        SHA1: Hash;
-        SHA256: Hash;
-        SHA224: Hash;
-        SHA512: Hash;
-        SHA384: Hash;
-        SHA3: Hash;
-        RIPEMD160: Hash;
-        HmacMD5: Hash;
-        HmacSHA1: Hash;
-        HmacSHA256: Hash;
-        HmacSHA224: Hash;
-        HmacSHA512: Hash;
-        HmacSHA384: Hash;
-        HmacSHA3: Hash;
-        HmacRIPEMD160: Hash;
-        PBKDF2: Hash;
-        AES: Hash;
-        TripleDES: Hash;
-        RC4: Hash;
-        Rabbit: Hash;
-        RabbitLegacy: Hash;
-        EvpKDF: Hash;
-        format: {
-            OpenSSL: Hash;
-            Hex: Hash;
-        };
-        enc: {
-            Latin1: Hash;
-            Utf8: Hash;
-            Hex: Hash;
-            Utf16: Hash;
-            Base64: Hash;
-        };
-        mode: {
-            CFB: Hash;
-            CTR: Hash;
-            CTRGladman: Hash;
-            OFB: Hash;
-            ECB: Hash;
-        };
-        pad: {
-            Pkcs7: Hash;
-            Ansix923: Hash;
-            Iso10126: Hash;
-            Iso97971: Hash;
-            ZeroPadding: Hash;
-            NoPadding: Hash;
-        };
-    }
-
-    export var hashes: Hashes;
+declare module CryptoJS {
+	type Hash = (message: string, key?: string, ...options: any[]) => string;
+
+	export interface Hashes {
+		MD5: Hash;
+		SHA1: Hash;
+		SHA256: Hash;
+		SHA224: Hash;
+		SHA512: Hash;
+		SHA384: Hash;
+		SHA3: Hash;
+		RIPEMD160: Hash;
+		HmacMD5: Hash;
+		HmacSHA1: Hash;
+		HmacSHA256: Hash;
+		HmacSHA224: Hash;
+		HmacSHA512: Hash;
+		HmacSHA384: Hash;
+		HmacSHA3: Hash;
+		HmacRIPEMD160: Hash;
+		PBKDF2: Hash;
+		AES: Hash;
+		TripleDES: Hash;
+		RC4: Hash;
+		Rabbit: Hash;
+		RabbitLegacy: Hash;
+		EvpKDF: Hash;
+		format: {
+			OpenSSL: Hash;
+			Hex: Hash;
+		};
+		enc: {
+			Latin1: Hash;
+			Utf8: Hash;
+			Hex: Hash;
+			Utf16: Hash;
+			Base64: Hash;
+		};
+		mode: {
+			CFB: Hash;
+			CTR: Hash;
+			CTRGladman: Hash;
+			OFB: Hash;
+			ECB: Hash;
+		};
+		pad: {
+			Pkcs7: Hash;
+			Ansix923: Hash;
+			Iso10126: Hash;
+			Iso97971: Hash;
+			ZeroPadding: Hash;
+			NoPadding: Hash;
+		};
+	}
+
+	export var hashes: Hashes;
 }
 
-declare var CryptoJS: CryptoJSLocal.CryptoJSStatic;
-
-declare module "crypto-js" {
-    export = CryptoJS;
+declare module 'crypto-js' {
+	import hashes = CryptoJS.hashes;
+	export = hashes;
 }
diff --git a/react-bootstrap-validation/react-bootstrap-validation.d.ts b/react-bootstrap-validation/react-bootstrap-validation.d.ts
deleted file mode 100644
index 9eeee01c1f..0000000000
--- a/react-bootstrap-validation/react-bootstrap-validation.d.ts
+++ /dev/null
@@ -1,83 +0,0 @@
-///<reference path="../typings/react-bootstrap/react-bootstrap.d.ts"/>
-
-declare module  ReactBootstrapValidation{
-    
-    export interface Form {
-         model;
-         validateOne: any;
-         validateAll: any;
-         errorHelp: string | any;
-         validationEvent: string;
-         onValidSubmit: any;
-
-     }
-    export interface ValidatedInput 
-     {
-
-         name: string;
-         validationEvent: string;
-         validate: any;
-
-         type: any;
-         label: any;
-         errorHelp: any;
-     }
-
-    export interface Radio extends ValidatedInput {
-
-     }
-
-
-    export interface RadioGroup extends  ValidatedInput {
-         validationEvent: any;
-     }
-
-    export interface Validator {
-
-         required(val: String);
-         //Returns true if the value is not null.Can be used as an alias to !isNull validation rule.
-         isChecked(val: String);
-
-     }
-
-    export interface FileValidator extends Validator {
-         ref: any;
-         name: any;
-         type :any;
-         label:any;
-         multiple: any;
-         validate: any;
-
-         isEmpty(files: FileList);
-
-         /// Returns true if there are no files in file list.
-         isSingle(files: FileList);
-
-         // Returns true if files count equals to 1.
-         isMultiple(files: FileList);
-
-         //Returns true if files count is more than 1.
-         isFilesCount(files: FileList, min: Number, max:Array<Number> );
-
-         //Returns true if files count is within allowed range.If max is not supplied, checks if files count equals min.
-         isTotalSize(files: FileList, min: Number, max: Array<Number>);
-
-         //Returns true if total size of all files is within allowed range.
-         isEachFileSize(files: FileList, min: Number, max: Array<Number>);
-
-         //Returns true if each file's size is within allowed range.
-         isExtension(files: FileList, extensions: Array<any>);
-
-         //Returns true if each file's extension is in the extensions array.
-         isType(files: FileList, types: Array<any>);
-     }
-
-    export interface InputContainer {
-
-     }
- }
-
-
-declare module 'react-bootstrap-validation' {
-    export = ReactBootstrapValidation;
-}
\ No newline at end of file

From adaedc02189c2b4a6429637aef7ca8d88e66b063 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Tue, 22 Dec 2015 15:12:14 +1100
Subject: [PATCH 005/278] added re-validator

---
 revalidator/revalidator.d.ts | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 revalidator/revalidator.d.ts

diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
new file mode 100644
index 0000000000..aaf38ba78f
--- /dev/null
+++ b/revalidator/revalidator.d.ts
@@ -0,0 +1,16 @@
+// Type definitions for axios 0.5.2
+
+// Definitions by:  Jason Turner<https://github.com/brewsoftware>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
+
+declare module Revalidator {
+    interface RevalidatorStatic {
+        validate(object: any, schema: any, options: any): any;
+    }
+}
+
+declare var revalidator: Revalidator.RevalidatorStatic;
+
+declare module "revalidator" {
+    export = revalidator;
+}

From d5faebe532cac24ff670443999777f14c29587d7 Mon Sep 17 00:00:00 2001
From: Andrey <andrii.balokha@wkda.de>
Date: Wed, 3 Feb 2016 09:32:36 +0100
Subject: [PATCH 006/278] React slick definition type

---
 react-slick/react-slick-test.tsx | 31 ++++++++++++++++++++++
 react-slick/react-slick.d.ts     | 45 ++++++++++++++++++++++++++++++++
 2 files changed, 76 insertions(+)
 create mode 100644 react-slick/react-slick-test.tsx
 create mode 100644 react-slick/react-slick.d.ts

diff --git a/react-slick/react-slick-test.tsx b/react-slick/react-slick-test.tsx
new file mode 100644
index 0000000000..c351419401
--- /dev/null
+++ b/react-slick/react-slick-test.tsx
@@ -0,0 +1,31 @@
+/// <reference path="../react/react.d.ts" />
+/// <reference path="../react/react-dom.d.ts" />
+/// <reference path="./react-slick.d.ts" />
+
+import * as React from "react"
+import * as ReactDOM from "react-dom"
+import * as Slider from "react-slick"
+
+class SliderTest extends React.Component<React.Props<{}>, {}> {
+
+  render() {
+    let settings = {
+      speed: 500,
+      slidesToShow: 8,
+      slidesToScroll: 1,
+      draggable: false,
+      infinite: false
+    };
+
+    return (
+      <div>
+        <Slider {...settings} >
+          <div><h1>Slide1</h1></div>
+          <div><h1>Slide2</h1></div>
+        </Slider>
+      </div>
+    )
+  }
+}
+
+ReactDOM.render(<SliderTest />, document.body);
diff --git a/react-slick/react-slick.d.ts b/react-slick/react-slick.d.ts
new file mode 100644
index 0000000000..222089b537
--- /dev/null
+++ b/react-slick/react-slick.d.ts
@@ -0,0 +1,45 @@
+/// <reference path="../react/react-global.d.ts" />
+
+declare module 'react-slick' {
+  interface __config {
+    className?: string
+    adaptiveHeight?: boolean
+    arrows?: boolean
+    autoplay?: boolean
+    autoplaySpeed?: number // integer
+    centerMode?: boolean
+    centerPadding?: string | any
+    cssEase?: string | any
+    dots?: boolean
+    dotsClass?: string
+    draggable?: boolean
+    easing?: string
+    fade?: boolean
+    focusOnSelect?: boolean
+    infinite?: boolean //   should the gallery wrap around it's contents
+    initialSlide?: number // int
+    lazyLoad?: boolean
+    rtl?: boolean
+    slide?: string
+    slidesToShow?: number // int
+    slidesToScroll?: number //  int
+    speed?: number //int
+    swipe?: boolean
+    swipeToSlide?: boolean
+    touchMove?: boolean
+    touchThreshold?: number // int
+    variableWidth?: boolean
+    useCSS?: boolean
+    vertical?: boolean
+    afterChange?: (() => void)
+    beforeChange?: (() => void)
+    slickGoTo?: number // int
+  }
+
+  interface Slider extends __config {
+    responsive?: { breakpoint: number; settings: __config}[]
+  }
+
+  var Slider: __React.ClassicComponentClass<Slider>;
+  export = Slider;
+}

From 65ed470927fc807ffcfd29d726dfda6f4f79b549 Mon Sep 17 00:00:00 2001
From: Andrey <andrii.balokha@wkda.de>
Date: Wed, 3 Feb 2016 09:47:43 +0100
Subject: [PATCH 007/278] React slick definition type

---
 react-slick/react-slick.d.ts | 78 ++++++++++++++++++------------------
 1 file changed, 39 insertions(+), 39 deletions(-)

diff --git a/react-slick/react-slick.d.ts b/react-slick/react-slick.d.ts
index 222089b537..090037bc52 100644
--- a/react-slick/react-slick.d.ts
+++ b/react-slick/react-slick.d.ts
@@ -1,45 +1,45 @@
-/// <reference path="../react/react-global.d.ts" />
+/// <reference path="../react/react.d.ts"/>
 
-declare module 'react-slick' {
-  interface __config {
-    className?: string
-    adaptiveHeight?: boolean
-    arrows?: boolean
-    autoplay?: boolean
-    autoplaySpeed?: number // integer
-    centerMode?: boolean
-    centerPadding?: string | any
-    cssEase?: string | any
-    dots?: boolean
-    dotsClass?: string
-    draggable?: boolean
-    easing?: string
-    fade?: boolean
-    focusOnSelect?: boolean
-    infinite?: boolean //   should the gallery wrap around it's contents
-    initialSlide?: number // int
-    lazyLoad?: boolean
-    rtl?: boolean
-    slide?: string
-    slidesToShow?: number // int
-    slidesToScroll?: number //  int
-    speed?: number //int
-    swipe?: boolean
-    swipeToSlide?: boolean
-    touchMove?: boolean
-    touchThreshold?: number // int
-    variableWidth?: boolean
-    useCSS?: boolean
-    vertical?: boolean
-    afterChange?: (() => void)
-    beforeChange?: (() => void)
-    slickGoTo?: number // int
-  }
+interface __config {
+  className?: string
+  adaptiveHeight?: boolean
+  arrows?: boolean
+  autoplay?: boolean
+  autoplaySpeed?: number // integer
+  centerMode?: boolean
+  centerPadding?: string | any
+  cssEase?: string | any
+  dots?: boolean
+  dotsClass?: string
+  draggable?: boolean
+  easing?: string
+  fade?: boolean
+  focusOnSelect?: boolean
+  infinite?: boolean //   should the gallery wrap around it's contents
+  initialSlide?: number // int
+  lazyLoad?: boolean
+  rtl?: boolean
+  slide?: string
+  slidesToShow?: number // int
+  slidesToScroll?: number //  int
+  speed?: number //int
+  swipe?: boolean
+  swipeToSlide?: boolean
+  touchMove?: boolean
+  touchThreshold?: number // int
+  variableWidth?: boolean
+  useCSS?: boolean
+  vertical?: boolean
+  afterChange?: (() => void)
+  beforeChange?: (() => void)
+  slickGoTo?: number // int
+}
 
-  interface Slider extends __config {
-    responsive?: { breakpoint: number; settings: __config}[]
-  }
+interface Slider extends __config {
+  responsive?: { breakpoint: number; settings: __config}[]
+}
 
+declare module "react-slick" {
   var Slider: __React.ClassicComponentClass<Slider>;
   export = Slider;
 }

From 04faa1e002ed6996f20ebf9cb319d35f7f45de1e Mon Sep 17 00:00:00 2001
From: Andrey <andrii.balokha@wkda.de>
Date: Wed, 3 Feb 2016 10:01:59 +0100
Subject: [PATCH 008/278] React slick definition type

---
 react-slick/react-slick.d.ts | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/react-slick/react-slick.d.ts b/react-slick/react-slick.d.ts
index 090037bc52..2dfadcf133 100644
--- a/react-slick/react-slick.d.ts
+++ b/react-slick/react-slick.d.ts
@@ -1,3 +1,8 @@
+// Type definitions for [react-slick]
+// Project: [https://github.com/akiran/react-slick]
+// Definitions by: [Andrey Balokha] <[https://github.com/andrewBalekha]>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
 /// <reference path="../react/react.d.ts"/>
 
 interface __config {

From 85ae5b9531449b4c878ec30aaea122f6572d6784 Mon Sep 17 00:00:00 2001
From: Andrey <andrii.balokha@wkda.de>
Date: Wed, 3 Feb 2016 10:05:04 +0100
Subject: [PATCH 009/278] React slick definition type

---
 react-slick/react-slick.d.ts | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/react-slick/react-slick.d.ts b/react-slick/react-slick.d.ts
index 2dfadcf133..43c9cdcf69 100644
--- a/react-slick/react-slick.d.ts
+++ b/react-slick/react-slick.d.ts
@@ -1,6 +1,6 @@
-// Type definitions for [react-slick]
-// Project: [https://github.com/akiran/react-slick]
-// Definitions by: [Andrey Balokha] <[https://github.com/andrewBalekha]>
+// Type definitions for react-slick
+// Project: https://github.com/akiran/react-slick
+// Definitions by: Andrey Balokha <https://github.com/andrewBalekha>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 /// <reference path="../react/react.d.ts"/>

From 1ea67ceea476ea5b226130ced5f2cef247eedaab Mon Sep 17 00:00:00 2001
From: abraaoalves <abraao.teodosio@gmail.com>
Date: Tue, 1 Mar 2016 19:01:41 -0300
Subject: [PATCH 010/278] ad files

---
 .../jquery-truncate-html-tests.ts             |  5 +++++
 .../jquery-truncate-html.d.ts                 | 22 +++++++++++++++++++
 2 files changed, 27 insertions(+)
 create mode 100644 jquery-truncate-html/jquery-truncate-html-tests.ts
 create mode 100644 jquery-truncate-html/jquery-truncate-html.d.ts

diff --git a/jquery-truncate-html/jquery-truncate-html-tests.ts b/jquery-truncate-html/jquery-truncate-html-tests.ts
new file mode 100644
index 0000000000..fe043601b0
--- /dev/null
+++ b/jquery-truncate-html/jquery-truncate-html-tests.ts
@@ -0,0 +1,5 @@
+/// <reference path="./jquery-truncate-html.d.ts" />
+
+jQuery('<p>Stuff and <i>Nonsense</i></p>').truncate({
+  length: 13
+}).html();
diff --git a/jquery-truncate-html/jquery-truncate-html.d.ts b/jquery-truncate-html/jquery-truncate-html.d.ts
new file mode 100644
index 0000000000..d7f4abaa3b
--- /dev/null
+++ b/jquery-truncate-html/jquery-truncate-html.d.ts
@@ -0,0 +1,22 @@
+// Type definitions for jQuery-truncate-html.js 
+// Project: https://github.com/kbwood/timeentry
+// Definitions by: Abraão Alves <https://github.com/abraaoalves>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
+
+/// <reference path="../jquery/jquery.d.ts"/>
+
+interface ITruncateOptions{
+    length?: number;
+    stripTags?: boolean;
+    words?: boolean;
+    noBreaks?: boolean;
+    ellipsis?: string;
+}
+
+interface jQuery{
+    truncate(options: ITruncateOptions) : jQuery;
+}
+
+interface JQueryStatic {
+    truncate(html: string, options: ITruncateOptions) : string;
+}

From 13d212dfb3ef4672039019036bf2d08acbe728eb Mon Sep 17 00:00:00 2001
From: abraaoalves <abraao.teodosio@gmail.com>
Date: Tue, 1 Mar 2016 21:40:34 -0300
Subject: [PATCH 011/278] make tests

---
 .../jquery-truncate-html-tests.ts                 | 15 ++++++++++++---
 jquery-truncate-html/jquery-truncate-html.d.ts    |  4 ++--
 2 files changed, 14 insertions(+), 5 deletions(-)

diff --git a/jquery-truncate-html/jquery-truncate-html-tests.ts b/jquery-truncate-html/jquery-truncate-html-tests.ts
index fe043601b0..e20f9c22ee 100644
--- a/jquery-truncate-html/jquery-truncate-html-tests.ts
+++ b/jquery-truncate-html/jquery-truncate-html-tests.ts
@@ -1,5 +1,14 @@
 /// <reference path="./jquery-truncate-html.d.ts" />
 
-jQuery('<p>Stuff and <i>Nonsense</i></p>').truncate({
-  length: 13
-}).html();
+
+function truncateHtmlString(): string {
+    return $.truncate('<p>Stuff and <i>Nonsense</i></p>', {
+        length: 13
+    });
+}
+
+function truncateVirtualElement (): JQuery {
+    return $('<p>Stuff and <i>Nonsense</i></p>').truncate({
+        length: 13
+    });
+} 
diff --git a/jquery-truncate-html/jquery-truncate-html.d.ts b/jquery-truncate-html/jquery-truncate-html.d.ts
index d7f4abaa3b..3a22eaffdb 100644
--- a/jquery-truncate-html/jquery-truncate-html.d.ts
+++ b/jquery-truncate-html/jquery-truncate-html.d.ts
@@ -13,8 +13,8 @@ interface ITruncateOptions{
     ellipsis?: string;
 }
 
-interface jQuery{
-    truncate(options: ITruncateOptions) : jQuery;
+interface JQuery{
+    truncate(options: ITruncateOptions) : JQuery;
 }
 
 interface JQueryStatic {

From 41d21c491c0bb1eff11d98265e30a290d4410ce2 Mon Sep 17 00:00:00 2001
From: rgvassar <rgvassar@gmail.com>
Date: Wed, 2 Mar 2016 10:25:09 -0800
Subject: [PATCH 012/278] angular-animate

Added the on, off, and pin methods to the IAnimateService interface.
---
 angularjs/angular-animate.d.ts | 36 ++++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)

diff --git a/angularjs/angular-animate.d.ts b/angularjs/angular-animate.d.ts
index be83611e07..c29fd1857e 100644
--- a/angularjs/angular-animate.d.ts
+++ b/angularjs/angular-animate.d.ts
@@ -27,6 +27,42 @@ declare module angular.animate {
      * see http://docs.angularjs.org/api/ngAnimate/service/$animate
      */
     interface IAnimateService {
+        /**
+        * Sets up an event listener to fire whenever the animation event (enter, leave, move, etc...) has fired
+        * on the given element or among any of its children. Once the listener is fired, the provided callback
+        * is fired with the following params:
+        *
+        * @event the animation event that will be captured (e.g. enter, leave, move, addClass, removeClass, etc...)
+        * @container the container element that will capture each of the animation events that are fired on itself as well as among its children
+        * @callback the callback function that will be fired when the listener is triggered
+        *  The arguments present in the callback function are:
+        *      element - The captured DOM element that the animation was fired on.
+        *      phase - The phase of the animation. The two possible phases are start (when the animation starts) and close (when it ends).
+        */
+        on(event: string, container: JQuery, callback: (element?: JQuery, phase?: string) => any): void;
+
+        /**
+        * Deregisters an event listener based on the event which has been associated with the provided element.
+        * This method can be used in three different ways depending on the arguments.
+        *
+        * @event the animation event (e.g. enter, leave, move, addClass, removeClass, etc...)
+        * @container the container element the event listener was placed on.
+        * @callback the callback function that was registered as the listener
+        */
+        off(event: string, container?: JQuery, callback?: (element?: JQuery, phase?: string) => any): void;
+
+        /**
+        * Associates the provided element with a host parent element to allow the element to be animated even if
+        * it exists outside of the DOM structure of the Angular application. By doing so, any animation triggered
+        * via $animate can be issued on the element despite being outside the realm of the application or within
+        * another application. Say for example if the application was bootstrapped on an element that is somewhere
+        * inside of the <body> tag, but we wanted to allow for an element to be situated as a direct child of document.body,
+        * then this can be achieved by pinning the element via $animate.pin(element). Keep in mind that calling
+        * $animate.pin(element, parentElement) will not actually insert into the DOM anywhere; it will just create the association.
+        * Note that this feature is only active when the ngAnimate module is used.
+        */
+        pin(element: JQuery, parentElement: JQuery): void;
+
         /**
         * Globally enables / disables animations.
         *

From 4064f5b0d8945fc38b3568b5bb6a3b24d9e410fc Mon Sep 17 00:00:00 2001
From: AbraaoAlves <abraao.teodosio@gmail.com>
Date: Sat, 5 Mar 2016 11:26:59 -0300
Subject: [PATCH 013/278] Remove "I" prefix

---
 jquery-truncate-html/jquery-truncate-html.d.ts | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/jquery-truncate-html/jquery-truncate-html.d.ts b/jquery-truncate-html/jquery-truncate-html.d.ts
index 3a22eaffdb..e410716b0a 100644
--- a/jquery-truncate-html/jquery-truncate-html.d.ts
+++ b/jquery-truncate-html/jquery-truncate-html.d.ts
@@ -5,7 +5,7 @@
 
 /// <reference path="../jquery/jquery.d.ts"/>
 
-interface ITruncateOptions{
+interface TruncateOptions{
     length?: number;
     stripTags?: boolean;
     words?: boolean;
@@ -14,9 +14,9 @@ interface ITruncateOptions{
 }
 
 interface JQuery{
-    truncate(options: ITruncateOptions) : JQuery;
+    truncate(options: TruncateOptions) : JQuery;
 }
 
 interface JQueryStatic {
-    truncate(html: string, options: ITruncateOptions) : string;
+    truncate(html: string, options: TruncateOptions) : string;
 }

From b906a40b8e52d904daeb69d145de75e0084d5896 Mon Sep 17 00:00:00 2001
From: wagich <wagi_ch@gmx.net>
Date: Sat, 5 Mar 2016 17:25:14 +0100
Subject: [PATCH 014/278] corrects naming of `setGallerySize` member in
 FlickityOptions

---
 flickity/flickity.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/flickity/flickity.d.ts b/flickity/flickity.d.ts
index bf4541e5ff..febb09b525 100644
--- a/flickity/flickity.d.ts
+++ b/flickity/flickity.d.ts
@@ -269,7 +269,7 @@ interface FlickityOptions {
     *
     * default: true
     */
-    useSetGallerySize?: boolean;
+    setGallerySize?: boolean;
 
     /**
     * Adjusts sizes and positions when window is resized.

From 01c976de75d8564675ed4eba811be31cbf6d82ad Mon Sep 17 00:00:00 2001
From: Strato <francois-guillot@wanadoo.fr>
Date: Thu, 10 Mar 2016 11:56:31 +0100
Subject: [PATCH 015/278] Added some missing properties

'getSignalBars()' seems to always return null anyway...

Whole Windows.Data.Pdf namespace is still missing.

Lots of class of Windows.ApplicationModel.Contacts are missing as well.
---
 winrt/winrt.d.ts | 166 +++++++++++++++++++++++++----------------------
 1 file changed, 90 insertions(+), 76 deletions(-)

diff --git a/winrt/winrt.d.ts b/winrt/winrt.d.ts
index 687d7f83d4..5ce721b082 100644
--- a/winrt/winrt.d.ts
+++ b/winrt/winrt.d.ts
@@ -8201,6 +8201,7 @@ declare module Windows {
                 getDataPlanStatus(): Windows.Networking.Connectivity.DataPlanStatus;
                 getLocalUsage(StartTime: Date, EndTime: Date): Windows.Networking.Connectivity.DataUsage;
                 getLocalUsage(StartTime: Date, EndTime: Date, States: Windows.Networking.Connectivity.RoamingStates): Windows.Networking.Connectivity.DataUsage;
+                getSignalBars(): Windows.Foundation.IReference<number>;
             }
             export class ConnectionCost implements Windows.Networking.Connectivity.IConnectionCost {
                 approachingDataLimit: boolean;
@@ -8267,6 +8268,7 @@ declare module Windows {
                 getDataPlanStatus(): Windows.Networking.Connectivity.DataPlanStatus;
                 getLocalUsage(StartTime: Date, EndTime: Date): Windows.Networking.Connectivity.DataUsage;
                 getLocalUsage(StartTime: Date, EndTime: Date, States: Windows.Networking.Connectivity.RoamingStates): Windows.Networking.Connectivity.DataUsage;
+                getSignalBars(): Windows.Foundation.IReference<number>;
             }
             export class LanIdentifier implements Windows.Networking.Connectivity.ILanIdentifier {
                 infrastructureId: Windows.Networking.Connectivity.LanIdentifierData;
@@ -11340,15 +11342,18 @@ declare module Windows {
         }
         export interface ILauncherOptions {
             contentType: string;
+            desiredRemainingView: Windows.UI.ViewManagement.ViewSizePreference;
             displayApplicationPicker: boolean;
             fallbackUri: Windows.Foundation.Uri;
             preferredApplicationDisplayName: string;
             preferredApplicationPackageFamilyName: string;
             treatAsUntrusted: boolean;
-            uI: Windows.System.LauncherUIOptions;
+            UI: Windows.System.LauncherUIOptions;
+            
         }
         export class LauncherOptions implements Windows.System.ILauncherOptions {
             contentType: string;
+            desiredRemainingView: Windows.UI.ViewManagement.ViewSizePreference;
             displayApplicationPicker: boolean;
             fallbackUri: Windows.Foundation.Uri;
             preferredApplicationDisplayName: string;
@@ -11590,87 +11595,96 @@ declare module Windows {
 }
 declare module Windows {
     export module UI {
-        export module ViewManagement {
-            export enum ApplicationViewState {
-                fullScreenLandscape,
-                filled,
-                snapped,
-                fullScreenPortrait,
-            }
+	export module ViewManagement {
+		export enum ViewSizePreference {
+			default = 0,
+			useLess = 1,
+			useHalf = 2,
+			useMore = 3,
+			useMinimum = 4,
+			useNone = 5
+		}
+		
+		export enum ApplicationViewState {
+			fullScreenLandscape,
+			filled,
+			snapped,
+			fullScreenPortrait,
+            	}
+		
+		/**
+		 * Defines an instance of a window (app view) and the information that describes it.
+		**/
+            	export class ApplicationView {
+			/**
+			 * Gets the window (app view) for the current app.
+			**/
+                	static getForCurrentView(): ApplicationView;
 
 			/**
-			 * Defines an instance of a window (app view) and the information that describes it.
+			 * Attempts to unsnap a previously snapped app. This call will only succeed when the app is running in the foreground.
 			**/
-            export class ApplicationView {
-				/**
-				 * Gets the window (app view) for the current app.
-				**/
-                static getForCurrentView(): ApplicationView;
-
-				/**
-				 * Attempts to unsnap a previously snapped app. This call will only succeed when the app is running in the foreground.
-				**/
-                static tryUnsnap(): boolean;
-
-				/**
-				 * Gets the state of the current app view.
-				**/
-                static value: Windows.UI.ViewManagement.ApplicationViewState;
-
-				/**
-				 * Indicates whether the app terminates when the last window is closed.
-				**/
-                static terminateAppOnFinalViewClose: boolean;
-
-				/**
-				 * Gets the current orientation of the window (app view) with respect to the display.
-				**/
-                orientation: ApplicationViewOrientation;
-
-				/**
-				 * Gets or sets the displayed title of the window.
-				**/
-                title: string;
-
-				/**
-				 * Gets or sets whether screen capture is enabled for the window (app view).
-				**/
-                isScreenCaptureEnabled: boolean;
-
-				/**
-				 * Gets whether the window (app view) is on the Windows lock screen.
-				**/
-                isOnLockScreen: boolean;
-
-				/**
-				 * Gets whether the window(app view) is full screen or not.
-				**/
-                isFullScreen: boolean;
-
-				/**
-				 * Gets the current ID of the window (app view) .
-				**/
-                id: number;
-
-				/**
-				 * Gets whether the current window (app view) is adjacent to the right edge of the screen.
-				**/
-                adjacentToRightDisplayEdge: boolean;
-
-				/**
-				 * Gets whether the current window (app view) is adjacent to the left edge of the screen.
-				**/
-                adjacentToLeftDisplayEdge: number;
-
-                /**
-                 * Gets the title bar of the app.
-                **/
-                titleBar: ApplicationViewTitleBar;
-            }
+                	static tryUnsnap(): boolean;
 
 			/**
-			 * Defines the set of display orientation modes for a window (app view).
+			 * Gets the state of the current app view.
 			**/
+			static value: Windows.UI.ViewManagement.ApplicationViewState;
+			
+			/**
+			 * Indicates whether the app terminates when the last window is closed.
+			**/
+                	static terminateAppOnFinalViewClose: boolean;
+			
+			/**
+			 * Gets the current orientation of the window (app view) with respect to the display.
+			**/
+                	orientation: ApplicationViewOrientation;
+			
+			/**
+			 * Gets or sets the displayed title of the window.
+			**/
+                	title: string;
+			
+			/**
+			 * Gets or sets whether screen capture is enabled for the window (app view).
+			**/
+			isScreenCaptureEnabled: boolean;
+			
+			/**
+			 * Gets whether the window (app view) is on the Windows lock screen.
+			**/
+			isOnLockScreen: boolean;
+			
+			/**
+			 * Gets whether the window(app view) is full screen or not.
+			**/
+			isFullScreen: boolean;
+			
+			/**
+			 * Gets the current ID of the window (app view) .
+			**/
+			id: number;
+			
+			/**
+			 * Gets whether the current window (app view) is adjacent to the right edge of the screen.
+			**/
+			adjacentToRightDisplayEdge: boolean;
+			
+			/**
+			 * Gets whether the current window (app view) is adjacent to the left edge of the screen.
+			**/
+			adjacentToLeftDisplayEdge: number;
+			
+			/**
+			 * Gets the title bar of the app.
+			**/
+			titleBar: ApplicationViewTitleBar;
+		}
+
+		/**
+	 	 * Defines the set of display orientation modes for a window (app view).
+		**/
             export enum ApplicationViewOrientation {
                 landscape,
                 portrait

From 5597d81a2dfa7a555e8af3d5bfd57357e902b916 Mon Sep 17 00:00:00 2001
From: RVassar <rgvassar@gmail.com>
Date: Sat, 12 Mar 2016 20:21:20 -0800
Subject: [PATCH 016/278] Not sure what the changes are here. Different line
 endings or something.

---
 angular-load/angular-load.d.ts | 30 +++++++++++++++---------------
 1 file changed, 15 insertions(+), 15 deletions(-)

diff --git a/angular-load/angular-load.d.ts b/angular-load/angular-load.d.ts
index a35d1c59d8..65d5bc388a 100644
--- a/angular-load/angular-load.d.ts
+++ b/angular-load/angular-load.d.ts
@@ -1,15 +1,15 @@
-// Type definitions for angular-load v0.4.1
-// Project: https://github.com/urish/angular-load
-// Definitions by: david-gang <https://github.com/david-gang>
-// Definitions: https://github.com/borisyankov/DefinitelyTyped
-
-/// <reference path="../angularjs/angular.d.ts" />
-
-declare module angular.load {
-
-    interface IAngularLoadService {
-        loadScript(url:string): ng.IPromise<any>;
-        loadCss(url:string): ng.IPromise<any>;
-    }
-
-}
+// Type definitions for angular-load v0.4.1
+// Project: https://github.com/urish/angular-load
+// Definitions by: david-gang <https://github.com/david-gang>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
+
+/// <reference path="../angularjs/angular.d.ts" />
+
+declare module angular.load {
+
+    interface IAngularLoadService {
+        loadScript(url:string): ng.IPromise<any>;
+        loadCss(url:string): ng.IPromise<any>;
+    }
+
+}

From 74f4692670283fd9a547469557079da38bb10084 Mon Sep 17 00:00:00 2001
From: Strato <francois-guillot@wanadoo.fr>
Date: Mon, 14 Mar 2016 00:27:55 +0100
Subject: [PATCH 017/278] Fixed what seems to be the problem with travis

---
 winrt/winrt.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/winrt/winrt.d.ts b/winrt/winrt.d.ts
index 5ce721b082..3d25a6469f 100644
--- a/winrt/winrt.d.ts
+++ b/winrt/winrt.d.ts
@@ -11348,7 +11348,7 @@ declare module Windows {
             preferredApplicationDisplayName: string;
             preferredApplicationPackageFamilyName: string;
             treatAsUntrusted: boolean;
-            UI: Windows.System.LauncherUIOptions;
+            uI: Windows.System.LauncherUIOptions;
             
         }
         export class LauncherOptions implements Windows.System.ILauncherOptions {

From ff98d72f5ad685208b16dfa79cd063319fc1397e Mon Sep 17 00:00:00 2001
From: gael Magnan <gael.magnan@chauffeur-prive.com>
Date: Wed, 16 Mar 2016 13:58:12 +0100
Subject: [PATCH 018/278] Added new version of jwt-simple, now supports v 0.5.0

---
 jwt-simple/jwt-simple-0.2.0-tests.ts | 12 ++++++++++++
 jwt-simple/jwt-simple-0.2.0.d.ts     | 22 ++++++++++++++++++++++
 jwt-simple/jwt-simple.d.ts           | 10 ++++++----
 3 files changed, 40 insertions(+), 4 deletions(-)
 create mode 100644 jwt-simple/jwt-simple-0.2.0-tests.ts
 create mode 100644 jwt-simple/jwt-simple-0.2.0.d.ts

diff --git a/jwt-simple/jwt-simple-0.2.0-tests.ts b/jwt-simple/jwt-simple-0.2.0-tests.ts
new file mode 100644
index 0000000000..8a0cc59c52
--- /dev/null
+++ b/jwt-simple/jwt-simple-0.2.0-tests.ts
@@ -0,0 +1,12 @@
+/// <reference path='jwt-simple.d.ts' />
+
+import jwt = require('jwt-simple');
+var payload = { foo: 'bar' };
+var secret:string = 'xxx';
+
+// encode
+var token = jwt.encode(payload, secret);
+
+// decode
+var decoded = jwt.decode(token, secret);
+console.log(decoded); //=> { foo: 'bar' }
\ No newline at end of file
diff --git a/jwt-simple/jwt-simple-0.2.0.d.ts b/jwt-simple/jwt-simple-0.2.0.d.ts
new file mode 100644
index 0000000000..0ee3cc6799
--- /dev/null
+++ b/jwt-simple/jwt-simple-0.2.0.d.ts
@@ -0,0 +1,22 @@
+// Type definitions for jwt-simple v0.2.0
+// Project: https://github.com/hokaccha/node-jwt-simple
+// Definitions by: Ken Fukuyama <https://github.com/kenfdev>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
+declare module "jwt-simple" {
+  /**
+   * Decode jwt
+   * @param token
+   * @param key
+   * @param noVerify
+   * @api public
+   */
+  export function decode(token:any, key:string, noVerify?:boolean):any;
+  /**
+   * Encode jwt
+   * @param payload
+   * @param key
+   * @param algorithm default is HS256
+   * @api public
+   */
+  export function encode(payload:any, key:string, algorithm?:string):string;
+}
diff --git a/jwt-simple/jwt-simple.d.ts b/jwt-simple/jwt-simple.d.ts
index 0ee3cc6799..4640f25e33 100644
--- a/jwt-simple/jwt-simple.d.ts
+++ b/jwt-simple/jwt-simple.d.ts
@@ -1,6 +1,6 @@
-// Type definitions for jwt-simple v0.2.0
+// Type definitions for jwt-simple v0.5.0
 // Project: https://github.com/hokaccha/node-jwt-simple
-// Definitions by: Ken Fukuyama <https://github.com/kenfdev>
+// Definitions by: Gael Magnan <https://github.com/GaelMagnan>
 // Definitions: https://github.com/borisyankov/DefinitelyTyped
 declare module "jwt-simple" {
   /**
@@ -8,15 +8,17 @@ declare module "jwt-simple" {
    * @param token
    * @param key
    * @param noVerify
+   * @param algorithm default is HS256
    * @api public
    */
-  export function decode(token:any, key:string, noVerify?:boolean):any;
+  export function decode(token:any, key:string, noVerify?:boolean, algorithm?:string):any;
   /**
    * Encode jwt
    * @param payload
    * @param key
    * @param algorithm default is HS256
+   * @param options
    * @api public
    */
-  export function encode(payload:any, key:string, algorithm?:string):string;
+  export function encode(payload:any, key:string, algorithm?:string, options?:any):string;
 }

From 96ea748284dd67f821642362216c6d336d173207 Mon Sep 17 00:00:00 2001
From: Erik Krogh Kristensen <erik@webbies.dk>
Date: Fri, 18 Mar 2016 12:56:29 +0100
Subject: [PATCH 019/278] HammerJS: Creating an instance of Hammer returns an
 object, which is not a function. So calling "new" on it doesn't make sense.

---
 hammerjs/hammerjs.d.ts | 2 --
 1 file changed, 2 deletions(-)

diff --git a/hammerjs/hammerjs.d.ts b/hammerjs/hammerjs.d.ts
index e2d4a8c528..4125987d64 100644
--- a/hammerjs/hammerjs.d.ts
+++ b/hammerjs/hammerjs.d.ts
@@ -97,8 +97,6 @@ interface HammerOptions extends HammerDefaults
 
 interface HammerManager
 {
-  new( element:HTMLElement, options?:any ):HammerManager;
-
   add( recogniser:Recognizer ):Recognizer;
   add( recogniser:Recognizer ):HammerManager;
   add( recogniser:Recognizer[] ):Recognizer;

From 60ddc18a594f87b9c8d36860c3ff239836211ed6 Mon Sep 17 00:00:00 2001
From: Erik Krogh Kristensen <erik@webbies.dk>
Date: Fri, 18 Mar 2016 14:01:19 +0100
Subject: [PATCH 020/278] HammerJS: Added the HammerManagerConstructor
 interface, and used it where it should.

---
 hammerjs/hammerjs.d.ts | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/hammerjs/hammerjs.d.ts b/hammerjs/hammerjs.d.ts
index 4125987d64..d4ea189dd8 100644
--- a/hammerjs/hammerjs.d.ts
+++ b/hammerjs/hammerjs.d.ts
@@ -39,7 +39,7 @@ interface HammerStatic
   DIRECTION_VERTICAL:   number;
   DIRECTION_ALL:        number;
 
-  Manager:     HammerManager;
+  Manager:     HammerManagerConstructor;
   Input:       HammerInput;
   TouchAction: TouchAction;
 
@@ -95,6 +95,10 @@ interface HammerOptions extends HammerDefaults
 
 }
 
+interface HammerManagerConstructor {
+  new( element:HTMLElement, options?:any ):HammerManager;
+}
+
 interface HammerManager
 {
   add( recogniser:Recognizer ):Recognizer;

From 81f194ff4468b34b2795e89fcf2a4fe9ad570e0a Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Wed, 30 Mar 2016 18:04:01 +1100
Subject: [PATCH 021/278] Update comments to suite revalidator versions.

---
 revalidator/revalidator.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
index aaf38ba78f..b41e7cd03e 100644
--- a/revalidator/revalidator.d.ts
+++ b/revalidator/revalidator.d.ts
@@ -1,7 +1,7 @@
-// Type definitions for axios 0.5.2
+// Type definitions for revalidator 0.3.1
 
 // Definitions by:  Jason Turner<https://github.com/brewsoftware>
-// Definitions: https://github.com/borisyankov/DefinitelyTyped
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare module Revalidator {
     interface RevalidatorStatic {

From 6324ded3309992b0205fe585f73eaac38eb97b07 Mon Sep 17 00:00:00 2001
From: Gael Magnan de bornier <gaelmagnan@gmail.com>
Date: Fri, 1 Apr 2016 11:52:15 +0200
Subject: [PATCH 022/278] Update jwt-simple.d.ts

---
 jwt-simple/jwt-simple.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/jwt-simple/jwt-simple.d.ts b/jwt-simple/jwt-simple.d.ts
index 54e41c360e..ea78b13e88 100644
--- a/jwt-simple/jwt-simple.d.ts
+++ b/jwt-simple/jwt-simple.d.ts
@@ -1,6 +1,6 @@
 // Type definitions for jwt-simple v0.5.0
 // Project: https://github.com/hokaccha/node-jwt-simple
-// Definitions by: Gael Magnan <https://github.com/GaelMagnan>
+// Definitions by: Ken Fukuyama <https://github.com/kenfdev>, Gael Magnan <https://github.com/GaelMagnan>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 declare module "jwt-simple" {
   /**

From a9a77535de002706e1f1106391f1c3df15896dac Mon Sep 17 00:00:00 2001
From: CheCoxshall <che.coxshall@xerox.com>
Date: Fri, 1 Apr 2016 21:41:56 +0100
Subject: [PATCH 023/278] Added type definitions for bootstrap-fileinput

---
 bootstrap-fileinput/bootstrap-fileinput.d.ts | 1029 ++++++++++++++++++
 1 file changed, 1029 insertions(+)
 create mode 100644 bootstrap-fileinput/bootstrap-fileinput.d.ts

diff --git a/bootstrap-fileinput/bootstrap-fileinput.d.ts b/bootstrap-fileinput/bootstrap-fileinput.d.ts
new file mode 100644
index 0000000000..e517ae8d75
--- /dev/null
+++ b/bootstrap-fileinput/bootstrap-fileinput.d.ts
@@ -0,0 +1,1029 @@
+interface JQuery {
+    fileinput: (options?: FileInputOptions) => JQuery;
+}
+
+interface FileInputOptions {
+    /**
+    Language configuration for the plugin to enable the plugin to display messages for your locale (you must set the ISO code for the language).
+     You can have multiple language widgets on the same page.
+    The locale JS file for the language code must be defined as mentioned in the translations section: http://plugins.krajee.com/file-input#translations
+    */
+    language?: string;
+    /**
+    Whether to display the file caption.
+    Defaults to true.
+    */
+    showCaption?: boolean;
+    /**
+    Whether to display the file preview.
+    Defaults to true.
+    */
+    showPreview?: boolean;
+    /**
+    Whether to display the file remove/clear button.
+    Defaults to true.
+    */
+    showRemove?: boolean;
+    /**
+    Whether to display the file upload button.
+    Defaults to true.
+    This will default to a form submit button, unless the uploadUrl is specified.
+    */
+    showUpload?: boolean;
+    /**
+    Whether to display the file upload cancel button.
+    Defaults to true.
+    This will be only enabled and displayed when an AJAX upload is in process.
+    */
+    showCancel?: boolean;
+    /**
+    Whether to display the close icon in the preview.
+    Defaults to true.
+    This will be only parsed when showPreview is true or when you are using the {close} tag in your preview templates.
+    */
+    showClose?: boolean;
+    /**
+    Whether to persist display of the uploaded file thumbnails in the preview window (for ajax uploads) until the remove/clear button is pressed.
+    Defaults to true.
+    When set to false, a next batch of files selected for upload will clear these thumbnails from preview.
+    */
+    showUploadedThumbs?: boolean;
+    /**
+    Whether to automatically replace the files in the preview after the maxFileCount limit is reached and a new set of file(s) is/are selected.
+    This will only work if a valid maxFileCount is set.
+    Defaults to false.
+    */
+    autoReplace?: boolean;
+    /**
+    Any additional CSS class to append to the caption container.
+    */
+    captionClass?: string;
+    /**
+    Any additional CSS class to append to the preview container.
+    */
+    previewClass?: string;
+    /**
+    Any additional CSS class to append to the main plugin container.
+    */
+    mainClass?: string;
+    /**
+    The initial preview content to be displayed.
+    You can pass the minimal HTML markup for displaying your image, text, or file.
+    If set as a string, this will display a single file in the initial preview if there is no delimiter. You can set a delimiter (as defined in initialDelimiter) to show multiple files in initial preview.
+    If set as an array, it will display all files in the array as an initial preview (useful for multiple file upload scenarios).
+    The following CSS classes will need to be added for displaying each file type as per the plugin style theme:
+    image files: Include CSS class file-preview-image
+    text files: Include CSS class file-preview-text
+    other files: Include CSS class file-preview-other
+    */
+    initialPreview?: string | any[]; 
+    /**
+    the count of initial preview items that will be added to the count of files selected in preview. This is applicable when displaying the right caption, when overwriteInitial is set to false.
+    */
+    initialPreviewCount?: number;
+    /**
+    the delimiter to be used for splitting the initial preview content as individual file thumbnails (applicable only if initialPreview is passed as a string instead of array). Defaults to *$$*.
+    */
+    initialPreviewDelimiter?: string;
+    /**
+    the configuration for setting up important properties for each initialPreview item (that is setup as part of initialPreview).
+    */
+    initialPreviewConfig?: IFileUploadPreviewConfig[];
+    /**
+    whether the delete button will be displayed for each thumbnail that has been created with initialPreview.
+    */
+    initialPreviewShowDelete?: boolean;
+    /**
+    whether the file thumbnail should be removed from preview on error. Defaults to false.
+    */
+    removeFromPreviewOnError?: boolean;
+    /**
+    this will be a list of tags used in thumbnail templates that will be replaced dynamically within the thumbnail markup, when the thumbnail is rendered.
+    */
+    previewThumbTags?: { [key: string]: string; }
+    /**
+    this is an extension of previewThumbTags specifically for initial preview content - but will be configured as an array of objects corresponding to each initial preview thumbnail. The initial preview thumbnails set via initialPreview will read this configuration for replacing tags.
+    */
+    initialPreviewThumbTags?: { [key: string]: string; }
+    /**
+    the extra data that will be passed as data to the initial preview delete url/AJAX server call via POST.
+    This will be overridden by the initialPreviewConfig['extra'] property.
+    This property is only applicable for ajax deletions in initial preview and when you have set a value for initialPreviewConfig['url'] or deleteUrl.
+    This can be setup either as an object (associative array of keys and values) or as a function callback.
+    Note
+    The ajax delete action will send the following data to server via POST:
+        key: the key setting as setup in initialPreviewConfig['key']
+        any other extra data passed as key: value pairs either via initialPreviewConfig['extra'] OR deleteExtraData if former is not set.
+    */
+    deleteExtraData?: {} | { (): {} };
+    /**
+    the URL for deleting the image/content in the initial preview via AJAX post response. This will be overridden by the initialPreviewConfig['url'] property.
+    Note
+    The ajax delete action will send the following data to server via POST:
+        key: the key setting as setup in initialPreviewConfig['key']
+        any other extra data passed as key: value pairs either via initialPreviewConfig['extra'] OR deleteExtraData if former is not set.
+    */
+    deleteUrl?: string;
+    /**
+    the initial preview caption text to be displayed.
+    If you do not set a value here and initialPreview is set to true this will default to "{preview-file-count} files selected", where {preview-file-count} is the count of the files passed in initialPreview.
+    */
+    initialCaption?: string;
+    /**
+    whether you wish to overwrite the initial preview content and caption setup.
+    This defaults to true, whereby, any initialPreview content set will be overwritten, when new file is uploaded or when files are cleared.
+    Setting it to false will help displaying a saved image or file from database always - useful especially when using the multiple file upload feature.
+    */
+    overwriteInitial?: boolean;
+    /**
+    the templates configuration for rendering each part of the layout.
+    */
+    layoutTemplates?: IFileUploadLayoutTemplates;
+    /**
+    the templates configuration for rendering each preview file type.
+    */
+    previewTemplates?: IFileUploadPreviewTemplates;
+    /**
+    the list of allowed file types for upload.
+    This by default is set to null which means the plugin supports all file types for upload.
+    If an invalid file type is found, then a validation error message as set in msgInvalidFileType will be raised.
+    Note:
+    You need to be careful in case you are setting both allowedFileTypes and allowedFileExtensions. In this case, the allowedFileTypes property is validated first and generally precedes the allowedFileExtensions setting (and the latter validation maybe skipped).
+    */
+    allowedFileTypes?: ("image" | "html" | "text" | "video" | "audio" | "flash" | "object")[];
+    /**
+    the list of allowed file extensions for upload.
+    This by default is set to null which means the plugin supports all file extensions for upload.
+    If an invalid file extension is found, then a validation error message as set in msgInvalidFileExtension will be raised.
+    Note:
+    You need to be careful in case you are setting both allowedFileTypes and allowedFileExtensions. In this case, the allowedFileTypes property is validated first and generally precedes the allowedFileExtensions setting (and the latter validation maybe skipped).
+    */
+    allowedFileExtensions?: string[];
+    /**
+    the list of allowed preview types for your widget.
+    This by default supports all file types for preview.
+    The plugin by default treats each file as an object if it does not match any of the previous types.
+    To disable this behavior, you can remove object from the list of allowedPreviewTypes OR fine tune it through allowedPreviewMimeTypes.
+    To disable content preview for all file-types and show the previewIcon instead as a thumbnail, set this to null, empty, or false.
+    */
+    allowedPreviewTypes?: ("image" | "html" | "text" | "video" | "audio" | "flash" | "object")[];
+    /**
+    the list of allowed mime types for preview.
+    This is set to null by default which means all possible mime types are allowed.
+    This setting works in combination with allowedPreviewTypes to filter only the needed file types allowed for preview.
+    */
+    allowedPreviewMimeTypes?: string[];
+    /**
+    the default content / markup to show by default in the preview window whenever the files are cleared or the input is cleared.
+    This can be useful for use cases like showing the default user profile picture or profile image before upload to overwrite.
+    This is a bit different from initialPreview in the sense, that the initialPreview content will always be displayed unless it is deleted or overwritten based on overwriteInitial.
+    The defaultPreviewContent on the other hand will only be shown ONLY on initialization OR whenever you clear the preview.
+    At other times when files have been selected this will be overwritten temporarily until file(s) selected is/are cleared.
+    This property can be useful to display for example a default user profile picture (or saved picture) in the preview window unless the user selects a picture.
+    */
+    defaultPreviewContent?: string;
+    /**
+    the list of additional custom tags that will be replaced in the layout templates.
+    */
+    customLayoutTags?: {};
+    /**
+    the list of additional custom tags that will be replaced in the preview templates.
+    */
+    customPreviewTags?: {};
+    /**
+    the format settings (width and height) for rendering each preview file type.
+    */
+    previewSettings?: IFileUploadPreviewSettings;
+    /**
+    the settings to validate and identify each file type when a file is selected for upload.
+    This is a list of callbacks, which accepts the file mime type and file name as a parameter.
+    */
+    fileTypeSettings?: IFileUploadFileTypeSettings;
+    /**
+    the icon to be shown in each preview file thumbnail when an unreadable file type for preview is detected. Defaults to <i class="glyphicon glyphicon-file"></i> &nbsp;.
+    */
+    previewFileIcon?: string;
+    /**
+    the CSS class to be applied to the preview file icon container. Defaults to file-icon-4x.
+    */
+    previewFileIconClass?: string;
+    /**
+    the preview icon markup settings for each file extension (type).
+    You need to set this as key: value pairs, where the key corresponds to a file extension (e.g. doc, docx, xls etc.), and the value corresponds to the markup of the icon to be rendered.
+    If this is not set OR a file extension is not set here, the preview will default to previewFileIcon.
+    Note that displaying the icons instead of file content is controlled via allowedPreviewTypes and allowedPreviewMimeTypes
+    */
+    previewFileIconSettings?: IFileUploadPreviewFileIconSettings;
+    /**
+    the extensions to be auto derived for each file extension (type).
+    This is useful if you want to set the same icon for multiple file extension types.
+    You need to set this as `key: value` pairs, where the key corresponds to a file extension as set in previewFileIconSettings (e.g. doc, docx, xls etc.).
+    The value will be a function callback that accepts the following parameter:
+        ext: string, the file extension (without the . [dot]) of the file currently selected in the preview.
+    You can configure the callback to match the set of file extensions (via regex or similar) for each `key` and return a boolean output if the file extension matches.
+    */
+    previewFileExtSettings?: IFileUploadPreviewFileExtSettings;
+    /**
+    the CSS class for the each of the button labels for browse, remove, upload, and cancel.
+    Defaults to hidden-xs, which automatically hides the button labels for small screen devices and renders as smaller iconic buttons to fit to the screen.
+    */
+    buttonLabelClass?: string;
+    /**
+    the label to display for the file picker/browse button. Defaults to Browse ….
+    */
+    browseLabel?: string;
+    /**
+    the icon to display before the label for the file picker/browse button. Defaults to <i class="glyphicon glyphicon-folder-open"></i>&nbsp;.
+    */
+    browseIcon?: string;
+    /**
+    the CSS class for the file picker/browse button. Defaults to btn btn-primary.
+    */
+    browseClass?: string;
+    /**
+    the label to display for the file remove button. Defaults to Remove.
+    */
+    removeLabel?: string;
+    /**
+    the icon to display before the label for the file picker/remove button. Defaults to <i class="glyphicon glyphicon-trash"></i> &nbsp;.
+    */
+    removeIcon?: string;
+    /**
+    the CSS class for the file remove button. Defaults to btn btn-default.
+    */
+    removeClass?: string;
+    /**
+    the title to display on hover for the file remove button. Defaults to Clear selected files.
+    */
+    removeTitle?: string;
+    /**
+    the label to display for the file upload button. Defaults to Upload.
+    */
+    uploadLabel?: string;
+    /**
+    the icon to display before the label for the file upload button. Defaults to <i class="glyphicon glyphicon-upload"></i> &nbsp;.
+    */
+    uploadIcon?: string;
+    /**
+    the CSS class for the file upload button. Defaults to btn btn-default.
+    */
+    uploadClass?: string;
+    /**
+    the title to display on hover for the file remove button.
+    Defaults to Upload selected files.
+    */
+    uploadTitle?: string;
+    /**
+    the URL for the upload processing action (typically for ajax based processing).
+    Defaults to null.
+    If this is not set or null, then the upload button action will default to form submission.
+    NOTE:
+        This is MANDATORY if you want to use advanced features like drag & drop, append/remove files, selectively upload files via ajax etc.
+        The plugin automatically send $_FILES data to the server with the input `name` attribute as the key if provided.
+        If input name is not set, the key defaults to file-data.
+    */
+    uploadUrl?: string;
+    /**
+    whether the batch upload of multiple files will be asynchronous/in parallel.
+    Defaults to true.
+    */
+    uploadAsync?: boolean;
+    /**
+    the extra data that will be passed as data to the url/AJAX server call via POST.
+    This property is only applicable for ajax uploads and when you have set a value for uploadUrl.
+    This can be setup either as an object (associative array of keys and values) or as a function callback.
+    As an object, it can be set for example as:
+        { id: 100, value: '100 Details' }
+    Note that for uploading individual file via thumbnail, the function callback can also receive the thumbnail previewId and index as parameters. These are described below:
+        previewId: the identifier for the preview file container (only available when uploading each thumbnail file)
+        index: the zero-based sequential index of the loaded file in the preview list (only available when uploading each thumbnail file)
+    */
+    uploadExtraData?: {} | ((previewId?: string, index?: number) => {});
+    /**
+    the minimum allowed image height in px if you are uploading image files.
+    Defaults to null which means no limit on image height.
+    */
+    minImageHeight?: number;
+    /**
+    the maximum allowed image width in px if you are uploading image files.
+    Defaults to null which means no limit on image width.
+    Note that if you set resizeImage property to true, then the entire image will be resized within this width (depending on resizePreference).
+    */
+    maxImageWidth?: number;
+    /**
+    the maximum allowed image height in px if you are uploading image files.
+    Defaults to null which means no limit on image height.
+    Note that if you set resizeImage property to true, then the entire image will be resized within this height (depending on resizePreference).
+    */
+    maxImageHeight?: number;
+    /**
+    whether to add ability to resize uploaded images. Defaults to false.
+    Note that resizing images requires HTML5 canvas support which is supported on most modern browsers.
+    In addition, you must include the JavaScript-Canvas-to-Blob plugin by blueimp by including canvas-to-blob.js in your application.
+    This JS file must be loaded before fileinput.js on the page.
+    The JavaScript-Canvas-to-Blob source files are available in js/plugins folder of bootstrap-fileinput project page.
+    The canvas-to-blob.js plugin is a polyfill for canvas.toBlob method and is needed for allowing the resized image files via HTML5 canvas to be returned as a blob
+    */
+    resizeImage?: boolean;
+    /**
+    preference to resize the image based on width or height.
+    Defaults to width.
+    This property is parsed only when resizeImage is true.
+    If set to width, the maxImageWidth property is first tested and if image size is greater than this, then the image is resized to maxImageWidth.
+    The image height is resized and adjusted in the same ratio as width.
+    In case, the image width is already less than maxImageWidth then the maxImageHeight property is used to resize and width is adjusted in same ratio.
+    This will behave conversely, when resizePreference is set to height - the maxImageHeight will be first tested against image height and then the rest of steps will be similarly parsed with preference given to height instead of width as before.
+    */
+    resizePreference?: "width" | "height";
+    /**
+    the quality of the resized image. This must be a decimal number between 0.00 to 1.00.
+    Defaults to 0.92.
+    */
+    resizeImageQuality?: number;
+    /**
+    the default image mime type of the converted image after resize.
+    Defaults to image/jpeg.
+    */
+    resizeDefaultImageType?: string;
+    /**
+    the maximum file size for upload in KB.
+    If set to 0, it means size allowed is unlimited.
+    Defaults to 0.
+    */
+    maxFileSize?: number;
+    /**
+    the minimum number of files allowed for each multiple upload.
+    If set to 0, it means number of files are optional.
+    Defaults to 0.
+    */
+    minFileCount?: number;
+    /**
+    the maximum number of files allowed for each multiple upload.
+    If set to 0, it means number of files allowed is unlimited.
+    Defaults to 0.
+    */
+    maxFileCount?: number;
+    /**
+    whether to include initial preview file count (server uploaded files) in validating minFileCount and maxFileCount.
+    Defaults to false.
+    */
+    validateInitialCount?: boolean;
+    /**
+    the message that will be displayed when ZERO files are found.
+    Defaults to No.
+    */
+    msgNo?: string;
+    /**
+    the message that will be displayed within the progress bar when file upload is aborted or cancelled.
+    Defaults to Cancelled.
+    */
+    msgCancelled?: string;
+    /**
+    the title displayed (before the file name) on hover of the zoom button for zooming the file content in a modal window.
+    This is currently applicable only for text file previews.
+    Defaults to View details.
+    */
+    msgZoomTitle?: string;
+    /**
+    the heading of the modal dialog that displays the zoomed file content.
+    This is currently applicable only for text file previews.
+    Defaults to Detailed Preview.
+    */
+    msgZoomModalHeading?: string;
+    /**
+    the message to be displayed when the file size exceeds maximum size.
+    Defaults to:
+        File "{name}" ({size} KB) exceeds maximum allowed upload size of {maxSize} KB. Please retry your upload!
+    where:
+        {name}: will be replaced by the file name being uploaded
+        {size}: will be replaced by the uploaded file size
+        {maxSize}: will be replaced by the maxFileSize parameter.
+    */
+    msgSizeTooLarge?: string;
+    /**
+    message to be displayed when the file count is less than the minimum count as set in minFileCount.
+    Defaults to:
+        You must select at least {n} {files} to upload. Please retry your upload!
+    where:
+        {n}: will be replaced by the allowed minimum files as set in minFileCount.
+        {files}: will be replaced with fileSingle or filePlural properties in locale file depending on the minFileCount.
+    */
+    msgFilesTooLess?: string;
+    /**
+    the message to be displayed when the file count exceeds maximum count as set in maxFileCount.
+    Defaults to:
+        Number of files selected for upload ({n}) exceeds maximum allowed limit of {m}. Please retry your upload!
+    where:
+        {n}: will be replaced by number of files selected for upload
+        {m}: will be replaced by the allowed maximum files as set in maxFileCount
+    */
+    msgFilesTooMany?: string;
+    /**
+    the exception message to be displayed when the file selected is not found by the FileReader.
+    Defaults to:
+        File "{name}" not found!
+    where:
+        {name}: will be replaced by the file name being uploaded
+    */
+    msgFileNotFound?: string;
+    /**
+    the exception message to be displayed when the file selected is not allowed to be accessed due to a security exception.
+    Defaults to:
+        Security restrictions prevent reading the file "{name}".
+    where:
+        {name}: will be replaced by the file name being uploaded
+    */
+    msgFileSecured?: string;
+    /**
+    the exception message to be displayed when the file selected is not readable by the FileReader API.
+    Defaults to:
+        File "{name}" is not readable.
+    where:
+        {name}: will be replaced by the file name being uploaded
+    */
+    msgFileNotReadable?: string;
+    /**
+    the exception message to be displayed when the file preview upload is aborted.
+    Defaults to:
+        File preview aborted for "{name}".
+    where:
+        {name}: will be replaced by the file name being uploaded
+    */
+    msgFilePreviewAborted?: string;
+    /**
+    the exception message to be displayed for any other error when previewing the file.
+    Defaults to:
+        An error occurred while reading the file "{name}".
+    where:
+        {name}: will be replaced by the file name being uploaded
+    */
+    msgFilePreviewError?: string;
+    /**
+    the message to be displayed when the file type is not in one of the file types set in allowedFileTypes.
+    Defaults to:
+        Invalid type for file "{name}". Only "{types}" files are supported.
+    where:
+        {name}: will be replaced by the file name being uploaded
+        {types}: will be replaced by the comma separated list of types defined in allowedFileTypes.
+    */
+    msgInvalidFileType?: string;
+    /**
+    the message to be displayed when the file type is not in one of the file extensions set in allowedFileExtensions.
+    Defaults to:
+        Invalid extension for file "{name}". Only "{extensions}" files are supported.
+    where:
+        {name}: will be replaced by the file name being uploaded
+        {extensions}: will be replaced by the comma separated list of extensions defined in allowedFileExtensions.
+    */
+    msgInvalidFileExtension?: string;
+    /**
+    the message to be displayed when an ongoing ajax file upload is aborted by pressing the Cancel button.
+    Defaults to The file upload was aborted.
+    If this is set to null or empty, the internal ajax error message will be displayed - Defaults to File Upload Error.
+    */
+    msgUploadAborted?: string;
+    /**
+    the exception message to be displayed within the caption container (instead of msgFilesSelected), when a validation error is encountered.
+    Defaults to File Upload Error.
+    */
+    msgValidationError?: string;
+    /**
+    the css class for the validation error message displayed in the caption container.
+    Defaults to text-danger.
+    */
+    msgValidationErrorClass?: string;
+    /**
+    the icon to be displayed before the validation error in the caption container.
+    Defaults to <i class="glyphicon glyphicon-exclamation-sign"></i>
+    */
+    msgValidationErrorIcon?: string;
+    /**
+    the css class for the error message to be displayed in the preview window when the file size exceeds maxSize.
+    Defaults to file-error-message.
+    */
+    msgErrorClass?: string;
+    /**
+    the message displayed when the files are getting read and loaded for preview.
+    Defaults to
+        Loading file {index} of {files} …
+    The following special variables will be replaced:
+        {index}: the sequence number of the current file being loaded.
+        {files}: the total number of files selected for upload.
+    */
+    msgLoading?: string;
+    /**
+    the progress message displayed as each file is loaded for preview.
+    Defaults to:
+        Loading file {index} of {files} - {name} - {percent}% completed.
+    The following variables will be replaced:
+        {index}: the sequence number of the current file being loaded.
+        {files}: the total number of files selected for upload.
+        {percent}: the percentage of file read and loaded.
+        {name}: the name of the current file being loaded.
+    */
+    msgProgress?: string;
+    /**
+    the progress message displayed in caption window when multiple (more than one) files are selected.
+    Defaults to:
+        {n} files selected.
+    The following variables will be replaced:
+        {n}: the number of files selected.
+    */
+    msgSelected?: string;
+    /**
+    the message displayed when a folder has been dragged to the drop zone.
+    Defaults to:
+        Drag & drop files only! {n} folder(s) dropped were skipped.
+    The following variables will be replaced:
+        {n}: the number of folders dropped.
+    */
+    msgFoldersNotAllowed?: string;
+    /**
+    the exception message to be displayed when the file selected for preview is an image and its width is less than the minImageWidth setting.
+    Defaults to:
+        Width of image file "{name}" must be at least {size} px.
+    where:
+        {name}: will be replaced by the file name being uploaded.
+        {size}: will be replaced by the minImageWidth setting.
+    */
+    msgImageWidthSmall?: string;
+    /**
+    the exception message to be displayed when the file selected for preview is an image and its height is less than the minImageHeight setting.
+    Defaults to:
+        Height of image file "{name}" must be at least {size} px.
+    where:
+        {name}: will be replaced by the file name being uploaded.
+        {size}: will be replaced by the minImageHeight setting.
+    */
+    msgImageHeightSmall?: string;
+    /**
+    the exception message to be displayed when the file selected for preview is an image and its width exceeds the maxImageWidth setting.
+    Defaults to:
+        Width of image file "{name}" cannot exceed {size} px.
+    where:
+        {name}: will be replaced by the file name being uploaded.
+        {size}: will be replaced by the maxImageWidth setting.
+    */
+    msgImageWidthLarge?: string;
+    /**
+    the exception message to be displayed when the file selected for preview is an image and its height exceeds the maxImageHeight setting.
+    Defaults to:
+        Height of image file "{name}" cannot exceed {size} px.
+    where:
+        {name}: will be replaced by the file name being uploaded.
+        {size}: will be replaced by the maxImageHeight setting.
+    */
+    msgImageHeightLarge?: string;
+    /**
+    the upload progress bar CSS class to be applied when AJAX upload is in process (applicable only for ajax uploads).
+    Defaults to progress-bar progress-bar-success progress-bar-striped active.
+    */
+    progressClass?: string;
+    /**
+    the upload progress bar CSS class to be applied when AJAX upload is in process (applicable only for ajax uploads).
+    Defaults to progress-bar progress-bar-success progress-bar-striped active.
+    */
+    progressCompleteClass?: string;
+    /**
+    the upload progress bar CSS class to be applied when AJAX upload is cancelled or aborted.
+    Defaults to progress-bar progress-bar-danger.
+    */
+    progressErrorClass?: string;
+    /**
+    the type of files that are to be displayed in the preview window.
+    Defaults to image.
+    Can be one of the following:
+        image: Only image type files will be shown in preview.
+        text: Only text type files will be shown in preview.
+        any: Both image and text files content will be shown in preview.
+    Files other than image or text will be displayed as a thumbnail with the filename in the preview window.
+    */
+    previewFileType?: "image" | "text" | "any";
+    /**
+    the icon for zooming the file content in a new modal dialog.
+    This is currently applicable only for text file previews.
+    Defaults to <i class="glyphicon glyphicon-zoom-in"></i>
+    */
+    zoomIndicator?: string;
+    /**
+    the identifier for the container element displaying the error (e.g. '#id').
+    If not set, will default to the container with CSS class kv-fileinput-error inside the preview container (identified by elPreviewContainer).
+    The msgErrorClass will be automatically appended to this container before displaying the error.
+    */
+    elErrorContainer?: string;
+    /**
+    the identifier for the container element containing the caption (e.g. '#id').
+    If not set, will default to the container with CSS class file-caption inside the main plugin container.
+    */
+    elCaptionContainer?: string;
+    /**
+    the identifier for the container element containing the caption text (e.g. '#id').
+    If not set, will default to the container with CSS class file-caption-name inside the main plugin container.
+    */
+    elCaptionText?: string;
+    /**
+    the identifier for the container element containing the preview (e.g. '#id').
+    If not set, will default to the container with CSS class file-preview inside the main plugin container.
+    */
+    elPreviewContainer?: string;
+    /**
+    the identifier for the element containing the preview image thumbnails (e.g. '#id').
+    If not set, will default to the container with CSS class file-preview-thumbnails inside the main plugin container.
+    */
+    elPreviewImage?: string;
+    /**
+    the identifier for the element containing the preview progress status (e.g. '#id').
+    If not set, will default to the container with CSS class file-preview-status inside the main plugin container.
+    */
+    elPreviewStatus?: string;
+    /**
+    a callback to convert the filename as a slug string eliminating special characters.
+    If not set, it will use the plugin's own internal slugDefault method.
+    This callback function includes the filename as parameter and must return a converted filename string.
+    */
+    slugCallback?: (filename: string) => string;
+    /**
+    whether to enable a drag and drop zone for dragging and dropping files to.
+    This is available only for ajax based uploads.
+    Defaults to true.
+    */
+    dropZoneEnabled?: boolean;
+    /**
+    title to be displayed in the drag and drop zone.
+    This is available only for ajax based uploads.
+    Defaults to:
+        Drag & drop files here ….
+    */
+    dropZoneTitle?: string;
+    /**
+    CSS class for the drag & drop zone title.
+    Defaults to file-drop-zone-title.
+    */
+    dropZoneTitleClass?: string;
+    /**
+    configuration for setting up file actions for newly selected file thumbnails in the preview window.
+    */
+    fileActionsettings?: IFileUploadFileActionSettings;
+    /**
+    markup for additional action buttons to display within the initial preview thumbnails (for example displaying an image edit button).
+    The following tag can be used in the markup and will be automatically replaced:
+        {dataKey}: Will be replaced with the key set within initialPreviewConfig.
+    */
+    otherActionButtons?: string;
+    /**
+    the encoding to be used while reading a text file.
+    Applicable only for previewing text files.
+    Defaults to UTF-8.
+    */
+    textEncoding?: string;
+    /**
+    additional ajax settings to pass to the plugin before submitting the ajax request for upload.
+    Applicable only for ajax uploads.
+    This can be useful to pass additional tokens to headers or one can use it for setting other ajax options for advanced cases.
+    Refer the jQuery ajax documentation for the various settings you can configure.
+    */
+    ajaxSettings?: JQueryAjaxSettings;
+    /**
+    additional ajax settings to pass to the plugin before submitting the delete ajax request in each initial preview thumbnail.
+    Applicable only for ajax uploads.
+    This can be useful to pass additional tokens to headers or one can use it for setting other ajax options for advanced cases.
+    Refer the jQuery ajax documentation for the various settings you can configure.
+    */
+    ajaxDeleteSettings?: JQueryAjaxSettings;
+    /**
+    whether to show details of the error stack from the server log when an error is encountered via ajax response.
+    Defaults to true.
+    */
+    showAjaxErrorDetails?: boolean;
+}
+
+interface IFileUploadPreviewConfig {
+    /**
+    the caption or filename to display for each initial preview item content.
+    */
+    caption: string;
+    /**
+    the CSS width of the image/ content displayed.
+    */
+    width: string;
+    /**
+     the URL for deleting the image/ content in the initial preview via AJAX post response.This will default to deleteUrl if not set.
+    */
+    url: string;
+    /**
+    the key that will be passed as data to the url via AJAX POST.
+    */
+    key: string | {};
+    /**
+    the additional frame css class to set for the file's thumbnail frame.
+    */
+    frameClass: string;
+    /**
+    the HTML attribute settings (set as key:value pairs) for the thumbnail frame.
+    */
+    frameAttr: {}; 
+    /**
+    the extra data that will be passed as data to the initial preview delete url / AJAX server call via POST.This will default to deleteExtraData if not set.
+    */
+    extra: {} | Function; 
+}
+
+interface IFileUploadLayoutTemplates {
+    /**
+    the template for rendering the widget with caption.
+    The following tags will be parsed and replaced automatically:
+        {class}: the CSS class as set in the mainClass property.
+        {close}: will be replaced with the close (cross) icon (by default on top right of the preview window). The layout template to control this markup is layoutTemplates.close.
+        {preview}: the content parsed by the previewTemplate and will be displayed only if showPreview is true.
+        {caption}: the content parsed by the captionTemplate and will be displayed only if showCaption is true.
+        {remove}: the file remove/clear button and will be displayed only if showRemove is true.
+        {upload}: the file upload button and will be displayed only if showUpload is true.
+        {cancel}: the file upload cancel button that will be displayed when AJAX upload is in process to abort the AJAX upload.
+        {browse}: the main file browse button to select your files for input.
+    */
+    main1?: string;
+    /**
+    the template for rendering the widget without caption.
+    The following tags will be parsed and replaced automatically:
+        {class}: the CSS class as set in the mainClass property.
+        {close}: will be replaced with the close (cross) icon (by default on top right of the preview window). The layout template to control this markup is layoutTemplates.close.
+        {preview}: the content parsed by the previewTemplate and will be displayed only if showPreview is true.
+        {caption}: the content parsed by the captionTemplate and will be displayed only if showCaption is true.
+        {remove}: the file remove/clear button and will be displayed only if showRemove is true.
+        {upload}: the file upload button and will be displayed only if showUpload is true.
+        {cancel}: the file upload cancel button that will be displayed when AJAX upload is in process to abort the AJAX upload.
+        {browse}: the main file browse button to select your files for input.
+    */
+    main2?: string;
+    /**
+    the template for rendering the preview.
+    The following tags will be parsed and replaced automatically:
+        {class}: the CSS class as set in the previewClass property.
+    */
+    preview?: string;
+    /**
+    the icon to render before the caption text.
+    */
+    icon?: string;
+    /**
+    the template for rendering the caption.
+    The following tags will be parsed and replaced automatically:
+        {class}: the CSS class as set in the captionClass property.
+    */
+    caption?: string;
+    /**
+    the template for rendering the modal (for text file preview zooming).
+    */
+    modal?: string;
+    /**
+    the template for the progress bar when upload is in progress (for batch/mass uploads and within each preview thumbnail for async/single uploads).
+    The upload progress bar when displayed within each thumbnail will be wrapped inside a container having a CSS class of `file-thumb-progress`.
+    The following tags will be parsed and replaced automatically:
+        {percent}: will be replaced with the upload progress percentage.
+    */
+    progress?: string;
+    /**
+    the template for the footer section of each file preview thumbnail.
+    The following tags will be parsed and replaced automatically:
+        {actions}: will be replaced with the output of the actions template.
+        {class}: the CSS class as set in the progressClass or progressCompleteClass property (depending on the progress percentage).
+    */
+    footer?: string;
+    /**
+    the template for the file action buttons to be displayed within the thumbnail footer.
+    The following tags will be parsed and replaced automatically:
+        {upload}: will be replaced with the output of the actionUpload template.
+        {delete}: will be replaced with the output of the actionDelete template.
+    */
+    actions?: string;
+    /**
+     the template for the file delete action button within the thumbnail footer.
+    The following tags will be parsed and replaced automatically:
+        {removeClass}: the css class for the remove button. Will be replaced with the removeClass set within fileActionSettings.
+        {removeIcon}: the icon for the remove button. Will be replaced with the removeIcon set within fileActionSettings.
+        {removeTitle}: the title to display on hover for the remove button. Will be replaced with the removeTitle set within fileActionSettings.
+        {dataUrl}: the URL for deleting the file thumbnail for initialPreview content only. Will be replaced with the url set within initialPreviewConfig.
+        {dataKey}: the key (additional data) that will be passed to the URL above via POST to the AJAX call. Will be replaced with the key set within initialPreviewConfig.
+    */
+    actionDelete?: string;
+    /**
+    the template for the file upload action button within the thumbnail footer.
+    The following tags will be parsed and replaced automatically:
+        {uploadClass}: the css class for the upload button. Will be replaced with the uploadClass set within fileActionSettings.
+        {uploadIcon}: the icon for the upload button. Will be replaced with the uploadIcon set within fileActionSettings.
+        {uploadTitle}: the title to display on hover for the upload button. Will be replaced with the uploadTitle set within fileActionSettings.
+    */
+    actionUpload?: string;
+    /**
+    The template for upload, remove, and cancel buttons.
+    The following tags will be parsed and replaced automatically:
+        {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
+        {title}: the title to display on button hover.
+        {css}: the CSS class for the button. This is derived from settings for uploadClass or removeClass or cancelClass.
+        {status}: the disabled status for the button if available (else will be blank).
+        {icon}: the button icon as identified by uploadIcon or removeIcon or cancelIcon.
+        {label}: the button label as identified by uploadLabel or removeLabel or cancelLabel.
+    */
+    btnDefault?: string;
+    /**
+    The template for upload button when used with ajax (i.e. when uploadUrl is set).
+    The following tags will be parsed and replaced automatically:
+        {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
+        {title}: the title to display on button hover.
+        {css}: the CSS class for the button. This is derived from settings for uploadClass.
+        {status}: the disabled status for the button if available (else will be blank).
+        {icon}: the button icon as identified by uploadIcon.
+        {label}: the button label as identified by uploadLabel.
+        {href}: applicable only for Upload button for ajax uploads and will be replaced with the uploadUrl property.
+    */
+    btnLink?: string;
+    /**
+    The template for the browse button.
+        {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
+        {title}: the title to display on button hover.
+        {css}: the CSS class for the button. This is derived from settings for browseClass.
+        {status}: the disabled status for the button if available (else will be blank).
+        {icon}: the button icon as identified by browseIcon.
+        {label}: the button label as identified by browseLabel.
+    */
+    btnBrowse?: string;
+}
+
+interface IFileUploadPreviewTemplates {
+    /**
+    the preview template for image files.
+    The following tags will be parsed and replaced automatically:
+        {previewId}: will be replaced with the generated identifier for the preview frame container.
+        {data}: will be replaced with the data source for each preview type.
+        {width}: will be replaced with the width for the file type as set in previewSettings.
+        {height}: will be replaced with the height for the file type as set in previewSettings.
+        {caption}: will be replaced with the file name.
+        {type}: will be replaced with the file type.
+    */
+    image?: string;
+    /**
+    the preview template for text files.
+    The following tags will be parsed and replaced automatically:
+        {previewId}: will be replaced with the generated identifier for the preview frame container.
+        {data}: will be replaced with the data source for each preview type.
+        {width}: will be replaced with the width for the file type as set in previewSettings.
+        {height}: will be replaced with the height for the file type as set in previewSettings.
+        {caption}: will be replaced with the file name.
+        {type}: will be replaced with the file type.
+        {dialog}: Will be replaced with the JS code to launch the modal dialog.
+        {zoomTitle}: This will be replaced with the msgZoomTitle property. This is the title that is displayed on hover of the zoom button (which on clicking will display the text file).
+        {zoomInd}: This will be replaced with the zoomIndicator property. This is the title that is displayed on hover of the zoom button (which on clicking will display the text file).
+        {heading}: This represents the modal dialog heading title. This will be replaced with the msgZoomModalHeading property.
+    */
+    text?: string;
+    /**
+    the preview template for html files.
+    The following tags will be parsed and replaced automatically:
+        {previewId}: will be replaced with the generated identifier for the preview frame container.
+        {data}: will be replaced with the data source for each preview type.
+        {width}: will be replaced with the width for the file type as set in previewSettings.
+        {height}: will be replaced with the height for the file type as set in previewSettings.
+        {caption}: will be replaced with the file name.
+        {type}: will be replaced with the file type.
+    */
+    html?: string;
+    /**
+    the preview template for video files (supported by HTML 5 video tag).
+    The following tags will be parsed and replaced automatically:
+        {previewId}: will be replaced with the generated identifier for the preview frame container.
+        {data}: will be replaced with the data source for each preview type.
+        {width}: will be replaced with the width for the file type as set in previewSettings.
+        {height}: will be replaced with the height for the file type as set in previewSettings.
+        {caption}: will be replaced with the file name.
+        {type}: will be replaced with the file type.
+    */
+    video?: string;
+    /**
+    the preview template for audio files (supported by HTML 5 audio tag).
+    The following tags will be parsed and replaced automatically:
+        {previewId}: will be replaced with the generated identifier for the preview frame container.
+        {data}: will be replaced with the data source for each preview type.
+        {width}: will be replaced with the width for the file type as set in previewSettings.
+        {height}: will be replaced with the height for the file type as set in previewSettings.
+        {caption}: will be replaced with the file name.
+        {type}: will be replaced with the file type.
+    */
+    audio?: string;
+    /**
+    the preview template for flash files (supported currently on webkit browsers).
+    The following tags will be parsed and replaced automatically:
+        {previewId}: will be replaced with the generated identifier for the preview frame container.
+        {data}: will be replaced with the data source for each preview type.
+        {width}: will be replaced with the width for the file type as set in previewSettings.
+        {height}: will be replaced with the height for the file type as set in previewSettings.
+        {caption}: will be replaced with the file name.
+        {type}: will be replaced with the file type.
+    */
+    flash?: string;
+    /**
+    the preview template for all other files - by default treated as object. To disable this behavior, configure the allowedPreviewTypes property.
+    The following tags will be parsed and replaced automatically:
+        {previewId}: will be replaced with the generated identifier for the preview frame container.
+        {data}: will be replaced with the data source for each preview type.
+        {width}: will be replaced with the width for the file type as set in previewSettings.
+        {height}: will be replaced with the height for the file type as set in previewSettings.
+        {caption}: will be replaced with the file name.
+        {type}: will be replaced with the file type.
+    */
+    object?: string;
+    /**
+    this template is used ONLY for rendering the initialPreview markup content passed directly as a raw format.
+    The following tags will be parsed and replaced automatically:
+        {content}: will be replaced with the raw HTML markup as set in initialPreview..
+    */
+    generic?: string;
+}
+
+interface IFileUploadPreviewSettings {
+    image?: { width?: string; height?: string; };
+    html?: { width?: string; height?: string; };
+    text?: { width?: string; height?: string; };
+    video?: { width?: string; height?: string; };
+    audio?: { width?: string; height?: string; };
+    flash?: { width?: string; height?: string; };
+    object?: { width?: string; height?: string; };
+    other?: { width?: string; height?: string; };
+}
+
+interface IFileUploadFileTypeSettings {
+    image: (vType: string, vName: string) => boolean;
+    html: (vType: string, vName: string) => boolean;
+    text: (vType: string, vName: string) => boolean;
+    video: (vType: string, vName: string) => boolean;
+    audio: (vType: string, vName: string) => boolean;
+    flash: (vType: string, vName: string) => boolean;
+    object: (vType: string, vName: string) => boolean;
+    other: (vType: string, vName: string) => boolean;
+}
+
+interface IFileUploadPreviewFileIconSettings {
+    [key: string]: string;
+}
+
+interface IFileUploadPreviewFileExtSettings {
+    [key: string]: (ext: string) => boolean;
+}
+
+interface IFileUploadFileActionSettings {
+    /**
+    icon for remove button to be displayed in each file thumbnail.
+    */
+    removeIcon: string;
+    /**
+    CSS class for the remove button in each file thumbnail.
+    */
+    removeClass: string;
+    /**
+    title for remove button in each file thumbnail.
+    */
+    removeTitle: string;
+    /**
+    icon for upload button to be displayed in each file thumbnail.
+    */
+    uploadIcon: string;
+    /**
+    CSS class for the remove button in each file thumbnail.
+    */
+    uploadClass: string;
+    /**
+    title for remove button in each file thumbnail.
+    */
+    uploadTitle: string;
+    /**
+    an indicator (HTML markup) for new pending upload displayed in each file thumbnail.
+    */
+    indicatorNew: string;
+    /**
+    an indicator (HTML markup) for successful upload displayed in each file thumbnail.
+    */
+    indicatorSuccess: string;
+    /**
+    an indicator (HTML markup) for error in upload displayed in each file thumbnail.
+    */
+    indicatorError: string;
+    /**
+    an indicator (HTML markup) for ongoing upload displayed in each file thumbnail.
+    */
+    indicatorLoading: string;
+    /**
+    title to display on hover of indicator for new pending upload in each file thumbnail.
+    */
+    indicatorNewTitle: string;
+    /**
+    title to display on hover of indicator for successful in each file thumbnail.
+    */
+    indicatorSuccessTitle: string;
+    /**
+    title to display on hover of indicator for error in upload in each file thumbnail.
+    */
+    indicatorErrorTitle: string;
+    /**
+    title to display on hover of indicator for ongoing upload in each file thumbnail.
+    */
+    indicatorLoadingTitle: string;
+}
\ No newline at end of file

From 325de0ff3bdd5dcad22f77a563ebbe533283478e Mon Sep 17 00:00:00 2001
From: CheCoxshall <che.coxshall@xerox.com>
Date: Fri, 1 Apr 2016 22:27:19 +0100
Subject: [PATCH 024/278] Fixed header and Namespacing

Also improved interface names.
---
 bootstrap-fileinput/bootstrap-fileinput.d.ts | 2044 +++++++++---------
 1 file changed, 1026 insertions(+), 1018 deletions(-)

diff --git a/bootstrap-fileinput/bootstrap-fileinput.d.ts b/bootstrap-fileinput/bootstrap-fileinput.d.ts
index e517ae8d75..e9d6f0e0d3 100644
--- a/bootstrap-fileinput/bootstrap-fileinput.d.ts
+++ b/bootstrap-fileinput/bootstrap-fileinput.d.ts
@@ -1,1029 +1,1037 @@
-interface JQuery {
-    fileinput: (options?: FileInputOptions) => JQuery;
+// Type definitions for bootstrap-fileinput
+// Project: https://github.com/kartik-v/bootstrap-fileinput
+// Definitions by: Ché Coxshall <https://github.com/CheCoxshall>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+interface JQuery {
+    fileinput: (options?: BootstrapFileInput.FileInputOptions) => JQuery;
 }
 
-interface FileInputOptions {
-    /**
-    Language configuration for the plugin to enable the plugin to display messages for your locale (you must set the ISO code for the language).
-     You can have multiple language widgets on the same page.
-    The locale JS file for the language code must be defined as mentioned in the translations section: http://plugins.krajee.com/file-input#translations
-    */
-    language?: string;
-    /**
-    Whether to display the file caption.
-    Defaults to true.
-    */
-    showCaption?: boolean;
-    /**
-    Whether to display the file preview.
-    Defaults to true.
-    */
-    showPreview?: boolean;
-    /**
-    Whether to display the file remove/clear button.
-    Defaults to true.
-    */
-    showRemove?: boolean;
-    /**
-    Whether to display the file upload button.
-    Defaults to true.
-    This will default to a form submit button, unless the uploadUrl is specified.
-    */
-    showUpload?: boolean;
-    /**
-    Whether to display the file upload cancel button.
-    Defaults to true.
-    This will be only enabled and displayed when an AJAX upload is in process.
-    */
-    showCancel?: boolean;
-    /**
-    Whether to display the close icon in the preview.
-    Defaults to true.
-    This will be only parsed when showPreview is true or when you are using the {close} tag in your preview templates.
-    */
-    showClose?: boolean;
-    /**
-    Whether to persist display of the uploaded file thumbnails in the preview window (for ajax uploads) until the remove/clear button is pressed.
-    Defaults to true.
-    When set to false, a next batch of files selected for upload will clear these thumbnails from preview.
-    */
-    showUploadedThumbs?: boolean;
-    /**
-    Whether to automatically replace the files in the preview after the maxFileCount limit is reached and a new set of file(s) is/are selected.
-    This will only work if a valid maxFileCount is set.
-    Defaults to false.
-    */
-    autoReplace?: boolean;
-    /**
-    Any additional CSS class to append to the caption container.
-    */
-    captionClass?: string;
-    /**
-    Any additional CSS class to append to the preview container.
-    */
-    previewClass?: string;
-    /**
-    Any additional CSS class to append to the main plugin container.
-    */
-    mainClass?: string;
-    /**
-    The initial preview content to be displayed.
-    You can pass the minimal HTML markup for displaying your image, text, or file.
-    If set as a string, this will display a single file in the initial preview if there is no delimiter. You can set a delimiter (as defined in initialDelimiter) to show multiple files in initial preview.
-    If set as an array, it will display all files in the array as an initial preview (useful for multiple file upload scenarios).
-    The following CSS classes will need to be added for displaying each file type as per the plugin style theme:
-    image files: Include CSS class file-preview-image
-    text files: Include CSS class file-preview-text
-    other files: Include CSS class file-preview-other
-    */
-    initialPreview?: string | any[]; 
-    /**
-    the count of initial preview items that will be added to the count of files selected in preview. This is applicable when displaying the right caption, when overwriteInitial is set to false.
-    */
-    initialPreviewCount?: number;
-    /**
-    the delimiter to be used for splitting the initial preview content as individual file thumbnails (applicable only if initialPreview is passed as a string instead of array). Defaults to *$$*.
-    */
-    initialPreviewDelimiter?: string;
-    /**
-    the configuration for setting up important properties for each initialPreview item (that is setup as part of initialPreview).
-    */
-    initialPreviewConfig?: IFileUploadPreviewConfig[];
-    /**
-    whether the delete button will be displayed for each thumbnail that has been created with initialPreview.
-    */
-    initialPreviewShowDelete?: boolean;
-    /**
-    whether the file thumbnail should be removed from preview on error. Defaults to false.
-    */
-    removeFromPreviewOnError?: boolean;
-    /**
-    this will be a list of tags used in thumbnail templates that will be replaced dynamically within the thumbnail markup, when the thumbnail is rendered.
-    */
-    previewThumbTags?: { [key: string]: string; }
-    /**
-    this is an extension of previewThumbTags specifically for initial preview content - but will be configured as an array of objects corresponding to each initial preview thumbnail. The initial preview thumbnails set via initialPreview will read this configuration for replacing tags.
-    */
-    initialPreviewThumbTags?: { [key: string]: string; }
-    /**
-    the extra data that will be passed as data to the initial preview delete url/AJAX server call via POST.
-    This will be overridden by the initialPreviewConfig['extra'] property.
-    This property is only applicable for ajax deletions in initial preview and when you have set a value for initialPreviewConfig['url'] or deleteUrl.
-    This can be setup either as an object (associative array of keys and values) or as a function callback.
-    Note
-    The ajax delete action will send the following data to server via POST:
-        key: the key setting as setup in initialPreviewConfig['key']
-        any other extra data passed as key: value pairs either via initialPreviewConfig['extra'] OR deleteExtraData if former is not set.
-    */
-    deleteExtraData?: {} | { (): {} };
-    /**
-    the URL for deleting the image/content in the initial preview via AJAX post response. This will be overridden by the initialPreviewConfig['url'] property.
-    Note
-    The ajax delete action will send the following data to server via POST:
-        key: the key setting as setup in initialPreviewConfig['key']
-        any other extra data passed as key: value pairs either via initialPreviewConfig['extra'] OR deleteExtraData if former is not set.
-    */
-    deleteUrl?: string;
-    /**
-    the initial preview caption text to be displayed.
-    If you do not set a value here and initialPreview is set to true this will default to "{preview-file-count} files selected", where {preview-file-count} is the count of the files passed in initialPreview.
-    */
-    initialCaption?: string;
-    /**
-    whether you wish to overwrite the initial preview content and caption setup.
-    This defaults to true, whereby, any initialPreview content set will be overwritten, when new file is uploaded or when files are cleared.
-    Setting it to false will help displaying a saved image or file from database always - useful especially when using the multiple file upload feature.
-    */
-    overwriteInitial?: boolean;
-    /**
-    the templates configuration for rendering each part of the layout.
-    */
-    layoutTemplates?: IFileUploadLayoutTemplates;
-    /**
-    the templates configuration for rendering each preview file type.
-    */
-    previewTemplates?: IFileUploadPreviewTemplates;
-    /**
-    the list of allowed file types for upload.
-    This by default is set to null which means the plugin supports all file types for upload.
-    If an invalid file type is found, then a validation error message as set in msgInvalidFileType will be raised.
-    Note:
-    You need to be careful in case you are setting both allowedFileTypes and allowedFileExtensions. In this case, the allowedFileTypes property is validated first and generally precedes the allowedFileExtensions setting (and the latter validation maybe skipped).
-    */
-    allowedFileTypes?: ("image" | "html" | "text" | "video" | "audio" | "flash" | "object")[];
-    /**
-    the list of allowed file extensions for upload.
-    This by default is set to null which means the plugin supports all file extensions for upload.
-    If an invalid file extension is found, then a validation error message as set in msgInvalidFileExtension will be raised.
-    Note:
-    You need to be careful in case you are setting both allowedFileTypes and allowedFileExtensions. In this case, the allowedFileTypes property is validated first and generally precedes the allowedFileExtensions setting (and the latter validation maybe skipped).
-    */
-    allowedFileExtensions?: string[];
-    /**
-    the list of allowed preview types for your widget.
-    This by default supports all file types for preview.
-    The plugin by default treats each file as an object if it does not match any of the previous types.
-    To disable this behavior, you can remove object from the list of allowedPreviewTypes OR fine tune it through allowedPreviewMimeTypes.
-    To disable content preview for all file-types and show the previewIcon instead as a thumbnail, set this to null, empty, or false.
-    */
-    allowedPreviewTypes?: ("image" | "html" | "text" | "video" | "audio" | "flash" | "object")[];
-    /**
-    the list of allowed mime types for preview.
-    This is set to null by default which means all possible mime types are allowed.
-    This setting works in combination with allowedPreviewTypes to filter only the needed file types allowed for preview.
-    */
-    allowedPreviewMimeTypes?: string[];
-    /**
-    the default content / markup to show by default in the preview window whenever the files are cleared or the input is cleared.
-    This can be useful for use cases like showing the default user profile picture or profile image before upload to overwrite.
-    This is a bit different from initialPreview in the sense, that the initialPreview content will always be displayed unless it is deleted or overwritten based on overwriteInitial.
-    The defaultPreviewContent on the other hand will only be shown ONLY on initialization OR whenever you clear the preview.
-    At other times when files have been selected this will be overwritten temporarily until file(s) selected is/are cleared.
-    This property can be useful to display for example a default user profile picture (or saved picture) in the preview window unless the user selects a picture.
-    */
-    defaultPreviewContent?: string;
-    /**
-    the list of additional custom tags that will be replaced in the layout templates.
-    */
-    customLayoutTags?: {};
-    /**
-    the list of additional custom tags that will be replaced in the preview templates.
-    */
-    customPreviewTags?: {};
-    /**
-    the format settings (width and height) for rendering each preview file type.
-    */
-    previewSettings?: IFileUploadPreviewSettings;
-    /**
-    the settings to validate and identify each file type when a file is selected for upload.
-    This is a list of callbacks, which accepts the file mime type and file name as a parameter.
-    */
-    fileTypeSettings?: IFileUploadFileTypeSettings;
-    /**
-    the icon to be shown in each preview file thumbnail when an unreadable file type for preview is detected. Defaults to <i class="glyphicon glyphicon-file"></i> &nbsp;.
-    */
-    previewFileIcon?: string;
-    /**
-    the CSS class to be applied to the preview file icon container. Defaults to file-icon-4x.
-    */
-    previewFileIconClass?: string;
-    /**
-    the preview icon markup settings for each file extension (type).
-    You need to set this as key: value pairs, where the key corresponds to a file extension (e.g. doc, docx, xls etc.), and the value corresponds to the markup of the icon to be rendered.
-    If this is not set OR a file extension is not set here, the preview will default to previewFileIcon.
-    Note that displaying the icons instead of file content is controlled via allowedPreviewTypes and allowedPreviewMimeTypes
-    */
-    previewFileIconSettings?: IFileUploadPreviewFileIconSettings;
-    /**
-    the extensions to be auto derived for each file extension (type).
-    This is useful if you want to set the same icon for multiple file extension types.
-    You need to set this as `key: value` pairs, where the key corresponds to a file extension as set in previewFileIconSettings (e.g. doc, docx, xls etc.).
-    The value will be a function callback that accepts the following parameter:
-        ext: string, the file extension (without the . [dot]) of the file currently selected in the preview.
-    You can configure the callback to match the set of file extensions (via regex or similar) for each `key` and return a boolean output if the file extension matches.
-    */
-    previewFileExtSettings?: IFileUploadPreviewFileExtSettings;
-    /**
-    the CSS class for the each of the button labels for browse, remove, upload, and cancel.
-    Defaults to hidden-xs, which automatically hides the button labels for small screen devices and renders as smaller iconic buttons to fit to the screen.
-    */
-    buttonLabelClass?: string;
-    /**
-    the label to display for the file picker/browse button. Defaults to Browse ….
-    */
-    browseLabel?: string;
-    /**
-    the icon to display before the label for the file picker/browse button. Defaults to <i class="glyphicon glyphicon-folder-open"></i>&nbsp;.
-    */
-    browseIcon?: string;
-    /**
-    the CSS class for the file picker/browse button. Defaults to btn btn-primary.
-    */
-    browseClass?: string;
-    /**
-    the label to display for the file remove button. Defaults to Remove.
-    */
-    removeLabel?: string;
-    /**
-    the icon to display before the label for the file picker/remove button. Defaults to <i class="glyphicon glyphicon-trash"></i> &nbsp;.
-    */
-    removeIcon?: string;
-    /**
-    the CSS class for the file remove button. Defaults to btn btn-default.
-    */
-    removeClass?: string;
-    /**
-    the title to display on hover for the file remove button. Defaults to Clear selected files.
-    */
-    removeTitle?: string;
-    /**
-    the label to display for the file upload button. Defaults to Upload.
-    */
-    uploadLabel?: string;
-    /**
-    the icon to display before the label for the file upload button. Defaults to <i class="glyphicon glyphicon-upload"></i> &nbsp;.
-    */
-    uploadIcon?: string;
-    /**
-    the CSS class for the file upload button. Defaults to btn btn-default.
-    */
-    uploadClass?: string;
-    /**
-    the title to display on hover for the file remove button.
-    Defaults to Upload selected files.
-    */
-    uploadTitle?: string;
-    /**
-    the URL for the upload processing action (typically for ajax based processing).
-    Defaults to null.
-    If this is not set or null, then the upload button action will default to form submission.
-    NOTE:
-        This is MANDATORY if you want to use advanced features like drag & drop, append/remove files, selectively upload files via ajax etc.
-        The plugin automatically send $_FILES data to the server with the input `name` attribute as the key if provided.
-        If input name is not set, the key defaults to file-data.
-    */
-    uploadUrl?: string;
-    /**
-    whether the batch upload of multiple files will be asynchronous/in parallel.
-    Defaults to true.
-    */
-    uploadAsync?: boolean;
-    /**
-    the extra data that will be passed as data to the url/AJAX server call via POST.
-    This property is only applicable for ajax uploads and when you have set a value for uploadUrl.
-    This can be setup either as an object (associative array of keys and values) or as a function callback.
-    As an object, it can be set for example as:
-        { id: 100, value: '100 Details' }
-    Note that for uploading individual file via thumbnail, the function callback can also receive the thumbnail previewId and index as parameters. These are described below:
-        previewId: the identifier for the preview file container (only available when uploading each thumbnail file)
-        index: the zero-based sequential index of the loaded file in the preview list (only available when uploading each thumbnail file)
-    */
-    uploadExtraData?: {} | ((previewId?: string, index?: number) => {});
-    /**
-    the minimum allowed image height in px if you are uploading image files.
-    Defaults to null which means no limit on image height.
-    */
-    minImageHeight?: number;
-    /**
-    the maximum allowed image width in px if you are uploading image files.
-    Defaults to null which means no limit on image width.
-    Note that if you set resizeImage property to true, then the entire image will be resized within this width (depending on resizePreference).
-    */
-    maxImageWidth?: number;
-    /**
-    the maximum allowed image height in px if you are uploading image files.
-    Defaults to null which means no limit on image height.
-    Note that if you set resizeImage property to true, then the entire image will be resized within this height (depending on resizePreference).
-    */
-    maxImageHeight?: number;
-    /**
-    whether to add ability to resize uploaded images. Defaults to false.
-    Note that resizing images requires HTML5 canvas support which is supported on most modern browsers.
-    In addition, you must include the JavaScript-Canvas-to-Blob plugin by blueimp by including canvas-to-blob.js in your application.
-    This JS file must be loaded before fileinput.js on the page.
-    The JavaScript-Canvas-to-Blob source files are available in js/plugins folder of bootstrap-fileinput project page.
-    The canvas-to-blob.js plugin is a polyfill for canvas.toBlob method and is needed for allowing the resized image files via HTML5 canvas to be returned as a blob
-    */
-    resizeImage?: boolean;
-    /**
-    preference to resize the image based on width or height.
-    Defaults to width.
-    This property is parsed only when resizeImage is true.
-    If set to width, the maxImageWidth property is first tested and if image size is greater than this, then the image is resized to maxImageWidth.
-    The image height is resized and adjusted in the same ratio as width.
-    In case, the image width is already less than maxImageWidth then the maxImageHeight property is used to resize and width is adjusted in same ratio.
-    This will behave conversely, when resizePreference is set to height - the maxImageHeight will be first tested against image height and then the rest of steps will be similarly parsed with preference given to height instead of width as before.
-    */
-    resizePreference?: "width" | "height";
-    /**
-    the quality of the resized image. This must be a decimal number between 0.00 to 1.00.
-    Defaults to 0.92.
-    */
-    resizeImageQuality?: number;
-    /**
-    the default image mime type of the converted image after resize.
-    Defaults to image/jpeg.
-    */
-    resizeDefaultImageType?: string;
-    /**
-    the maximum file size for upload in KB.
-    If set to 0, it means size allowed is unlimited.
-    Defaults to 0.
-    */
-    maxFileSize?: number;
-    /**
-    the minimum number of files allowed for each multiple upload.
-    If set to 0, it means number of files are optional.
-    Defaults to 0.
-    */
-    minFileCount?: number;
-    /**
-    the maximum number of files allowed for each multiple upload.
-    If set to 0, it means number of files allowed is unlimited.
-    Defaults to 0.
-    */
-    maxFileCount?: number;
-    /**
-    whether to include initial preview file count (server uploaded files) in validating minFileCount and maxFileCount.
-    Defaults to false.
-    */
-    validateInitialCount?: boolean;
-    /**
-    the message that will be displayed when ZERO files are found.
-    Defaults to No.
-    */
-    msgNo?: string;
-    /**
-    the message that will be displayed within the progress bar when file upload is aborted or cancelled.
-    Defaults to Cancelled.
-    */
-    msgCancelled?: string;
-    /**
-    the title displayed (before the file name) on hover of the zoom button for zooming the file content in a modal window.
-    This is currently applicable only for text file previews.
-    Defaults to View details.
-    */
-    msgZoomTitle?: string;
-    /**
-    the heading of the modal dialog that displays the zoomed file content.
-    This is currently applicable only for text file previews.
-    Defaults to Detailed Preview.
-    */
-    msgZoomModalHeading?: string;
-    /**
-    the message to be displayed when the file size exceeds maximum size.
-    Defaults to:
-        File "{name}" ({size} KB) exceeds maximum allowed upload size of {maxSize} KB. Please retry your upload!
-    where:
-        {name}: will be replaced by the file name being uploaded
-        {size}: will be replaced by the uploaded file size
-        {maxSize}: will be replaced by the maxFileSize parameter.
-    */
-    msgSizeTooLarge?: string;
-    /**
-    message to be displayed when the file count is less than the minimum count as set in minFileCount.
-    Defaults to:
-        You must select at least {n} {files} to upload. Please retry your upload!
-    where:
-        {n}: will be replaced by the allowed minimum files as set in minFileCount.
-        {files}: will be replaced with fileSingle or filePlural properties in locale file depending on the minFileCount.
-    */
-    msgFilesTooLess?: string;
-    /**
-    the message to be displayed when the file count exceeds maximum count as set in maxFileCount.
-    Defaults to:
-        Number of files selected for upload ({n}) exceeds maximum allowed limit of {m}. Please retry your upload!
-    where:
-        {n}: will be replaced by number of files selected for upload
-        {m}: will be replaced by the allowed maximum files as set in maxFileCount
-    */
-    msgFilesTooMany?: string;
-    /**
-    the exception message to be displayed when the file selected is not found by the FileReader.
-    Defaults to:
-        File "{name}" not found!
-    where:
-        {name}: will be replaced by the file name being uploaded
-    */
-    msgFileNotFound?: string;
-    /**
-    the exception message to be displayed when the file selected is not allowed to be accessed due to a security exception.
-    Defaults to:
-        Security restrictions prevent reading the file "{name}".
-    where:
-        {name}: will be replaced by the file name being uploaded
-    */
-    msgFileSecured?: string;
-    /**
-    the exception message to be displayed when the file selected is not readable by the FileReader API.
-    Defaults to:
-        File "{name}" is not readable.
-    where:
-        {name}: will be replaced by the file name being uploaded
-    */
-    msgFileNotReadable?: string;
-    /**
-    the exception message to be displayed when the file preview upload is aborted.
-    Defaults to:
-        File preview aborted for "{name}".
-    where:
-        {name}: will be replaced by the file name being uploaded
-    */
-    msgFilePreviewAborted?: string;
-    /**
-    the exception message to be displayed for any other error when previewing the file.
-    Defaults to:
-        An error occurred while reading the file "{name}".
-    where:
-        {name}: will be replaced by the file name being uploaded
-    */
-    msgFilePreviewError?: string;
-    /**
-    the message to be displayed when the file type is not in one of the file types set in allowedFileTypes.
-    Defaults to:
-        Invalid type for file "{name}". Only "{types}" files are supported.
-    where:
-        {name}: will be replaced by the file name being uploaded
-        {types}: will be replaced by the comma separated list of types defined in allowedFileTypes.
-    */
-    msgInvalidFileType?: string;
-    /**
-    the message to be displayed when the file type is not in one of the file extensions set in allowedFileExtensions.
-    Defaults to:
-        Invalid extension for file "{name}". Only "{extensions}" files are supported.
-    where:
-        {name}: will be replaced by the file name being uploaded
-        {extensions}: will be replaced by the comma separated list of extensions defined in allowedFileExtensions.
-    */
-    msgInvalidFileExtension?: string;
-    /**
-    the message to be displayed when an ongoing ajax file upload is aborted by pressing the Cancel button.
-    Defaults to The file upload was aborted.
-    If this is set to null or empty, the internal ajax error message will be displayed - Defaults to File Upload Error.
-    */
-    msgUploadAborted?: string;
-    /**
-    the exception message to be displayed within the caption container (instead of msgFilesSelected), when a validation error is encountered.
-    Defaults to File Upload Error.
-    */
-    msgValidationError?: string;
-    /**
-    the css class for the validation error message displayed in the caption container.
-    Defaults to text-danger.
-    */
-    msgValidationErrorClass?: string;
-    /**
-    the icon to be displayed before the validation error in the caption container.
-    Defaults to <i class="glyphicon glyphicon-exclamation-sign"></i>
-    */
-    msgValidationErrorIcon?: string;
-    /**
-    the css class for the error message to be displayed in the preview window when the file size exceeds maxSize.
-    Defaults to file-error-message.
-    */
-    msgErrorClass?: string;
-    /**
-    the message displayed when the files are getting read and loaded for preview.
-    Defaults to
-        Loading file {index} of {files} …
-    The following special variables will be replaced:
-        {index}: the sequence number of the current file being loaded.
-        {files}: the total number of files selected for upload.
-    */
-    msgLoading?: string;
-    /**
-    the progress message displayed as each file is loaded for preview.
-    Defaults to:
-        Loading file {index} of {files} - {name} - {percent}% completed.
-    The following variables will be replaced:
-        {index}: the sequence number of the current file being loaded.
-        {files}: the total number of files selected for upload.
-        {percent}: the percentage of file read and loaded.
-        {name}: the name of the current file being loaded.
-    */
-    msgProgress?: string;
-    /**
-    the progress message displayed in caption window when multiple (more than one) files are selected.
-    Defaults to:
-        {n} files selected.
-    The following variables will be replaced:
-        {n}: the number of files selected.
-    */
-    msgSelected?: string;
-    /**
-    the message displayed when a folder has been dragged to the drop zone.
-    Defaults to:
-        Drag & drop files only! {n} folder(s) dropped were skipped.
-    The following variables will be replaced:
-        {n}: the number of folders dropped.
-    */
-    msgFoldersNotAllowed?: string;
-    /**
-    the exception message to be displayed when the file selected for preview is an image and its width is less than the minImageWidth setting.
-    Defaults to:
-        Width of image file "{name}" must be at least {size} px.
-    where:
-        {name}: will be replaced by the file name being uploaded.
-        {size}: will be replaced by the minImageWidth setting.
-    */
-    msgImageWidthSmall?: string;
-    /**
-    the exception message to be displayed when the file selected for preview is an image and its height is less than the minImageHeight setting.
-    Defaults to:
-        Height of image file "{name}" must be at least {size} px.
-    where:
-        {name}: will be replaced by the file name being uploaded.
-        {size}: will be replaced by the minImageHeight setting.
-    */
-    msgImageHeightSmall?: string;
-    /**
-    the exception message to be displayed when the file selected for preview is an image and its width exceeds the maxImageWidth setting.
-    Defaults to:
-        Width of image file "{name}" cannot exceed {size} px.
-    where:
-        {name}: will be replaced by the file name being uploaded.
-        {size}: will be replaced by the maxImageWidth setting.
-    */
-    msgImageWidthLarge?: string;
-    /**
-    the exception message to be displayed when the file selected for preview is an image and its height exceeds the maxImageHeight setting.
-    Defaults to:
-        Height of image file "{name}" cannot exceed {size} px.
-    where:
-        {name}: will be replaced by the file name being uploaded.
-        {size}: will be replaced by the maxImageHeight setting.
-    */
-    msgImageHeightLarge?: string;
-    /**
-    the upload progress bar CSS class to be applied when AJAX upload is in process (applicable only for ajax uploads).
-    Defaults to progress-bar progress-bar-success progress-bar-striped active.
-    */
-    progressClass?: string;
-    /**
-    the upload progress bar CSS class to be applied when AJAX upload is in process (applicable only for ajax uploads).
-    Defaults to progress-bar progress-bar-success progress-bar-striped active.
-    */
-    progressCompleteClass?: string;
-    /**
-    the upload progress bar CSS class to be applied when AJAX upload is cancelled or aborted.
-    Defaults to progress-bar progress-bar-danger.
-    */
-    progressErrorClass?: string;
-    /**
-    the type of files that are to be displayed in the preview window.
-    Defaults to image.
-    Can be one of the following:
-        image: Only image type files will be shown in preview.
-        text: Only text type files will be shown in preview.
-        any: Both image and text files content will be shown in preview.
-    Files other than image or text will be displayed as a thumbnail with the filename in the preview window.
-    */
-    previewFileType?: "image" | "text" | "any";
-    /**
-    the icon for zooming the file content in a new modal dialog.
-    This is currently applicable only for text file previews.
-    Defaults to <i class="glyphicon glyphicon-zoom-in"></i>
-    */
-    zoomIndicator?: string;
-    /**
-    the identifier for the container element displaying the error (e.g. '#id').
-    If not set, will default to the container with CSS class kv-fileinput-error inside the preview container (identified by elPreviewContainer).
-    The msgErrorClass will be automatically appended to this container before displaying the error.
-    */
-    elErrorContainer?: string;
-    /**
-    the identifier for the container element containing the caption (e.g. '#id').
-    If not set, will default to the container with CSS class file-caption inside the main plugin container.
-    */
-    elCaptionContainer?: string;
-    /**
-    the identifier for the container element containing the caption text (e.g. '#id').
-    If not set, will default to the container with CSS class file-caption-name inside the main plugin container.
-    */
-    elCaptionText?: string;
-    /**
-    the identifier for the container element containing the preview (e.g. '#id').
-    If not set, will default to the container with CSS class file-preview inside the main plugin container.
-    */
-    elPreviewContainer?: string;
-    /**
-    the identifier for the element containing the preview image thumbnails (e.g. '#id').
-    If not set, will default to the container with CSS class file-preview-thumbnails inside the main plugin container.
-    */
-    elPreviewImage?: string;
-    /**
-    the identifier for the element containing the preview progress status (e.g. '#id').
-    If not set, will default to the container with CSS class file-preview-status inside the main plugin container.
-    */
-    elPreviewStatus?: string;
-    /**
-    a callback to convert the filename as a slug string eliminating special characters.
-    If not set, it will use the plugin's own internal slugDefault method.
-    This callback function includes the filename as parameter and must return a converted filename string.
-    */
-    slugCallback?: (filename: string) => string;
-    /**
-    whether to enable a drag and drop zone for dragging and dropping files to.
-    This is available only for ajax based uploads.
-    Defaults to true.
-    */
-    dropZoneEnabled?: boolean;
-    /**
-    title to be displayed in the drag and drop zone.
-    This is available only for ajax based uploads.
-    Defaults to:
-        Drag & drop files here ….
-    */
-    dropZoneTitle?: string;
-    /**
-    CSS class for the drag & drop zone title.
-    Defaults to file-drop-zone-title.
-    */
-    dropZoneTitleClass?: string;
-    /**
-    configuration for setting up file actions for newly selected file thumbnails in the preview window.
-    */
-    fileActionsettings?: IFileUploadFileActionSettings;
-    /**
-    markup for additional action buttons to display within the initial preview thumbnails (for example displaying an image edit button).
-    The following tag can be used in the markup and will be automatically replaced:
-        {dataKey}: Will be replaced with the key set within initialPreviewConfig.
-    */
-    otherActionButtons?: string;
-    /**
-    the encoding to be used while reading a text file.
-    Applicable only for previewing text files.
-    Defaults to UTF-8.
-    */
-    textEncoding?: string;
-    /**
-    additional ajax settings to pass to the plugin before submitting the ajax request for upload.
-    Applicable only for ajax uploads.
-    This can be useful to pass additional tokens to headers or one can use it for setting other ajax options for advanced cases.
-    Refer the jQuery ajax documentation for the various settings you can configure.
-    */
-    ajaxSettings?: JQueryAjaxSettings;
-    /**
-    additional ajax settings to pass to the plugin before submitting the delete ajax request in each initial preview thumbnail.
-    Applicable only for ajax uploads.
-    This can be useful to pass additional tokens to headers or one can use it for setting other ajax options for advanced cases.
-    Refer the jQuery ajax documentation for the various settings you can configure.
-    */
-    ajaxDeleteSettings?: JQueryAjaxSettings;
-    /**
-    whether to show details of the error stack from the server log when an error is encountered via ajax response.
-    Defaults to true.
-    */
-    showAjaxErrorDetails?: boolean;
-}
 
-interface IFileUploadPreviewConfig {
-    /**
-    the caption or filename to display for each initial preview item content.
-    */
-    caption: string;
-    /**
-    the CSS width of the image/ content displayed.
-    */
-    width: string;
-    /**
-     the URL for deleting the image/ content in the initial preview via AJAX post response.This will default to deleteUrl if not set.
-    */
-    url: string;
-    /**
-    the key that will be passed as data to the url via AJAX POST.
-    */
-    key: string | {};
-    /**
-    the additional frame css class to set for the file's thumbnail frame.
-    */
-    frameClass: string;
-    /**
-    the HTML attribute settings (set as key:value pairs) for the thumbnail frame.
-    */
-    frameAttr: {}; 
-    /**
-    the extra data that will be passed as data to the initial preview delete url / AJAX server call via POST.This will default to deleteExtraData if not set.
-    */
-    extra: {} | Function; 
-}
+declare module BootstrapFileInput {
+    interface FileInputOptions {
+        /**
+        Language configuration for the plugin to enable the plugin to display messages for your locale (you must set the ISO code for the language).
+         You can have multiple language widgets on the same page.
+        The locale JS file for the language code must be defined as mentioned in the translations section: http://plugins.krajee.com/file-input#translations
+        */
+        language?: string;
+        /**
+        Whether to display the file caption.
+        Defaults to true.
+        */
+        showCaption?: boolean;
+        /**
+        Whether to display the file preview.
+        Defaults to true.
+        */
+        showPreview?: boolean;
+        /**
+        Whether to display the file remove/clear button.
+        Defaults to true.
+        */
+        showRemove?: boolean;
+        /**
+        Whether to display the file upload button.
+        Defaults to true.
+        This will default to a form submit button, unless the uploadUrl is specified.
+        */
+        showUpload?: boolean;
+        /**
+        Whether to display the file upload cancel button.
+        Defaults to true.
+        This will be only enabled and displayed when an AJAX upload is in process.
+        */
+        showCancel?: boolean;
+        /**
+        Whether to display the close icon in the preview.
+        Defaults to true.
+        This will be only parsed when showPreview is true or when you are using the {close} tag in your preview templates.
+        */
+        showClose?: boolean;
+        /**
+        Whether to persist display of the uploaded file thumbnails in the preview window (for ajax uploads) until the remove/clear button is pressed.
+        Defaults to true.
+        When set to false, a next batch of files selected for upload will clear these thumbnails from preview.
+        */
+        showUploadedThumbs?: boolean;
+        /**
+        Whether to automatically replace the files in the preview after the maxFileCount limit is reached and a new set of file(s) is/are selected.
+        This will only work if a valid maxFileCount is set.
+        Defaults to false.
+        */
+        autoReplace?: boolean;
+        /**
+        Any additional CSS class to append to the caption container.
+        */
+        captionClass?: string;
+        /**
+        Any additional CSS class to append to the preview container.
+        */
+        previewClass?: string;
+        /**
+        Any additional CSS class to append to the main plugin container.
+        */
+        mainClass?: string;
+        /**
+        The initial preview content to be displayed.
+        You can pass the minimal HTML markup for displaying your image, text, or file.
+        If set as a string, this will display a single file in the initial preview if there is no delimiter. You can set a delimiter (as defined in initialDelimiter) to show multiple files in initial preview.
+        If set as an array, it will display all files in the array as an initial preview (useful for multiple file upload scenarios).
+        The following CSS classes will need to be added for displaying each file type as per the plugin style theme:
+        image files: Include CSS class file-preview-image
+        text files: Include CSS class file-preview-text
+        other files: Include CSS class file-preview-other
+        */
+        initialPreview?: string | any[];
+        /**
+        the count of initial preview items that will be added to the count of files selected in preview. This is applicable when displaying the right caption, when overwriteInitial is set to false.
+        */
+        initialPreviewCount?: number;
+        /**
+        the delimiter to be used for splitting the initial preview content as individual file thumbnails (applicable only if initialPreview is passed as a string instead of array). Defaults to *$$*.
+        */
+        initialPreviewDelimiter?: string;
+        /**
+        the configuration for setting up important properties for each initialPreview item (that is setup as part of initialPreview).
+        */
+        initialPreviewConfig?: PreviewConfig[];
+        /**
+        whether the delete button will be displayed for each thumbnail that has been created with initialPreview.
+        */
+        initialPreviewShowDelete?: boolean;
+        /**
+        whether the file thumbnail should be removed from preview on error. Defaults to false.
+        */
+        removeFromPreviewOnError?: boolean;
+        /**
+        this will be a list of tags used in thumbnail templates that will be replaced dynamically within the thumbnail markup, when the thumbnail is rendered.
+        */
+        previewThumbTags?: { [key: string]: string; }
+        /**
+        this is an extension of previewThumbTags specifically for initial preview content - but will be configured as an array of objects corresponding to each initial preview thumbnail. The initial preview thumbnails set via initialPreview will read this configuration for replacing tags.
+        */
+        initialPreviewThumbTags?: { [key: string]: string; }
+        /**
+        the extra data that will be passed as data to the initial preview delete url/AJAX server call via POST.
+        This will be overridden by the initialPreviewConfig['extra'] property.
+        This property is only applicable for ajax deletions in initial preview and when you have set a value for initialPreviewConfig['url'] or deleteUrl.
+        This can be setup either as an object (associative array of keys and values) or as a function callback.
+        Note
+        The ajax delete action will send the following data to server via POST:
+            key: the key setting as setup in initialPreviewConfig['key']
+            any other extra data passed as key: value pairs either via initialPreviewConfig['extra'] OR deleteExtraData if former is not set.
+        */
+        deleteExtraData?: {} | { (): {} };
+        /**
+        the URL for deleting the image/content in the initial preview via AJAX post response. This will be overridden by the initialPreviewConfig['url'] property.
+        Note
+        The ajax delete action will send the following data to server via POST:
+            key: the key setting as setup in initialPreviewConfig['key']
+            any other extra data passed as key: value pairs either via initialPreviewConfig['extra'] OR deleteExtraData if former is not set.
+        */
+        deleteUrl?: string;
+        /**
+        the initial preview caption text to be displayed.
+        If you do not set a value here and initialPreview is set to true this will default to "{preview-file-count} files selected", where {preview-file-count} is the count of the files passed in initialPreview.
+        */
+        initialCaption?: string;
+        /**
+        whether you wish to overwrite the initial preview content and caption setup.
+        This defaults to true, whereby, any initialPreview content set will be overwritten, when new file is uploaded or when files are cleared.
+        Setting it to false will help displaying a saved image or file from database always - useful especially when using the multiple file upload feature.
+        */
+        overwriteInitial?: boolean;
+        /**
+        the templates configuration for rendering each part of the layout.
+        */
+        layoutTemplates?: LayoutTemplates;
+        /**
+        the templates configuration for rendering each preview file type.
+        */
+        previewTemplates?: PreviewTemplates;
+        /**
+        the list of allowed file types for upload.
+        This by default is set to null which means the plugin supports all file types for upload.
+        If an invalid file type is found, then a validation error message as set in msgInvalidFileType will be raised.
+        Note:
+        You need to be careful in case you are setting both allowedFileTypes and allowedFileExtensions. In this case, the allowedFileTypes property is validated first and generally precedes the allowedFileExtensions setting (and the latter validation maybe skipped).
+        */
+        allowedFileTypes?: ("image" | "html" | "text" | "video" | "audio" | "flash" | "object")[];
+        /**
+        the list of allowed file extensions for upload.
+        This by default is set to null which means the plugin supports all file extensions for upload.
+        If an invalid file extension is found, then a validation error message as set in msgInvalidFileExtension will be raised.
+        Note:
+        You need to be careful in case you are setting both allowedFileTypes and allowedFileExtensions. In this case, the allowedFileTypes property is validated first and generally precedes the allowedFileExtensions setting (and the latter validation maybe skipped).
+        */
+        allowedFileExtensions?: string[];
+        /**
+        the list of allowed preview types for your widget.
+        This by default supports all file types for preview.
+        The plugin by default treats each file as an object if it does not match any of the previous types.
+        To disable this behavior, you can remove object from the list of allowedPreviewTypes OR fine tune it through allowedPreviewMimeTypes.
+        To disable content preview for all file-types and show the previewIcon instead as a thumbnail, set this to null, empty, or false.
+        */
+        allowedPreviewTypes?: ("image" | "html" | "text" | "video" | "audio" | "flash" | "object")[];
+        /**
+        the list of allowed mime types for preview.
+        This is set to null by default which means all possible mime types are allowed.
+        This setting works in combination with allowedPreviewTypes to filter only the needed file types allowed for preview.
+        */
+        allowedPreviewMimeTypes?: string[];
+        /**
+        the default content / markup to show by default in the preview window whenever the files are cleared or the input is cleared.
+        This can be useful for use cases like showing the default user profile picture or profile image before upload to overwrite.
+        This is a bit different from initialPreview in the sense, that the initialPreview content will always be displayed unless it is deleted or overwritten based on overwriteInitial.
+        The defaultPreviewContent on the other hand will only be shown ONLY on initialization OR whenever you clear the preview.
+        At other times when files have been selected this will be overwritten temporarily until file(s) selected is/are cleared.
+        This property can be useful to display for example a default user profile picture (or saved picture) in the preview window unless the user selects a picture.
+        */
+        defaultPreviewContent?: string;
+        /**
+        the list of additional custom tags that will be replaced in the layout templates.
+        */
+        customLayoutTags?: {};
+        /**
+        the list of additional custom tags that will be replaced in the preview templates.
+        */
+        customPreviewTags?: {};
+        /**
+        the format settings (width and height) for rendering each preview file type.
+        */
+        previewSettings?: PreviewSettings;
+        /**
+        the settings to validate and identify each file type when a file is selected for upload.
+        This is a list of callbacks, which accepts the file mime type and file name as a parameter.
+        */
+        fileTypeSettings?: FileTypeSettings;
+        /**
+        the icon to be shown in each preview file thumbnail when an unreadable file type for preview is detected. Defaults to <i class="glyphicon glyphicon-file"></i> &nbsp;.
+        */
+        previewFileIcon?: string;
+        /**
+        the CSS class to be applied to the preview file icon container. Defaults to file-icon-4x.
+        */
+        previewFileIconClass?: string;
+        /**
+        the preview icon markup settings for each file extension (type).
+        You need to set this as key: value pairs, where the key corresponds to a file extension (e.g. doc, docx, xls etc.), and the value corresponds to the markup of the icon to be rendered.
+        If this is not set OR a file extension is not set here, the preview will default to previewFileIcon.
+        Note that displaying the icons instead of file content is controlled via allowedPreviewTypes and allowedPreviewMimeTypes
+        */
+        previewFileIconSettings?: PreviewFileIconSettings;
+        /**
+        the extensions to be auto derived for each file extension (type).
+        This is useful if you want to set the same icon for multiple file extension types.
+        You need to set this as `key: value` pairs, where the key corresponds to a file extension as set in previewFileIconSettings (e.g. doc, docx, xls etc.).
+        The value will be a function callback that accepts the following parameter:
+            ext: string, the file extension (without the . [dot]) of the file currently selected in the preview.
+        You can configure the callback to match the set of file extensions (via regex or similar) for each `key` and return a boolean output if the file extension matches.
+        */
+        previewFileExtSettings?: PreviewFileExtSettings;
+        /**
+        the CSS class for the each of the button labels for browse, remove, upload, and cancel.
+        Defaults to hidden-xs, which automatically hides the button labels for small screen devices and renders as smaller iconic buttons to fit to the screen.
+        */
+        buttonLabelClass?: string;
+        /**
+        the label to display for the file picker/browse button. Defaults to Browse ….
+        */
+        browseLabel?: string;
+        /**
+        the icon to display before the label for the file picker/browse button. Defaults to <i class="glyphicon glyphicon-folder-open"></i>&nbsp;.
+        */
+        browseIcon?: string;
+        /**
+        the CSS class for the file picker/browse button. Defaults to btn btn-primary.
+        */
+        browseClass?: string;
+        /**
+        the label to display for the file remove button. Defaults to Remove.
+        */
+        removeLabel?: string;
+        /**
+        the icon to display before the label for the file picker/remove button. Defaults to <i class="glyphicon glyphicon-trash"></i> &nbsp;.
+        */
+        removeIcon?: string;
+        /**
+        the CSS class for the file remove button. Defaults to btn btn-default.
+        */
+        removeClass?: string;
+        /**
+        the title to display on hover for the file remove button. Defaults to Clear selected files.
+        */
+        removeTitle?: string;
+        /**
+        the label to display for the file upload button. Defaults to Upload.
+        */
+        uploadLabel?: string;
+        /**
+        the icon to display before the label for the file upload button. Defaults to <i class="glyphicon glyphicon-upload"></i> &nbsp;.
+        */
+        uploadIcon?: string;
+        /**
+        the CSS class for the file upload button. Defaults to btn btn-default.
+        */
+        uploadClass?: string;
+        /**
+        the title to display on hover for the file remove button.
+        Defaults to Upload selected files.
+        */
+        uploadTitle?: string;
+        /**
+        the URL for the upload processing action (typically for ajax based processing).
+        Defaults to null.
+        If this is not set or null, then the upload button action will default to form submission.
+        NOTE:
+            This is MANDATORY if you want to use advanced features like drag & drop, append/remove files, selectively upload files via ajax etc.
+            The plugin automatically send $_FILES data to the server with the input `name` attribute as the key if provided.
+            If input name is not set, the key defaults to file-data.
+        */
+        uploadUrl?: string;
+        /**
+        whether the batch upload of multiple files will be asynchronous/in parallel.
+        Defaults to true.
+        */
+        uploadAsync?: boolean;
+        /**
+        the extra data that will be passed as data to the url/AJAX server call via POST.
+        This property is only applicable for ajax uploads and when you have set a value for uploadUrl.
+        This can be setup either as an object (associative array of keys and values) or as a function callback.
+        As an object, it can be set for example as:
+            { id: 100, value: '100 Details' }
+        Note that for uploading individual file via thumbnail, the function callback can also receive the thumbnail previewId and index as parameters. These are described below:
+            previewId: the identifier for the preview file container (only available when uploading each thumbnail file)
+            index: the zero-based sequential index of the loaded file in the preview list (only available when uploading each thumbnail file)
+        */
+        uploadExtraData?: {} | ((previewId?: string, index?: number) => {});
+        /**
+        the minimum allowed image height in px if you are uploading image files.
+        Defaults to null which means no limit on image height.
+        */
+        minImageHeight?: number;
+        /**
+        the maximum allowed image width in px if you are uploading image files.
+        Defaults to null which means no limit on image width.
+        Note that if you set resizeImage property to true, then the entire image will be resized within this width (depending on resizePreference).
+        */
+        maxImageWidth?: number;
+        /**
+        the maximum allowed image height in px if you are uploading image files.
+        Defaults to null which means no limit on image height.
+        Note that if you set resizeImage property to true, then the entire image will be resized within this height (depending on resizePreference).
+        */
+        maxImageHeight?: number;
+        /**
+        whether to add ability to resize uploaded images. Defaults to false.
+        Note that resizing images requires HTML5 canvas support which is supported on most modern browsers.
+        In addition, you must include the JavaScript-Canvas-to-Blob plugin by blueimp by including canvas-to-blob.js in your application.
+        This JS file must be loaded before fileinput.js on the page.
+        The JavaScript-Canvas-to-Blob source files are available in js/plugins folder of bootstrap-fileinput project page.
+        The canvas-to-blob.js plugin is a polyfill for canvas.toBlob method and is needed for allowing the resized image files via HTML5 canvas to be returned as a blob
+        */
+        resizeImage?: boolean;
+        /**
+        preference to resize the image based on width or height.
+        Defaults to width.
+        This property is parsed only when resizeImage is true.
+        If set to width, the maxImageWidth property is first tested and if image size is greater than this, then the image is resized to maxImageWidth.
+        The image height is resized and adjusted in the same ratio as width.
+        In case, the image width is already less than maxImageWidth then the maxImageHeight property is used to resize and width is adjusted in same ratio.
+        This will behave conversely, when resizePreference is set to height - the maxImageHeight will be first tested against image height and then the rest of steps will be similarly parsed with preference given to height instead of width as before.
+        */
+        resizePreference?: "width" | "height";
+        /**
+        the quality of the resized image. This must be a decimal number between 0.00 to 1.00.
+        Defaults to 0.92.
+        */
+        resizeImageQuality?: number;
+        /**
+        the default image mime type of the converted image after resize.
+        Defaults to image/jpeg.
+        */
+        resizeDefaultImageType?: string;
+        /**
+        the maximum file size for upload in KB.
+        If set to 0, it means size allowed is unlimited.
+        Defaults to 0.
+        */
+        maxFileSize?: number;
+        /**
+        the minimum number of files allowed for each multiple upload.
+        If set to 0, it means number of files are optional.
+        Defaults to 0.
+        */
+        minFileCount?: number;
+        /**
+        the maximum number of files allowed for each multiple upload.
+        If set to 0, it means number of files allowed is unlimited.
+        Defaults to 0.
+        */
+        maxFileCount?: number;
+        /**
+        whether to include initial preview file count (server uploaded files) in validating minFileCount and maxFileCount.
+        Defaults to false.
+        */
+        validateInitialCount?: boolean;
+        /**
+        the message that will be displayed when ZERO files are found.
+        Defaults to No.
+        */
+        msgNo?: string;
+        /**
+        the message that will be displayed within the progress bar when file upload is aborted or cancelled.
+        Defaults to Cancelled.
+        */
+        msgCancelled?: string;
+        /**
+        the title displayed (before the file name) on hover of the zoom button for zooming the file content in a modal window.
+        This is currently applicable only for text file previews.
+        Defaults to View details.
+        */
+        msgZoomTitle?: string;
+        /**
+        the heading of the modal dialog that displays the zoomed file content.
+        This is currently applicable only for text file previews.
+        Defaults to Detailed Preview.
+        */
+        msgZoomModalHeading?: string;
+        /**
+        the message to be displayed when the file size exceeds maximum size.
+        Defaults to:
+            File "{name}" ({size} KB) exceeds maximum allowed upload size of {maxSize} KB. Please retry your upload!
+        where:
+            {name}: will be replaced by the file name being uploaded
+            {size}: will be replaced by the uploaded file size
+            {maxSize}: will be replaced by the maxFileSize parameter.
+        */
+        msgSizeTooLarge?: string;
+        /**
+        message to be displayed when the file count is less than the minimum count as set in minFileCount.
+        Defaults to:
+            You must select at least {n} {files} to upload. Please retry your upload!
+        where:
+            {n}: will be replaced by the allowed minimum files as set in minFileCount.
+            {files}: will be replaced with fileSingle or filePlural properties in locale file depending on the minFileCount.
+        */
+        msgFilesTooLess?: string;
+        /**
+        the message to be displayed when the file count exceeds maximum count as set in maxFileCount.
+        Defaults to:
+            Number of files selected for upload ({n}) exceeds maximum allowed limit of {m}. Please retry your upload!
+        where:
+            {n}: will be replaced by number of files selected for upload
+            {m}: will be replaced by the allowed maximum files as set in maxFileCount
+        */
+        msgFilesTooMany?: string;
+        /**
+        the exception message to be displayed when the file selected is not found by the FileReader.
+        Defaults to:
+            File "{name}" not found!
+        where:
+            {name}: will be replaced by the file name being uploaded
+        */
+        msgFileNotFound?: string;
+        /**
+        the exception message to be displayed when the file selected is not allowed to be accessed due to a security exception.
+        Defaults to:
+            Security restrictions prevent reading the file "{name}".
+        where:
+            {name}: will be replaced by the file name being uploaded
+        */
+        msgFileSecured?: string;
+        /**
+        the exception message to be displayed when the file selected is not readable by the FileReader API.
+        Defaults to:
+            File "{name}" is not readable.
+        where:
+            {name}: will be replaced by the file name being uploaded
+        */
+        msgFileNotReadable?: string;
+        /**
+        the exception message to be displayed when the file preview upload is aborted.
+        Defaults to:
+            File preview aborted for "{name}".
+        where:
+            {name}: will be replaced by the file name being uploaded
+        */
+        msgFilePreviewAborted?: string;
+        /**
+        the exception message to be displayed for any other error when previewing the file.
+        Defaults to:
+            An error occurred while reading the file "{name}".
+        where:
+            {name}: will be replaced by the file name being uploaded
+        */
+        msgFilePreviewError?: string;
+        /**
+        the message to be displayed when the file type is not in one of the file types set in allowedFileTypes.
+        Defaults to:
+            Invalid type for file "{name}". Only "{types}" files are supported.
+        where:
+            {name}: will be replaced by the file name being uploaded
+            {types}: will be replaced by the comma separated list of types defined in allowedFileTypes.
+        */
+        msgInvalidFileType?: string;
+        /**
+        the message to be displayed when the file type is not in one of the file extensions set in allowedFileExtensions.
+        Defaults to:
+            Invalid extension for file "{name}". Only "{extensions}" files are supported.
+        where:
+            {name}: will be replaced by the file name being uploaded
+            {extensions}: will be replaced by the comma separated list of extensions defined in allowedFileExtensions.
+        */
+        msgInvalidFileExtension?: string;
+        /**
+        the message to be displayed when an ongoing ajax file upload is aborted by pressing the Cancel button.
+        Defaults to The file upload was aborted.
+        If this is set to null or empty, the internal ajax error message will be displayed - Defaults to File Upload Error.
+        */
+        msgUploadAborted?: string;
+        /**
+        the exception message to be displayed within the caption container (instead of msgFilesSelected), when a validation error is encountered.
+        Defaults to File Upload Error.
+        */
+        msgValidationError?: string;
+        /**
+        the css class for the validation error message displayed in the caption container.
+        Defaults to text-danger.
+        */
+        msgValidationErrorClass?: string;
+        /**
+        the icon to be displayed before the validation error in the caption container.
+        Defaults to <i class="glyphicon glyphicon-exclamation-sign"></i>
+        */
+        msgValidationErrorIcon?: string;
+        /**
+        the css class for the error message to be displayed in the preview window when the file size exceeds maxSize.
+        Defaults to file-error-message.
+        */
+        msgErrorClass?: string;
+        /**
+        the message displayed when the files are getting read and loaded for preview.
+        Defaults to
+            Loading file {index} of {files} …
+        The following special variables will be replaced:
+            {index}: the sequence number of the current file being loaded.
+            {files}: the total number of files selected for upload.
+        */
+        msgLoading?: string;
+        /**
+        the progress message displayed as each file is loaded for preview.
+        Defaults to:
+            Loading file {index} of {files} - {name} - {percent}% completed.
+        The following variables will be replaced:
+            {index}: the sequence number of the current file being loaded.
+            {files}: the total number of files selected for upload.
+            {percent}: the percentage of file read and loaded.
+            {name}: the name of the current file being loaded.
+        */
+        msgProgress?: string;
+        /**
+        the progress message displayed in caption window when multiple (more than one) files are selected.
+        Defaults to:
+            {n} files selected.
+        The following variables will be replaced:
+            {n}: the number of files selected.
+        */
+        msgSelected?: string;
+        /**
+        the message displayed when a folder has been dragged to the drop zone.
+        Defaults to:
+            Drag & drop files only! {n} folder(s) dropped were skipped.
+        The following variables will be replaced:
+            {n}: the number of folders dropped.
+        */
+        msgFoldersNotAllowed?: string;
+        /**
+        the exception message to be displayed when the file selected for preview is an image and its width is less than the minImageWidth setting.
+        Defaults to:
+            Width of image file "{name}" must be at least {size} px.
+        where:
+            {name}: will be replaced by the file name being uploaded.
+            {size}: will be replaced by the minImageWidth setting.
+        */
+        msgImageWidthSmall?: string;
+        /**
+        the exception message to be displayed when the file selected for preview is an image and its height is less than the minImageHeight setting.
+        Defaults to:
+            Height of image file "{name}" must be at least {size} px.
+        where:
+            {name}: will be replaced by the file name being uploaded.
+            {size}: will be replaced by the minImageHeight setting.
+        */
+        msgImageHeightSmall?: string;
+        /**
+        the exception message to be displayed when the file selected for preview is an image and its width exceeds the maxImageWidth setting.
+        Defaults to:
+            Width of image file "{name}" cannot exceed {size} px.
+        where:
+            {name}: will be replaced by the file name being uploaded.
+            {size}: will be replaced by the maxImageWidth setting.
+        */
+        msgImageWidthLarge?: string;
+        /**
+        the exception message to be displayed when the file selected for preview is an image and its height exceeds the maxImageHeight setting.
+        Defaults to:
+            Height of image file "{name}" cannot exceed {size} px.
+        where:
+            {name}: will be replaced by the file name being uploaded.
+            {size}: will be replaced by the maxImageHeight setting.
+        */
+        msgImageHeightLarge?: string;
+        /**
+        the upload progress bar CSS class to be applied when AJAX upload is in process (applicable only for ajax uploads).
+        Defaults to progress-bar progress-bar-success progress-bar-striped active.
+        */
+        progressClass?: string;
+        /**
+        the upload progress bar CSS class to be applied when AJAX upload is in process (applicable only for ajax uploads).
+        Defaults to progress-bar progress-bar-success progress-bar-striped active.
+        */
+        progressCompleteClass?: string;
+        /**
+        the upload progress bar CSS class to be applied when AJAX upload is cancelled or aborted.
+        Defaults to progress-bar progress-bar-danger.
+        */
+        progressErrorClass?: string;
+        /**
+        the type of files that are to be displayed in the preview window.
+        Defaults to image.
+        Can be one of the following:
+            image: Only image type files will be shown in preview.
+            text: Only text type files will be shown in preview.
+            any: Both image and text files content will be shown in preview.
+        Files other than image or text will be displayed as a thumbnail with the filename in the preview window.
+        */
+        previewFileType?: "image" | "text" | "any";
+        /**
+        the icon for zooming the file content in a new modal dialog.
+        This is currently applicable only for text file previews.
+        Defaults to <i class="glyphicon glyphicon-zoom-in"></i>
+        */
+        zoomIndicator?: string;
+        /**
+        the identifier for the container element displaying the error (e.g. '#id').
+        If not set, will default to the container with CSS class kv-fileinput-error inside the preview container (identified by elPreviewContainer).
+        The msgErrorClass will be automatically appended to this container before displaying the error.
+        */
+        elErrorContainer?: string;
+        /**
+        the identifier for the container element containing the caption (e.g. '#id').
+        If not set, will default to the container with CSS class file-caption inside the main plugin container.
+        */
+        elCaptionContainer?: string;
+        /**
+        the identifier for the container element containing the caption text (e.g. '#id').
+        If not set, will default to the container with CSS class file-caption-name inside the main plugin container.
+        */
+        elCaptionText?: string;
+        /**
+        the identifier for the container element containing the preview (e.g. '#id').
+        If not set, will default to the container with CSS class file-preview inside the main plugin container.
+        */
+        elPreviewContainer?: string;
+        /**
+        the identifier for the element containing the preview image thumbnails (e.g. '#id').
+        If not set, will default to the container with CSS class file-preview-thumbnails inside the main plugin container.
+        */
+        elPreviewImage?: string;
+        /**
+        the identifier for the element containing the preview progress status (e.g. '#id').
+        If not set, will default to the container with CSS class file-preview-status inside the main plugin container.
+        */
+        elPreviewStatus?: string;
+        /**
+        a callback to convert the filename as a slug string eliminating special characters.
+        If not set, it will use the plugin's own internal slugDefault method.
+        This callback function includes the filename as parameter and must return a converted filename string.
+        */
+        slugCallback?: (filename: string) => string;
+        /**
+        whether to enable a drag and drop zone for dragging and dropping files to.
+        This is available only for ajax based uploads.
+        Defaults to true.
+        */
+        dropZoneEnabled?: boolean;
+        /**
+        title to be displayed in the drag and drop zone.
+        This is available only for ajax based uploads.
+        Defaults to:
+            Drag & drop files here ….
+        */
+        dropZoneTitle?: string;
+        /**
+        CSS class for the drag & drop zone title.
+        Defaults to file-drop-zone-title.
+        */
+        dropZoneTitleClass?: string;
+        /**
+        configuration for setting up file actions for newly selected file thumbnails in the preview window.
+        */
+        fileActionsettings?: FileActionSettings;
+        /**
+        markup for additional action buttons to display within the initial preview thumbnails (for example displaying an image edit button).
+        The following tag can be used in the markup and will be automatically replaced:
+            {dataKey}: Will be replaced with the key set within initialPreviewConfig.
+        */
+        otherActionButtons?: string;
+        /**
+        the encoding to be used while reading a text file.
+        Applicable only for previewing text files.
+        Defaults to UTF-8.
+        */
+        textEncoding?: string;
+        /**
+        additional ajax settings to pass to the plugin before submitting the ajax request for upload.
+        Applicable only for ajax uploads.
+        This can be useful to pass additional tokens to headers or one can use it for setting other ajax options for advanced cases.
+        Refer the jQuery ajax documentation for the various settings you can configure.
+        */
+        ajaxSettings?: JQueryAjaxSettings;
+        /**
+        additional ajax settings to pass to the plugin before submitting the delete ajax request in each initial preview thumbnail.
+        Applicable only for ajax uploads.
+        This can be useful to pass additional tokens to headers or one can use it for setting other ajax options for advanced cases.
+        Refer the jQuery ajax documentation for the various settings you can configure.
+        */
+        ajaxDeleteSettings?: JQueryAjaxSettings;
+        /**
+        whether to show details of the error stack from the server log when an error is encountered via ajax response.
+        Defaults to true.
+        */
+        showAjaxErrorDetails?: boolean;
+    }
 
-interface IFileUploadLayoutTemplates {
-    /**
-    the template for rendering the widget with caption.
-    The following tags will be parsed and replaced automatically:
-        {class}: the CSS class as set in the mainClass property.
-        {close}: will be replaced with the close (cross) icon (by default on top right of the preview window). The layout template to control this markup is layoutTemplates.close.
-        {preview}: the content parsed by the previewTemplate and will be displayed only if showPreview is true.
-        {caption}: the content parsed by the captionTemplate and will be displayed only if showCaption is true.
-        {remove}: the file remove/clear button and will be displayed only if showRemove is true.
-        {upload}: the file upload button and will be displayed only if showUpload is true.
-        {cancel}: the file upload cancel button that will be displayed when AJAX upload is in process to abort the AJAX upload.
-        {browse}: the main file browse button to select your files for input.
-    */
-    main1?: string;
-    /**
-    the template for rendering the widget without caption.
-    The following tags will be parsed and replaced automatically:
-        {class}: the CSS class as set in the mainClass property.
-        {close}: will be replaced with the close (cross) icon (by default on top right of the preview window). The layout template to control this markup is layoutTemplates.close.
-        {preview}: the content parsed by the previewTemplate and will be displayed only if showPreview is true.
-        {caption}: the content parsed by the captionTemplate and will be displayed only if showCaption is true.
-        {remove}: the file remove/clear button and will be displayed only if showRemove is true.
-        {upload}: the file upload button and will be displayed only if showUpload is true.
-        {cancel}: the file upload cancel button that will be displayed when AJAX upload is in process to abort the AJAX upload.
-        {browse}: the main file browse button to select your files for input.
-    */
-    main2?: string;
-    /**
-    the template for rendering the preview.
-    The following tags will be parsed and replaced automatically:
-        {class}: the CSS class as set in the previewClass property.
-    */
-    preview?: string;
-    /**
-    the icon to render before the caption text.
-    */
-    icon?: string;
-    /**
-    the template for rendering the caption.
-    The following tags will be parsed and replaced automatically:
-        {class}: the CSS class as set in the captionClass property.
-    */
-    caption?: string;
-    /**
-    the template for rendering the modal (for text file preview zooming).
-    */
-    modal?: string;
-    /**
-    the template for the progress bar when upload is in progress (for batch/mass uploads and within each preview thumbnail for async/single uploads).
-    The upload progress bar when displayed within each thumbnail will be wrapped inside a container having a CSS class of `file-thumb-progress`.
-    The following tags will be parsed and replaced automatically:
-        {percent}: will be replaced with the upload progress percentage.
-    */
-    progress?: string;
-    /**
-    the template for the footer section of each file preview thumbnail.
-    The following tags will be parsed and replaced automatically:
-        {actions}: will be replaced with the output of the actions template.
-        {class}: the CSS class as set in the progressClass or progressCompleteClass property (depending on the progress percentage).
-    */
-    footer?: string;
-    /**
-    the template for the file action buttons to be displayed within the thumbnail footer.
-    The following tags will be parsed and replaced automatically:
-        {upload}: will be replaced with the output of the actionUpload template.
-        {delete}: will be replaced with the output of the actionDelete template.
-    */
-    actions?: string;
-    /**
-     the template for the file delete action button within the thumbnail footer.
-    The following tags will be parsed and replaced automatically:
-        {removeClass}: the css class for the remove button. Will be replaced with the removeClass set within fileActionSettings.
-        {removeIcon}: the icon for the remove button. Will be replaced with the removeIcon set within fileActionSettings.
-        {removeTitle}: the title to display on hover for the remove button. Will be replaced with the removeTitle set within fileActionSettings.
-        {dataUrl}: the URL for deleting the file thumbnail for initialPreview content only. Will be replaced with the url set within initialPreviewConfig.
-        {dataKey}: the key (additional data) that will be passed to the URL above via POST to the AJAX call. Will be replaced with the key set within initialPreviewConfig.
-    */
-    actionDelete?: string;
-    /**
-    the template for the file upload action button within the thumbnail footer.
-    The following tags will be parsed and replaced automatically:
-        {uploadClass}: the css class for the upload button. Will be replaced with the uploadClass set within fileActionSettings.
-        {uploadIcon}: the icon for the upload button. Will be replaced with the uploadIcon set within fileActionSettings.
-        {uploadTitle}: the title to display on hover for the upload button. Will be replaced with the uploadTitle set within fileActionSettings.
-    */
-    actionUpload?: string;
-    /**
-    The template for upload, remove, and cancel buttons.
-    The following tags will be parsed and replaced automatically:
-        {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
-        {title}: the title to display on button hover.
-        {css}: the CSS class for the button. This is derived from settings for uploadClass or removeClass or cancelClass.
-        {status}: the disabled status for the button if available (else will be blank).
-        {icon}: the button icon as identified by uploadIcon or removeIcon or cancelIcon.
-        {label}: the button label as identified by uploadLabel or removeLabel or cancelLabel.
-    */
-    btnDefault?: string;
-    /**
-    The template for upload button when used with ajax (i.e. when uploadUrl is set).
-    The following tags will be parsed and replaced automatically:
-        {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
-        {title}: the title to display on button hover.
-        {css}: the CSS class for the button. This is derived from settings for uploadClass.
-        {status}: the disabled status for the button if available (else will be blank).
-        {icon}: the button icon as identified by uploadIcon.
-        {label}: the button label as identified by uploadLabel.
-        {href}: applicable only for Upload button for ajax uploads and will be replaced with the uploadUrl property.
-    */
-    btnLink?: string;
-    /**
-    The template for the browse button.
-        {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
-        {title}: the title to display on button hover.
-        {css}: the CSS class for the button. This is derived from settings for browseClass.
-        {status}: the disabled status for the button if available (else will be blank).
-        {icon}: the button icon as identified by browseIcon.
-        {label}: the button label as identified by browseLabel.
-    */
-    btnBrowse?: string;
-}
+    interface PreviewConfig {
+        /**
+        the caption or filename to display for each initial preview item content.
+        */
+        caption: string;
+        /**
+        the CSS width of the image/ content displayed.
+        */
+        width: string;
+        /**
+         the URL for deleting the image/ content in the initial preview via AJAX post response.This will default to deleteUrl if not set.
+        */
+        url: string;
+        /**
+        the key that will be passed as data to the url via AJAX POST.
+        */
+        key: string | {};
+        /**
+        the additional frame css class to set for the file's thumbnail frame.
+        */
+        frameClass: string;
+        /**
+        the HTML attribute settings (set as key:value pairs) for the thumbnail frame.
+        */
+        frameAttr: {};
+        /**
+        the extra data that will be passed as data to the initial preview delete url / AJAX server call via POST.This will default to deleteExtraData if not set.
+        */
+        extra: {} | Function;
+    }
 
-interface IFileUploadPreviewTemplates {
-    /**
-    the preview template for image files.
-    The following tags will be parsed and replaced automatically:
-        {previewId}: will be replaced with the generated identifier for the preview frame container.
-        {data}: will be replaced with the data source for each preview type.
-        {width}: will be replaced with the width for the file type as set in previewSettings.
-        {height}: will be replaced with the height for the file type as set in previewSettings.
-        {caption}: will be replaced with the file name.
-        {type}: will be replaced with the file type.
-    */
-    image?: string;
-    /**
-    the preview template for text files.
-    The following tags will be parsed and replaced automatically:
-        {previewId}: will be replaced with the generated identifier for the preview frame container.
-        {data}: will be replaced with the data source for each preview type.
-        {width}: will be replaced with the width for the file type as set in previewSettings.
-        {height}: will be replaced with the height for the file type as set in previewSettings.
-        {caption}: will be replaced with the file name.
-        {type}: will be replaced with the file type.
-        {dialog}: Will be replaced with the JS code to launch the modal dialog.
-        {zoomTitle}: This will be replaced with the msgZoomTitle property. This is the title that is displayed on hover of the zoom button (which on clicking will display the text file).
-        {zoomInd}: This will be replaced with the zoomIndicator property. This is the title that is displayed on hover of the zoom button (which on clicking will display the text file).
-        {heading}: This represents the modal dialog heading title. This will be replaced with the msgZoomModalHeading property.
-    */
-    text?: string;
-    /**
-    the preview template for html files.
-    The following tags will be parsed and replaced automatically:
-        {previewId}: will be replaced with the generated identifier for the preview frame container.
-        {data}: will be replaced with the data source for each preview type.
-        {width}: will be replaced with the width for the file type as set in previewSettings.
-        {height}: will be replaced with the height for the file type as set in previewSettings.
-        {caption}: will be replaced with the file name.
-        {type}: will be replaced with the file type.
-    */
-    html?: string;
-    /**
-    the preview template for video files (supported by HTML 5 video tag).
-    The following tags will be parsed and replaced automatically:
-        {previewId}: will be replaced with the generated identifier for the preview frame container.
-        {data}: will be replaced with the data source for each preview type.
-        {width}: will be replaced with the width for the file type as set in previewSettings.
-        {height}: will be replaced with the height for the file type as set in previewSettings.
-        {caption}: will be replaced with the file name.
-        {type}: will be replaced with the file type.
-    */
-    video?: string;
-    /**
-    the preview template for audio files (supported by HTML 5 audio tag).
-    The following tags will be parsed and replaced automatically:
-        {previewId}: will be replaced with the generated identifier for the preview frame container.
-        {data}: will be replaced with the data source for each preview type.
-        {width}: will be replaced with the width for the file type as set in previewSettings.
-        {height}: will be replaced with the height for the file type as set in previewSettings.
-        {caption}: will be replaced with the file name.
-        {type}: will be replaced with the file type.
-    */
-    audio?: string;
-    /**
-    the preview template for flash files (supported currently on webkit browsers).
-    The following tags will be parsed and replaced automatically:
-        {previewId}: will be replaced with the generated identifier for the preview frame container.
-        {data}: will be replaced with the data source for each preview type.
-        {width}: will be replaced with the width for the file type as set in previewSettings.
-        {height}: will be replaced with the height for the file type as set in previewSettings.
-        {caption}: will be replaced with the file name.
-        {type}: will be replaced with the file type.
-    */
-    flash?: string;
-    /**
-    the preview template for all other files - by default treated as object. To disable this behavior, configure the allowedPreviewTypes property.
-    The following tags will be parsed and replaced automatically:
-        {previewId}: will be replaced with the generated identifier for the preview frame container.
-        {data}: will be replaced with the data source for each preview type.
-        {width}: will be replaced with the width for the file type as set in previewSettings.
-        {height}: will be replaced with the height for the file type as set in previewSettings.
-        {caption}: will be replaced with the file name.
-        {type}: will be replaced with the file type.
-    */
-    object?: string;
-    /**
-    this template is used ONLY for rendering the initialPreview markup content passed directly as a raw format.
-    The following tags will be parsed and replaced automatically:
-        {content}: will be replaced with the raw HTML markup as set in initialPreview..
-    */
-    generic?: string;
-}
+    interface LayoutTemplates {
+        /**
+        the template for rendering the widget with caption.
+        The following tags will be parsed and replaced automatically:
+            {class}: the CSS class as set in the mainClass property.
+            {close}: will be replaced with the close (cross) icon (by default on top right of the preview window). The layout template to control this markup is layoutTemplates.close.
+            {preview}: the content parsed by the previewTemplate and will be displayed only if showPreview is true.
+            {caption}: the content parsed by the captionTemplate and will be displayed only if showCaption is true.
+            {remove}: the file remove/clear button and will be displayed only if showRemove is true.
+            {upload}: the file upload button and will be displayed only if showUpload is true.
+            {cancel}: the file upload cancel button that will be displayed when AJAX upload is in process to abort the AJAX upload.
+            {browse}: the main file browse button to select your files for input.
+        */
+        main1?: string;
+        /**
+        the template for rendering the widget without caption.
+        The following tags will be parsed and replaced automatically:
+            {class}: the CSS class as set in the mainClass property.
+            {close}: will be replaced with the close (cross) icon (by default on top right of the preview window). The layout template to control this markup is layoutTemplates.close.
+            {preview}: the content parsed by the previewTemplate and will be displayed only if showPreview is true.
+            {caption}: the content parsed by the captionTemplate and will be displayed only if showCaption is true.
+            {remove}: the file remove/clear button and will be displayed only if showRemove is true.
+            {upload}: the file upload button and will be displayed only if showUpload is true.
+            {cancel}: the file upload cancel button that will be displayed when AJAX upload is in process to abort the AJAX upload.
+            {browse}: the main file browse button to select your files for input.
+        */
+        main2?: string;
+        /**
+        the template for rendering the preview.
+        The following tags will be parsed and replaced automatically:
+            {class}: the CSS class as set in the previewClass property.
+        */
+        preview?: string;
+        /**
+        the icon to render before the caption text.
+        */
+        icon?: string;
+        /**
+        the template for rendering the caption.
+        The following tags will be parsed and replaced automatically:
+            {class}: the CSS class as set in the captionClass property.
+        */
+        caption?: string;
+        /**
+        the template for rendering the modal (for text file preview zooming).
+        */
+        modal?: string;
+        /**
+        the template for the progress bar when upload is in progress (for batch/mass uploads and within each preview thumbnail for async/single uploads).
+        The upload progress bar when displayed within each thumbnail will be wrapped inside a container having a CSS class of `file-thumb-progress`.
+        The following tags will be parsed and replaced automatically:
+            {percent}: will be replaced with the upload progress percentage.
+        */
+        progress?: string;
+        /**
+        the template for the footer section of each file preview thumbnail.
+        The following tags will be parsed and replaced automatically:
+            {actions}: will be replaced with the output of the actions template.
+            {class}: the CSS class as set in the progressClass or progressCompleteClass property (depending on the progress percentage).
+        */
+        footer?: string;
+        /**
+        the template for the file action buttons to be displayed within the thumbnail footer.
+        The following tags will be parsed and replaced automatically:
+            {upload}: will be replaced with the output of the actionUpload template.
+            {delete}: will be replaced with the output of the actionDelete template.
+        */
+        actions?: string;
+        /**
+         the template for the file delete action button within the thumbnail footer.
+        The following tags will be parsed and replaced automatically:
+            {removeClass}: the css class for the remove button. Will be replaced with the removeClass set within fileActionSettings.
+            {removeIcon}: the icon for the remove button. Will be replaced with the removeIcon set within fileActionSettings.
+            {removeTitle}: the title to display on hover for the remove button. Will be replaced with the removeTitle set within fileActionSettings.
+            {dataUrl}: the URL for deleting the file thumbnail for initialPreview content only. Will be replaced with the url set within initialPreviewConfig.
+            {dataKey}: the key (additional data) that will be passed to the URL above via POST to the AJAX call. Will be replaced with the key set within initialPreviewConfig.
+        */
+        actionDelete?: string;
+        /**
+        the template for the file upload action button within the thumbnail footer.
+        The following tags will be parsed and replaced automatically:
+            {uploadClass}: the css class for the upload button. Will be replaced with the uploadClass set within fileActionSettings.
+            {uploadIcon}: the icon for the upload button. Will be replaced with the uploadIcon set within fileActionSettings.
+            {uploadTitle}: the title to display on hover for the upload button. Will be replaced with the uploadTitle set within fileActionSettings.
+        */
+        actionUpload?: string;
+        /**
+        The template for upload, remove, and cancel buttons.
+        The following tags will be parsed and replaced automatically:
+            {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
+            {title}: the title to display on button hover.
+            {css}: the CSS class for the button. This is derived from settings for uploadClass or removeClass or cancelClass.
+            {status}: the disabled status for the button if available (else will be blank).
+            {icon}: the button icon as identified by uploadIcon or removeIcon or cancelIcon.
+            {label}: the button label as identified by uploadLabel or removeLabel or cancelLabel.
+        */
+        btnDefault?: string;
+        /**
+        The template for upload button when used with ajax (i.e. when uploadUrl is set).
+        The following tags will be parsed and replaced automatically:
+            {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
+            {title}: the title to display on button hover.
+            {css}: the CSS class for the button. This is derived from settings for uploadClass.
+            {status}: the disabled status for the button if available (else will be blank).
+            {icon}: the button icon as identified by uploadIcon.
+            {label}: the button label as identified by uploadLabel.
+            {href}: applicable only for Upload button for ajax uploads and will be replaced with the uploadUrl property.
+        */
+        btnLink?: string;
+        /**
+        The template for the browse button.
+            {type}: the HTML button type, defaults to button for most buttons and submit for form based uploads.
+            {title}: the title to display on button hover.
+            {css}: the CSS class for the button. This is derived from settings for browseClass.
+            {status}: the disabled status for the button if available (else will be blank).
+            {icon}: the button icon as identified by browseIcon.
+            {label}: the button label as identified by browseLabel.
+        */
+        btnBrowse?: string;
+    }
 
-interface IFileUploadPreviewSettings {
-    image?: { width?: string; height?: string; };
-    html?: { width?: string; height?: string; };
-    text?: { width?: string; height?: string; };
-    video?: { width?: string; height?: string; };
-    audio?: { width?: string; height?: string; };
-    flash?: { width?: string; height?: string; };
-    object?: { width?: string; height?: string; };
-    other?: { width?: string; height?: string; };
-}
+    interface PreviewTemplates {
+        /**
+        the preview template for image files.
+        The following tags will be parsed and replaced automatically:
+            {previewId}: will be replaced with the generated identifier for the preview frame container.
+            {data}: will be replaced with the data source for each preview type.
+            {width}: will be replaced with the width for the file type as set in previewSettings.
+            {height}: will be replaced with the height for the file type as set in previewSettings.
+            {caption}: will be replaced with the file name.
+            {type}: will be replaced with the file type.
+        */
+        image?: string;
+        /**
+        the preview template for text files.
+        The following tags will be parsed and replaced automatically:
+            {previewId}: will be replaced with the generated identifier for the preview frame container.
+            {data}: will be replaced with the data source for each preview type.
+            {width}: will be replaced with the width for the file type as set in previewSettings.
+            {height}: will be replaced with the height for the file type as set in previewSettings.
+            {caption}: will be replaced with the file name.
+            {type}: will be replaced with the file type.
+            {dialog}: Will be replaced with the JS code to launch the modal dialog.
+            {zoomTitle}: This will be replaced with the msgZoomTitle property. This is the title that is displayed on hover of the zoom button (which on clicking will display the text file).
+            {zoomInd}: This will be replaced with the zoomIndicator property. This is the title that is displayed on hover of the zoom button (which on clicking will display the text file).
+            {heading}: This represents the modal dialog heading title. This will be replaced with the msgZoomModalHeading property.
+        */
+        text?: string;
+        /**
+        the preview template for html files.
+        The following tags will be parsed and replaced automatically:
+            {previewId}: will be replaced with the generated identifier for the preview frame container.
+            {data}: will be replaced with the data source for each preview type.
+            {width}: will be replaced with the width for the file type as set in previewSettings.
+            {height}: will be replaced with the height for the file type as set in previewSettings.
+            {caption}: will be replaced with the file name.
+            {type}: will be replaced with the file type.
+        */
+        html?: string;
+        /**
+        the preview template for video files (supported by HTML 5 video tag).
+        The following tags will be parsed and replaced automatically:
+            {previewId}: will be replaced with the generated identifier for the preview frame container.
+            {data}: will be replaced with the data source for each preview type.
+            {width}: will be replaced with the width for the file type as set in previewSettings.
+            {height}: will be replaced with the height for the file type as set in previewSettings.
+            {caption}: will be replaced with the file name.
+            {type}: will be replaced with the file type.
+        */
+        video?: string;
+        /**
+        the preview template for audio files (supported by HTML 5 audio tag).
+        The following tags will be parsed and replaced automatically:
+            {previewId}: will be replaced with the generated identifier for the preview frame container.
+            {data}: will be replaced with the data source for each preview type.
+            {width}: will be replaced with the width for the file type as set in previewSettings.
+            {height}: will be replaced with the height for the file type as set in previewSettings.
+            {caption}: will be replaced with the file name.
+            {type}: will be replaced with the file type.
+        */
+        audio?: string;
+        /**
+        the preview template for flash files (supported currently on webkit browsers).
+        The following tags will be parsed and replaced automatically:
+            {previewId}: will be replaced with the generated identifier for the preview frame container.
+            {data}: will be replaced with the data source for each preview type.
+            {width}: will be replaced with the width for the file type as set in previewSettings.
+            {height}: will be replaced with the height for the file type as set in previewSettings.
+            {caption}: will be replaced with the file name.
+            {type}: will be replaced with the file type.
+        */
+        flash?: string;
+        /**
+        the preview template for all other files - by default treated as object. To disable this behavior, configure the allowedPreviewTypes property.
+        The following tags will be parsed and replaced automatically:
+            {previewId}: will be replaced with the generated identifier for the preview frame container.
+            {data}: will be replaced with the data source for each preview type.
+            {width}: will be replaced with the width for the file type as set in previewSettings.
+            {height}: will be replaced with the height for the file type as set in previewSettings.
+            {caption}: will be replaced with the file name.
+            {type}: will be replaced with the file type.
+        */
+        object?: string;
+        /**
+        this template is used ONLY for rendering the initialPreview markup content passed directly as a raw format.
+        The following tags will be parsed and replaced automatically:
+            {content}: will be replaced with the raw HTML markup as set in initialPreview..
+        */
+        generic?: string;
+    }
 
-interface IFileUploadFileTypeSettings {
-    image: (vType: string, vName: string) => boolean;
-    html: (vType: string, vName: string) => boolean;
-    text: (vType: string, vName: string) => boolean;
-    video: (vType: string, vName: string) => boolean;
-    audio: (vType: string, vName: string) => boolean;
-    flash: (vType: string, vName: string) => boolean;
-    object: (vType: string, vName: string) => boolean;
-    other: (vType: string, vName: string) => boolean;
-}
+    interface PreviewSettings {
+        image?: { width?: string; height?: string; };
+        html?: { width?: string; height?: string; };
+        text?: { width?: string; height?: string; };
+        video?: { width?: string; height?: string; };
+        audio?: { width?: string; height?: string; };
+        flash?: { width?: string; height?: string; };
+        object?: { width?: string; height?: string; };
+        other?: { width?: string; height?: string; };
+    }
 
-interface IFileUploadPreviewFileIconSettings {
-    [key: string]: string;
-}
+    interface FileTypeSettings {
+        image: (vType: string, vName: string) => boolean;
+        html: (vType: string, vName: string) => boolean;
+        text: (vType: string, vName: string) => boolean;
+        video: (vType: string, vName: string) => boolean;
+        audio: (vType: string, vName: string) => boolean;
+        flash: (vType: string, vName: string) => boolean;
+        object: (vType: string, vName: string) => boolean;
+        other: (vType: string, vName: string) => boolean;
+    }
 
-interface IFileUploadPreviewFileExtSettings {
-    [key: string]: (ext: string) => boolean;
-}
+    interface PreviewFileIconSettings {
+        [key: string]: string;
+    }
 
-interface IFileUploadFileActionSettings {
-    /**
-    icon for remove button to be displayed in each file thumbnail.
-    */
-    removeIcon: string;
-    /**
-    CSS class for the remove button in each file thumbnail.
-    */
-    removeClass: string;
-    /**
-    title for remove button in each file thumbnail.
-    */
-    removeTitle: string;
-    /**
-    icon for upload button to be displayed in each file thumbnail.
-    */
-    uploadIcon: string;
-    /**
-    CSS class for the remove button in each file thumbnail.
-    */
-    uploadClass: string;
-    /**
-    title for remove button in each file thumbnail.
-    */
-    uploadTitle: string;
-    /**
-    an indicator (HTML markup) for new pending upload displayed in each file thumbnail.
-    */
-    indicatorNew: string;
-    /**
-    an indicator (HTML markup) for successful upload displayed in each file thumbnail.
-    */
-    indicatorSuccess: string;
-    /**
-    an indicator (HTML markup) for error in upload displayed in each file thumbnail.
-    */
-    indicatorError: string;
-    /**
-    an indicator (HTML markup) for ongoing upload displayed in each file thumbnail.
-    */
-    indicatorLoading: string;
-    /**
-    title to display on hover of indicator for new pending upload in each file thumbnail.
-    */
-    indicatorNewTitle: string;
-    /**
-    title to display on hover of indicator for successful in each file thumbnail.
-    */
-    indicatorSuccessTitle: string;
-    /**
-    title to display on hover of indicator for error in upload in each file thumbnail.
-    */
-    indicatorErrorTitle: string;
-    /**
-    title to display on hover of indicator for ongoing upload in each file thumbnail.
-    */
-    indicatorLoadingTitle: string;
+    interface PreviewFileExtSettings {
+        [key: string]: (ext: string) => boolean;
+    }
+
+    interface FileActionSettings {
+        /**
+        icon for remove button to be displayed in each file thumbnail.
+        */
+        removeIcon: string;
+        /**
+        CSS class for the remove button in each file thumbnail.
+        */
+        removeClass: string;
+        /**
+        title for remove button in each file thumbnail.
+        */
+        removeTitle: string;
+        /**
+        icon for upload button to be displayed in each file thumbnail.
+        */
+        uploadIcon: string;
+        /**
+        CSS class for the remove button in each file thumbnail.
+        */
+        uploadClass: string;
+        /**
+        title for remove button in each file thumbnail.
+        */
+        uploadTitle: string;
+        /**
+        an indicator (HTML markup) for new pending upload displayed in each file thumbnail.
+        */
+        indicatorNew: string;
+        /**
+        an indicator (HTML markup) for successful upload displayed in each file thumbnail.
+        */
+        indicatorSuccess: string;
+        /**
+        an indicator (HTML markup) for error in upload displayed in each file thumbnail.
+        */
+        indicatorError: string;
+        /**
+        an indicator (HTML markup) for ongoing upload displayed in each file thumbnail.
+        */
+        indicatorLoading: string;
+        /**
+        title to display on hover of indicator for new pending upload in each file thumbnail.
+        */
+        indicatorNewTitle: string;
+        /**
+        title to display on hover of indicator for successful in each file thumbnail.
+        */
+        indicatorSuccessTitle: string;
+        /**
+        title to display on hover of indicator for error in upload in each file thumbnail.
+        */
+        indicatorErrorTitle: string;
+        /**
+        title to display on hover of indicator for ongoing upload in each file thumbnail.
+        */
+        indicatorLoadingTitle: string;
+    }
 }
\ No newline at end of file

From a1a15346625f2f8d009d6e468d3025b2813ddedd Mon Sep 17 00:00:00 2001
From: CheCoxshall <che.coxshall@xerox.com>
Date: Fri, 1 Apr 2016 22:31:39 +0100
Subject: [PATCH 025/278] Added JQuery Reference

---
 bootstrap-fileinput/bootstrap-fileinput.d.ts | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/bootstrap-fileinput/bootstrap-fileinput.d.ts b/bootstrap-fileinput/bootstrap-fileinput.d.ts
index e9d6f0e0d3..fadfadd612 100644
--- a/bootstrap-fileinput/bootstrap-fileinput.d.ts
+++ b/bootstrap-fileinput/bootstrap-fileinput.d.ts
@@ -3,6 +3,8 @@
 // Definitions by: Ché Coxshall <https://github.com/CheCoxshall>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
+/// <reference path="../jquery/jquery.d.ts" />
+
 interface JQuery {
     fileinput: (options?: BootstrapFileInput.FileInputOptions) => JQuery;
 }

From ff0f1a4bd30f6070676e76a7b9c9adbc7bab57f9 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 12:34:53 +1000
Subject: [PATCH 026/278] added basic test file.

---
 revalidator/revalidator-test.ts | 4 ++++
 1 file changed, 4 insertions(+)
 create mode 100644 revalidator/revalidator-test.ts

diff --git a/revalidator/revalidator-test.ts b/revalidator/revalidator-test.ts
new file mode 100644
index 0000000000..3ad56947dc
--- /dev/null
+++ b/revalidator/revalidator-test.ts
@@ -0,0 +1,4 @@
+
+import * as revalidator from 'revalidator';
+
+// revalidator.revalidate(values, this.state.validationSchema, null)
\ No newline at end of file

From adcaa9534f785587096c787f98a990cb1bbb1072 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 12:35:41 +1000
Subject: [PATCH 027/278] Name update.

---
 revalidator/{revalidator-test.ts => revalidator-tests.ts} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename revalidator/{revalidator-test.ts => revalidator-tests.ts} (100%)

diff --git a/revalidator/revalidator-test.ts b/revalidator/revalidator-tests.ts
similarity index 100%
rename from revalidator/revalidator-test.ts
rename to revalidator/revalidator-tests.ts

From e1b48ff99402b979d316472d1daeb2ce51061731 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 12:43:53 +1000
Subject: [PATCH 028/278] Update documentation spec. Update test to include ES5
 typescript import.

---
 revalidator/revalidator-tests.ts | 3 +--
 revalidator/revalidator.d.ts     | 2 +-
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/revalidator/revalidator-tests.ts b/revalidator/revalidator-tests.ts
index 3ad56947dc..cc04ed882e 100644
--- a/revalidator/revalidator-tests.ts
+++ b/revalidator/revalidator-tests.ts
@@ -1,4 +1,3 @@
-
-import * as revalidator from 'revalidator';
+/// <reference path="./revalidator.d.ts" />
 
 // revalidator.revalidate(values, this.state.validationSchema, null)
\ No newline at end of file
diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
index b41e7cd03e..3d011f2f99 100644
--- a/revalidator/revalidator.d.ts
+++ b/revalidator/revalidator.d.ts
@@ -1,5 +1,5 @@
 // Type definitions for revalidator 0.3.1
-
+// Project: https://github.com/flatiron/revalidator
 // Definitions by:  Jason Turner<https://github.com/brewsoftware>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 

From 177e37a21b894e7b84e480b1602e403de535b808 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 12:46:43 +1000
Subject: [PATCH 029/278] Removed white space in name.

---
 revalidator/revalidator.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
index 3d011f2f99..93d2e105a5 100644
--- a/revalidator/revalidator.d.ts
+++ b/revalidator/revalidator.d.ts
@@ -1,6 +1,6 @@
 // Type definitions for revalidator 0.3.1
 // Project: https://github.com/flatiron/revalidator
-// Definitions by:  Jason Turner<https://github.com/brewsoftware>
+// Definitions by: Jason Turner<https://github.com/brewsoftware>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare module Revalidator {

From b171677b5a1d9090d6b39c602dcaf8ed5f44f4c4 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 12:49:00 +1000
Subject: [PATCH 030/278] whitespace fixup

---
 revalidator/revalidator.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
index 93d2e105a5..4b6511f959 100644
--- a/revalidator/revalidator.d.ts
+++ b/revalidator/revalidator.d.ts
@@ -1,6 +1,6 @@
 // Type definitions for revalidator 0.3.1
 // Project: https://github.com/flatiron/revalidator
-// Definitions by: Jason Turner<https://github.com/brewsoftware>
+// Definitions by: Jason Turner <https://github.com/brewsoftware>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare module Revalidator {

From 518321e8e56797447adcdae5942db0f3c3699030 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 12:59:02 +1000
Subject: [PATCH 031/278] Added basic schema information.

---
 revalidator/revalidator.d.ts | 29 ++++++++++++++++++++++++++++-
 1 file changed, 28 insertions(+), 1 deletion(-)

diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
index 4b6511f959..b06bf7cce9 100644
--- a/revalidator/revalidator.d.ts
+++ b/revalidator/revalidator.d.ts
@@ -5,7 +5,34 @@
 
 declare module Revalidator {
     interface RevalidatorStatic {
-        validate(object: any, schema: any, options: any): any;
+        validate(object: any, schema: ISchema, options: any): IReturnMessage;
+    }
+
+    interface IReturnMessage {
+        valid: boolean;
+        errors: string[];
+    }
+
+    interface ISchema {
+        required?: boolean;
+        type: string;
+        pattern?: any;
+        maxLength?: number;
+        minLength?: number;
+        minimum?: number;
+        maximum?: number;
+        allowEmpty: boolean;
+        exclusiveMinimum: number;
+        exclusiveMaximum?: number;
+        divisibleBy?: number;
+        minItems?: number;
+        maxItems?: number;
+        uniqueItems?: boolean;
+        enum?: any;
+        format?: string;
+        conform?: (data) => boolean;
+        depdendencies?: string;
+
     }
 }
 

From 2a6fd2e66684be68a5d0998829431c55e16a8c77 Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 13:03:54 +1000
Subject: [PATCH 032/278] updated based on feedback.

---
 revalidator/revalidator-tests.ts | 2 +-
 revalidator/revalidator.d.ts     | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/revalidator/revalidator-tests.ts b/revalidator/revalidator-tests.ts
index cc04ed882e..b65c9f971b 100644
--- a/revalidator/revalidator-tests.ts
+++ b/revalidator/revalidator-tests.ts
@@ -1,3 +1,3 @@
 /// <reference path="./revalidator.d.ts" />
 
-// revalidator.revalidate(values, this.state.validationSchema, null)
\ No newline at end of file
+revalidator.validate(null, null, null);
\ No newline at end of file
diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
index b06bf7cce9..c1e03207b4 100644
--- a/revalidator/revalidator.d.ts
+++ b/revalidator/revalidator.d.ts
@@ -30,7 +30,7 @@ declare module Revalidator {
         uniqueItems?: boolean;
         enum?: any;
         format?: string;
-        conform?: (data) => boolean;
+        conform?: (data:any) => boolean;
         depdendencies?: string;
 
     }

From 9a474d26f5dbed29d3ad93d80207356db090504a Mon Sep 17 00:00:00 2001
From: Jason Turner <jturner@liberty.com.au>
Date: Mon, 4 Apr 2016 14:41:09 +1000
Subject: [PATCH 033/278] Updated error interface from simple strings.

---
 revalidator/revalidator.d.ts | 9 +++++++--
 1 file changed, 7 insertions(+), 2 deletions(-)

diff --git a/revalidator/revalidator.d.ts b/revalidator/revalidator.d.ts
index c1e03207b4..63f492e9c3 100644
--- a/revalidator/revalidator.d.ts
+++ b/revalidator/revalidator.d.ts
@@ -8,9 +8,14 @@ declare module Revalidator {
         validate(object: any, schema: ISchema, options: any): IReturnMessage;
     }
 
+    interface IErrrorProperty {
+        property: string;
+        message: string;
+    }
+
     interface IReturnMessage {
         valid: boolean;
-        errors: string[];
+        errors: IErrrorProperty[];
     }
 
     interface ISchema {
@@ -40,4 +45,4 @@ declare var revalidator: Revalidator.RevalidatorStatic;
 
 declare module "revalidator" {
     export = revalidator;
-}
+}
\ No newline at end of file

From 13be4bad06dacc4c4243a50ad383c2a9e68b6e50 Mon Sep 17 00:00:00 2001
From: Stefan Loikkanen <stefan@ipdg.se>
Date: Tue, 5 Apr 2016 11:44:35 +0200
Subject: [PATCH 034/278] Added optional callback for close function

---
 ws/ws.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/ws/ws.d.ts b/ws/ws.d.ts
index 83ba9dec92..d9a1338d21 100644
--- a/ws/ws.d.ts
+++ b/ws/ws.d.ts
@@ -110,7 +110,7 @@ declare module "ws" {
 
             constructor(options?: IServerOptions, callback?: Function);
 
-            close(): void;
+            close(cb?: () => {}): void;
             handleUpgrade(request: http.ServerRequest, socket: net.Socket,
                           upgradeHead: Buffer, callback: (client: WebSocket) => void): void;
 

From 62e1efd40289dc0e43e48a8da3f7f67081aba509 Mon Sep 17 00:00:00 2001
From: hellopao <qinjia@outlook.com>
Date: Wed, 6 Apr 2016 10:31:21 +0800
Subject: [PATCH 035/278] add definitions for koa-favicon

---
 koa-favicon/koa-favicon-tests.ts | 11 ++++++++++
 koa-favicon/koa-favicon.d.ts     | 35 ++++++++++++++++++++++++++++++++
 2 files changed, 46 insertions(+)
 create mode 100644 koa-favicon/koa-favicon-tests.ts
 create mode 100644 koa-favicon/koa-favicon.d.ts

diff --git a/koa-favicon/koa-favicon-tests.ts b/koa-favicon/koa-favicon-tests.ts
new file mode 100644
index 0000000000..5f2e0ac3f0
--- /dev/null
+++ b/koa-favicon/koa-favicon-tests.ts
@@ -0,0 +1,11 @@
+/// <reference path="../koa/koa.d.ts" />
+/// <reference path="koa-favicon.d.ts" />
+
+import * as Koa from "koa";
+import favicon = require("koa-favicon");
+
+const app = new Koa();
+
+app.use(favicon(__dirname + "/public/favicon.ico"));
+
+app.listen(80)
\ No newline at end of file
diff --git a/koa-favicon/koa-favicon.d.ts b/koa-favicon/koa-favicon.d.ts
new file mode 100644
index 0000000000..618683fc76
--- /dev/null
+++ b/koa-favicon/koa-favicon.d.ts
@@ -0,0 +1,35 @@
+// Type definitions for koa-favicon v2.x
+// Project: https://github.com/koajs/favicon
+// Definitions by: Jerry Chin <https://github.com/hellopao/>
+// Definitions: https://github.com/hellopao/DefinitelyTyped
+
+/* =================== USAGE ===================
+
+    import favicon = require("koa-favicon");
+    var Koa = require('koa');
+
+    var app = new Koa();
+    app.use(favicon(__dirname + '/public/favicon.ico'));
+
+ =============================================== */
+
+/// <reference path="../koa/koa.d.ts" />
+
+declare module "koa-favicon" {
+
+    import * as Koa from "koa";
+
+    /**
+     * Returns a middleware serving the favicon found on the given path.
+     */
+    function favicon(path: string, options?: {
+
+        /**
+         * cache-control max-age directive in ms, defaulting to 1 day.
+         */
+        maxage?: number;
+
+    }): { (ctx: Koa.Context, next?: () => any): any };
+
+    export = favicon;
+}

From e0f099ceb4832670df7cb31305d80aaa87f7ad5b Mon Sep 17 00:00:00 2001
From: hellopao <qinjia@outlook.com>
Date: Thu, 7 Apr 2016 10:25:53 +0800
Subject: [PATCH 036/278] add difinitions for koa-compress

---
 koa-compress/koa-compress-tests.ts | 16 ++++++++++++
 koa-compress/koa-compress.d.ts     | 41 ++++++++++++++++++++++++++++++
 2 files changed, 57 insertions(+)
 create mode 100644 koa-compress/koa-compress-tests.ts
 create mode 100644 koa-compress/koa-compress.d.ts

diff --git a/koa-compress/koa-compress-tests.ts b/koa-compress/koa-compress-tests.ts
new file mode 100644
index 0000000000..564fd53e2c
--- /dev/null
+++ b/koa-compress/koa-compress-tests.ts
@@ -0,0 +1,16 @@
+/// <reference path="../koa/koa.d.ts" />
+/// <reference path="koa-compress.d.ts" />
+
+import * as Koa from "koa";
+import compress = require("koa-compress");
+
+const app = new Koa();
+
+app.use(compress({
+    filter: (ctype) => {
+        return /text/i.test(ctype)
+    },
+    threshold: 2048
+}));
+
+app.listen(80)
\ No newline at end of file
diff --git a/koa-compress/koa-compress.d.ts b/koa-compress/koa-compress.d.ts
new file mode 100644
index 0000000000..3a6b7e09e1
--- /dev/null
+++ b/koa-compress/koa-compress.d.ts
@@ -0,0 +1,41 @@
+// Type definitions for koa-compress v2.x
+// Project: https://github.com/koajs/compress
+// Definitions by: Jerry Chin <https://github.com/hellopao/>
+// Definitions: https://github.com/hellopao/DefinitelyTyped
+
+/* =================== USAGE ===================
+
+    import compress = require("koa-compress");
+    var Koa = require('koa');
+
+    var app = new Koa();
+    app.use(compress());
+
+ =============================================== */
+/// <reference path="../node/node.d.ts" />
+/// <reference path="../koa/koa.d.ts" />
+
+declare module "koa-compress" {
+
+    import * as Koa from "koa";
+    import * as zlib from "zlib";
+
+    interface ICompressOptions extends zlib.ZlibOptions {
+        /**
+         * An optional function that checks the response content type to decide whether to compress. By default, it uses compressible.
+         */
+        filter?: (content_type: string) => boolean;
+
+        /**
+         * Minimum response size in bytes to compress. Default 1024 bytes or 1kb.
+         */
+        threshold?: number
+    }
+    
+    /**
+     * Compress middleware for Koa
+     */
+    function compress(options?: ICompressOptions): { (ctx: Koa.Context, next?: () => any): any };
+
+    export = compress;
+}

From 4aed26de3226553d767d1a5ff65296f3e89c2077 Mon Sep 17 00:00:00 2001
From: Xie Jingyang <136419808@qq.com>
Date: Sat, 9 Apr 2016 22:30:11 +0800
Subject: [PATCH 037/278] Create echarts.d.ts

some properties not complete
---
 echarts/echarts.d.ts | 111 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 111 insertions(+)
 create mode 100644 echarts/echarts.d.ts

diff --git a/echarts/echarts.d.ts b/echarts/echarts.d.ts
new file mode 100644
index 0000000000..09f04ca6ef
--- /dev/null
+++ b/echarts/echarts.d.ts
@@ -0,0 +1,111 @@
+// Type definitions for echarts
+// Project: http://echarts.baidu.com/
+// Definitions by: Xie Jingyang <https://github.com/xieisabug>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare namespace ECharts {
+    function init(dom:HTMLDivElement|HTMLCanvasElement, theme?:Object|string, opts?:{
+        devicePixelRatio?: number
+        renderer?: string
+    }): ECharts;
+    function connect(group:string|Array<string>);
+    function disConnect(group:string);
+    function dispose(target: ECharts|HTMLDivElement|HTMLCanvasElement);
+    function getInstanceByDom(target: HTMLDivElement|HTMLCanvasElement);
+    function registerMap(mapName: string, geoJson: Object, specialAreas?: Object);
+    function registerTheme(themeName: string, theme: Object);
+
+    class ECharts {
+        group:string;
+        setOption(option: EChartOption, notMerge?: boolean, notRefreshImmediately?: boolean)
+        getWidth(): number
+        getHeight(): number
+        getDom(): HTMLCanvasElement|HTMLDivElement
+        getOption(): Object
+        resize()
+        dispatchAction(payload: Object)
+        on(eventName: string, handler: Function, context?: Object)
+        off(eventName: string, handler?: Function)
+        showLoading(type?: string, opts?: Object)
+        hideLoading()
+        getDataURL(opts: {
+            // 导出的格式，可选 png, jpeg
+            type?: string,
+            // 导出的图片分辨率比例，默认为 1。
+            pixelRatio?: number,
+            // 导出的图片背景色，默认使用 option 里的 backgroundColor
+            backgroundColor?: string
+        }):string
+        getConnectedDataURL(opts: {
+            // 导出的格式，可选 png, jpeg
+            type: string,
+            // 导出的图片分辨率比例，默认为 1。
+            pixelRatio: number,
+            // 导出的图片背景色，默认使用 option 里的 backgroundColor
+            backgroundColor: string
+        }): string
+        clear()
+        isDisposed(): boolean
+        dispose()
+    }
+
+    interface EChartOption {
+        title?: EChartTitleOption
+        legend?: Object,
+        grid?: Object,
+        xAxis?: Object,
+        yAxis?: Object,
+        polar?: Object,
+        radiusAxis?: Object,
+        angleAxis?: Object,
+        radar?: Object,
+        dataZoom?: Array<Object>,
+        visualMap?: Array<Object>,
+        tooltip?: Object,
+        toolbox?: Object,
+        geo?: Object,
+        parallel?: Object,
+        parallelAxis?: Object,
+        timeline?: Object,
+        series?: Array<Object>,
+        color?: Array<Object>,
+        backgroundColor?: string,
+        textStyle?: Object,
+        animation?: boolean,
+        animationDuration?: number,
+        animationEasing?: string,
+        animationDurationUpdate?: number,
+        animationEasingUpdate?: string
+    }
+
+    interface EChartTitleOption {
+        show?: boolean;
+        text?: string;
+        link?: string,
+        target?: string,
+        textStyle?: Object,
+        subtext?: string,
+        sublink?: string,
+        subtarget?: string,
+        subtextStyle?: Object,
+        padding?: number,
+        itemGap?: number,
+        zlevel?: number,
+        z?: number,
+        left?: string,
+        top?: string,
+        right?: string,
+        bottom?: string,
+        backgroundColor?: string,
+        borderColor?: string,
+        borderWidth?: number,
+        shadowBlur?: number,
+        shadowColor?: number,
+        shadowOffsetX?: number,
+        shadowOffsetY?: number,
+    }
+}
+
+declare module "echarts" {
+    export = ECharts;
+}

From 3305eb6f74a2de17d208dfaaa20d69cfb912f871 Mon Sep 17 00:00:00 2001
From: Xie Jingyang <136419808@qq.com>
Date: Sat, 9 Apr 2016 22:44:19 +0800
Subject: [PATCH 038/278] Update echarts.d.ts

---
 echarts/echarts.d.ts | 70 +++++++++++++++++++++++++++++---------------
 1 file changed, 46 insertions(+), 24 deletions(-)

diff --git a/echarts/echarts.d.ts b/echarts/echarts.d.ts
index 09f04ca6ef..f460a9eaca 100644
--- a/echarts/echarts.d.ts
+++ b/echarts/echarts.d.ts
@@ -7,28 +7,46 @@ declare namespace ECharts {
     function init(dom:HTMLDivElement|HTMLCanvasElement, theme?:Object|string, opts?:{
         devicePixelRatio?: number
         renderer?: string
-    }): ECharts;
-    function connect(group:string|Array<string>);
-    function disConnect(group:string);
-    function dispose(target: ECharts|HTMLDivElement|HTMLCanvasElement);
-    function getInstanceByDom(target: HTMLDivElement|HTMLCanvasElement);
-    function registerMap(mapName: string, geoJson: Object, specialAreas?: Object);
-    function registerTheme(themeName: string, theme: Object);
+    }):ECharts;
+
+    function connect(group:string|Array<string>):void;
+
+    function disConnect(group:string):void;
+
+    function dispose(target:ECharts|HTMLDivElement|HTMLCanvasElement):void;
+
+    function getInstanceByDom(target:HTMLDivElement|HTMLCanvasElement):void;
+
+    function registerMap(mapName:string, geoJson:Object, specialAreas?:Object):void;
+
+    function registerTheme(themeName:string, theme:Object):void;
 
     class ECharts {
         group:string;
-        setOption(option: EChartOption, notMerge?: boolean, notRefreshImmediately?: boolean)
-        getWidth(): number
-        getHeight(): number
-        getDom(): HTMLCanvasElement|HTMLDivElement
-        getOption(): Object
-        resize()
-        dispatchAction(payload: Object)
-        on(eventName: string, handler: Function, context?: Object)
-        off(eventName: string, handler?: Function)
-        showLoading(type?: string, opts?: Object)
-        hideLoading()
-        getDataURL(opts: {
+
+        setOption(option:EChartOption, notMerge?:boolean, notRefreshImmediately?:boolean):void
+
+        getWidth():number
+
+        getHeight():number
+
+        getDom():HTMLCanvasElement|HTMLDivElement
+
+        getOption():Object
+
+        resize():void
+
+        dispatchAction(payload:Object):void
+
+        on(eventName:string, handler:Function, context?:Object):void
+
+        off(eventName:string, handler?:Function):void
+
+        showLoading(type?:string, opts?:Object):void
+
+        hideLoading():void
+
+        getDataURL(opts:{
             // 导出的格式，可选 png, jpeg
             type?: string,
             // 导出的图片分辨率比例，默认为 1。
@@ -36,17 +54,21 @@ declare namespace ECharts {
             // 导出的图片背景色，默认使用 option 里的 backgroundColor
             backgroundColor?: string
         }):string
-        getConnectedDataURL(opts: {
+
+        getConnectedDataURL(opts:{
             // 导出的格式，可选 png, jpeg
             type: string,
             // 导出的图片分辨率比例，默认为 1。
             pixelRatio: number,
             // 导出的图片背景色，默认使用 option 里的 backgroundColor
             backgroundColor: string
-        }): string
-        clear()
-        isDisposed(): boolean
-        dispose()
+        }):string
+
+        clear():void
+
+        isDisposed():boolean
+
+        dispose():void
     }
 
     interface EChartOption {

From 8a9ea7db630d55ebfb3733b390baa498b0998f0e Mon Sep 17 00:00:00 2001
From: Erik Krogh Kristensen <erik@webbies.dk>
Date: Tue, 12 Apr 2016 13:47:35 +0200
Subject: [PATCH 039/278] Backbone: Make doesn't exists anymore. See changelog
 from for version 0.9.10 (View#make has been removed. You'll need to use $
 directly to construct DOM elements now.)

---
 backbone/backbone-global.d.ts | 1 -
 1 file changed, 1 deletion(-)

diff --git a/backbone/backbone-global.d.ts b/backbone/backbone-global.d.ts
index be849cee04..4c8cf514ba 100644
--- a/backbone/backbone-global.d.ts
+++ b/backbone/backbone-global.d.ts
@@ -368,7 +368,6 @@ declare namespace Backbone {
         $(selector: any): JQuery;
         render(): View<TModel>;
         remove(): View<TModel>;
-        make(tagName: any, attributes?: any, content?: any): any;
         delegateEvents(events?: EventsHash): any;
         delegate(eventName: string, selector: string, listener: Function): View<TModel>;
         undelegateEvents(): any;

From 03022b7d8f0edbc86a9bbb1948c5df780e715ed8 Mon Sep 17 00:00:00 2001
From: Erik Krogh Kristensen <erik@webbies.dk>
Date: Tue, 12 Apr 2016 14:06:44 +0200
Subject: [PATCH 040/278] Backbone: Model#change doesn't exist either #8951

---
 backbone/backbone-global.d.ts | 1 -
 1 file changed, 1 deletion(-)

diff --git a/backbone/backbone-global.d.ts b/backbone/backbone-global.d.ts
index 4c8cf514ba..704d4ada83 100644
--- a/backbone/backbone-global.d.ts
+++ b/backbone/backbone-global.d.ts
@@ -146,7 +146,6 @@ declare namespace Backbone {
         /*private*/ set(attributeName: string, value: any, options?: ModelSetOptions): Model;
         set(obj: any, options?: ModelSetOptions): Model;
 
-        change(): any;
         changedAttributes(attributes?: any): any[];
         clear(options?: Silenceable): any;
         clone(): Model;

From bf0242c3095537ecd471e22004688bcd97292bad Mon Sep 17 00:00:00 2001
From: hellopao <qinjia@outlook.com>
Date: Wed, 13 Apr 2016 09:34:38 +0800
Subject: [PATCH 041/278] Update koa-compress.d.ts

rename the interface
---
 koa-compress/koa-compress.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/koa-compress/koa-compress.d.ts b/koa-compress/koa-compress.d.ts
index 3a6b7e09e1..c4cd2af582 100644
--- a/koa-compress/koa-compress.d.ts
+++ b/koa-compress/koa-compress.d.ts
@@ -20,7 +20,7 @@ declare module "koa-compress" {
     import * as Koa from "koa";
     import * as zlib from "zlib";
 
-    interface ICompressOptions extends zlib.ZlibOptions {
+    interface CompressOptions extends zlib.ZlibOptions {
         /**
          * An optional function that checks the response content type to decide whether to compress. By default, it uses compressible.
          */
@@ -35,7 +35,7 @@ declare module "koa-compress" {
     /**
      * Compress middleware for Koa
      */
-    function compress(options?: ICompressOptions): { (ctx: Koa.Context, next?: () => any): any };
+    function compress(options?: CompressOptions): { (ctx: Koa.Context, next?: () => any): any };
 
     export = compress;
 }

From d0d3a04eadb51b6c725d4163c0e51c7dfa9e5d11 Mon Sep 17 00:00:00 2001
From: cw882 <craigwhitby@gmail.com>
Date: Wed, 13 Apr 2016 16:17:34 +0100
Subject: [PATCH 042/278] Update pathjs.d.ts

Typo. Changed rescure to rescue
---
 pathjs/pathjs.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/pathjs/pathjs.d.ts b/pathjs/pathjs.d.ts
index dd81115df7..6b6193b222 100644
--- a/pathjs/pathjs.d.ts
+++ b/pathjs/pathjs.d.ts
@@ -35,7 +35,7 @@ interface IPath {
 	
 	root(path: string): void;
 	
-	rescure(fn: Function): void;
+	rescue(fn: Function): void;
 	
 	history: IPathHistory;
 	
@@ -50,4 +50,4 @@ interface IPath {
 	routes: IPathRoutes
 }
 
-declare var Path: IPath;
\ No newline at end of file
+declare var Path: IPath;

From 7879e9ca3fef01d7169590126b080cfd5f940c04 Mon Sep 17 00:00:00 2001
From: Atanas Atanasov <nascovt@gmail.com>
Date: Sun, 17 Apr 2016 18:14:51 +0300
Subject: [PATCH 043/278] Create grid.d.ts

---
 gijgo/grid.d.ts | 4 ++++
 1 file changed, 4 insertions(+)
 create mode 100644 gijgo/grid.d.ts

diff --git a/gijgo/grid.d.ts b/gijgo/grid.d.ts
new file mode 100644
index 0000000000..5a5faf4840
--- /dev/null
+++ b/gijgo/grid.d.ts
@@ -0,0 +1,4 @@
+// Type definitions for Gijgo v0.6.2
+// Project: http://gijgo.com
+// Definitions by: Atanas Atanasov <https://github.com/atatanasov>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped

From 883efbaf351963ee373edd7cfeb55b7864eea688 Mon Sep 17 00:00:00 2001
From: Brad Zacher <brad.zacher@gmail.com>
Date: Fri, 22 Apr 2016 23:33:16 +0930
Subject: [PATCH 044/278] added material-design-lite definition and tests

---
 .../material-design-lite-tests.ts             |  38 ++++++
 .../material-design-lite.d.ts                 | 128 ++++++++++++++++++
 2 files changed, 166 insertions(+)
 create mode 100644 material-design-lite/material-design-lite-tests.ts
 create mode 100644 material-design-lite/material-design-lite.d.ts

diff --git a/material-design-lite/material-design-lite-tests.ts b/material-design-lite/material-design-lite-tests.ts
new file mode 100644
index 0000000000..afbf5faf15
--- /dev/null
+++ b/material-design-lite/material-design-lite-tests.ts
@@ -0,0 +1,38 @@
+// Test file for Google Maps JavaScript API Definition file
+/// <reference path="material-design-lite.d.ts" />
+
+componentHandler.upgradeDom();
+componentHandler.upgradeDom('MaterialButton');
+componentHandler.upgradeDom('MaterialButton', 'mdl-button');
+
+componentHandler.upgradeElement(document.createElement('div'));
+componentHandler.upgradeElement(document.getElementById('id'));
+componentHandler.upgradeElement(document.getElementsByTagName('button')[0], 'MaterialButton');
+
+componentHandler.upgradeElements(document.getElementsByTagName('div'));
+componentHandler.upgradeElements([document.createElement('div')]);
+componentHandler.upgradeElements(document.querySelectorAll('div.mdl-button'));
+
+componentHandler.upgradeAllRegistered();
+
+componentHandler.registerUpgradedCallback('MaterialButton', function(element : HTMLElement) {});
+
+componentHandler.register({
+    constructor: function(element: HTMLElement) {},
+    classAsString: 'MaterialCheese',
+    cssClass: 'mdl-cheese'
+});
+componentHandler.register({
+    constructor: function(element: HTMLElement) {},
+    classAsString: 'MaterialFoo',
+    cssClass: 'mdl-foo',
+    widget: true
+});
+componentHandler.register({
+    constructor: function(element: HTMLElement) {},
+    classAsString: 'MaterialFoo',
+    cssClass: 'mdl-foo',
+    widget: 'FooBar'
+});
+
+componentHandler.downgradeElements(document.querySelectorAll('div'));
diff --git a/material-design-lite/material-design-lite.d.ts b/material-design-lite/material-design-lite.d.ts
new file mode 100644
index 0000000000..11b93ea792
--- /dev/null
+++ b/material-design-lite/material-design-lite.d.ts
@@ -0,0 +1,128 @@
+// Type definitions for material-design-lite v1.1.3
+// Project: https://getmdl.io
+// Definitions by: Brad Zacher <https://github.com/bradzacher/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module MaterialDesignLite {
+    interface ComponentHandler {
+        /**
+         * Searches existing DOM for elements of our component type and upgrades them
+         * if they have not already been upgraded.
+         */
+        upgradeDom() : void;
+        /**
+         * Searches existing DOM for elements of our component type and upgrades them
+         * if they have not already been upgraded.
+         *
+         * @param {string} jsClass the programatic name of the element class we
+         * need to create a new instance of.
+         */
+        upgradeDom(jsClass : string) : void;
+        /**
+         * Searches existing DOM for elements of our component type and upgrades them
+         * if they have not already been upgraded.
+         *
+         * @param {string} jsClass the programatic name of the element class we
+         * need to create a new instance of.
+         * @param {string} cssClass the name of the CSS class elements of this
+         * type will have.
+         */
+        upgradeDom(jsClass : string, cssClass : string) : void;
+
+        /**
+         * Upgrades a specific element rather than all in the DOM.
+         *
+         * @param {!Element} element The element we wish to upgrade.
+         */
+        upgradeElement(element : HTMLElement) : void;
+        /**
+         * Upgrades a specific element rather than all in the DOM.
+         *
+         * @param {!Element} element The element we wish to upgrade.
+         * @param {string} jsClass Optional name of the class we want to upgrade
+         * the element to.
+         */
+        upgradeElement(element : HTMLElement, jsClass : string) : void;
+
+        /**
+         * Upgrades a specific list of elements rather than all in the DOM.
+         *
+         * @param {!Element} elements
+         * The elements we wish to upgrade.
+         */
+        upgradeElements(elements : HTMLElement) : void;
+        /**
+         * Upgrades a specific list of elements rather than all in the DOM.
+         *
+         * @param {!Array<!Element>} elements
+         * The elements we wish to upgrade.
+         */
+        upgradeElements(elements : Array<HTMLElement>) : void;
+        /**
+         * Upgrades a specific list of elements rather than all in the DOM.
+         *
+         * @param {!NodeList} elements
+         * The elements we wish to upgrade.
+         */
+        upgradeElements(elements : NodeList) : void;
+        /**
+         * Upgrades a specific list of elements rather than all in the DOM.
+         *
+         * @param {!HTMLCollection} elements
+         * The elements we wish to upgrade.
+         */
+        upgradeElements(elements : HTMLCollection) : void;
+
+        /**
+         * Upgrades all registered components found in the current DOM. This is
+         * automatically called on window load.
+         */
+        upgradeAllRegistered() : void;
+
+        /**
+         * Allows user to be alerted to any upgrades that are performed for a given
+         * component type
+         *
+         * @param {string} jsClass The class name of the MDL component we wish
+         * to hook into for any upgrades performed.
+         * @param {function(!HTMLElement)} callback The function to call upon an
+         * upgrade. This function should expect 1 parameter - the HTMLElement which
+         * got upgraded.
+         */
+        registerUpgradedCallback(jsClass : string, callback : (element : HTMLElement) => any) : void;
+
+        /**
+         * Registers a class for future use and attempts to upgrade existing DOM.
+         *
+         * @param {componentHandler.ComponentConfigPublic} config the registration configuration
+         */
+        register(config : ComponentConfigPublic) : void;
+
+        /**
+         * Downgrade either a given node, an array of nodes, or a NodeList.
+         *
+         * @param {!Node} nodes The list of nodes.
+         */
+        downgradeElements(nodes : Node) : void;
+        /**
+         * Downgrade either a given node, an array of nodes, or a NodeList.
+         *
+         * @param {!Array<!Node>} nodes The list of nodes.
+         */
+        downgradeElements(nodes : Array<Node>) : void;
+        /**
+         * Downgrade either a given node, an array of nodes, or a NodeList.
+         *
+         * @param {!NodeList} nodes The list of nodes.
+         */
+        downgradeElements(nodes : NodeList) : void;
+    }
+    interface ComponentConfigPublic {
+        constructor(element : HTMLElement) : void;
+        classAsString : string;
+        cssClass : string;
+        widget? : string | boolean;
+    }
+}
+
+declare var componentHandler : MaterialDesignLite.ComponentHandler;
\ No newline at end of file

From c2ca2ca89828b48cb979f3c6ee432f220b909b79 Mon Sep 17 00:00:00 2001
From: Brad Zacher <brad.zacher@gmail.com>
Date: Sat, 23 Apr 2016 10:48:56 +0930
Subject: [PATCH 045/278] adding react-mdl

---
 react-mdl/react-mdl-tests.tsx | 1044 +++++++++++++++++++++++++++++++++
 react-mdl/react-mdl.d.ts      |  606 +++++++++++++++++++
 2 files changed, 1650 insertions(+)
 create mode 100644 react-mdl/react-mdl-tests.tsx
 create mode 100644 react-mdl/react-mdl.d.ts

diff --git a/react-mdl/react-mdl-tests.tsx b/react-mdl/react-mdl-tests.tsx
new file mode 100644
index 0000000000..eb9981092a
--- /dev/null
+++ b/react-mdl/react-mdl-tests.tsx
@@ -0,0 +1,1044 @@
+// Test file for react-mdl Definition file
+/// <reference path="react-mdl.d.ts" />
+
+import React = require('react');
+import {Badge,
+    FABButton, Button, IconButton,
+    Card, CardActions, CardTitle, CardText, CardMenu, CardMedia,
+    Checkbox,
+    DataTable, TableHeader, Table,
+    Dialog, DialogTitle, DialogContent, DialogActions,
+    Grid, Cell,
+    Icon, IconToggle,
+    Layout, Header, Navigation, Drawer, Content, HeaderRow, HeaderTabs, Footer, FooterDropDownSection, FooterLinkList, FooterSection,
+    List, ListItem, ListItemContent, ListItemAction,
+    Menu, MenuItem,
+    ProgressBar,
+    RadioGroup, Radio,
+    Slider,
+    Snackbar,
+    Spinner,
+    Switch,
+    Tabs, Tab,
+    Textfield,
+    Tooltip} from 'react-mdl';
+
+// all tests are from the examples provided here: https://tleunen.github.io/react-mdl/
+
+// Badge tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Number badge on icon */}
+                <Badge text="1" overlap>
+                    <Icon name="account_box" />
+                </Badge>
+
+                {/* Icon badge on icon */}
+                <Badge text="♥" overlap>
+                    <Icon name="account_box" />
+                </Badge>
+                
+                {/* Number badge on text */}
+                <Badge text="4">Inbox</Badge>
+
+                {/* Icon badge without background on text */}
+                <Badge text="♥" noBackground>Mood</Badge>
+            </div>
+        );
+    }
+});
+
+// Button tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Colored FAB button */}
+                <FABButton colored>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Colored FAB button with ripple */}
+                <FABButton colored ripple>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* FAB button */}
+                <FABButton>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* FAB button with ripple */}
+                <FABButton ripple>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Disabled FAB button */}
+                <FABButton disabled>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Mini FAB button */}
+                <FABButton mini>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Colored Mini FAB button */}
+                <FABButton mini colored>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Raised button */}
+                <Button raised>Button</Button>
+
+                {/* Raised button with ripple */}
+                <Button raised ripple>Button</Button>
+
+                {/* Disabled Raised button */}
+                <Button raised disabled>Button</Button>
+
+                {/* Colored Raised button */}
+                <Button raised colored>Button</Button>
+
+                {/* Accent-colored button without ripple */}
+                <Button raised accent>Button</Button>
+
+                {/* Accent-colored button with ripple */}
+                <Button raised accent ripple>Button</Button>
+
+                {/* Flat button */}
+                <Button>Button</Button>
+
+                {/* Flat button with ripple */}
+                <Button ripple>Button</Button>
+
+                {/* Disabled flat button */}
+                <Button disabled>Button</Button>
+
+                {/* Primary colored flat button */}
+                <Button primary>Button</Button>
+
+                {/* Accent-colored flat button */}
+                <Button accent>Button</Button>
+
+                {/* Icon button */}
+                <IconButton name="mood" />
+
+                {/* Colored Icon button */}
+                <IconButton name="mood" colored />
+            </div>
+        );
+    }
+})
+
+// Card tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <Card shadow={0} style={{width: '512px', margin: 'auto'}}>
+                    <CardTitle style={{color: '#fff', height: '176px', background: 'url(http://www.getmdl.io/assets/demos/welcome_card.jpg) center / cover'}}>Welcome</CardTitle>
+                    <CardText>
+                        Lorem ipsum dolor sit amet, consectetur adipiscing elit.
+                        Mauris sagittis pellentesque lacus eleifend lacinia...
+                    </CardText>
+                    <CardActions border>
+                        <Button colored>Get Started</Button>
+                    </CardActions>
+                    <CardMenu style={{color: '#fff'}}>
+                        <IconButton name="share" />
+                    </CardMenu>
+                </Card>
+                
+                <Card shadow={0} style={{width: '320px', height: '320px', margin: 'auto'}}>
+                    <CardTitle expand style={{color: '#fff', background: 'url(http://www.getmdl.io/assets/demos/dog.png) bottom right 15% no-repeat #46B6AC'}}>Update</CardTitle>
+                    <CardText>
+                        Lorem ipsum dolor sit amet, consectetur adipiscing elit.
+                        Aenan convallis.
+                    </CardText>
+                    <CardActions border>
+                        <Button colored>View Updates</Button>
+                    </CardActions>
+                </Card>
+                
+                <Card shadow={0} style={{width: '256px', height: '256px', background: 'url(http://www.getmdl.io/assets/demos/image_card.jpg) center / cover', margin: 'auto'}}>
+                    <CardTitle expand />
+                    <CardActions style={{height: '52px', padding: '16px', background: 'rgba(0,0,0,0.2)'}}>
+                        <span style={{color: '#fff', fontSize: '14px', fontWeight: '500'}}>
+                            Image.jpg
+                        </span>
+                    </CardActions>
+                </Card>
+                
+                <Card shadow={0} style={{width: '256px', height: '256px', background: '#3E4EB8'}}>
+                    <CardTitle expand style={{alignItems: 'flex-start', color: '#fff'}}>
+                        <h4 style={{marginTop: '0'}}>
+                            Featured event:<br />
+                            May 24, 2016<br />
+                            7-11pm
+                        </h4>
+                    </CardTitle>
+                    <CardActions border style={{borderColor: 'rgba(255, 255, 255, 0.2)', display: 'flex', boxSizing: 'border-box', alignItems: 'center', color: '#fff'}}>
+                        <Button colored style={{color: '#fff'}}>Add to Calendar</Button>
+                        <div className="mdl-layout-spacer"></div>
+                        <Icon name="event" />
+                    </CardActions>
+                </Card>
+            </div>
+        );
+    }
+});
+
+// Checkbox tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <Checkbox label="With ripple" ripple defaultChecked />
+
+                <Checkbox label="Without ripple" />
+            </div>
+        );
+    }
+});
+
+// DataTable tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <DataTable
+                    shadow={0}
+                    rows={[
+                        {material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
+                        {material: 'Plywood (Birch)', quantity: 50, price: 1.25},
+                        {material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
+                    ]}
+                >
+                    <TableHeader name="material" tooltip="The amazing material name">Material</TableHeader>
+                    <TableHeader numeric name="quantity" tooltip="Number of materials">Quantity</TableHeader>
+                    <TableHeader numeric name="price" cellFormatter={(price) => `\$${price.toFixed(2)}`} tooltip="Price pet unit">Price</TableHeader>
+                </DataTable>
+
+                <DataTable
+                    selectable
+                    shadow={0}
+                    rowKeyColumn="id"
+                    rows={[
+                        {id: 1001, material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
+                        {id: 1002, material: 'Plywood (Birch)', quantity: 50, price: 1.25},
+                        {id: 1003, material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
+                    ]}
+                >
+                    <TableHeader name="material" tooltip="The amazing material name">Material</TableHeader>
+                    <TableHeader numeric name="quantity" tooltip="Number of materials">Quantity</TableHeader>
+                    <TableHeader numeric name="price" cellFormatter={(price) => `\$${price.toFixed(2)}`} tooltip="Price pet unit">Price</TableHeader>
+                </DataTable>
+
+                <Table
+                    sortable
+                    shadow={0}
+                    rows={[
+                        {material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
+                        {material: 'Plywood (Birch)', quantity: 50, price: 1.25},
+                        {material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
+                    ]}
+                >
+                    <TableHeader
+                        name="material"
+                        sortable
+                        sortFn={(a, b, isAsc) => (isAsc ? a : b).match(/\((.*)\)/)[1].localeCompare((isAsc ? b : a).match(/\((.*)\)/)[1])}
+                        tooltip="The amazing material name"
+                    >
+                        Material
+                    </TableHeader>
+                    <TableHeader
+                        numeric
+                        name="quantity"
+                        tooltip="Number of materials"
+                    >
+                        Quantity
+                    </TableHeader>
+                    <TableHeader
+                        numeric
+                        sortable
+                        name="price"
+                        cellFormatter={(price) => `\$${price.toFixed(2)}`}
+                        tooltip="Price pet unit"
+                    >
+                        Price
+                    </TableHeader>
+                </Table>
+            </div>
+        );
+    }
+});
+
+// Dialog tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div>
+                    <Button colored onClick={this.handleOpenDialog} raised ripple>Show Dialog</Button>
+                    <Dialog open={this.state.openDialog}>
+                    <DialogTitle>Allow data collection?</DialogTitle>
+                    <DialogContent>
+                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
+                    </DialogContent>
+                    <DialogActions>
+                        <Button type='button'>Agree</Button>
+                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
+                    </DialogActions>
+                    </Dialog>
+                </div>
+                
+                <div>
+                    <Button colored onClick={this.handleOpenDialog} raised ripple>Show Modal</Button>
+                    <Dialog open={this.state.openDialog}>
+                    <DialogTitle>Allow this site to collect usage data to improve your experience?</DialogTitle>
+                    <DialogContent>
+                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
+                    </DialogContent>
+                    <DialogActions fullWidth>
+                        <Button type='button'>Agree</Button>
+                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
+                    </DialogActions>
+                    </Dialog>
+                </div>
+                
+                <div>
+                    <Button colored onClick={this.handleOpenDialog} onCancel={this.handleCloseDialog} raised ripple>Show Dialog</Button>
+                    <Dialog open={this.state.openDialog} onCancel={this.handleCloseDialog}>
+                    <DialogTitle>Allow data collection?</DialogTitle>
+                    <DialogContent>
+                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
+                    </DialogContent>
+                    <DialogActions>
+                        <Button type='button'>Agree</Button>
+                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
+                    </DialogActions>
+                    </Dialog>
+                </div>
+            </div>
+        );
+    }
+});
+
+// Grid tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div style={{width: '80%', margin: 'auto'}}>
+                    <Grid className="demo-grid-ruler">
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                    </Grid>
+                    <Grid className="demo-grid-1">
+                        <Cell col={4}>4</Cell>
+                        <Cell col={4}>4</Cell>
+                        <Cell col={4}>4</Cell>
+                    </Grid>
+                    <Grid className="demo-grid-2">
+                        <Cell col={6}>6</Cell>
+                        <Cell col={4}>4</Cell>
+                        <Cell col={2}>2</Cell>
+                    </Grid>
+                    <Grid className="demo-grid-3">
+                        <Cell col={6} tablet={8}>6 (8 tablet)</Cell>
+                        <Cell col={4} tablet={6}>4 (6 tablet)</Cell>
+                        <Cell col={2} phone={4}>2 (4 phone)</Cell>
+                    </Grid>
+                </div>
+            </div>
+        );
+    }
+});
+
+// IconToggle tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <IconToggle ripple id="bold" name="format_bold" defaultChecked />
+
+                <IconToggle id="italic" name="format_italic" />
+            </div>
+        );
+    }
+});
+
+// Layout tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Uses a transparent header that draws on top of the layout's background */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout style={{background: 'url(http://www.getmdl.io/assets/demos/transparent.jpg) center / cover'}}>
+                        <Header transparent title="Title" style={{color: 'white'}}>
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* No header, and the drawer stays open on larger screens (fixed drawer). */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedDrawer>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* Always shows a header, even in smaller screens. */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader>
+                        <Header title={<span><span style={{ color: '#ddd' }}>Area / </span><strong>The Title</strong></span>}>
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* The drawer is always open in large screens. The header is always shown, even in small screens. */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader fixedDrawer>
+                        <Header title="Title">
+                            <Textfield
+                                value=""
+                                onChange={() => {}}
+                                label="Search"
+                                expandable
+                                expandableIcon="search"
+                            />
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* Uses a header that scrolls with the text, rather than staying locked at the top */}
+                <div className="demo-big-content">
+                    <Layout>
+                        <Header title="Title" scroll>
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content>
+                            <div className="page-content" />
+                        </Content>
+                    </Layout>
+                </div>
+
+                {/* Uses a header that contracts as the page scrolls down. */}
+                <div className="demo-big-content">
+                    <Layout>
+                        <Header waterfall>
+                            <HeaderRow title="Title">
+                                <Textfield
+                                    value=""
+                                    onChange={() => {}}
+                                    label="Search"
+                                    expandable
+                                    expandableIcon="search"
+                                />
+                            </HeaderRow>
+                            <HeaderRow>
+                                <Navigation>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                </Navigation>
+                            </HeaderRow>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content>
+                            <div className="page-content" />
+                        </Content>
+                    </Layout>
+                </div>
+
+                {/* Hide the top part of the header when scrolling down */}
+                <div className="demo-big-content">
+                    <Layout>
+                        <Header waterfall hideTop>
+                            <HeaderRow title="Title">
+                                <Textfield
+                                    value=""
+                                    onChange={() => {}}
+                                    label="Search"
+                                    expandable
+                                    expandableIcon="search"
+                                />
+                            </HeaderRow>
+                            <HeaderRow>
+                                <Navigation>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                </Navigation>
+                            </HeaderRow>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content>
+                            <div className="page-content" />
+                        </Content>
+                    </Layout>
+                </div>
+
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader>
+                        <Header>
+                            <HeaderRow title="Title" />
+                            <HeaderTabs activeTab={this.state.activeTab} onChange={(tabId) => this.setState({ activeTab: tabId })}>
+                                <Tab>Tab1</Tab>
+                                <Tab>Tab2</Tab>
+                                <Tab>Tab3</Tab>
+                                <Tab>Tab4</Tab>
+                                <Tab>Tab5</Tab>
+                                <Tab>Tab6</Tab>
+                            </HeaderTabs>
+                        </Header>
+                        <Drawer title="Title" />
+                        <Content>
+                            <div className="page-content">Content for the tab: {this.state.activeTab}</div>
+                        </Content>
+                    </Layout>
+                </div>
+
+                {/* Simple header with fixed tabs. */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader fixedTabs>
+                        <Header>
+                            <HeaderRow title="Title" />
+                            <HeaderTabs activeTab={1} onChange={(tabId) => {}}>
+                                <Tab>Tab1</Tab>
+                                <Tab>Tab2</Tab>
+                                <Tab>Tab3</Tab>
+                            </HeaderTabs>
+                        </Header>
+                        <Drawer title="Title" />
+                        <Content>
+                            <div className="page-content">You can add logic to update the content of this container based on the "activeTab" receive in the `onChange` callback.</div>
+                        </Content>
+                    </Layout>
+                </div>
+
+                <Footer size="mega">
+                    <FooterSection type="middle">
+                        <FooterDropDownSection title="Features">
+                            <FooterLinkList>
+                                <a href="#">About</a>
+                                <a href="#">Terms</a>
+                                <a href="#">Partners</a>
+                                <a href="#">Updates</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                        <FooterDropDownSection title="Details">
+                            <FooterLinkList>
+                                <a href="#">Specs</a>
+                                <a href="#">Tools</a>
+                                <a href="#">Resources</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                        <FooterDropDownSection title="Technology">
+                            <FooterLinkList>
+                                <a href="#">How it works</a>
+                                <a href="#">Patterns</a>
+                                <a href="#">Usage</a>
+                                <a href="#">Products</a>
+                                <a href="#">Contracts</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                        <FooterDropDownSection title="FAQ">
+                            <FooterLinkList>
+                                <a href="#">Questions</a>
+                                <a href="#">Answers</a>
+                                <a href="#">Contact Us</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                    </FooterSection>
+                    <FooterSection type="bottom" logo="Title">
+                        <FooterLinkList>
+                            <a href="#">Help</a>
+                            <a href="#">Privacy & Terms</a>
+                        </FooterLinkList>
+                    </FooterSection>
+                </Footer>
+
+                <Footer size="mini">
+                    <FooterSection type="left" logo="Title">
+                        <FooterLinkList>
+                            <a href="#">Help</a>
+                            <a href="#">Privacy & Terms</a>
+                        </FooterLinkList>
+                    </FooterSection>
+                </Footer>
+            </div>
+        );
+    }
+});
+
+// List tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <List>
+                <ListItem>Bryan Cranston</ListItem>
+                <ListItem>Aaron Paul</ListItem>
+                <ListItem>Bob Odenkirk</ListItem>
+                </List>
+
+                <List>
+                <ListItem>
+                    <ListItemContent icon="person">Bryan Cranston</ListItemContent>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent icon="person">Aaron Paul</ListItemContent>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent icon="person">Bob Odenkirk</ListItemContent>
+                </ListItem>
+                </List>
+
+                <List style={{width: '300px'}}>
+                <ListItem>
+                    <ListItemContent avatar="person">Bryan Cranston</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                </List>
+
+                <List style={{width: '300px'}}>
+                <ListItem>
+                    <ListItemContent avatar="person">Bryan Cranston</ListItemContent>
+                    <ListItemAction>
+                    <Checkbox defaultChecked />
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <Radio value={1} />
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <Switch defaultChecked />
+                    </ListItemAction>
+                </ListItem>
+                </List>
+
+                <List style={{width: '300px'}}>
+                <ListItem twoLine>
+                    <ListItemContent avatar="person" subtitle="62 episodes">Bryan Cranston</ListItemContent>
+                    <ListItemAction info="Actor">
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem twoLine>
+                    <ListItemContent avatar="person" subtitle="62 episodes">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem twoLine>
+                    <ListItemContent avatar="person" subtitle="62 episodes">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                </List>
+
+                <List style={{width: '650px'}}>
+                <ListItem threeLine>
+                    <ListItemContent avatar="person" subtitle="Bryan Cranston played the role of Walter in Breaking Bad. He is also known for playing Hal in Malcom in the Middle.">Bryan Cranston</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem threeLine>
+                    <ListItemContent avatar="person" subtitle="Aaron Paul played the role of Jesse in Breaking Bad. He also featured in the Need For Speed Movie.">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem threeLine>
+                    <ListItemContent avatar="person" subtitle="Bob Odinkrik played the role of Saul in Breaking Bad. Due to public fondness for the character, Bob stars in his own show now, called Better Call Saul.">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                </List>
+            </div>
+        );
+    }
+});
+
+// Menu tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Lower left */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-lower-left" />
+                    <Menu target="demo-menu-lower-left">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+
+                {/* Lower right */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-lower-right" />
+                    <Menu target="demo-menu-lower-right" align="right">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+
+                {/* Top left */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-top-left" />
+                    <Menu target="demo-menu-top-left" valign="top">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+
+                {/* Top right */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-top-right" />
+                    <Menu target="demo-menu-top-right" valign="top" align="right">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+            </div>
+        );
+    }
+});
+
+// ProgressBar tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple Progress Bar */}
+                <ProgressBar progress={44} />
+
+                {/* Progress Bar with Indeterminate Progress */}
+                <ProgressBar indeterminate />
+
+                {/* Progress Bar with Buffering */}
+                <ProgressBar progress={33} buffer={87} />
+            </div>
+        );
+    }
+});
+
+// Radio tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <RadioGroup name="demo" value="opt1">
+                    <Radio value="opt1" ripple>Ripple option</Radio>
+                    <Radio value="opt2">Other option</Radio>
+                </RadioGroup>
+
+                <RadioGroup container="ul" childContainer="li" name="demo2" value="opt2">
+                    <Radio value="opt1" ripple>Ripple option</Radio>
+                    <Radio value="opt2">Other option</Radio>
+                </RadioGroup>
+            </div>
+        );
+    }
+});
+
+// Slider tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Default slider */}
+                <Slider min={0} max={100} defaultValue={0} />
+
+                {/* Slider with initial value */}
+                <Slider min={0} max={100} defaultValue={25} />
+            </div>
+        );
+    }
+});
+
+// Snackbar tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div>
+                    <Button raised style={{backgroundColor: '#FF00FF'}} onClick={this.handleShowSnackbar}>Show a Snackbar</Button>
+                    <Snackbar
+                        active={false}
+                        onClick={this.handleClickActionSnackbar}
+                        onTimeout={this.handleTimeoutSnackbar}
+                        action="Undo">Button color changed.</Snackbar>
+                </div>
+                
+                <div>
+                    <Button raised onClick={this.handleShowSnackbar}>Show a Toast</Button>
+                    <Snackbar
+                        active={true}
+                        onTimeout={this.handleTimeoutSnackbar}>
+                        Lorem ipsum dolor sit amet, consectetur adipiscing elit. Fusce varius luctus quam. Fusce quis blandit libero. Donec accumsan nunc lectus, vel blandit diam bibendum ac. Integer faucibus, lorem et convallis fermentum, diam dolor imperdiet mi, nec iaculis risus mauris id elit. Vivamus vel eros dapibus, molestie ante ut, vestibulum sem.
+                    </Snackbar>
+                </div>
+            </div>
+        );
+    }
+});
+
+// Spinner tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple spinner */}
+                <Spinner />
+
+                {/* Single color spinner */}
+                <Spinner singleColor />
+            </div>
+        );
+    }
+});
+
+// Switch tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <Switch ripple id="switch1" defaultChecked>Ripple switch</Switch>
+
+                <Switch id="switch2">Switch</Switch>
+            </div>
+        );
+    }
+});
+
+// Tab tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div className="demo-tabs">
+                    <Tabs activeTab={this.state.activeTab} onChange={(tabId) => this.setState({ activeTab: tabId })} ripple>
+                        <Tab>Starks</Tab>
+                        <Tab>Lannisters</Tab>
+                        <Tab>Targaryens</Tab>
+                    </Tabs>
+                    <section>
+                        <div className="content">Content for the tab: {this.state.activeTab}</div>
+                    </section>
+                </div> 
+            </div>
+        );
+    }
+});
+
+// Textfield tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple textfield */}
+                <Textfield
+                    onChange={() => {}}
+                    label="Text..."
+                    style={{width: '200px'}}
+                />
+
+                {/* Numeric textfield */}
+                <Textfield
+                    onChange={() => {}}
+                    pattern="-?[0-9]*(\.[0-9]+)?"
+                    error="Input is not a number!"
+                    label="Number..."
+                    style={{width: '200px'}}
+                />
+
+                {/* Textfield with floating label */}
+                <Textfield
+                    onChange={() => {}}
+                    label="Text..."
+                    floatingLabel
+                    style={{width: '200px'}}
+                />
+
+                {/* Numeric Textfield with floating label */}
+                <Textfield
+                    onChange={() => {}}
+                    pattern="-?[0-9]*(\.[0-9]+)?"
+                    error="Input is not a number!"
+                    label="Number..."
+                    floatingLabel
+                />
+            </div>
+        );
+    }
+});
+
+// Tooltip tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple tooltip */}
+                <Tooltip label="Follow">
+                    <Icon name="add" />
+                </Tooltip>
+
+                {/* Large Tooltip */}
+                <Tooltip label="Print" large>
+                    <Icon name="print" />
+                </Tooltip>
+
+                {/* Rich Tooltip */}
+                <Tooltip label={<span>Upload <strong>file.zip</strong></span>}>
+                    <Icon name="cloud_upload" />
+                </Tooltip>
+
+                {/* Multiline Tooltip */}
+                <Tooltip label={<span>Share your content<br />via social media</span>}>
+                    <Icon name="share" />
+                </Tooltip>
+
+                {/* Right Tooltip */}
+                <Tooltip label="Follow" position="right">
+                    <Icon name="arrow_forward" />
+                </Tooltip>
+
+                {/* Left Tooltip */}
+                <Tooltip label="Follow" position="left">
+                    <Icon name="arrow_back" />
+                </Tooltip>
+
+                {/* Top Tooltip */}
+                <Tooltip label="Follow" position="top">
+                    <Icon name="arrow_upward" />
+                </Tooltip>
+
+                {/* Bottom Tooltip */}
+                <Tooltip label="Follow" position="bottom">
+                    <Icon name="arrow_downward" />
+                </Tooltip>
+            </div>
+        );
+    }
+});
diff --git a/react-mdl/react-mdl.d.ts b/react-mdl/react-mdl.d.ts
new file mode 100644
index 0000000000..86516b75f0
--- /dev/null
+++ b/react-mdl/react-mdl.d.ts
@@ -0,0 +1,606 @@
+// Type definitions for react-mdl 1.5.3
+// Project: https://github.com/tleunen/react-mdl
+// Definitions by: Brad Zacher <https://github.com/bradzacher>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../react/react.d.ts" />
+
+declare namespace __ReactMDL {
+    import React = __React;
+    
+    type __MDLClassProps = React.ClassAttributes<any>;
+    type __MDLOtherProps = React.HTMLProps<any>;
+    class __MDLComponent<P extends __MDLClassProps> extends React.Component<P, {}> {}
+    class __MDLBasicComponent extends __MDLComponent<__MDLOtherProps> {}
+    
+    interface ShadowedComponent {
+        shadow ?: number;
+    }
+    interface RippleComponent {
+        ripple ?: boolean;
+    }
+    interface CustomRenderedComponent {
+        component ?: string | JSX.Element | Function;
+    }
+    
+    
+    // HTMLAttributes (minus the 'data', 'icon', 'label', 'name', 'rows', 'size', 'title', 'value' attributes)
+    interface MDLHTMLAttributes {
+        // React-specific Attributes
+        defaultChecked?: boolean;
+        defaultValue?: string | string[];
+
+        // Standard HTML Attributes
+        accept?: string;
+        acceptCharset?: string;
+        accessKey?: string;
+        action?: string;
+        allowFullScreen?: boolean;
+        allowTransparency?: boolean;
+        alt?: string;
+        async?: boolean;
+        autoComplete?: string;
+        autoFocus?: boolean;
+        autoPlay?: boolean;
+        capture?: boolean;
+        cellPadding?: number | string;
+        cellSpacing?: number | string;
+        charSet?: string;
+        challenge?: string;
+        checked?: boolean;
+        classID?: string;
+        className?: string;
+        cols?: number;
+        colSpan?: number;
+        content?: string;
+        contentEditable?: boolean;
+        contextMenu?: string;
+        controls?: boolean;
+        coords?: string;
+        crossOrigin?: string;
+        dateTime?: string;
+        default?: boolean;
+        defer?: boolean;
+        dir?: string;
+        disabled?: boolean;
+        download?: any;
+        draggable?: boolean;
+        encType?: string;
+        form?: string;
+        formAction?: string;
+        formEncType?: string;
+        formMethod?: string;
+        formNoValidate?: boolean;
+        formTarget?: string;
+        frameBorder?: number | string;
+        headers?: string;
+        height?: number | string;
+        hidden?: boolean;
+        high?: number;
+        href?: string;
+        hrefLang?: string;
+        htmlFor?: string;
+        httpEquiv?: string;
+        id?: string;
+        inputMode?: string;
+        integrity?: string;
+        is?: string;
+        keyParams?: string;
+        keyType?: string;
+        kind?: string;
+        lang?: string;
+        list?: string;
+        loop?: boolean;
+        low?: number;
+        manifest?: string;
+        marginHeight?: number;
+        marginWidth?: number;
+        max?: number | string;
+        maxLength?: number;
+        media?: string;
+        mediaGroup?: string;
+        method?: string;
+        min?: number | string;
+        minLength?: number;
+        multiple?: boolean;
+        muted?: boolean;
+        nonce?: string;
+        noValidate?: boolean;
+        open?: boolean;
+        optimum?: number;
+        pattern?: string;
+        placeholder?: string;
+        poster?: string;
+        preload?: string;
+        radioGroup?: string;
+        readOnly?: boolean;
+        rel?: string;
+        required?: boolean;
+        reversed?: boolean;
+        role?: string;
+        rowSpan?: number;
+        sandbox?: string;
+        scope?: string;
+        scoped?: boolean;
+        scrolling?: string;
+        seamless?: boolean;
+        selected?: boolean;
+        shape?: string;
+        sizes?: string;
+        span?: number;
+        spellCheck?: boolean;
+        src?: string;
+        srcDoc?: string;
+        srcLang?: string;
+        srcSet?: string;
+        start?: number;
+        step?: number | string;
+        style?: React.CSSProperties;
+        summary?: string;
+        tabIndex?: number;
+        target?: string;
+        type?: string;
+        useMap?: string;
+        width?: number | string;
+        wmode?: string;
+        wrap?: string;
+
+        // RDFa Attributes
+        about?: string;
+        datatype?: string;
+        inlist?: any;
+        prefix?: string;
+        property?: string;
+        resource?: string;
+        typeof?: string;
+        vocab?: string;
+
+        // Non-standard Attributes
+        autoCapitalize?: string;
+        autoCorrect?: string;
+        autoSave?: string;
+        color?: string;
+        itemProp?: string;
+        itemScope?: boolean;
+        itemType?: string;
+        itemID?: string;
+        itemRef?: string;
+        results?: number;
+        security?: string;
+        unselectable?: boolean;
+
+        // Allows aria- and data- Attributes
+        [key: string]: any;
+    }
+    // DOMAttributes (minus 'onClick', 'onChange')
+    interface MDLDOMAttributes {
+        // DOMAttributes (minus onClick)
+        children?: React.ReactNode;
+        dangerouslySetInnerHTML?: {
+            __html: string;
+        };
+
+        // Clipboard Events
+        onCopy?: React.ClipboardEventHandler;
+        onCut?: React.ClipboardEventHandler;
+        onPaste?: React.ClipboardEventHandler;
+
+        // Composition Events
+        onCompositionEnd?: React.CompositionEventHandler;
+        onCompositionStart?: React.CompositionEventHandler;
+        onCompositionUpdate?: React.CompositionEventHandler;
+
+        // Focus Events
+        onFocus?: React.FocusEventHandler;
+        onBlur?: React.FocusEventHandler;
+
+        // Form Events
+        onInput?: React.FormEventHandler;
+        onSubmit?: React.FormEventHandler;
+
+        // Image Events
+        onLoad?: React.ReactEventHandler;
+        onError?: React.ReactEventHandler; // also a Media Event
+
+        // Keyboard Events
+        onKeyDown?: React.KeyboardEventHandler;
+        onKeyPress?: React.KeyboardEventHandler;
+        onKeyUp?: React.KeyboardEventHandler;
+
+        // Media Events
+        onAbort?: React.ReactEventHandler;
+        onCanPlay?: React.ReactEventHandler;
+        onCanPlayThrough?: React.ReactEventHandler;
+        onDurationChange?: React.ReactEventHandler;
+        onEmptied?: React.ReactEventHandler;
+        onEncrypted?: React.ReactEventHandler;
+        onEnded?: React.ReactEventHandler;
+        onLoadedData?: React.ReactEventHandler;
+        onLoadedMetadata?: React.ReactEventHandler;
+        onLoadStart?: React.ReactEventHandler;
+        onPause?: React.ReactEventHandler;
+        onPlay?: React.ReactEventHandler;
+        onPlaying?: React.ReactEventHandler;
+        onProgress?: React.ReactEventHandler;
+        onRateChange?: React.ReactEventHandler;
+        onSeeked?: React.ReactEventHandler;
+        onSeeking?: React.ReactEventHandler;
+        onStalled?: React.ReactEventHandler;
+        onSuspend?: React.ReactEventHandler;
+        onTimeUpdate?: React.ReactEventHandler;
+        onVolumeChange?: React.ReactEventHandler;
+        onWaiting?: React.ReactEventHandler;
+
+        // MouseEvents
+        onContextMenu?: React.MouseEventHandler;
+        onDoubleClick?: React.MouseEventHandler;
+        onDrag?: React.DragEventHandler;
+        onDragEnd?: React.DragEventHandler;
+        onDragEnter?: React.DragEventHandler;
+        onDragExit?: React.DragEventHandler;
+        onDragLeave?: React.DragEventHandler;
+        onDragOver?: React.DragEventHandler;
+        onDragStart?: React.DragEventHandler;
+        onDrop?: React.DragEventHandler;
+        onMouseDown?: React.MouseEventHandler;
+        onMouseEnter?: React.MouseEventHandler;
+        onMouseLeave?: React.MouseEventHandler;
+        onMouseMove?: React.MouseEventHandler;
+        onMouseOut?: React.MouseEventHandler;
+        onMouseOver?: React.MouseEventHandler;
+        onMouseUp?: React.MouseEventHandler;
+
+        // Selection Events
+        onSelect?: React.ReactEventHandler;
+
+        // Touch Events
+        onTouchCancel?: React.TouchEventHandler;
+        onTouchEnd?: React.TouchEventHandler;
+        onTouchMove?: React.TouchEventHandler;
+        onTouchStart?: React.TouchEventHandler;
+
+        // UI Events
+        onScroll?: React.UIEventHandler;
+
+        // Wheel Events
+        onWheel?: React.WheelEventHandler;
+    }
+    
+    
+    
+    interface BadgeProps extends __MDLClassProps {
+        text: string | number;
+        className ?: string;
+        noBackground ?: boolean;
+        overlap ?: boolean;
+    }
+    class Badge extends __MDLComponent<BadgeProps> {}
+    
+    
+    interface ButtonProps extends __MDLOtherProps, RippleComponent, CustomRenderedComponent {
+        accent ?: boolean;
+        colored ?: boolean;
+        primary ?: boolean;
+    }
+    interface StandardButtonProps extends ButtonProps {
+        raised ?: boolean;
+    }
+    interface FABButtonProps extends ButtonProps {
+        mini ?: boolean;
+    }
+    interface IconButtonProps extends ButtonProps {
+        name ?: string;
+        raised ?: boolean;
+    }
+    class Button extends __MDLComponent<StandardButtonProps> {}
+    class FABButton extends __MDLComponent<FABButtonProps> {}
+    class IconButton extends __MDLComponent<IconButtonProps> {}
+    
+    
+    interface CardProps extends __MDLOtherProps, ShadowedComponent {}
+    interface CardActionProps extends __MDLOtherProps {
+        border ?: boolean;
+    }
+    interface CardTitleProps extends __MDLOtherProps {
+        expand ?: boolean;
+    }
+    class Card extends __MDLComponent<CardProps> {}
+    class CardActions extends __MDLComponent<CardActionProps> {}
+    class CardTitle extends __MDLComponent<CardTitleProps> {}
+    class CardText extends __MDLBasicComponent {}
+    class CardMenu extends __MDLBasicComponent {}
+    class CardMedia extends __MDLBasicComponent {}
+    
+    
+    interface CheckboxProps extends __MDLOtherProps, RippleComponent {
+        checked ?: boolean;
+        disabled ?: boolean;
+        label ?: string;
+    }
+    class Checkbox extends __MDLComponent<CheckboxProps> {}
+    
+    interface UndecoratedTableProps extends __MDLClassProps, MDLHTMLAttributes, React.DOMAttributes, ShadowedComponent {
+        rows: Array<any>;
+        rowKeyColumn ?: string;
+        
+        name ?: string;
+        title ?: string;
+    }
+    interface TableProps extends UndecoratedTableProps {
+        sortable ?: boolean;
+        selectable ?: boolean;
+        onSelectionChanged ?: (row : any) => any;
+    }
+    interface TableHeaderProps extends __MDLClassProps, MDLHTMLAttributes, MDLDOMAttributes {
+        name : string;
+        title ?: string;
+        cellFormatter ?: (value : any, row : any, index : number) => React.ReactNode;
+        numeric ?: boolean;
+        nosort ?: boolean;
+        onClick ?: (e : React.MouseEvent, name : string) => any;
+        sortFn ?: (a : any, b : any, isAsc : boolean) => number;
+        tooltip ?: React.ReactNode;
+    }
+    class Table extends __MDLComponent<TableProps> {}
+    class TableHeader extends __MDLComponent<TableHeaderProps> {}
+    class UndecoratedTable extends __MDLComponent<UndecoratedTableProps> {}
+    class DataTable extends Table {}
+    
+    
+    interface DialogProps extends __MDLOtherProps {
+        open ?: boolean;
+    }
+    interface DialogActionsProps extends __MDLOtherProps {
+        fullWidth ?: boolean;
+    }
+    interface DialogTitleProps extends __MDLOtherProps, CustomRenderedComponent {}
+    class Dialog extends __MDLComponent<DialogProps> {}
+    class DialogActions extends __MDLComponent<DialogActionsProps> {}
+    class DialogTitle extends __MDLComponent<DialogTitleProps> {}
+    class DialogContent extends __MDLBasicComponent {}
+    
+    
+    interface GridProps extends __MDLOtherProps, CustomRenderedComponent, ShadowedComponent {
+        noSpacing ?: boolean;
+    }
+    interface CellProps extends __MDLOtherProps, CustomRenderedComponent, ShadowedComponent {
+        col : number;
+        align ?: string;
+        phone ?: number;
+        tablet ?: number;
+        hideDesktop ?: boolean;
+        hidePhone ?: boolean;
+        hideTablet ?: boolean;
+    }
+    class Grid extends __MDLComponent<GridProps> {}
+    class Cell extends __MDLComponent<CellProps> {}
+    
+    
+    interface IconProps extends __MDLOtherProps {
+        name : string;
+    }
+    class Icon extends __MDLComponent<IconProps> {}
+    
+    
+    interface IconToggleProps extends __MDLOtherProps, RippleComponent {
+        name : string;
+        checked ?: boolean;
+        disabled ?: boolean;
+    }
+    class IconToggle extends __MDLComponent<IconToggleProps> {}
+    
+    
+    interface ContentProps extends __MDLOtherProps, CustomRenderedComponent {}
+    interface DrawerProps extends __MDLOtherProps {
+        title ?: string;
+    }
+    interface HeaderProps extends __MDLOtherProps {
+        title ?: string;
+        scroll ?: boolean;
+        seamed ?: boolean;
+        transparent ?: boolean;
+        waterfall ?: boolean;
+        hideTop ?: boolean;
+    }
+    interface HeaderRowProps extends __MDLOtherProps {
+        title ?: string;
+    }
+    interface HeaderTabsProps extends __MDLOtherProps, RippleComponent {
+        activeTab ?: number;
+        onChange ?: React.FormEventHandler;
+    }
+    interface LayoutProps extends __MDLOtherProps {
+        fixedDrawer ?: boolean;
+        fixedHeader ?: boolean;
+        fixedTabse ?: boolean;
+    }
+    interface NavigationProps extends __MDLOtherProps {}
+    class Content extends __MDLComponent<ContentProps> {}
+    class Drawer extends __MDLComponent<DrawerProps> {}
+    class Header extends __MDLComponent<HeaderProps> {}
+    class HeaderRow extends __MDLComponent<HeaderRowProps> {}
+    class HeaderTabs extends __MDLComponent<HeaderTabsProps> {}
+    class Layout extends __MDLComponent<LayoutProps> {}
+    class Navigation extends __MDLComponent<NavigationProps> {}
+    class Spacer extends __MDLBasicComponent {}
+    
+    interface FooterProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        
+        title ?: string;
+    }
+    interface FooterDropDownSectionProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        title : React.ReactNode;
+    }
+    interface FooterLinkListProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        
+        title ?: string;
+    }
+    interface FooterSectionProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        type ?: string;
+        logo ?: React.ReactNode;
+        
+        title ?: string;
+    }
+    class Footer extends __MDLComponent<FooterProps> {}
+    class FooterDropDownSection extends __MDLComponent<FooterDropDownSectionProps> {}
+    class FooterLinkList extends __MDLComponent<FooterLinkListProps> {}
+    class FooterSection extends __MDLComponent<FooterSectionProps> {}
+    
+    interface ListItemProps extends __MDLOtherProps {
+        twoLine ?: boolean;
+        threeLine ?: boolean;
+    }
+    interface ListItemActionProps extends __MDLOtherProps {
+        info ?: string;
+    }
+    interface ListItemContentProps extends MDLHTMLAttributes, React.DOMAttributes {
+        avatar ?: string | JSX.Element;
+        icon ?: string | JSX.Element;
+        subtitle ?: React.ReactNode;
+        useBodyClass ?: boolean;
+    }
+    class List extends __MDLBasicComponent {}
+    class ListItem extends __MDLComponent<ListItemProps> {}
+    class ListItemAction extends __MDLComponent<ListItemActionProps> {}
+    class ListItemContent extends __MDLComponent<ListItemContentProps> {}
+    
+    
+    interface MenuProps extends __MDLOtherProps, RippleComponent {
+        target : string;
+        align ?: string;
+        valign ?: string;
+    }
+    class Menu extends __MDLComponent<MenuProps> {}
+    class MenuItem extends __MDLBasicComponent {}
+    
+    
+    interface ProgressBarProps extends __MDLOtherProps {
+        buffer ?: number;
+        indeterminate ?: boolean;
+        progress ?: number;
+    }
+    class ProgressBar extends __MDLComponent<ProgressBarProps> {}
+    
+    
+    interface RadioProps extends MDLHTMLAttributes, React.DOMAttributes, RippleComponent {
+        value : string | number;
+        checked ?: boolean;
+        disabled ?: boolean;
+        name ?: string;
+        onChange ?: React.FormEventHandler;
+        label ?: string;
+    }
+    interface RadioGroupProps extends MDLHTMLAttributes, React.DOMAttributes {
+        name : string;
+        value : string | number;
+        childContainer ?: string;
+        container ?: string;
+        onChange ?: React.FormEventHandler;
+        label ?: string;
+    }
+    class Radio extends __MDLComponent<RadioProps> {}
+    class RadioGroup extends __MDLComponent<RadioGroupProps> {}
+    
+    
+    interface SliderProps extends MDLHTMLAttributes, React.DOMAttributes {
+        max : number;
+        min : number;
+        onChange ?: React.FormEventHandler;
+        value ?: number;
+    }
+    class Slider extends __MDLComponent<SliderProps> {}
+    
+    
+    interface SnackbarProps extends __MDLOtherProps {
+        active : boolean;
+        onTimeout : () => any;
+        action ?: string;
+        onActionClick ?: React.MouseEventHandler;
+        timeout ?: number;
+    }
+    class Snackbar extends __MDLComponent<SnackbarProps> {}
+    
+    
+    interface SpinnerProps extends __MDLOtherProps {
+        singleColor ?: boolean;
+    }
+    class Spinner extends __MDLComponent<SpinnerProps> {}
+    
+    
+    interface SwitchProps extends __MDLOtherProps, RippleComponent {
+        checked ?: boolean;
+        disabled ?: boolean;
+        onChange ?: React.FormEventHandler;
+    }
+    class Switch extends __MDLComponent<SwitchProps> {}
+    
+    
+    interface TabProps extends __MDLOtherProps, CustomRenderedComponent {
+        active ?: boolean;
+        cssPrefix ?: string;
+        onTabClick ?: (tabId : number) => any;
+        tabId ?: number;
+    }
+    interface TabBarProps extends MDLHTMLAttributes, MDLDOMAttributes {
+        cssPrefix : string;
+        activeTab ?: number;
+        onChange ?: (tabId : number) => any;
+        
+        name ?: string;
+        title ?: string;        
+        onClick ?: React.MouseEventHandler;
+    }
+    interface TabsProps extends MDLHTMLAttributes, MDLDOMAttributes {
+        activeTab ?: number;
+        onChange ?: (tabId : number) => any;
+        tabBarProps ?: TabBarProps;
+        
+        name ?: string;
+        title ?: string;        
+        onClick ?: React.MouseEventHandler;
+    }
+    class Tab extends __MDLComponent<TabProps> {}
+    class TabBar extends __MDLComponent<TabBarProps> {}
+    class Tabs extends __MDLComponent<TabsProps> {}
+    
+    
+    interface TextfieldProps extends MDLHTMLAttributes, React.DOMAttributes {
+        label : string;
+        disabled ?: boolean;
+        error ?: React.ReactNode;
+        expandable ?: boolean;
+        expandableIcon ?: string;
+        floatingLabel ?: boolean;
+        id ?: string;
+        inputClassName ?: string;
+        maxRows ?: number;
+        onChange ?: React.FormEventHandler;
+        pattern ?: string;
+        required ?: boolean;
+        rows ?: number;
+        value ?: string | number;
+        
+        name ?: string;
+        title ?: string;
+    }
+    class Textfield extends __MDLComponent<TextfieldProps> {}
+    
+    
+    interface TooltipProps extends MDLHTMLAttributes, React.DOMAttributes {
+        label : React.ReactNode;
+        large ?: boolean;
+        position ?: string;
+        
+        name ?: string;
+        title ?: string;
+    }
+    class Tooltip extends __MDLComponent<TooltipProps> {}
+}
+
+declare module 'react-mdl' {
+    export = __ReactMDL;
+}
\ No newline at end of file

From aa672a5f5f5ac5da6c6db1a4afc3235f499893e3 Mon Sep 17 00:00:00 2001
From: Atanas Atanasov <nascovt@gmail.com>
Date: Sat, 23 Apr 2016 23:00:44 +0300
Subject: [PATCH 046/278] Update grid.d.ts

---
 gijgo/grid.d.ts | 46 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)

diff --git a/gijgo/grid.d.ts b/gijgo/grid.d.ts
index 5a5faf4840..ff5802482f 100644
--- a/gijgo/grid.d.ts
+++ b/gijgo/grid.d.ts
@@ -2,3 +2,49 @@
 // Project: http://gijgo.com
 // Definitions by: Atanas Atanasov <https://github.com/atatanasov>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+interface DataGridPager {
+    limit: number;
+    sizes: Array<number>
+}
+
+interface DataGridColumn {
+    title?: any;
+    field?: any;
+    align?: string;
+    type?: string;
+    icon?: string;
+    tooltip?: string;
+    events?: any;
+    sortable?: boolean;
+    width?: number;
+    headerCssClass?: string;
+}
+
+interface DataGridSettings<Entity> {
+    title?: string;
+    dataSource?: any;
+    primaryKey?: any;
+    selectionType?: string;
+    selectionMethod?: string;
+    uiLibrary?: string;
+    autoLoad?: boolean;
+    pager?: DataGridPager;
+    params?: any;
+    notFoundText?: string;
+    minWidth?: number;
+    columns?: Array<DataGridColumn>;
+    defaultColumnSettings?: DataGridColumn;
+}
+
+interface DataGrid<Params, Entity> extends JQuery {
+    reload(params?: Params): void;
+    getById(id: number): Entity;
+    getAll(): Entity[];
+    setSelected(id: number, value: any): void;
+}
+
+interface JQuery {
+    grid<Params, Entity>(settings: DataGridSettings<Entity>): DataGrid<Params, Entity>;
+    grid(settings: DataGridSettings<any>): DataGrid<any, any>;
+}

From 133be9545aa135391539aa95b428c9b59b2898ac Mon Sep 17 00:00:00 2001
From: Brad Zacher <brad.zacher@gmail.com>
Date: Sun, 24 Apr 2016 14:17:03 +0930
Subject: [PATCH 047/278] fixed es6 compilation by chanigng import

i don't know why git is saying that every line changed...
---
 react-mdl/react-mdl-tests.tsx | 2087 ++++++++++++++++-----------------
 react-mdl/react-mdl.d.ts      | 1210 +++++++++----------
 2 files changed, 1648 insertions(+), 1649 deletions(-)

diff --git a/react-mdl/react-mdl-tests.tsx b/react-mdl/react-mdl-tests.tsx
index eb9981092a..8efcebee52 100644
--- a/react-mdl/react-mdl-tests.tsx
+++ b/react-mdl/react-mdl-tests.tsx
@@ -1,1044 +1,1043 @@
-// Test file for react-mdl Definition file
-/// <reference path="react-mdl.d.ts" />
-
-import React = require('react');
-import {Badge,
-    FABButton, Button, IconButton,
-    Card, CardActions, CardTitle, CardText, CardMenu, CardMedia,
-    Checkbox,
-    DataTable, TableHeader, Table,
-    Dialog, DialogTitle, DialogContent, DialogActions,
-    Grid, Cell,
-    Icon, IconToggle,
-    Layout, Header, Navigation, Drawer, Content, HeaderRow, HeaderTabs, Footer, FooterDropDownSection, FooterLinkList, FooterSection,
-    List, ListItem, ListItemContent, ListItemAction,
-    Menu, MenuItem,
-    ProgressBar,
-    RadioGroup, Radio,
-    Slider,
-    Snackbar,
-    Spinner,
-    Switch,
-    Tabs, Tab,
-    Textfield,
-    Tooltip} from 'react-mdl';
-
-// all tests are from the examples provided here: https://tleunen.github.io/react-mdl/
-
-// Badge tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Number badge on icon */}
-                <Badge text="1" overlap>
-                    <Icon name="account_box" />
-                </Badge>
-
-                {/* Icon badge on icon */}
-                <Badge text="♥" overlap>
-                    <Icon name="account_box" />
-                </Badge>
-                
-                {/* Number badge on text */}
-                <Badge text="4">Inbox</Badge>
-
-                {/* Icon badge without background on text */}
-                <Badge text="♥" noBackground>Mood</Badge>
-            </div>
-        );
-    }
-});
-
-// Button tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Colored FAB button */}
-                <FABButton colored>
-                    <Icon name="add" />
-                </FABButton>
-
-                {/* Colored FAB button with ripple */}
-                <FABButton colored ripple>
-                    <Icon name="add" />
-                </FABButton>
-
-                {/* FAB button */}
-                <FABButton>
-                    <Icon name="add" />
-                </FABButton>
-
-                {/* FAB button with ripple */}
-                <FABButton ripple>
-                    <Icon name="add" />
-                </FABButton>
-
-                {/* Disabled FAB button */}
-                <FABButton disabled>
-                    <Icon name="add" />
-                </FABButton>
-
-                {/* Mini FAB button */}
-                <FABButton mini>
-                    <Icon name="add" />
-                </FABButton>
-
-                {/* Colored Mini FAB button */}
-                <FABButton mini colored>
-                    <Icon name="add" />
-                </FABButton>
-
-                {/* Raised button */}
-                <Button raised>Button</Button>
-
-                {/* Raised button with ripple */}
-                <Button raised ripple>Button</Button>
-
-                {/* Disabled Raised button */}
-                <Button raised disabled>Button</Button>
-
-                {/* Colored Raised button */}
-                <Button raised colored>Button</Button>
-
-                {/* Accent-colored button without ripple */}
-                <Button raised accent>Button</Button>
-
-                {/* Accent-colored button with ripple */}
-                <Button raised accent ripple>Button</Button>
-
-                {/* Flat button */}
-                <Button>Button</Button>
-
-                {/* Flat button with ripple */}
-                <Button ripple>Button</Button>
-
-                {/* Disabled flat button */}
-                <Button disabled>Button</Button>
-
-                {/* Primary colored flat button */}
-                <Button primary>Button</Button>
-
-                {/* Accent-colored flat button */}
-                <Button accent>Button</Button>
-
-                {/* Icon button */}
-                <IconButton name="mood" />
-
-                {/* Colored Icon button */}
-                <IconButton name="mood" colored />
-            </div>
-        );
-    }
-})
-
-// Card tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <Card shadow={0} style={{width: '512px', margin: 'auto'}}>
-                    <CardTitle style={{color: '#fff', height: '176px', background: 'url(http://www.getmdl.io/assets/demos/welcome_card.jpg) center / cover'}}>Welcome</CardTitle>
-                    <CardText>
-                        Lorem ipsum dolor sit amet, consectetur adipiscing elit.
-                        Mauris sagittis pellentesque lacus eleifend lacinia...
-                    </CardText>
-                    <CardActions border>
-                        <Button colored>Get Started</Button>
-                    </CardActions>
-                    <CardMenu style={{color: '#fff'}}>
-                        <IconButton name="share" />
-                    </CardMenu>
-                </Card>
-                
-                <Card shadow={0} style={{width: '320px', height: '320px', margin: 'auto'}}>
-                    <CardTitle expand style={{color: '#fff', background: 'url(http://www.getmdl.io/assets/demos/dog.png) bottom right 15% no-repeat #46B6AC'}}>Update</CardTitle>
-                    <CardText>
-                        Lorem ipsum dolor sit amet, consectetur adipiscing elit.
-                        Aenan convallis.
-                    </CardText>
-                    <CardActions border>
-                        <Button colored>View Updates</Button>
-                    </CardActions>
-                </Card>
-                
-                <Card shadow={0} style={{width: '256px', height: '256px', background: 'url(http://www.getmdl.io/assets/demos/image_card.jpg) center / cover', margin: 'auto'}}>
-                    <CardTitle expand />
-                    <CardActions style={{height: '52px', padding: '16px', background: 'rgba(0,0,0,0.2)'}}>
-                        <span style={{color: '#fff', fontSize: '14px', fontWeight: '500'}}>
-                            Image.jpg
-                        </span>
-                    </CardActions>
-                </Card>
-                
-                <Card shadow={0} style={{width: '256px', height: '256px', background: '#3E4EB8'}}>
-                    <CardTitle expand style={{alignItems: 'flex-start', color: '#fff'}}>
-                        <h4 style={{marginTop: '0'}}>
-                            Featured event:<br />
-                            May 24, 2016<br />
-                            7-11pm
-                        </h4>
-                    </CardTitle>
-                    <CardActions border style={{borderColor: 'rgba(255, 255, 255, 0.2)', display: 'flex', boxSizing: 'border-box', alignItems: 'center', color: '#fff'}}>
-                        <Button colored style={{color: '#fff'}}>Add to Calendar</Button>
-                        <div className="mdl-layout-spacer"></div>
-                        <Icon name="event" />
-                    </CardActions>
-                </Card>
-            </div>
-        );
-    }
-});
-
-// Checkbox tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <Checkbox label="With ripple" ripple defaultChecked />
-
-                <Checkbox label="Without ripple" />
-            </div>
-        );
-    }
-});
-
-// DataTable tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <DataTable
-                    shadow={0}
-                    rows={[
-                        {material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
-                        {material: 'Plywood (Birch)', quantity: 50, price: 1.25},
-                        {material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
-                    ]}
-                >
-                    <TableHeader name="material" tooltip="The amazing material name">Material</TableHeader>
-                    <TableHeader numeric name="quantity" tooltip="Number of materials">Quantity</TableHeader>
-                    <TableHeader numeric name="price" cellFormatter={(price) => `\$${price.toFixed(2)}`} tooltip="Price pet unit">Price</TableHeader>
-                </DataTable>
-
-                <DataTable
-                    selectable
-                    shadow={0}
-                    rowKeyColumn="id"
-                    rows={[
-                        {id: 1001, material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
-                        {id: 1002, material: 'Plywood (Birch)', quantity: 50, price: 1.25},
-                        {id: 1003, material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
-                    ]}
-                >
-                    <TableHeader name="material" tooltip="The amazing material name">Material</TableHeader>
-                    <TableHeader numeric name="quantity" tooltip="Number of materials">Quantity</TableHeader>
-                    <TableHeader numeric name="price" cellFormatter={(price) => `\$${price.toFixed(2)}`} tooltip="Price pet unit">Price</TableHeader>
-                </DataTable>
-
-                <Table
-                    sortable
-                    shadow={0}
-                    rows={[
-                        {material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
-                        {material: 'Plywood (Birch)', quantity: 50, price: 1.25},
-                        {material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
-                    ]}
-                >
-                    <TableHeader
-                        name="material"
-                        sortable
-                        sortFn={(a, b, isAsc) => (isAsc ? a : b).match(/\((.*)\)/)[1].localeCompare((isAsc ? b : a).match(/\((.*)\)/)[1])}
-                        tooltip="The amazing material name"
-                    >
-                        Material
-                    </TableHeader>
-                    <TableHeader
-                        numeric
-                        name="quantity"
-                        tooltip="Number of materials"
-                    >
-                        Quantity
-                    </TableHeader>
-                    <TableHeader
-                        numeric
-                        sortable
-                        name="price"
-                        cellFormatter={(price) => `\$${price.toFixed(2)}`}
-                        tooltip="Price pet unit"
-                    >
-                        Price
-                    </TableHeader>
-                </Table>
-            </div>
-        );
-    }
-});
-
-// Dialog tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <div>
-                    <Button colored onClick={this.handleOpenDialog} raised ripple>Show Dialog</Button>
-                    <Dialog open={this.state.openDialog}>
-                    <DialogTitle>Allow data collection?</DialogTitle>
-                    <DialogContent>
-                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
-                    </DialogContent>
-                    <DialogActions>
-                        <Button type='button'>Agree</Button>
-                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
-                    </DialogActions>
-                    </Dialog>
-                </div>
-                
-                <div>
-                    <Button colored onClick={this.handleOpenDialog} raised ripple>Show Modal</Button>
-                    <Dialog open={this.state.openDialog}>
-                    <DialogTitle>Allow this site to collect usage data to improve your experience?</DialogTitle>
-                    <DialogContent>
-                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
-                    </DialogContent>
-                    <DialogActions fullWidth>
-                        <Button type='button'>Agree</Button>
-                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
-                    </DialogActions>
-                    </Dialog>
-                </div>
-                
-                <div>
-                    <Button colored onClick={this.handleOpenDialog} onCancel={this.handleCloseDialog} raised ripple>Show Dialog</Button>
-                    <Dialog open={this.state.openDialog} onCancel={this.handleCloseDialog}>
-                    <DialogTitle>Allow data collection?</DialogTitle>
-                    <DialogContent>
-                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
-                    </DialogContent>
-                    <DialogActions>
-                        <Button type='button'>Agree</Button>
-                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
-                    </DialogActions>
-                    </Dialog>
-                </div>
-            </div>
-        );
-    }
-});
-
-// Grid tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <div style={{width: '80%', margin: 'auto'}}>
-                    <Grid className="demo-grid-ruler">
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                        <Cell col={1}>1</Cell>
-                    </Grid>
-                    <Grid className="demo-grid-1">
-                        <Cell col={4}>4</Cell>
-                        <Cell col={4}>4</Cell>
-                        <Cell col={4}>4</Cell>
-                    </Grid>
-                    <Grid className="demo-grid-2">
-                        <Cell col={6}>6</Cell>
-                        <Cell col={4}>4</Cell>
-                        <Cell col={2}>2</Cell>
-                    </Grid>
-                    <Grid className="demo-grid-3">
-                        <Cell col={6} tablet={8}>6 (8 tablet)</Cell>
-                        <Cell col={4} tablet={6}>4 (6 tablet)</Cell>
-                        <Cell col={2} phone={4}>2 (4 phone)</Cell>
-                    </Grid>
-                </div>
-            </div>
-        );
-    }
-});
-
-// IconToggle tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <IconToggle ripple id="bold" name="format_bold" defaultChecked />
-
-                <IconToggle id="italic" name="format_italic" />
-            </div>
-        );
-    }
-});
-
-// Layout tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Uses a transparent header that draws on top of the layout's background */}
-                <div style={{height: '300px', position: 'relative'}}>
-                    <Layout style={{background: 'url(http://www.getmdl.io/assets/demos/transparent.jpg) center / cover'}}>
-                        <Header transparent title="Title" style={{color: 'white'}}>
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Header>
-                        <Drawer title="Title">
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Drawer>
-                        <Content />
-                    </Layout>
-                </div>
-
-                {/* No header, and the drawer stays open on larger screens (fixed drawer). */}
-                <div style={{height: '300px', position: 'relative'}}>
-                    <Layout fixedDrawer>
-                        <Drawer title="Title">
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Drawer>
-                        <Content />
-                    </Layout>
-                </div>
-
-                {/* Always shows a header, even in smaller screens. */}
-                <div style={{height: '300px', position: 'relative'}}>
-                    <Layout fixedHeader>
-                        <Header title={<span><span style={{ color: '#ddd' }}>Area / </span><strong>The Title</strong></span>}>
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Header>
-                        <Drawer title="Title">
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Drawer>
-                        <Content />
-                    </Layout>
-                </div>
-
-                {/* The drawer is always open in large screens. The header is always shown, even in small screens. */}
-                <div style={{height: '300px', position: 'relative'}}>
-                    <Layout fixedHeader fixedDrawer>
-                        <Header title="Title">
-                            <Textfield
-                                value=""
-                                onChange={() => {}}
-                                label="Search"
-                                expandable
-                                expandableIcon="search"
-                            />
-                        </Header>
-                        <Drawer title="Title">
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Drawer>
-                        <Content />
-                    </Layout>
-                </div>
-
-                {/* Uses a header that scrolls with the text, rather than staying locked at the top */}
-                <div className="demo-big-content">
-                    <Layout>
-                        <Header title="Title" scroll>
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Header>
-                        <Drawer title="Title">
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Drawer>
-                        <Content>
-                            <div className="page-content" />
-                        </Content>
-                    </Layout>
-                </div>
-
-                {/* Uses a header that contracts as the page scrolls down. */}
-                <div className="demo-big-content">
-                    <Layout>
-                        <Header waterfall>
-                            <HeaderRow title="Title">
-                                <Textfield
-                                    value=""
-                                    onChange={() => {}}
-                                    label="Search"
-                                    expandable
-                                    expandableIcon="search"
-                                />
-                            </HeaderRow>
-                            <HeaderRow>
-                                <Navigation>
-                                    <a href="">Link</a>
-                                    <a href="">Link</a>
-                                    <a href="">Link</a>
-                                    <a href="">Link</a>
-                                </Navigation>
-                            </HeaderRow>
-                        </Header>
-                        <Drawer title="Title">
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Drawer>
-                        <Content>
-                            <div className="page-content" />
-                        </Content>
-                    </Layout>
-                </div>
-
-                {/* Hide the top part of the header when scrolling down */}
-                <div className="demo-big-content">
-                    <Layout>
-                        <Header waterfall hideTop>
-                            <HeaderRow title="Title">
-                                <Textfield
-                                    value=""
-                                    onChange={() => {}}
-                                    label="Search"
-                                    expandable
-                                    expandableIcon="search"
-                                />
-                            </HeaderRow>
-                            <HeaderRow>
-                                <Navigation>
-                                    <a href="">Link</a>
-                                    <a href="">Link</a>
-                                    <a href="">Link</a>
-                                    <a href="">Link</a>
-                                </Navigation>
-                            </HeaderRow>
-                        </Header>
-                        <Drawer title="Title">
-                            <Navigation>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                                <a href="">Link</a>
-                            </Navigation>
-                        </Drawer>
-                        <Content>
-                            <div className="page-content" />
-                        </Content>
-                    </Layout>
-                </div>
-
-                <div style={{height: '300px', position: 'relative'}}>
-                    <Layout fixedHeader>
-                        <Header>
-                            <HeaderRow title="Title" />
-                            <HeaderTabs activeTab={this.state.activeTab} onChange={(tabId) => this.setState({ activeTab: tabId })}>
-                                <Tab>Tab1</Tab>
-                                <Tab>Tab2</Tab>
-                                <Tab>Tab3</Tab>
-                                <Tab>Tab4</Tab>
-                                <Tab>Tab5</Tab>
-                                <Tab>Tab6</Tab>
-                            </HeaderTabs>
-                        </Header>
-                        <Drawer title="Title" />
-                        <Content>
-                            <div className="page-content">Content for the tab: {this.state.activeTab}</div>
-                        </Content>
-                    </Layout>
-                </div>
-
-                {/* Simple header with fixed tabs. */}
-                <div style={{height: '300px', position: 'relative'}}>
-                    <Layout fixedHeader fixedTabs>
-                        <Header>
-                            <HeaderRow title="Title" />
-                            <HeaderTabs activeTab={1} onChange={(tabId) => {}}>
-                                <Tab>Tab1</Tab>
-                                <Tab>Tab2</Tab>
-                                <Tab>Tab3</Tab>
-                            </HeaderTabs>
-                        </Header>
-                        <Drawer title="Title" />
-                        <Content>
-                            <div className="page-content">You can add logic to update the content of this container based on the "activeTab" receive in the `onChange` callback.</div>
-                        </Content>
-                    </Layout>
-                </div>
-
-                <Footer size="mega">
-                    <FooterSection type="middle">
-                        <FooterDropDownSection title="Features">
-                            <FooterLinkList>
-                                <a href="#">About</a>
-                                <a href="#">Terms</a>
-                                <a href="#">Partners</a>
-                                <a href="#">Updates</a>
-                            </FooterLinkList>
-                        </FooterDropDownSection>
-                        <FooterDropDownSection title="Details">
-                            <FooterLinkList>
-                                <a href="#">Specs</a>
-                                <a href="#">Tools</a>
-                                <a href="#">Resources</a>
-                            </FooterLinkList>
-                        </FooterDropDownSection>
-                        <FooterDropDownSection title="Technology">
-                            <FooterLinkList>
-                                <a href="#">How it works</a>
-                                <a href="#">Patterns</a>
-                                <a href="#">Usage</a>
-                                <a href="#">Products</a>
-                                <a href="#">Contracts</a>
-                            </FooterLinkList>
-                        </FooterDropDownSection>
-                        <FooterDropDownSection title="FAQ">
-                            <FooterLinkList>
-                                <a href="#">Questions</a>
-                                <a href="#">Answers</a>
-                                <a href="#">Contact Us</a>
-                            </FooterLinkList>
-                        </FooterDropDownSection>
-                    </FooterSection>
-                    <FooterSection type="bottom" logo="Title">
-                        <FooterLinkList>
-                            <a href="#">Help</a>
-                            <a href="#">Privacy & Terms</a>
-                        </FooterLinkList>
-                    </FooterSection>
-                </Footer>
-
-                <Footer size="mini">
-                    <FooterSection type="left" logo="Title">
-                        <FooterLinkList>
-                            <a href="#">Help</a>
-                            <a href="#">Privacy & Terms</a>
-                        </FooterLinkList>
-                    </FooterSection>
-                </Footer>
-            </div>
-        );
-    }
-});
-
-// List tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <List>
-                <ListItem>Bryan Cranston</ListItem>
-                <ListItem>Aaron Paul</ListItem>
-                <ListItem>Bob Odenkirk</ListItem>
-                </List>
-
-                <List>
-                <ListItem>
-                    <ListItemContent icon="person">Bryan Cranston</ListItemContent>
-                </ListItem>
-                <ListItem>
-                    <ListItemContent icon="person">Aaron Paul</ListItemContent>
-                </ListItem>
-                <ListItem>
-                    <ListItemContent icon="person">Bob Odenkirk</ListItemContent>
-                </ListItem>
-                </List>
-
-                <List style={{width: '300px'}}>
-                <ListItem>
-                    <ListItemContent avatar="person">Bryan Cranston</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                <ListItem>
-                    <ListItemContent avatar="person">Aaron Paul</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                <ListItem>
-                    <ListItemContent avatar="person">Bob Odenkirk</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                </List>
-
-                <List style={{width: '300px'}}>
-                <ListItem>
-                    <ListItemContent avatar="person">Bryan Cranston</ListItemContent>
-                    <ListItemAction>
-                    <Checkbox defaultChecked />
-                    </ListItemAction>
-                </ListItem>
-                <ListItem>
-                    <ListItemContent avatar="person">Aaron Paul</ListItemContent>
-                    <ListItemAction>
-                    <Radio value={1} />
-                    </ListItemAction>
-                </ListItem>
-                <ListItem>
-                    <ListItemContent avatar="person">Bob Odenkirk</ListItemContent>
-                    <ListItemAction>
-                    <Switch defaultChecked />
-                    </ListItemAction>
-                </ListItem>
-                </List>
-
-                <List style={{width: '300px'}}>
-                <ListItem twoLine>
-                    <ListItemContent avatar="person" subtitle="62 episodes">Bryan Cranston</ListItemContent>
-                    <ListItemAction info="Actor">
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                <ListItem twoLine>
-                    <ListItemContent avatar="person" subtitle="62 episodes">Aaron Paul</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                <ListItem twoLine>
-                    <ListItemContent avatar="person" subtitle="62 episodes">Bob Odenkirk</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                </List>
-
-                <List style={{width: '650px'}}>
-                <ListItem threeLine>
-                    <ListItemContent avatar="person" subtitle="Bryan Cranston played the role of Walter in Breaking Bad. He is also known for playing Hal in Malcom in the Middle.">Bryan Cranston</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                <ListItem threeLine>
-                    <ListItemContent avatar="person" subtitle="Aaron Paul played the role of Jesse in Breaking Bad. He also featured in the Need For Speed Movie.">Aaron Paul</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                <ListItem threeLine>
-                    <ListItemContent avatar="person" subtitle="Bob Odinkrik played the role of Saul in Breaking Bad. Due to public fondness for the character, Bob stars in his own show now, called Better Call Saul.">Bob Odenkirk</ListItemContent>
-                    <ListItemAction>
-                    <a href="#"><Icon name="star" /></a>
-                    </ListItemAction>
-                </ListItem>
-                </List>
-            </div>
-        );
-    }
-});
-
-// Menu tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Lower left */}
-                <div style={{position: 'relative'}}>
-                    <IconButton name="more_vert" id="demo-menu-lower-left" />
-                    <Menu target="demo-menu-lower-left">
-                        <MenuItem>Some Action</MenuItem>
-                        <MenuItem>Another Action</MenuItem>
-                        <MenuItem disabled>Disabled Action</MenuItem>
-                        <MenuItem>Yet Another Action</MenuItem>
-                    </Menu>
-                </div>
-
-                {/* Lower right */}
-                <div style={{position: 'relative'}}>
-                    <IconButton name="more_vert" id="demo-menu-lower-right" />
-                    <Menu target="demo-menu-lower-right" align="right">
-                        <MenuItem>Some Action</MenuItem>
-                        <MenuItem>Another Action</MenuItem>
-                        <MenuItem disabled>Disabled Action</MenuItem>
-                        <MenuItem>Yet Another Action</MenuItem>
-                    </Menu>
-                </div>
-
-                {/* Top left */}
-                <div style={{position: 'relative'}}>
-                    <IconButton name="more_vert" id="demo-menu-top-left" />
-                    <Menu target="demo-menu-top-left" valign="top">
-                        <MenuItem>Some Action</MenuItem>
-                        <MenuItem>Another Action</MenuItem>
-                        <MenuItem disabled>Disabled Action</MenuItem>
-                        <MenuItem>Yet Another Action</MenuItem>
-                    </Menu>
-                </div>
-
-                {/* Top right */}
-                <div style={{position: 'relative'}}>
-                    <IconButton name="more_vert" id="demo-menu-top-right" />
-                    <Menu target="demo-menu-top-right" valign="top" align="right">
-                        <MenuItem>Some Action</MenuItem>
-                        <MenuItem>Another Action</MenuItem>
-                        <MenuItem disabled>Disabled Action</MenuItem>
-                        <MenuItem>Yet Another Action</MenuItem>
-                    </Menu>
-                </div>
-            </div>
-        );
-    }
-});
-
-// ProgressBar tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Simple Progress Bar */}
-                <ProgressBar progress={44} />
-
-                {/* Progress Bar with Indeterminate Progress */}
-                <ProgressBar indeterminate />
-
-                {/* Progress Bar with Buffering */}
-                <ProgressBar progress={33} buffer={87} />
-            </div>
-        );
-    }
-});
-
-// Radio tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <RadioGroup name="demo" value="opt1">
-                    <Radio value="opt1" ripple>Ripple option</Radio>
-                    <Radio value="opt2">Other option</Radio>
-                </RadioGroup>
-
-                <RadioGroup container="ul" childContainer="li" name="demo2" value="opt2">
-                    <Radio value="opt1" ripple>Ripple option</Radio>
-                    <Radio value="opt2">Other option</Radio>
-                </RadioGroup>
-            </div>
-        );
-    }
-});
-
-// Slider tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Default slider */}
-                <Slider min={0} max={100} defaultValue={0} />
-
-                {/* Slider with initial value */}
-                <Slider min={0} max={100} defaultValue={25} />
-            </div>
-        );
-    }
-});
-
-// Snackbar tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <div>
-                    <Button raised style={{backgroundColor: '#FF00FF'}} onClick={this.handleShowSnackbar}>Show a Snackbar</Button>
-                    <Snackbar
-                        active={false}
-                        onClick={this.handleClickActionSnackbar}
-                        onTimeout={this.handleTimeoutSnackbar}
-                        action="Undo">Button color changed.</Snackbar>
-                </div>
-                
-                <div>
-                    <Button raised onClick={this.handleShowSnackbar}>Show a Toast</Button>
-                    <Snackbar
-                        active={true}
-                        onTimeout={this.handleTimeoutSnackbar}>
-                        Lorem ipsum dolor sit amet, consectetur adipiscing elit. Fusce varius luctus quam. Fusce quis blandit libero. Donec accumsan nunc lectus, vel blandit diam bibendum ac. Integer faucibus, lorem et convallis fermentum, diam dolor imperdiet mi, nec iaculis risus mauris id elit. Vivamus vel eros dapibus, molestie ante ut, vestibulum sem.
-                    </Snackbar>
-                </div>
-            </div>
-        );
-    }
-});
-
-// Spinner tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Simple spinner */}
-                <Spinner />
-
-                {/* Single color spinner */}
-                <Spinner singleColor />
-            </div>
-        );
-    }
-});
-
-// Switch tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <Switch ripple id="switch1" defaultChecked>Ripple switch</Switch>
-
-                <Switch id="switch2">Switch</Switch>
-            </div>
-        );
-    }
-});
-
-// Tab tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                <div className="demo-tabs">
-                    <Tabs activeTab={this.state.activeTab} onChange={(tabId) => this.setState({ activeTab: tabId })} ripple>
-                        <Tab>Starks</Tab>
-                        <Tab>Lannisters</Tab>
-                        <Tab>Targaryens</Tab>
-                    </Tabs>
-                    <section>
-                        <div className="content">Content for the tab: {this.state.activeTab}</div>
-                    </section>
-                </div> 
-            </div>
-        );
-    }
-});
-
-// Textfield tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Simple textfield */}
-                <Textfield
-                    onChange={() => {}}
-                    label="Text..."
-                    style={{width: '200px'}}
-                />
-
-                {/* Numeric textfield */}
-                <Textfield
-                    onChange={() => {}}
-                    pattern="-?[0-9]*(\.[0-9]+)?"
-                    error="Input is not a number!"
-                    label="Number..."
-                    style={{width: '200px'}}
-                />
-
-                {/* Textfield with floating label */}
-                <Textfield
-                    onChange={() => {}}
-                    label="Text..."
-                    floatingLabel
-                    style={{width: '200px'}}
-                />
-
-                {/* Numeric Textfield with floating label */}
-                <Textfield
-                    onChange={() => {}}
-                    pattern="-?[0-9]*(\.[0-9]+)?"
-                    error="Input is not a number!"
-                    label="Number..."
-                    floatingLabel
-                />
-            </div>
-        );
-    }
-});
-
-// Tooltip tests
-React.createClass({
-    render: function() {
-        return (
-            <div>
-                {/* Simple tooltip */}
-                <Tooltip label="Follow">
-                    <Icon name="add" />
-                </Tooltip>
-
-                {/* Large Tooltip */}
-                <Tooltip label="Print" large>
-                    <Icon name="print" />
-                </Tooltip>
-
-                {/* Rich Tooltip */}
-                <Tooltip label={<span>Upload <strong>file.zip</strong></span>}>
-                    <Icon name="cloud_upload" />
-                </Tooltip>
-
-                {/* Multiline Tooltip */}
-                <Tooltip label={<span>Share your content<br />via social media</span>}>
-                    <Icon name="share" />
-                </Tooltip>
-
-                {/* Right Tooltip */}
-                <Tooltip label="Follow" position="right">
-                    <Icon name="arrow_forward" />
-                </Tooltip>
-
-                {/* Left Tooltip */}
-                <Tooltip label="Follow" position="left">
-                    <Icon name="arrow_back" />
-                </Tooltip>
-
-                {/* Top Tooltip */}
-                <Tooltip label="Follow" position="top">
-                    <Icon name="arrow_upward" />
-                </Tooltip>
-
-                {/* Bottom Tooltip */}
-                <Tooltip label="Follow" position="bottom">
-                    <Icon name="arrow_downward" />
-                </Tooltip>
-            </div>
-        );
-    }
-});
+// Test file for react-mdl Definition file
+/// <reference path="react-mdl.d.ts" />
+
+import {Badge,
+    FABButton, Button, IconButton,
+    Card, CardActions, CardTitle, CardText, CardMenu, CardMedia,
+    Checkbox,
+    DataTable, TableHeader, Table,
+    Dialog, DialogTitle, DialogContent, DialogActions,
+    Grid, Cell,
+    Icon, IconToggle,
+    Layout, Header, Navigation, Drawer, Content, HeaderRow, HeaderTabs, Footer, FooterDropDownSection, FooterLinkList, FooterSection,
+    List, ListItem, ListItemContent, ListItemAction,
+    Menu, MenuItem,
+    ProgressBar,
+    RadioGroup, Radio,
+    Slider,
+    Snackbar,
+    Spinner,
+    Switch,
+    Tabs, Tab,
+    Textfield,
+    Tooltip} from 'react-mdl';
+
+// all tests are from the examples provided here: https://tleunen.github.io/react-mdl/
+
+// Badge tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Number badge on icon */}
+                <Badge text="1" overlap>
+                    <Icon name="account_box" />
+                </Badge>
+
+                {/* Icon badge on icon */}
+                <Badge text="♥" overlap>
+                    <Icon name="account_box" />
+                </Badge>
+                
+                {/* Number badge on text */}
+                <Badge text="4">Inbox</Badge>
+
+                {/* Icon badge without background on text */}
+                <Badge text="♥" noBackground>Mood</Badge>
+            </div>
+        );
+    }
+});
+
+// Button tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Colored FAB button */}
+                <FABButton colored>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Colored FAB button with ripple */}
+                <FABButton colored ripple>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* FAB button */}
+                <FABButton>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* FAB button with ripple */}
+                <FABButton ripple>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Disabled FAB button */}
+                <FABButton disabled>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Mini FAB button */}
+                <FABButton mini>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Colored Mini FAB button */}
+                <FABButton mini colored>
+                    <Icon name="add" />
+                </FABButton>
+
+                {/* Raised button */}
+                <Button raised>Button</Button>
+
+                {/* Raised button with ripple */}
+                <Button raised ripple>Button</Button>
+
+                {/* Disabled Raised button */}
+                <Button raised disabled>Button</Button>
+
+                {/* Colored Raised button */}
+                <Button raised colored>Button</Button>
+
+                {/* Accent-colored button without ripple */}
+                <Button raised accent>Button</Button>
+
+                {/* Accent-colored button with ripple */}
+                <Button raised accent ripple>Button</Button>
+
+                {/* Flat button */}
+                <Button>Button</Button>
+
+                {/* Flat button with ripple */}
+                <Button ripple>Button</Button>
+
+                {/* Disabled flat button */}
+                <Button disabled>Button</Button>
+
+                {/* Primary colored flat button */}
+                <Button primary>Button</Button>
+
+                {/* Accent-colored flat button */}
+                <Button accent>Button</Button>
+
+                {/* Icon button */}
+                <IconButton name="mood" />
+
+                {/* Colored Icon button */}
+                <IconButton name="mood" colored />
+            </div>
+        );
+    }
+})
+
+// Card tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <Card shadow={0} style={{width: '512px', margin: 'auto'}}>
+                    <CardTitle style={{color: '#fff', height: '176px', background: 'url(http://www.getmdl.io/assets/demos/welcome_card.jpg) center / cover'}}>Welcome</CardTitle>
+                    <CardText>
+                        Lorem ipsum dolor sit amet, consectetur adipiscing elit.
+                        Mauris sagittis pellentesque lacus eleifend lacinia...
+                    </CardText>
+                    <CardActions border>
+                        <Button colored>Get Started</Button>
+                    </CardActions>
+                    <CardMenu style={{color: '#fff'}}>
+                        <IconButton name="share" />
+                    </CardMenu>
+                </Card>
+                
+                <Card shadow={0} style={{width: '320px', height: '320px', margin: 'auto'}}>
+                    <CardTitle expand style={{color: '#fff', background: 'url(http://www.getmdl.io/assets/demos/dog.png) bottom right 15% no-repeat #46B6AC'}}>Update</CardTitle>
+                    <CardText>
+                        Lorem ipsum dolor sit amet, consectetur adipiscing elit.
+                        Aenan convallis.
+                    </CardText>
+                    <CardActions border>
+                        <Button colored>View Updates</Button>
+                    </CardActions>
+                </Card>
+                
+                <Card shadow={0} style={{width: '256px', height: '256px', background: 'url(http://www.getmdl.io/assets/demos/image_card.jpg) center / cover', margin: 'auto'}}>
+                    <CardTitle expand />
+                    <CardActions style={{height: '52px', padding: '16px', background: 'rgba(0,0,0,0.2)'}}>
+                        <span style={{color: '#fff', fontSize: '14px', fontWeight: '500'}}>
+                            Image.jpg
+                        </span>
+                    </CardActions>
+                </Card>
+                
+                <Card shadow={0} style={{width: '256px', height: '256px', background: '#3E4EB8'}}>
+                    <CardTitle expand style={{alignItems: 'flex-start', color: '#fff'}}>
+                        <h4 style={{marginTop: '0'}}>
+                            Featured event:<br />
+                            May 24, 2016<br />
+                            7-11pm
+                        </h4>
+                    </CardTitle>
+                    <CardActions border style={{borderColor: 'rgba(255, 255, 255, 0.2)', display: 'flex', boxSizing: 'border-box', alignItems: 'center', color: '#fff'}}>
+                        <Button colored style={{color: '#fff'}}>Add to Calendar</Button>
+                        <div className="mdl-layout-spacer"></div>
+                        <Icon name="event" />
+                    </CardActions>
+                </Card>
+            </div>
+        );
+    }
+});
+
+// Checkbox tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <Checkbox label="With ripple" ripple defaultChecked />
+
+                <Checkbox label="Without ripple" />
+            </div>
+        );
+    }
+});
+
+// DataTable tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <DataTable
+                    shadow={0}
+                    rows={[
+                        {material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
+                        {material: 'Plywood (Birch)', quantity: 50, price: 1.25},
+                        {material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
+                    ]}
+                >
+                    <TableHeader name="material" tooltip="The amazing material name">Material</TableHeader>
+                    <TableHeader numeric name="quantity" tooltip="Number of materials">Quantity</TableHeader>
+                    <TableHeader numeric name="price" cellFormatter={(price) => `\$${price.toFixed(2)}`} tooltip="Price pet unit">Price</TableHeader>
+                </DataTable>
+
+                <DataTable
+                    selectable
+                    shadow={0}
+                    rowKeyColumn="id"
+                    rows={[
+                        {id: 1001, material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
+                        {id: 1002, material: 'Plywood (Birch)', quantity: 50, price: 1.25},
+                        {id: 1003, material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
+                    ]}
+                >
+                    <TableHeader name="material" tooltip="The amazing material name">Material</TableHeader>
+                    <TableHeader numeric name="quantity" tooltip="Number of materials">Quantity</TableHeader>
+                    <TableHeader numeric name="price" cellFormatter={(price) => `\$${price.toFixed(2)}`} tooltip="Price pet unit">Price</TableHeader>
+                </DataTable>
+
+                <Table
+                    sortable
+                    shadow={0}
+                    rows={[
+                        {material: 'Acrylic (Transparent)', quantity: 25, price: 2.90},
+                        {material: 'Plywood (Birch)', quantity: 50, price: 1.25},
+                        {material: 'Laminate (Gold on Blue)', quantity: 10, price: 2.35}
+                    ]}
+                >
+                    <TableHeader
+                        name="material"
+                        sortable
+                        sortFn={(a, b, isAsc) => (isAsc ? a : b).match(/\((.*)\)/)[1].localeCompare((isAsc ? b : a).match(/\((.*)\)/)[1])}
+                        tooltip="The amazing material name"
+                    >
+                        Material
+                    </TableHeader>
+                    <TableHeader
+                        numeric
+                        name="quantity"
+                        tooltip="Number of materials"
+                    >
+                        Quantity
+                    </TableHeader>
+                    <TableHeader
+                        numeric
+                        sortable
+                        name="price"
+                        cellFormatter={(price) => `\$${price.toFixed(2)}`}
+                        tooltip="Price pet unit"
+                    >
+                        Price
+                    </TableHeader>
+                </Table>
+            </div>
+        );
+    }
+});
+
+// Dialog tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div>
+                    <Button colored onClick={this.handleOpenDialog} raised ripple>Show Dialog</Button>
+                    <Dialog open={this.state.openDialog}>
+                    <DialogTitle>Allow data collection?</DialogTitle>
+                    <DialogContent>
+                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
+                    </DialogContent>
+                    <DialogActions>
+                        <Button type='button'>Agree</Button>
+                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
+                    </DialogActions>
+                    </Dialog>
+                </div>
+                
+                <div>
+                    <Button colored onClick={this.handleOpenDialog} raised ripple>Show Modal</Button>
+                    <Dialog open={this.state.openDialog}>
+                    <DialogTitle>Allow this site to collect usage data to improve your experience?</DialogTitle>
+                    <DialogContent>
+                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
+                    </DialogContent>
+                    <DialogActions fullWidth>
+                        <Button type='button'>Agree</Button>
+                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
+                    </DialogActions>
+                    </Dialog>
+                </div>
+                
+                <div>
+                    <Button colored onClick={this.handleOpenDialog} onCancel={this.handleCloseDialog} raised ripple>Show Dialog</Button>
+                    <Dialog open={this.state.openDialog} onCancel={this.handleCloseDialog}>
+                    <DialogTitle>Allow data collection?</DialogTitle>
+                    <DialogContent>
+                        <p>Allowing us to collect data will let us get you the information you want faster.</p>
+                    </DialogContent>
+                    <DialogActions>
+                        <Button type='button'>Agree</Button>
+                        <Button type='button' onClick={this.handleCloseDialog}>Disagree</Button>
+                    </DialogActions>
+                    </Dialog>
+                </div>
+            </div>
+        );
+    }
+});
+
+// Grid tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div style={{width: '80%', margin: 'auto'}}>
+                    <Grid className="demo-grid-ruler">
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                        <Cell col={1}>1</Cell>
+                    </Grid>
+                    <Grid className="demo-grid-1">
+                        <Cell col={4}>4</Cell>
+                        <Cell col={4}>4</Cell>
+                        <Cell col={4}>4</Cell>
+                    </Grid>
+                    <Grid className="demo-grid-2">
+                        <Cell col={6}>6</Cell>
+                        <Cell col={4}>4</Cell>
+                        <Cell col={2}>2</Cell>
+                    </Grid>
+                    <Grid className="demo-grid-3">
+                        <Cell col={6} tablet={8}>6 (8 tablet)</Cell>
+                        <Cell col={4} tablet={6}>4 (6 tablet)</Cell>
+                        <Cell col={2} phone={4}>2 (4 phone)</Cell>
+                    </Grid>
+                </div>
+            </div>
+        );
+    }
+});
+
+// IconToggle tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <IconToggle ripple id="bold" name="format_bold" defaultChecked />
+
+                <IconToggle id="italic" name="format_italic" />
+            </div>
+        );
+    }
+});
+
+// Layout tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Uses a transparent header that draws on top of the layout's background */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout style={{background: 'url(http://www.getmdl.io/assets/demos/transparent.jpg) center / cover'}}>
+                        <Header transparent title="Title" style={{color: 'white'}}>
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* No header, and the drawer stays open on larger screens (fixed drawer). */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedDrawer>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* Always shows a header, even in smaller screens. */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader>
+                        <Header title={<span><span style={{ color: '#ddd' }}>Area / </span><strong>The Title</strong></span>}>
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* The drawer is always open in large screens. The header is always shown, even in small screens. */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader fixedDrawer>
+                        <Header title="Title">
+                            <Textfield
+                                value=""
+                                onChange={() => {}}
+                                label="Search"
+                                expandable
+                                expandableIcon="search"
+                            />
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content />
+                    </Layout>
+                </div>
+
+                {/* Uses a header that scrolls with the text, rather than staying locked at the top */}
+                <div className="demo-big-content">
+                    <Layout>
+                        <Header title="Title" scroll>
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content>
+                            <div className="page-content" />
+                        </Content>
+                    </Layout>
+                </div>
+
+                {/* Uses a header that contracts as the page scrolls down. */}
+                <div className="demo-big-content">
+                    <Layout>
+                        <Header waterfall>
+                            <HeaderRow title="Title">
+                                <Textfield
+                                    value=""
+                                    onChange={() => {}}
+                                    label="Search"
+                                    expandable
+                                    expandableIcon="search"
+                                />
+                            </HeaderRow>
+                            <HeaderRow>
+                                <Navigation>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                </Navigation>
+                            </HeaderRow>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content>
+                            <div className="page-content" />
+                        </Content>
+                    </Layout>
+                </div>
+
+                {/* Hide the top part of the header when scrolling down */}
+                <div className="demo-big-content">
+                    <Layout>
+                        <Header waterfall hideTop>
+                            <HeaderRow title="Title">
+                                <Textfield
+                                    value=""
+                                    onChange={() => {}}
+                                    label="Search"
+                                    expandable
+                                    expandableIcon="search"
+                                />
+                            </HeaderRow>
+                            <HeaderRow>
+                                <Navigation>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                    <a href="">Link</a>
+                                </Navigation>
+                            </HeaderRow>
+                        </Header>
+                        <Drawer title="Title">
+                            <Navigation>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                                <a href="">Link</a>
+                            </Navigation>
+                        </Drawer>
+                        <Content>
+                            <div className="page-content" />
+                        </Content>
+                    </Layout>
+                </div>
+
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader>
+                        <Header>
+                            <HeaderRow title="Title" />
+                            <HeaderTabs activeTab={this.state.activeTab} onChange={(tabId) => this.setState({ activeTab: tabId })}>
+                                <Tab>Tab1</Tab>
+                                <Tab>Tab2</Tab>
+                                <Tab>Tab3</Tab>
+                                <Tab>Tab4</Tab>
+                                <Tab>Tab5</Tab>
+                                <Tab>Tab6</Tab>
+                            </HeaderTabs>
+                        </Header>
+                        <Drawer title="Title" />
+                        <Content>
+                            <div className="page-content">Content for the tab: {this.state.activeTab}</div>
+                        </Content>
+                    </Layout>
+                </div>
+
+                {/* Simple header with fixed tabs. */}
+                <div style={{height: '300px', position: 'relative'}}>
+                    <Layout fixedHeader fixedTabs>
+                        <Header>
+                            <HeaderRow title="Title" />
+                            <HeaderTabs activeTab={1} onChange={(tabId) => {}}>
+                                <Tab>Tab1</Tab>
+                                <Tab>Tab2</Tab>
+                                <Tab>Tab3</Tab>
+                            </HeaderTabs>
+                        </Header>
+                        <Drawer title="Title" />
+                        <Content>
+                            <div className="page-content">You can add logic to update the content of this container based on the "activeTab" receive in the `onChange` callback.</div>
+                        </Content>
+                    </Layout>
+                </div>
+
+                <Footer size="mega">
+                    <FooterSection type="middle">
+                        <FooterDropDownSection title="Features">
+                            <FooterLinkList>
+                                <a href="#">About</a>
+                                <a href="#">Terms</a>
+                                <a href="#">Partners</a>
+                                <a href="#">Updates</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                        <FooterDropDownSection title="Details">
+                            <FooterLinkList>
+                                <a href="#">Specs</a>
+                                <a href="#">Tools</a>
+                                <a href="#">Resources</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                        <FooterDropDownSection title="Technology">
+                            <FooterLinkList>
+                                <a href="#">How it works</a>
+                                <a href="#">Patterns</a>
+                                <a href="#">Usage</a>
+                                <a href="#">Products</a>
+                                <a href="#">Contracts</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                        <FooterDropDownSection title="FAQ">
+                            <FooterLinkList>
+                                <a href="#">Questions</a>
+                                <a href="#">Answers</a>
+                                <a href="#">Contact Us</a>
+                            </FooterLinkList>
+                        </FooterDropDownSection>
+                    </FooterSection>
+                    <FooterSection type="bottom" logo="Title">
+                        <FooterLinkList>
+                            <a href="#">Help</a>
+                            <a href="#">Privacy & Terms</a>
+                        </FooterLinkList>
+                    </FooterSection>
+                </Footer>
+
+                <Footer size="mini">
+                    <FooterSection type="left" logo="Title">
+                        <FooterLinkList>
+                            <a href="#">Help</a>
+                            <a href="#">Privacy & Terms</a>
+                        </FooterLinkList>
+                    </FooterSection>
+                </Footer>
+            </div>
+        );
+    }
+});
+
+// List tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <List>
+                <ListItem>Bryan Cranston</ListItem>
+                <ListItem>Aaron Paul</ListItem>
+                <ListItem>Bob Odenkirk</ListItem>
+                </List>
+
+                <List>
+                <ListItem>
+                    <ListItemContent icon="person">Bryan Cranston</ListItemContent>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent icon="person">Aaron Paul</ListItemContent>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent icon="person">Bob Odenkirk</ListItemContent>
+                </ListItem>
+                </List>
+
+                <List style={{width: '300px'}}>
+                <ListItem>
+                    <ListItemContent avatar="person">Bryan Cranston</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                </List>
+
+                <List style={{width: '300px'}}>
+                <ListItem>
+                    <ListItemContent avatar="person">Bryan Cranston</ListItemContent>
+                    <ListItemAction>
+                    <Checkbox defaultChecked />
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <Radio value={1} />
+                    </ListItemAction>
+                </ListItem>
+                <ListItem>
+                    <ListItemContent avatar="person">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <Switch defaultChecked />
+                    </ListItemAction>
+                </ListItem>
+                </List>
+
+                <List style={{width: '300px'}}>
+                <ListItem twoLine>
+                    <ListItemContent avatar="person" subtitle="62 episodes">Bryan Cranston</ListItemContent>
+                    <ListItemAction info="Actor">
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem twoLine>
+                    <ListItemContent avatar="person" subtitle="62 episodes">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem twoLine>
+                    <ListItemContent avatar="person" subtitle="62 episodes">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                </List>
+
+                <List style={{width: '650px'}}>
+                <ListItem threeLine>
+                    <ListItemContent avatar="person" subtitle="Bryan Cranston played the role of Walter in Breaking Bad. He is also known for playing Hal in Malcom in the Middle.">Bryan Cranston</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem threeLine>
+                    <ListItemContent avatar="person" subtitle="Aaron Paul played the role of Jesse in Breaking Bad. He also featured in the Need For Speed Movie.">Aaron Paul</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                <ListItem threeLine>
+                    <ListItemContent avatar="person" subtitle="Bob Odinkrik played the role of Saul in Breaking Bad. Due to public fondness for the character, Bob stars in his own show now, called Better Call Saul.">Bob Odenkirk</ListItemContent>
+                    <ListItemAction>
+                    <a href="#"><Icon name="star" /></a>
+                    </ListItemAction>
+                </ListItem>
+                </List>
+            </div>
+        );
+    }
+});
+
+// Menu tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Lower left */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-lower-left" />
+                    <Menu target="demo-menu-lower-left">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+
+                {/* Lower right */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-lower-right" />
+                    <Menu target="demo-menu-lower-right" align="right">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+
+                {/* Top left */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-top-left" />
+                    <Menu target="demo-menu-top-left" valign="top">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+
+                {/* Top right */}
+                <div style={{position: 'relative'}}>
+                    <IconButton name="more_vert" id="demo-menu-top-right" />
+                    <Menu target="demo-menu-top-right" valign="top" align="right">
+                        <MenuItem>Some Action</MenuItem>
+                        <MenuItem>Another Action</MenuItem>
+                        <MenuItem disabled>Disabled Action</MenuItem>
+                        <MenuItem>Yet Another Action</MenuItem>
+                    </Menu>
+                </div>
+            </div>
+        );
+    }
+});
+
+// ProgressBar tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple Progress Bar */}
+                <ProgressBar progress={44} />
+
+                {/* Progress Bar with Indeterminate Progress */}
+                <ProgressBar indeterminate />
+
+                {/* Progress Bar with Buffering */}
+                <ProgressBar progress={33} buffer={87} />
+            </div>
+        );
+    }
+});
+
+// Radio tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <RadioGroup name="demo" value="opt1">
+                    <Radio value="opt1" ripple>Ripple option</Radio>
+                    <Radio value="opt2">Other option</Radio>
+                </RadioGroup>
+
+                <RadioGroup container="ul" childContainer="li" name="demo2" value="opt2">
+                    <Radio value="opt1" ripple>Ripple option</Radio>
+                    <Radio value="opt2">Other option</Radio>
+                </RadioGroup>
+            </div>
+        );
+    }
+});
+
+// Slider tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Default slider */}
+                <Slider min={0} max={100} defaultValue={0} />
+
+                {/* Slider with initial value */}
+                <Slider min={0} max={100} defaultValue={25} />
+            </div>
+        );
+    }
+});
+
+// Snackbar tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div>
+                    <Button raised style={{backgroundColor: '#FF00FF'}} onClick={this.handleShowSnackbar}>Show a Snackbar</Button>
+                    <Snackbar
+                        active={false}
+                        onClick={this.handleClickActionSnackbar}
+                        onTimeout={this.handleTimeoutSnackbar}
+                        action="Undo">Button color changed.</Snackbar>
+                </div>
+                
+                <div>
+                    <Button raised onClick={this.handleShowSnackbar}>Show a Toast</Button>
+                    <Snackbar
+                        active={true}
+                        onTimeout={this.handleTimeoutSnackbar}>
+                        Lorem ipsum dolor sit amet, consectetur adipiscing elit. Fusce varius luctus quam. Fusce quis blandit libero. Donec accumsan nunc lectus, vel blandit diam bibendum ac. Integer faucibus, lorem et convallis fermentum, diam dolor imperdiet mi, nec iaculis risus mauris id elit. Vivamus vel eros dapibus, molestie ante ut, vestibulum sem.
+                    </Snackbar>
+                </div>
+            </div>
+        );
+    }
+});
+
+// Spinner tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple spinner */}
+                <Spinner />
+
+                {/* Single color spinner */}
+                <Spinner singleColor />
+            </div>
+        );
+    }
+});
+
+// Switch tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <Switch ripple id="switch1" defaultChecked>Ripple switch</Switch>
+
+                <Switch id="switch2">Switch</Switch>
+            </div>
+        );
+    }
+});
+
+// Tab tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                <div className="demo-tabs">
+                    <Tabs activeTab={this.state.activeTab} onChange={(tabId) => this.setState({ activeTab: tabId })} ripple>
+                        <Tab>Starks</Tab>
+                        <Tab>Lannisters</Tab>
+                        <Tab>Targaryens</Tab>
+                    </Tabs>
+                    <section>
+                        <div className="content">Content for the tab: {this.state.activeTab}</div>
+                    </section>
+                </div> 
+            </div>
+        );
+    }
+});
+
+// Textfield tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple textfield */}
+                <Textfield
+                    onChange={() => {}}
+                    label="Text..."
+                    style={{width: '200px'}}
+                />
+
+                {/* Numeric textfield */}
+                <Textfield
+                    onChange={() => {}}
+                    pattern="-?[0-9]*(\.[0-9]+)?"
+                    error="Input is not a number!"
+                    label="Number..."
+                    style={{width: '200px'}}
+                />
+
+                {/* Textfield with floating label */}
+                <Textfield
+                    onChange={() => {}}
+                    label="Text..."
+                    floatingLabel
+                    style={{width: '200px'}}
+                />
+
+                {/* Numeric Textfield with floating label */}
+                <Textfield
+                    onChange={() => {}}
+                    pattern="-?[0-9]*(\.[0-9]+)?"
+                    error="Input is not a number!"
+                    label="Number..."
+                    floatingLabel
+                />
+            </div>
+        );
+    }
+});
+
+// Tooltip tests
+React.createClass({
+    render: function() {
+        return (
+            <div>
+                {/* Simple tooltip */}
+                <Tooltip label="Follow">
+                    <Icon name="add" />
+                </Tooltip>
+
+                {/* Large Tooltip */}
+                <Tooltip label="Print" large>
+                    <Icon name="print" />
+                </Tooltip>
+
+                {/* Rich Tooltip */}
+                <Tooltip label={<span>Upload <strong>file.zip</strong></span>}>
+                    <Icon name="cloud_upload" />
+                </Tooltip>
+
+                {/* Multiline Tooltip */}
+                <Tooltip label={<span>Share your content<br />via social media</span>}>
+                    <Icon name="share" />
+                </Tooltip>
+
+                {/* Right Tooltip */}
+                <Tooltip label="Follow" position="right">
+                    <Icon name="arrow_forward" />
+                </Tooltip>
+
+                {/* Left Tooltip */}
+                <Tooltip label="Follow" position="left">
+                    <Icon name="arrow_back" />
+                </Tooltip>
+
+                {/* Top Tooltip */}
+                <Tooltip label="Follow" position="top">
+                    <Icon name="arrow_upward" />
+                </Tooltip>
+
+                {/* Bottom Tooltip */}
+                <Tooltip label="Follow" position="bottom">
+                    <Icon name="arrow_downward" />
+                </Tooltip>
+            </div>
+        );
+    }
+});
diff --git a/react-mdl/react-mdl.d.ts b/react-mdl/react-mdl.d.ts
index 86516b75f0..56d688c7f4 100644
--- a/react-mdl/react-mdl.d.ts
+++ b/react-mdl/react-mdl.d.ts
@@ -1,606 +1,606 @@
-// Type definitions for react-mdl 1.5.3
-// Project: https://github.com/tleunen/react-mdl
-// Definitions by: Brad Zacher <https://github.com/bradzacher>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
-
-/// <reference path="../react/react.d.ts" />
-
-declare namespace __ReactMDL {
-    import React = __React;
-    
-    type __MDLClassProps = React.ClassAttributes<any>;
-    type __MDLOtherProps = React.HTMLProps<any>;
-    class __MDLComponent<P extends __MDLClassProps> extends React.Component<P, {}> {}
-    class __MDLBasicComponent extends __MDLComponent<__MDLOtherProps> {}
-    
-    interface ShadowedComponent {
-        shadow ?: number;
-    }
-    interface RippleComponent {
-        ripple ?: boolean;
-    }
-    interface CustomRenderedComponent {
-        component ?: string | JSX.Element | Function;
-    }
-    
-    
-    // HTMLAttributes (minus the 'data', 'icon', 'label', 'name', 'rows', 'size', 'title', 'value' attributes)
-    interface MDLHTMLAttributes {
-        // React-specific Attributes
-        defaultChecked?: boolean;
-        defaultValue?: string | string[];
-
-        // Standard HTML Attributes
-        accept?: string;
-        acceptCharset?: string;
-        accessKey?: string;
-        action?: string;
-        allowFullScreen?: boolean;
-        allowTransparency?: boolean;
-        alt?: string;
-        async?: boolean;
-        autoComplete?: string;
-        autoFocus?: boolean;
-        autoPlay?: boolean;
-        capture?: boolean;
-        cellPadding?: number | string;
-        cellSpacing?: number | string;
-        charSet?: string;
-        challenge?: string;
-        checked?: boolean;
-        classID?: string;
-        className?: string;
-        cols?: number;
-        colSpan?: number;
-        content?: string;
-        contentEditable?: boolean;
-        contextMenu?: string;
-        controls?: boolean;
-        coords?: string;
-        crossOrigin?: string;
-        dateTime?: string;
-        default?: boolean;
-        defer?: boolean;
-        dir?: string;
-        disabled?: boolean;
-        download?: any;
-        draggable?: boolean;
-        encType?: string;
-        form?: string;
-        formAction?: string;
-        formEncType?: string;
-        formMethod?: string;
-        formNoValidate?: boolean;
-        formTarget?: string;
-        frameBorder?: number | string;
-        headers?: string;
-        height?: number | string;
-        hidden?: boolean;
-        high?: number;
-        href?: string;
-        hrefLang?: string;
-        htmlFor?: string;
-        httpEquiv?: string;
-        id?: string;
-        inputMode?: string;
-        integrity?: string;
-        is?: string;
-        keyParams?: string;
-        keyType?: string;
-        kind?: string;
-        lang?: string;
-        list?: string;
-        loop?: boolean;
-        low?: number;
-        manifest?: string;
-        marginHeight?: number;
-        marginWidth?: number;
-        max?: number | string;
-        maxLength?: number;
-        media?: string;
-        mediaGroup?: string;
-        method?: string;
-        min?: number | string;
-        minLength?: number;
-        multiple?: boolean;
-        muted?: boolean;
-        nonce?: string;
-        noValidate?: boolean;
-        open?: boolean;
-        optimum?: number;
-        pattern?: string;
-        placeholder?: string;
-        poster?: string;
-        preload?: string;
-        radioGroup?: string;
-        readOnly?: boolean;
-        rel?: string;
-        required?: boolean;
-        reversed?: boolean;
-        role?: string;
-        rowSpan?: number;
-        sandbox?: string;
-        scope?: string;
-        scoped?: boolean;
-        scrolling?: string;
-        seamless?: boolean;
-        selected?: boolean;
-        shape?: string;
-        sizes?: string;
-        span?: number;
-        spellCheck?: boolean;
-        src?: string;
-        srcDoc?: string;
-        srcLang?: string;
-        srcSet?: string;
-        start?: number;
-        step?: number | string;
-        style?: React.CSSProperties;
-        summary?: string;
-        tabIndex?: number;
-        target?: string;
-        type?: string;
-        useMap?: string;
-        width?: number | string;
-        wmode?: string;
-        wrap?: string;
-
-        // RDFa Attributes
-        about?: string;
-        datatype?: string;
-        inlist?: any;
-        prefix?: string;
-        property?: string;
-        resource?: string;
-        typeof?: string;
-        vocab?: string;
-
-        // Non-standard Attributes
-        autoCapitalize?: string;
-        autoCorrect?: string;
-        autoSave?: string;
-        color?: string;
-        itemProp?: string;
-        itemScope?: boolean;
-        itemType?: string;
-        itemID?: string;
-        itemRef?: string;
-        results?: number;
-        security?: string;
-        unselectable?: boolean;
-
-        // Allows aria- and data- Attributes
-        [key: string]: any;
-    }
-    // DOMAttributes (minus 'onClick', 'onChange')
-    interface MDLDOMAttributes {
-        // DOMAttributes (minus onClick)
-        children?: React.ReactNode;
-        dangerouslySetInnerHTML?: {
-            __html: string;
-        };
-
-        // Clipboard Events
-        onCopy?: React.ClipboardEventHandler;
-        onCut?: React.ClipboardEventHandler;
-        onPaste?: React.ClipboardEventHandler;
-
-        // Composition Events
-        onCompositionEnd?: React.CompositionEventHandler;
-        onCompositionStart?: React.CompositionEventHandler;
-        onCompositionUpdate?: React.CompositionEventHandler;
-
-        // Focus Events
-        onFocus?: React.FocusEventHandler;
-        onBlur?: React.FocusEventHandler;
-
-        // Form Events
-        onInput?: React.FormEventHandler;
-        onSubmit?: React.FormEventHandler;
-
-        // Image Events
-        onLoad?: React.ReactEventHandler;
-        onError?: React.ReactEventHandler; // also a Media Event
-
-        // Keyboard Events
-        onKeyDown?: React.KeyboardEventHandler;
-        onKeyPress?: React.KeyboardEventHandler;
-        onKeyUp?: React.KeyboardEventHandler;
-
-        // Media Events
-        onAbort?: React.ReactEventHandler;
-        onCanPlay?: React.ReactEventHandler;
-        onCanPlayThrough?: React.ReactEventHandler;
-        onDurationChange?: React.ReactEventHandler;
-        onEmptied?: React.ReactEventHandler;
-        onEncrypted?: React.ReactEventHandler;
-        onEnded?: React.ReactEventHandler;
-        onLoadedData?: React.ReactEventHandler;
-        onLoadedMetadata?: React.ReactEventHandler;
-        onLoadStart?: React.ReactEventHandler;
-        onPause?: React.ReactEventHandler;
-        onPlay?: React.ReactEventHandler;
-        onPlaying?: React.ReactEventHandler;
-        onProgress?: React.ReactEventHandler;
-        onRateChange?: React.ReactEventHandler;
-        onSeeked?: React.ReactEventHandler;
-        onSeeking?: React.ReactEventHandler;
-        onStalled?: React.ReactEventHandler;
-        onSuspend?: React.ReactEventHandler;
-        onTimeUpdate?: React.ReactEventHandler;
-        onVolumeChange?: React.ReactEventHandler;
-        onWaiting?: React.ReactEventHandler;
-
-        // MouseEvents
-        onContextMenu?: React.MouseEventHandler;
-        onDoubleClick?: React.MouseEventHandler;
-        onDrag?: React.DragEventHandler;
-        onDragEnd?: React.DragEventHandler;
-        onDragEnter?: React.DragEventHandler;
-        onDragExit?: React.DragEventHandler;
-        onDragLeave?: React.DragEventHandler;
-        onDragOver?: React.DragEventHandler;
-        onDragStart?: React.DragEventHandler;
-        onDrop?: React.DragEventHandler;
-        onMouseDown?: React.MouseEventHandler;
-        onMouseEnter?: React.MouseEventHandler;
-        onMouseLeave?: React.MouseEventHandler;
-        onMouseMove?: React.MouseEventHandler;
-        onMouseOut?: React.MouseEventHandler;
-        onMouseOver?: React.MouseEventHandler;
-        onMouseUp?: React.MouseEventHandler;
-
-        // Selection Events
-        onSelect?: React.ReactEventHandler;
-
-        // Touch Events
-        onTouchCancel?: React.TouchEventHandler;
-        onTouchEnd?: React.TouchEventHandler;
-        onTouchMove?: React.TouchEventHandler;
-        onTouchStart?: React.TouchEventHandler;
-
-        // UI Events
-        onScroll?: React.UIEventHandler;
-
-        // Wheel Events
-        onWheel?: React.WheelEventHandler;
-    }
-    
-    
-    
-    interface BadgeProps extends __MDLClassProps {
-        text: string | number;
-        className ?: string;
-        noBackground ?: boolean;
-        overlap ?: boolean;
-    }
-    class Badge extends __MDLComponent<BadgeProps> {}
-    
-    
-    interface ButtonProps extends __MDLOtherProps, RippleComponent, CustomRenderedComponent {
-        accent ?: boolean;
-        colored ?: boolean;
-        primary ?: boolean;
-    }
-    interface StandardButtonProps extends ButtonProps {
-        raised ?: boolean;
-    }
-    interface FABButtonProps extends ButtonProps {
-        mini ?: boolean;
-    }
-    interface IconButtonProps extends ButtonProps {
-        name ?: string;
-        raised ?: boolean;
-    }
-    class Button extends __MDLComponent<StandardButtonProps> {}
-    class FABButton extends __MDLComponent<FABButtonProps> {}
-    class IconButton extends __MDLComponent<IconButtonProps> {}
-    
-    
-    interface CardProps extends __MDLOtherProps, ShadowedComponent {}
-    interface CardActionProps extends __MDLOtherProps {
-        border ?: boolean;
-    }
-    interface CardTitleProps extends __MDLOtherProps {
-        expand ?: boolean;
-    }
-    class Card extends __MDLComponent<CardProps> {}
-    class CardActions extends __MDLComponent<CardActionProps> {}
-    class CardTitle extends __MDLComponent<CardTitleProps> {}
-    class CardText extends __MDLBasicComponent {}
-    class CardMenu extends __MDLBasicComponent {}
-    class CardMedia extends __MDLBasicComponent {}
-    
-    
-    interface CheckboxProps extends __MDLOtherProps, RippleComponent {
-        checked ?: boolean;
-        disabled ?: boolean;
-        label ?: string;
-    }
-    class Checkbox extends __MDLComponent<CheckboxProps> {}
-    
-    interface UndecoratedTableProps extends __MDLClassProps, MDLHTMLAttributes, React.DOMAttributes, ShadowedComponent {
-        rows: Array<any>;
-        rowKeyColumn ?: string;
-        
-        name ?: string;
-        title ?: string;
-    }
-    interface TableProps extends UndecoratedTableProps {
-        sortable ?: boolean;
-        selectable ?: boolean;
-        onSelectionChanged ?: (row : any) => any;
-    }
-    interface TableHeaderProps extends __MDLClassProps, MDLHTMLAttributes, MDLDOMAttributes {
-        name : string;
-        title ?: string;
-        cellFormatter ?: (value : any, row : any, index : number) => React.ReactNode;
-        numeric ?: boolean;
-        nosort ?: boolean;
-        onClick ?: (e : React.MouseEvent, name : string) => any;
-        sortFn ?: (a : any, b : any, isAsc : boolean) => number;
-        tooltip ?: React.ReactNode;
-    }
-    class Table extends __MDLComponent<TableProps> {}
-    class TableHeader extends __MDLComponent<TableHeaderProps> {}
-    class UndecoratedTable extends __MDLComponent<UndecoratedTableProps> {}
-    class DataTable extends Table {}
-    
-    
-    interface DialogProps extends __MDLOtherProps {
-        open ?: boolean;
-    }
-    interface DialogActionsProps extends __MDLOtherProps {
-        fullWidth ?: boolean;
-    }
-    interface DialogTitleProps extends __MDLOtherProps, CustomRenderedComponent {}
-    class Dialog extends __MDLComponent<DialogProps> {}
-    class DialogActions extends __MDLComponent<DialogActionsProps> {}
-    class DialogTitle extends __MDLComponent<DialogTitleProps> {}
-    class DialogContent extends __MDLBasicComponent {}
-    
-    
-    interface GridProps extends __MDLOtherProps, CustomRenderedComponent, ShadowedComponent {
-        noSpacing ?: boolean;
-    }
-    interface CellProps extends __MDLOtherProps, CustomRenderedComponent, ShadowedComponent {
-        col : number;
-        align ?: string;
-        phone ?: number;
-        tablet ?: number;
-        hideDesktop ?: boolean;
-        hidePhone ?: boolean;
-        hideTablet ?: boolean;
-    }
-    class Grid extends __MDLComponent<GridProps> {}
-    class Cell extends __MDLComponent<CellProps> {}
-    
-    
-    interface IconProps extends __MDLOtherProps {
-        name : string;
-    }
-    class Icon extends __MDLComponent<IconProps> {}
-    
-    
-    interface IconToggleProps extends __MDLOtherProps, RippleComponent {
-        name : string;
-        checked ?: boolean;
-        disabled ?: boolean;
-    }
-    class IconToggle extends __MDLComponent<IconToggleProps> {}
-    
-    
-    interface ContentProps extends __MDLOtherProps, CustomRenderedComponent {}
-    interface DrawerProps extends __MDLOtherProps {
-        title ?: string;
-    }
-    interface HeaderProps extends __MDLOtherProps {
-        title ?: string;
-        scroll ?: boolean;
-        seamed ?: boolean;
-        transparent ?: boolean;
-        waterfall ?: boolean;
-        hideTop ?: boolean;
-    }
-    interface HeaderRowProps extends __MDLOtherProps {
-        title ?: string;
-    }
-    interface HeaderTabsProps extends __MDLOtherProps, RippleComponent {
-        activeTab ?: number;
-        onChange ?: React.FormEventHandler;
-    }
-    interface LayoutProps extends __MDLOtherProps {
-        fixedDrawer ?: boolean;
-        fixedHeader ?: boolean;
-        fixedTabse ?: boolean;
-    }
-    interface NavigationProps extends __MDLOtherProps {}
-    class Content extends __MDLComponent<ContentProps> {}
-    class Drawer extends __MDLComponent<DrawerProps> {}
-    class Header extends __MDLComponent<HeaderProps> {}
-    class HeaderRow extends __MDLComponent<HeaderRowProps> {}
-    class HeaderTabs extends __MDLComponent<HeaderTabsProps> {}
-    class Layout extends __MDLComponent<LayoutProps> {}
-    class Navigation extends __MDLComponent<NavigationProps> {}
-    class Spacer extends __MDLBasicComponent {}
-    
-    interface FooterProps extends MDLHTMLAttributes, React.DOMAttributes {
-        size ?: string;
-        
-        title ?: string;
-    }
-    interface FooterDropDownSectionProps extends MDLHTMLAttributes, React.DOMAttributes {
-        size ?: string;
-        title : React.ReactNode;
-    }
-    interface FooterLinkListProps extends MDLHTMLAttributes, React.DOMAttributes {
-        size ?: string;
-        
-        title ?: string;
-    }
-    interface FooterSectionProps extends MDLHTMLAttributes, React.DOMAttributes {
-        size ?: string;
-        type ?: string;
-        logo ?: React.ReactNode;
-        
-        title ?: string;
-    }
-    class Footer extends __MDLComponent<FooterProps> {}
-    class FooterDropDownSection extends __MDLComponent<FooterDropDownSectionProps> {}
-    class FooterLinkList extends __MDLComponent<FooterLinkListProps> {}
-    class FooterSection extends __MDLComponent<FooterSectionProps> {}
-    
-    interface ListItemProps extends __MDLOtherProps {
-        twoLine ?: boolean;
-        threeLine ?: boolean;
-    }
-    interface ListItemActionProps extends __MDLOtherProps {
-        info ?: string;
-    }
-    interface ListItemContentProps extends MDLHTMLAttributes, React.DOMAttributes {
-        avatar ?: string | JSX.Element;
-        icon ?: string | JSX.Element;
-        subtitle ?: React.ReactNode;
-        useBodyClass ?: boolean;
-    }
-    class List extends __MDLBasicComponent {}
-    class ListItem extends __MDLComponent<ListItemProps> {}
-    class ListItemAction extends __MDLComponent<ListItemActionProps> {}
-    class ListItemContent extends __MDLComponent<ListItemContentProps> {}
-    
-    
-    interface MenuProps extends __MDLOtherProps, RippleComponent {
-        target : string;
-        align ?: string;
-        valign ?: string;
-    }
-    class Menu extends __MDLComponent<MenuProps> {}
-    class MenuItem extends __MDLBasicComponent {}
-    
-    
-    interface ProgressBarProps extends __MDLOtherProps {
-        buffer ?: number;
-        indeterminate ?: boolean;
-        progress ?: number;
-    }
-    class ProgressBar extends __MDLComponent<ProgressBarProps> {}
-    
-    
-    interface RadioProps extends MDLHTMLAttributes, React.DOMAttributes, RippleComponent {
-        value : string | number;
-        checked ?: boolean;
-        disabled ?: boolean;
-        name ?: string;
-        onChange ?: React.FormEventHandler;
-        label ?: string;
-    }
-    interface RadioGroupProps extends MDLHTMLAttributes, React.DOMAttributes {
-        name : string;
-        value : string | number;
-        childContainer ?: string;
-        container ?: string;
-        onChange ?: React.FormEventHandler;
-        label ?: string;
-    }
-    class Radio extends __MDLComponent<RadioProps> {}
-    class RadioGroup extends __MDLComponent<RadioGroupProps> {}
-    
-    
-    interface SliderProps extends MDLHTMLAttributes, React.DOMAttributes {
-        max : number;
-        min : number;
-        onChange ?: React.FormEventHandler;
-        value ?: number;
-    }
-    class Slider extends __MDLComponent<SliderProps> {}
-    
-    
-    interface SnackbarProps extends __MDLOtherProps {
-        active : boolean;
-        onTimeout : () => any;
-        action ?: string;
-        onActionClick ?: React.MouseEventHandler;
-        timeout ?: number;
-    }
-    class Snackbar extends __MDLComponent<SnackbarProps> {}
-    
-    
-    interface SpinnerProps extends __MDLOtherProps {
-        singleColor ?: boolean;
-    }
-    class Spinner extends __MDLComponent<SpinnerProps> {}
-    
-    
-    interface SwitchProps extends __MDLOtherProps, RippleComponent {
-        checked ?: boolean;
-        disabled ?: boolean;
-        onChange ?: React.FormEventHandler;
-    }
-    class Switch extends __MDLComponent<SwitchProps> {}
-    
-    
-    interface TabProps extends __MDLOtherProps, CustomRenderedComponent {
-        active ?: boolean;
-        cssPrefix ?: string;
-        onTabClick ?: (tabId : number) => any;
-        tabId ?: number;
-    }
-    interface TabBarProps extends MDLHTMLAttributes, MDLDOMAttributes {
-        cssPrefix : string;
-        activeTab ?: number;
-        onChange ?: (tabId : number) => any;
-        
-        name ?: string;
-        title ?: string;        
-        onClick ?: React.MouseEventHandler;
-    }
-    interface TabsProps extends MDLHTMLAttributes, MDLDOMAttributes {
-        activeTab ?: number;
-        onChange ?: (tabId : number) => any;
-        tabBarProps ?: TabBarProps;
-        
-        name ?: string;
-        title ?: string;        
-        onClick ?: React.MouseEventHandler;
-    }
-    class Tab extends __MDLComponent<TabProps> {}
-    class TabBar extends __MDLComponent<TabBarProps> {}
-    class Tabs extends __MDLComponent<TabsProps> {}
-    
-    
-    interface TextfieldProps extends MDLHTMLAttributes, React.DOMAttributes {
-        label : string;
-        disabled ?: boolean;
-        error ?: React.ReactNode;
-        expandable ?: boolean;
-        expandableIcon ?: string;
-        floatingLabel ?: boolean;
-        id ?: string;
-        inputClassName ?: string;
-        maxRows ?: number;
-        onChange ?: React.FormEventHandler;
-        pattern ?: string;
-        required ?: boolean;
-        rows ?: number;
-        value ?: string | number;
-        
-        name ?: string;
-        title ?: string;
-    }
-    class Textfield extends __MDLComponent<TextfieldProps> {}
-    
-    
-    interface TooltipProps extends MDLHTMLAttributes, React.DOMAttributes {
-        label : React.ReactNode;
-        large ?: boolean;
-        position ?: string;
-        
-        name ?: string;
-        title ?: string;
-    }
-    class Tooltip extends __MDLComponent<TooltipProps> {}
-}
-
-declare module 'react-mdl' {
-    export = __ReactMDL;
+// Type definitions for react-mdl 1.5.3
+// Project: https://github.com/tleunen/react-mdl
+// Definitions by: Brad Zacher <https://github.com/bradzacher>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../react/react.d.ts" />
+
+declare namespace __ReactMDL {
+    import React = __React;
+    
+    type __MDLClassProps = React.ClassAttributes<any>;
+    type __MDLOtherProps = React.HTMLProps<any>;
+    class __MDLComponent<P extends __MDLClassProps> extends React.Component<P, {}> {}
+    class __MDLBasicComponent extends __MDLComponent<__MDLOtherProps> {}
+    
+    interface ShadowedComponent {
+        shadow ?: number;
+    }
+    interface RippleComponent {
+        ripple ?: boolean;
+    }
+    interface CustomRenderedComponent {
+        component ?: string | JSX.Element | Function;
+    }
+    
+    
+    // HTMLAttributes (minus the 'data', 'icon', 'label', 'name', 'rows', 'size', 'title', 'value' attributes)
+    interface MDLHTMLAttributes {
+        // React-specific Attributes
+        defaultChecked?: boolean;
+        defaultValue?: string | string[];
+
+        // Standard HTML Attributes
+        accept?: string;
+        acceptCharset?: string;
+        accessKey?: string;
+        action?: string;
+        allowFullScreen?: boolean;
+        allowTransparency?: boolean;
+        alt?: string;
+        async?: boolean;
+        autoComplete?: string;
+        autoFocus?: boolean;
+        autoPlay?: boolean;
+        capture?: boolean;
+        cellPadding?: number | string;
+        cellSpacing?: number | string;
+        charSet?: string;
+        challenge?: string;
+        checked?: boolean;
+        classID?: string;
+        className?: string;
+        cols?: number;
+        colSpan?: number;
+        content?: string;
+        contentEditable?: boolean;
+        contextMenu?: string;
+        controls?: boolean;
+        coords?: string;
+        crossOrigin?: string;
+        dateTime?: string;
+        default?: boolean;
+        defer?: boolean;
+        dir?: string;
+        disabled?: boolean;
+        download?: any;
+        draggable?: boolean;
+        encType?: string;
+        form?: string;
+        formAction?: string;
+        formEncType?: string;
+        formMethod?: string;
+        formNoValidate?: boolean;
+        formTarget?: string;
+        frameBorder?: number | string;
+        headers?: string;
+        height?: number | string;
+        hidden?: boolean;
+        high?: number;
+        href?: string;
+        hrefLang?: string;
+        htmlFor?: string;
+        httpEquiv?: string;
+        id?: string;
+        inputMode?: string;
+        integrity?: string;
+        is?: string;
+        keyParams?: string;
+        keyType?: string;
+        kind?: string;
+        lang?: string;
+        list?: string;
+        loop?: boolean;
+        low?: number;
+        manifest?: string;
+        marginHeight?: number;
+        marginWidth?: number;
+        max?: number | string;
+        maxLength?: number;
+        media?: string;
+        mediaGroup?: string;
+        method?: string;
+        min?: number | string;
+        minLength?: number;
+        multiple?: boolean;
+        muted?: boolean;
+        nonce?: string;
+        noValidate?: boolean;
+        open?: boolean;
+        optimum?: number;
+        pattern?: string;
+        placeholder?: string;
+        poster?: string;
+        preload?: string;
+        radioGroup?: string;
+        readOnly?: boolean;
+        rel?: string;
+        required?: boolean;
+        reversed?: boolean;
+        role?: string;
+        rowSpan?: number;
+        sandbox?: string;
+        scope?: string;
+        scoped?: boolean;
+        scrolling?: string;
+        seamless?: boolean;
+        selected?: boolean;
+        shape?: string;
+        sizes?: string;
+        span?: number;
+        spellCheck?: boolean;
+        src?: string;
+        srcDoc?: string;
+        srcLang?: string;
+        srcSet?: string;
+        start?: number;
+        step?: number | string;
+        style?: React.CSSProperties;
+        summary?: string;
+        tabIndex?: number;
+        target?: string;
+        type?: string;
+        useMap?: string;
+        width?: number | string;
+        wmode?: string;
+        wrap?: string;
+
+        // RDFa Attributes
+        about?: string;
+        datatype?: string;
+        inlist?: any;
+        prefix?: string;
+        property?: string;
+        resource?: string;
+        typeof?: string;
+        vocab?: string;
+
+        // Non-standard Attributes
+        autoCapitalize?: string;
+        autoCorrect?: string;
+        autoSave?: string;
+        color?: string;
+        itemProp?: string;
+        itemScope?: boolean;
+        itemType?: string;
+        itemID?: string;
+        itemRef?: string;
+        results?: number;
+        security?: string;
+        unselectable?: boolean;
+
+        // Allows aria- and data- Attributes
+        [key: string]: any;
+    }
+    // DOMAttributes (minus 'onClick', 'onChange')
+    interface MDLDOMAttributes {
+        // DOMAttributes (minus onClick)
+        children?: React.ReactNode;
+        dangerouslySetInnerHTML?: {
+            __html: string;
+        };
+
+        // Clipboard Events
+        onCopy?: React.ClipboardEventHandler;
+        onCut?: React.ClipboardEventHandler;
+        onPaste?: React.ClipboardEventHandler;
+
+        // Composition Events
+        onCompositionEnd?: React.CompositionEventHandler;
+        onCompositionStart?: React.CompositionEventHandler;
+        onCompositionUpdate?: React.CompositionEventHandler;
+
+        // Focus Events
+        onFocus?: React.FocusEventHandler;
+        onBlur?: React.FocusEventHandler;
+
+        // Form Events
+        onInput?: React.FormEventHandler;
+        onSubmit?: React.FormEventHandler;
+
+        // Image Events
+        onLoad?: React.ReactEventHandler;
+        onError?: React.ReactEventHandler; // also a Media Event
+
+        // Keyboard Events
+        onKeyDown?: React.KeyboardEventHandler;
+        onKeyPress?: React.KeyboardEventHandler;
+        onKeyUp?: React.KeyboardEventHandler;
+
+        // Media Events
+        onAbort?: React.ReactEventHandler;
+        onCanPlay?: React.ReactEventHandler;
+        onCanPlayThrough?: React.ReactEventHandler;
+        onDurationChange?: React.ReactEventHandler;
+        onEmptied?: React.ReactEventHandler;
+        onEncrypted?: React.ReactEventHandler;
+        onEnded?: React.ReactEventHandler;
+        onLoadedData?: React.ReactEventHandler;
+        onLoadedMetadata?: React.ReactEventHandler;
+        onLoadStart?: React.ReactEventHandler;
+        onPause?: React.ReactEventHandler;
+        onPlay?: React.ReactEventHandler;
+        onPlaying?: React.ReactEventHandler;
+        onProgress?: React.ReactEventHandler;
+        onRateChange?: React.ReactEventHandler;
+        onSeeked?: React.ReactEventHandler;
+        onSeeking?: React.ReactEventHandler;
+        onStalled?: React.ReactEventHandler;
+        onSuspend?: React.ReactEventHandler;
+        onTimeUpdate?: React.ReactEventHandler;
+        onVolumeChange?: React.ReactEventHandler;
+        onWaiting?: React.ReactEventHandler;
+
+        // MouseEvents
+        onContextMenu?: React.MouseEventHandler;
+        onDoubleClick?: React.MouseEventHandler;
+        onDrag?: React.DragEventHandler;
+        onDragEnd?: React.DragEventHandler;
+        onDragEnter?: React.DragEventHandler;
+        onDragExit?: React.DragEventHandler;
+        onDragLeave?: React.DragEventHandler;
+        onDragOver?: React.DragEventHandler;
+        onDragStart?: React.DragEventHandler;
+        onDrop?: React.DragEventHandler;
+        onMouseDown?: React.MouseEventHandler;
+        onMouseEnter?: React.MouseEventHandler;
+        onMouseLeave?: React.MouseEventHandler;
+        onMouseMove?: React.MouseEventHandler;
+        onMouseOut?: React.MouseEventHandler;
+        onMouseOver?: React.MouseEventHandler;
+        onMouseUp?: React.MouseEventHandler;
+
+        // Selection Events
+        onSelect?: React.ReactEventHandler;
+
+        // Touch Events
+        onTouchCancel?: React.TouchEventHandler;
+        onTouchEnd?: React.TouchEventHandler;
+        onTouchMove?: React.TouchEventHandler;
+        onTouchStart?: React.TouchEventHandler;
+
+        // UI Events
+        onScroll?: React.UIEventHandler;
+
+        // Wheel Events
+        onWheel?: React.WheelEventHandler;
+    }
+    
+    
+    
+    interface BadgeProps extends __MDLClassProps {
+        text: string | number;
+        className ?: string;
+        noBackground ?: boolean;
+        overlap ?: boolean;
+    }
+    class Badge extends __MDLComponent<BadgeProps> {}
+    
+    
+    interface ButtonProps extends __MDLOtherProps, RippleComponent, CustomRenderedComponent {
+        accent ?: boolean;
+        colored ?: boolean;
+        primary ?: boolean;
+    }
+    interface StandardButtonProps extends ButtonProps {
+        raised ?: boolean;
+    }
+    interface FABButtonProps extends ButtonProps {
+        mini ?: boolean;
+    }
+    interface IconButtonProps extends ButtonProps {
+        name ?: string;
+        raised ?: boolean;
+    }
+    class Button extends __MDLComponent<StandardButtonProps> {}
+    class FABButton extends __MDLComponent<FABButtonProps> {}
+    class IconButton extends __MDLComponent<IconButtonProps> {}
+    
+    
+    interface CardProps extends __MDLOtherProps, ShadowedComponent {}
+    interface CardActionProps extends __MDLOtherProps {
+        border ?: boolean;
+    }
+    interface CardTitleProps extends __MDLOtherProps {
+        expand ?: boolean;
+    }
+    class Card extends __MDLComponent<CardProps> {}
+    class CardActions extends __MDLComponent<CardActionProps> {}
+    class CardTitle extends __MDLComponent<CardTitleProps> {}
+    class CardText extends __MDLBasicComponent {}
+    class CardMenu extends __MDLBasicComponent {}
+    class CardMedia extends __MDLBasicComponent {}
+    
+    
+    interface CheckboxProps extends __MDLOtherProps, RippleComponent {
+        checked ?: boolean;
+        disabled ?: boolean;
+        label ?: string;
+    }
+    class Checkbox extends __MDLComponent<CheckboxProps> {}
+    
+    interface UndecoratedTableProps extends __MDLClassProps, MDLHTMLAttributes, React.DOMAttributes, ShadowedComponent {
+        rows: Array<any>;
+        rowKeyColumn ?: string;
+        
+        name ?: string;
+        title ?: string;
+    }
+    interface TableProps extends UndecoratedTableProps {
+        sortable ?: boolean;
+        selectable ?: boolean;
+        onSelectionChanged ?: (row : any) => any;
+    }
+    interface TableHeaderProps extends __MDLClassProps, MDLHTMLAttributes, MDLDOMAttributes {
+        name : string;
+        title ?: string;
+        cellFormatter ?: (value : any, row : any, index : number) => React.ReactNode;
+        numeric ?: boolean;
+        nosort ?: boolean;
+        onClick ?: (e : React.MouseEvent, name : string) => any;
+        sortFn ?: (a : any, b : any, isAsc : boolean) => number;
+        tooltip ?: React.ReactNode;
+    }
+    class Table extends __MDLComponent<TableProps> {}
+    class TableHeader extends __MDLComponent<TableHeaderProps> {}
+    class UndecoratedTable extends __MDLComponent<UndecoratedTableProps> {}
+    class DataTable extends Table {}
+    
+    
+    interface DialogProps extends __MDLOtherProps {
+        open ?: boolean;
+    }
+    interface DialogActionsProps extends __MDLOtherProps {
+        fullWidth ?: boolean;
+    }
+    interface DialogTitleProps extends __MDLOtherProps, CustomRenderedComponent {}
+    class Dialog extends __MDLComponent<DialogProps> {}
+    class DialogActions extends __MDLComponent<DialogActionsProps> {}
+    class DialogTitle extends __MDLComponent<DialogTitleProps> {}
+    class DialogContent extends __MDLBasicComponent {}
+    
+    
+    interface GridProps extends __MDLOtherProps, CustomRenderedComponent, ShadowedComponent {
+        noSpacing ?: boolean;
+    }
+    interface CellProps extends __MDLOtherProps, CustomRenderedComponent, ShadowedComponent {
+        col : number;
+        align ?: string;
+        phone ?: number;
+        tablet ?: number;
+        hideDesktop ?: boolean;
+        hidePhone ?: boolean;
+        hideTablet ?: boolean;
+    }
+    class Grid extends __MDLComponent<GridProps> {}
+    class Cell extends __MDLComponent<CellProps> {}
+    
+    
+    interface IconProps extends __MDLOtherProps {
+        name : string;
+    }
+    class Icon extends __MDLComponent<IconProps> {}
+    
+    
+    interface IconToggleProps extends __MDLOtherProps, RippleComponent {
+        name : string;
+        checked ?: boolean;
+        disabled ?: boolean;
+    }
+    class IconToggle extends __MDLComponent<IconToggleProps> {}
+    
+    
+    interface ContentProps extends __MDLOtherProps, CustomRenderedComponent {}
+    interface DrawerProps extends __MDLOtherProps {
+        title ?: string;
+    }
+    interface HeaderProps extends __MDLOtherProps {
+        title ?: string;
+        scroll ?: boolean;
+        seamed ?: boolean;
+        transparent ?: boolean;
+        waterfall ?: boolean;
+        hideTop ?: boolean;
+    }
+    interface HeaderRowProps extends __MDLOtherProps {
+        title ?: string;
+    }
+    interface HeaderTabsProps extends __MDLOtherProps, RippleComponent {
+        activeTab ?: number;
+        onChange ?: React.FormEventHandler;
+    }
+    interface LayoutProps extends __MDLOtherProps {
+        fixedDrawer ?: boolean;
+        fixedHeader ?: boolean;
+        fixedTabse ?: boolean;
+    }
+    interface NavigationProps extends __MDLOtherProps {}
+    class Content extends __MDLComponent<ContentProps> {}
+    class Drawer extends __MDLComponent<DrawerProps> {}
+    class Header extends __MDLComponent<HeaderProps> {}
+    class HeaderRow extends __MDLComponent<HeaderRowProps> {}
+    class HeaderTabs extends __MDLComponent<HeaderTabsProps> {}
+    class Layout extends __MDLComponent<LayoutProps> {}
+    class Navigation extends __MDLComponent<NavigationProps> {}
+    class Spacer extends __MDLBasicComponent {}
+    
+    interface FooterProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        
+        title ?: string;
+    }
+    interface FooterDropDownSectionProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        title : React.ReactNode;
+    }
+    interface FooterLinkListProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        
+        title ?: string;
+    }
+    interface FooterSectionProps extends MDLHTMLAttributes, React.DOMAttributes {
+        size ?: string;
+        type ?: string;
+        logo ?: React.ReactNode;
+        
+        title ?: string;
+    }
+    class Footer extends __MDLComponent<FooterProps> {}
+    class FooterDropDownSection extends __MDLComponent<FooterDropDownSectionProps> {}
+    class FooterLinkList extends __MDLComponent<FooterLinkListProps> {}
+    class FooterSection extends __MDLComponent<FooterSectionProps> {}
+    
+    interface ListItemProps extends __MDLOtherProps {
+        twoLine ?: boolean;
+        threeLine ?: boolean;
+    }
+    interface ListItemActionProps extends __MDLOtherProps {
+        info ?: string;
+    }
+    interface ListItemContentProps extends MDLHTMLAttributes, React.DOMAttributes {
+        avatar ?: string | JSX.Element;
+        icon ?: string | JSX.Element;
+        subtitle ?: React.ReactNode;
+        useBodyClass ?: boolean;
+    }
+    class List extends __MDLBasicComponent {}
+    class ListItem extends __MDLComponent<ListItemProps> {}
+    class ListItemAction extends __MDLComponent<ListItemActionProps> {}
+    class ListItemContent extends __MDLComponent<ListItemContentProps> {}
+    
+    
+    interface MenuProps extends __MDLOtherProps, RippleComponent {
+        target : string;
+        align ?: string;
+        valign ?: string;
+    }
+    class Menu extends __MDLComponent<MenuProps> {}
+    class MenuItem extends __MDLBasicComponent {}
+    
+    
+    interface ProgressBarProps extends __MDLOtherProps {
+        buffer ?: number;
+        indeterminate ?: boolean;
+        progress ?: number;
+    }
+    class ProgressBar extends __MDLComponent<ProgressBarProps> {}
+    
+    
+    interface RadioProps extends MDLHTMLAttributes, React.DOMAttributes, RippleComponent {
+        value : string | number;
+        checked ?: boolean;
+        disabled ?: boolean;
+        name ?: string;
+        onChange ?: React.FormEventHandler;
+        label ?: string;
+    }
+    interface RadioGroupProps extends MDLHTMLAttributes, React.DOMAttributes {
+        name : string;
+        value : string | number;
+        childContainer ?: string;
+        container ?: string;
+        onChange ?: React.FormEventHandler;
+        label ?: string;
+    }
+    class Radio extends __MDLComponent<RadioProps> {}
+    class RadioGroup extends __MDLComponent<RadioGroupProps> {}
+    
+    
+    interface SliderProps extends MDLHTMLAttributes, React.DOMAttributes {
+        max : number;
+        min : number;
+        onChange ?: React.FormEventHandler;
+        value ?: number;
+    }
+    class Slider extends __MDLComponent<SliderProps> {}
+    
+    
+    interface SnackbarProps extends __MDLOtherProps {
+        active : boolean;
+        onTimeout : () => any;
+        action ?: string;
+        onActionClick ?: React.MouseEventHandler;
+        timeout ?: number;
+    }
+    class Snackbar extends __MDLComponent<SnackbarProps> {}
+    
+    
+    interface SpinnerProps extends __MDLOtherProps {
+        singleColor ?: boolean;
+    }
+    class Spinner extends __MDLComponent<SpinnerProps> {}
+    
+    
+    interface SwitchProps extends __MDLOtherProps, RippleComponent {
+        checked ?: boolean;
+        disabled ?: boolean;
+        onChange ?: React.FormEventHandler;
+    }
+    class Switch extends __MDLComponent<SwitchProps> {}
+    
+    
+    interface TabProps extends __MDLOtherProps, CustomRenderedComponent {
+        active ?: boolean;
+        cssPrefix ?: string;
+        onTabClick ?: (tabId : number) => any;
+        tabId ?: number;
+    }
+    interface TabBarProps extends MDLHTMLAttributes, MDLDOMAttributes {
+        cssPrefix : string;
+        activeTab ?: number;
+        onChange ?: (tabId : number) => any;
+        
+        name ?: string;
+        title ?: string;        
+        onClick ?: React.MouseEventHandler;
+    }
+    interface TabsProps extends MDLHTMLAttributes, MDLDOMAttributes {
+        activeTab ?: number;
+        onChange ?: (tabId : number) => any;
+        tabBarProps ?: TabBarProps;
+        
+        name ?: string;
+        title ?: string;        
+        onClick ?: React.MouseEventHandler;
+    }
+    class Tab extends __MDLComponent<TabProps> {}
+    class TabBar extends __MDLComponent<TabBarProps> {}
+    class Tabs extends __MDLComponent<TabsProps> {}
+    
+    
+    interface TextfieldProps extends MDLHTMLAttributes, React.DOMAttributes {
+        label : string;
+        disabled ?: boolean;
+        error ?: React.ReactNode;
+        expandable ?: boolean;
+        expandableIcon ?: string;
+        floatingLabel ?: boolean;
+        id ?: string;
+        inputClassName ?: string;
+        maxRows ?: number;
+        onChange ?: React.FormEventHandler;
+        pattern ?: string;
+        required ?: boolean;
+        rows ?: number;
+        value ?: string | number;
+        
+        name ?: string;
+        title ?: string;
+    }
+    class Textfield extends __MDLComponent<TextfieldProps> {}
+    
+    
+    interface TooltipProps extends MDLHTMLAttributes, React.DOMAttributes {
+        label : React.ReactNode;
+        large ?: boolean;
+        position ?: string;
+        
+        name ?: string;
+        title ?: string;
+    }
+    class Tooltip extends __MDLComponent<TooltipProps> {}
+}
+
+declare module 'react-mdl' {
+    export = __ReactMDL;
 }
\ No newline at end of file

From 1a9ae17cbfab09dcd46bf93f5eebee650aa65f5b Mon Sep 17 00:00:00 2001
From: Brad Zacher <brad.zacher@gmail.com>
Date: Sun, 24 Apr 2016 14:17:43 +0930
Subject: [PATCH 048/278] fixed es6 compilation

---
 react-mdl/react-mdl-tests.tsx | 1 +
 1 file changed, 1 insertion(+)

diff --git a/react-mdl/react-mdl-tests.tsx b/react-mdl/react-mdl-tests.tsx
index 8efcebee52..1e7fd19b0c 100644
--- a/react-mdl/react-mdl-tests.tsx
+++ b/react-mdl/react-mdl-tests.tsx
@@ -1,6 +1,7 @@
 // Test file for react-mdl Definition file
 /// <reference path="react-mdl.d.ts" />
 
+import * as React from 'react';
 import {Badge,
     FABButton, Button, IconButton,
     Card, CardActions, CardTitle, CardText, CardMenu, CardMedia,

From 9d139b8fa6c2bbf0bb151e5a1521ebc50418a367 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andr=C3=A9=20Luiz=20dos=20Santos?=
 <andre@a.fastville.com.br>
Date: Thu, 28 Apr 2016 10:28:35 -0300
Subject: [PATCH 049/278] Add type definitions for RxJS bindings for Node

---
 rx-node/rx.node-tests.ts | 52 +++++++++++++++++++++++++++
 rx-node/rx.node.d.ts     | 77 ++++++++++++++++++++++++++++++++++++++++
 2 files changed, 129 insertions(+)
 create mode 100644 rx-node/rx.node-tests.ts
 create mode 100644 rx-node/rx.node.d.ts

diff --git a/rx-node/rx.node-tests.ts b/rx-node/rx.node-tests.ts
new file mode 100644
index 0000000000..254ef6e242
--- /dev/null
+++ b/rx-node/rx.node-tests.ts
@@ -0,0 +1,52 @@
+// Type definitions for RxJS bindings for Node
+// Project: https://github.com/Reactive-Extensions/rx-node
+// Definitions by: Andre Luiz dos Santos <https://github.com/andre-luiz-dos-santos/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+/// <reference path="rx.node.d.ts" />
+
+import RxNode = require('rx-node');
+
+{
+	var source = Rx.Observable.return(42);
+	var emitter = RxNode.toEventEmitter(source, 'data');
+
+	emitter.on('data', function(data: number) {
+		console.log('Data: ' + data);
+	});
+
+	emitter.on('end', function() {
+		console.log('End');
+	});
+
+	// Ensure to call publish to fire events from the observable
+	emitter.publish();
+}
+{
+	var subscription = RxNode.fromStream<string>(process.stdin, 'end')
+		.subscribe(function(x) { console.log(x); });
+}
+{
+	var subscription = RxNode.fromReadableStream(process.stdin)
+		.subscribe(function(x) { console.log(x); });
+}
+{
+	var readline = require('readline');
+	var fs = require('fs');
+
+	var rl = readline.createInterface({
+		input: fs.createReadStream('sample.txt')
+	});
+
+	var subscription = RxNode.fromReadLineStream(rl)
+		.subscribe(function(x) { console.log(x); });
+}
+{
+	var subscription = RxNode.fromWritableStream(process.stdout)
+		.subscribe(function(x) { console.log(x); });
+}
+{
+	var source = Rx.Observable.range(0, 5);
+	var subscription = RxNode.writeToStream(source, process.stdout, 'utf8');
+}
diff --git a/rx-node/rx.node.d.ts b/rx-node/rx.node.d.ts
new file mode 100644
index 0000000000..14af714359
--- /dev/null
+++ b/rx-node/rx.node.d.ts
@@ -0,0 +1,77 @@
+// Type definitions for RxJS bindings for Node
+// Project: https://github.com/Reactive-Extensions/rx-node
+// Definitions by: Andre Luiz dos Santos <https://github.com/andre-luiz-dos-santos/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+/// <reference path="../rx/rx.d.ts" />
+
+declare namespace RxNode {
+
+	export interface PublishableEventEmitter extends NodeJS.EventEmitter {
+		publish(): void;
+	}
+
+	/**
+	 * Converts the given observable sequence to an event emitter with the given event name.
+	 * The errors are handled on the 'error' event and completion on the 'end' event.
+	 * You must call publish in order to invoke the subscription on the Observable sequence.
+	 * @param {Observable} observable The observable sequence to convert to an EventEmitter.
+	 * @param {String} eventName The event name to emit onNext calls.
+	 * @returns {EventEmitter} An EventEmitter which emits the given eventName for each onNext call in addition to 'error' and 'end' events.
+	 */
+	function toEventEmitter<T>(observable: Rx.Observable<T>, eventName: string): RxNode.PublishableEventEmitter;
+
+	/**
+	 * Converts a flowing stream to an Observable sequence.
+	 * @param {Stream} stream A stream to convert to a observable sequence.
+	 * @param {String} [finishEventName] Event that notifies about closed stream. ("end" by default)
+	 * @param {String} [dataEventName] Event that notifies about incoming data. ("data" by default)
+	 * @returns {Observable} An observable sequence which fires on each 'data' event as well as handling 'error' and finish events like `end` or `finish`.
+	 */
+	function fromStream<T>(stream: NodeJS.ReadableStream, finishEventName?: string, dataEventName?: string): Rx.Observable<T>;
+
+	/**
+	 * Converts a flowing readable stream to an Observable sequence.
+	 * @param {Stream} stream A stream to convert to a observable sequence.
+	 * @param {String} [dataEventName] Event that notifies about incoming data. ("data" by default)
+	 * @returns {Observable} An observable sequence which fires on each 'data' event as well as handling 'error' and 'end' events.
+	 */
+	function fromReadableStream<T>(stream: NodeJS.ReadableStream, dataEventName?: string): Rx.Observable<T>;
+
+	/**
+	 * Converts a flowing readline stream to an Observable sequence.
+	 * @param {Stream} stream A stream to convert to a observable sequence.
+	 * @returns {Observable} An observable sequence which fires on each 'data' event as well as handling 'error' and 'end' events.
+	 */
+	function fromReadLineStream<T>(stream: NodeJS.ReadableStream): Rx.Observable<T>;
+
+	/**
+	 * Converts a flowing writeable stream to an Observable sequence.
+	 * @param {Stream} stream A stream to convert to a observable sequence.
+	 * @returns {Observable} An observable sequence which fires on each 'data' event as well as handling 'error' and 'finish' events.
+	 */
+	function fromWritableStream<T>(stream: NodeJS.WritableStream): Rx.Observable<T>;
+
+	/**
+	 * Converts a flowing transform stream to an Observable sequence.
+	 * @param {Stream} stream A stream to convert to a observable sequence.
+	 * @param {String} [dataEventName] Event that notifies about incoming data. ("data" by default)
+	 * @returns {Observable} An observable sequence which fires on each 'data' event as well as handling 'error' and 'finish' events.
+	 */
+	function fromTransformStream<T>(stream: NodeJS.ReadWriteStream, dataEventName?: string): Rx.Observable<T>;
+
+	/**
+	 * Writes an observable sequence to a stream
+	 * @param {Observable} observable Observable sequence to write to a stream.
+	 * @param {Stream} stream The stream to write to.
+	 * @param {String} [encoding] The encoding of the item to write.
+	 * @returns {Disposable} The subscription handle.
+	 */
+	function writeToStream<T>(observable: Rx.Observable<T>, stream: NodeJS.WritableStream, encoding: string): Rx.Disposable;
+
+}
+
+declare module "rx-node" {
+	export = RxNode;
+}

From ed57459c850839fefe5aad6d7b0de12b958afd4e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andr=C3=A9=20Luiz=20dos=20Santos?=
 <andre@a.fastville.com.br>
Date: Thu, 28 Apr 2016 12:04:03 -0300
Subject: [PATCH 050/278] Remove import from test file to compile with --target
 es6

---
 rx-node/rx.node-tests.ts | 2 --
 1 file changed, 2 deletions(-)

diff --git a/rx-node/rx.node-tests.ts b/rx-node/rx.node-tests.ts
index 254ef6e242..b5450e9945 100644
--- a/rx-node/rx.node-tests.ts
+++ b/rx-node/rx.node-tests.ts
@@ -6,8 +6,6 @@
 /// <reference path="../node/node.d.ts" />
 /// <reference path="rx.node.d.ts" />
 
-import RxNode = require('rx-node');
-
 {
 	var source = Rx.Observable.return(42);
 	var emitter = RxNode.toEventEmitter(source, 'data');

From a1433356ad561652fa76872bd7e3ac628e8bfe87 Mon Sep 17 00:00:00 2001
From: Atanas Atanasov <nascovt@gmail.com>
Date: Sat, 30 Apr 2016 14:15:09 +0300
Subject: [PATCH 051/278] Update grid.d.ts

---
 gijgo/grid.d.ts | 137 +++++++++++++++++++++++++++++++++++++-----------
 1 file changed, 105 insertions(+), 32 deletions(-)

diff --git a/gijgo/grid.d.ts b/gijgo/grid.d.ts
index ff5802482f..5864f2efd6 100644
--- a/gijgo/grid.d.ts
+++ b/gijgo/grid.d.ts
@@ -3,48 +3,121 @@
 // Definitions by: Atanas Atanasov <https://github.com/atatanasov>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-interface DataGridPager {
+interface GridPager {
     limit: number;
-    sizes: Array<number>
+    sizes: Array<number>;
+    leftControls?: any;
+    rightControls?: any;
 }
 
-interface DataGridColumn {
-    title?: any;
-    field?: any;
+interface GridColumn {
     align?: string;
-    type?: string;
-    icon?: string;
-    tooltip?: string;
+    cssClass?: string;
+    decimalDigits?: number;
+    editor?: any;
     events?: any;
-    sortable?: boolean;
-    width?: number;
+    field?: string;
+    format?: string;
     headerCssClass?: string;
-}
-
-interface DataGridSettings<Entity> {
-    title?: string;
-    dataSource?: any;
-    primaryKey?: any;
-    selectionType?: string;
-    selectionMethod?: string;
-    uiLibrary?: string;
-    autoLoad?: boolean;
-    pager?: DataGridPager;
-    params?: any;
-    notFoundText?: string;
+    hidden?: boolean;
+    icon?: string;
     minWidth?: number;
-    columns?: Array<DataGridColumn>;
-    defaultColumnSettings?: DataGridColumn;
+    priority?: number;
+    sortable?: boolean;
+    stopPropagation?: boolean;
+    title?: any;
+    tmpl?: string;
+    tooltip?: string;
+    type?: string;
+    width?: number;
 }
 
-interface DataGrid<Params, Entity> extends JQuery {
-    reload(params?: Params): void;
-    getById(id: number): Entity;
-    getAll(): Entity[];
-    setSelected(id: number, value: any): void;
+interface GridDefaultParams {
+    direction?: string;
+    limit?: string;
+    page?: string;
+    sortBy?: string;
+}
+
+interface GridMapping {
+    dataField?: string;
+    totalRecordsField?: string;
+}
+
+interface GridSettings<Entity> {
+    //Configuration options
+    autoGenerateColumns?: boolean;
+    autoLoad?: boolean;
+    columns?: Array<GridColumn>;
+    dataSource?: any;
+    defaultColumnSettings?: GridColumn;
+    defaultParams?: GridDefaultParams;
+    detailTemplate?: string;
+    fontSize?: string;
+    mapping?: string;
+    minWidth?: number;
+    notFoundText?: string;
+    pager?: GridPager;
+    primaryKey?: string;
+    resizableColumns?: boolean;
+    resizeCheckInterval?: number;
+    responsive?: boolean;
+    selectionMethod?: string;
+    selectionType?: string;
+    showHiddenColumnsAsDetails?: boolean;
+    title?: string;
+    toolbarTemplate?: string;
+    uiLibrary?: string;
+    width?: number;
+    params?: any;
+
+    //Events
+    beforeEmptyRowInsert(e: any, $row: JQuery);
+    cellDataBound(e: any, $wrapper: JQuery, id: string, column: GridColumn, record: Entity);
+    cellDataChanged(e: any, $cell: JQuery, column: GridColumn, record: Entity, oldValue: any, newValue: any);
+    columnHide(e: any, column: GridColumn);
+    columnShow(e: any, column: GridColumn);
+    dataBinding(e: any, records: Array<Entity>);
+    dataBound(e: any, records: Array<Entity>, totalRecords: number);
+    destroying(e: any);
+    detailCollapse(e: any, detailWrapper: JQuery, record: Entity);
+    detailExpand(e: any, detailWrapper: JQuery, record: Entity);
+    initialized(e: any);
+    pageChanging(e: any, newPage: number);
+    pageSizeChange(e: any, newPage: number);
+    resize(e: any, newWidth: number, oldWidth: number);
+    rowDataBound(e: any, $row: JQuery, id: string, record: Entity);
+    rowRemoving(e: any, $row: JQuery, id: string, record: Entity);
+    rowSelect(e: any, $row: JQuery, id: string, record: Entity);
+    rowUnselect(e: any, $row: JQuery, id: string, record: Entity);
+}
+
+interface Grid<Entity, Params> extends JQuery {
+    addRow(record: Entity): Grid<Entity, Params>;
+    clear(showNotFoundText?: boolean): Grid<Entity, Params>;
+    count(): number;
+    destroy(keepTableTag?: boolean, keepWrapperTag?: boolean): void; 
+    //get(position: number): Entity; //TODO: rename to getByPosition to avoid conflicts with jquery.get
+    getAll(): Array<Entity>;
+    getById(id: string): Entity;
+    getChanges(): Array<Entity>;
+    getSelected(): string;
+    getSelections(): Array<string>;
+    hideColumn(field: string): Grid<Entity, Params>;
+    makeResponsive(): void;
+    reload(params?: Params): Grid<Entity, Params>;
+    removeRow(id: string): Grid<Entity, Params>;
+    render(response: any): Grid<Entity, Params>;
+    selectAll(): Grid<Entity, Params>;   
+    setSelected(id: string): Grid<Entity, Params>;
+    showColumn(field: string): Grid<Entity, Params>;
+    title(text: any): any;
+    unSelectAll(): Grid<Entity, Params>;
+    updateRow(id: string, record: Entity): Grid<Entity, Params>;
 }
 
 interface JQuery {
-    grid<Params, Entity>(settings: DataGridSettings<Entity>): DataGrid<Params, Entity>;
-    grid(settings: DataGridSettings<any>): DataGrid<any, any>;
+    grid(settings: GridSettings<any>): Grid<any, any>;
+    grid<Entity>(settings: GridSettings<Entity>): Grid<Entity, any>;
+    grid<Entity, Params>(settings: GridSettings<Entity>): Grid<Entity, Params>;
 }

From fbe96b9a971ede4e42aab0a839ca533f6ffd7b12 Mon Sep 17 00:00:00 2001
From: Pascal Birchler <pascal.birchler@gmail.com>
Date: Sun, 1 May 2016 15:58:24 +0200
Subject: [PATCH 052/278] Jasmine: Document `Env.throwOnExpectationFailure`

---
 jasmine/jasmine.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/jasmine/jasmine.d.ts b/jasmine/jasmine.d.ts
index aa3acdfbf8..8f7e725195 100644
--- a/jasmine/jasmine.d.ts
+++ b/jasmine/jasmine.d.ts
@@ -179,6 +179,7 @@ declare namespace jasmine {
         addCustomEqualityTester(equalityTester: CustomEqualityTester): void;
         addMatchers(matchers: CustomMatcherFactories): void;
         specFilter(spec: Spec): boolean;
+        throwOnExpectationFailure(value: boolean): void;
     }
 
     interface FakeTimer {

From d659fd52710b61078776be74a7604bd98a2398fd Mon Sep 17 00:00:00 2001
From: Brad Zacher <brad.zacher@gmail.com>
Date: Wed, 4 May 2016 12:07:27 +0930
Subject: [PATCH 053/278] added o.js

---
 o.js/o.js-tests.ts | 151 +++++++++++++++++++++++++++++++++++++++++++++
 o.js/o.js.d.ts     |  70 +++++++++++++++++++++
 2 files changed, 221 insertions(+)
 create mode 100644 o.js/o.js-tests.ts
 create mode 100644 o.js/o.js.d.ts

diff --git a/o.js/o.js-tests.ts b/o.js/o.js-tests.ts
new file mode 100644
index 0000000000..9ef2f05606
--- /dev/null
+++ b/o.js/o.js-tests.ts
@@ -0,0 +1,151 @@
+/// <reference path="o.js.d.ts" /> 
+
+import o = require('o.js');
+
+interface Product {
+    ID : number;
+    Name : string;
+    Description : string;
+    ReleaseDate : string;
+    DiscontinuedDate : Date;
+    Rating: number;
+    Price: number;
+}
+interface Category {
+    ID : number;
+    Name : string;
+}
+
+// copy pasta all the examples from the readme!
+
+o('http://services.odata.org/V4/OData/OData.svc/Products')
+    .get<Product>(function(data) {
+        console.log(data); //returns an array of Product data
+    });
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products')
+    .take(5)
+    .skip(2)
+    .get<Product>(function(data) {
+        console.log(data); //An array of 5 products skiped by 2
+    });
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products')
+    .find(':0')
+    .route<Product>('Product/Detail/:0/:1',function(data) {
+        console.log('Route Product/Detail/'+this.param[0]+'/'+this.param[1]+' triggered. Result:');
+        console.log(data);
+    });
+
+
+
+var oHandler = o('http://services.odata.org/V4/OData/OData.svc/Products');
+//do somehtting
+oHandler.find(1);
+// do some more................
+//get the data
+oHandler.get<Product>(function(data) {
+    console.log(data);
+    //or the saved var also contains the data:
+    console.log(oHandler.data);
+});
+
+
+
+Q.all<any>([
+    o('http://services.odata.org/V4/OData/OData.svc/Products(4)').get<Product>(),
+    o('http://services.odata.org/V4/OData/OData.svc/Categories').take(2).get<Category[]>()
+]).then(function(oHandlerArray) {
+    //The oHandler array contains the Product oHandler and the Group oHandler:
+    console.log(oHandlerArray[0].data); // 1 Product with id 4
+    console.log(oHandlerArray[1].data.length); // 2 Categories
+});
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products(2)')
+    .get<Product>()
+    .then(function(oHandler) {
+        console.log(oHandler.data);
+    }).fail(function(ex) {
+        console.log(ex);
+    });
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products')
+    .post({Name:'Example 1',Description:'a'})
+    .post({Name:'Example 2',Description:'b'})
+    .save<Product>(function(data) {
+        console.log("Two Products added");
+    });
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products(1)')
+    .patch({Name:'NewName'})
+    .save<Product>(function(data) {
+        console.log("Product Name changed");
+    });
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products(1)')
+    .remove()
+    .save<Product>(function(data) {
+        console.log("Product deleted");
+    });
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products(1)')
+    .ref('Categories', 2)
+    .save<Product>(function(data) {
+        console.log("Product(1) associated with Categories(2)");
+    });
+
+
+
+o('http://services.odata.org/V4/OData/OData.svc/Products')
+    .find(2)
+    .get<Product>()
+    .then(function(oHandler) {
+        oHandler.data.Name="NewName";
+        return(o.save<Product>());
+    }).then(function(oHandler) {
+        console.log(oHandler.data.Name); //NewName
+    }).fail(function(ex) {
+        console.log("error");
+    });
+
+
+
+// set an endpoint
+o().config({
+    endpoint:'http://services.odata.org/V4/OData/OData.svc'
+});
+// after you have set an endpoint, you can shorten your queries:
+o('Products').get<Product>(function(data) {
+    //same result like the first exmple on this page
+});
+
+
+
+//basic config
+o().config({
+    endpoint:null,    // your odata endpoint for the service
+    json:true,        // currently only json is supported
+    version:4,        // oData version (currently supported version 4. However most also work with version 3.)
+    strictMode:true,  // strict mode throws exception, non strict mode only logs them
+    start:null,       // a function which is executed on loading
+    ready:null,       // a function which is executed on ready
+    error:null,       // a function which is executed on error
+    headers:[],       // a array of additional headers e.g.: [{name:'headername',value:'headervalue'}]
+    username:null,    // a basic auth username
+    password:null,    // a basic auth password
+    isAsync:true      //set this to false to make synced (a)jax calls. (dosn't work with basic auth!)
+});
\ No newline at end of file
diff --git a/o.js/o.js.d.ts b/o.js/o.js.d.ts
new file mode 100644
index 0000000000..aebf0d3ead
--- /dev/null
+++ b/o.js/o.js.d.ts
@@ -0,0 +1,70 @@
+// Type definitions for o.js
+// Project: https://github.com/janhommes/o.js
+// Definitions by: Matteo Antony Mistretta <https://github.com/IceOnFire>, Brad Zacher <https://github.com/bradzacher>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../q/Q.d.ts" />
+
+interface Options {
+    endpoint : string
+    json ?: boolean
+    version ?: number
+    strictMode ?: boolean
+    start ?: () => any
+    ready ?: () => any
+    error ?: () => any
+    headers ?: string[]
+    username ?: string
+    password ?: string
+    isAsync ?: boolean
+}
+
+interface OHandler<T> {
+    inlinecount : number
+    data : T
+
+    config<T>(options ?: Options) : OHandler<T>
+
+    get<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
+    save<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
+
+    route<T>(path : string, callback ?: (data : T) => void)
+
+    find<T>(selector : string|number) : OHandler<T>
+
+    top<T>(quantity : number) : OHandler<T>
+    take<T>(quantity : number) : OHandler<T>
+    skip<T>(quantity : number) : OHandler<T>
+    first<T>() : OHandler<T>
+
+    filter<T>(filter : string) : OHandler<T>
+    where<T>(filter : string) : OHandler<T>
+    any<T>(filter : string, resource : string) : OHandler<T>
+    search<T>(columns : string[], term : string) : OHandler<T>
+
+    orderBy<T>(column : string, direction ?: boolean) : OHandler<T>
+    orderByDesc<T>(column : string) : OHandler<T>
+
+    count<T>() : OHandler<T>
+    inlineCount<T>(paramName ?: string) : OHandler<T>
+
+    batch<T>(resource : string) : OHandler<T>
+    expand<T>(resource : string) : OHandler<T>
+    ref<T>(resource : string, id : string|number) : OHandler<T>
+
+    post<T>(params : any) : OHandler<T>
+    patch<T>(params : any) : OHandler<T>
+    put<T>(params : any) : OHandler<T>
+
+    remove<T>(params ?: any) : OHandler<T>
+}
+
+interface OFn<T> extends OHandler<T> {
+    (options ?: string | Options) : OHandler<T>
+}
+
+declare var o : OFn<{}>;
+
+declare module 'o.js' {
+    export = o
+}
\ No newline at end of file

From e53fff78e250bbfd9d109163200ca85f5e98f979 Mon Sep 17 00:00:00 2001
From: Brad Zacher <brad.zacher@gmail.com>
Date: Wed, 4 May 2016 12:37:13 +0930
Subject: [PATCH 054/278] added some additional functionality found in src

added version num
---
 o.js/o.js.d.ts | 31 ++++++++++++++++++++++---------
 1 file changed, 22 insertions(+), 9 deletions(-)

diff --git a/o.js/o.js.d.ts b/o.js/o.js.d.ts
index aebf0d3ead..d92614a0c0 100644
--- a/o.js/o.js.d.ts
+++ b/o.js/o.js.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for o.js
+// Type definitions for o.js v0.2.2
 // Project: https://github.com/janhommes/o.js
 // Definitions by: Matteo Antony Mistretta <https://github.com/IceOnFire>, Brad Zacher <https://github.com/bradzacher>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -24,11 +24,23 @@ interface OHandler<T> {
     data : T
 
     config<T>(options ?: Options) : OHandler<T>
+    progress<T>(callback : () => any) : OHandler<T>
 
     get<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
     save<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
+    
+    post<T>(params : any) : OHandler<T>
+    patch<T>(params : any) : OHandler<T>
+    put<T>(params : any) : OHandler<T>
+    remove<T>(params ?: any) : OHandler<T>
 
-    route<T>(path : string, callback ?: (data : T) => void)
+    routes<T>(path : string, callback ?: (data : T) => void) : OHandler<T>
+    route<T>(path : string, callback ?: (data : T) => void) : OHandler<T>
+    triggerRoute(hash : string) : OHandler<T>
+    beforeRouting(callback : (routeParams : any) => boolean) : OHandler<T> 
+
+    isEndpoint() : boolean
+    loading<T>(startFn : () => any | boolean, endFn : () => any) : OHandler<T>
 
     find<T>(selector : string|number) : OHandler<T>
 
@@ -37,6 +49,10 @@ interface OHandler<T> {
     skip<T>(quantity : number) : OHandler<T>
     first<T>() : OHandler<T>
 
+    include<T>(column : string, data : string) : OHandler<T>
+    exclude<T>(column : string, data : string) : OHandler<T>
+    filterByList<T>(column : string, data : string) : OHandler<T>
+
     filter<T>(filter : string) : OHandler<T>
     where<T>(filter : string) : OHandler<T>
     any<T>(filter : string, resource : string) : OHandler<T>
@@ -44,19 +60,16 @@ interface OHandler<T> {
 
     orderBy<T>(column : string, direction ?: boolean) : OHandler<T>
     orderByDesc<T>(column : string) : OHandler<T>
+    select<T>(selectStr : string) : OHandler<T>
 
     count<T>() : OHandler<T>
     inlineCount<T>(paramName ?: string) : OHandler<T>
 
     batch<T>(resource : string) : OHandler<T>
     expand<T>(resource : string) : OHandler<T>
-    ref<T>(resource : string, id : string|number) : OHandler<T>
-
-    post<T>(params : any) : OHandler<T>
-    patch<T>(params : any) : OHandler<T>
-    put<T>(params : any) : OHandler<T>
-
-    remove<T>(params ?: any) : OHandler<T>
+    ref<T>(resource : string, id : string | number) : OHandler<T>
+    removeRef<T>(resource : string, id : string | number) : OHandler<T>
+    deleteRef<T>(resource : string, id : string | number) : OHandler<T>
 }
 
 interface OFn<T> extends OHandler<T> {

From 5db72154fd1882bc3ac6c3ea24e50c49985fdcae Mon Sep 17 00:00:00 2001
From: delphinus <delphinus@remora.cx>
Date: Thu, 5 May 2016 20:51:36 +0900
Subject: [PATCH 055/278] Add methods derived from underscore.js

---
 backbone/backbone-global.d.ts | 102 ++++++++++++++++++++--------------
 1 file changed, 60 insertions(+), 42 deletions(-)

diff --git a/backbone/backbone-global.d.ts b/backbone/backbone-global.d.ts
index b42b6208ad..d87e5d33f2 100644
--- a/backbone/backbone-global.d.ts
+++ b/backbone/backbone-global.d.ts
@@ -172,8 +172,12 @@ declare namespace Backbone {
         invert(): any;
         pick(keys: string[]): any;
         pick(...keys: string[]): any;
+        pick(fn: (value: any, key: any, object: any) => any): any;
         omit(keys: string[]): any;
         omit(...keys: string[]): any;
+        omit(fn: (value: any, key: any, object: any) => any): any;
+        chain(): any;
+        isEmpty(): boolean;
     }
 
     class Collection<TModel extends Model> extends ModelBase {
@@ -222,58 +226,72 @@ declare namespace Backbone {
         private _removeReference(model: TModel): void;
         private _onModelEvent(event: string, model: TModel, collection: Collection<TModel>, options: any): void;
 
+        /**
+         * Return a shallow copy of this collection's models, using the same options as native Array#slice.
+         */
+        slice(min: number, max?: number): TModel[];
+
         // mixins from underscore
 
-        all(iterator: (element: TModel, index: number) => boolean, context?: any): boolean;
-        any(iterator: (element: TModel, index: number) => boolean, context?: any): boolean;
-        collect(iterator: (element: TModel, index: number, context?: any) => any[], context?: any): any[];
+        all(iterator?: _.ListIterator<TModel, boolean>, context?: any): boolean;
+        any(iterator?: _.ListIterator<TModel, boolean>, context?: any): boolean;
         chain(): any;
-        contains(value: any): boolean;
-        countBy(iterator: (element: TModel, index: number) => any): _.Dictionary<number>;
-        countBy(attribute: string): _.Dictionary<number>;
-        detect(iterator: (item: any) => boolean, context?: any): any; // ???
-        drop(): TModel;
-        drop(n: number): TModel[];
-        each(iterator: (element: TModel, index: number, list?: any) => void, context?: any): any;
-        every(iterator: (element: TModel, index: number) => boolean, context?: any): boolean;
-        filter(iterator: (element: TModel, index: number) => boolean, context?: any): TModel[];
-        find(iterator: (element: TModel, index: number) => boolean, context?: any): TModel;
+        collect<TResult>(iterator: _.ListIterator<TModel, TResult>, context?: any): TResult[];
+        contains(value: TModel): boolean;
+        countBy(iterator?: _.ListIterator<TModel, any>): _.Dictionary<number>;
+        countBy(iterator: string): _.Dictionary<number>;
+        detect(iterator: _.ListIterator<TModel, boolean>, context?: any): TModel;
+        difference(others: TModel[]): TModel[];
+        drop(n?: number): TModel[];
+        each(iterator: _.ListIterator<TModel, void>, context?: any): TModel[];
+        every(iterator: _.ListIterator<TModel, boolean>, context?: any): boolean;
+        filter(iterator: _.ListIterator<TModel, boolean>, context?: any): TModel[];
+        find(iterator: _.ListIterator<TModel, boolean>, context?: any): TModel;
+        findIndex(predicate: _.ListIterator<TModel, boolean>, context?: any): number;
+        findLastIndex(predicate: _.ListIterator<TModel, boolean>, context?: any): number;
         first(): TModel;
         first(n: number): TModel[];
-        foldl(iterator: (memo: any, element: TModel, index: number) => any, initialMemo: any, context?: any): any;
-        forEach(iterator: (element: TModel, index: number, list?: any) => void, context?: any): any;
-        groupBy(iterator: (element: TModel, index: number) => string, context?: any): _.Dictionary<TModel[]>;
-        groupBy(attribute: string, context?: any): _.Dictionary<TModel[]>;
-        include(value: any): boolean;
-        indexOf(element: TModel, isSorted?: boolean): number;
+        foldl<TResult>(iterator: _.MemoIterator<TModel, TResult>, memo?: TResult, context?: any): TResult;
+        foldr<TResult>(iterator: _.MemoIterator<TModel, TResult>, memo?: TResult, context?: any): TResult;
+        forEach(iterator: _.ListIterator<TModel, void>, context?: any): TModel[];
+        groupBy(iterator: _.ListIterator<TModel, any>, context?: any): _.Dictionary<TModel[]>;
+        groupBy(iterator: string, context?: any): _.Dictionary<TModel[]>;
+        head(): TModel;
+        head(n: number): TModel[];
+        include(value: TModel): boolean;
+        includes(value: TModel): boolean;
+        indexBy(iterator: _.ListIterator<TModel, any>, context?: any): _.Dictionary<TModel>;
+        indexBy(iterator: string, context?: any): _.Dictionary<TModel>;
+        indexOf(value: TModel, isSorted?: boolean): number;
         initial(): TModel;
         initial(n: number): TModel[];
-        inject(iterator: (memo: any, element: TModel, index: number) => any, initialMemo: any, context?: any): any;
-        isEmpty(object: any): boolean;
-        invoke(methodName: string, args?: any[]): any;
+        inject<TResult>(iterator: _.MemoIterator<TModel, TResult>, memo?: TResult, context?: any): TResult;
+        invoke(methodName: string, ...args: any[]): any;
+        isEmpty(): boolean;
         last(): TModel;
         last(n: number): TModel[];
-        lastIndexOf(element: TModel, fromIndex?: number): number;
-        map(iterator: (element: TModel, index: number, context?: any) => any, context?: any): any[];
-        max(iterator?: (element: TModel, index: number) => any, context?: any): TModel;
-        min(iterator?: (element: TModel, index: number) => any, context?: any): TModel;
-        reduce(iterator: (memo: any, element: TModel, index: number) => any, initialMemo: any, context?: any): any;
-        select(iterator: any, context?: any): any[];
+        lastIndexOf(value: TModel, from?: number): number;
+        map<TResult>(iterator: _.ListIterator<TModel, TResult>, context?: any): TResult[];
+        max(iterator?: _.ListIterator<TModel, any>, context?: any): TModel;
+        min(iterator?: _.ListIterator<TModel, any>, context?: any): TModel;
+        partition(iterator: _.ListIterator<TModel, boolean>): TModel[][];
+        reduce<TResult>(iterator: _.MemoIterator<TModel, TResult>, memo?: TResult, context?: any): TResult;
+        reduceRight<TResult>(iterator: _.MemoIterator<TModel, TResult>, memo?: TResult, context?: any): TResult;
+        reject(iterator: _.ListIterator<TModel, boolean>, context?: any): TModel[];
+        rest(n?: number): TModel[];
+        sample(): TModel;
+        sample(n: number): TModel[];
+        select(iterator: _.ListIterator<TModel, boolean>, context?: any): TModel[];
+        shuffle(): TModel[];
         size(): number;
-        shuffle(): any[];
-        slice(min: number, max?: number): TModel[];
-        some(iterator: (element: TModel, index: number) => boolean, context?: any): boolean;
-        sortBy(iterator: (element: TModel, index: number) => number, context?: any): TModel[];
-        sortBy(attribute: string, context?: any): TModel[];
-        sortedIndex(element: TModel, iterator?: (element: TModel, index: number) => number): number;
-        reduceRight(iterator: (memo: any, element: TModel, index: number) => any, initialMemo: any, context?: any): any[];
-        reject(iterator: (element: TModel, index: number) => boolean, context?: any): TModel[];
-        rest(): TModel;
-        rest(n: number): TModel[];
-        tail(): TModel;
-        tail(n: number): TModel[];
-        toArray(): any[];
-        without(...values: any[]): TModel[];
+        some(iterator?: _.ListIterator<TModel, boolean>, context?: any): boolean;
+        sortBy<TSort>(iterator?: _.ListIterator<TModel, TSort>, context?: any): TModel[];
+        sortBy(iterator: string, context?: any): TModel[];
+        tail(n?: number): TModel[];
+        take(): TModel;
+        take(n: number): TModel[];
+        toArray(): TModel[];
+        without(...values: TModel[]): TModel[];
     }
 
     class Router extends Events {

From c36f13d2e1fffac4f389c9b4b9c2f38994698b57 Mon Sep 17 00:00:00 2001
From: delphinus <delphinus@remora.cx>
Date: Thu, 5 May 2016 20:58:13 +0900
Subject: [PATCH 056/278] Add tests for methods derived from underscore.js

---
 backbone/backbone-tests.ts             | 91 ++++++++++++++++++++++++++
 backbone/backbone-with-lodash-tests.ts | 91 ++++++++++++++++++++++++++
 2 files changed, 182 insertions(+)

diff --git a/backbone/backbone-tests.ts b/backbone/backbone-tests.ts
index 3669a6c4e1..6d4a988ded 100644
--- a/backbone/backbone-tests.ts
+++ b/backbone/backbone-tests.ts
@@ -90,6 +90,25 @@ function test_models() {
     note.set({ title: "March 20", content: "In his eyes she eclipses..." });
 
     note.set("title", "A Scandal in Bohemia");
+
+    let strings: string[]
+    let value: any;
+    let values: any[];
+    let bool: boolean;
+
+    // underscore methods
+    strings = note.keys();
+    values  = note.values();
+    values  = note.pairs();
+    values  = note.invert();
+    value   = note.pick("foo");
+    value   = note.pick("foo", "bar");
+    value   = note.pick((value: any, key: any, object: any) => true);
+    value   = note.omit("foo");
+    value   = note.omit("foo", "bar");
+    value   = note.omit((value: any, key: any, object: any) => true);
+    value   = note.chain().pick().omit().value();
+    bool    = note.isEmpty();
 }
 
 class Employee extends Backbone.Model {
@@ -161,6 +180,78 @@ function test_collection() {
         book.get("published") === true);
 
     var alphabetical = books.sortBy((book: Book): number => null);
+
+    let one: Book;
+    let models: Book[];
+    let bool: boolean;
+    let numDict: _.Dictionary<number>;
+    let modelDict: _.Dictionary<Book>;
+    let modelsDict: _.Dictionary<Book[]>;
+    let num: number;
+
+    models = books.slice(1);
+    models = books.slice(1, 3);
+
+    // underscore methods
+    bool       = books.all((value: Book, index: number, list: Book[]) => true);
+    bool       = books.any((value: Book, index: number, list: Book[]) => true);
+    bool       = books.chain().any((value: Book, index: number, list: Book[]) => true).value();
+    models     = books.collect((value: Book, index: number, list: Book[]) => value);
+    bool       = books.contains(book1);
+    numDict    = books.countBy((value: Book, index: number, list: Book[]) => true);
+    numDict    = books.countBy("foo");
+    one        = books.detect((value: Book, index: number, list: Book[]) => true);
+    models     = books.difference([book1]);
+    models     = books.drop();
+    models     = books.each((value: Book, index: number, list: Book[]) => true);
+    bool       = books.every((value: Book, index: number, list: Book[]) => true);
+    models     = books.filter((value: Book, index: number, list: Book[]) => true);
+    one        = books.find((value: Book, index: number, list: Book[]) => true);
+    num        = books.findIndex((value: Book, index: number, list: Book[]) => true);
+    num        = books.findLastIndex((value: Book, index: number, list: Book[]) => true);
+    one        = books.first();
+    models     = books.first(3);
+    models     = books.foldl((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.foldr((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.forEach((value: Book, index: number, list: Book[]) => true);
+    modelsDict = books.groupBy((value: Book, index: number, list: Book[]) => true);
+    modelsDict = books.groupBy("foo");
+    one        = books.head();
+    models     = books.head(3);
+    bool       = books.include(book1);
+    bool       = books.includes(book1);
+    modelDict  = books.indexBy((value: Book, index: number, list: Book[]) => true);
+    modelDict  = books.indexBy("foo");
+    num        = books.indexOf(book1, true);
+    one        = books.initial();
+    models     = books.initial(3);
+    models     = books.inject((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    one        = books.invoke("at", 3);
+    bool       = books.isEmpty();
+    one        = books.last();
+    models     = books.last(3);
+    num        = books.lastIndexOf(book1, 3);
+    models     = books.map((value: Book, index: number, list: Book[]) => value);
+    one        = books.max((value: Book, index: number, list: Book[]) => value);
+    one        = books.min((value: Book, index: number, list: Book[]) => value);
+    [models]   = books.partition((value: Book, index: number, list: Book[]) => true);
+    models     = books.reduce((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.reduceRight((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.reject((value: Book, index: number, list: Book[]) => true);
+    models     = books.rest(3);
+    one        = books.sample();
+    models     = books.sample(3);
+    models     = books.select((value: Book, index: number, list: Book[]) => true);
+    models     = books.shuffle();
+    num        = books.size();
+    bool       = books.some((value: Book, index: number, list: Book[]) => true);
+    models     = books.sortBy((value: Book, index: number, list: Book[]) => value);
+    models     = books.sortBy("foo");
+    models     = books.tail(3);
+    one        = books.take();
+    models     = books.take(3);
+    models     = books.toArray();
+    models     = books.without(book1, book1);
 }
 
 //////////
diff --git a/backbone/backbone-with-lodash-tests.ts b/backbone/backbone-with-lodash-tests.ts
index e0b04880bf..0ac4efe375 100644
--- a/backbone/backbone-with-lodash-tests.ts
+++ b/backbone/backbone-with-lodash-tests.ts
@@ -91,6 +91,25 @@ function test_models() {
     note.set({ title: "March 20", content: "In his eyes she eclipses..." });
 
     note.set("title", "A Scandal in Bohemia");
+
+    let strings: string[]
+    let value: any;
+    let values: any[];
+    let bool: boolean;
+
+    // underscore methods
+    strings = note.keys();
+    values  = note.values();
+    values  = note.pairs();
+    values  = note.invert();
+    value   = note.pick("foo");
+    value   = note.pick("foo", "bar");
+    value   = note.pick((value: any, key: any, object: any) => true);
+    value   = note.omit("foo");
+    value   = note.omit("foo", "bar");
+    value   = note.omit((value: any, key: any, object: any) => true);
+    value   = note.chain().pick().omit().value();
+    bool    = note.isEmpty();
 }
 
 class Employee extends Backbone.Model {
@@ -152,6 +171,78 @@ function test_collection() {
         book.get("published") === true);
 
     var alphabetical = books.sortBy((book: Book): number => null);
+
+    let one: Book;
+    let models: Book[];
+    let bool: boolean;
+    let numDict: _.Dictionary<number>;
+    let modelDict: _.Dictionary<Book>;
+    let modelsDict: _.Dictionary<Book[]>;
+    let num: number;
+
+    models = books.slice(1);
+    models = books.slice(1, 3);
+
+    // underscore methods
+    bool       = books.all((value: Book, index: number, list: Book[]) => true);
+    bool       = books.any((value: Book, index: number, list: Book[]) => true);
+    bool       = books.chain().any((value: Book, index: number, list: Book[]) => true).value();
+    models     = books.collect((value: Book, index: number, list: Book[]) => value);
+    bool       = books.contains(book1);
+    numDict    = books.countBy((value: Book, index: number, list: Book[]) => true);
+    numDict    = books.countBy("foo");
+    one        = books.detect((value: Book, index: number, list: Book[]) => true);
+    models     = books.difference([book1]);
+    models     = books.drop();
+    models     = books.each((value: Book, index: number, list: Book[]) => true);
+    bool       = books.every((value: Book, index: number, list: Book[]) => true);
+    models     = books.filter((value: Book, index: number, list: Book[]) => true);
+    one        = books.find((value: Book, index: number, list: Book[]) => true);
+    num        = books.findIndex((value: Book, index: number, list: Book[]) => true);
+    num        = books.findLastIndex((value: Book, index: number, list: Book[]) => true);
+    one        = books.first();
+    models     = books.first(3);
+    models     = books.foldl((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.foldr((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.forEach((value: Book, index: number, list: Book[]) => true);
+    modelsDict = books.groupBy((value: Book, index: number, list: Book[]) => true);
+    modelsDict = books.groupBy("foo");
+    one        = books.head();
+    models     = books.head(3);
+    bool       = books.include(book1);
+    bool       = books.includes(book1);
+    modelDict  = books.indexBy((value: Book, index: number, list: Book[]) => true);
+    modelDict  = books.indexBy("foo");
+    num        = books.indexOf(book1, true);
+    one        = books.initial();
+    models     = books.initial(3);
+    models     = books.inject((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    one        = books.invoke("at", 3);
+    bool       = books.isEmpty();
+    one        = books.last();
+    models     = books.last(3);
+    num        = books.lastIndexOf(book1, 3);
+    models     = books.map((value: Book, index: number, list: Book[]) => value);
+    one        = books.max((value: Book, index: number, list: Book[]) => value);
+    one        = books.min((value: Book, index: number, list: Book[]) => value);
+    [models]   = books.partition((value: Book, index: number, list: Book[]) => true);
+    models     = books.reduce((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.reduceRight((prev: Book[], curr: Book, index: number, list: Book[]) => prev, []);
+    models     = books.reject((value: Book, index: number, list: Book[]) => true);
+    models     = books.rest(3);
+    one        = books.sample();
+    models     = books.sample(3);
+    models     = books.select((value: Book, index: number, list: Book[]) => true);
+    models     = books.shuffle();
+    num        = books.size();
+    bool       = books.some((value: Book, index: number, list: Book[]) => true);
+    models     = books.sortBy((value: Book, index: number, list: Book[]) => value);
+    models     = books.sortBy("foo");
+    models     = books.tail(3);
+    one        = books.take();
+    models     = books.take(3);
+    models     = books.toArray();
+    models     = books.without(book1, book1);
 }
 
 //////////

From 0c76f1f3c57f76a60f7865763e122dfe46f6e7b3 Mon Sep 17 00:00:00 2001
From: Brad Zacher <brad.zacher@gmail.com>
Date: Fri, 6 May 2016 09:09:11 +0930
Subject: [PATCH 057/278] updated to be an encapsulated ghost module

---
 o.js/o.js-tests.ts |   2 +-
 o.js/o.js.d.ts     | 146 ++++++++++++++++++++++-----------------------
 2 files changed, 74 insertions(+), 74 deletions(-)

diff --git a/o.js/o.js-tests.ts b/o.js/o.js-tests.ts
index 9ef2f05606..b9ffc1b065 100644
--- a/o.js/o.js-tests.ts
+++ b/o.js/o.js-tests.ts
@@ -1,6 +1,6 @@
 /// <reference path="o.js.d.ts" /> 
 
-import o = require('o.js');
+import * as o from 'o.js';
 
 interface Product {
     ID : number;
diff --git a/o.js/o.js.d.ts b/o.js/o.js.d.ts
index d92614a0c0..d0d53dce88 100644
--- a/o.js/o.js.d.ts
+++ b/o.js/o.js.d.ts
@@ -5,79 +5,79 @@
 
 /// <reference path="../q/Q.d.ts" />
 
-interface Options {
-    endpoint : string
-    json ?: boolean
-    version ?: number
-    strictMode ?: boolean
-    start ?: () => any
-    ready ?: () => any
-    error ?: () => any
-    headers ?: string[]
-    username ?: string
-    password ?: string
-    isAsync ?: boolean
-}
-
-interface OHandler<T> {
-    inlinecount : number
-    data : T
-
-    config<T>(options ?: Options) : OHandler<T>
-    progress<T>(callback : () => any) : OHandler<T>
-
-    get<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
-    save<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
-    
-    post<T>(params : any) : OHandler<T>
-    patch<T>(params : any) : OHandler<T>
-    put<T>(params : any) : OHandler<T>
-    remove<T>(params ?: any) : OHandler<T>
-
-    routes<T>(path : string, callback ?: (data : T) => void) : OHandler<T>
-    route<T>(path : string, callback ?: (data : T) => void) : OHandler<T>
-    triggerRoute(hash : string) : OHandler<T>
-    beforeRouting(callback : (routeParams : any) => boolean) : OHandler<T> 
-
-    isEndpoint() : boolean
-    loading<T>(startFn : () => any | boolean, endFn : () => any) : OHandler<T>
-
-    find<T>(selector : string|number) : OHandler<T>
-
-    top<T>(quantity : number) : OHandler<T>
-    take<T>(quantity : number) : OHandler<T>
-    skip<T>(quantity : number) : OHandler<T>
-    first<T>() : OHandler<T>
-
-    include<T>(column : string, data : string) : OHandler<T>
-    exclude<T>(column : string, data : string) : OHandler<T>
-    filterByList<T>(column : string, data : string) : OHandler<T>
-
-    filter<T>(filter : string) : OHandler<T>
-    where<T>(filter : string) : OHandler<T>
-    any<T>(filter : string, resource : string) : OHandler<T>
-    search<T>(columns : string[], term : string) : OHandler<T>
-
-    orderBy<T>(column : string, direction ?: boolean) : OHandler<T>
-    orderByDesc<T>(column : string) : OHandler<T>
-    select<T>(selectStr : string) : OHandler<T>
-
-    count<T>() : OHandler<T>
-    inlineCount<T>(paramName ?: string) : OHandler<T>
-
-    batch<T>(resource : string) : OHandler<T>
-    expand<T>(resource : string) : OHandler<T>
-    ref<T>(resource : string, id : string | number) : OHandler<T>
-    removeRef<T>(resource : string, id : string | number) : OHandler<T>
-    deleteRef<T>(resource : string, id : string | number) : OHandler<T>
-}
-
-interface OFn<T> extends OHandler<T> {
-    (options ?: string | Options) : OHandler<T>
-}
-
-declare var o : OFn<{}>;
-
 declare module 'o.js' {
+    interface Options {
+        endpoint : string
+        json ?: boolean
+        version ?: number
+        strictMode ?: boolean
+        start ?: () => any
+        ready ?: () => any
+        error ?: () => any
+        headers ?: string[]
+        username ?: string
+        password ?: string
+        isAsync ?: boolean
+    }
+
+    interface OHandler<T> {
+        inlinecount : number
+        data : T
+
+        config<T>(options ?: Options) : OHandler<T>
+        progress<T>(callback : () => any) : OHandler<T>
+
+        get<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
+        save<T>(callback ?: (data : T) => void) : Q.Promise<OHandler<T>>
+        
+        post<T>(params : any) : OHandler<T>
+        patch<T>(params : any) : OHandler<T>
+        put<T>(params : any) : OHandler<T>
+        remove<T>(params ?: any) : OHandler<T>
+
+        routes<T>(path : string, callback ?: (data : T) => void) : OHandler<T>
+        route<T>(path : string, callback ?: (data : T) => void) : OHandler<T>
+        triggerRoute(hash : string) : OHandler<T>
+        beforeRouting(callback : (routeParams : any) => boolean) : OHandler<T> 
+
+        isEndpoint() : boolean
+        loading<T>(startFn : () => any | boolean, endFn : () => any) : OHandler<T>
+
+        find<T>(selector : string|number) : OHandler<T>
+
+        top<T>(quantity : number) : OHandler<T>
+        take<T>(quantity : number) : OHandler<T>
+        skip<T>(quantity : number) : OHandler<T>
+        first<T>() : OHandler<T>
+
+        include<T>(column : string, data : string) : OHandler<T>
+        exclude<T>(column : string, data : string) : OHandler<T>
+        filterByList<T>(column : string, data : string) : OHandler<T>
+
+        filter<T>(filter : string) : OHandler<T>
+        where<T>(filter : string) : OHandler<T>
+        any<T>(filter : string, resource : string) : OHandler<T>
+        search<T>(columns : string[], term : string) : OHandler<T>
+
+        orderBy<T>(column : string, direction ?: boolean) : OHandler<T>
+        orderByDesc<T>(column : string) : OHandler<T>
+        select<T>(selectStr : string) : OHandler<T>
+
+        count<T>() : OHandler<T>
+        inlineCount<T>(paramName ?: string) : OHandler<T>
+
+        batch<T>(resource : string) : OHandler<T>
+        expand<T>(resource : string) : OHandler<T>
+        ref<T>(resource : string, id : string | number) : OHandler<T>
+        removeRef<T>(resource : string, id : string | number) : OHandler<T>
+        deleteRef<T>(resource : string, id : string | number) : OHandler<T>
+    }
+
+    interface OFn<T> extends OHandler<T> {
+        (options ?: string | Options) : OHandler<T>
+    }
+
+    var o : OFn<{}>;
+
     export = o
 }
\ No newline at end of file

From f4845ed7befb04cf94542c3e9fe37a5cb73335dd Mon Sep 17 00:00:00 2001
From: blbigelow <blbigelow@gmail.com>
Date: Fri, 6 May 2016 10:12:02 -0600
Subject: [PATCH 058/278] adding skipHide as option to IDialogOptions

---
 angular-material/angular-material.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/angular-material/angular-material.d.ts b/angular-material/angular-material.d.ts
index 12fe28a9b8..5120f76370 100644
--- a/angular-material/angular-material.d.ts
+++ b/angular-material/angular-material.d.ts
@@ -84,6 +84,7 @@ declare namespace angular.material {
         onComplete?: Function;
         onRemoving?: Function;
         fullscreen?: boolean;
+        skipHide?: boolean;
     }
 
     interface IDialogService {

From 4183b9b75f70a884639e3e55132cf9cc12be1fc2 Mon Sep 17 00:00:00 2001
From: Boris Breuer <Engineer2B@users.noreply.github.com>
Date: Fri, 6 May 2016 20:41:02 +0200
Subject: [PATCH 059/278] Update node.d.ts

---
 node/node.d.ts | 140 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 140 insertions(+)

diff --git a/node/node.d.ts b/node/node.d.ts
index 184bd02a78..6364a27012 100644
--- a/node/node.d.ts
+++ b/node/node.d.ts
@@ -1791,7 +1791,147 @@ declare module "tls" {
 
     var CLIENT_RENEG_LIMIT: number;
     var CLIENT_RENEG_WINDOW: number;
+    
+    export interface Certificate {
+        /**
+         * Country code.
+         */
+        C: string;
+        /**
+         * Street.
+         */
+        ST: string;
+        /**
+         * Locality.
+         */
+        L: string;
+        /**
+         * Organization.
+         */
+        O: string;
+        /**
+         * Organizational unit.
+         */
+        OU: string;
+        /**
+         * Common name.
+         */
+        CN: string;
+    }
 
+    export interface CipherNameAndProtocol {
+        /**
+         * The cipher name.
+         */
+        name: string;
+        /**
+         * SSL/TLS protocol version.
+         */
+        version: string;
+    }
+
+    export interface TLSSocket extends stream.Duplex {
+        /**
+         * Returns the bound address, the address family name and port of the underlying socket as reported by
+         * the operating system. 
+         * @returns {any} - An object with three properties, e.g. { port: 12346, family: 'IPv4', address: '127.0.0.1' }.
+         */
+        address(): { port: number; family: string; address: string };
+        /**
+         * A boolean that is true if the peer certificate was signed by one of the specified CAs, otherwise false.
+         */
+        authorized: boolean;
+        /**
+         * The reason why the peer's certificate has not been verified.
+         * This property becomes available only when tlsSocket.authorized === false.
+         */
+        authorizationError?: Error;
+        /**
+         * Static boolean value, always true.
+         * May be used to distinguish TLS sockets from regular ones.
+         */
+        encrypted: boolean;
+        /**
+         * Returns an object representing the cipher name and the SSL/TLS protocol version of the current connection.
+         * @returns {CipherNameAndProtocol} - Returns an object representing the cipher name
+         * and the SSL/TLS protocol version of the current connection.
+         */
+        getCipher(): CipherNameAndProtocol;
+        /**
+         * Returns an object representing the peer's certificate.
+         * The returned object has some properties corresponding to the field of the certificate.
+         * If detailed argument is true the full chain with issuer property will be returned,
+         * if false only the top certificate without issuer property.
+         * If the peer does not provide a certificate, it returns null or an empty object.
+         * @param {boolean} detailed - If true; the full chain with issuer property will be returned.
+         * @returns {any} - An object representing the peer's certificate.
+         */
+        getPeerCertificate(detailed?: boolean): {
+            subject: Certificate;
+            issuerInfo: Certificate;
+            issuer: Certificate;
+            raw: any;
+            valid_from: string;
+            valid_to: string;
+            fingerprint: string;
+            serialNumber: string;
+        };
+        /**
+         * Could be used to speed up handshake establishment when reconnecting to the server.
+         * @returns {any} - ASN.1 encoded TLS session or undefined if none was negotiated.
+         */
+        getSession(): any;
+        /**
+         * NOTE: Works only with client TLS sockets.
+         * Useful only for debugging, for session reuse provide session option to tls.connect().
+         * @returns {any} - TLS session ticket or undefined if none was negotiated.
+         */
+        getTLSTicket(): any;
+        /**
+         * The string representation of the local IP address.
+         */
+        localAddress: string;
+        /**
+         * The numeric representation of the local port.
+         */
+        localPort: string;
+        /**
+         * The string representation of the remote IP address.
+         * For example, '74.125.127.100' or '2001:4860:a005::68'.
+         */
+        remoteAddress: string;
+        /**
+         * The string representation of the remote IP family. 'IPv4' or 'IPv6'.
+         */
+        remoteFamily: string;
+        /**
+         * The numeric representation of the remote port. For example, 443.
+         */
+        remotePort: number;
+        /**
+         * Initiate TLS renegotiation process.
+         *  
+         * NOTE: Can be used to request peer's certificate after the secure connection has been established.
+         * ANOTHER NOTE: When running as the server, socket will be destroyed with an error after handshakeTimeout timeout.
+         * @param {any} options - The options may contain the following fields: rejectUnauthorized,
+         * requestCert (See tls.createServer() for details).
+         * @param {} callback - callback(err) will be executed with null as err, once the renegotiation
+         * is successfully completed.
+         */
+        renegotiate(options, callback: (err) => any): any;
+        /**
+         * Set maximum TLS fragment size (default and maximum value is: 16384, minimum is: 512).
+         * Smaller fragment size decreases buffering latency on the client: large fragments are buffered by
+         * the TLS layer until the entire fragment is received and its integrity is verified;
+         * large fragments can span multiple roundtrips, and their processing can be delayed due to packet
+         * loss or reordering. However, smaller fragments add extra TLS framing bytes and CPU overhead,
+         * which may decrease overall server throughput.
+         * @param {number} size - TLS fragment size (default and maximum value is: 16384, minimum is: 512).
+         * @returns {boolean} - Returns true on success, false otherwise.
+         */
+        setMaxSendFragment(size: number): boolean;
+    }
+    
     export interface TlsOptions {
         host?: string;
         port?: number;

From 316b3342a74076e44570598fd62bee74a88f32aa Mon Sep 17 00:00:00 2001
From: Boris Breuer <Engineer2B@users.noreply.github.com>
Date: Sat, 7 May 2016 00:09:18 +0200
Subject: [PATCH 060/278] Added missing type information for options and err

---
 node/node.d.ts | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/node/node.d.ts b/node/node.d.ts
index 6364a27012..235c8fb005 100644
--- a/node/node.d.ts
+++ b/node/node.d.ts
@@ -1913,12 +1913,12 @@ declare module "tls" {
          *  
          * NOTE: Can be used to request peer's certificate after the secure connection has been established.
          * ANOTHER NOTE: When running as the server, socket will be destroyed with an error after handshakeTimeout timeout.
-         * @param {any} options - The options may contain the following fields: rejectUnauthorized,
+         * @param {TlsOptions} options - The options may contain the following fields: rejectUnauthorized,
          * requestCert (See tls.createServer() for details).
-         * @param {} callback - callback(err) will be executed with null as err, once the renegotiation
+         * @param {Function} callback - callback(err) will be executed with null as err, once the renegotiation
          * is successfully completed.
          */
-        renegotiate(options, callback: (err) => any): any;
+        renegotiate(options: TlsOptions, callback: (err: Error) => any): any;
         /**
          * Set maximum TLS fragment size (default and maximum value is: 16384, minimum is: 512).
          * Smaller fragment size decreases buffering latency on the client: large fragments are buffered by

From cc0afa72895a922f711008deb89efe931bfe79be Mon Sep 17 00:00:00 2001
From: Junle Li <lijunle@gmail.com>
Date: Mon, 9 May 2016 21:36:11 +0800
Subject: [PATCH 061/278] The DragEvent should inherit from MouseEvent.

Reference: https://developer.mozilla.org/en-US/docs/Web/API/DragEvent
---
 react/react.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/react/react.d.ts b/react/react.d.ts
index efe8d8c2e8..c001173a8d 100644
--- a/react/react.d.ts
+++ b/react/react.d.ts
@@ -287,7 +287,7 @@ declare namespace __React {
         data: string;
     }
 
-    interface DragEvent extends SyntheticEvent {
+    interface DragEvent extends MouseEvent {
         dataTransfer: DataTransfer;
     }
 

From 0209fed7ff3797ef1584a5acc8a03525449b2e84 Mon Sep 17 00:00:00 2001
From: Boris Breuer <Engineer2B@users.noreply.github.com>
Date: Tue, 10 May 2016 22:59:58 +0200
Subject: [PATCH 062/278] TLSSocket is actually a class

Thanks for point it out, @vvakame .
---
 node/node.d.ts | 226 +++++++++++++++++++++++++------------------------
 1 file changed, 114 insertions(+), 112 deletions(-)

diff --git a/node/node.d.ts b/node/node.d.ts
index 235c8fb005..40a12057db 100644
--- a/node/node.d.ts
+++ b/node/node.d.ts
@@ -17,10 +17,10 @@ interface Error {
 // compat for TypeScript 1.8
 // if you use with --target es3 or --target es5 and use below definitions,
 // use the lib.es6.d.ts that is bundled with TypeScript 1.8.
-interface MapConstructor {}
-interface WeakMapConstructor {}
-interface SetConstructor {}
-interface WeakSetConstructor {}
+interface MapConstructor { }
+interface WeakMapConstructor { }
+interface SetConstructor { }
+interface WeakSetConstructor { }
 
 /************************************************
 *                                               *
@@ -45,7 +45,7 @@ interface NodeRequireFunction {
 }
 
 interface NodeRequire extends NodeRequireFunction {
-    resolve(id:string): string;
+    resolve(id: string): string;
     cache: any;
     extensions: any;
     main: any;
@@ -81,7 +81,7 @@ declare var SlowBuffer: {
 
 // Buffer class
 type BufferEncoding = "ascii" | "utf8" | "utf16le" | "ucs2" | "binary" | "hex";
-interface Buffer extends NodeBuffer {}
+interface Buffer extends NodeBuffer { }
 
 /**
  * Raw data is stored in instances of the Buffer class.
@@ -145,7 +145,7 @@ declare var Buffer: {
      * @param byteOffset
      * @param length
      */
-    from(arrayBuffer: ArrayBuffer, byteOffset?: number, length?:number): Buffer;
+    from(arrayBuffer: ArrayBuffer, byteOffset?: number, length?: number): Buffer;
     /**
      * Copies the passed {buffer} data onto a new Buffer instance.
      *
@@ -228,7 +228,7 @@ declare namespace NodeJS {
 
     export interface ReadableStream extends EventEmitter {
         readable: boolean;
-        read(size?: number): string|Buffer;
+        read(size?: number): string | Buffer;
         setEncoding(encoding: string): void;
         pause(): void;
         resume(): void;
@@ -241,7 +241,7 @@ declare namespace NodeJS {
 
     export interface WritableStream extends EventEmitter {
         writable: boolean;
-        write(buffer: Buffer|string, cb?: Function): boolean;
+        write(buffer: Buffer | string, cb?: Function): boolean;
         write(str: string, encoding?: string, cb?: Function): boolean;
         end(): void;
         end(buffer: Buffer, cb?: Function): void;
@@ -249,7 +249,7 @@ declare namespace NodeJS {
         end(str: string, encoding?: string, cb?: Function): void;
     }
 
-    export interface ReadWriteStream extends ReadableStream, WritableStream {}
+    export interface ReadWriteStream extends ReadableStream, WritableStream { }
 
     export interface Events extends EventEmitter { }
 
@@ -328,7 +328,7 @@ declare namespace NodeJS {
                 visibility: string;
             };
         };
-        kill(pid:number, signal?: string|number): void;
+        kill(pid: number, signal?: string | number): void;
         pid: number;
         title: string;
         arch: string;
@@ -337,7 +337,7 @@ declare namespace NodeJS {
         nextTick(callback: Function): void;
         umask(mask?: number): number;
         uptime(): number;
-        hrtime(time?:number[]): number[];
+        hrtime(time?: number[]): number[];
         domain: Domain;
 
         // Worker
@@ -413,8 +413,8 @@ declare namespace NodeJS {
     }
 
     export interface Timer {
-        ref() : void;
-        unref() : void;
+        ref(): void;
+        unref(): void;
     }
 }
 
@@ -539,7 +539,7 @@ declare module "http" {
         path?: string;
         headers?: { [key: string]: any };
         auth?: string;
-        agent?: Agent|boolean;
+        agent?: Agent | boolean;
     }
 
     export interface Server extends events.EventEmitter, net.Server {
@@ -679,7 +679,7 @@ declare module "http" {
         [errorCode: number]: string;
         [errorCode: string]: string;
     };
-    export function createServer(requestListener?: (request: IncomingMessage, response: ServerResponse) =>void ): Server;
+    export function createServer(requestListener?: (request: IncomingMessage, response: ServerResponse) => void): Server;
     export function createClient(port?: number, host?: string): any;
     export function request(options: RequestOptions, callback?: (res: IncomingMessage) => void): ClientRequest;
     export function get(options: any, callback?: (res: IncomingMessage) => void): ClientRequest;
@@ -763,19 +763,19 @@ declare module "zlib" {
     export function createInflateRaw(options?: ZlibOptions): InflateRaw;
     export function createUnzip(options?: ZlibOptions): Unzip;
 
-    export function deflate(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
+    export function deflate(buf: Buffer, callback: (error: Error, result: any) => void): void;
     export function deflateSync(buf: Buffer, options?: ZlibOptions): any;
-    export function deflateRaw(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
+    export function deflateRaw(buf: Buffer, callback: (error: Error, result: any) => void): void;
     export function deflateRawSync(buf: Buffer, options?: ZlibOptions): any;
-    export function gzip(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
+    export function gzip(buf: Buffer, callback: (error: Error, result: any) => void): void;
     export function gzipSync(buf: Buffer, options?: ZlibOptions): any;
-    export function gunzip(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
+    export function gunzip(buf: Buffer, callback: (error: Error, result: any) => void): void;
     export function gunzipSync(buf: Buffer, options?: ZlibOptions): any;
-    export function inflate(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
+    export function inflate(buf: Buffer, callback: (error: Error, result: any) => void): void;
     export function inflateSync(buf: Buffer, options?: ZlibOptions): any;
-    export function inflateRaw(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
+    export function inflateRaw(buf: Buffer, callback: (error: Error, result: any) => void): void;
     export function inflateRawSync(buf: Buffer, options?: ZlibOptions): any;
-    export function unzip(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
+    export function unzip(buf: Buffer, callback: (error: Error, result: any) => void): void;
     export function unzipSync(buf: Buffer, options?: ZlibOptions): any;
 
     // Constants
@@ -846,7 +846,7 @@ declare module "os" {
     export function totalmem(): number;
     export function freemem(): number;
     export function cpus(): CpuInfo[];
-    export function networkInterfaces(): {[index: string]: NetworkInterfaceInfo[]};
+    export function networkInterfaces(): { [index: string]: NetworkInterfaceInfo[] };
     export var EOL: string;
 }
 
@@ -870,7 +870,7 @@ declare module "https" {
         SNICallback?: (servername: string) => any;
     }
 
-    export interface RequestOptions extends http.RequestOptions{
+    export interface RequestOptions extends http.RequestOptions {
         pfx?: any;
         key?: any;
         passphrase?: string;
@@ -891,8 +891,8 @@ declare module "https" {
     };
     export interface Server extends tls.Server { }
     export function createServer(options: ServerOptions, requestListener?: Function): Server;
-    export function request(options: RequestOptions, callback?: (res: http.IncomingMessage) =>void ): http.ClientRequest;
-    export function get(options: RequestOptions, callback?: (res: http.IncomingMessage) =>void ): http.ClientRequest;
+    export function request(options: RequestOptions, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
+    export function get(options: RequestOptions, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
     export var globalAgent: Agent;
 }
 
@@ -946,7 +946,7 @@ declare module "readline" {
         pause(): ReadLine;
         resume(): ReadLine;
         close(): void;
-        write(data: string|Buffer, key?: Key): void;
+        write(data: string | Buffer, key?: Key): void;
     }
 
     export interface Completer {
@@ -971,7 +971,7 @@ declare module "readline" {
     export function createInterface(options: ReadLineOptions): ReadLine;
 
     export function cursorTo(stream: NodeJS.WritableStream, x: number, y: number): void;
-    export function moveCursor(stream: NodeJS.WritableStream, dx: number|string, dy: number|string): void;
+    export function moveCursor(stream: NodeJS.WritableStream, dx: number | string, dy: number | string): void;
     export function clearLine(stream: NodeJS.WritableStream, dir: number): void;
     export function clearScreenDown(stream: NodeJS.WritableStream): void;
 }
@@ -1013,7 +1013,7 @@ declare module "child_process" {
     import * as stream from "stream";
 
     export interface ChildProcess extends events.EventEmitter {
-        stdin:  stream.Writable;
+        stdin: stream.Writable;
         stdout: stream.Readable;
         stderr: stream.Readable;
         stdio: [stream.Writable, stream.Readable, stream.Readable];
@@ -1051,11 +1051,11 @@ declare module "child_process" {
     export interface ExecOptionsWithBufferEncoding extends ExecOptions {
         encoding: string; // specify `null`.
     }
-    export function exec(command: string, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
-    export function exec(command: string, options: ExecOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function exec(command: string, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function exec(command: string, options: ExecOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
     // usage. child_process.exec("tsc", {encoding: null as string}, (err, stdout, stderr) => {});
-    export function exec(command: string, options: ExecOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) =>void ): ChildProcess;
-    export function exec(command: string, options: ExecOptions, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function exec(command: string, options: ExecOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) => void): ChildProcess;
+    export function exec(command: string, options: ExecOptions, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
 
     export interface ExecFileOptions {
         cwd?: string;
@@ -1072,16 +1072,16 @@ declare module "child_process" {
     export interface ExecFileOptionsWithBufferEncoding extends ExecFileOptions {
         encoding: string; // specify `null`.
     }
-    export function execFile(file: string, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
-    export function execFile(file: string, options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function execFile(file: string, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function execFile(file: string, options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
     // usage. child_process.execFile("file.sh", {encoding: null as string}, (err, stdout, stderr) => {});
-    export function execFile(file: string, options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) =>void ): ChildProcess;
-    export function execFile(file: string, options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
-    export function execFile(file: string, args?: string[], callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
-    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function execFile(file: string, options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) => void): ChildProcess;
+    export function execFile(file: string, options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function execFile(file: string, args?: string[], callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
     // usage. child_process.execFile("file.sh", ["foo"], {encoding: null as string}, (err, stdout, stderr) => {});
-    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) =>void ): ChildProcess;
-    export function execFile(file: string, args?: string[], options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) => void): ChildProcess;
+    export function execFile(file: string, args?: string[], options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
 
     export interface ForkOptions {
         cwd?: string;
@@ -1197,24 +1197,24 @@ declare module "url" {
         path?: string;
     }
 
-    export function parse(urlStr: string, parseQueryString?: boolean , slashesDenoteHost?: boolean ): Url;
+    export function parse(urlStr: string, parseQueryString?: boolean, slashesDenoteHost?: boolean): Url;
     export function format(url: Url): string;
     export function resolve(from: string, to: string): string;
 }
 
 declare module "dns" {
-    export function lookup(domain: string, family: number, callback: (err: Error, address: string, family: number) =>void ): string;
-    export function lookup(domain: string, callback: (err: Error, address: string, family: number) =>void ): string;
-    export function resolve(domain: string, rrtype: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolve(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolve4(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolve6(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolveMx(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolveTxt(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolveSrv(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolveNs(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function resolveCname(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
-    export function reverse(ip: string, callback: (err: Error, domains: string[]) =>void ): string[];
+    export function lookup(domain: string, family: number, callback: (err: Error, address: string, family: number) => void): string;
+    export function lookup(domain: string, callback: (err: Error, address: string, family: number) => void): string;
+    export function resolve(domain: string, rrtype: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolve(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolve4(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolve6(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolveMx(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolveTxt(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolveSrv(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolveNs(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function resolveCname(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
+    export function reverse(ip: string, callback: (err: Error, domains: string[]) => void): string[];
 }
 
 declare module "net" {
@@ -1289,12 +1289,12 @@ declare module "net" {
         maxConnections: number;
         connections: number;
     }
-    export function createServer(connectionListener?: (socket: Socket) =>void ): Server;
-    export function createServer(options?: { allowHalfOpen?: boolean; }, connectionListener?: (socket: Socket) =>void ): Server;
-    export function connect(options: { port: number, host?: string, localAddress? : string, localPort? : string, family? : number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
+    export function createServer(connectionListener?: (socket: Socket) => void): Server;
+    export function createServer(options?: { allowHalfOpen?: boolean; }, connectionListener?: (socket: Socket) => void): Server;
+    export function connect(options: { port: number, host?: string, localAddress?: string, localPort?: string, family?: number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
     export function connect(port: number, host?: string, connectionListener?: Function): Socket;
     export function connect(path: string, connectionListener?: Function): Socket;
-    export function createConnection(options: { port: number, host?: string, localAddress? : string, localPort? : string, family? : number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
+    export function createConnection(options: { port: number, host?: string, localAddress?: string, localPort?: string, family?: number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
     export function createConnection(port: number, host?: string, connectionListener?: Function): Socket;
     export function createConnection(path: string, connectionListener?: Function): Socket;
     export function isIP(input: string): number;
@@ -1422,7 +1422,7 @@ declare module "fs" {
     export function readlink(path: string, callback?: (err: NodeJS.ErrnoException, linkString: string) => any): void;
     export function readlinkSync(path: string): string;
     export function realpath(path: string, callback?: (err: NodeJS.ErrnoException, resolvedPath: string) => any): void;
-    export function realpath(path: string, cache: {[path: string]: string}, callback: (err: NodeJS.ErrnoException, resolvedPath: string) =>any): void;
+    export function realpath(path: string, cache: { [path: string]: string }, callback: (err: NodeJS.ErrnoException, resolvedPath: string) => any): void;
     export function realpathSync(path: string, cache?: { [path: string]: string }): string;
     /*
      * Asynchronous unlink - deletes the file specified in {path}
@@ -1612,7 +1612,7 @@ declare module "fs" {
     export function access(path: string, callback: (err: NodeJS.ErrnoException) => void): void;
     export function access(path: string, mode: number, callback: (err: NodeJS.ErrnoException) => void): void;
     /** Synchronous version of fs.access. This throws if any accessibility checks fail, and does nothing otherwise. */
-    export function accessSync(path: string, mode ?: number): void;
+    export function accessSync(path: string, mode?: number): void;
     export function createReadStream(path: string, options?: {
         flags?: string;
         encoding?: string;
@@ -1744,33 +1744,33 @@ declare module "path" {
     export function format(pathObject: ParsedPath): string;
 
     export module posix {
-      export function normalize(p: string): string;
-      export function join(...paths: any[]): string;
-      export function resolve(...pathSegments: any[]): string;
-      export function isAbsolute(p: string): boolean;
-      export function relative(from: string, to: string): string;
-      export function dirname(p: string): string;
-      export function basename(p: string, ext?: string): string;
-      export function extname(p: string): string;
-      export var sep: string;
-      export var delimiter: string;
-      export function parse(p: string): ParsedPath;
-      export function format(pP: ParsedPath): string;
+        export function normalize(p: string): string;
+        export function join(...paths: any[]): string;
+        export function resolve(...pathSegments: any[]): string;
+        export function isAbsolute(p: string): boolean;
+        export function relative(from: string, to: string): string;
+        export function dirname(p: string): string;
+        export function basename(p: string, ext?: string): string;
+        export function extname(p: string): string;
+        export var sep: string;
+        export var delimiter: string;
+        export function parse(p: string): ParsedPath;
+        export function format(pP: ParsedPath): string;
     }
 
     export module win32 {
-      export function normalize(p: string): string;
-      export function join(...paths: any[]): string;
-      export function resolve(...pathSegments: any[]): string;
-      export function isAbsolute(p: string): boolean;
-      export function relative(from: string, to: string): string;
-      export function dirname(p: string): string;
-      export function basename(p: string, ext?: string): string;
-      export function extname(p: string): string;
-      export var sep: string;
-      export var delimiter: string;
-      export function parse(p: string): ParsedPath;
-      export function format(pP: ParsedPath): string;
+        export function normalize(p: string): string;
+        export function join(...paths: any[]): string;
+        export function resolve(...pathSegments: any[]): string;
+        export function isAbsolute(p: string): boolean;
+        export function relative(from: string, to: string): string;
+        export function dirname(p: string): string;
+        export function basename(p: string, ext?: string): string;
+        export function extname(p: string): string;
+        export var sep: string;
+        export var delimiter: string;
+        export function parse(p: string): ParsedPath;
+        export function format(pP: ParsedPath): string;
     }
 }
 
@@ -1791,7 +1791,7 @@ declare module "tls" {
 
     var CLIENT_RENEG_LIMIT: number;
     var CLIENT_RENEG_WINDOW: number;
-    
+
     export interface Certificate {
         /**
          * Country code.
@@ -1830,7 +1830,7 @@ declare module "tls" {
         version: string;
     }
 
-    export interface TLSSocket extends stream.Duplex {
+    export class TLSSocket extends stream.Duplex {
         /**
          * Returns the bound address, the address family name and port of the underlying socket as reported by
          * the operating system. 
@@ -1931,7 +1931,7 @@ declare module "tls" {
          */
         setMaxSendFragment(size: number): boolean;
     }
-    
+
     export interface TlsOptions {
         host?: string;
         port?: number;
@@ -2012,10 +2012,10 @@ declare module "tls" {
         context: any;
     }
 
-    export function createServer(options: TlsOptions, secureConnectionListener?: (cleartextStream: ClearTextStream) =>void ): Server;
-    export function connect(options: TlsOptions, secureConnectionListener?: () =>void ): ClearTextStream;
-    export function connect(port: number, host?: string, options?: ConnectionOptions, secureConnectListener?: () =>void ): ClearTextStream;
-    export function connect(port: number, options?: ConnectionOptions, secureConnectListener?: () =>void ): ClearTextStream;
+    export function createServer(options: TlsOptions, secureConnectionListener?: (cleartextStream: ClearTextStream) => void): Server;
+    export function connect(options: TlsOptions, secureConnectionListener?: () => void): ClearTextStream;
+    export function connect(port: number, host?: string, options?: ConnectionOptions, secureConnectListener?: () => void): ClearTextStream;
+    export function connect(port: number, options?: ConnectionOptions, secureConnectListener?: () => void): ClearTextStream;
     export function createSecurePair(credentials?: crypto.Credentials, isServer?: boolean, requestCert?: boolean, rejectUnauthorized?: boolean): SecurePair;
     export function createSecureContext(details: SecureContextOptions): SecureContext;
 }
@@ -2051,9 +2051,9 @@ declare module "crypto" {
     export function createCipheriv(algorithm: string, key: any, iv: any): Cipher;
     export interface Cipher extends NodeJS.ReadWriteStream {
         update(data: Buffer): Buffer;
-        update(data: string, input_encoding: "utf8"|"ascii"|"binary"): Buffer;
-        update(data: Buffer, input_encoding: any, output_encoding: "binary"|"base64"|"hex"): string;
-        update(data: string, input_encoding: "utf8"|"ascii"|"binary", output_encoding: "binary"|"base64"|"hex"): string;
+        update(data: string, input_encoding: "utf8" | "ascii" | "binary"): Buffer;
+        update(data: Buffer, input_encoding: any, output_encoding: "binary" | "base64" | "hex"): string;
+        update(data: string, input_encoding: "utf8" | "ascii" | "binary", output_encoding: "binary" | "base64" | "hex"): string;
         final(): Buffer;
         final(output_encoding: string): string;
         setAutoPadding(auto_padding: boolean): void;
@@ -2063,9 +2063,9 @@ declare module "crypto" {
     export function createDecipheriv(algorithm: string, key: any, iv: any): Decipher;
     export interface Decipher extends NodeJS.ReadWriteStream {
         update(data: Buffer): Buffer;
-        update(data: string, input_encoding: "binary"|"base64"|"hex"): Buffer;
-        update(data: Buffer, input_encoding: any, output_encoding: "utf8"|"ascii"|"binary"): string;
-        update(data: string, input_encoding: "binary"|"base64"|"hex", output_encoding: "utf8"|"ascii"|"binary"): string;
+        update(data: string, input_encoding: "binary" | "base64" | "hex"): Buffer;
+        update(data: Buffer, input_encoding: any, output_encoding: "utf8" | "ascii" | "binary"): string;
+        update(data: string, input_encoding: "binary" | "base64" | "hex", output_encoding: "utf8" | "ascii" | "binary"): string;
         final(): Buffer;
         final(output_encoding: string): string;
         setAutoPadding(auto_padding: boolean): void;
@@ -2094,14 +2094,14 @@ declare module "crypto" {
         setPrivateKey(public_key: string, encoding?: string): void;
     }
     export function getDiffieHellman(group_name: string): DiffieHellman;
-    export function pbkdf2(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number, callback: (err: Error, derivedKey: Buffer) => any): void;
-    export function pbkdf2(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number, digest: string, callback: (err: Error, derivedKey: Buffer) => any): void;
-    export function pbkdf2Sync(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number) : Buffer;
-    export function pbkdf2Sync(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number, digest: string) : Buffer;
+    export function pbkdf2(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number, callback: (err: Error, derivedKey: Buffer) => any): void;
+    export function pbkdf2(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number, digest: string, callback: (err: Error, derivedKey: Buffer) => any): void;
+    export function pbkdf2Sync(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number): Buffer;
+    export function pbkdf2Sync(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number, digest: string): Buffer;
     export function randomBytes(size: number): Buffer;
-    export function randomBytes(size: number, callback: (err: Error, buf: Buffer) =>void ): void;
+    export function randomBytes(size: number, callback: (err: Error, buf: Buffer) => void): void;
     export function pseudoRandomBytes(size: number): Buffer;
-    export function pseudoRandomBytes(size: number, callback: (err: Error, buf: Buffer) =>void ): void;
+    export function pseudoRandomBytes(size: number, callback: (err: Error, buf: Buffer) => void): void;
     export interface RsaPublicKey {
         key: string;
         padding?: any;
@@ -2111,8 +2111,8 @@ declare module "crypto" {
         passphrase?: string,
         padding?: any;
     }
-    export function publicEncrypt(public_key: string|RsaPublicKey, buffer: Buffer): Buffer
-    export function privateDecrypt(private_key: string|RsaPrivateKey, buffer: Buffer): Buffer
+    export function publicEncrypt(public_key: string | RsaPublicKey, buffer: Buffer): Buffer
+    export function privateDecrypt(private_key: string | RsaPrivateKey, buffer: Buffer): Buffer
 }
 
 declare module "stream" {
@@ -2176,7 +2176,7 @@ declare module "stream" {
         end(chunk: any, encoding?: string, cb?: Function): void;
     }
 
-    export interface TransformOptions extends ReadableOptions, WritableOptions {}
+    export interface TransformOptions extends ReadableOptions, WritableOptions { }
 
     // Note: Transform lacks the _read and _write methods of Readable/Writable.
     export class Transform extends events.EventEmitter implements NodeJS.ReadWriteStream {
@@ -2201,7 +2201,7 @@ declare module "stream" {
         end(chunk: any, encoding?: string, cb?: Function): void;
     }
 
-    export class PassThrough extends Transform {}
+    export class PassThrough extends Transform { }
 }
 
 declare module "util" {
@@ -2225,11 +2225,11 @@ declare module "util" {
     export function isDate(object: any): boolean;
     export function isError(object: any): boolean;
     export function inherits(constructor: any, superConstructor: any): void;
-    export function debuglog(key:string): (msg:string,...param: any[])=>void;
+    export function debuglog(key: string): (msg: string, ...param: any[]) => void;
 }
 
 declare module "assert" {
-    function internal (value: any, message?: string): void;
+    function internal(value: any, message?: string): void;
     namespace internal {
         export class AssertionError implements Error {
             name: string;
@@ -2239,8 +2239,10 @@ declare module "assert" {
             operator: string;
             generatedMessage: boolean;
 
-            constructor(options?: {message?: string; actual?: any; expected?: any;
-                                  operator?: string; stackStartFunction?: Function});
+            constructor(options?: {
+                message?: string; actual?: any; expected?: any;
+                operator?: string; stackStartFunction?: Function
+            });
         }
 
         export function fail(actual?: any, expected?: any, message?: string, operator?: string): void;

From b69044ebdc5265024809a1f2da30c0089f418ac8 Mon Sep 17 00:00:00 2001
From: Boris Breuer <Engineer2B@users.noreply.github.com>
Date: Tue, 10 May 2016 23:12:25 +0200
Subject: [PATCH 063/278] Reverted changes to formatting

---
 node/node.d.ts | 224 ++++++++++++++++++++++++-------------------------
 1 file changed, 111 insertions(+), 113 deletions(-)

diff --git a/node/node.d.ts b/node/node.d.ts
index 40a12057db..bf8a3f9aea 100644
--- a/node/node.d.ts
+++ b/node/node.d.ts
@@ -17,10 +17,10 @@ interface Error {
 // compat for TypeScript 1.8
 // if you use with --target es3 or --target es5 and use below definitions,
 // use the lib.es6.d.ts that is bundled with TypeScript 1.8.
-interface MapConstructor { }
-interface WeakMapConstructor { }
-interface SetConstructor { }
-interface WeakSetConstructor { }
+interface MapConstructor {}
+interface WeakMapConstructor {}
+interface SetConstructor {}
+interface WeakSetConstructor {}
 
 /************************************************
 *                                               *
@@ -45,7 +45,7 @@ interface NodeRequireFunction {
 }
 
 interface NodeRequire extends NodeRequireFunction {
-    resolve(id: string): string;
+    resolve(id:string): string;
     cache: any;
     extensions: any;
     main: any;
@@ -81,7 +81,7 @@ declare var SlowBuffer: {
 
 // Buffer class
 type BufferEncoding = "ascii" | "utf8" | "utf16le" | "ucs2" | "binary" | "hex";
-interface Buffer extends NodeBuffer { }
+interface Buffer extends NodeBuffer {}
 
 /**
  * Raw data is stored in instances of the Buffer class.
@@ -145,7 +145,7 @@ declare var Buffer: {
      * @param byteOffset
      * @param length
      */
-    from(arrayBuffer: ArrayBuffer, byteOffset?: number, length?: number): Buffer;
+    from(arrayBuffer: ArrayBuffer, byteOffset?: number, length?:number): Buffer;
     /**
      * Copies the passed {buffer} data onto a new Buffer instance.
      *
@@ -228,7 +228,7 @@ declare namespace NodeJS {
 
     export interface ReadableStream extends EventEmitter {
         readable: boolean;
-        read(size?: number): string | Buffer;
+        read(size?: number): string|Buffer;
         setEncoding(encoding: string): void;
         pause(): void;
         resume(): void;
@@ -241,7 +241,7 @@ declare namespace NodeJS {
 
     export interface WritableStream extends EventEmitter {
         writable: boolean;
-        write(buffer: Buffer | string, cb?: Function): boolean;
+        write(buffer: Buffer|string, cb?: Function): boolean;
         write(str: string, encoding?: string, cb?: Function): boolean;
         end(): void;
         end(buffer: Buffer, cb?: Function): void;
@@ -249,7 +249,7 @@ declare namespace NodeJS {
         end(str: string, encoding?: string, cb?: Function): void;
     }
 
-    export interface ReadWriteStream extends ReadableStream, WritableStream { }
+    export interface ReadWriteStream extends ReadableStream, WritableStream {}
 
     export interface Events extends EventEmitter { }
 
@@ -328,7 +328,7 @@ declare namespace NodeJS {
                 visibility: string;
             };
         };
-        kill(pid: number, signal?: string | number): void;
+        kill(pid:number, signal?: string|number): void;
         pid: number;
         title: string;
         arch: string;
@@ -337,7 +337,7 @@ declare namespace NodeJS {
         nextTick(callback: Function): void;
         umask(mask?: number): number;
         uptime(): number;
-        hrtime(time?: number[]): number[];
+        hrtime(time?:number[]): number[];
         domain: Domain;
 
         // Worker
@@ -413,8 +413,8 @@ declare namespace NodeJS {
     }
 
     export interface Timer {
-        ref(): void;
-        unref(): void;
+        ref() : void;
+        unref() : void;
     }
 }
 
@@ -539,7 +539,7 @@ declare module "http" {
         path?: string;
         headers?: { [key: string]: any };
         auth?: string;
-        agent?: Agent | boolean;
+        agent?: Agent|boolean;
     }
 
     export interface Server extends events.EventEmitter, net.Server {
@@ -679,7 +679,7 @@ declare module "http" {
         [errorCode: number]: string;
         [errorCode: string]: string;
     };
-    export function createServer(requestListener?: (request: IncomingMessage, response: ServerResponse) => void): Server;
+    export function createServer(requestListener?: (request: IncomingMessage, response: ServerResponse) =>void ): Server;
     export function createClient(port?: number, host?: string): any;
     export function request(options: RequestOptions, callback?: (res: IncomingMessage) => void): ClientRequest;
     export function get(options: any, callback?: (res: IncomingMessage) => void): ClientRequest;
@@ -763,19 +763,19 @@ declare module "zlib" {
     export function createInflateRaw(options?: ZlibOptions): InflateRaw;
     export function createUnzip(options?: ZlibOptions): Unzip;
 
-    export function deflate(buf: Buffer, callback: (error: Error, result: any) => void): void;
+    export function deflate(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
     export function deflateSync(buf: Buffer, options?: ZlibOptions): any;
-    export function deflateRaw(buf: Buffer, callback: (error: Error, result: any) => void): void;
+    export function deflateRaw(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
     export function deflateRawSync(buf: Buffer, options?: ZlibOptions): any;
-    export function gzip(buf: Buffer, callback: (error: Error, result: any) => void): void;
+    export function gzip(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
     export function gzipSync(buf: Buffer, options?: ZlibOptions): any;
-    export function gunzip(buf: Buffer, callback: (error: Error, result: any) => void): void;
+    export function gunzip(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
     export function gunzipSync(buf: Buffer, options?: ZlibOptions): any;
-    export function inflate(buf: Buffer, callback: (error: Error, result: any) => void): void;
+    export function inflate(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
     export function inflateSync(buf: Buffer, options?: ZlibOptions): any;
-    export function inflateRaw(buf: Buffer, callback: (error: Error, result: any) => void): void;
+    export function inflateRaw(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
     export function inflateRawSync(buf: Buffer, options?: ZlibOptions): any;
-    export function unzip(buf: Buffer, callback: (error: Error, result: any) => void): void;
+    export function unzip(buf: Buffer, callback: (error: Error, result: any) =>void ): void;
     export function unzipSync(buf: Buffer, options?: ZlibOptions): any;
 
     // Constants
@@ -846,7 +846,7 @@ declare module "os" {
     export function totalmem(): number;
     export function freemem(): number;
     export function cpus(): CpuInfo[];
-    export function networkInterfaces(): { [index: string]: NetworkInterfaceInfo[] };
+    export function networkInterfaces(): {[index: string]: NetworkInterfaceInfo[]};
     export var EOL: string;
 }
 
@@ -870,7 +870,7 @@ declare module "https" {
         SNICallback?: (servername: string) => any;
     }
 
-    export interface RequestOptions extends http.RequestOptions {
+    export interface RequestOptions extends http.RequestOptions{
         pfx?: any;
         key?: any;
         passphrase?: string;
@@ -891,8 +891,8 @@ declare module "https" {
     };
     export interface Server extends tls.Server { }
     export function createServer(options: ServerOptions, requestListener?: Function): Server;
-    export function request(options: RequestOptions, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
-    export function get(options: RequestOptions, callback?: (res: http.IncomingMessage) => void): http.ClientRequest;
+    export function request(options: RequestOptions, callback?: (res: http.IncomingMessage) =>void ): http.ClientRequest;
+    export function get(options: RequestOptions, callback?: (res: http.IncomingMessage) =>void ): http.ClientRequest;
     export var globalAgent: Agent;
 }
 
@@ -946,7 +946,7 @@ declare module "readline" {
         pause(): ReadLine;
         resume(): ReadLine;
         close(): void;
-        write(data: string | Buffer, key?: Key): void;
+        write(data: string|Buffer, key?: Key): void;
     }
 
     export interface Completer {
@@ -971,7 +971,7 @@ declare module "readline" {
     export function createInterface(options: ReadLineOptions): ReadLine;
 
     export function cursorTo(stream: NodeJS.WritableStream, x: number, y: number): void;
-    export function moveCursor(stream: NodeJS.WritableStream, dx: number | string, dy: number | string): void;
+    export function moveCursor(stream: NodeJS.WritableStream, dx: number|string, dy: number|string): void;
     export function clearLine(stream: NodeJS.WritableStream, dir: number): void;
     export function clearScreenDown(stream: NodeJS.WritableStream): void;
 }
@@ -1013,7 +1013,7 @@ declare module "child_process" {
     import * as stream from "stream";
 
     export interface ChildProcess extends events.EventEmitter {
-        stdin: stream.Writable;
+        stdin:  stream.Writable;
         stdout: stream.Readable;
         stderr: stream.Readable;
         stdio: [stream.Writable, stream.Readable, stream.Readable];
@@ -1051,11 +1051,11 @@ declare module "child_process" {
     export interface ExecOptionsWithBufferEncoding extends ExecOptions {
         encoding: string; // specify `null`.
     }
-    export function exec(command: string, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
-    export function exec(command: string, options: ExecOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function exec(command: string, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function exec(command: string, options: ExecOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
     // usage. child_process.exec("tsc", {encoding: null as string}, (err, stdout, stderr) => {});
-    export function exec(command: string, options: ExecOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) => void): ChildProcess;
-    export function exec(command: string, options: ExecOptions, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function exec(command: string, options: ExecOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) =>void ): ChildProcess;
+    export function exec(command: string, options: ExecOptions, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
 
     export interface ExecFileOptions {
         cwd?: string;
@@ -1072,16 +1072,16 @@ declare module "child_process" {
     export interface ExecFileOptionsWithBufferEncoding extends ExecFileOptions {
         encoding: string; // specify `null`.
     }
-    export function execFile(file: string, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
-    export function execFile(file: string, options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function execFile(file: string, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function execFile(file: string, options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
     // usage. child_process.execFile("file.sh", {encoding: null as string}, (err, stdout, stderr) => {});
-    export function execFile(file: string, options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) => void): ChildProcess;
-    export function execFile(file: string, options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
-    export function execFile(file: string, args?: string[], callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
-    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function execFile(file: string, options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) =>void ): ChildProcess;
+    export function execFile(file: string, options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function execFile(file: string, args?: string[], callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
+    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithStringEncoding, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
     // usage. child_process.execFile("file.sh", ["foo"], {encoding: null as string}, (err, stdout, stderr) => {});
-    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) => void): ChildProcess;
-    export function execFile(file: string, args?: string[], options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) => void): ChildProcess;
+    export function execFile(file: string, args?: string[], options?: ExecFileOptionsWithBufferEncoding, callback?: (error: Error, stdout: Buffer, stderr: Buffer) =>void ): ChildProcess;
+    export function execFile(file: string, args?: string[], options?: ExecFileOptions, callback?: (error: Error, stdout: string, stderr: string) =>void ): ChildProcess;
 
     export interface ForkOptions {
         cwd?: string;
@@ -1197,24 +1197,24 @@ declare module "url" {
         path?: string;
     }
 
-    export function parse(urlStr: string, parseQueryString?: boolean, slashesDenoteHost?: boolean): Url;
+    export function parse(urlStr: string, parseQueryString?: boolean , slashesDenoteHost?: boolean ): Url;
     export function format(url: Url): string;
     export function resolve(from: string, to: string): string;
 }
 
 declare module "dns" {
-    export function lookup(domain: string, family: number, callback: (err: Error, address: string, family: number) => void): string;
-    export function lookup(domain: string, callback: (err: Error, address: string, family: number) => void): string;
-    export function resolve(domain: string, rrtype: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolve(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolve4(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolve6(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolveMx(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolveTxt(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolveSrv(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolveNs(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function resolveCname(domain: string, callback: (err: Error, addresses: string[]) => void): string[];
-    export function reverse(ip: string, callback: (err: Error, domains: string[]) => void): string[];
+    export function lookup(domain: string, family: number, callback: (err: Error, address: string, family: number) =>void ): string;
+    export function lookup(domain: string, callback: (err: Error, address: string, family: number) =>void ): string;
+    export function resolve(domain: string, rrtype: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolve(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolve4(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolve6(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolveMx(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolveTxt(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolveSrv(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolveNs(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function resolveCname(domain: string, callback: (err: Error, addresses: string[]) =>void ): string[];
+    export function reverse(ip: string, callback: (err: Error, domains: string[]) =>void ): string[];
 }
 
 declare module "net" {
@@ -1289,12 +1289,12 @@ declare module "net" {
         maxConnections: number;
         connections: number;
     }
-    export function createServer(connectionListener?: (socket: Socket) => void): Server;
-    export function createServer(options?: { allowHalfOpen?: boolean; }, connectionListener?: (socket: Socket) => void): Server;
-    export function connect(options: { port: number, host?: string, localAddress?: string, localPort?: string, family?: number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
+    export function createServer(connectionListener?: (socket: Socket) =>void ): Server;
+    export function createServer(options?: { allowHalfOpen?: boolean; }, connectionListener?: (socket: Socket) =>void ): Server;
+    export function connect(options: { port: number, host?: string, localAddress? : string, localPort? : string, family? : number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
     export function connect(port: number, host?: string, connectionListener?: Function): Socket;
     export function connect(path: string, connectionListener?: Function): Socket;
-    export function createConnection(options: { port: number, host?: string, localAddress?: string, localPort?: string, family?: number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
+    export function createConnection(options: { port: number, host?: string, localAddress? : string, localPort? : string, family? : number, allowHalfOpen?: boolean; }, connectionListener?: Function): Socket;
     export function createConnection(port: number, host?: string, connectionListener?: Function): Socket;
     export function createConnection(path: string, connectionListener?: Function): Socket;
     export function isIP(input: string): number;
@@ -1422,7 +1422,7 @@ declare module "fs" {
     export function readlink(path: string, callback?: (err: NodeJS.ErrnoException, linkString: string) => any): void;
     export function readlinkSync(path: string): string;
     export function realpath(path: string, callback?: (err: NodeJS.ErrnoException, resolvedPath: string) => any): void;
-    export function realpath(path: string, cache: { [path: string]: string }, callback: (err: NodeJS.ErrnoException, resolvedPath: string) => any): void;
+    export function realpath(path: string, cache: {[path: string]: string}, callback: (err: NodeJS.ErrnoException, resolvedPath: string) =>any): void;
     export function realpathSync(path: string, cache?: { [path: string]: string }): string;
     /*
      * Asynchronous unlink - deletes the file specified in {path}
@@ -1612,7 +1612,7 @@ declare module "fs" {
     export function access(path: string, callback: (err: NodeJS.ErrnoException) => void): void;
     export function access(path: string, mode: number, callback: (err: NodeJS.ErrnoException) => void): void;
     /** Synchronous version of fs.access. This throws if any accessibility checks fail, and does nothing otherwise. */
-    export function accessSync(path: string, mode?: number): void;
+    export function accessSync(path: string, mode ?: number): void;
     export function createReadStream(path: string, options?: {
         flags?: string;
         encoding?: string;
@@ -1744,33 +1744,33 @@ declare module "path" {
     export function format(pathObject: ParsedPath): string;
 
     export module posix {
-        export function normalize(p: string): string;
-        export function join(...paths: any[]): string;
-        export function resolve(...pathSegments: any[]): string;
-        export function isAbsolute(p: string): boolean;
-        export function relative(from: string, to: string): string;
-        export function dirname(p: string): string;
-        export function basename(p: string, ext?: string): string;
-        export function extname(p: string): string;
-        export var sep: string;
-        export var delimiter: string;
-        export function parse(p: string): ParsedPath;
-        export function format(pP: ParsedPath): string;
+      export function normalize(p: string): string;
+      export function join(...paths: any[]): string;
+      export function resolve(...pathSegments: any[]): string;
+      export function isAbsolute(p: string): boolean;
+      export function relative(from: string, to: string): string;
+      export function dirname(p: string): string;
+      export function basename(p: string, ext?: string): string;
+      export function extname(p: string): string;
+      export var sep: string;
+      export var delimiter: string;
+      export function parse(p: string): ParsedPath;
+      export function format(pP: ParsedPath): string;
     }
 
     export module win32 {
-        export function normalize(p: string): string;
-        export function join(...paths: any[]): string;
-        export function resolve(...pathSegments: any[]): string;
-        export function isAbsolute(p: string): boolean;
-        export function relative(from: string, to: string): string;
-        export function dirname(p: string): string;
-        export function basename(p: string, ext?: string): string;
-        export function extname(p: string): string;
-        export var sep: string;
-        export var delimiter: string;
-        export function parse(p: string): ParsedPath;
-        export function format(pP: ParsedPath): string;
+      export function normalize(p: string): string;
+      export function join(...paths: any[]): string;
+      export function resolve(...pathSegments: any[]): string;
+      export function isAbsolute(p: string): boolean;
+      export function relative(from: string, to: string): string;
+      export function dirname(p: string): string;
+      export function basename(p: string, ext?: string): string;
+      export function extname(p: string): string;
+      export var sep: string;
+      export var delimiter: string;
+      export function parse(p: string): ParsedPath;
+      export function format(pP: ParsedPath): string;
     }
 }
 
@@ -1791,7 +1791,7 @@ declare module "tls" {
 
     var CLIENT_RENEG_LIMIT: number;
     var CLIENT_RENEG_WINDOW: number;
-
+    
     export interface Certificate {
         /**
          * Country code.
@@ -1931,7 +1931,7 @@ declare module "tls" {
          */
         setMaxSendFragment(size: number): boolean;
     }
-
+    
     export interface TlsOptions {
         host?: string;
         port?: number;
@@ -2012,10 +2012,10 @@ declare module "tls" {
         context: any;
     }
 
-    export function createServer(options: TlsOptions, secureConnectionListener?: (cleartextStream: ClearTextStream) => void): Server;
-    export function connect(options: TlsOptions, secureConnectionListener?: () => void): ClearTextStream;
-    export function connect(port: number, host?: string, options?: ConnectionOptions, secureConnectListener?: () => void): ClearTextStream;
-    export function connect(port: number, options?: ConnectionOptions, secureConnectListener?: () => void): ClearTextStream;
+    export function createServer(options: TlsOptions, secureConnectionListener?: (cleartextStream: ClearTextStream) =>void ): Server;
+    export function connect(options: TlsOptions, secureConnectionListener?: () =>void ): ClearTextStream;
+    export function connect(port: number, host?: string, options?: ConnectionOptions, secureConnectListener?: () =>void ): ClearTextStream;
+    export function connect(port: number, options?: ConnectionOptions, secureConnectListener?: () =>void ): ClearTextStream;
     export function createSecurePair(credentials?: crypto.Credentials, isServer?: boolean, requestCert?: boolean, rejectUnauthorized?: boolean): SecurePair;
     export function createSecureContext(details: SecureContextOptions): SecureContext;
 }
@@ -2051,9 +2051,9 @@ declare module "crypto" {
     export function createCipheriv(algorithm: string, key: any, iv: any): Cipher;
     export interface Cipher extends NodeJS.ReadWriteStream {
         update(data: Buffer): Buffer;
-        update(data: string, input_encoding: "utf8" | "ascii" | "binary"): Buffer;
-        update(data: Buffer, input_encoding: any, output_encoding: "binary" | "base64" | "hex"): string;
-        update(data: string, input_encoding: "utf8" | "ascii" | "binary", output_encoding: "binary" | "base64" | "hex"): string;
+        update(data: string, input_encoding: "utf8"|"ascii"|"binary"): Buffer;
+        update(data: Buffer, input_encoding: any, output_encoding: "binary"|"base64"|"hex"): string;
+        update(data: string, input_encoding: "utf8"|"ascii"|"binary", output_encoding: "binary"|"base64"|"hex"): string;
         final(): Buffer;
         final(output_encoding: string): string;
         setAutoPadding(auto_padding: boolean): void;
@@ -2063,9 +2063,9 @@ declare module "crypto" {
     export function createDecipheriv(algorithm: string, key: any, iv: any): Decipher;
     export interface Decipher extends NodeJS.ReadWriteStream {
         update(data: Buffer): Buffer;
-        update(data: string, input_encoding: "binary" | "base64" | "hex"): Buffer;
-        update(data: Buffer, input_encoding: any, output_encoding: "utf8" | "ascii" | "binary"): string;
-        update(data: string, input_encoding: "binary" | "base64" | "hex", output_encoding: "utf8" | "ascii" | "binary"): string;
+        update(data: string, input_encoding: "binary"|"base64"|"hex"): Buffer;
+        update(data: Buffer, input_encoding: any, output_encoding: "utf8"|"ascii"|"binary"): string;
+        update(data: string, input_encoding: "binary"|"base64"|"hex", output_encoding: "utf8"|"ascii"|"binary"): string;
         final(): Buffer;
         final(output_encoding: string): string;
         setAutoPadding(auto_padding: boolean): void;
@@ -2094,14 +2094,14 @@ declare module "crypto" {
         setPrivateKey(public_key: string, encoding?: string): void;
     }
     export function getDiffieHellman(group_name: string): DiffieHellman;
-    export function pbkdf2(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number, callback: (err: Error, derivedKey: Buffer) => any): void;
-    export function pbkdf2(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number, digest: string, callback: (err: Error, derivedKey: Buffer) => any): void;
-    export function pbkdf2Sync(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number): Buffer;
-    export function pbkdf2Sync(password: string | Buffer, salt: string | Buffer, iterations: number, keylen: number, digest: string): Buffer;
+    export function pbkdf2(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number, callback: (err: Error, derivedKey: Buffer) => any): void;
+    export function pbkdf2(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number, digest: string, callback: (err: Error, derivedKey: Buffer) => any): void;
+    export function pbkdf2Sync(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number) : Buffer;
+    export function pbkdf2Sync(password: string|Buffer, salt: string|Buffer, iterations: number, keylen: number, digest: string) : Buffer;
     export function randomBytes(size: number): Buffer;
-    export function randomBytes(size: number, callback: (err: Error, buf: Buffer) => void): void;
+    export function randomBytes(size: number, callback: (err: Error, buf: Buffer) =>void ): void;
     export function pseudoRandomBytes(size: number): Buffer;
-    export function pseudoRandomBytes(size: number, callback: (err: Error, buf: Buffer) => void): void;
+    export function pseudoRandomBytes(size: number, callback: (err: Error, buf: Buffer) =>void ): void;
     export interface RsaPublicKey {
         key: string;
         padding?: any;
@@ -2111,8 +2111,8 @@ declare module "crypto" {
         passphrase?: string,
         padding?: any;
     }
-    export function publicEncrypt(public_key: string | RsaPublicKey, buffer: Buffer): Buffer
-    export function privateDecrypt(private_key: string | RsaPrivateKey, buffer: Buffer): Buffer
+    export function publicEncrypt(public_key: string|RsaPublicKey, buffer: Buffer): Buffer
+    export function privateDecrypt(private_key: string|RsaPrivateKey, buffer: Buffer): Buffer
 }
 
 declare module "stream" {
@@ -2176,7 +2176,7 @@ declare module "stream" {
         end(chunk: any, encoding?: string, cb?: Function): void;
     }
 
-    export interface TransformOptions extends ReadableOptions, WritableOptions { }
+    export interface TransformOptions extends ReadableOptions, WritableOptions {}
 
     // Note: Transform lacks the _read and _write methods of Readable/Writable.
     export class Transform extends events.EventEmitter implements NodeJS.ReadWriteStream {
@@ -2201,7 +2201,7 @@ declare module "stream" {
         end(chunk: any, encoding?: string, cb?: Function): void;
     }
 
-    export class PassThrough extends Transform { }
+    export class PassThrough extends Transform {}
 }
 
 declare module "util" {
@@ -2225,11 +2225,11 @@ declare module "util" {
     export function isDate(object: any): boolean;
     export function isError(object: any): boolean;
     export function inherits(constructor: any, superConstructor: any): void;
-    export function debuglog(key: string): (msg: string, ...param: any[]) => void;
+    export function debuglog(key:string): (msg:string,...param: any[])=>void;
 }
 
 declare module "assert" {
-    function internal(value: any, message?: string): void;
+    function internal (value: any, message?: string): void;
     namespace internal {
         export class AssertionError implements Error {
             name: string;
@@ -2239,10 +2239,8 @@ declare module "assert" {
             operator: string;
             generatedMessage: boolean;
 
-            constructor(options?: {
-                message?: string; actual?: any; expected?: any;
-                operator?: string; stackStartFunction?: Function
-            });
+            constructor(options?: {message?: string; actual?: any; expected?: any;
+                                  operator?: string; stackStartFunction?: Function});
         }
 
         export function fail(actual?: any, expected?: any, message?: string, operator?: string): void;

From f65db9f99f57c617ccb92e98659299f3d14bda7f Mon Sep 17 00:00:00 2001
From: Boris Breuer <Engineer2B@users.noreply.github.com>
Date: Tue, 10 May 2016 23:15:32 +0200
Subject: [PATCH 064/278] Made TLSSocket authorizationError non-optional

---
 node/node.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/node/node.d.ts b/node/node.d.ts
index bf8a3f9aea..5a56c68a73 100644
--- a/node/node.d.ts
+++ b/node/node.d.ts
@@ -1845,7 +1845,7 @@ declare module "tls" {
          * The reason why the peer's certificate has not been verified.
          * This property becomes available only when tlsSocket.authorized === false.
          */
-        authorizationError?: Error;
+        authorizationError: Error;
         /**
          * Static boolean value, always true.
          * May be used to distinguish TLS sockets from regular ones.

From 5d0618b145a887d69b8282119aacae2748927a39 Mon Sep 17 00:00:00 2001
From: Manuel Schweigert <manu-lg@hotmail.de>
Date: Thu, 12 May 2016 14:58:31 +0200
Subject: [PATCH 065/278] Add expressionRewriting members

These members are needed to create custom two-way bindings.
---
 knockout/knockout.d.ts | 22 ++++++++++++++++++++--
 1 file changed, 20 insertions(+), 2 deletions(-)

diff --git a/knockout/knockout.d.ts b/knockout/knockout.d.ts
index 6e53ac2e25..14dbce04a5 100644
--- a/knockout/knockout.d.ts
+++ b/knockout/knockout.d.ts
@@ -523,8 +523,26 @@ interface KnockoutStatic {
     renderTemplateForEach(template: any, arrayOrObservableArray: KnockoutObservable<any>, options: Object, targetNode: Node, parentBindingContext: KnockoutBindingContext): any;
 
     expressionRewriting: {
-        bindingRewriteValidators: any;
-        parseObjectLiteral: { (objectLiteralString: string): any[] }
+        bindingRewriteValidators: any[];
+        twoWayBindings: any;
+        parseObjectLiteral: (objectLiteralString: string): any[];
+        
+        /**
+        Internal, private KO utility for updating model properties from within bindings
+        property:            If the property being updated is (or might be) an observable, pass it here
+                             If it turns out to be a writable observable, it will be written to directly
+        allBindings:         An object with a get method to retrieve bindings in the current execution context.
+                             This will be searched for a '_ko_property_writers' property in case you're writing to a non-observable
+                             (See note below)
+        key:                 The key identifying the property to be written. Example: for { hasFocus: myValue }, write to 'myValue' by specifying the key 'hasFocus'
+        value:               The value to be written
+        checkIfDifferent:    If true, and if the property being written is a writable observable, the value will only be written if
+                             it is !== existing value on that writable observable
+                             
+        Note that if you need to write to the viewModel without an observable property,
+        you need to set ko.expressionRewriting.twoWayBindings[key] = true; *before* the binding evaluation.
+        */
+        writeValueToProperty: (property: KnockoutObservable<any> | any, allBindings: KnockoutAllBindingsAccessor, key: string, value: any, checkIfDifferent?: boolean): void;
     };
 
     /////////////////////////////////

From 1a3b6bdf54455b5dd828afb149e6fc758acd23b6 Mon Sep 17 00:00:00 2001
From: Manuel Schweigert <manu-lg@hotmail.de>
Date: Thu, 12 May 2016 15:09:47 +0200
Subject: [PATCH 066/278] Fix build error

---
 knockout/knockout.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/knockout/knockout.d.ts b/knockout/knockout.d.ts
index 14dbce04a5..6321cff0a5 100644
--- a/knockout/knockout.d.ts
+++ b/knockout/knockout.d.ts
@@ -525,7 +525,7 @@ interface KnockoutStatic {
     expressionRewriting: {
         bindingRewriteValidators: any[];
         twoWayBindings: any;
-        parseObjectLiteral: (objectLiteralString: string): any[];
+        parseObjectLiteral: (objectLiteralString: string) => any[];
         
         /**
         Internal, private KO utility for updating model properties from within bindings
@@ -542,7 +542,7 @@ interface KnockoutStatic {
         Note that if you need to write to the viewModel without an observable property,
         you need to set ko.expressionRewriting.twoWayBindings[key] = true; *before* the binding evaluation.
         */
-        writeValueToProperty: (property: KnockoutObservable<any> | any, allBindings: KnockoutAllBindingsAccessor, key: string, value: any, checkIfDifferent?: boolean): void;
+        writeValueToProperty: (property: KnockoutObservable<any> | any, allBindings: KnockoutAllBindingsAccessor, key: string, value: any, checkIfDifferent?: boolean) => void;
     };
 
     /////////////////////////////////

From 10677627809c5724457262661440110a801d92db Mon Sep 17 00:00:00 2001
From: Danilo Bargen <mail@dbrgn.ch>
Date: Thu, 12 May 2016 16:48:54 +0200
Subject: [PATCH 067/278] Add promise based API to RTCPeerConnection

---
 webrtc/RTCPeerConnection-tests.ts | 51 +++++++++++--------------------
 webrtc/RTCPeerConnection.d.ts     | 40 +++++++++++++++++-------
 2 files changed, 47 insertions(+), 44 deletions(-)

diff --git a/webrtc/RTCPeerConnection-tests.ts b/webrtc/RTCPeerConnection-tests.ts
index 1ed79bf2cc..ea850f8724 100644
--- a/webrtc/RTCPeerConnection-tests.ts
+++ b/webrtc/RTCPeerConnection-tests.ts
@@ -1,6 +1,8 @@
 /// <reference path="MediaStream.d.ts" />
 /// <reference path="RTCPeerConnection.d.ts" />
 
+let voidpromise: Promise<void>;
+
 var config: RTCConfiguration =
     { iceServers: [{ urls: "stun.l.google.com:19302" }] };
 var constraints: RTCMediaConstraints =
@@ -27,34 +29,27 @@ peerConnection.onicecandidate = ev => console.log(ev.type);
 peerConnection.onremovestream = ev => console.log(ev.type);
 peerConnection.onstatechange = ev => console.log(ev.type);
 
-peerConnection.createOffer(
-  offer => {
-    peerConnection.setLocalDescription(offer,
-      () => console.log("set local description"),
-      error => console.log("Error setting local description: " + error));
-  },
-  error => console.log("Error creating offer: " + error));
+peerConnection.createOffer();
+let offer2: Promise<RTCSessionDescription> = peerConnection.createOffer({
+    voiceActivityDetection: true,
+    iceRestart: false
+});
 
 var type: string = RTCSdpType[RTCSdpType.offer];
 var offer: RTCSessionDescriptionInit = { type: type, sdp: "some sdp" };
 var sessionDescription = new RTCSessionDescription(offer);
 
-peerConnection.setRemoteDescription(sessionDescription, () => {
-  peerConnection.createAnswer(
-    answer => {
-      peerConnection.setLocalDescription(answer,
-        () => console.log('Set local description'),
-      error => console.log(
-          "Error setting local description from created answer: " + error +
-          "; answer.sdp=" + answer.sdp));
-    },
-  error => console.log("Error creating answer: " + error));
-},
-error => console.log('Error setting remote description: ' + error +
-    "; offer.sdp=" + offer.sdp));
+peerConnection.setRemoteDescription(sessionDescription).then(
+    () => peerConnection.createAnswer(),
+    error => console.log('Error setting remote description: ' + error + "; offer.sdp=" + offer.sdp)
+);
 
 var webkitSessionDescription = new webkitRTCSessionDescription(offer);
 
+// New syntax
+voidpromise = peerConnection.setLocalDescription(webkitSessionDescription);
+
+// Legacy syntax
 peerConnection.setRemoteDescription(webkitSessionDescription, () => {
   peerConnection.createAnswer(
     answer => {
@@ -71,20 +66,10 @@ error => console.log('Error setting remote description: ' + error +
 
 var mozSessionDescription = new mozRTCSessionDescription(offer);
 
-peerConnection.setRemoteDescription(mozSessionDescription, () => {
-  peerConnection.createAnswer(
-    answer => {
-      peerConnection.setLocalDescription(answer,
-        () => console.log('Set local description'),
-      error => console.log(
-         "Error setting local description from created answer: " + error +
-         "; answer.sdp=" + answer.sdp));
-    },
-  error => console.log("Error creating answer: " + error));
-},
-error => console.log('Error setting remote description: ' + error +
-    "; offer.sdp=" + offer.sdp));
+peerConnection.setRemoteDescription(mozSessionDescription);
 
 var wkPeerConnection: webkitRTCPeerConnection =
     new webkitRTCPeerConnection(config, constraints);
 
+let candidate: RTCIceCandidate = {'candidate': 'foobar'};
+voidpromise = peerConnection.addIceCandidate(candidate);
diff --git a/webrtc/RTCPeerConnection.d.ts b/webrtc/RTCPeerConnection.d.ts
index b95b0b0a5c..dcd36d9aec 100644
--- a/webrtc/RTCPeerConnection.d.ts
+++ b/webrtc/RTCPeerConnection.d.ts
@@ -243,24 +243,40 @@ interface RTCStatsCallback {
   (report: RTCStatsReport): void;
 }
 
+interface RTCOfferAnswerOptions {
+    voiceActivityDetection ?: boolean; // default = true
+}
+
+interface RTCOfferOptions extends RTCOfferAnswerOptions {
+    iceRestart ?: boolean; // default = false
+}
+
+interface RTCAnswerOptions extends RTCOfferAnswerOptions { }
+
 interface RTCPeerConnection {
+
+  createOffer(options?: RTCOfferOptions): Promise<RTCSessionDescription>;
   createOffer(successCallback: RTCSessionDescriptionCallback,
               failureCallback?: RTCPeerConnectionErrorCallback,
-              constraints?: RTCMediaConstraints): void;
+              constraints?: RTCMediaConstraints): void; // Deprecated
+  createAnswer(options?: RTCAnswerOptions): Promise<RTCSessionDescription>;
   createAnswer(successCallback: RTCSessionDescriptionCallback,
                failureCallback?: RTCPeerConnectionErrorCallback,
-               constraints?: RTCMediaConstraints): void;
+               constraints?: RTCMediaConstraints): void; // Deprecated
+  setLocalDescription(description: RTCSessionDescription | RTCSessionDescriptionInit): Promise<void>;
   setLocalDescription(description: RTCSessionDescription,
                       successCallback?: RTCVoidCallback,
-                      failureCallback?: RTCPeerConnectionErrorCallback): void;
-  localDescription: RTCSessionDescription;
+                      failureCallback?: RTCPeerConnectionErrorCallback): void; // Deprecated
+  setRemoteDescription(description: RTCSessionDescription | RTCSessionDescriptionInit): Promise<void>;
   setRemoteDescription(description: RTCSessionDescription,
                         successCallback?: RTCVoidCallback,
                         failureCallback?: RTCPeerConnectionErrorCallback): void;
+  localDescription: RTCSessionDescription;
   remoteDescription: RTCSessionDescription;
   signalingState: string; // RTCSignalingState; see TODO(1)
   updateIce(configuration?: RTCConfiguration,
             constraints?: RTCMediaConstraints): void;
+  addIceCandidate(candidate: RTCIceCandidate): Promise<void>;
   addIceCandidate(candidate:RTCIceCandidate,
                   successCallback:() => void,
                   failureCallback:RTCPeerConnectionErrorCallback): void;
@@ -284,8 +300,10 @@ interface RTCPeerConnection {
   onicecandidate: (event: RTCIceCandidateEvent) => void;
   onidentityresult: (event: Event) => void;
   onsignalingstatechange: (event: Event) => void;
-  getStats: (successCallback: RTCStatsCallback,
-             failureCallback: RTCPeerConnectionErrorCallback) => void;
+  getStats(selector: MediaStreamTrack): Promise<RTCStatsReport>;
+  getStats(selector: MediaStreamTrack, // nullable
+           successCallback: RTCStatsCallback,
+           failureCallback: RTCPeerConnectionErrorCallback): void;
 }
 declare var RTCPeerConnection: {
   prototype: RTCPeerConnection;
@@ -294,7 +312,7 @@ declare var RTCPeerConnection: {
 };
 
 interface RTCIceCandidate {
-  candidate?: string;
+  candidate: string;
   sdpMid?: string;
   sdpMLineIndex?: number;
 }
@@ -304,7 +322,7 @@ declare var RTCIceCandidate: {
 };
 
 interface webkitRTCIceCandidate extends RTCIceCandidate {
-  candidate?: string;
+  candidate: string;
   sdpMid?: string;
   sdpMLineIndex?: number;
 }
@@ -314,7 +332,7 @@ declare var webkitRTCIceCandidate: {
 };
 
 interface mozRTCIceCandidate extends RTCIceCandidate {
-  candidate?: string;
+  candidate: string;
   sdpMid?: string;
   sdpMLineIndex?: number;
 }
@@ -325,8 +343,8 @@ declare var mozRTCIceCandidate: {
 
 interface RTCIceCandidateInit {
   candidate: string;
-  sdpMid: string;
-  sdpMLineIndex: number;
+  sdpMid?: string;
+  sdpMLineIndex?: number;
 }
 declare var RTCIceCandidateInit:{
   prototype: RTCIceCandidateInit;

From 4e4e65dd4c672b346e64e950bd5c6109e85fd165 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andr=C3=A9=20Luiz=20dos=20Santos?=
 <andre.netvision.com.br@gmail.com>
Date: Fri, 13 May 2016 09:50:29 -0300
Subject: [PATCH 068/278] Rename rx.node.d.ts to rx-node.d.ts

---
 rx-node/{rx.node.d.ts => rx-node.d.ts} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename rx-node/{rx.node.d.ts => rx-node.d.ts} (100%)

diff --git a/rx-node/rx.node.d.ts b/rx-node/rx-node.d.ts
similarity index 100%
rename from rx-node/rx.node.d.ts
rename to rx-node/rx-node.d.ts

From fb436e4df4f98e1a1244733c8bdfd82a482035ea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andr=C3=A9=20Luiz=20dos=20Santos?=
 <andre.netvision.com.br@gmail.com>
Date: Fri, 13 May 2016 10:05:18 -0300
Subject: [PATCH 069/278] Rename rx.node-tests.ts to rx-node-tests.ts

---
 rx-node/{rx.node-tests.ts => rx-node-tests.ts} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename rx-node/{rx.node-tests.ts => rx-node-tests.ts} (100%)

diff --git a/rx-node/rx.node-tests.ts b/rx-node/rx-node-tests.ts
similarity index 100%
rename from rx-node/rx.node-tests.ts
rename to rx-node/rx-node-tests.ts

From 2c5c3520d341526c54ca64ca3245d2569dce1d6e Mon Sep 17 00:00:00 2001
From: Ivaylo Bratoev <ivaylo.bratoev@gmail.com>
Date: Tue, 17 May 2016 15:06:55 +0300
Subject: [PATCH 070/278] Update fs-extra typings

'fs-extra' extends 'fs' as it is by definition.
Clean up definition and tests related to the extended node 'fs' module.
---
 fs-extra/fs-extra-tests.ts | 179 -------------------------------------
 fs-extra/fs-extra.d.ts     | 138 ++--------------------------
 2 files changed, 7 insertions(+), 310 deletions(-)

diff --git a/fs-extra/fs-extra-tests.ts b/fs-extra/fs-extra-tests.ts
index c1785f851d..a31df8cfd7 100644
--- a/fs-extra/fs-extra-tests.ts
+++ b/fs-extra/fs-extra-tests.ts
@@ -2,50 +2,16 @@
 /// <reference path="../node/node.d.ts" />
 
 import fs = require('fs-extra');
-import stream = require('stream');
 
-var stats: fs.Stats;
-var str: string;
-var strArr: string[];
-var bool: boolean;
-var num: number;
 var src: string;
 var dest: string;
 var file: string;
-var filename: string;
 var dir: string;
 var path: string;
 var data: any;
 var object: Object;
-var buffer: NodeBuffer;
-var modeNum: number;
-var modeStr: string;
-var encoding: string;
-var type: string;
-var flags: string;
-var srcpath: string;
-var dstpath: string;
-var oldPath: string;
-var newPath: string;
-var cache: string;
-var offset: number;
-var length: number;
-var position: number;
-var cacheBool: boolean;
-var cacheStr: string;
-var fd: number;
-var len: number;
-var uid: number;
-var gid: number;
-var atime: number;
-var mtime: number;
-var statsCallback: (err: Error, stats: fs.Stats) => void;
 var errorCallback: (err: Error) => void;
 var openOpts: fs.OpenOptions;
-var watcher: fs.FSWatcher;
-var readStreeam: stream.Readable;
-var writeStream: stream.Writable;
-var outputStream: stream.Writable;
 
 fs.copy(src, dest, errorCallback);
 fs.copy(src, dest, (src: string) => {
@@ -125,130 +91,6 @@ fs.writeJSON(file, object, openOpts, errorCallback);
 fs.writeJsonSync(file, object, openOpts);
 fs.writeJSONSync(file, object, openOpts);
 
-fs.rename(oldPath, newPath, errorCallback);
-fs.renameSync(oldPath, newPath);
-fs.truncate(fd, len, errorCallback);
-fs.truncateSync(fd, len);
-fs.chown(path, uid, gid, errorCallback);
-fs.chownSync(path, uid, gid);
-fs.fchown(fd, uid, gid, errorCallback);
-fs.fchownSync(fd, uid, gid);
-fs.lchown(path, uid, gid, errorCallback);
-fs.lchownSync(path, uid, gid);
-fs.chmod(path, modeNum, errorCallback);
-fs.chmod(path, modeStr, errorCallback);
-fs.chmodSync(path, modeNum);
-fs.chmodSync(path, modeStr);
-fs.fchmod(fd, modeNum, errorCallback);
-fs.fchmod(fd, modeStr, errorCallback);
-fs.fchmodSync(fd, modeNum);
-fs.fchmodSync(fd, modeStr);
-fs.lchmod(path, modeStr, errorCallback);
-fs.lchmod(path, modeNum, errorCallback);
-fs.lchmodSync(path, modeNum);
-fs.lchmodSync(path, modeStr);
-fs.stat(path, statsCallback);
-fs.lstat(path, statsCallback);
-fs.fstat(fd, statsCallback);
-stats = fs.statSync(path);
-stats = fs.lstatSync(path);
-stats = fs.fstatSync(fd);
-fs.link(srcpath, dstpath, errorCallback);
-fs.linkSync(srcpath, dstpath);
-fs.symlink(srcpath, dstpath, type, errorCallback);
-fs.symlinkSync(srcpath, dstpath, type);
-fs.readlink(path, (err: Error, linkString: string) => {
-
-});
-fs.realpath(path, (err: Error, resolvedPath: string) => {
-
-});
-fs.realpath(path, cache, (err: Error, resolvedPath: string) => {
-
-});
-str = fs.realpathSync(path, cacheBool);
-fs.unlink(path, errorCallback);
-fs.unlinkSync(path);
-fs.rmdir(path, errorCallback);
-fs.rmdirSync(path);
-fs.mkdir(path, modeNum, errorCallback);
-fs.mkdir(path, modeStr, errorCallback);
-fs.mkdirSync(path, modeNum);
-fs.mkdirSync(path, modeStr);
-fs.readdir(path, (err: Error, files: string[]) => {
-
-});
-strArr = fs.readdirSync(path);
-fs.close(fd, errorCallback);
-fs.closeSync(fd);
-fs.open(path, flags, modeStr, (err: Error, fd: number) => {
-
-});
-num = fs.openSync(path, flags, modeStr);
-fs.utimes(path, atime, mtime, errorCallback);
-fs.utimesSync(path, atime, mtime);
-fs.futimes(fd, atime, mtime, errorCallback);
-fs.futimesSync(fd, atime, mtime);
-fs.fsync(fd, errorCallback);
-fs.fsyncSync(fd);
-fs.write(fd, buffer, offset, length, position, (err: Error, written: number, buffer: NodeBuffer) => {
-
-});
-num = fs.writeSync(fd, buffer, offset, length, position);
-fs.read(fd, buffer, offset, length, position, (err: Error, bytesRead: number, buffer: NodeBuffer) => {
-
-});
-num = fs.readSync(fd, buffer, offset, length, position);
-fs.readFile(filename, (err: Error, data: NodeBuffer) => {
-
-});
-fs.readFile(filename, encoding, (err: Error, data: string) => {
-
-});
-fs.readFile(filename, openOpts, (err: Error, data: string) => {
-
-});
-fs.readFile(filename, (err: Error, data: NodeBuffer) => {
-
-});
-buffer = fs.readFileSync(filename);
-str = fs.readFileSync(filename, encoding);
-str = fs.readFileSync(filename, openOpts);
-
-fs.writeFile(filename, data, errorCallback);
-fs.writeFile(filename, data, encoding, errorCallback);
-fs.writeFile(filename, data, openOpts, errorCallback);
-fs.writeFileSync(filename, data);
-fs.writeFileSync(filename, data, encoding);
-fs.writeFileSync(filename, data, openOpts);
-
-fs.appendFile(filename, data, errorCallback);
-fs.appendFile(filename, data, encoding, errorCallback);
-fs.appendFile(filename, data, openOpts, errorCallback);
-fs.appendFileSync(filename, data);
-fs.appendFileSync(filename, data, encoding);
-fs.appendFileSync(filename, data, openOpts);
-
-fs.watchFile(filename, {
-	curr: stats,
-	prev: stats
-});
-fs.watchFile(filename, {
-	persistent: bool,
-	interval: num
-}, {
-	curr: stats,
-	prev: stats
-});
-fs.unwatchFile(filename);
-watcher = fs.watch(filename, { persistent: bool }, (event: string, filename: string) => {
-
-});
-fs.exists(path, (exists: boolean) => {
-
-});
-bool = fs.existsSync(path);
-
 fs.ensureDir(path, errorCallback);
 fs.ensureDirSync(path);
 fs.ensureFile(path, errorCallback);
@@ -259,24 +101,3 @@ fs.ensureSymlink(path, errorCallback);
 fs.ensureSymlinkSync(path);
 fs.emptyDir(path, errorCallback);
 fs.emptyDirSync(path);
-
-readStreeam = fs.createReadStream(path);
-readStreeam = fs.createReadStream(path, {
-	flags: str,
-	encoding: str,
-	fd: num,
-	mode: num,
-	bufferSize: num
-});
-writeStream = fs.createWriteStream(path);
-writeStream = fs.createWriteStream(path, {
-	flags: str,
-	encoding: str,
-	string: str
-});
-outputStream = fs.createOutputStream(path);
-outputStream = fs.createOutputStream(path, {
-	flags: str,
-	encoding: str,
-	string: str
-});
diff --git a/fs-extra/fs-extra.d.ts b/fs-extra/fs-extra.d.ts
index b133047dec..39656ce685 100644
--- a/fs-extra/fs-extra.d.ts
+++ b/fs-extra/fs-extra.d.ts
@@ -8,39 +8,8 @@
 ///<reference path="../node/node.d.ts"/>
 
 declare module "fs-extra" {
-	import stream = require("stream");
+    export * from "fs";
 
-	export interface Stats {
-		isFile(): boolean;
-		isDirectory(): boolean;
-		isBlockDevice(): boolean;
-		isCharacterDevice(): boolean;
-		isSymbolicLink(): boolean;
-		isFIFO(): boolean;
-		isSocket(): boolean;
-		dev: number;
-		ino: number;
-		mode: number;
-		nlink: number;
-		uid: number;
-		gid: number;
-		rdev: number;
-		size: number;
-		blksize: number;
-		blocks: number;
-		atime: Date;
-		mtime: Date;
-		ctime: Date;
-	}
-
-	export interface FSWatcher {
-		close(): void;
-	}
-
-	export class ReadStream extends stream.Readable { }
-	export class WriteStream extends stream.Writable { }
-
-	//extended methods
 	export function copy(src: string, dest: string, callback?: (err: Error) => void): void;
 	export function copy(src: string, dest: string, filter: CopyFilter, callback?: (err: Error) => void): void;
 	export function copy(src: string, dest: string, options: CopyOptions, callback?: (err: Error) => void): void;
@@ -77,8 +46,6 @@ declare module "fs-extra" {
 
 	export function remove(dir: string, callback?: (err: Error) => void): void;
 	export function removeSync(dir: string): void;
-	// export function delete(dir: string, callback?: (err: Error) => void): void;
-	// export function deleteSync(dir: string): void;
 
 	export function writeJson(file: string, object: any, callback?: (err: Error) => void): void;
 	export function writeJson(file: string, object: any, options?: OpenOptions, callback?: (err: Error) => void): void;
@@ -88,98 +55,22 @@ declare module "fs-extra" {
 	export function writeJsonSync(file: string, object: any, options?: OpenOptions): void;
 	export function writeJSONSync(file: string, object: any, options?: OpenOptions): void;
 
-	export function rename(oldPath: string, newPath: string, callback?: (err: Error) => void): void;
-	export function renameSync(oldPath: string, newPath: string): void;
-	export function truncate(fd: number, len: number, callback?: (err: Error) => void): void;
-	export function truncateSync(fd: number, len: number): void;
-	export function chown(path: string, uid: number, gid: number, callback?: (err: Error) => void): void;
-	export function chownSync(path: string, uid: number, gid: number): void;
-	export function fchown(fd: number, uid: number, gid: number, callback?: (err: Error) => void): void;
-	export function fchownSync(fd: number, uid: number, gid: number): void;
-	export function lchown(path: string, uid: number, gid: number, callback?: (err: Error) => void): void;
-	export function lchownSync(path: string, uid: number, gid: number): void;
-	export function chmod(path: string, mode: number, callback?: (err: Error) => void): void;
-	export function chmod(path: string, mode: string, callback?: (err: Error) => void): void;
-	export function chmodSync(path: string, mode: number): void;
-	export function chmodSync(path: string, mode: string): void;
-	export function fchmod(fd: number, mode: number, callback?: (err: Error) => void): void;
-	export function fchmod(fd: number, mode: string, callback?: (err: Error) => void): void;
-	export function fchmodSync(fd: number, mode: number): void;
-	export function fchmodSync(fd: number, mode: string): void;
-	export function lchmod(path: string, mode: string, callback?: (err: Error) => void): void;
-	export function lchmod(path: string, mode: number, callback?: (err: Error) => void): void;
-	export function lchmodSync(path: string, mode: number): void;
-	export function lchmodSync(path: string, mode: string): void;
-	export function stat(path: string, callback?: (err: Error, stats: Stats) => void): void;
-	export function lstat(path: string, callback?: (err: Error, stats: Stats) => void): void;
-	export function fstat(fd: number, callback?: (err: Error, stats: Stats) => void): void;
-	export function statSync(path: string): Stats;
-	export function lstatSync(path: string): Stats;
-	export function fstatSync(fd: number): Stats;
-	export function link(srcpath: string, dstpath: string, callback?: (err: Error) => void): void;
-	export function linkSync(srcpath: string, dstpath: string): void;
-	export function symlink(srcpath: string, dstpath: string, type?: string, callback?: (err: Error) => void): void;
-	export function symlinkSync(srcpath: string, dstpath: string, type?: string): void;
-	export function readlink(path: string, callback?: (err: Error, linkString: string) => void): void;
-	export function realpath(path: string, callback?: (err: Error, resolvedPath: string) => void): void;
-	export function realpath(path: string, cache: string, callback: (err: Error, resolvedPath: string) => void): void;
-	export function realpathSync(path: string, cache?: boolean): string;
-	export function unlink(path: string, callback?: (err: Error) => void): void;
-	export function unlinkSync(path: string): void;
-	export function rmdir(path: string, callback?: (err: Error) => void): void;
-	export function rmdirSync(path: string): void;
-	export function mkdir(path: string, mode?: number, callback?: (err: Error) => void): void;
-	export function mkdir(path: string, mode?: string, callback?: (err: Error) => void): void;
-	export function mkdirSync(path: string, mode?: number): void;
-	export function mkdirSync(path: string, mode?: string): void;
-	export function readdir(path: string, callback?: (err: Error, files: string[]) => void ): void;
-	export function readdirSync(path: string): string[];
-	export function close(fd: number, callback?: (err: Error) => void): void;
-	export function closeSync(fd: number): void;
-	export function open(path: string, flags: string, mode?: string, callback?: (err: Error, fs: number) => void): void;
-	export function openSync(path: string, flags: string, mode?: string): number;
-	export function utimes(path: string, atime: number, mtime: number, callback?: (err: Error) => void): void;
-	export function utimesSync(path: string, atime: number, mtime: number): void;
-	export function futimes(fd: number, atime: number, mtime: number, callback?: (err: Error) => void): void;
-	export function futimesSync(fd: number, atime: number, mtime: number): void;
-	export function fsync(fd: number, callback?: (err: Error) => void): void;
-	export function fsyncSync(fd: number): void;
-	export function write(fd: number, buffer: NodeBuffer, offset: number, length: number, position: number, callback?: (err: Error, written: number, buffer: NodeBuffer) => void): void;
-	export function writeSync(fd: number, buffer: NodeBuffer, offset: number, length: number, position: number): number;
-	export function read(fd: number, buffer: NodeBuffer, offset: number, length: number, position: number, callback?: (err: Error, bytesRead: number, buffer: NodeBuffer) => void ): void;
-	export function readSync(fd: number, buffer: NodeBuffer, offset: number, length: number, position: number): number;
-	export function readFile(filename: string, encoding: string, callback: (err: Error, data: string) => void ): void;
-	export function readFile(filename: string, options: OpenOptions, callback: (err: Error, data: string) => void ): void;
-	export function readFile(filename: string, callback: (err: Error, data: NodeBuffer) => void ): void;
-	export function readFileSync(filename: string): NodeBuffer;
-	export function readFileSync(filename: string, encoding: string): string;
-	export function readFileSync(filename: string, options: OpenOptions): string;
-	export function writeFile(filename: string, data: any, encoding?: string, callback?: (err: Error) => void): void;
-	export function writeFile(filename: string, data: any, options?: OpenOptions, callback?: (err: Error) => void): void;
-	export function writeFileSync(filename: string, data: any, encoding?: string): void;
-	export function writeFileSync(filename: string, data: any, option?: OpenOptions): void;
-	export function appendFile(filename: string, data: any, encoding?: string, callback?: (err: Error) => void): void;
-	export function appendFile(filename: string, data: any,option?: OpenOptions, callback?: (err: Error) => void): void;
-	export function appendFileSync(filename: string, data: any, encoding?: string): void;
-	export function appendFileSync(filename: string, data: any, option?: OpenOptions): void;
-	export function watchFile(filename: string, listener: { curr: Stats; prev: Stats; }): void;
-	export function watchFile(filename: string, options: { persistent?: boolean; interval?: number; }, listener: { curr: Stats; prev: Stats; }): void;
-	export function unwatchFile(filename: string, listener?: Stats): void;
-	export function watch(filename: string, options?: { persistent?: boolean; }, listener?: (event: string, filename: string) => any): FSWatcher;
-	export function exists(path: string, callback?: (exists: boolean) => void ): void;
-	export function existsSync(path: string): boolean;
     export function ensureDir(path: string, cb: (err: Error) => void): void;
     export function ensureDirSync(path: string): void;
+
 	export function ensureFile(path: string, cb: (err: Error) => void): void;
 	export function ensureFileSync(path: string): void;
+
 	export function ensureLink(path: string, cb: (err: Error) => void): void;
 	export function ensureLinkSync(path: string): void;
+
 	export function ensureSymlink(path: string, cb: (err: Error) => void): void;
 	export function ensureSymlinkSync(path: string): void;
+
     export function emptyDir(path: string, callback?: (err: Error) => void): void;
     export function emptyDirSync(path: string): boolean;
 
-	export interface CopyFilterFunction {
+    export interface CopyFilterFunction {
 		(src: string): boolean
 	}
 
@@ -188,6 +79,7 @@ declare module "fs-extra" {
 	export interface CopyOptions {
 		clobber?: boolean
 		preserveTimestamps?: boolean
+        dereference?: boolean
 		filter?: CopyFilter
 	}
 
@@ -200,20 +92,4 @@ declare module "fs-extra" {
 		fs?: any;
 		mode?: number;
 	}
-
-	export interface ReadStreamOptions {
-		flags?: string;
-		encoding?: string;
-		fd?: number;
-		mode?: number;
-		bufferSize?: number;
-	}
-	export interface WriteStreamOptions {
-		flags?: string;
-		encoding?: string;
-		string?: string;
-	}
-	export function createReadStream(path: string, options?: ReadStreamOptions): ReadStream;
-	export function createWriteStream(path: string, options?: WriteStreamOptions): WriteStream;
-	export function createOutputStream(path: string, options?: WriteStreamOptions): WriteStream;
 }

From 5fd4595b4474eb7dc7415a303083cb3086a50974 Mon Sep 17 00:00:00 2001
From: Sarsaw <Jack.Klassen@Gmx.net>
Date: Fri, 20 May 2016 10:52:14 +0200
Subject: [PATCH 071/278] precision is optional in toBeCloseTo

---
 jasmine/jasmine.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/jasmine/jasmine.d.ts b/jasmine/jasmine.d.ts
index 9841a74fc8..5fd8b49f56 100644
--- a/jasmine/jasmine.d.ts
+++ b/jasmine/jasmine.d.ts
@@ -301,7 +301,7 @@ declare namespace jasmine {
         toContain(expected: any, expectationFailOutput?: any): boolean;
         toBeLessThan(expected: number, expectationFailOutput?: any): boolean;
         toBeGreaterThan(expected: number, expectationFailOutput?: any): boolean;
-        toBeCloseTo(expected: number, precision: any, expectationFailOutput?: any): boolean;
+        toBeCloseTo(expected: number, precision?: any, expectationFailOutput?: any): boolean;
         toThrow(expected?: any): boolean;
         toThrowError(message?: string | RegExp): boolean;
         toThrowError(expected?: new (...args: any[]) => Error, message?: string | RegExp): boolean;

From b8fc7bf0a62f4d610f712b35280d875544defb59 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andr=C3=A9=20Luiz=20dos=20Santos?=
 <andre.netvision.com.br@gmail.com>
Date: Fri, 20 May 2016 15:12:55 -0300
Subject: [PATCH 072/278] Fix reference

---
 rx-node/rx-node-tests.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/rx-node/rx-node-tests.ts b/rx-node/rx-node-tests.ts
index b5450e9945..bd66ac10d5 100644
--- a/rx-node/rx-node-tests.ts
+++ b/rx-node/rx-node-tests.ts
@@ -4,7 +4,7 @@
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 /// <reference path="../node/node.d.ts" />
-/// <reference path="rx.node.d.ts" />
+/// <reference path="rx-node.d.ts" />
 
 {
 	var source = Rx.Observable.return(42);

From 7db63a2dd878c47db2cbb17cc257d8f60ceb38cc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Juan=20Luis=20Boya=20Garc=C3=ADa?= <ntrrgc@gmail.com>
Date: Mon, 23 May 2016 03:10:11 +0200
Subject: [PATCH 073/278] Rx: resultSelector should be optional

---
 rx/rx-lite.d.ts | 278 ++++++++++++++++++++++++------------------------
 1 file changed, 139 insertions(+), 139 deletions(-)

diff --git a/rx/rx-lite.d.ts b/rx/rx-lite.d.ts
index 3a4ee18450..5bae390cc9 100644
--- a/rx/rx-lite.d.ts
+++ b/rx/rx-lite.d.ts
@@ -225,48 +225,48 @@ declare namespace Rx {
 		catchException(handler: (exception: any) => IPromise<T>): Observable<T>;	// alias for catch
 		catch(second: Observable<T>): Observable<T>;
 		catchException(second: Observable<T>): Observable<T>;	// alias for catch
-		combineLatest<T2, TResult>(second: Observable<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		combineLatest<T2, TResult>(second: IPromise<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, TResult>(second: Observable<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, TResult>(second: Observable<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, TResult>(second: IPromise<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, TResult>(second: IPromise<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T2, T3, T4, T5, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
-		combineLatest<TOther, TResult>(souces: Observable<TOther>[], resultSelector: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
-		combineLatest<TOther, TResult>(souces: IPromise<TOther>[], resultSelector: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
-		withLatestFrom<T2, TResult>(second: Observable<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		withLatestFrom<T2, TResult>(second: IPromise<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, TResult>(second: Observable<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, TResult>(second: Observable<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, TResult>(second: IPromise<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, TResult>(second: IPromise<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T2, T3, T4, T5, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
-		withLatestFrom<TOther, TResult>(souces: Observable<TOther>[], resultSelector: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
-		withLatestFrom<TOther, TResult>(souces: IPromise<TOther>[], resultSelector: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
+		combineLatest<T2, TResult>(second: Observable<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		combineLatest<T2, TResult>(second: IPromise<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, TResult>(second: Observable<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, TResult>(second: Observable<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, TResult>(second: IPromise<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, TResult>(second: IPromise<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T2, T3, T4, T5, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
+		combineLatest<TOther, TResult>(souces: Observable<TOther>[], resultSelector?: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
+		combineLatest<TOther, TResult>(souces: IPromise<TOther>[], resultSelector?: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
+		withLatestFrom<T2, TResult>(second: Observable<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		withLatestFrom<T2, TResult>(second: IPromise<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, TResult>(second: Observable<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, TResult>(second: Observable<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, TResult>(second: IPromise<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, TResult>(second: IPromise<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T2, T3, T4, T5, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
+		withLatestFrom<TOther, TResult>(souces: Observable<TOther>[], resultSelector?: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
+		withLatestFrom<TOther, TResult>(souces: IPromise<TOther>[], resultSelector?: (firstValue: T, ...otherValues: TOther[]) => TResult): Observable<TResult>;
 		concat(...sources: Observable<T>[]): Observable<T>;
 		concat(...sources: IPromise<T>[]): Observable<T>;
 		concat(sources: Observable<T>[]): Observable<T>;
 		concat(sources: IPromise<T>[]): Observable<T>;
 		concatAll(): T;
 		concatObservable(): T;	// alias for concatAll
-		concatMap<T2, R>(selector: (value: T, index: number) => Observable<T2>, resultSelector: (value1: T, value2: T2, index: number) => R): Observable<R>;	// alias for selectConcat
-		concatMap<T2, R>(selector: (value: T, index: number) => IPromise<T2>, resultSelector: (value1: T, value2: T2, index: number) => R): Observable<R>;	// alias for selectConcat
+		concatMap<T2, R>(selector: (value: T, index: number) => Observable<T2>, resultSelector?: (value1: T, value2: T2, index: number) => R): Observable<R>;	// alias for selectConcat
+		concatMap<T2, R>(selector: (value: T, index: number) => IPromise<T2>, resultSelector?: (value1: T, value2: T2, index: number) => R): Observable<R>;	// alias for selectConcat
 		concatMap<R>(selector: (value: T, index: number) => Observable<R>): Observable<R>;	// alias for selectConcat
 		concatMap<R>(selector: (value: T, index: number) => IPromise<R>): Observable<R>;	// alias for selectConcat
 		concatMap<R>(selector: (value: T, index: number) => R[]): Observable<R>;	// alias for selectConcat
@@ -283,23 +283,23 @@ declare namespace Rx {
 		switchLatest(): T;	// alias for switch
 		takeUntil<T2>(other: Observable<T2>): Observable<T>;
 		takeUntil<T2>(other: IPromise<T2>): Observable<T>;
-		zip<T2, TResult>(second: Observable<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		zip<T2, TResult>(second: IPromise<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		zip<T2, T3, TResult>(second: Observable<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		zip<T2, T3, TResult>(second: Observable<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		zip<T2, T3, TResult>(second: IPromise<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		zip<T2, T3, TResult>(second: IPromise<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		zip<T2, T3, T4, T5, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
-		zip<TOther, TResult>(second: Observable<TOther>[], resultSelector: (left: T, ...right: TOther[]) => TResult): Observable<TResult>;
-		zip<TOther, TResult>(second: IPromise<TOther>[], resultSelector: (left: T, ...right: TOther[]) => TResult): Observable<TResult>;
+		zip<T2, TResult>(second: Observable<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		zip<T2, TResult>(second: IPromise<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		zip<T2, T3, TResult>(second: Observable<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		zip<T2, T3, TResult>(second: Observable<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		zip<T2, T3, TResult>(second: IPromise<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		zip<T2, T3, TResult>(second: IPromise<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, TResult>(second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		zip<T2, T3, T4, T5, TResult>(second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
+		zip<TOther, TResult>(second: Observable<TOther>[], resultSelector?: (left: T, ...right: TOther[]) => TResult): Observable<TResult>;
+		zip<TOther, TResult>(second: IPromise<TOther>[], resultSelector?: (left: T, ...right: TOther[]) => TResult): Observable<TResult>;
 
 		asObservable(): Observable<T>;
 		dematerialize<TOrigin>(): Observable<TOrigin>;
@@ -348,15 +348,15 @@ declare namespace Rx {
 		select<TResult>(selector: (value: T, index: number, source: Observable<T>) => TResult, thisArg?: any): Observable<TResult>;
 		map<TResult>(selector: (value: T, index: number, source: Observable<T>) => TResult, thisArg?: any): Observable<TResult>;	// alias for select
 		pluck<TResult>(prop: string): Observable<TResult>;
-		selectMany<TOther, TResult>(selector: (value: T) => Observable<TOther>, resultSelector: (item: T, other: TOther) => TResult): Observable<TResult>;
-		selectMany<TOther, TResult>(selector: (value: T) => IPromise<TOther>, resultSelector: (item: T, other: TOther) => TResult): Observable<TResult>;
+		selectMany<TOther, TResult>(selector: (value: T) => Observable<TOther>, resultSelector?: (item: T, other: TOther) => TResult): Observable<TResult>;
+		selectMany<TOther, TResult>(selector: (value: T) => IPromise<TOther>, resultSelector?: (item: T, other: TOther) => TResult): Observable<TResult>;
 		selectMany<TResult>(selector: (value: T) => Observable<TResult>): Observable<TResult>;
 		selectMany<TResult>(selector: (value: T) => IPromise<TResult>): Observable<TResult>;
 		selectMany<TResult>(other: Observable<TResult>): Observable<TResult>;
 		selectMany<TResult>(other: IPromise<TResult>): Observable<TResult>;
 		selectMany<TResult>(selector: (value: T) => TResult[]): Observable<TResult>;	// alias for selectMany
-		flatMap<TOther, TResult>(selector: (value: T) => Observable<TOther>, resultSelector: (item: T, other: TOther) => TResult): Observable<TResult>;	// alias for selectMany
-		flatMap<TOther, TResult>(selector: (value: T) => IPromise<TOther>, resultSelector: (item: T, other: TOther) => TResult): Observable<TResult>;	// alias for selectMany
+		flatMap<TOther, TResult>(selector: (value: T) => Observable<TOther>, resultSelector?: (item: T, other: TOther) => TResult): Observable<TResult>;	// alias for selectMany
+		flatMap<TOther, TResult>(selector: (value: T) => IPromise<TOther>, resultSelector?: (item: T, other: TOther) => TResult): Observable<TResult>;	// alias for selectMany
 		flatMap<TResult>(selector: (value: T) => Observable<TResult>): Observable<TResult>;	// alias for selectMany
 		flatMap<TResult>(selector: (value: T) => IPromise<TResult>): Observable<TResult>;	// alias for selectMany
 		flatMap<TResult>(other: Observable<TResult>): Observable<TResult>;	// alias for selectMany
@@ -383,8 +383,8 @@ declare namespace Rx {
 		 */
 		flatMapObserver<T2, T3, T4>(onNext: (value: T, index: number) => Observable<T2>, onError: (exception: any) => Observable<T3>, onCompleted: () => Observable<T4>, thisArg?: any): Observable<T2 | T3 | T4>;
 
-		selectConcat<T2, R>(selector: (value: T, index: number) => Observable<T2>, resultSelector: (value1: T, value2: T2, index: number) => R): Observable<R>;
-		selectConcat<T2, R>(selector: (value: T, index: number) => IPromise<T2>, resultSelector: (value1: T, value2: T2, index: number) => R): Observable<R>;
+		selectConcat<T2, R>(selector: (value: T, index: number) => Observable<T2>, resultSelector?: (value1: T, value2: T2, index: number) => R): Observable<R>;
+		selectConcat<T2, R>(selector: (value: T, index: number) => IPromise<T2>, resultSelector?: (value1: T, value2: T2, index: number) => R): Observable<R>;
 		selectConcat<R>(selector: (value: T, index: number) => Observable<R>): Observable<R>;
 		selectConcat<R>(selector: (value: T, index: number) => IPromise<R>): Observable<R>;
 		selectConcat<R>(sequence: Observable<R>): Observable<R>;
@@ -524,7 +524,7 @@ declare namespace Rx {
 		fromArray<T>(array: T[], scheduler?: IScheduler): Observable<T>;
 		fromArray<T>(array: { length: number;[index: number]: T; }, scheduler?: IScheduler): Observable<T>;
 
-		generate<TState, TResult>(initialState: TState, condition: (state: TState) => boolean, iterate: (state: TState) => TState, resultSelector: (state: TState) => TResult, scheduler?: IScheduler): Observable<TResult>;
+		generate<TState, TResult>(initialState: TState, condition: (state: TState) => boolean, iterate: (state: TState) => TState, resultSelector?: (state: TState) => TResult, scheduler?: IScheduler): Observable<TResult>;
 		never<T>(): Observable<T>;
 
 		/**
@@ -575,73 +575,73 @@ declare namespace Rx {
 		catchError<T>(...sources: IPromise<T>[]): Observable<T>;	// alias for catch
 
 		combineLatest<T, T2>(first: Observable<T>, second: Observable<T2>): Observable<[T, T2]>;
-		combineLatest<T, T2, TResult>(first: Observable<T>, second: Observable<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		combineLatest<T, T2, TResult>(first: IPromise<T>, second: Observable<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		combineLatest<T, T2, TResult>(first: Observable<T>, second: IPromise<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		combineLatest<T, T2, TResult>(first: IPromise<T>, second: IPromise<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		combineLatest<T, T2, TResult>(first: Observable<T>, second: Observable<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		combineLatest<T, T2, TResult>(first: IPromise<T>, second: Observable<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		combineLatest<T, T2, TResult>(first: Observable<T>, second: IPromise<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		combineLatest<T, T2, TResult>(first: IPromise<T>, second: IPromise<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
 		combineLatest<T, T2, T3>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>): Observable<[T, T2, T3]>;
-		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
 		combineLatest<T, T2, T3, T4>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>): Observable<[T, T2, T3, T4]>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
 		combineLatest<T, T2, T3, T4, T5>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>): Observable<[T, T2, T3, T4, T5]>;
-		combineLatest<T, T2, T3, T4, T5, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
+		combineLatest<T, T2, T3, T4, T5, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
 		combineLatest<T>(sources: Observable<T>[]): Observable<T[]>;
-		combineLatest<TOther, TResult>(sources: Observable<TOther>[], resultSelector: (...otherValues: TOther[]) => TResult): Observable<TResult>;
-		combineLatest<TOther, TResult>(sources: IPromise<TOther>[], resultSelector: (...otherValues: TOther[]) => TResult): Observable<TResult>;
+		combineLatest<TOther, TResult>(sources: Observable<TOther>[], resultSelector?: (...otherValues: TOther[]) => TResult): Observable<TResult>;
+		combineLatest<TOther, TResult>(sources: IPromise<TOther>[], resultSelector?: (...otherValues: TOther[]) => TResult): Observable<TResult>;
 
-		withLatestFrom<T, T2, TResult>(first: Observable<T>, second: Observable<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, TResult>(first: IPromise<T>, second: Observable<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, TResult>(first: Observable<T>, second: IPromise<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, TResult>(first: IPromise<T>, second: IPromise<T2>, resultSelector: (v1: T, v2: T2) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
-		withLatestFrom<T, T2, T3, T4, T5, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
-		withLatestFrom<TOther, TResult>(souces: Observable<TOther>[], resultSelector: (...otherValues: TOther[]) => TResult): Observable<TResult>;
-		withLatestFrom<TOther, TResult>(souces: IPromise<TOther>[], resultSelector: (...otherValues: TOther[]) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, TResult>(first: Observable<T>, second: Observable<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, TResult>(first: IPromise<T>, second: Observable<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, TResult>(first: Observable<T>, second: IPromise<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, TResult>(first: IPromise<T>, second: IPromise<T2>, resultSelector?: (v1: T, v2: T2) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, resultSelector?: (v1: T, v2: T2, v3: T3) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: Observable<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: Observable<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: Observable<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: Observable<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, TResult>(first: IPromise<T>, second: IPromise<T2>, third: IPromise<T3>, fourth: IPromise<T4>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4) => TResult): Observable<TResult>;
+		withLatestFrom<T, T2, T3, T4, T5, TResult>(first: Observable<T>, second: Observable<T2>, third: Observable<T3>, fourth: Observable<T4>, fifth: Observable<T5>, resultSelector?: (v1: T, v2: T2, v3: T3, v4: T4, v5: T5) => TResult): Observable<TResult>;
+		withLatestFrom<TOther, TResult>(souces: Observable<TOther>[], resultSelector?: (...otherValues: TOther[]) => TResult): Observable<TResult>;
+		withLatestFrom<TOther, TResult>(souces: IPromise<TOther>[], resultSelector?: (...otherValues: TOther[]) => TResult): Observable<TResult>;
 
 		concat<T>(...sources: Observable<T>[]): Observable<T>;
 		concat<T>(...sources: IPromise<T>[]): Observable<T>;
@@ -658,23 +658,23 @@ declare namespace Rx {
 
 		pairs<T>(obj: { [key: string]: T }, scheduler?: IScheduler): Observable<[string, T]>;
 
-		zip<T1, T2, TResult>(first: Observable<T1>, sources: Observable<T2>[], resultSelector: (item1: T1, ...right: T2[]) => TResult): Observable<TResult>;
-		zip<T1, T2, TResult>(first: Observable<T1>, sources: IPromise<T2>[], resultSelector: (item1: T1, ...right: T2[]) => TResult): Observable<TResult>;
-		zip<T1, T2, TResult>(source1: Observable<T1>, source2: Observable<T2>, resultSelector: (item1: T1, item2: T2) => TResult): Observable<TResult>;
-		zip<T1, T2, TResult>(source1: Observable<T1>, source2: IPromise<T2>, resultSelector: (item1: T1, item2: T2) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, resultSelector: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: IPromise<T3>, resultSelector: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: Observable<T3>, resultSelector: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: IPromise<T3>, resultSelector: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, source4: Observable<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, source4: IPromise<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: IPromise<T3>, source4: Observable<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: IPromise<T3>, source4: IPromise<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: Observable<T3>, source4: Observable<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: Observable<T3>, source4: IPromise<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: IPromise<T3>, source4: Observable<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: IPromise<T3>, source4: IPromise<T4>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
-		zip<T1, T2, T3, T4, T5, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, source4: Observable<T4>, source5: Observable<T5>, resultSelector: (item1: T1, item2: T2, item3: T3, item4: T4, item5: T5) => TResult): Observable<TResult>;
+		zip<T1, T2, TResult>(first: Observable<T1>, sources: Observable<T2>[], resultSelector?: (item1: T1, ...right: T2[]) => TResult): Observable<TResult>;
+		zip<T1, T2, TResult>(first: Observable<T1>, sources: IPromise<T2>[], resultSelector?: (item1: T1, ...right: T2[]) => TResult): Observable<TResult>;
+		zip<T1, T2, TResult>(source1: Observable<T1>, source2: Observable<T2>, resultSelector?: (item1: T1, item2: T2) => TResult): Observable<TResult>;
+		zip<T1, T2, TResult>(source1: Observable<T1>, source2: IPromise<T2>, resultSelector?: (item1: T1, item2: T2) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, resultSelector?: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: IPromise<T3>, resultSelector?: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: Observable<T3>, resultSelector?: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: IPromise<T3>, resultSelector?: (item1: T1, item2: T2, item3: T3) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, source4: Observable<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, source4: IPromise<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: IPromise<T3>, source4: Observable<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: IPromise<T3>, source4: IPromise<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: Observable<T3>, source4: Observable<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: Observable<T3>, source4: IPromise<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: IPromise<T3>, source4: Observable<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, TResult>(source1: Observable<T1>, source2: IPromise<T2>, source3: IPromise<T3>, source4: IPromise<T4>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4) => TResult): Observable<TResult>;
+		zip<T1, T2, T3, T4, T5, TResult>(source1: Observable<T1>, source2: Observable<T2>, source3: Observable<T3>, source4: Observable<T4>, source5: Observable<T5>, resultSelector?: (item1: T1, item2: T2, item3: T3, item4: T4, item5: T5) => TResult): Observable<TResult>;
 		zipArray<T>(...sources: Observable<T>[]): Observable<T[]>;
 		zipArray<T>(sources: Observable<T>[]): Observable<T[]>;
 

From de3103a10709308a3cc02924a839701b72edb509 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thomas=20L=C3=A9t=C3=A9?= <bistory@gmail.com>
Date: Tue, 24 May 2016 10:42:05 +0200
Subject: [PATCH 074/278] Update fbsdk.d.ts

Added missing "data" in FBResponseObject to avoid throwing errors in TS.
---
 fbsdk/fbsdk.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/fbsdk/fbsdk.d.ts b/fbsdk/fbsdk.d.ts
index 6153de6579..79c710f8f7 100644
--- a/fbsdk/fbsdk.d.ts
+++ b/fbsdk/fbsdk.d.ts
@@ -150,6 +150,7 @@ interface FBSDKCanvas{
 }
 
 interface FBResponseObject {
+    data: any;
     error: any;
 }
 

From 38a708db95f8b49282a8292e6fc8f186a72c4f82 Mon Sep 17 00:00:00 2001
From: Atanas Atanasov <nascovt@gmail.com>
Date: Wed, 25 May 2016 09:59:27 +0300
Subject: [PATCH 075/278] `gijgo definitions for version 0.6.2

---
 gijgo/gijgo-tests.ts |  23 +++++++
 gijgo/gijgo.d.ts     | 161 +++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 184 insertions(+)
 create mode 100644 gijgo/gijgo-tests.ts
 create mode 100644 gijgo/gijgo.d.ts

diff --git a/gijgo/gijgo-tests.ts b/gijgo/gijgo-tests.ts
new file mode 100644
index 0000000000..85b7f00b38
--- /dev/null
+++ b/gijgo/gijgo-tests.ts
@@ -0,0 +1,23 @@
+/// <reference path="../jquery/jquery.d.ts" />
+/// <reference path="gijgo.d.ts" />
+
+// Grid
+$(() => {
+        this.grid = $('#grid').grid({
+            primaryKey: 'ID',
+            columns: [
+                { field: 'ID', width: 50, sortable: true },
+                { field: 'Name', sortable: true },
+            ],
+            pager: { limit: 5, sizes: [2, 5, 10, 20] }
+        });
+});
+
+// Dialog
+$(() => {
+        this.dialog = $('#playerModal').dialog({
+            autoOpen: false,
+            title: 'Player',
+            width: 400
+        });
+});
\ No newline at end of file
diff --git a/gijgo/gijgo.d.ts b/gijgo/gijgo.d.ts
new file mode 100644
index 0000000000..ccfee96047
--- /dev/null
+++ b/gijgo/gijgo.d.ts
@@ -0,0 +1,161 @@
+//Grid
+
+interface GridPager {
+    limit: number;
+    sizes: Array<number>;
+    leftControls?: any;
+    rightControls?: any;
+}
+
+interface GridColumn {
+    align?: string;
+    cssClass?: string;
+    decimalDigits?: number;
+    editor?: any;
+    events?: any;
+    field?: string;
+    format?: string;
+    headerCssClass?: string;
+    hidden?: boolean;
+    icon?: string;
+    minWidth?: number;
+    priority?: number;
+    sortable?: boolean;
+    stopPropagation?: boolean;
+    title?: string;
+    tmpl?: string;
+    tooltip?: string;
+    type?: string;
+    width?: number;
+}
+
+interface GridDefaultParams {
+    direction?: string;
+    limit?: string;
+    page?: string;
+    sortBy?: string;
+}
+
+interface GridMapping {
+    dataField?: string;
+    totalRecordsField?: string;
+}
+
+interface GridSettings<Entity> {
+    //Configuration options
+    autoGenerateColumns?: boolean;
+    autoLoad?: boolean;
+    columns?: Array<GridColumn>;
+    dataSource?: any;
+    defaultColumnSettings?: GridColumn;
+    defaultParams?: GridDefaultParams;
+    detailTemplate?: string;
+    fontSize?: string;
+    mapping?: string;
+    minWidth?: number;
+    notFoundText?: string;
+    pager?: GridPager;
+    primaryKey?: string;
+    resizableColumns?: boolean;
+    resizeCheckInterval?: number;
+    responsive?: boolean;
+    selectionMethod?: string;
+    selectionType?: string;
+    showHiddenColumnsAsDetails?: boolean;
+    title?: string;
+    toolbarTemplate?: string;
+    uiLibrary?: string;
+    width?: number;
+    params?: any;
+
+    //Events
+    beforeEmptyRowInsert?: (e: any, $row: JQuery) => any;
+    cellDataBound?: (e: any, $wrapper: JQuery, id: string, column: GridColumn, record: Entity) => any;
+    cellDataChanged?: (e: any, $cell: JQuery, column: GridColumn, record: Entity, oldValue: any, newValue: any) => any;
+    columnHide?: (e: any, column: GridColumn) => any;
+    columnShow?: (e: any, column: GridColumn) => any;
+    dataBinding?: (e: any, records: Array<Entity>) => any;
+    dataBound?: (e: any, records: Array<Entity>, totalRecords: number) => any;
+    destroying?: (e: any) => any;
+    detailCollapse?: (e: any, detailWrapper: JQuery, record: Entity) => any;
+    detailExpand?: (e: any, detailWrapper: JQuery, record: Entity) => any;
+    initialized?: (e: any) => any;
+    pageChanging?: (e: any, newPage: number) => any;
+    pageSizeChange?: (e: any, newPage: number) => any;
+    resize?: (e: any, newWidth: number, oldWidth: number) => any;
+    rowDataBound?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+    rowRemoving?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+    rowSelect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+    rowUnselect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+}
+
+interface Grid<Entity, Params> extends JQuery {
+    addRow(record: Entity): Grid<Entity, Params>;
+    clear(showNotFoundText?: boolean): Grid<Entity, Params>;
+    count(): number;
+    destroy(keepTableTag?: boolean, keepWrapperTag?: boolean): void; 
+    //get(position: number): Entity; //TODO: rename to getByPosition to avoid conflicts with jquery.get
+    getAll(): Array<Entity>;
+    getById(id: string): Entity;
+    getChanges(): Array<Entity>;
+    getSelected(): string;
+    getSelections(): Array<string>;
+    hideColumn(field: string): Grid<Entity, Params>;
+    makeResponsive(): void;
+    reload(params?: Params): Grid<Entity, Params>;
+    removeRow(id: string): Grid<Entity, Params>;
+    render(response: any): Grid<Entity, Params>;
+    selectAll(): Grid<Entity, Params>;
+    setSelected(id: string|number): Grid<Entity, Params>;
+    showColumn(field: string): Grid<Entity, Params>;
+    title(text: any): any;
+    unSelectAll(): Grid<Entity, Params>;
+    updateRow(id: string, record: Entity): Grid<Entity, Params>;
+}
+
+interface JQuery {
+    grid(settings: GridSettings<any>): Grid<any, any>;
+    grid<Entity>(settings: GridSettings<Entity>): Grid<Entity, any>;
+    grid<Entity, Params>(settings: GridSettings<Entity>): Grid<Entity, Params>;
+}
+
+//Dialog
+interface DialogSettings {
+    //Configuration options
+    autoOpen?: boolean;
+    closeOnEscape?: boolean;
+    draggable?: boolean;
+    height?: number|string;
+    maxHeight?: number;
+    maxWidth?: number;
+    minHeight?: number;
+    minWidth?: number;
+    modal?: boolean;
+    resizable?: boolean;
+    title?: string;
+    uiLibrary?: string;
+    width?: number;
+    
+    //Events
+    closed?: (e: any) => any;
+    closing?: (e: any) => any;
+    drag?: (e: any) => any;
+    dragStart?: (e: any) => any;
+    dragStop?: (e: any) => any;
+    initialized?: (e: any) => any;
+    opened?: (e: any) => any;
+    opening?: (e: any) => any;
+    resize?: (e: any) => any;
+    resizeStart?: (e: any) => any;
+    resizeStop?: (e: any) => any;
+}
+
+interface Dialog extends JQuery {
+    close(): Dialog;
+    isOpen(): boolean;
+    open(): Dialog;
+}
+
+interface JQuery {
+    dialog(settings: DialogSettings): Dialog;
+}
\ No newline at end of file

From 9b3ca60d7f2e16e57f434532d7d55650a6103ff6 Mon Sep 17 00:00:00 2001
From: Atanas Atanasov <nascovt@gmail.com>
Date: Wed, 25 May 2016 10:00:36 +0300
Subject: [PATCH 076/278] Delete grid.d.ts

---
 gijgo/grid.d.ts | 123 ------------------------------------------------
 1 file changed, 123 deletions(-)
 delete mode 100644 gijgo/grid.d.ts

diff --git a/gijgo/grid.d.ts b/gijgo/grid.d.ts
deleted file mode 100644
index 5864f2efd6..0000000000
--- a/gijgo/grid.d.ts
+++ /dev/null
@@ -1,123 +0,0 @@
-// Type definitions for Gijgo v0.6.2
-// Project: http://gijgo.com
-// Definitions by: Atanas Atanasov <https://github.com/atatanasov>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
-
-interface GridPager {
-    limit: number;
-    sizes: Array<number>;
-    leftControls?: any;
-    rightControls?: any;
-}
-
-interface GridColumn {
-    align?: string;
-    cssClass?: string;
-    decimalDigits?: number;
-    editor?: any;
-    events?: any;
-    field?: string;
-    format?: string;
-    headerCssClass?: string;
-    hidden?: boolean;
-    icon?: string;
-    minWidth?: number;
-    priority?: number;
-    sortable?: boolean;
-    stopPropagation?: boolean;
-    title?: any;
-    tmpl?: string;
-    tooltip?: string;
-    type?: string;
-    width?: number;
-}
-
-interface GridDefaultParams {
-    direction?: string;
-    limit?: string;
-    page?: string;
-    sortBy?: string;
-}
-
-interface GridMapping {
-    dataField?: string;
-    totalRecordsField?: string;
-}
-
-interface GridSettings<Entity> {
-    //Configuration options
-    autoGenerateColumns?: boolean;
-    autoLoad?: boolean;
-    columns?: Array<GridColumn>;
-    dataSource?: any;
-    defaultColumnSettings?: GridColumn;
-    defaultParams?: GridDefaultParams;
-    detailTemplate?: string;
-    fontSize?: string;
-    mapping?: string;
-    minWidth?: number;
-    notFoundText?: string;
-    pager?: GridPager;
-    primaryKey?: string;
-    resizableColumns?: boolean;
-    resizeCheckInterval?: number;
-    responsive?: boolean;
-    selectionMethod?: string;
-    selectionType?: string;
-    showHiddenColumnsAsDetails?: boolean;
-    title?: string;
-    toolbarTemplate?: string;
-    uiLibrary?: string;
-    width?: number;
-    params?: any;
-
-    //Events
-    beforeEmptyRowInsert(e: any, $row: JQuery);
-    cellDataBound(e: any, $wrapper: JQuery, id: string, column: GridColumn, record: Entity);
-    cellDataChanged(e: any, $cell: JQuery, column: GridColumn, record: Entity, oldValue: any, newValue: any);
-    columnHide(e: any, column: GridColumn);
-    columnShow(e: any, column: GridColumn);
-    dataBinding(e: any, records: Array<Entity>);
-    dataBound(e: any, records: Array<Entity>, totalRecords: number);
-    destroying(e: any);
-    detailCollapse(e: any, detailWrapper: JQuery, record: Entity);
-    detailExpand(e: any, detailWrapper: JQuery, record: Entity);
-    initialized(e: any);
-    pageChanging(e: any, newPage: number);
-    pageSizeChange(e: any, newPage: number);
-    resize(e: any, newWidth: number, oldWidth: number);
-    rowDataBound(e: any, $row: JQuery, id: string, record: Entity);
-    rowRemoving(e: any, $row: JQuery, id: string, record: Entity);
-    rowSelect(e: any, $row: JQuery, id: string, record: Entity);
-    rowUnselect(e: any, $row: JQuery, id: string, record: Entity);
-}
-
-interface Grid<Entity, Params> extends JQuery {
-    addRow(record: Entity): Grid<Entity, Params>;
-    clear(showNotFoundText?: boolean): Grid<Entity, Params>;
-    count(): number;
-    destroy(keepTableTag?: boolean, keepWrapperTag?: boolean): void; 
-    //get(position: number): Entity; //TODO: rename to getByPosition to avoid conflicts with jquery.get
-    getAll(): Array<Entity>;
-    getById(id: string): Entity;
-    getChanges(): Array<Entity>;
-    getSelected(): string;
-    getSelections(): Array<string>;
-    hideColumn(field: string): Grid<Entity, Params>;
-    makeResponsive(): void;
-    reload(params?: Params): Grid<Entity, Params>;
-    removeRow(id: string): Grid<Entity, Params>;
-    render(response: any): Grid<Entity, Params>;
-    selectAll(): Grid<Entity, Params>;   
-    setSelected(id: string): Grid<Entity, Params>;
-    showColumn(field: string): Grid<Entity, Params>;
-    title(text: any): any;
-    unSelectAll(): Grid<Entity, Params>;
-    updateRow(id: string, record: Entity): Grid<Entity, Params>;
-}
-
-interface JQuery {
-    grid(settings: GridSettings<any>): Grid<any, any>;
-    grid<Entity>(settings: GridSettings<Entity>): Grid<Entity, any>;
-    grid<Entity, Params>(settings: GridSettings<Entity>): Grid<Entity, Params>;
-}

From 2309b41ca1914120c0fcf5ccdb2be77eb6988c1f Mon Sep 17 00:00:00 2001
From: Atanas Atanasov <nascovt@gmail.com>
Date: Wed, 25 May 2016 10:01:12 +0300
Subject: [PATCH 077/278] added comments

---
 gijgo/gijgo.d.ts | 9 +++++++--
 1 file changed, 7 insertions(+), 2 deletions(-)

diff --git a/gijgo/gijgo.d.ts b/gijgo/gijgo.d.ts
index ccfee96047..faa2609fbc 100644
--- a/gijgo/gijgo.d.ts
+++ b/gijgo/gijgo.d.ts
@@ -1,4 +1,9 @@
-//Grid
+// Type definitions for Gijgo v0.6.2
+// Project: http://gijgo.com
+// Definitions by: Atanas Atanasov <https://github.com/atatanasov>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+//Grid
 
 interface GridPager {
     limit: number;
@@ -158,4 +163,4 @@ interface Dialog extends JQuery {
 
 interface JQuery {
     dialog(settings: DialogSettings): Dialog;
-}
\ No newline at end of file
+}

From da735a2b7ff9153d94c55e0ff238c722503f4e5d Mon Sep 17 00:00:00 2001
From: David <st0724@gmail.com>
Date: Thu, 26 May 2016 22:28:34 -0400
Subject: [PATCH 078/278] Added 2 missing methods

namely, createTableIfNotExistsknex and bigIncrements. Not sure why they were omitted.
---
 knex/knex.d.ts | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index 6fadd1b450..1084b9936b 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -301,6 +301,7 @@ declare module "knex" {
 
     interface SchemaBuilder extends Promise<any> {
       createTable(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
+      createTableIfNotExistsknex(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
       renameTable(oldTableName: string, newTableName: string): Promise<void>;
       dropTable(tableName: string): SchemaBuilder;
       hasTable(tableName: string): Promise<boolean>;
@@ -312,6 +313,7 @@ declare module "knex" {
 
     interface TableBuilder {
       increments(columnName?: string): ColumnBuilder;
+      bigIncrements(columnName?: string): ColumnBuilder;
       dropColumn(columnName: string): TableBuilder;
       dropColumns(...columnNames: string[]): TableBuilder;
       renameColumn(from: string, to: string): ColumnBuilder;

From e0ab7738a110ecbad3c0a68430b2323b6185b33c Mon Sep 17 00:00:00 2001
From: David <st0724@gmail.com>
Date: Thu, 26 May 2016 23:08:37 -0400
Subject: [PATCH 079/278] minor typo

---
 knex/knex.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index 1084b9936b..bf9b46f75e 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -301,7 +301,7 @@ declare module "knex" {
 
     interface SchemaBuilder extends Promise<any> {
       createTable(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
-      createTableIfNotExistsknex(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
+      createTableIfNotExists(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
       renameTable(oldTableName: string, newTableName: string): Promise<void>;
       dropTable(tableName: string): SchemaBuilder;
       hasTable(tableName: string): Promise<boolean>;

From cf3f762c9a9119f8f461843595bc4da929bba42e Mon Sep 17 00:00:00 2001
From: Diluka <pmars42@gmail.com>
Date: Fri, 27 May 2016 15:20:12 +0800
Subject: [PATCH 080/278] add another name which is usually use in project

---
 avoscloud-sdk/avoscloud-sdk.d.ts | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/avoscloud-sdk/avoscloud-sdk.d.ts b/avoscloud-sdk/avoscloud-sdk.d.ts
index c3bd03e570..af904a6c8c 100644
--- a/avoscloud-sdk/avoscloud-sdk.d.ts
+++ b/avoscloud-sdk/avoscloud-sdk.d.ts
@@ -797,3 +797,8 @@ declare module "avoscloud-sdk" {
 
   export = AV;
 }
+
+declare module 'leanengine' {
+    import alias = require('avoscloud-sdk');
+    export = alias;
+}

From 10468a3425a45097a929309133c587b72da15a98 Mon Sep 17 00:00:00 2001
From: Nathan Brown <nathan@nkbrown.us>
Date: Sat, 28 May 2016 08:42:25 -0700
Subject: [PATCH 081/278] Update README.md to point to Typings instead of tsd

Based on the note on the `tsd` page and the issue DefinitelyTyped/tsd#269, it would make sense to point people to Typings instead.
---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 5c218aaa19..8d3b7bfc40 100644
--- a/README.md
+++ b/README.md
@@ -24,7 +24,7 @@ Please see the [contribution guide](http://definitelytyped.org/guides/contributi
 
 * Directly from the GitHub repos
 * [NuGet packages](http://nuget.org/packages?q=DefinitelyTyped)
-* [TypeScript Definition manager](https://github.com/DefinitelyTyped/tsd)
+* [Typings - TypeScript Definition Manager](https://github.com/typings/typings)
 
 ## List of definitions
 

From 54a8a56af19d2200de348257c59adc4ceb323a30 Mon Sep 17 00:00:00 2001
From: Torsten Werner <torsten.werner@westernacher.com>
Date: Mon, 30 May 2016 23:00:07 +0200
Subject: [PATCH 082/278] add node-fetch based on whatwg-fetch (#8931)

---
 node-fetch/node-fetch-tests.ts | 60 ++++++++++++++++++++++
 node-fetch/node-fetch.d.ts     | 91 ++++++++++++++++++++++++++++++++++
 2 files changed, 151 insertions(+)
 create mode 100644 node-fetch/node-fetch-tests.ts
 create mode 100644 node-fetch/node-fetch.d.ts

diff --git a/node-fetch/node-fetch-tests.ts b/node-fetch/node-fetch-tests.ts
new file mode 100644
index 0000000000..3188d319bc
--- /dev/null
+++ b/node-fetch/node-fetch-tests.ts
@@ -0,0 +1,60 @@
+/// <reference path="node-fetch.d.ts" />
+
+import fetch = require('node-fetch');
+
+function test_fetchUrlWithOptions() {
+	var headers = new Headers();
+	headers.append("Content-Type", "application/json");
+	var requestOptions: RequestInit = {
+		method: "POST",
+		headers: headers,
+		mode: 'same-origin',
+		credentials: 'omit',
+		cache: 'default',
+		redirect: 'manual'
+	};
+	handlePromise(fetch("http://www.andlabs.net/html5/uCOR.php", requestOptions));
+}
+
+function test_fetchUrlWithHeadersObject() {
+	var requestOptions: RequestInit = {
+		method: "POST",
+		headers: {
+			'Content-Type': 'application/json'
+		}
+	};
+	handlePromise(fetch("http://www.andlabs.net/html5/uCOR.php", requestOptions));
+}
+
+function test_fetchUrl() {
+	handlePromise(fetch("http://www.andlabs.net/html5/uCOR.php"));
+}
+
+function test_fetchUrlWithRequestObject() {
+	var requestOptions: RequestInit = {
+		method: "POST",
+		headers: {
+			'Content-Type': 'application/json'
+		}
+	};
+	var request: Request = new Request("http://www.andlabs.net/html5/uCOR.php", requestOptions);
+	handlePromise(fetch(request));
+}
+
+function test_globalFetchVar() {
+	fetch('http://test.com', {})
+		.then(response => {
+			// for test only
+		});
+}
+
+function handlePromise(promise: Promise<Response>) {
+	promise.then((response) => {
+		if (response.type === 'basic') {
+			// for test only
+		}
+		return response.text();
+	}).then((text) => {
+		console.log(text);
+	});
+}
diff --git a/node-fetch/node-fetch.d.ts b/node-fetch/node-fetch.d.ts
new file mode 100644
index 0000000000..eeaf049fcf
--- /dev/null
+++ b/node-fetch/node-fetch.d.ts
@@ -0,0 +1,91 @@
+// Type definitions for fetch API
+// Project: https://github.com/github/fetch
+// Definitions by: Ryan Graham <https://github.com/ryan-codingintrigue>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare class Request extends Body {
+	constructor(input: string|Request, init?:RequestInit);
+	method: string;
+	url: string;
+	headers: Headers;
+	context: RequestContext;
+	referrer: string;
+	mode: RequestMode;
+	redirect: RequestRedirect;
+	credentials: RequestCredentials;
+	cache: RequestCache;
+}
+
+interface RequestInit {
+	method?: string;
+	headers?: HeaderInit|{ [index: string]: string };
+	body?: BodyInit;
+	mode?: RequestMode;
+	redirect?: RequestRedirect;
+	credentials?: RequestCredentials;
+	cache?: RequestCache;
+}
+
+type RequestContext =
+	"audio" | "beacon" | "cspreport" | "download" | "embed" |
+	"eventsource" | "favicon" | "fetch" | "font" | "form" | "frame" |
+	"hyperlink" | "iframe" | "image" | "imageset" | "import" |
+	"internal" | "location" | "manifest" | "object" | "ping" | "plugin" |
+	"prefetch" | "script" | "serviceworker" | "sharedworker" |
+	"subresource" | "style" | "track" | "video" | "worker" |
+	"xmlhttprequest" | "xslt";
+type RequestMode = "same-origin" | "no-cors" | "cors";
+type RequestRedirect = "follow" | "error" | "manual";
+type RequestCredentials = "omit" | "same-origin" | "include";
+type RequestCache =
+	"default" | "no-store" | "reload" | "no-cache" |
+	"force-cache" | "only-if-cached";
+
+declare class Headers {
+	append(name: string, value: string): void;
+	delete(name: string):void;
+	get(name: string): string;
+	getAll(name: string): Array<string>;
+	has(name: string): boolean;
+	set(name: string, value: string): void;
+	forEach(callback: (value: string, name: string) => void): void;
+}
+
+declare class Body {
+	bodyUsed: boolean;
+	arrayBuffer(): Promise<ArrayBuffer>;
+	blob(): Promise<Blob>;
+	formData(): Promise<FormData>;
+	json(): Promise<any>;
+	json<T>(): Promise<T>;
+	text(): Promise<string>;
+}
+declare class Response extends Body {
+	constructor(body?: BodyInit, init?: ResponseInit);
+	static error(): Response;
+	static redirect(url: string, status: number): Response;
+	type: ResponseType;
+	url: string;
+	status: number;
+	ok: boolean;
+	statusText: string;
+	headers: Headers;
+	clone(): Response;
+}
+
+type ResponseType = "basic" | "cors" | "default" | "error" | "opaque" | "opaqueredirect";
+
+interface ResponseInit {
+	status: number;
+	statusText?: string;
+	headers?: HeaderInit;
+}
+
+declare type HeaderInit = Headers|Array<string>;
+declare type BodyInit = ArrayBuffer|ArrayBufferView|Blob|FormData|string;
+declare type RequestInfo = Request|string;
+
+declare module 'node-fetch' {
+    function fetch(url: string | Request, init?: RequestInit): Promise<Response>;
+    export = fetch;
+}

From a0599f53fc22c36817ebc5161081e6c316b1ba63 Mon Sep 17 00:00:00 2001
From: Torsten Werner <torsten.werner@westernacher.com>
Date: Tue, 31 May 2016 07:33:51 +0200
Subject: [PATCH 083/278] add myself to comment in node-fetch.d.ts

---
 node-fetch/node-fetch.d.ts | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/node-fetch/node-fetch.d.ts b/node-fetch/node-fetch.d.ts
index eeaf049fcf..e91ac99904 100644
--- a/node-fetch/node-fetch.d.ts
+++ b/node-fetch/node-fetch.d.ts
@@ -1,6 +1,7 @@
 // Type definitions for fetch API
 // Project: https://github.com/github/fetch
-// Definitions by: Ryan Graham <https://github.com/ryan-codingintrigue>
+// Definitions by: Torsten Werner <https://github.com/torstenwerner> based on whatwg-fetch
+// that was created by: Ryan Graham <https://github.com/ryan-codingintrigue>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare class Request extends Body {

From 8af4eb0036e33dc5f895b4f1f330feb2369fa318 Mon Sep 17 00:00:00 2001
From: Torsten Werner <torsten.werner@westernacher.com>
Date: Tue, 31 May 2016 08:17:45 +0200
Subject: [PATCH 084/278] node-fetch.d.ts: fix comment

---
 node-fetch/node-fetch.d.ts | 7 +++----
 1 file changed, 3 insertions(+), 4 deletions(-)

diff --git a/node-fetch/node-fetch.d.ts b/node-fetch/node-fetch.d.ts
index e91ac99904..4e61f6bcd2 100644
--- a/node-fetch/node-fetch.d.ts
+++ b/node-fetch/node-fetch.d.ts
@@ -1,7 +1,6 @@
-// Type definitions for fetch API
-// Project: https://github.com/github/fetch
-// Definitions by: Torsten Werner <https://github.com/torstenwerner> based on whatwg-fetch
-// that was created by: Ryan Graham <https://github.com/ryan-codingintrigue>
+// Type definitions for node-fetch based on whatwg-fetch
+// Project: https://github.com/bitinn/node-fetch
+// Definitions by: Torsten Werner <https://github.com/torstenwerner>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare class Request extends Body {

From 25c96a1f24a2bbe8bae7470a0f1bd16c5d676cf2 Mon Sep 17 00:00:00 2001
From: Ben Dixon <github@bdixon.me.uk>
Date: Tue, 31 May 2016 11:29:15 +0100
Subject: [PATCH 085/278] Fixes #4467 - Separate out Stripe.js and stripe-node
 definitions

---
 {stripe => stripe-node}/stripe-node-tests.ts | 0
 {stripe => stripe-node}/stripe-node.d.ts     | 0
 2 files changed, 0 insertions(+), 0 deletions(-)
 rename {stripe => stripe-node}/stripe-node-tests.ts (100%)
 rename {stripe => stripe-node}/stripe-node.d.ts (100%)

diff --git a/stripe/stripe-node-tests.ts b/stripe-node/stripe-node-tests.ts
similarity index 100%
rename from stripe/stripe-node-tests.ts
rename to stripe-node/stripe-node-tests.ts
diff --git a/stripe/stripe-node.d.ts b/stripe-node/stripe-node.d.ts
similarity index 100%
rename from stripe/stripe-node.d.ts
rename to stripe-node/stripe-node.d.ts

From fc61cd3b887486c91e1be65f3bca5fda284a9c57 Mon Sep 17 00:00:00 2001
From: Radu Woinaroski <radu.woinaroski@gmail.com>
Date: Tue, 31 May 2016 21:07:42 +0200
Subject: [PATCH 086/278] mCustomScrollbar, fixed CustomScrollbarOptions for
 mouseWheel

---
 mCustomScrollbar/mCustomScrollbar.d.ts | 43 ++++++++++++++++++++++++--
 1 file changed, 41 insertions(+), 2 deletions(-)

diff --git a/mCustomScrollbar/mCustomScrollbar.d.ts b/mCustomScrollbar/mCustomScrollbar.d.ts
index 4aad109c66..08e532d7bf 100644
--- a/mCustomScrollbar/mCustomScrollbar.d.ts
+++ b/mCustomScrollbar/mCustomScrollbar.d.ts
@@ -36,9 +36,48 @@ declare namespace MCustomScrollbar {
         */
         scrollInertia?: number;
         /**
-        * Mouse wheel support, value: true, false
+        * Mouse wheel support
         */
-        mouseWheel?: boolean;
+        mouseWheel?: {
+            /**
+             * Enable or disable content scrolling via mouse-wheel.
+             */
+            enable?: boolean;
+            /**
+             * Set the mouse-wheel scrolling amount (in pixels).
+             * The default value "auto" adjusts scrolling amount according to scrollable content length.
+             */
+            scrollAmount?: number;
+            /**
+             * Define the mouse-wheel scrolling axis when both vertical and horizontal scrollbars are present.
+             * Set axis: "y" (default) for vertical or axis: "x" for horizontal scrolling.
+             */
+            axis?: "x"|"y";
+            /**
+             * Prevent the default behaviour which automatically scrolls the parent element when end
+             * or beginning of scrolling is reached (same bahavior with browser’s native scrollbar).
+             */
+            preventDefault?: boolean;
+            /**
+             * Set the number of pixels one wheel notch scrolls. The default value “auto” uses the OS/browser value.
+             */
+            deltaFactor?: number;
+            /**
+             * Enable or disable mouse-wheel (delta) acceleration.
+             * Setting normalizeDelta: true translates mouse-wheel delta value to -1 or 1.
+             */
+            normalizeDelta?:boolean;
+            /**
+             * Invert mouse-wheel scrolling direction.
+             * Set to true to scroll down or right when mouse-wheel is turned upwards.
+             */
+            invert?: boolean;
+            /**
+             * Set the tags that disable mouse-wheel when cursor is over them.
+             * Default value: ["select","option","keygen","datalist","textarea"]
+             */
+            disableOver?: string[]
+        }
         /**
         * Mouse wheel scrolling pixels amount, value in pixels (integer) or "auto" (script calculates and sets pixels amount according to content length)
         */

From 752e1faa8d6af023743aa4de3970fae19eb56c58 Mon Sep 17 00:00:00 2001
From: Ryan McNamara <rmcnamara@palantir.com>
Date: Tue, 31 May 2016 16:08:16 -0700
Subject: [PATCH 087/278] Add dagre-d3 type for transition

---
 dagre-d3/dagre-d3-tests.ts | 3 +++
 dagre-d3/dagre-d3.d.ts     | 2 ++
 2 files changed, 5 insertions(+)

diff --git a/dagre-d3/dagre-d3-tests.ts b/dagre-d3/dagre-d3-tests.ts
index ef5fddffac..6451913a89 100644
--- a/dagre-d3/dagre-d3-tests.ts
+++ b/dagre-d3/dagre-d3-tests.ts
@@ -11,6 +11,9 @@ namespace DagreD3Tests {
 
     predecessors["a"] = graph.predecessors("a");
     successors["a"] = graph.successors("a");
+    graph.transition = (selection: d3.Selection<any>) => {
+        return d3.transition();
+    };
 
     const render = new dagreD3.render();
     const svg = d3.select("svg");
diff --git a/dagre-d3/dagre-d3.d.ts b/dagre-d3/dagre-d3.d.ts
index 68e24c2fa5..a0ab31e041 100644
--- a/dagre-d3/dagre-d3.d.ts
+++ b/dagre-d3/dagre-d3.d.ts
@@ -20,6 +20,8 @@ declare namespace Dagre {
         height: number;
         predecessors(id: string): string[];
         successors(id: string): string[];
+        // see source of http://cpettitt.github.io/project/dagre-d3/latest/demo/interactive-demo.html
+        transition?(selection: d3.Selection<any>): d3.Transition<any>;
         width: number;
     }
 

From 7273c57f5b35de28b77649d9160f557906a95c68 Mon Sep 17 00:00:00 2001
From: Ryan McNamara <rmcnamara@palantir.com>
Date: Tue, 31 May 2016 15:37:29 -0700
Subject: [PATCH 088/278] Added properties to chai config block.

See http://chaijs.com/guide/styles/ for more information
---
 chai/chai.d.ts | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/chai/chai.d.ts b/chai/chai.d.ts
index 0ebc855022..8eb0995947 100644
--- a/chai/chai.d.ts
+++ b/chai/chai.d.ts
@@ -378,7 +378,20 @@ declare namespace Chai {
     }
 
     export interface Config {
+        /**
+         * Default: false
+         */
         includeStack: boolean;
+
+        /**
+         * Default: true
+         */
+        showDiff: boolean;
+
+        /**
+         * Default: 40
+         */
+        truncateThreshold: number;
     }
 
     export class AssertionError {

From fceb0e37c0c0c9d0985e28b53566720767a94c45 Mon Sep 17 00:00:00 2001
From: Rogier Schouten <r.schouten@spiritit.com>
Date: Thu, 2 Jun 2016 12:00:24 +0200
Subject: [PATCH 089/278] getComponent/getComponents now takes state parameter
 instead of location

see
https://github.com/reactjs/react-router/commit/0cdee03a54aeb79f7c7e35628e3ba58bde54e2bd
---
 react-router/react-router.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/react-router/react-router.d.ts b/react-router/react-router.d.ts
index 80d2e4ee6d..322ad3ef9b 100644
--- a/react-router/react-router.d.ts
+++ b/react-router/react-router.d.ts
@@ -144,8 +144,8 @@ declare namespace ReactRouter {
         path?: RoutePattern
         component?: RouteComponent
         components?: RouteComponents
-        getComponent?: (location: H.Location, cb: (error: any, component?: RouteComponent) => void) => void
-        getComponents?: (location: H.Location, cb: (error: any, components?: RouteComponents) => void) => void
+        getComponent?: (nextState: RouterState, cb: (error: any, component?: RouteComponent) => void) => void
+        getComponents?: (nextState: RouterState, cb: (error: any, components?: RouteComponents) => void) => void
         onEnter?: EnterHook
         onLeave?: LeaveHook
         onChange?: ChangeHook

From be2905b8ea021284308255e681210a6fff97c949 Mon Sep 17 00:00:00 2001
From: Mike Winfield <mike@acs-solutions.co.uk>
Date: Thu, 2 Jun 2016 11:21:40 +0100
Subject: [PATCH 090/278] Fix base props of react-bootstrap components (refs
 are useful!)

---
 react-bootstrap/react-bootstrap.d.ts | 126 +++++++++++++--------------
 1 file changed, 63 insertions(+), 63 deletions(-)

diff --git a/react-bootstrap/react-bootstrap.d.ts b/react-bootstrap/react-bootstrap.d.ts
index 366eeef7b5..fc9fd60a2c 100644
--- a/react-bootstrap/react-bootstrap.d.ts
+++ b/react-bootstrap/react-bootstrap.d.ts
@@ -12,7 +12,7 @@ declare module "react-bootstrap" {
 
     // <Button />
     // ----------------------------------------
-    interface ButtonProps extends React.HTMLAttributes {
+    interface ButtonProps extends React.HTMLProps<Button> {
 
         // Optional
         active?: boolean;
@@ -28,7 +28,7 @@ declare module "react-bootstrap" {
 
     // <ButtonToolbar />
     // ----------------------------------------
-    interface ButtonToolbarProps extends React.HTMLAttributes {
+    interface ButtonToolbarProps extends React.HTMLProps<ButtonToolbar> {
 
         // Optional
         block?: boolean;
@@ -42,7 +42,7 @@ declare module "react-bootstrap" {
 
     // <ButtonGroup />
     // ----------------------------------------
-    interface ButtonGroupProps extends React.HTMLAttributes {
+    interface ButtonGroupProps extends React.HTMLProps<ButtonGroup> {
         // Optional
         block?: boolean;
         bsSize?: string;
@@ -55,7 +55,7 @@ declare module "react-bootstrap" {
 
     // <DropdownButton />
     // ----------------------------------------
-    interface DropdownButtonProps extends React.HTMLAttributes {
+    interface DropdownButtonProps extends React.HTMLProps<DropdownButton> {
         bsStyle?: string;
         bsSize?: string;
         buttonClassName?: string;
@@ -69,7 +69,7 @@ declare module "react-bootstrap" {
 
     // <SplitButton />
     // ----------------------------------------
-    interface SplitButtonProps extends React.HTMLAttributes {
+    interface SplitButtonProps extends React.HTMLProps<SplitButton> {
         bsStyle?: string;
         bsSize?: string;
         dropdownTitle?: any; // TODO: Add more specific type
@@ -81,7 +81,7 @@ declare module "react-bootstrap" {
 
     // <MenuItem />
     // ----------------------------------------
-    interface MenuItemProps extends React.HTMLAttributes {
+    interface MenuItemProps extends React.HTMLProps<MenuItem> {
         active?: boolean;
         divider?: boolean;
         eventKey?: any;
@@ -92,7 +92,7 @@ declare module "react-bootstrap" {
 
     // <Panel />
     // ----------------------------------------
-    interface PanelProps extends React.HTMLAttributes {
+    interface PanelProps extends React.HTMLProps<Panel> {
         bsSize?: string;
         bsStyle?: string;
         collapsible?: boolean;
@@ -107,7 +107,7 @@ declare module "react-bootstrap" {
 
     // <Accordion />
     // ----------------------------------------
-    interface AccordionProps extends React.HTMLAttributes {
+    interface AccordionProps extends React.HTMLProps<Accordion> {
         bsSize?: string;
         bsStyle?: string;
         collapsible?: boolean;
@@ -122,7 +122,7 @@ declare module "react-bootstrap" {
 
     // <PanelGroup />
     // ----------------------------------------
-    interface PanelGroupProps extends React.HTMLAttributes {
+    interface PanelGroupProps extends React.HTMLProps<PanelGroup> {
         accordion?: boolean;
         activeKey?: any;
         bsSize?: string;
@@ -134,7 +134,7 @@ declare module "react-bootstrap" {
 
     // <Modal.Dialog />
     // ----------------------------------------
-    interface ModalDialogProps extends React.HTMLAttributes {
+    interface ModalDialogProps extends React.HTMLProps<ModalDialog> {
         // TODO: Add more specific type
     }
     type ModalDialog = React.ClassicComponent<ModalDialogProps, {}>;
@@ -142,7 +142,7 @@ declare module "react-bootstrap" {
 
     // <Modal.Header />
     // ----------------------------------------
-  interface ModalHeaderProps extends React.HTMLAttributes {
+  interface ModalHeaderProps extends React.HTMLProps<ModalHeader> {
         closeButton?: boolean;
         modalClassName?: string;
         onHide?: Function;
@@ -153,7 +153,7 @@ declare module "react-bootstrap" {
 
     // <Modal.Title/>
     // ----------------------------------------
-    interface ModalTitleProps extends React.HTMLAttributes {
+    interface ModalTitleProps extends React.HTMLProps<ModalTitle> {
         modalClassName?: string;
     }
     class ModalTitle extends React.Component<ModalTitleProps, {}> {
@@ -161,7 +161,7 @@ declare module "react-bootstrap" {
 
     // <Modal.Body />
     // ----------------------------------------
-    interface ModalBodyProps extends React.HTMLAttributes {
+    interface ModalBodyProps extends React.HTMLProps<ModalBody> {
         modalClassName?: string;
     }
     class ModalBody extends React.Component<ModalBodyProps, {}> {
@@ -169,7 +169,7 @@ declare module "react-bootstrap" {
 
     // <Modal.Footer />
     // ----------------------------------------
-    interface ModalFooterProps extends React.HTMLAttributes {
+    interface ModalFooterProps extends React.HTMLProps<ModalFooter> {
         modalClassName?: string;
     }
     class ModalFooter extends React.Component<ModalFooterProps, {}> {
@@ -177,7 +177,7 @@ declare module "react-bootstrap" {
 
     // <Modal />
     // ----------------------------------------
-    interface ModalProps extends React.HTMLAttributes {
+    interface ModalProps extends React.HTMLProps<Modal> {
         // Required
         onHide: Function;
 
@@ -238,7 +238,7 @@ declare module "react-bootstrap" {
 
     // <Tooltip />
     // ----------------------------------------
-    interface TooltipProps extends React.HTMLAttributes {
+    interface TooltipProps extends React.HTMLProps<Tooltip> {
         // Optional
         arrowOffsetLeft?: number | string;
         arrowOffsetTop?: number | string;
@@ -253,7 +253,7 @@ declare module "react-bootstrap" {
 
     // <Popover/>
     // ----------------------------------------
-    interface PopoverProps  extends React.HTMLAttributes {
+    interface PopoverProps  extends React.HTMLProps<Popover> {
         // Optional
         arrowOffsetLeft?: number | string;
         arrowOffsetTop?: number | string;
@@ -290,7 +290,7 @@ declare module "react-bootstrap" {
 
     // <ProgressBar />
     // ----------------------------------------
-    interface ProgressBarProps extends React.HTMLAttributes {
+    interface ProgressBarProps extends React.HTMLProps<ProgressBar> {
         // Optional
         active?: boolean;
         bsSize?: string;
@@ -308,7 +308,7 @@ declare module "react-bootstrap" {
     // <Nav />
     // ----------------------------------------
     // TODO: This one turned into a union of two different types
-    interface NavProps extends React.HTMLAttributes {
+    interface NavProps extends React.HTMLProps<Nav> {
         // Optional
         activeHref?: string;
         activeKey?: any;
@@ -330,7 +330,7 @@ declare module "react-bootstrap" {
 
     // <NavItem />
     // ----------------------------------------
-    interface NavItemProps extends React.HTMLAttributes {
+    interface NavItemProps extends React.HTMLProps<NavItem> {
         active?: boolean;
         brand?: any; // TODO: Add more specific type
         bsSize?: string;
@@ -354,7 +354,7 @@ declare module "react-bootstrap" {
 
     // <Navbar.Brand />
     // ----------------------------------------
-    interface NavbarBrandProps extends React.HTMLAttributes {
+    interface NavbarBrandProps extends React.HTMLProps<NavbarBrand> {
     }
     class NavbarBrand extends React.Component<NavbarBrandProps, {}> {
     }
@@ -368,7 +368,7 @@ declare module "react-bootstrap" {
 
     // <Navbar.Header />
     // ----------------------------------------
-    interface NavbarHeaderProps extends React.HTMLAttributes {
+    interface NavbarHeaderProps extends React.HTMLProps<NavbarHeader> {
     }
     type NavbarHeader = React.ClassicComponent<NavbarHeaderProps, {}>;
     var NavbarHeader: React.ClassicComponentClass<NavbarHeaderProps>;
@@ -382,7 +382,7 @@ declare module "react-bootstrap" {
 
     // <Navbar />
     // ----------------------------------------
-    interface NavbarProps extends React.HTMLAttributes {
+    interface NavbarProps extends React.HTMLProps<Navbar> {
         brand?: any; // TODO: Add more specific type
         bsSize?: string;
         bsStyle?: string;
@@ -409,7 +409,7 @@ declare module "react-bootstrap" {
 
     // <NavDropdown />
     // ----------------------------------------
-    interface NavDropdownProps extends React.HTMLAttributes {
+    interface NavDropdownProps extends React.HTMLProps<NavDropdown> {
         eventKey?: any;
     }
     class NavDropdown extends React.Component<NavDropdownProps, {}> {
@@ -417,7 +417,7 @@ declare module "react-bootstrap" {
 
     // <Tabs />
     // ----------------------------------------
-    interface TabsProps extends React.HTMLAttributes {
+    interface TabsProps extends React.HTMLProps<Tabs> {
         activeKey?: any;
         animation?: boolean;
         bsStyle?: string;
@@ -431,7 +431,7 @@ declare module "react-bootstrap" {
 
     // <Tab />
     // ----------------------------------------
-    interface TabProps extends React.HTMLAttributes {
+    interface TabProps extends React.HTMLProps<Tab> {
         animation?: boolean;
         eventKey?: any; // TODO: Add more specific type
     }
@@ -440,14 +440,14 @@ declare module "react-bootstrap" {
 
     // <Pager />
     // ----------------------------------------
-    interface PagerProps extends React.HTMLAttributes {
+    interface PagerProps extends React.HTMLProps<Pager> {
     }
     type Pager = React.ClassicComponent<PagerProps, {}>;
     var Pager: React.ClassicComponentClass<PagerProps>;
 
     // <PageItem />
     // ----------------------------------------
-    interface PageItemProps extends React.HTMLAttributes {
+    interface PageItemProps extends React.HTMLProps<PageItem> {
         eventKey?: any;
         next?: boolean;
         previous?: boolean;
@@ -457,7 +457,7 @@ declare module "react-bootstrap" {
 
     // <Pagination />
     // ----------------------------------------
-    interface PaginationProps extends React.HTMLAttributes {
+    interface PaginationProps extends React.HTMLProps<Pagination> {
         activePage?: number;
         bsSize?: string;
         bsStyle?: string;
@@ -475,7 +475,7 @@ declare module "react-bootstrap" {
 
     // <Alert />
     // ----------------------------------------
-    interface AlertProps extends React.HTMLAttributes {
+    interface AlertProps extends React.HTMLProps<Alert> {
         bsSize?: string;
         bsStyle?: string;
         closeLabel?: string;
@@ -487,7 +487,7 @@ declare module "react-bootstrap" {
 
     // <Carousel />
     // ----------------------------------------
-    interface CarouselProps extends React.HTMLAttributes {
+    interface CarouselProps extends React.HTMLProps<Carousel> {
         activeIndex?: number;
         bsSize?: string;
         bsStyle?: string;
@@ -507,7 +507,7 @@ declare module "react-bootstrap" {
 
     // <CarouselItem />
     // ----------------------------------------
-    interface CarouselItemProps extends React.HTMLAttributes {
+    interface CarouselItemProps extends React.HTMLProps<CarouselItem> {
         active?: boolean;
         animtateIn?: boolean;
         animateOut?: boolean;
@@ -521,7 +521,7 @@ declare module "react-bootstrap" {
 
     // <Grid />
     // ----------------------------------------
-    interface GridProps extends React.HTMLAttributes {
+    interface GridProps extends React.HTMLProps<Grid> {
         componentClass?: React.ReactType;
         fluid?: boolean;
     }
@@ -530,15 +530,15 @@ declare module "react-bootstrap" {
 
     // <Row />
     // ----------------------------------------
-    interface RowProps extends React.HTMLAttributes {
-        componentClass?: React.ReactType; 
+    interface RowProps extends React.HTMLProps<Row> {
+        componentClass?: React.ReactType;
     }
     type Row = React.ClassicComponent<RowProps, {}>;
     var Row: React.ClassicComponentClass<RowProps>;
 
     // <Col />
     // ----------------------------------------
-    interface ColProps extends React.HTMLAttributes {
+    interface ColProps extends React.HTMLProps<Col> {
         componentClass?: React.ReactType;
         lg?: number;
         lgHidden?: boolean;
@@ -566,7 +566,7 @@ declare module "react-bootstrap" {
 
     // <Thumbnail />
     // ----------------------------------------
-    interface ThumbnailProps extends React.HTMLAttributes {
+    interface ThumbnailProps extends React.HTMLProps<Thumbnail> {
         bsSize?: string;
         bsStyle?: string;
     }
@@ -575,7 +575,7 @@ declare module "react-bootstrap" {
 
     // <ListGroup />
     // ----------------------------------------
-    interface ListGroupProps extends React.HTMLAttributes {
+    interface ListGroupProps extends React.HTMLProps<ListGroup> {
         fill?: boolean; // TODO: Add more specific type
     }
     class ListGroup extends React.Component<ListGroupProps, {}> {
@@ -583,7 +583,7 @@ declare module "react-bootstrap" {
 
     // <ListGroupItem />
     // ----------------------------------------
-    interface ListGroupItemProps extends React.HTMLAttributes {
+    interface ListGroupItemProps extends React.HTMLProps<ListGroupItem> {
         active?: any;
         bsSize?: string;
         bsStyle?: string;
@@ -597,7 +597,7 @@ declare module "react-bootstrap" {
 
     // <Label />
     // ----------------------------------------
-    interface LabelProps extends React.HTMLAttributes {
+    interface LabelProps extends React.HTMLProps<Label> {
         bsSize?: string;
         bsStyle?: string;
     }
@@ -606,7 +606,7 @@ declare module "react-bootstrap" {
 
     // <Badge />
     // ----------------------------------------
-    interface BadgeProps extends React.HTMLAttributes {
+    interface BadgeProps extends React.HTMLProps<Badge> {
         pullRight?: boolean;
     }
     type Badge = React.ClassicComponent<BadgeProps, {}>;
@@ -614,7 +614,7 @@ declare module "react-bootstrap" {
 
     // <Jumbotron />
     // ----------------------------------------
-    interface JumbotronProps extends React.HTMLAttributes {
+    interface JumbotronProps extends React.HTMLProps<Jumbotron> {
         componentClass?: React.ReactType;
     }
     type Jumbotron = React.ClassicComponent<JumbotronProps, {}>;
@@ -622,14 +622,14 @@ declare module "react-bootstrap" {
 
     // <PageHeader />
     // ----------------------------------------
-    interface PageHeaderProps extends React.HTMLAttributes {
+    interface PageHeaderProps extends React.HTMLProps<PageHeader> {
     }
     class PageHeader extends React.Component<PageHeaderProps, {}> {
     }
 
     // <Well />
     // ----------------------------------------
-    interface WellProps extends React.HTMLAttributes {
+    interface WellProps extends React.HTMLProps<Well> {
         bsSize?: string;
         bsStyle?: string;
     }
@@ -638,7 +638,7 @@ declare module "react-bootstrap" {
 
     // <Glyphicon />
     // ----------------------------------------
-    interface GlyphiconProps extends React.HTMLAttributes {
+    interface GlyphiconProps extends React.HTMLProps<Glyphicon> {
         // Required
         glyph: string;
     }
@@ -647,7 +647,7 @@ declare module "react-bootstrap" {
 
     // <Table />
     // ----------------------------------------
-    interface TableProps extends React.HTMLAttributes {
+    interface TableProps extends React.HTMLProps<Table> {
         bordered?: boolean;
         condensed?: boolean;
         hover?: boolean;
@@ -659,7 +659,7 @@ declare module "react-bootstrap" {
 
     // <Input />
     // ----------------------------------------
-    interface InputProps extends React.HTMLAttributes {
+    interface InputProps extends React.HTMLProps<Input> {
         defaultValue?:string;
         addonAfter?: any; // TODO: Add more specific type
         addonBefore?: any; // TODO: Add more specific type
@@ -680,7 +680,7 @@ declare module "react-bootstrap" {
 
     // <ButtonInput />
     // ----------------------------------------
-    interface ButtonInputProps extends React.HTMLAttributes {
+    interface ButtonInputProps extends React.HTMLProps<ButtonInput> {
         addonAfter?: any; // TODO: Add more specific type
         addonBefore?: any; // TODO: Add more specific type
         bsSize?: string;
@@ -702,7 +702,7 @@ declare module "react-bootstrap" {
     // <FormControls.Static />
     // ----------------------------------------
 
-    interface StaticProps extends React.HTMLAttributes {}
+    interface StaticProps extends React.HTMLProps<Static> {}
     interface Static extends React.ReactElement<StaticProps> { }
     interface StaticClass extends React.ComponentClass<StaticProps> { }
     interface FormControlsClass {
@@ -712,7 +712,7 @@ declare module "react-bootstrap" {
 
     // <Form />
     // ----------------------------------------
-    interface FormProps extends React.HTMLAttributes {
+    interface FormProps extends React.HTMLProps<Form> {
         bsClass?: string;
         componentClass?: React.ReactType;
         horizontal?: boolean;
@@ -722,33 +722,33 @@ declare module "react-bootstrap" {
 
     // <FormGroup />
     // ----------------------------------------
-    interface FormGroupProps extends React.HTMLAttributes {
+    interface FormGroupProps extends React.HTMLProps<FormGroup> {
         bsClass?: string;
         bsSize?: "sm" | "small" | "lg" | "large";
         controlId?: string;
         validationState?: "success" | "warning" | "error";
     }
     class FormGroup extends React.Component<FormGroupProps, {}> {}
-    
+
     // <ControlLabel />
     // ----------------------------------------
-    interface ControlLabelProps extends React.HTMLAttributes {
+    interface ControlLabelProps extends React.HTMLProps<ControlLabel> {
         bsClass?: string;
         htmlFor?: string;
         srOnly?: boolean;
     }
     class ControlLabel extends React.Component<ControlLabelProps, {}> {}
-    
+
     // <FormControl.Feedback />
     // ----------------------------------------
-    interface FormControlFeedbackProps extends React.HTMLAttributes {
+    interface FormControlFeedbackProps extends React.HTMLProps<FormControlFeedback> {
     }
     class FormControlFeedback extends React.Component<FormControlFeedbackProps, {}> {
     }
-    
+
     // <FormControl />
     // ----------------------------------------
-    interface FormControlProps extends React.HTMLAttributes {
+    interface FormControlProps extends React.HTMLProps<FormControl> {
         bsClass?: string;
         componentClass?: React.ReactType;
         id?: string;
@@ -759,27 +759,27 @@ declare module "react-bootstrap" {
     }
     type FormControl = React.Component<FormControlProps, {}>;
     var FormControl: FormControlClass;
-    
+
     // <HelpBlock />
     // ----------------------------------------
-    interface HelpBlockProps extends React.HTMLAttributes {
+    interface HelpBlockProps extends React.HTMLProps<HelpBlock> {
         bsClass?: string;
     }
     class HelpBlock extends React.Component<HelpBlockProps, {}> {}
-    
+
     // <Checkbox />
     // ----------------------------------------
-    interface CheckboxProps extends React.HTMLAttributes {
+    interface CheckboxProps extends React.HTMLProps<Checkbox> {
         bsClass?: string;
         disabled?: boolean;
         inline?: boolean;
         validationState?: "success" | "warning" | "error";
     }
     class Checkbox extends React.Component<CheckboxProps, {}> {}
-    
+
     // <Radio />
     // ----------------------------------------
-    interface RadioProps extends React.HTMLAttributes {
+    interface RadioProps extends React.HTMLProps<Radio> {
         bsClass?: string;
         disabled?: boolean;
         inline?: boolean;

From a6b828e1480a7f7f459840cb4c434988c6d0c39e Mon Sep 17 00:00:00 2001
From: Torsten Werner <torsten.werner@westernacher.com>
Date: Thu, 2 Jun 2016 19:45:57 +0200
Subject: [PATCH 091/278] node-fetch: reduce global namespace pollution

---
 node-fetch/node-fetch.d.ts | 165 +++++++++++++++++++------------------
 1 file changed, 83 insertions(+), 82 deletions(-)

diff --git a/node-fetch/node-fetch.d.ts b/node-fetch/node-fetch.d.ts
index 4e61f6bcd2..5934328aa6 100644
--- a/node-fetch/node-fetch.d.ts
+++ b/node-fetch/node-fetch.d.ts
@@ -3,89 +3,90 @@
 // Definitions by: Torsten Werner <https://github.com/torstenwerner>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-declare class Request extends Body {
-	constructor(input: string|Request, init?:RequestInit);
-	method: string;
-	url: string;
-	headers: Headers;
-	context: RequestContext;
-	referrer: string;
-	mode: RequestMode;
-	redirect: RequestRedirect;
-	credentials: RequestCredentials;
-	cache: RequestCache;
-}
-
-interface RequestInit {
-	method?: string;
-	headers?: HeaderInit|{ [index: string]: string };
-	body?: BodyInit;
-	mode?: RequestMode;
-	redirect?: RequestRedirect;
-	credentials?: RequestCredentials;
-	cache?: RequestCache;
-}
-
-type RequestContext =
-	"audio" | "beacon" | "cspreport" | "download" | "embed" |
-	"eventsource" | "favicon" | "fetch" | "font" | "form" | "frame" |
-	"hyperlink" | "iframe" | "image" | "imageset" | "import" |
-	"internal" | "location" | "manifest" | "object" | "ping" | "plugin" |
-	"prefetch" | "script" | "serviceworker" | "sharedworker" |
-	"subresource" | "style" | "track" | "video" | "worker" |
-	"xmlhttprequest" | "xslt";
-type RequestMode = "same-origin" | "no-cors" | "cors";
-type RequestRedirect = "follow" | "error" | "manual";
-type RequestCredentials = "omit" | "same-origin" | "include";
-type RequestCache =
-	"default" | "no-store" | "reload" | "no-cache" |
-	"force-cache" | "only-if-cached";
-
-declare class Headers {
-	append(name: string, value: string): void;
-	delete(name: string):void;
-	get(name: string): string;
-	getAll(name: string): Array<string>;
-	has(name: string): boolean;
-	set(name: string, value: string): void;
-	forEach(callback: (value: string, name: string) => void): void;
-}
-
-declare class Body {
-	bodyUsed: boolean;
-	arrayBuffer(): Promise<ArrayBuffer>;
-	blob(): Promise<Blob>;
-	formData(): Promise<FormData>;
-	json(): Promise<any>;
-	json<T>(): Promise<T>;
-	text(): Promise<string>;
-}
-declare class Response extends Body {
-	constructor(body?: BodyInit, init?: ResponseInit);
-	static error(): Response;
-	static redirect(url: string, status: number): Response;
-	type: ResponseType;
-	url: string;
-	status: number;
-	ok: boolean;
-	statusText: string;
-	headers: Headers;
-	clone(): Response;
-}
-
-type ResponseType = "basic" | "cors" | "default" | "error" | "opaque" | "opaqueredirect";
-
-interface ResponseInit {
-	status: number;
-	statusText?: string;
-	headers?: HeaderInit;
-}
-
-declare type HeaderInit = Headers|Array<string>;
-declare type BodyInit = ArrayBuffer|ArrayBufferView|Blob|FormData|string;
-declare type RequestInfo = Request|string;
-
 declare module 'node-fetch' {
+
+	class Request extends Body {
+		constructor(input: string | Request, init?: RequestInit);
+		method: string;
+		url: string;
+		headers: Headers;
+		context: RequestContext;
+		referrer: string;
+		mode: RequestMode;
+		redirect: RequestRedirect;
+		credentials: RequestCredentials;
+		cache: RequestCache;
+	}
+
+	interface RequestInit {
+		method?: string;
+		headers?: HeaderInit | { [index: string]: string };
+		body?: BodyInit;
+		mode?: RequestMode;
+		redirect?: RequestRedirect;
+		credentials?: RequestCredentials;
+		cache?: RequestCache;
+	}
+
+	type RequestContext =
+		"audio" | "beacon" | "cspreport" | "download" | "embed" |
+		"eventsource" | "favicon" | "fetch" | "font" | "form" | "frame" |
+		"hyperlink" | "iframe" | "image" | "imageset" | "import" |
+		"internal" | "location" | "manifest" | "object" | "ping" | "plugin" |
+		"prefetch" | "script" | "serviceworker" | "sharedworker" |
+		"subresource" | "style" | "track" | "video" | "worker" |
+		"xmlhttprequest" | "xslt";
+	type RequestMode = "same-origin" | "no-cors" | "cors";
+	type RequestRedirect = "follow" | "error" | "manual";
+	type RequestCredentials = "omit" | "same-origin" | "include";
+	type RequestCache =
+		"default" | "no-store" | "reload" | "no-cache" |
+		"force-cache" | "only-if-cached";
+
+	class Headers {
+		append(name: string, value: string): void;
+		delete(name: string): void;
+		get(name: string): string;
+		getAll(name: string): Array<string>;
+		has(name: string): boolean;
+		set(name: string, value: string): void;
+		forEach(callback: (value: string, name: string) => void): void;
+	}
+
+	class Body {
+		bodyUsed: boolean;
+		arrayBuffer(): Promise<ArrayBuffer>;
+		blob(): Promise<Blob>;
+		formData(): Promise<FormData>;
+		json(): Promise<any>;
+		json<T>(): Promise<T>;
+		text(): Promise<string>;
+	}
+	class Response extends Body {
+		constructor(body?: BodyInit, init?: ResponseInit);
+		static error(): Response;
+		static redirect(url: string, status: number): Response;
+		type: ResponseType;
+		url: string;
+		status: number;
+		ok: boolean;
+		statusText: string;
+		headers: Headers;
+		clone(): Response;
+	}
+
+	type ResponseType = "basic" | "cors" | "default" | "error" | "opaque" | "opaqueredirect";
+
+	interface ResponseInit {
+		status: number;
+		statusText?: string;
+		headers?: HeaderInit;
+	}
+
+	type HeaderInit = Headers | Array<string>;
+	type BodyInit = ArrayBuffer | ArrayBufferView | Blob | FormData | string;
+	type RequestInfo = Request | string;
+
     function fetch(url: string | Request, init?: RequestInit): Promise<Response>;
     export = fetch;
 }

From 79663aa566f459df38fd921cf45ba4b374aadbe5 Mon Sep 17 00:00:00 2001
From: mc-petry <mc-petry@simcord.com>
Date: Fri, 3 Jun 2016 14:37:33 +0300
Subject: [PATCH 092/278] Add d3pie typedefinitions

---
 d3pie/d3pie-tests.ts | 146 +++++++++++++++++++++++++++++++++++++++++++
 d3pie/d3pie.d.ts     | 144 ++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 290 insertions(+)
 create mode 100644 d3pie/d3pie-tests.ts
 create mode 100644 d3pie/d3pie.d.ts

diff --git a/d3pie/d3pie-tests.ts b/d3pie/d3pie-tests.ts
new file mode 100644
index 0000000000..4d8a38280f
--- /dev/null
+++ b/d3pie/d3pie-tests.ts
@@ -0,0 +1,146 @@
+/// <reference path='d3pie.d.ts' />
+
+let chart = new d3pie('test',
+  {
+    header: {
+      title: {
+        text: '',
+        color: '#333333',
+        fontSize: 18,
+        font: 'arial'
+      },
+      subtitle: {
+        color: '#666666',
+        fontSize: 14,
+        font: 'arial'
+      },
+      location: 'top-center',
+      titleSubtitlePadding: 8
+    },
+    footer: {
+      text: '',
+      color: '#666666',
+      fontSize: 14,
+      font: 'arial',
+      location: 'left'
+    },
+    size: {
+      canvasHeight: 500,
+      canvasWidth: 500,
+      pieInnerRadius: 0,
+      pieOuterRadius: null
+    },
+    data: {
+      sortOrder: 'none',
+      smallSegmentGrouping: {
+        enabled: false,
+        value: 1,
+        valueType: 'percentage',
+        label: 'Other',
+        color: '#cccccc'
+      },
+      content: []
+    },
+    labels: {
+      outer: {
+        format: 'label',
+        hideWhenLessThanPercentage: null,
+        pieDistance: 30
+      },
+      inner: {
+        format: 'percentage',
+        hideWhenLessThanPercentage: null
+      },
+      mainLabel: {
+        color: '#333333',
+        font: 'arial',
+        fontSize: 10
+      },
+      percentage: {
+        color: '#dddddd',
+        font: 'arial',
+        fontSize: 10,
+        decimalPlaces: 0
+      },
+      value: {
+        color: '#cccc44',
+        font: 'arial',
+        fontSize: 10
+      },
+      lines: {
+        enabled: true,
+        style: 'curved',
+        color: 'segment' // 'segment' or a hex color
+      }
+    },
+    effects: {
+      load: {
+        effect: 'default', // none / default
+        speed: 1000
+      },
+      pullOutSegmentOnClick: {
+        effect: 'bounce', // none / linear / bounce / elastic / back
+        speed: 300,
+        size: 10
+      },
+      highlightSegmentOnMouseover: true,
+      highlightLuminosity: -0.2
+    },
+    tooltips: {
+      enabled: false,
+      type: 'placeholder', // caption|placeholder
+      string: '',
+      placeholderParser: null,
+      styles: {
+        fadeInSpeed: 250,
+        backgroundColor: '#000000',
+        backgroundOpacity: 0.5,
+        color: '#efefef',
+        borderRadius: 2,
+        font: 'arial',
+        fontSize: 10,
+        padding: 4
+      }
+    },
+
+    misc: {
+      colors: {
+        background: null, // transparent
+        segments: [
+          '#2484c1', '#65a620', '#7b6888', '#a05d56', '#961a1a',
+          '#d8d23a', '#e98125', '#d0743c', '#635222', '#6ada6a',
+          '#0c6197', '#7d9058', '#207f33', '#44b9b0', '#bca44a',
+          '#e4a14b', '#a3acb2', '#8cc3e9', '#69a6f9', '#5b388f',
+          '#546e91', '#8bde95', '#d2ab58', '#273c71', '#98bf6e',
+          '#4daa4b', '#98abc5', '#cc1010', '#31383b', '#006391',
+          '#c2643f', '#b0a474', '#a5a39c', '#a9c2bc', '#22af8c',
+          '#7fcecf', '#987ac6', '#3d3b87', '#b77b1c', '#c9c2b6',
+          '#807ece', '#8db27c', '#be66a2', '#9ed3c6', '#00644b',
+          '#005064', '#77979f', '#77e079', '#9c73ab', '#1f79a7'
+        ],
+        segmentStroke: '#ffffff'
+      },
+      gradient: {
+        enabled: false,
+        percentage: 95,
+        color: '#000000'
+      },
+      canvasPadding: {
+        top: 5,
+        right: 5,
+        bottom: 5,
+        left: 5
+      },
+      pieCenterOffset: {
+        x: 0,
+        y: 0
+      },
+      cssPrefix: null
+    },
+    callbacks: {
+      onload: null,
+      onMouseoverSegment: null,
+      onMouseoutSegment: null,
+      onClickSegment: null
+    }
+  })
\ No newline at end of file
diff --git a/d3pie/d3pie.d.ts b/d3pie/d3pie.d.ts
new file mode 100644
index 0000000000..58b2b25d3d
--- /dev/null
+++ b/d3pie/d3pie.d.ts
@@ -0,0 +1,144 @@
+// Type definitions for d3pie 0.1.9
+// Project: https://github.com/benkeen/d3pie
+// Definitions by: Petryshyn Sergii <https://github.com/mc-petry>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+interface ID3PieChart {
+  redraw(): void
+  openSegment(index: number): void
+  closeSegment(index: void): void
+  getOpenSegment(): any
+  updateProp(propKey: string, value: any): void
+  destroy(): void
+}
+
+interface ID3PieStyleOptions {
+  color?: string
+  fontSize?: number
+  font?: string
+}
+
+interface ID3PieTextOptions extends ID3PieStyleOptions {
+  text?: string
+}
+
+interface ID3PieLabelsOptions {
+  format?: 'label' | 'value' | 'percentage' | 'label-value1' | 'label-value2' | 'label-percentage1' | 'label-percentage2'
+  hideWhenLessThanPercentage?: number
+}
+
+interface ID3PieOptions {
+  header?: {
+    title?: ID3PieTextOptions
+    subtitle?: ID3PieTextOptions
+    location?: 'top-center' | 'top-left' | 'pie-center'
+    titleSubtitlePadding?: number
+  }
+  footer?: { location?: 'left' } & ID3PieTextOptions
+  size?: {
+    canvasHeight?: number
+    canvasWidth?: number
+    pieOuterRadius?: string | number
+    pieInnerRadius?: string | number
+  }
+  data: {
+    sortOrder?: 'none' | 'random' | 'value-asc' | 'value-desc' | 'label-asc' | 'label-desc'
+    smallSegmentGrouping?: {
+      enabled?: boolean
+      value?: number
+      valueType?: 'percentage' | 'value'
+      label?: string
+      color?: string
+    }
+    content: {
+      label: string
+      value: number
+      color?: string
+    }[]
+  }
+  labels?: {
+    outer?: { pieDistance?: number } & ID3PieLabelsOptions
+    inner?: ID3PieLabelsOptions
+    mainLabel?: ID3PieStyleOptions
+    percentage?: { decimalPlaces?: number } & ID3PieStyleOptions
+    value?: ID3PieStyleOptions
+    lines?: {
+      enabled?: boolean
+      style?: 'curved' | 'straight'
+      color?: string
+    }
+    truncation?: {
+      enabled?: boolean
+      truncateLength?: number
+    }
+    formatter?: (context: {
+      section: 'outer' | 'inner'
+      value: number
+      label: string
+    }) => string
+  }
+  effects?: {
+    load?: {
+      effect?: 'none' | 'default'
+      speed?: number
+    }
+    pullOutSegmentOnClick?: {
+      effect?: 'none' | 'linear' | 'bounce' | 'elastic' | 'back'
+      speed?: number
+      size?: number
+    }
+    highlightSegmentOnMouseover?: boolean
+    highlightLuminosity?: number
+  }
+  tooltips?: {
+    enabled?: boolean
+    type?: 'placeholder' | 'caption'
+    string?: string
+    placeholderParser?: (index: number, data: { label?: string, percentage?: number, value?: number }) => void
+    styles?: {
+      fadeInSpeed?: number
+      backgroundColor?: string
+      backgroundOpacity?: number
+      color?: string
+      borderRadius?: number
+      font?: string
+      fontSize?: number
+      padding?: number
+    }
+  }
+  misc?: {
+    colors?: {
+      background?: string
+      segments?: string[]
+      segmentStroke?: string
+    }
+    gradient?: {
+      enabled?: boolean
+      percentage?: number
+      color?: string
+    }
+    canvasPadding?: {
+      top?: number
+      right?: number
+      bottom?: number
+      left?: number
+    }
+    pieCenterOffset?: {
+      x?: number
+      y?: number
+    }
+    cssPrefix?: string
+  }
+  callbacks?: {
+    onload?: Function
+    onMouseoverSegment?: Function
+    onMouseoutSegment?: Function
+    onClickSegment?: Function
+  }
+}
+
+interface ID3PieClass {
+  new (id: string | HTMLElement, options: ID3PieOptions): ID3PieChart
+}
+
+declare const d3pie: ID3PieClass
\ No newline at end of file

From 4b06a1e9e388f450693c5727e4a96fab2ce95479 Mon Sep 17 00:00:00 2001
From: mc-petry <mc-petry@simcord.com>
Date: Fri, 3 Jun 2016 14:37:42 +0300
Subject: [PATCH 093/278] Revert "Add d3pie typedefinitions"

This reverts commit 79663aa566f459df38fd921cf45ba4b374aadbe5.
---
 d3pie/d3pie-tests.ts | 146 -------------------------------------------
 d3pie/d3pie.d.ts     | 144 ------------------------------------------
 2 files changed, 290 deletions(-)
 delete mode 100644 d3pie/d3pie-tests.ts
 delete mode 100644 d3pie/d3pie.d.ts

diff --git a/d3pie/d3pie-tests.ts b/d3pie/d3pie-tests.ts
deleted file mode 100644
index 4d8a38280f..0000000000
--- a/d3pie/d3pie-tests.ts
+++ /dev/null
@@ -1,146 +0,0 @@
-/// <reference path='d3pie.d.ts' />
-
-let chart = new d3pie('test',
-  {
-    header: {
-      title: {
-        text: '',
-        color: '#333333',
-        fontSize: 18,
-        font: 'arial'
-      },
-      subtitle: {
-        color: '#666666',
-        fontSize: 14,
-        font: 'arial'
-      },
-      location: 'top-center',
-      titleSubtitlePadding: 8
-    },
-    footer: {
-      text: '',
-      color: '#666666',
-      fontSize: 14,
-      font: 'arial',
-      location: 'left'
-    },
-    size: {
-      canvasHeight: 500,
-      canvasWidth: 500,
-      pieInnerRadius: 0,
-      pieOuterRadius: null
-    },
-    data: {
-      sortOrder: 'none',
-      smallSegmentGrouping: {
-        enabled: false,
-        value: 1,
-        valueType: 'percentage',
-        label: 'Other',
-        color: '#cccccc'
-      },
-      content: []
-    },
-    labels: {
-      outer: {
-        format: 'label',
-        hideWhenLessThanPercentage: null,
-        pieDistance: 30
-      },
-      inner: {
-        format: 'percentage',
-        hideWhenLessThanPercentage: null
-      },
-      mainLabel: {
-        color: '#333333',
-        font: 'arial',
-        fontSize: 10
-      },
-      percentage: {
-        color: '#dddddd',
-        font: 'arial',
-        fontSize: 10,
-        decimalPlaces: 0
-      },
-      value: {
-        color: '#cccc44',
-        font: 'arial',
-        fontSize: 10
-      },
-      lines: {
-        enabled: true,
-        style: 'curved',
-        color: 'segment' // 'segment' or a hex color
-      }
-    },
-    effects: {
-      load: {
-        effect: 'default', // none / default
-        speed: 1000
-      },
-      pullOutSegmentOnClick: {
-        effect: 'bounce', // none / linear / bounce / elastic / back
-        speed: 300,
-        size: 10
-      },
-      highlightSegmentOnMouseover: true,
-      highlightLuminosity: -0.2
-    },
-    tooltips: {
-      enabled: false,
-      type: 'placeholder', // caption|placeholder
-      string: '',
-      placeholderParser: null,
-      styles: {
-        fadeInSpeed: 250,
-        backgroundColor: '#000000',
-        backgroundOpacity: 0.5,
-        color: '#efefef',
-        borderRadius: 2,
-        font: 'arial',
-        fontSize: 10,
-        padding: 4
-      }
-    },
-
-    misc: {
-      colors: {
-        background: null, // transparent
-        segments: [
-          '#2484c1', '#65a620', '#7b6888', '#a05d56', '#961a1a',
-          '#d8d23a', '#e98125', '#d0743c', '#635222', '#6ada6a',
-          '#0c6197', '#7d9058', '#207f33', '#44b9b0', '#bca44a',
-          '#e4a14b', '#a3acb2', '#8cc3e9', '#69a6f9', '#5b388f',
-          '#546e91', '#8bde95', '#d2ab58', '#273c71', '#98bf6e',
-          '#4daa4b', '#98abc5', '#cc1010', '#31383b', '#006391',
-          '#c2643f', '#b0a474', '#a5a39c', '#a9c2bc', '#22af8c',
-          '#7fcecf', '#987ac6', '#3d3b87', '#b77b1c', '#c9c2b6',
-          '#807ece', '#8db27c', '#be66a2', '#9ed3c6', '#00644b',
-          '#005064', '#77979f', '#77e079', '#9c73ab', '#1f79a7'
-        ],
-        segmentStroke: '#ffffff'
-      },
-      gradient: {
-        enabled: false,
-        percentage: 95,
-        color: '#000000'
-      },
-      canvasPadding: {
-        top: 5,
-        right: 5,
-        bottom: 5,
-        left: 5
-      },
-      pieCenterOffset: {
-        x: 0,
-        y: 0
-      },
-      cssPrefix: null
-    },
-    callbacks: {
-      onload: null,
-      onMouseoverSegment: null,
-      onMouseoutSegment: null,
-      onClickSegment: null
-    }
-  })
\ No newline at end of file
diff --git a/d3pie/d3pie.d.ts b/d3pie/d3pie.d.ts
deleted file mode 100644
index 58b2b25d3d..0000000000
--- a/d3pie/d3pie.d.ts
+++ /dev/null
@@ -1,144 +0,0 @@
-// Type definitions for d3pie 0.1.9
-// Project: https://github.com/benkeen/d3pie
-// Definitions by: Petryshyn Sergii <https://github.com/mc-petry>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
-
-interface ID3PieChart {
-  redraw(): void
-  openSegment(index: number): void
-  closeSegment(index: void): void
-  getOpenSegment(): any
-  updateProp(propKey: string, value: any): void
-  destroy(): void
-}
-
-interface ID3PieStyleOptions {
-  color?: string
-  fontSize?: number
-  font?: string
-}
-
-interface ID3PieTextOptions extends ID3PieStyleOptions {
-  text?: string
-}
-
-interface ID3PieLabelsOptions {
-  format?: 'label' | 'value' | 'percentage' | 'label-value1' | 'label-value2' | 'label-percentage1' | 'label-percentage2'
-  hideWhenLessThanPercentage?: number
-}
-
-interface ID3PieOptions {
-  header?: {
-    title?: ID3PieTextOptions
-    subtitle?: ID3PieTextOptions
-    location?: 'top-center' | 'top-left' | 'pie-center'
-    titleSubtitlePadding?: number
-  }
-  footer?: { location?: 'left' } & ID3PieTextOptions
-  size?: {
-    canvasHeight?: number
-    canvasWidth?: number
-    pieOuterRadius?: string | number
-    pieInnerRadius?: string | number
-  }
-  data: {
-    sortOrder?: 'none' | 'random' | 'value-asc' | 'value-desc' | 'label-asc' | 'label-desc'
-    smallSegmentGrouping?: {
-      enabled?: boolean
-      value?: number
-      valueType?: 'percentage' | 'value'
-      label?: string
-      color?: string
-    }
-    content: {
-      label: string
-      value: number
-      color?: string
-    }[]
-  }
-  labels?: {
-    outer?: { pieDistance?: number } & ID3PieLabelsOptions
-    inner?: ID3PieLabelsOptions
-    mainLabel?: ID3PieStyleOptions
-    percentage?: { decimalPlaces?: number } & ID3PieStyleOptions
-    value?: ID3PieStyleOptions
-    lines?: {
-      enabled?: boolean
-      style?: 'curved' | 'straight'
-      color?: string
-    }
-    truncation?: {
-      enabled?: boolean
-      truncateLength?: number
-    }
-    formatter?: (context: {
-      section: 'outer' | 'inner'
-      value: number
-      label: string
-    }) => string
-  }
-  effects?: {
-    load?: {
-      effect?: 'none' | 'default'
-      speed?: number
-    }
-    pullOutSegmentOnClick?: {
-      effect?: 'none' | 'linear' | 'bounce' | 'elastic' | 'back'
-      speed?: number
-      size?: number
-    }
-    highlightSegmentOnMouseover?: boolean
-    highlightLuminosity?: number
-  }
-  tooltips?: {
-    enabled?: boolean
-    type?: 'placeholder' | 'caption'
-    string?: string
-    placeholderParser?: (index: number, data: { label?: string, percentage?: number, value?: number }) => void
-    styles?: {
-      fadeInSpeed?: number
-      backgroundColor?: string
-      backgroundOpacity?: number
-      color?: string
-      borderRadius?: number
-      font?: string
-      fontSize?: number
-      padding?: number
-    }
-  }
-  misc?: {
-    colors?: {
-      background?: string
-      segments?: string[]
-      segmentStroke?: string
-    }
-    gradient?: {
-      enabled?: boolean
-      percentage?: number
-      color?: string
-    }
-    canvasPadding?: {
-      top?: number
-      right?: number
-      bottom?: number
-      left?: number
-    }
-    pieCenterOffset?: {
-      x?: number
-      y?: number
-    }
-    cssPrefix?: string
-  }
-  callbacks?: {
-    onload?: Function
-    onMouseoverSegment?: Function
-    onMouseoutSegment?: Function
-    onClickSegment?: Function
-  }
-}
-
-interface ID3PieClass {
-  new (id: string | HTMLElement, options: ID3PieOptions): ID3PieChart
-}
-
-declare const d3pie: ID3PieClass
\ No newline at end of file

From 2811f4a523a1f261857ad7feaddb3a230235b651 Mon Sep 17 00:00:00 2001
From: mc-petry <mc-petry@simcord.com>
Date: Fri, 3 Jun 2016 14:39:49 +0300
Subject: [PATCH 094/278] Add d3pie type definitions

---
 d3pie/d3pie-tests.ts | 146 +++++++++++++++++++++++++++++++++++++++++++
 d3pie/d3pie.d.ts     | 144 ++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 290 insertions(+)
 create mode 100644 d3pie/d3pie-tests.ts
 create mode 100644 d3pie/d3pie.d.ts

diff --git a/d3pie/d3pie-tests.ts b/d3pie/d3pie-tests.ts
new file mode 100644
index 0000000000..4d8a38280f
--- /dev/null
+++ b/d3pie/d3pie-tests.ts
@@ -0,0 +1,146 @@
+/// <reference path='d3pie.d.ts' />
+
+let chart = new d3pie('test',
+  {
+    header: {
+      title: {
+        text: '',
+        color: '#333333',
+        fontSize: 18,
+        font: 'arial'
+      },
+      subtitle: {
+        color: '#666666',
+        fontSize: 14,
+        font: 'arial'
+      },
+      location: 'top-center',
+      titleSubtitlePadding: 8
+    },
+    footer: {
+      text: '',
+      color: '#666666',
+      fontSize: 14,
+      font: 'arial',
+      location: 'left'
+    },
+    size: {
+      canvasHeight: 500,
+      canvasWidth: 500,
+      pieInnerRadius: 0,
+      pieOuterRadius: null
+    },
+    data: {
+      sortOrder: 'none',
+      smallSegmentGrouping: {
+        enabled: false,
+        value: 1,
+        valueType: 'percentage',
+        label: 'Other',
+        color: '#cccccc'
+      },
+      content: []
+    },
+    labels: {
+      outer: {
+        format: 'label',
+        hideWhenLessThanPercentage: null,
+        pieDistance: 30
+      },
+      inner: {
+        format: 'percentage',
+        hideWhenLessThanPercentage: null
+      },
+      mainLabel: {
+        color: '#333333',
+        font: 'arial',
+        fontSize: 10
+      },
+      percentage: {
+        color: '#dddddd',
+        font: 'arial',
+        fontSize: 10,
+        decimalPlaces: 0
+      },
+      value: {
+        color: '#cccc44',
+        font: 'arial',
+        fontSize: 10
+      },
+      lines: {
+        enabled: true,
+        style: 'curved',
+        color: 'segment' // 'segment' or a hex color
+      }
+    },
+    effects: {
+      load: {
+        effect: 'default', // none / default
+        speed: 1000
+      },
+      pullOutSegmentOnClick: {
+        effect: 'bounce', // none / linear / bounce / elastic / back
+        speed: 300,
+        size: 10
+      },
+      highlightSegmentOnMouseover: true,
+      highlightLuminosity: -0.2
+    },
+    tooltips: {
+      enabled: false,
+      type: 'placeholder', // caption|placeholder
+      string: '',
+      placeholderParser: null,
+      styles: {
+        fadeInSpeed: 250,
+        backgroundColor: '#000000',
+        backgroundOpacity: 0.5,
+        color: '#efefef',
+        borderRadius: 2,
+        font: 'arial',
+        fontSize: 10,
+        padding: 4
+      }
+    },
+
+    misc: {
+      colors: {
+        background: null, // transparent
+        segments: [
+          '#2484c1', '#65a620', '#7b6888', '#a05d56', '#961a1a',
+          '#d8d23a', '#e98125', '#d0743c', '#635222', '#6ada6a',
+          '#0c6197', '#7d9058', '#207f33', '#44b9b0', '#bca44a',
+          '#e4a14b', '#a3acb2', '#8cc3e9', '#69a6f9', '#5b388f',
+          '#546e91', '#8bde95', '#d2ab58', '#273c71', '#98bf6e',
+          '#4daa4b', '#98abc5', '#cc1010', '#31383b', '#006391',
+          '#c2643f', '#b0a474', '#a5a39c', '#a9c2bc', '#22af8c',
+          '#7fcecf', '#987ac6', '#3d3b87', '#b77b1c', '#c9c2b6',
+          '#807ece', '#8db27c', '#be66a2', '#9ed3c6', '#00644b',
+          '#005064', '#77979f', '#77e079', '#9c73ab', '#1f79a7'
+        ],
+        segmentStroke: '#ffffff'
+      },
+      gradient: {
+        enabled: false,
+        percentage: 95,
+        color: '#000000'
+      },
+      canvasPadding: {
+        top: 5,
+        right: 5,
+        bottom: 5,
+        left: 5
+      },
+      pieCenterOffset: {
+        x: 0,
+        y: 0
+      },
+      cssPrefix: null
+    },
+    callbacks: {
+      onload: null,
+      onMouseoverSegment: null,
+      onMouseoutSegment: null,
+      onClickSegment: null
+    }
+  })
\ No newline at end of file
diff --git a/d3pie/d3pie.d.ts b/d3pie/d3pie.d.ts
new file mode 100644
index 0000000000..58b2b25d3d
--- /dev/null
+++ b/d3pie/d3pie.d.ts
@@ -0,0 +1,144 @@
+// Type definitions for d3pie 0.1.9
+// Project: https://github.com/benkeen/d3pie
+// Definitions by: Petryshyn Sergii <https://github.com/mc-petry>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+interface ID3PieChart {
+  redraw(): void
+  openSegment(index: number): void
+  closeSegment(index: void): void
+  getOpenSegment(): any
+  updateProp(propKey: string, value: any): void
+  destroy(): void
+}
+
+interface ID3PieStyleOptions {
+  color?: string
+  fontSize?: number
+  font?: string
+}
+
+interface ID3PieTextOptions extends ID3PieStyleOptions {
+  text?: string
+}
+
+interface ID3PieLabelsOptions {
+  format?: 'label' | 'value' | 'percentage' | 'label-value1' | 'label-value2' | 'label-percentage1' | 'label-percentage2'
+  hideWhenLessThanPercentage?: number
+}
+
+interface ID3PieOptions {
+  header?: {
+    title?: ID3PieTextOptions
+    subtitle?: ID3PieTextOptions
+    location?: 'top-center' | 'top-left' | 'pie-center'
+    titleSubtitlePadding?: number
+  }
+  footer?: { location?: 'left' } & ID3PieTextOptions
+  size?: {
+    canvasHeight?: number
+    canvasWidth?: number
+    pieOuterRadius?: string | number
+    pieInnerRadius?: string | number
+  }
+  data: {
+    sortOrder?: 'none' | 'random' | 'value-asc' | 'value-desc' | 'label-asc' | 'label-desc'
+    smallSegmentGrouping?: {
+      enabled?: boolean
+      value?: number
+      valueType?: 'percentage' | 'value'
+      label?: string
+      color?: string
+    }
+    content: {
+      label: string
+      value: number
+      color?: string
+    }[]
+  }
+  labels?: {
+    outer?: { pieDistance?: number } & ID3PieLabelsOptions
+    inner?: ID3PieLabelsOptions
+    mainLabel?: ID3PieStyleOptions
+    percentage?: { decimalPlaces?: number } & ID3PieStyleOptions
+    value?: ID3PieStyleOptions
+    lines?: {
+      enabled?: boolean
+      style?: 'curved' | 'straight'
+      color?: string
+    }
+    truncation?: {
+      enabled?: boolean
+      truncateLength?: number
+    }
+    formatter?: (context: {
+      section: 'outer' | 'inner'
+      value: number
+      label: string
+    }) => string
+  }
+  effects?: {
+    load?: {
+      effect?: 'none' | 'default'
+      speed?: number
+    }
+    pullOutSegmentOnClick?: {
+      effect?: 'none' | 'linear' | 'bounce' | 'elastic' | 'back'
+      speed?: number
+      size?: number
+    }
+    highlightSegmentOnMouseover?: boolean
+    highlightLuminosity?: number
+  }
+  tooltips?: {
+    enabled?: boolean
+    type?: 'placeholder' | 'caption'
+    string?: string
+    placeholderParser?: (index: number, data: { label?: string, percentage?: number, value?: number }) => void
+    styles?: {
+      fadeInSpeed?: number
+      backgroundColor?: string
+      backgroundOpacity?: number
+      color?: string
+      borderRadius?: number
+      font?: string
+      fontSize?: number
+      padding?: number
+    }
+  }
+  misc?: {
+    colors?: {
+      background?: string
+      segments?: string[]
+      segmentStroke?: string
+    }
+    gradient?: {
+      enabled?: boolean
+      percentage?: number
+      color?: string
+    }
+    canvasPadding?: {
+      top?: number
+      right?: number
+      bottom?: number
+      left?: number
+    }
+    pieCenterOffset?: {
+      x?: number
+      y?: number
+    }
+    cssPrefix?: string
+  }
+  callbacks?: {
+    onload?: Function
+    onMouseoverSegment?: Function
+    onMouseoutSegment?: Function
+    onClickSegment?: Function
+  }
+}
+
+interface ID3PieClass {
+  new (id: string | HTMLElement, options: ID3PieOptions): ID3PieChart
+}
+
+declare const d3pie: ID3PieClass
\ No newline at end of file

From 19b31213907dccef081cec21f3c92c0c0f34c3c5 Mon Sep 17 00:00:00 2001
From: Radu Woinaroski <radu.woinaroski@gmail.com>
Date: Sat, 4 Jun 2016 16:51:34 +0200
Subject: [PATCH 095/278] CustomScrollbarOptions with all the options from
 current documentation

---
 mCustomScrollbar/mCustomScrollbar.d.ts | 187 ++++++++++++++++++++++---
 1 file changed, 165 insertions(+), 22 deletions(-)

diff --git a/mCustomScrollbar/mCustomScrollbar.d.ts b/mCustomScrollbar/mCustomScrollbar.d.ts
index 08e532d7bf..3598f4fc9f 100644
--- a/mCustomScrollbar/mCustomScrollbar.d.ts
+++ b/mCustomScrollbar/mCustomScrollbar.d.ts
@@ -10,16 +10,35 @@ declare namespace MCustomScrollbar {
         /**
         * Set the width of your content (overwrites CSS width), value in pixels (integer) or percentage (string)
         */
-        setWidth?: any;
+        setWidth?: number|string;
         /**
         * Set the height of your content (overwirtes CSS height), value in pixels (integer) or percentage (string)
         */
-        setHeight?: any;
+        setHeight?: number|string;
+        /**
+        * Set the initial css top property of content, accepts string values (css top position).
+        * Example: setTop: "-100px".
+        */
+        setTop? : number|string;
+        /**
+        * Set the initial css top property of content, accepts string values (css top position).
+        * Example: setTop: "-100px".
+        */
+        setLeft? : number|string;
         /**
          * Define content’s scrolling axis (the type of scrollbars added to the element: vertical and/of horizontal).
-         * Available values: "y", "x", "yx". y -vertical, x - horizontal
+         * Available values: "y", "x", "yx". y -vertical, x - horizontal, yx - vertical and horizontal
          */
-        axis?: string;
+        axis?: "x"|"y"|"yx";
+        /**
+        * Set the position of scrollbar in relation to content.
+        * Available values: "inside", "outside".
+        * Setting scrollbarPosition: "inside" (default) makes scrollbar appear inside the element. 
+        * Setting scrollbarPosition: "outside" makes scrollbar appear outside the element. 
+        * Note that setting the value to "outside" requires your element (or parent elements) 
+        * to have CSS position: relative (otherwise the scrollbar will be positioned in relation to document’s root element).
+        */
+        scrollbarPosition: "inside"|"outside";
         /**
         * Always keep scrollbar(s) visible, even when there’s nothing to scroll.
         * 0 – disable (default)
@@ -28,6 +47,18 @@ declare namespace MCustomScrollbar {
         */
         alwaysShowScrollbar?: number;
         /**
+        * Make scrolling snap to a multiple of a fixed number of pixels. Useful in cases like scrolling tabular data, 
+        * image thumbnails or slides and you need to prevent scrolling from stopping half-way your elements. 
+        * Note that your elements must be of equal width or height in order for this to work properly.
+        * To set different values for vertical and horizontal scrolling, use an array: [y,x]
+        */
+        snapAmount?: number; 
+        /**
+        * Set an offset (in pixels) for the snapAmount option. Useful when for example you need to offset the 
+        * snap amount of table rows by the table header.
+        */
+        snapOffset?: number;
+        /**
         * Enable or disable auto-expanding the scrollbar when cursor is over or dragging the scrollbar.
         */
         autoExpandScrollbar?: boolean;
@@ -47,7 +78,7 @@ declare namespace MCustomScrollbar {
              * Set the mouse-wheel scrolling amount (in pixels).
              * The default value "auto" adjusts scrolling amount according to scrollable content length.
              */
-            scrollAmount?: number;
+            scrollAmount?: "auto"|number;
             /**
              * Define the mouse-wheel scrolling axis when both vertical and horizontal scrollbars are present.
              * Set axis: "y" (default) for vertical or axis: "x" for horizontal scrolling.
@@ -76,8 +107,29 @@ declare namespace MCustomScrollbar {
              * Set the tags that disable mouse-wheel when cursor is over them.
              * Default value: ["select","option","keygen","datalist","textarea"]
              */
-            disableOver?: string[]
+            disableOver?: string[];
         }
+        /**
+        * Keyboard support 
+        */
+        keyboard:{
+            /**
+             * Enable or disable content scrolling via keyboard.
+             */
+            enable?: boolean;
+            /**
+             * Set the keyboard arrows scrolling amount (in pixels). 
+             * The default value "auto" adjusts scrolling amount according to scrollable content length.
+             */
+            scrollAmount?: "auto"|number;
+            /**
+            * Define the buttons scrolling type/behavior.
+            * scrollType: "stepless" – continuously scroll content while pressing the button (default)
+            * scrollType: "stepped" – each button click scrolls content by a certain amount (defined in scrollAmount option above)
+            */
+            scrollType?: "stepless"|"stepped";
+        }
+
         /**
         * Mouse wheel scrolling pixels amount, value in pixels (integer) or "auto" (script calculates and sets pixels amount according to content length)
         */
@@ -96,19 +148,21 @@ declare namespace MCustomScrollbar {
              */
             enable?: boolean;
             /**
-            * Scroll buttons scroll type, values: "continuous" (scroll continuously while pressing the button), "pixels" (scrolls by a fixed number of pixels on each click")
+            * Define the buttons scrolling type/behavior.
+            * scrollType: "stepless" – continuously scroll content while pressing the button (default)
+            * scrollType: "stepped" – each button click scrolls content by a certain amount (defined in scrollAmount option above)
             */
-            scrollType?: string;
+            scrollType?: "stepless"|"stepped";
             /**
-            * Scroll buttons continuous scrolling speed, integer value or "auto" (script calculates and sets the speed according to content length)
+            * Set a tabindex value for the buttons.
             */
-            scrollSpeed?: number | string;
+            tabIndex?: number;
             /**
             * Scroll buttons pixels scrolling amount, value in pixels or "auto"
             */
-            scrollAmount?: number | string;
+            scrollAmount?: "auto"|number ;
         }
-    advanced?: {
+        advanced?: {
             /**
             * Update scrollbars on browser resize (for fluid content blocks and layouts based on percentages), values: true, false. Set to false only when you content has fixed dimensions
             */
@@ -119,27 +173,71 @@ declare namespace MCustomScrollbar {
             */
             updateOnContentResize?: boolean;
             /**
+            * Update scrollbar(s) automatically each time an image inside the element is fully loaded.
+            * Default value is auto which triggers the function only on "x" and "yx" axis (if needed).
+            * The value should be true when your content contains images and you need the function to trigger on any axis.
+            */
+            updateOnImageLoad?: "auto"|boolean;
+            /**
+            * Add extra selector(s) that’ll release scrollbar dragging upon mouseup, pointerup, touchend etc.
+            * Example: extraDraggableSelectors: ".myClass, #myID"
+            */
+            extraDraggableSelectors?: string;
+            /**
+            * Add extra selector(s) that’ll allow scrollbar dragging upon mousemove/up, pointermove/up, touchend etc.
+            * Example: releaseDraggableSelectors: ".myClass, #myID"
+            */
+            releaseDraggableSelectors?: string;
+            /**
+            * Set the auto-update timeout in milliseconds.
+            * Default timeout: 60
+            */            
+            autoUpdateTimeout?: number;
+            /**
+            * Update scrollbar(s) automatically when the amount and size of specific selectors changes.
+            * Useful when you need to update the scrollbar(s) automatically, each time a type of element is added, removed or changes its size.
+            * For example, setting updateOnSelectorChange: "ul li" will update scrollbars each time list-items inside the element are changed.
+            * Setting the value to true, will update scrollbars each time any element is changed.
+            * To disable (default) set to false.
+            */
+            updateOnSelectorChange?: string|boolean;
+            /**
             * Auto-expanding content's width on horizontal scrollbars, values: true, false. Set to true if you have horizontal scrollbr on content that change on-the-fly. Demo contains
             * blocks with images and horizontal scrollbars that use this option parameter
             */
             autoExpandHorizontalScroll?: boolean;
             /**
-            * Auto-scrolling on elements that have focus (e.g. scrollbar automatically scrolls to form text fields when the TAB key is pressed), values: true, false
+            * Set the list of elements/selectors that will auto-scroll content to their position when focused.
+            * For example, when pressing TAB key to focus input fields, if the field is out of the viewable area the content 
+            * will scroll to its top/left position (same bahavior with browser’s native scrollbar).
+            * To completely disable this functionality, set autoScrollOnFocus: false.
+            * Default:
+            *   "input,textarea,select,button,datalist,keygen,a[tabindex],area,object,[contenteditable='true']"
             */
-            autoScrollOnFocus?: boolean;
+            autoScrollOnFocus?: boolean|string;
             /**
             * Normalize mouse wheel delta (-1/1), values: true, false
             */
             normalizeMouseWheelDelta?: boolean;
         }
-    /**
-    * Additional scrolling method by touch-swipe content (for touch enabled devices), value: true, false
-    */
-    contentTouchScroll?: boolean;
+        /**
+        * Enable or disable content touch-swipe scrolling for touch-enabled devices.
+        * To completely disable, set contentTouchScroll: false.
+        * Integer values define the axis-specific minimum amount required for scrolling momentum (default: 25).
+        */
+        contentTouchScroll?: boolean|number;
         /**
         * All of the following callbacks option have examples in the callback demo - http://manos.malihu.gr/tuts/custom-scrollbar-plugin/callbacks_example.html
         */
         callbacks?: {
+            /**
+            * A function to call when plugin markup is created.
+            */
+            onCreate?: () => void;
+            /**
+            * A function to call when scrollbars have initialized
+            */
+            onInit?: () => void;
             /**
             * User defined callback function, triggered on scroll start event. You can call your own function(s) each time a scroll event begins
             */
@@ -176,11 +274,56 @@ declare namespace MCustomScrollbar {
             * Set alwaysTriggerOffsets: false when you need to trigger onTotalScroll and onTotalScrollBack callbacks once, each time scroll end or beginning is reached.
             */
             alwaysTriggerOffsets?: boolean;
+            /**
+            * A function to call when content becomes long enough and vertical scrollbar is added.
+            */
+            onOverflowY?: () => void;
+            /**
+            * A function to call when content becomes wide enough and horizontal scrollbar is added.
+            */
+            onOverflowX?: () => void;
+            /**
+            * A function to call when content becomes short enough and vertical scrollbar is removed.
+            */
+            onOverflowYNone?: () => void;
+            /**
+            * A function to call when content becomes narrow enough and horizontal scrollbar is removed.
+            */
+            onOverflowXNone?: () => void;
+            /**
+            * A function to call right before scrollbar(s) are updated.
+            */
+            onBeforeUpdate?: () => void;
+            /**
+            * A function to call when scrollbar(s) are updated.
+            */
+            onUpdate?: () => void;
+            /**
+            * A function to call each time an image inside the element is fully loaded and scrollbar(s) are updated.
+            */
+            onImageLoad?: () => void;
+            /**
+            * A function to call each time a type of element is added, removed or changes its size and scrollbar(s) are updated.
+            */
+            onSelctorChange?: () => void;
         }
-    /**
-    * Set a scrollbar ready-to-use theme. See themes demo for all themes - http://manos.malihu.gr/tuts/custom-scrollbar-plugin/scrollbar_themes_demo.html
-    */
-    theme?: string;
+        /**
+        * Set a scrollbar ready-to-use theme. See themes demo for all themes - http://manos.malihu.gr/tuts/custom-scrollbar-plugin/scrollbar_themes_demo.html
+        */
+        theme?: string;
+        /**
+        * Enable or disable applying scrollbar(s) on all elements matching the current selector, now and in the future.
+        * Set live: true when you need to add scrollbar(s) on elements that do not yet exist in the page. 
+        * These could be elements added by other scripts or plugins after some action by the user takes place (e.g. lightbox markup may not exist untill the user clicks a link).
+        * If you need at any time to disable or enable the live option, set live: "off" and "on" respectively.
+        * You can also tell the script to disable live option after the first invocation by setting live: "once".
+        */
+        live?: string|boolean;
+        /**
+        * Set the matching set of elements (instead of the current selector) to add scrollbar(s), now and in the future.
+        */
+        liveSelector?: string;
+
     }
 
     interface ScrollToParameterOptions {

From f0f507bdc7a839e19871a8b00a758e34a5ac0318 Mon Sep 17 00:00:00 2001
From: Radu Woinaroski <radu.woinaroski@gmail.com>
Date: Sat, 4 Jun 2016 17:28:31 +0200
Subject: [PATCH 096/278] fixed merge conflict mistake

---
 mCustomScrollbar/mCustomScrollbar.d.ts | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/mCustomScrollbar/mCustomScrollbar.d.ts b/mCustomScrollbar/mCustomScrollbar.d.ts
index 7db2b7574a..51c7c1852f 100644
--- a/mCustomScrollbar/mCustomScrollbar.d.ts
+++ b/mCustomScrollbar/mCustomScrollbar.d.ts
@@ -129,11 +129,6 @@ declare namespace MCustomScrollbar {
             */
             scrollType?: "stepless"|"stepped";
         }
-
-=======
-            disableOver?: string[]
-        }
->>>>>>> upstream/master
         /**
         * Mouse wheel scrolling pixels amount, value in pixels (integer) or "auto" (script calculates and sets pixels amount according to content length)
         */

From 3e104123c79cf53778caf3d97f4db71457fa160e Mon Sep 17 00:00:00 2001
From: Radu Woinaroski <radu.woinaroski@gmail.com>
Date: Sat, 4 Jun 2016 18:52:02 +0200
Subject: [PATCH 097/278] fix tests

---
 mCustomScrollbar/mCustomScrollbar-tests.ts | 65 ++++++++++++++++++----
 mCustomScrollbar/mCustomScrollbar.d.ts     | 18 +++---
 2 files changed, 64 insertions(+), 19 deletions(-)

diff --git a/mCustomScrollbar/mCustomScrollbar-tests.ts b/mCustomScrollbar/mCustomScrollbar-tests.ts
index 7dcf793564..9c5f030679 100644
--- a/mCustomScrollbar/mCustomScrollbar-tests.ts
+++ b/mCustomScrollbar/mCustomScrollbar-tests.ts
@@ -9,7 +9,8 @@ class SimpleTest {
 
         this.element.mCustomScrollbar({
             scrollButtons: {
-                enable: true
+                enable: true,
+                scrollAmount: 2
             }
         });
     }
@@ -22,38 +23,78 @@ class SimpleTestAllParams {
         this.element = $(".content");
 
         this.element.mCustomScrollbar({
-            setWidth: false,
-            setHeight: false,
+            setWidth: 22,
+            setHeight: "40%",
+            setTop: 0,
+            setLeft: 22,
             axis: "y",
+            scrollbarPosition: "inside",
             scrollInertia: 950,
-            mouseWheel: true,
-            mouseWheelPixels: "auto",
             autoDraggerLength: true,
             autoHideScrollbar: false,
+            autoExpandScrollbar: false,
+            alwaysShowScrollbar: 0,
+            snapAmount: [3,3],
+            snapOffset: 3,
+            mouseWheel: {
+                enable: true,
+                scrollAmount: 1,
+                axis:"x",
+                preventDefault: false,
+                deltaFactor:12,
+                normalizeDelta:true,
+                invert: false,
+                disableOver: ["select","option"]
+
+            },
             scrollButtons: {
                 enable: false,
-                scrollType: "continuous",
-                scrollSpeed: "auto",
-                scrollAmount: 40
+                scrollType: "stepped",
+                scrollAmount: 40,
+                tabindex: 33,
+            },
+            keyboard:{
+                enable: true,
+                scrollAmount:5,
+                scrollType:"stepless"
             },
             advanced: {
                 updateOnBrowserResize: true,
                 updateOnContentResize: false,
+                updateOnImageLoad: true,
+                updateOnSelectorChange: "ul li",
+                extraDraggableSelectors: ".myClass",
+                releaseDraggableSelectors: ".myClass",
+                autoUpdateTimeout:60,
                 autoExpandHorizontalScroll: false,
-                autoScrollOnFocus: true,
-                normalizeMouseWheelDelta: false
+                autoScrollOnFocus: "input",
             },
             contentTouchScroll: true,
+            documentTouchScroll: false,
+
             callbacks: {
+                onCreate: () => { },
+                onInit: () => { },
                 onScrollStart: () => { },
                 onScroll: () => { },
                 onTotalScroll: () => { },
                 onTotalScrollBack: () => { },
                 onTotalScrollOffset: 0,
                 onTotalScrollBackOffset: 0,
-                whileScrolling: () => { }
+                whileScrolling: () => { },
+                alwaysTriggerOffsets: false,
+                onOverflowY: () => { },
+                onOverflowX: () => { },
+                onOverflowYNone: () => {},
+                onOverflowXNone: () => {},
+                onBeforeUpdate: () => {},
+                onUpdate: () => {},
+                onImageLoad: () => {},
+                onSelectorChange: () => {},
             },
-            theme: "light"
+            theme: "light",
+            live: true,
+            liveSelector: ".myClass"
         });
     }
 }
diff --git a/mCustomScrollbar/mCustomScrollbar.d.ts b/mCustomScrollbar/mCustomScrollbar.d.ts
index 51c7c1852f..aa088d6f5c 100644
--- a/mCustomScrollbar/mCustomScrollbar.d.ts
+++ b/mCustomScrollbar/mCustomScrollbar.d.ts
@@ -10,11 +10,11 @@ declare namespace MCustomScrollbar {
         /**
         * Set the width of your content (overwrites CSS width), value in pixels (integer) or percentage (string)
         */
-        setWidth?: number|string;
+        setWidth?: boolean|number|string;
         /**
         * Set the height of your content (overwirtes CSS height), value in pixels (integer) or percentage (string)
         */
-        setHeight?: number|string;
+        setHeight?: boolean|number|string;
         /**
         * Set the initial css top property of content, accepts string values (css top position).
         * Example: setTop: "-100px".
@@ -38,7 +38,7 @@ declare namespace MCustomScrollbar {
         * Note that setting the value to "outside" requires your element (or parent elements) 
         * to have CSS position: relative (otherwise the scrollbar will be positioned in relation to document’s root element).
         */
-        scrollbarPosition: "inside"|"outside";
+        scrollbarPosition?: "inside"|"outside";
         /**
         * Always keep scrollbar(s) visible, even when there’s nothing to scroll.
         * 0 – disable (default)
@@ -52,7 +52,7 @@ declare namespace MCustomScrollbar {
         * Note that your elements must be of equal width or height in order for this to work properly.
         * To set different values for vertical and horizontal scrolling, use an array: [y,x]
         */
-        snapAmount?: number; 
+        snapAmount?: number|[number,number];
         /**
         * Set an offset (in pixels) for the snapAmount option. Useful when for example you need to offset the 
         * snap amount of table rows by the table header.
@@ -112,7 +112,7 @@ declare namespace MCustomScrollbar {
         /**
         * Keyboard support 
         */
-        keyboard:{
+        keyboard?:{
             /**
              * Enable or disable content scrolling via keyboard.
              */
@@ -155,7 +155,7 @@ declare namespace MCustomScrollbar {
             /**
             * Set a tabindex value for the buttons.
             */
-            tabIndex?: number;
+            tabindex?: number;
             /**
             * Scroll buttons pixels scrolling amount, value in pixels or "auto"
             */
@@ -225,6 +225,10 @@ declare namespace MCustomScrollbar {
         * Integer values define the axis-specific minimum amount required for scrolling momentum (default: 25).
         */
         contentTouchScroll?: boolean|number;
+        /**
+         * Enable or disable document touch-swipe scrolling for touch-enabled devices.
+         */
+        documentTouchScroll?: boolean;
         /**
         * All of the following callbacks option have examples in the callback demo - http://manos.malihu.gr/tuts/custom-scrollbar-plugin/callbacks_example.html
         */
@@ -304,7 +308,7 @@ declare namespace MCustomScrollbar {
             /**
             * A function to call each time a type of element is added, removed or changes its size and scrollbar(s) are updated.
             */
-            onSelctorChange?: () => void;
+            onSelectorChange?: () => void;
         }
         /**
         * Set a scrollbar ready-to-use theme. See themes demo for all themes - http://manos.malihu.gr/tuts/custom-scrollbar-plugin/scrollbar_themes_demo.html

From 009fbfc2167d2f27a436f8a049dd0925db9eff2d Mon Sep 17 00:00:00 2001
From: Mike Winfield <mike@acs-solutions.co.uk>
Date: Mon, 6 Jun 2016 17:00:22 +0100
Subject: [PATCH 098/278] Various adjustments for react-bootstrap v0.29.4 +
 inexhaustive curation

---
 react-bootstrap/react-bootstrap.d.ts | 650 +++++++++++++++++----------
 1 file changed, 419 insertions(+), 231 deletions(-)

diff --git a/react-bootstrap/react-bootstrap.d.ts b/react-bootstrap/react-bootstrap.d.ts
index fc9fd60a2c..ca0fa37faa 100644
--- a/react-bootstrap/react-bootstrap.d.ts
+++ b/react-bootstrap/react-bootstrap.d.ts
@@ -10,105 +10,35 @@ declare module "react-bootstrap" {
     import React = require("react");
 
 
-    // <Button />
-    // ----------------------------------------
-    interface ButtonProps extends React.HTMLProps<Button> {
+    type Sizes = 'xs' | 'xsmall' | 'sm' | 'small' | 'lg' | 'large';
 
-        // Optional
-        active?: boolean;
-        block?: boolean;
-        bsStyle?: string;
-        bsSize?: string;
-        navItem?: boolean;
-        navDropdown?: boolean;
-        componentClass?: React.ReactType;
-    }
-    type Button = React.ClassicComponent<ButtonProps, {}>;
-    var Button: React.ClassicComponentClass<ButtonProps>;
 
-    // <ButtonToolbar />
-    // ----------------------------------------
-    interface ButtonToolbarProps extends React.HTMLProps<ButtonToolbar> {
-
-        // Optional
-        block?: boolean;
-        bsSize?: string;
-        bsStyle?: string;
-        justified?: boolean;
-        vertical?: boolean;
-    }
-    type ButtonToolbar = React.ClassicComponent<ButtonToolbarProps, {}>;
-    var ButtonToolbar: React.ClassicComponentClass<ButtonToolbarProps>;
-
-    // <ButtonGroup />
-    // ----------------------------------------
-    interface ButtonGroupProps extends React.HTMLProps<ButtonGroup> {
-        // Optional
-        block?: boolean;
-        bsSize?: string;
-        bsStyle?: string;
-        justified?: boolean;
-        vertical?: boolean;
-    }
-    type ButtonGroup = React.ClassicComponent<ButtonGroupProps, {}>;
-    var ButtonGroup: React.ClassicComponentClass<ButtonGroupProps>;
-
-    // <DropdownButton />
-    // ----------------------------------------
-    interface DropdownButtonProps extends React.HTMLProps<DropdownButton> {
-        bsStyle?: string;
-        bsSize?: string;
-        buttonClassName?: string;
-        dropup?: boolean;
-        navItem?: boolean;
-        noCaret?: boolean;
-        pullRight?: boolean;
-    }
-    class DropdownButton extends React.Component<DropdownButtonProps, {}> {
+    // Change onSelect signature to be (eventKey: any, event: SyntheticEvent) => any on all React-Bootstrap components, instead of the old inconsistent mishmash (#1604, #1677, #1756)
+    /** ( eventKey:any, e:React.SyntheticEvent ):void */
+    interface SelectCallback {
+        ( eventKey:any, e:React.SyntheticEvent ):void;
+        /**
+            @deprecated
+            This signature is a hack so can still derive from HTMLProps.
+            It does not reflect the underlying event and should not be used.
+        */
+        ( e:React.MouseEvent ):void;
     }
 
-    // <SplitButton />
-    // ----------------------------------------
-    interface SplitButtonProps extends React.HTMLProps<SplitButton> {
-        bsStyle?: string;
-        bsSize?: string;
-        dropdownTitle?: any; // TODO: Add more specific type
-        dropup?: boolean;
-        pullRight?: boolean;
-    }
-    class SplitButton extends React.Component<SplitButtonProps, {}> {
+
+    interface TransitionCallbacks {
+      onEnter?: Function;
+      onEntered?: Function;
+      onEntering?: Function;
+      onExit?: Function;
+      onExited?: Function;
+      onExiting?: Function;
     }
 
-    // <MenuItem />
-    // ----------------------------------------
-    interface MenuItemProps extends React.HTMLProps<MenuItem> {
-        active?: boolean;
-        divider?: boolean;
-        eventKey?: any;
-        header?: boolean;
-    }
-    class MenuItem extends React.Component<MenuItemProps, {}> {
-    }
-
-    // <Panel />
-    // ----------------------------------------
-    interface PanelProps extends React.HTMLProps<Panel> {
-        bsSize?: string;
-        bsStyle?: string;
-        collapsible?: boolean;
-        defaultExpanded?: boolean;
-        eventKey?: any;
-        expanded?: boolean;
-        footer?: any; // TODO: Add more specific type
-        header?: any; // TODO: Add more specific type
-    }
-    type Panel = React.ClassicComponent<PanelProps, {}>;
-    var Panel: React.ClassicComponentClass<PanelProps>;
 
     // <Accordion />
-    // ----------------------------------------
     interface AccordionProps extends React.HTMLProps<Accordion> {
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         collapsible?: boolean;
         defaultExpanded?: boolean;
@@ -120,29 +50,289 @@ declare module "react-bootstrap" {
     type Accordion = React.ClassicComponent<AccordionProps, {}>;
     var Accordion: React.ClassicComponentClass<AccordionProps>;
 
+
+    // <Breadcrumb />
+    interface BreadcrumbProps
+        extends React.Props<Breadcrumb>
+    {
+        bsClass?: string;
+    }
+    interface BreadcrumbClass
+        extends React.ClassicComponentClass<BreadcrumbProps>
+    {
+        Item: typeof BreadcrumbItem;
+    }
+    type Breadcrumb = React.ClassicComponent<BreadcrumbProps, {}>;
+    var Breadcrumb: BreadcrumbClass;
+
+
+    // <BreadcrumbItem />
+    interface BreadcrumbItemProps
+        extends React.Props<BreadcrumbItem>
+    {
+        active?: boolean;
+        id?: string | number;
+        linkId?: string | number;
+        href?: string;
+        title?: React.ReactNode;
+        target?: string;
+    }
+    type BreadcrumbItem = React.ClassicComponent<BreadcrumbItemProps, {}>;
+    var BreadcrumbItem: React.ClassicComponentClass<BreadcrumbItemProps>;
+
+
+    // <Button />
+    interface ButtonProps
+        extends React.HTMLProps<Button>
+    {
+        active?: boolean;
+        block?: boolean;
+        bsStyle?: string;
+        bsSize?: Sizes;
+        navItem?: boolean;
+        navDropdown?: boolean;
+        componentClass?: React.ReactType;
+    }
+    type Button = React.ClassicComponent<ButtonProps, {}>;
+    var Button: React.ClassicComponentClass<ButtonProps>;
+
+
+    // <ButtonToolbar />
+    interface ButtonToolbarProps
+        extends React.HTMLProps<ButtonToolbar>
+    {
+        block?: boolean;
+        bsSize?: Sizes;
+        bsStyle?: string;
+        justified?: boolean;
+        vertical?: boolean;
+    }
+    type ButtonToolbar = React.ClassicComponent<ButtonToolbarProps, {}>;
+    var ButtonToolbar: React.ClassicComponentClass<ButtonToolbarProps>;
+
+
+    // <ButtonGroup />
+    interface ButtonGroupProps
+        extends React.HTMLProps<ButtonGroup>
+    {
+        block?: boolean;
+        bsSize?: Sizes;
+        bsStyle?: string;
+        justified?: boolean;
+        vertical?: boolean;
+    }
+    type ButtonGroup = React.ClassicComponent<ButtonGroupProps, {}>;
+    var ButtonGroup: React.ClassicComponentClass<ButtonGroupProps>;
+
+
+    // <Checkbox />
+    interface CheckboxProps
+        extends React.HTMLProps<Checkbox>
+    {
+        bsClass?: string;
+        disabled?: boolean;
+        inline?: boolean;
+        inputRef?: ( instance:HTMLInputElement ) => void;
+        validationState?: "success" | "warning" | "error";
+    }
+    class Checkbox
+        extends React.Component<CheckboxProps, {}>
+    { }
+
+
+    // <Clearfix />
+    interface ClearfixProps
+        extends React.HTMLProps<Clearfix>
+    {
+        componentClass?: React.ReactType,
+        visibleXsBlock?: boolean;
+        visibleSmBlock?: boolean;
+        visibleMdBlock?: boolean;
+        visibleLgBlock?: boolean;
+    }
+    class Clearfix
+        extends React.Component<ClearfixProps, {}>
+    { }
+
+
+    // <Collapse />
+    interface CollapseProps
+        extends TransitionCallbacks, React.Props<CollapseClass>
+    {
+        dimension?: 'height' | 'width' | { ( ):string };
+        getDimensionValue?: ( dimension:number, element:React.ReactElement<any> ) => number;
+        in?: boolean;
+        timeout?: number;
+        transitionAppear?: boolean;
+        unmountOnExit?: boolean;
+    }
+    class Collapse
+        extends React.Component<CollapseProps, {}>
+    { }
+
+
+    // <Dropdown />
+    interface DropdownBaseProps {
+        bsClass?: string;
+        componentClass?: React.ReactType;
+        disabled?: boolean;
+        dropup?: boolean;
+        id: string;
+        onClose?: Function;
+        onSelect?: SelectCallback;
+        onToggle?: ( isOpen:boolean ) => void;
+        open?: boolean;
+        pullRight?: boolean;
+        role?: string;
+    }
+    type DropdownProps = DropdownBaseProps & React.HTMLProps<Dropdown>;
+    class Dropdown
+        extends React.Component<DropdownProps, any>
+    {
+        public static Menu: typeof DropdownMenu;
+        public static Toggle: typeof DropdownToggle;
+    }
+
+
+    // <DropdownButton />
+    interface DropdownButtonBaseProps
+        extends DropdownBaseProps
+    {
+        bsSize?: Sizes;
+        bsStyle?: string;
+        navItem?: boolean;
+        noCaret?: boolean;
+        pullRight?: boolean;
+    }
+    type DropdownButtonProps = DropdownButtonBaseProps & React.HTMLProps<DropdownButton>;
+    class DropdownButton
+        extends React.Component<DropdownButtonProps, {}>
+    { }
+
+
+    // <Dropdown.Menu />
+    interface DropdownMenuProps
+        extends React.HTMLProps<DropdownMenu>
+    {
+        labelledBy?: string | number;
+        onClose?: Function;
+        onSelect?: SelectCallback;
+        open?: boolean;
+        pullRight?: boolean;
+    }
+    class DropdownMenu
+        extends React.Component<DropdownMenuProps, any>
+    { }
+
+
+    // <Dropdown.Toggle />
+    interface DropdownToggleProps
+        extends React.HTMLProps<DropdownToggle>
+    {
+        bsRole?: string;
+        noCaret?: boolean;
+        open?: boolean;
+        title?: string;
+        useAnchor?: boolean;
+    }
+    class DropdownToggle
+        extends React.Component<DropdownToggleProps, any>
+    { }
+
+
+    // <Fade />
+    interface FadeProps
+        extends TransitionCallbacks, React.Props<Fade>
+    {
+        in?: boolean;
+        timeout?: number;
+        transitionAppear?: boolean;
+        unmountOnExit?: boolean;
+    }
+    class Fade
+        extends React.Component<FadeProps, {}>
+    { }
+
+
+    // <MenuItem />
+    interface MenuItemProps
+        extends React.HTMLProps<MenuItem>
+    {
+        active?: boolean;
+        bsClass?: string;
+        disabled?: boolean;
+        divider?: boolean;
+        eventKey?: any;
+        header?: boolean;
+        onClick?: React.MouseEventHandler;
+        onSelect?: SelectCallback;
+        target?: string;
+        title?: string;
+    }
+    class MenuItem
+        extends React.Component<MenuItemProps, {}>
+    { }
+
+
+    // <Panel />
+    interface PanelProps
+        extends TransitionCallbacks, React.HTMLProps<Panel>
+    {
+        bsClass?: string;
+        bsSize?: Sizes;
+        bsStyle?: string;
+        collapsible?: boolean;
+        defaultExpanded?: boolean;
+        eventKey?: any;
+        expanded?: boolean;
+        footer?: React.ReactNode;
+        header?: React.ReactNode;
+        onSelect?: SelectCallback;
+    }
+    type Panel = React.ClassicComponent<PanelProps, {}>;
+    var Panel: React.ClassicComponentClass<PanelProps>;
+
+
     // <PanelGroup />
-    // ----------------------------------------
-    interface PanelGroupProps extends React.HTMLProps<PanelGroup> {
+    interface PanelGroupProps
+        extends React.HTMLProps<PanelGroup>
+    {
         accordion?: boolean;
         activeKey?: any;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         defaultActiveKey?: any;
+        onSelect?: SelectCallback;
     }
     type PanelGroup = React.ClassicComponent<PanelGroupProps, {}>;
     var PanelGroup: React.ClassicComponentClass<PanelGroupProps>;
 
+
+    // <SplitButton />
+    interface SplitButtonProps
+        extends React.HTMLProps<SplitButton>
+    {
+        bsStyle?: string;
+        bsSize?: Sizes;
+        dropdownTitle?: any; // TODO: Add more specific type
+        dropup?: boolean;
+        pullRight?: boolean;
+    }
+    class SplitButton
+        extends React.Component<SplitButtonProps, {}>
+    { }
+
+
     // <Modal.Dialog />
-    // ----------------------------------------
     interface ModalDialogProps extends React.HTMLProps<ModalDialog> {
         // TODO: Add more specific type
     }
     type ModalDialog = React.ClassicComponent<ModalDialogProps, {}>;
     var ModalDialog: React.ClassicComponentClass<ModalDialogProps>;
 
+
     // <Modal.Header />
-    // ----------------------------------------
-  interface ModalHeaderProps extends React.HTMLProps<ModalHeader> {
+    interface ModalHeaderProps extends React.HTMLProps<ModalHeader> {
         closeButton?: boolean;
         modalClassName?: string;
         onHide?: Function;
@@ -151,8 +341,8 @@ declare module "react-bootstrap" {
     class ModalHeader extends React.Component<ModalHeaderProps, {}> {
     }
 
+
     // <Modal.Title/>
-    // ----------------------------------------
     interface ModalTitleProps extends React.HTMLProps<ModalTitle> {
         modalClassName?: string;
     }
@@ -160,7 +350,6 @@ declare module "react-bootstrap" {
     }
 
     // <Modal.Body />
-    // ----------------------------------------
     interface ModalBodyProps extends React.HTMLProps<ModalBody> {
         modalClassName?: string;
     }
@@ -168,7 +357,6 @@ declare module "react-bootstrap" {
     }
 
     // <Modal.Footer />
-    // ----------------------------------------
     interface ModalFooterProps extends React.HTMLProps<ModalFooter> {
         modalClassName?: string;
     }
@@ -176,7 +364,6 @@ declare module "react-bootstrap" {
     }
 
     // <Modal />
-    // ----------------------------------------
     interface ModalProps extends React.HTMLProps<Modal> {
         // Required
         onHide: Function;
@@ -184,7 +371,7 @@ declare module "react-bootstrap" {
         // Optional
         animation?: boolean;
         backdrop?: boolean|string;
-        bsSize?: string;
+        bsSize?: Sizes;
         container?: any; // TODO: Add more specific type
         dialogClassName?: string;
         dialogComponent?: any; // TODO: Add more specific type
@@ -210,7 +397,6 @@ declare module "react-bootstrap" {
 
 
     // <OverlayTrigger />
-    // ----------------------------------------
     interface OverlayTriggerProps {
         // Required
         overlay: any; // TODO: Add more specific type
@@ -237,12 +423,11 @@ declare module "react-bootstrap" {
     var OverlayTrigger: React.ClassicComponentClass<OverlayTriggerProps>;
 
     // <Tooltip />
-    // ----------------------------------------
     interface TooltipProps extends React.HTMLProps<Tooltip> {
         // Optional
         arrowOffsetLeft?: number | string;
         arrowOffsetTop?: number | string;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         placement?: string;
         positionLeft?: number;
@@ -252,12 +437,11 @@ declare module "react-bootstrap" {
     var Tooltip: React.ClassicComponentClass<TooltipProps>;
 
     // <Popover/>
-    // ----------------------------------------
     interface PopoverProps  extends React.HTMLProps<Popover> {
         // Optional
         arrowOffsetLeft?: number | string;
         arrowOffsetTop?: number | string;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         placement?: string;
         positionLeft?: number;
@@ -267,7 +451,6 @@ declare module "react-bootstrap" {
     var Popover: React.ClassicComponentClass<PopoverProps>;
 
     // <Overlay />
-    // ----------------------------------------
     interface OverlayProps {
         // Optional
         animation?: any; // TODO: Add more specific type
@@ -289,11 +472,10 @@ declare module "react-bootstrap" {
     }
 
     // <ProgressBar />
-    // ----------------------------------------
     interface ProgressBarProps extends React.HTMLProps<ProgressBar> {
         // Optional
         active?: boolean;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         interpolatedClass?: any; // TODO: Add more specific type
         max?: number;
@@ -306,13 +488,12 @@ declare module "react-bootstrap" {
     }
 
     // <Nav />
-    // ----------------------------------------
-    // TODO: This one turned into a union of two different types
+        // TODO: This one turned into a union of two different types
     interface NavProps extends React.HTMLProps<Nav> {
         // Optional
         activeHref?: string;
         activeKey?: any;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         collapsible?: boolean;
         eventKey?: any;
@@ -329,11 +510,10 @@ declare module "react-bootstrap" {
     }
 
     // <NavItem />
-    // ----------------------------------------
     interface NavItemProps extends React.HTMLProps<NavItem> {
         active?: boolean;
         brand?: any; // TODO: Add more specific type
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         componentClass?: React.ReactType;
         defaultNavExpanded?: boolean;
@@ -344,6 +524,7 @@ declare module "react-bootstrap" {
         inverse?: boolean;
         linkId?: string;
         navExpanded?: boolean;
+        onSelect?: SelectCallback;
         onToggle?: Function;
         staticTop?: boolean;
         toggleButton?: any; // TODO: Add more specific type
@@ -353,38 +534,33 @@ declare module "react-bootstrap" {
     var NavItem: React.ClassicComponentClass<NavItemProps>;
 
     // <Navbar.Brand />
-    // ----------------------------------------
     interface NavbarBrandProps extends React.HTMLProps<NavbarBrand> {
     }
     class NavbarBrand extends React.Component<NavbarBrandProps, {}> {
     }
 
     // <Navbar.Collapse />
-    // ----------------------------------------
     interface NavbarCollapseProps {
     }
     type NavbarCollapse = React.ClassicComponent<NavbarCollapseProps, {}>;
     var NavbarCollapse: React.ClassicComponentClass<NavbarCollapseProps>;
 
     // <Navbar.Header />
-    // ----------------------------------------
     interface NavbarHeaderProps extends React.HTMLProps<NavbarHeader> {
     }
     type NavbarHeader = React.ClassicComponent<NavbarHeaderProps, {}>;
     var NavbarHeader: React.ClassicComponentClass<NavbarHeaderProps>;
 
     // <Navbar.Toggle />
-    // ----------------------------------------
     interface NavbarToggleProps {
     }
     type NavbarToggle = React.ClassicComponent<NavbarToggleProps, {}>;
     var NavbarToggle: React.ClassicComponentClass<NavbarToggleProps>;
 
     // <Navbar />
-    // ----------------------------------------
     interface NavbarProps extends React.HTMLProps<Navbar> {
         brand?: any; // TODO: Add more specific type
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         componentClass?: React.ReactType;
         defaultNavExpanded?: boolean;
@@ -407,30 +583,35 @@ declare module "react-bootstrap" {
     type Navbar = React.ClassicComponent<NavbarProps, {}>;
     var Navbar: NavbarClass;
 
+
     // <NavDropdown />
-    // ----------------------------------------
-    interface NavDropdownProps extends React.HTMLProps<NavDropdown> {
-        eventKey?: any;
-    }
-    class NavDropdown extends React.Component<NavDropdownProps, {}> {
+    interface NavDropdownBaseProps
+        extends DropdownBaseProps
+    {
+        noCaret?: boolean;
     }
+    type NavDropdownProps = NavDropdownBaseProps & React.HTMLProps<NavDropdown>;
+    class NavDropdown
+        extends React.Component<NavDropdownProps, {}>
+    { }
+
 
     // <Tabs />
-    // ----------------------------------------
     interface TabsProps extends React.HTMLProps<Tabs> {
         activeKey?: any;
         animation?: boolean;
         bsStyle?: string;
         defaultActiveKey?: any;
+        onSelect?: SelectCallback;
         paneWidth?: any; // TODO: Add more specific type
         position?: string;
         tabWidth?: any; // TODO: Add more specific type
+        unmountOnExit?: boolean;
     }
     type Tabs = React.ClassicComponent<TabsProps, {}>;
     var Tabs: React.ClassicComponentClass<TabsProps>;
 
     // <Tab />
-    // ----------------------------------------
     interface TabProps extends React.HTMLProps<Tab> {
         animation?: boolean;
         eventKey?: any; // TODO: Add more specific type
@@ -438,75 +619,92 @@ declare module "react-bootstrap" {
     type Tab = React.ClassicComponent<TabProps, {}>;
     var Tab: React.ClassicComponentClass<TabProps>;
 
+
     // <Pager />
-    // ----------------------------------------
-    interface PagerProps extends React.HTMLProps<Pager> {
+    interface PagerProps
+        extends React.HTMLProps<Pager>
+    {
+        onSelect?: SelectCallback;
     }
     type Pager = React.ClassicComponent<PagerProps, {}>;
     var Pager: React.ClassicComponentClass<PagerProps>;
 
+
     // <PageItem />
-    // ----------------------------------------
-    interface PageItemProps extends React.HTMLProps<PageItem> {
+    interface PageItemProps
+        extends React.HTMLProps<PageItem>
+    {
+        disabled?: boolean;
         eventKey?: any;
         next?: boolean;
+        onSelect?: SelectCallback;
         previous?: boolean;
+        target?: string;
     }
     type PageItem = React.ClassicComponent<PageItemProps, {}>;
     var PageItem: React.ClassicComponentClass<PageItemProps>;
 
+
     // <Pagination />
-    // ----------------------------------------
-    interface PaginationProps extends React.HTMLProps<Pagination> {
+    interface PaginationProps
+        extends React.HTMLProps<Pagination>
+    {
         activePage?: number;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
+        boundaryLinks?: boolean;
         buttonComponentClass?: React.ReactType;
-        ellipsis?: boolean;
-        first?: boolean;
+        ellipsis?: React.ReactNode;
+        first?: React.ReactNode;
         items?: number;
-        last?: boolean;
+        last?: React.ReactNode;
         maxButtons?: number;
-        next?: boolean;
-        prev?: boolean;
+        next?: React.ReactNode;
+        onSelect?: SelectCallback;
+        prev?: React.ReactNode;
     }
     type Pagination = React.ClassicComponent<PaginationProps, {}>;
     var Pagination: React.ClassicComponentClass<PaginationProps>;
 
+
     // <Alert />
-    // ----------------------------------------
     interface AlertProps extends React.HTMLProps<Alert> {
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         closeLabel?: string;
-        dismissAfter?: number;
+        /** @deprecated since v0.29.0 */ dismissAfter?: number;
         onDismiss?: Function;
     }
     type Alert = React.ClassicComponent<AlertProps, {}>;
     var Alert: React.ClassicComponentClass<AlertProps>;
 
+
     // <Carousel />
-    // ----------------------------------------
     interface CarouselProps extends React.HTMLProps<Carousel> {
         activeIndex?: number;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         controls?: boolean;
         defaultActiveIndex?: number;
         direction?: string;
         indicators?: boolean;
         interval?: number;
-        nextIcon?: any; // TODO: Add more specific type
+        nextIcon?: React.ReactNode;
+        onSelect?: SelectCallback;
         onSlideEnd?: Function;
         pauseOnHover?: boolean;
-        prevIcon?: any; // TODO: Add more specific type
+        prevIcon?: React.ReactNode;
         slide?: boolean;
+        // wrap?: boolean;
+    }
+    interface CarouselClass extends React.ClassicComponentClass<CarouselProps> {
+      Caption: typeof CarouselCaption;
+      Item: typeof CarouselItem;
     }
     type Carousel = React.ClassicComponent<CarouselProps, {}>;
-    var Carousel: React.ClassicComponentClass<CarouselProps>;
+    var Carousel: CarouselClass;
 
     // <CarouselItem />
-    // ----------------------------------------
     interface CarouselItemProps extends React.HTMLProps<CarouselItem> {
         active?: boolean;
         animtateIn?: boolean;
@@ -519,8 +717,14 @@ declare module "react-bootstrap" {
     type CarouselItem = React.ClassicComponent<CarouselItemProps, {}>;
     var CarouselItem: React.ClassicComponentClass<CarouselItemProps>;
 
+    // <CarouselCaption />
+    interface CarouselCaptionProps extends React.HTMLProps<CarouselCaption> {
+      componentClass?: React.ReactType;
+    }
+    type CarouselCaption = React.ClassicComponent<CarouselCaptionProps, {}>;
+    var CarouselCaption: React.ClassicComponentClass<CarouselCaptionProps>;
+
     // <Grid />
-    // ----------------------------------------
     interface GridProps extends React.HTMLProps<Grid> {
         componentClass?: React.ReactType;
         fluid?: boolean;
@@ -529,7 +733,6 @@ declare module "react-bootstrap" {
     var Grid: React.ClassicComponentClass<GridProps>;
 
     // <Row />
-    // ----------------------------------------
     interface RowProps extends React.HTMLProps<Row> {
         componentClass?: React.ReactType;
     }
@@ -537,7 +740,6 @@ declare module "react-bootstrap" {
     var Row: React.ClassicComponentClass<RowProps>;
 
     // <Col />
-    // ----------------------------------------
     interface ColProps extends React.HTMLProps<Col> {
         componentClass?: React.ReactType;
         lg?: number;
@@ -565,16 +767,14 @@ declare module "react-bootstrap" {
     var Col: React.ClassicComponentClass<ColProps>;
 
     // <Thumbnail />
-    // ----------------------------------------
     interface ThumbnailProps extends React.HTMLProps<Thumbnail> {
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
     }
     type Thumbnail = React.ClassicComponent<ThumbnailProps, {}>;
     var Thumbnail: React.ClassicComponentClass<ThumbnailProps>;
 
     // <ListGroup />
-    // ----------------------------------------
     interface ListGroupProps extends React.HTMLProps<ListGroup> {
         fill?: boolean; // TODO: Add more specific type
     }
@@ -582,10 +782,9 @@ declare module "react-bootstrap" {
     }
 
     // <ListGroupItem />
-    // ----------------------------------------
     interface ListGroupItemProps extends React.HTMLProps<ListGroupItem> {
         active?: any;
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         eventKey?: any;
         header?: any; // TODO: Add more specific type
@@ -596,16 +795,14 @@ declare module "react-bootstrap" {
     }
 
     // <Label />
-    // ----------------------------------------
     interface LabelProps extends React.HTMLProps<Label> {
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
     }
     class Label extends React.Component<LabelProps, {}> {
     }
 
     // <Badge />
-    // ----------------------------------------
     interface BadgeProps extends React.HTMLProps<Badge> {
         pullRight?: boolean;
     }
@@ -613,7 +810,6 @@ declare module "react-bootstrap" {
     var Badge: React.ClassicComponentClass<BadgeProps>;
 
     // <Jumbotron />
-    // ----------------------------------------
     interface JumbotronProps extends React.HTMLProps<Jumbotron> {
         componentClass?: React.ReactType;
     }
@@ -621,23 +817,20 @@ declare module "react-bootstrap" {
     var Jumbotron: React.ClassicComponentClass<JumbotronProps>;
 
     // <PageHeader />
-    // ----------------------------------------
     interface PageHeaderProps extends React.HTMLProps<PageHeader> {
     }
     class PageHeader extends React.Component<PageHeaderProps, {}> {
     }
 
     // <Well />
-    // ----------------------------------------
     interface WellProps extends React.HTMLProps<Well> {
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
     }
     class Well extends React.Component<WellProps, {}> {
     }
 
     // <Glyphicon />
-    // ----------------------------------------
     interface GlyphiconProps extends React.HTMLProps<Glyphicon> {
         // Required
         glyph: string;
@@ -646,7 +839,6 @@ declare module "react-bootstrap" {
     var Glyphicon: React.ClassicComponentClass<GlyphiconProps>;
 
     // <Table />
-    // ----------------------------------------
     interface TableProps extends React.HTMLProps<Table> {
         bordered?: boolean;
         condensed?: boolean;
@@ -658,12 +850,11 @@ declare module "react-bootstrap" {
     var Table: React.ClassicComponentClass<TableProps>;
 
     // <Input />
-    // ----------------------------------------
     interface InputProps extends React.HTMLProps<Input> {
         defaultValue?:string;
         addonAfter?: any; // TODO: Add more specific type
         addonBefore?: any; // TODO: Add more specific type
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         buttonAfter?: any; // TODO: Add more specific type
         buttonBefore?: any; // TODO: Add more specific type
@@ -674,16 +865,15 @@ declare module "react-bootstrap" {
         labelClassName?: string;
         wrapperClassName?: string;
     }
-    // TODO: extends InputBase
+    /** @deprecated since v0.29.0 */
     class Input extends React.Component<InputProps, {}> {
     }
 
     // <ButtonInput />
-    // ----------------------------------------
     interface ButtonInputProps extends React.HTMLProps<ButtonInput> {
         addonAfter?: any; // TODO: Add more specific type
         addonBefore?: any; // TODO: Add more specific type
-        bsSize?: string;
+        bsSize?: Sizes;
         bsStyle?: string;
         buttonAfter?: any; // TODO: Add more specific type
         buttonBefore?: any; // TODO: Add more specific type
@@ -694,24 +884,45 @@ declare module "react-bootstrap" {
         labelClassName?: string;
         wrapperClassName?: string;
     }
-    // TODO: extends InputBase
+    /** @deprecated since v0.29.0 */
     class ButtonInput extends React.Component<ButtonInputProps, {}> {
     }
 
 
-    // <FormControls.Static />
-    // ----------------------------------------
-
-    interface StaticProps extends React.HTMLProps<Static> {}
-    interface Static extends React.ReactElement<StaticProps> { }
-    interface StaticClass extends React.ComponentClass<StaticProps> { }
-    interface FormControlsClass {
-      Static: StaticClass;
+    // <InputGroup />
+    interface InputGroupProps
+        extends React.HTMLProps<InputGroup>
+    {
+        bsClass?: string;
+        bsSize?: Sizes;
     }
-    var FormControls: FormControlsClass;
+    interface InputGroupClass
+        extends React.ClassicComponentClass<InputGroupProps>
+    {
+        Addon: typeof InputGroupAddon;
+        Button: typeof InputGroupButton;
+    }
+    type InputGroup = React.ClassicComponent<InputGroupProps, {}>;
+    var InputGroup: React.ClassicComponentClass<InputGroupProps>;
+
+
+    // <InputGroup.Addon />
+    interface InputGroupAddonProps
+        extends React.HTMLProps<InputGroupAddon>
+    { }
+    type InputGroupAddon = React.ClassicComponent<InputGroupAddonProps, {}>;
+    var InputGroupAddon: React.ClassicComponentClass<InputGroupAddonProps>;
+
+
+    // <InputGroup.Button />
+    interface InputGroupButtonProps
+        extends React.HTMLProps<InputGroupButton>
+    { }
+    type InputGroupButton = React.ClassicComponent<InputGroupButtonProps, {}>;
+    var InputGroupButton: React.ClassicComponentClass<InputGroupButtonProps>;
+
 
     // <Form />
-    // ----------------------------------------
     interface FormProps extends React.HTMLProps<Form> {
         bsClass?: string;
         componentClass?: React.ReactType;
@@ -721,17 +932,15 @@ declare module "react-bootstrap" {
     class Form extends React.Component<FormProps, {}> {}
 
     // <FormGroup />
-    // ----------------------------------------
     interface FormGroupProps extends React.HTMLProps<FormGroup> {
         bsClass?: string;
-        bsSize?: "sm" | "small" | "lg" | "large";
+        bsSize?: Sizes;
         controlId?: string;
         validationState?: "success" | "warning" | "error";
     }
     class FormGroup extends React.Component<FormGroupProps, {}> {}
 
     // <ControlLabel />
-    // ----------------------------------------
     interface ControlLabelProps extends React.HTMLProps<ControlLabel> {
         bsClass?: string;
         htmlFor?: string;
@@ -739,15 +948,7 @@ declare module "react-bootstrap" {
     }
     class ControlLabel extends React.Component<ControlLabelProps, {}> {}
 
-    // <FormControl.Feedback />
-    // ----------------------------------------
-    interface FormControlFeedbackProps extends React.HTMLProps<FormControlFeedback> {
-    }
-    class FormControlFeedback extends React.Component<FormControlFeedbackProps, {}> {
-    }
-
     // <FormControl />
-    // ----------------------------------------
     interface FormControlProps extends React.HTMLProps<FormControl> {
         bsClass?: string;
         componentClass?: React.ReactType;
@@ -756,40 +957,49 @@ declare module "react-bootstrap" {
     }
     interface FormControlClass extends React.ClassicComponentClass<FormControlProps> {
         Feedback: typeof FormControlFeedback;
+        Static: typeof FormControlStatic;
     }
     type FormControl = React.Component<FormControlProps, {}>;
     var FormControl: FormControlClass;
 
+    // <FormControl.Feedback />
+    interface FormControlFeedbackProps extends React.HTMLProps<FormControlFeedback> {
+    }
+    class FormControlFeedback extends React.Component<FormControlFeedbackProps, {}> {
+    }
+
+    // <FormControl.Static />
+    interface FormControlStaticProps extends React.HTMLProps<FormControlStatic> {
+      bsClass?: string;
+      componentClass?: React.ReactType;
+    }
+    class FormControlStatic extends React.Component<FormControlStaticProps, {}> { }
+
+
     // <HelpBlock />
-    // ----------------------------------------
     interface HelpBlockProps extends React.HTMLProps<HelpBlock> {
         bsClass?: string;
     }
     class HelpBlock extends React.Component<HelpBlockProps, {}> {}
 
-    // <Checkbox />
-    // ----------------------------------------
-    interface CheckboxProps extends React.HTMLProps<Checkbox> {
-        bsClass?: string;
-        disabled?: boolean;
-        inline?: boolean;
-        validationState?: "success" | "warning" | "error";
-    }
-    class Checkbox extends React.Component<CheckboxProps, {}> {}
 
     // <Radio />
-    // ----------------------------------------
-    interface RadioProps extends React.HTMLProps<Radio> {
+    interface RadioProps
+        extends React.HTMLProps<Radio>
+    {
         bsClass?: string;
         disabled?: boolean;
         inline?: boolean;
+        inputRef?: ( instance:HTMLInputElement ) => void;
         validationState?: "success" | "warning" | "error";
     }
-    class Radio extends React.Component<RadioProps, {}> {}
+    class Radio
+        extends React.Component<RadioProps, {}>
+    { }
+
 
     // <Portal />
-    // ----------------------------------------
-    interface PortalProps {
+    interface PortalProps extends React.Props<Portal> {
         dimension?: string | Function;
         getDimensionValue?: Function;
         in?: boolean;
@@ -807,18 +1017,12 @@ declare module "react-bootstrap" {
     type Portal = React.ClassicComponent<PortalProps, {}>;
     var Portal: React.ClassicComponentClass<PortalProps>;
 
+
     // <Position />
-    // ----------------------------------------
-    interface PositionProps {
+    interface PositionProps extends TransitionCallbacks, React.Props<Position> {
         dimension?: string | Function;
         getDimensionValue?: Function;
         in?: boolean;
-        onEnter?: Function;
-        onEntered?: Function;
-        onEntering?: Function;
-        onExit?: Function;
-        onExited?: Function;
-        onExiting?: Function;
         role?: string;
         timeout?: number;
         transitionAppear?: boolean;
@@ -827,20 +1031,4 @@ declare module "react-bootstrap" {
     class Position extends React.Component<PositionProps, {}> {
     }
 
-    // <Fade />
-    // ----------------------------------------
-    interface FadeProps {
-        in?: boolean;
-        onEnter?: Function;
-        onEntered?: Function;
-        onEntering?: Function;
-        onExit?: Function;
-        onExited?: Function;
-        onExiting?: Function;
-        timeout?: number;
-        transitionAppear?: boolean;
-        unmountOnExit?: boolean;
-    }
-    class Fade extends React.Component<FadeProps, {}> {
-    }
 }

From 8ef50befe5bf01faa4815c3fa2fbf08e31a745a7 Mon Sep 17 00:00:00 2001
From: Mike Winfield <mike@acs-solutions.co.uk>
Date: Mon, 6 Jun 2016 17:07:22 +0100
Subject: [PATCH 099/278] Fix lost/misnamed Collapse/Class

---
 react-bootstrap/react-bootstrap.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/react-bootstrap/react-bootstrap.d.ts b/react-bootstrap/react-bootstrap.d.ts
index ca0fa37faa..6ba51c8815 100644
--- a/react-bootstrap/react-bootstrap.d.ts
+++ b/react-bootstrap/react-bootstrap.d.ts
@@ -157,7 +157,7 @@ declare module "react-bootstrap" {
 
     // <Collapse />
     interface CollapseProps
-        extends TransitionCallbacks, React.Props<CollapseClass>
+        extends TransitionCallbacks, React.Props<Collapse>
     {
         dimension?: 'height' | 'width' | { ( ):string };
         getDimensionValue?: ( dimension:number, element:React.ReactElement<any> ) => number;

From 2376f40c0cdecafd447affa0c75b908ce7b147c2 Mon Sep 17 00:00:00 2001
From: Mike Winfield <mike@acs-solutions.co.uk>
Date: Mon, 6 Jun 2016 17:10:45 +0100
Subject: [PATCH 100/278] Remove (deprecated) FormControls tests

---
 react-bootstrap/react-bootstrap-tests.tsx | 16 ++++------------
 1 file changed, 4 insertions(+), 12 deletions(-)

diff --git a/react-bootstrap/react-bootstrap-tests.tsx b/react-bootstrap/react-bootstrap-tests.tsx
index 36d5c1ab23..f779b1ef4f 100644
--- a/react-bootstrap/react-bootstrap-tests.tsx
+++ b/react-bootstrap/react-bootstrap-tests.tsx
@@ -7,7 +7,7 @@
 // --------------------------------------------------------------------------------
 import * as React from 'react';
 import { Component, CSSProperties } from 'react';
-import { Button, ButtonToolbar, Modal, Well, ButtonGroup, DropdownButton, MenuItem, Panel, ListGroup, ListGroupItem, Accordion, Tooltip, OverlayTrigger, Popover, ProgressBar, Nav, NavItem, Navbar, NavDropdown, Tabs, Tab, Pager, PageItem, Pagination, Alert, Carousel, CarouselItem, Grid, Row, Col, Thumbnail, Label, Badge, Jumbotron, PageHeader, Glyphicon, Table, Input, ButtonInput, FormControls, Form, FormGroup, ControlLabel, FormControl, HelpBlock, Radio, Checkbox } from 'react-bootstrap';
+import { Button, ButtonToolbar, Modal, Well, ButtonGroup, DropdownButton, MenuItem, Panel, ListGroup, ListGroupItem, Accordion, Tooltip, OverlayTrigger, Popover, ProgressBar, Nav, NavItem, Navbar, NavDropdown, Tabs, Tab, Pager, PageItem, Pagination, Alert, Carousel, CarouselItem, Grid, Row, Col, Thumbnail, Label, Badge, Jumbotron, PageHeader, Glyphicon, Table, Input, ButtonInput, Form, FormGroup, ControlLabel, FormControl, HelpBlock, Radio, Checkbox } from 'react-bootstrap';
 
 
 export class ReactBootstrapTest extends Component<any, any> {
@@ -854,14 +854,6 @@ export class ReactBootstrapTest extends Component<any, any> {
                     </form>
                 </div>
 
-                <div style={style}>
-                  <form>
-                    <FormControls.Static className="col-xs-10 col-xs-offset-2" value="I'm in a form" />
-                    <FormControls.Static label="First Name" labelClassName="col-xs-2" wrapperClassName="col-xs-10" value="Billy" />
-                    <FormControls.Static label="Last Name" labelClassName="col-xs-2" wrapperClassName="col-xs-10">Bob</FormControls.Static>
-                  </form>
-                </div>
-
                 <div style={style}>
                   <form>
                     <Input type='text' addonBefore='@' />
@@ -911,7 +903,7 @@ export class ReactBootstrapTest extends Component<any, any> {
                     </Row>
                   </Input>
                 </div>
-                
+
                 <div style={style}>
                   <Form>
                     <FormGroup
@@ -919,13 +911,13 @@ export class ReactBootstrapTest extends Component<any, any> {
                     >
                       <ControlLabel>Control Label</ControlLabel>
                       <FormControl
-                        type="text"                        
+                        type="text"
                         placeholder="Enter text"
                       />
                       <FormControl.Feedback />
                       <HelpBlock>Help block message.</HelpBlock>
                     </FormGroup>
-                    
+
                     <FormGroup>
                       <Checkbox name="checkbox" inline>1</Checkbox>
                       {' '}

From 66cc630cca99ccf76ac97ea384e3b7334e0ba26f Mon Sep 17 00:00:00 2001
From: Atanas Atanasov <nascovt@gmail.com>
Date: Tue, 7 Jun 2016 10:35:27 +0300
Subject: [PATCH 101/278] wrapped interfaces in a module

I'm making this change based on a feedback from Masahiro Wakame received after pull request to the definitelytyped repo
---
 gijgo/gijgo.d.ts | 309 ++++++++++++++++++++++++-----------------------
 1 file changed, 155 insertions(+), 154 deletions(-)

diff --git a/gijgo/gijgo.d.ts b/gijgo/gijgo.d.ts
index faa2609fbc..f78d88be85 100644
--- a/gijgo/gijgo.d.ts
+++ b/gijgo/gijgo.d.ts
@@ -3,164 +3,165 @@
 // Definitions by: Atanas Atanasov <https://github.com/atatanasov>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-//Grid
+declare module Gijgo {
 
-interface GridPager {
-    limit: number;
-    sizes: Array<number>;
-    leftControls?: any;
-    rightControls?: any;
+    //Grid
+    interface GridPager {
+        limit?: number;
+        sizes?: Array<number>;
+        leftControls?: any;
+        rightControls?: any;
+    }
+
+    interface GridColumn {
+        align?: string;
+        cssClass?: string;
+        decimalDigits?: number;
+        editor?: any;
+        events?: any;
+        field?: string;
+        format?: string;
+        headerCssClass?: string;
+        hidden?: boolean;
+        icon?: string;
+        minWidth?: number;
+        priority?: number;
+        sortable?: boolean;
+        stopPropagation?: boolean;
+        title?: string;
+        tmpl?: string;
+        tooltip?: string;
+        type?: string;
+        width?: number;
+    }
+
+    interface GridDefaultParams {
+        direction?: string;
+        limit?: string;
+        page?: string;
+        sortBy?: string;
+    }
+
+    interface GridMapping {
+        dataField?: string;
+        totalRecordsField?: string;
+    }
+
+    interface GridSettings<Entity> {
+        //Configuration options
+        autoGenerateColumns?: boolean;
+        autoLoad?: boolean;
+        columns?: Array<GridColumn>;
+        dataSource?: any;
+        defaultColumnSettings?: GridColumn;
+        defaultParams?: GridDefaultParams;
+        detailTemplate?: string;
+        fontSize?: string;
+        mapping?: string;
+        minWidth?: number;
+        notFoundText?: string;
+        pager?: GridPager;
+        primaryKey?: string;
+        resizableColumns?: boolean;
+        resizeCheckInterval?: number;
+        responsive?: boolean;
+        selectionMethod?: string;
+        selectionType?: string;
+        showHiddenColumnsAsDetails?: boolean;
+        title?: string;
+        toolbarTemplate?: string;
+        uiLibrary?: string;
+        width?: number;
+        params?: any;
+
+        //Events
+        beforeEmptyRowInsert?: (e: any, $row: JQuery) => any;
+        cellDataBound?: (e: any, $wrapper: JQuery, id: string, column: GridColumn, record: Entity) => any;
+        cellDataChanged?: (e: any, $cell: JQuery, column: GridColumn, record: Entity, oldValue: any, newValue: any) => any;
+        columnHide?: (e: any, column: GridColumn) => any;
+        columnShow?: (e: any, column: GridColumn) => any;
+        dataBinding?: (e: any, records: Array<Entity>) => any;
+        dataBound?: (e: any, records: Array<Entity>, totalRecords: number) => any;
+        destroying?: (e: any) => any;
+        detailCollapse?: (e: any, detailWrapper: JQuery, record: Entity) => any;
+        detailExpand?: (e: any, detailWrapper: JQuery, record: Entity) => any;
+        initialized?: (e: any) => any;
+        pageChanging?: (e: any, newPage: number) => any;
+        pageSizeChange?: (e: any, newPage: number) => any;
+        resize?: (e: any, newWidth: number, oldWidth: number) => any;
+        rowDataBound?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+        rowRemoving?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+        rowSelect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+        rowUnselect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+    }
+
+    interface Grid<Entity, Params> extends JQuery {
+        addRow(record: Entity): Grid<Entity, Params>;
+        clear(showNotFoundText?: boolean): Grid<Entity, Params>;
+        count(): number;
+        destroy(keepTableTag?: boolean, keepWrapperTag?: boolean): void;
+        //get(position: number): Entity; //TODO: rename to getByPosition to avoid conflicts with jquery.get
+        getAll(): Array<Entity>;
+        getById(id: string): Entity;
+        getChanges(): Array<Entity>;
+        getSelected(): string;
+        getSelections(): Array<string>;
+        hideColumn(field: string): Grid<Entity, Params>;
+        makeResponsive(): void;
+        reload(params?: Params): Grid<Entity, Params>;
+        removeRow(id: string): Grid<Entity, Params>;
+        render(response: any): Grid<Entity, Params>;
+        selectAll(): Grid<Entity, Params>;
+        setSelected(id: string | number): Grid<Entity, Params>;
+        showColumn(field: string): Grid<Entity, Params>;
+        title(text: any): any;
+        unSelectAll(): Grid<Entity, Params>;
+        updateRow(id: string, record: Entity): Grid<Entity, Params>;
+    }
+
+    //Dialog
+    interface DialogSettings {
+        //Configuration options
+        autoOpen?: boolean;
+        closeOnEscape?: boolean;
+        draggable?: boolean;
+        height?: number | string;
+        maxHeight?: number;
+        maxWidth?: number;
+        minHeight?: number;
+        minWidth?: number;
+        modal?: boolean;
+        resizable?: boolean;
+        title?: string;
+        uiLibrary?: string;
+        width?: number;
+
+        //Events
+        closed?: (e: any) => any;
+        closing?: (e: any) => any;
+        drag?: (e: any) => any;
+        dragStart?: (e: any) => any;
+        dragStop?: (e: any) => any;
+        initialized?: (e: any) => any;
+        opened?: (e: any) => any;
+        opening?: (e: any) => any;
+        resize?: (e: any) => any;
+        resizeStart?: (e: any) => any;
+        resizeStop?: (e: any) => any;
+    }
+
+    interface Dialog extends JQuery {
+        close(): Dialog;
+        isOpen(): boolean;
+        open(): Dialog;
+    }
 }
 
-interface GridColumn {
-    align?: string;
-    cssClass?: string;
-    decimalDigits?: number;
-    editor?: any;
-    events?: any;
-    field?: string;
-    format?: string;
-    headerCssClass?: string;
-    hidden?: boolean;
-    icon?: string;
-    minWidth?: number;
-    priority?: number;
-    sortable?: boolean;
-    stopPropagation?: boolean;
-    title?: string;
-    tmpl?: string;
-    tooltip?: string;
-    type?: string;
-    width?: number;
-}
-
-interface GridDefaultParams {
-    direction?: string;
-    limit?: string;
-    page?: string;
-    sortBy?: string;
-}
-
-interface GridMapping {
-    dataField?: string;
-    totalRecordsField?: string;
-}
-
-interface GridSettings<Entity> {
-    //Configuration options
-    autoGenerateColumns?: boolean;
-    autoLoad?: boolean;
-    columns?: Array<GridColumn>;
-    dataSource?: any;
-    defaultColumnSettings?: GridColumn;
-    defaultParams?: GridDefaultParams;
-    detailTemplate?: string;
-    fontSize?: string;
-    mapping?: string;
-    minWidth?: number;
-    notFoundText?: string;
-    pager?: GridPager;
-    primaryKey?: string;
-    resizableColumns?: boolean;
-    resizeCheckInterval?: number;
-    responsive?: boolean;
-    selectionMethod?: string;
-    selectionType?: string;
-    showHiddenColumnsAsDetails?: boolean;
-    title?: string;
-    toolbarTemplate?: string;
-    uiLibrary?: string;
-    width?: number;
-    params?: any;
-
-    //Events
-    beforeEmptyRowInsert?: (e: any, $row: JQuery) => any;
-    cellDataBound?: (e: any, $wrapper: JQuery, id: string, column: GridColumn, record: Entity) => any;
-    cellDataChanged?: (e: any, $cell: JQuery, column: GridColumn, record: Entity, oldValue: any, newValue: any) => any;
-    columnHide?: (e: any, column: GridColumn) => any;
-    columnShow?: (e: any, column: GridColumn) => any;
-    dataBinding?: (e: any, records: Array<Entity>) => any;
-    dataBound?: (e: any, records: Array<Entity>, totalRecords: number) => any;
-    destroying?: (e: any) => any;
-    detailCollapse?: (e: any, detailWrapper: JQuery, record: Entity) => any;
-    detailExpand?: (e: any, detailWrapper: JQuery, record: Entity) => any;
-    initialized?: (e: any) => any;
-    pageChanging?: (e: any, newPage: number) => any;
-    pageSizeChange?: (e: any, newPage: number) => any;
-    resize?: (e: any, newWidth: number, oldWidth: number) => any;
-    rowDataBound?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-    rowRemoving?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-    rowSelect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-    rowUnselect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-}
-
-interface Grid<Entity, Params> extends JQuery {
-    addRow(record: Entity): Grid<Entity, Params>;
-    clear(showNotFoundText?: boolean): Grid<Entity, Params>;
-    count(): number;
-    destroy(keepTableTag?: boolean, keepWrapperTag?: boolean): void; 
-    //get(position: number): Entity; //TODO: rename to getByPosition to avoid conflicts with jquery.get
-    getAll(): Array<Entity>;
-    getById(id: string): Entity;
-    getChanges(): Array<Entity>;
-    getSelected(): string;
-    getSelections(): Array<string>;
-    hideColumn(field: string): Grid<Entity, Params>;
-    makeResponsive(): void;
-    reload(params?: Params): Grid<Entity, Params>;
-    removeRow(id: string): Grid<Entity, Params>;
-    render(response: any): Grid<Entity, Params>;
-    selectAll(): Grid<Entity, Params>;
-    setSelected(id: string|number): Grid<Entity, Params>;
-    showColumn(field: string): Grid<Entity, Params>;
-    title(text: any): any;
-    unSelectAll(): Grid<Entity, Params>;
-    updateRow(id: string, record: Entity): Grid<Entity, Params>;
-}
 
 interface JQuery {
-    grid(settings: GridSettings<any>): Grid<any, any>;
-    grid<Entity>(settings: GridSettings<Entity>): Grid<Entity, any>;
-    grid<Entity, Params>(settings: GridSettings<Entity>): Grid<Entity, Params>;
-}
+    grid(settings: Gijgo.GridSettings<any>): Gijgo.Grid<any, any>;
+    grid<Entity>(settings: Gijgo.GridSettings<Entity>): Gijgo.Grid<Entity, any>;
+    grid<Entity, Params>(settings: Gijgo.GridSettings<Entity>): Gijgo.Grid<Entity, Params>;
 
-//Dialog
-interface DialogSettings {
-    //Configuration options
-    autoOpen?: boolean;
-    closeOnEscape?: boolean;
-    draggable?: boolean;
-    height?: number|string;
-    maxHeight?: number;
-    maxWidth?: number;
-    minHeight?: number;
-    minWidth?: number;
-    modal?: boolean;
-    resizable?: boolean;
-    title?: string;
-    uiLibrary?: string;
-    width?: number;
-    
-    //Events
-    closed?: (e: any) => any;
-    closing?: (e: any) => any;
-    drag?: (e: any) => any;
-    dragStart?: (e: any) => any;
-    dragStop?: (e: any) => any;
-    initialized?: (e: any) => any;
-    opened?: (e: any) => any;
-    opening?: (e: any) => any;
-    resize?: (e: any) => any;
-    resizeStart?: (e: any) => any;
-    resizeStop?: (e: any) => any;
-}
-
-interface Dialog extends JQuery {
-    close(): Dialog;
-    isOpen(): boolean;
-    open(): Dialog;
-}
-
-interface JQuery {
-    dialog(settings: DialogSettings): Dialog;
+    dialog(settings: Gijgo.DialogSettings): Gijgo.Dialog;
 }

From b47257d8fbea2e309dbbd825b88cf1ed26494d54 Mon Sep 17 00:00:00 2001
From: Michal Ledin <m.ledin@appheads.ru>
Date: Tue, 7 Jun 2016 17:07:26 +0300
Subject: [PATCH 102/278] Type definition for simplestorage.js 0.2.1.

---
 simplestorage.js/simplestorage.js-tests.ts | 31 +++++++++++-----------
 simplestorage.js/simplestorage.js.d.ts     | 16 ++++++++---
 2 files changed, 28 insertions(+), 19 deletions(-)

diff --git a/simplestorage.js/simplestorage.js-tests.ts b/simplestorage.js/simplestorage.js-tests.ts
index 1e9f4202a3..4106c88001 100644
--- a/simplestorage.js/simplestorage.js-tests.ts
+++ b/simplestorage.js/simplestorage.js-tests.ts
@@ -1,17 +1,18 @@
 ///<reference path="simplestorage.js.d.ts"/>
 
-var versionTest:        string           = simpleStorage.version;
-var canUseTest:         boolean          = simpleStorage.canUse();
-var simpleStorageTest1: boolean|Error    = simpleStorage.set("string", 7);
-var simpleStorageTest2: boolean|Error    = simpleStorage.set("string", 7, {});
-var simpleStorageTest3: boolean|Error    = simpleStorage.set("string", 7, { TTL: 7 });
-var simpleStorageTest4: boolean|Error    = simpleStorage.set("string", undefined);
-var simpleStorageTest5: boolean|Error    = simpleStorage.set("string", undefined, {});
-var simpleStorageTest6: boolean|Error    = simpleStorage.set("string", undefined, { TTL: 7 });
-var getTest:            any              = simpleStorage.get("string");
-var deleteKeyTest:      boolean|Error    = simpleStorage.deleteKey("string");
-var setTTLTest:         boolean|Error    = simpleStorage.setTTL("string", 7);
-var getTTLTest:         number|boolean   = simpleStorage.getTTL("string");
-var flushTest:          boolean|Error    = simpleStorage.flush();
-var indexTest:          [string]|boolean = simpleStorage.index();
-var storageSizeTest:    number           = simpleStorage.storageSize();
+var versionTest: string = simpleStorage.version;
+var canUseTest: boolean = simpleStorage.canUse();
+var simpleStorageTest1: boolean|Error = simpleStorage.set("string", 7);
+var simpleStorageTest2: boolean|Error = simpleStorage.set("string", 7, {});
+var simpleStorageTest3: boolean|Error = simpleStorage.set("string", 7, {TTL: 7});
+var simpleStorageTest4: boolean|Error = simpleStorage.set("string", undefined);
+var simpleStorageTest5: boolean|Error = simpleStorage.set("string", undefined, {});
+var simpleStorageTest6: boolean|Error = simpleStorage.set("string", undefined, {TTL: 7});
+var getTest: any = simpleStorage.get("string");
+var deleteKeyTest: boolean|Error = simpleStorage.deleteKey("string");
+var setTTLTest: boolean|Error = simpleStorage.setTTL("string", 7);
+var getTTLTest: number|boolean = simpleStorage.getTTL("string");
+var flushTest: boolean|Error = simpleStorage.flush();
+var indexTest: [string]|boolean = simpleStorage.index();
+var storageSizeTest: number = simpleStorage.storageSize();
+var hasKey: boolean = simpleStorage.hasKey("string");
diff --git a/simplestorage.js/simplestorage.js.d.ts b/simplestorage.js/simplestorage.js.d.ts
index 43650fd657..9e02f1b454 100644
--- a/simplestorage.js/simplestorage.js.d.ts
+++ b/simplestorage.js/simplestorage.js.d.ts
@@ -1,6 +1,6 @@
-// Type definitions for simpleStorage v0.1.3
+// Type definitions for simplestorage.js v0.2.1
 // Project: https://github.com/andris9/simpleStorage
-// Definitions by: Áxel Costas Pena <https://github.com/axelcostaspena>
+// Definitions by: Áxel Costas Pena <https://github.com/axelcostaspena>, Michael Ledin <https://github.com/mxl>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare namespace simplestoragejs {
@@ -38,6 +38,14 @@ declare namespace simplestoragejs {
          */
         get(key: string): any;
 
+        /**
+         * Checks if there's a value with the given key in the local storage.
+         * Returns <code>true</code> if the given key exists, <code>false</code> otherwise.
+         * @param key The key to be checked.
+         * @see https://github.com/andris9/simpleStorage#haskeykey
+         */
+        hasKey(key: string): boolean;
+
         /**
          * Removes a value from local storage.
          * Returns <code>true</code> if the value was deleted, <code>false</code> if the value was not found or <code>{@link Error}</code> object if value was not deleted because of an error.
@@ -96,7 +104,7 @@ declare namespace simplestoragejs {
 
 }
 
-declare module "simpleStorage" {
+declare module "simplestorage.js" {
     export = simpleStorage;
 }
 
@@ -107,4 +115,4 @@ declare module "simpleStorage" {
  * {@link simpleStorage} is very small - about 1kB in size when minimized and gzipped.
  * @see https://github.com/andris9/simpleStorage#simplestorage
  */
-declare var simpleStorage:simplestoragejs.SimpleStorage;
+declare var simpleStorage: simplestoragejs.SimpleStorage;

From 04669eee02f81040b558f0b36a0406fc60ded099 Mon Sep 17 00:00:00 2001
From: Sequoia McDowell <sequoia.mcdowell@gmail.com>
Date: Tue, 7 Jun 2016 13:39:21 -0400
Subject: [PATCH 103/278] Adding actual GeoJSON types to getGeoJSON fns

Previously returned `any` which was not accurate
---
 leaflet/leaflet.d.ts | 24 +++++++++++-------------
 1 file changed, 11 insertions(+), 13 deletions(-)

diff --git a/leaflet/leaflet.d.ts b/leaflet/leaflet.d.ts
index 37abb90fb1..395cdd77bf 100644
--- a/leaflet/leaflet.d.ts
+++ b/leaflet/leaflet.d.ts
@@ -3,6 +3,8 @@
 // Definitions by: Vladimir Zotov <https://github.com/rgripper>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
+/// <reference path='../geojson/geojson.d.ts' />
+
 declare namespace L {
     type LatLngExpression = LatLng | number[] | ({ lat: number; lng: number })
     type LatLngBoundsExpression = LatLngBounds | LatLngExpression[];
@@ -219,7 +221,7 @@ declare namespace L {
         /**
           * Returns a GeoJSON representation of the circle (GeoJSON Point Feature).
           */
-        toGeoJSON(): any;
+        toGeoJSON(): GeoJSON.Feature<GeoJSON.Point>;
 
     }
 }
@@ -254,11 +256,6 @@ declare namespace L {
           * Sets the radius of a circle marker. Units are in pixels.
           */
         setRadius(radius: number): CircleMarker;
-
-        /**
-          * Returns a GeoJSON representation of the circle marker (GeoJSON Point Feature).
-          */
-        toGeoJSON(): any;
     }
 }
 
@@ -1709,8 +1706,9 @@ declare namespace L {
 
         /**
           * Returns a GeoJSON representation of the layer group (GeoJSON FeatureCollection).
+          * Note: Descendent classes MultiPolygon & MultiPolyLine return `Feature`s, not `FeatureCollection`s
           */
-        toGeoJSON(): any;
+        toGeoJSON(): GeoJSON.FeatureCollection<GeoJSON.GeometryObject>|GeoJSON.Feature<GeoJSON.MultiLineString|GeoJSON.MultiPolygon>;
 
         ////////////
         ////////////
@@ -2000,7 +1998,7 @@ declare namespace L {
         export function closestPointOnSegment(p: Point, p1: Point, p2: Point): Point;
 
         /**
-          * Clips the segment a to b by rectangular bounds. Used by Leaflet to only show 
+          * Clips the segment a to b by rectangular bounds. Used by Leaflet to only show
           * polyline points that are on the screen or near, increasing performance. Returns
           * either false or a length-2 array of clipped points.
           */
@@ -2921,7 +2919,7 @@ declare namespace L {
         /**
           * Returns a GeoJSON representation of the marker (GeoJSON Point Feature).
           */
-        toGeoJSON(): any;
+        toGeoJSON(): GeoJSON.Feature<GeoJSON.Point>;
 
         /**
           * Marker dragging handler (by both mouse and touch).
@@ -3081,7 +3079,7 @@ declare namespace L {
         /**
           * Returns a GeoJSON representation of the multipolygon (GeoJSON MultiPolygon Feature).
           */
-        toGeoJSON(): any;
+        toGeoJSON(): GeoJSON.Feature<GeoJSON.MultiPolygon>;
     }
 }
 
@@ -3122,7 +3120,7 @@ declare namespace L {
         /**
           * Returns a GeoJSON representation of the multipolyline (GeoJSON MultiLineString Feature).
           */
-        toGeoJSON(): any;
+        toGeoJSON(): GeoJSON.Feature<GeoJSON.MultiLineString>;
     }
 }
 
@@ -3384,7 +3382,7 @@ declare namespace L {
         className?: string;
 
 	/**
-	 * Sets the radius of a circle marker. 
+	 * Sets the radius of a circle marker.
 	 */
 	radius?: number;
 
@@ -3543,7 +3541,7 @@ declare namespace L {
         /**
           * Returns a GeoJSON representation of the polyline (GeoJSON LineString Feature).
           */
-        toGeoJSON(): any;
+        toGeoJSON(): GeoJSON.Feature<GeoJSON.LineString>;
     }
 }
 

From 83c31efdd69ef4668abe8fecc0b957300d93e4cd Mon Sep 17 00:00:00 2001
From: Torsten Werner <torsten.werner@westernacher.com>
Date: Tue, 7 Jun 2016 22:51:25 +0200
Subject: [PATCH 104/278] node-fetch: introduce namespace _fetch for tests

---
 node-fetch/node-fetch-tests.ts | 12 ++++++------
 node-fetch/node-fetch.d.ts     |  7 +++++--
 2 files changed, 11 insertions(+), 8 deletions(-)

diff --git a/node-fetch/node-fetch-tests.ts b/node-fetch/node-fetch-tests.ts
index 3188d319bc..28d7ff7766 100644
--- a/node-fetch/node-fetch-tests.ts
+++ b/node-fetch/node-fetch-tests.ts
@@ -3,9 +3,9 @@
 import fetch = require('node-fetch');
 
 function test_fetchUrlWithOptions() {
-	var headers = new Headers();
+	var headers = new _fetch.Headers();
 	headers.append("Content-Type", "application/json");
-	var requestOptions: RequestInit = {
+	var requestOptions: _fetch.RequestInit = {
 		method: "POST",
 		headers: headers,
 		mode: 'same-origin',
@@ -17,7 +17,7 @@ function test_fetchUrlWithOptions() {
 }
 
 function test_fetchUrlWithHeadersObject() {
-	var requestOptions: RequestInit = {
+	var requestOptions: _fetch.RequestInit = {
 		method: "POST",
 		headers: {
 			'Content-Type': 'application/json'
@@ -31,13 +31,13 @@ function test_fetchUrl() {
 }
 
 function test_fetchUrlWithRequestObject() {
-	var requestOptions: RequestInit = {
+	var requestOptions: _fetch.RequestInit = {
 		method: "POST",
 		headers: {
 			'Content-Type': 'application/json'
 		}
 	};
-	var request: Request = new Request("http://www.andlabs.net/html5/uCOR.php", requestOptions);
+	var request: _fetch.Request = new _fetch.Request("http://www.andlabs.net/html5/uCOR.php", requestOptions);
 	handlePromise(fetch(request));
 }
 
@@ -48,7 +48,7 @@ function test_globalFetchVar() {
 		});
 }
 
-function handlePromise(promise: Promise<Response>) {
+function handlePromise(promise: Promise<_fetch.Response>) {
 	promise.then((response) => {
 		if (response.type === 'basic') {
 			// for test only
diff --git a/node-fetch/node-fetch.d.ts b/node-fetch/node-fetch.d.ts
index 5934328aa6..5cf41ea992 100644
--- a/node-fetch/node-fetch.d.ts
+++ b/node-fetch/node-fetch.d.ts
@@ -3,7 +3,7 @@
 // Definitions by: Torsten Werner <https://github.com/torstenwerner>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-declare module 'node-fetch' {
+declare module _fetch {
 
 	class Request extends Body {
 		constructor(input: string | Request, init?: RequestInit);
@@ -88,5 +88,8 @@ declare module 'node-fetch' {
 	type RequestInfo = Request | string;
 
     function fetch(url: string | Request, init?: RequestInit): Promise<Response>;
-    export = fetch;
+}
+
+declare module "node-fetch" {
+	export = _fetch.fetch;
 }

From 7b94290975f43cfecccb2fc29fd415797acfcf73 Mon Sep 17 00:00:00 2001
From: mc-petry <mc-petry@simcord.com>
Date: Wed, 8 Jun 2016 14:01:32 +0300
Subject: [PATCH 105/278] Use ghost modules pattern

---
 d3pie/d3pie.d.ts | 260 ++++++++++++++++++++++++-----------------------
 1 file changed, 131 insertions(+), 129 deletions(-)

diff --git a/d3pie/d3pie.d.ts b/d3pie/d3pie.d.ts
index 58b2b25d3d..2bfe5d6525 100644
--- a/d3pie/d3pie.d.ts
+++ b/d3pie/d3pie.d.ts
@@ -3,142 +3,144 @@
 // Definitions by: Petryshyn Sergii <https://github.com/mc-petry>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-interface ID3PieChart {
-  redraw(): void
-  openSegment(index: number): void
-  closeSegment(index: void): void
-  getOpenSegment(): any
-  updateProp(propKey: string, value: any): void
-  destroy(): void
-}
-
-interface ID3PieStyleOptions {
-  color?: string
-  fontSize?: number
-  font?: string
-}
-
-interface ID3PieTextOptions extends ID3PieStyleOptions {
-  text?: string
-}
-
-interface ID3PieLabelsOptions {
-  format?: 'label' | 'value' | 'percentage' | 'label-value1' | 'label-value2' | 'label-percentage1' | 'label-percentage2'
-  hideWhenLessThanPercentage?: number
-}
-
-interface ID3PieOptions {
-  header?: {
-    title?: ID3PieTextOptions
-    subtitle?: ID3PieTextOptions
-    location?: 'top-center' | 'top-left' | 'pie-center'
-    titleSubtitlePadding?: number
+declare namespace d3pie {
+  interface ID3PieChart {
+    redraw(): void
+    openSegment(index: number): void
+    closeSegment(index: void): void
+    getOpenSegment(): any
+    updateProp(propKey: string, value: any): void
+    destroy(): void
   }
-  footer?: { location?: 'left' } & ID3PieTextOptions
-  size?: {
-    canvasHeight?: number
-    canvasWidth?: number
-    pieOuterRadius?: string | number
-    pieInnerRadius?: string | number
+
+  interface ID3PieStyleOptions {
+    color?: string
+    fontSize?: number
+    font?: string
   }
-  data: {
-    sortOrder?: 'none' | 'random' | 'value-asc' | 'value-desc' | 'label-asc' | 'label-desc'
-    smallSegmentGrouping?: {
+
+  interface ID3PieTextOptions extends ID3PieStyleOptions {
+    text?: string
+  }
+
+  interface ID3PieLabelsOptions {
+    format?: 'label' | 'value' | 'percentage' | 'label-value1' | 'label-value2' | 'label-percentage1' | 'label-percentage2'
+    hideWhenLessThanPercentage?: number
+  }
+
+  interface ID3PieOptions {
+    header?: {
+      title?: ID3PieTextOptions
+      subtitle?: ID3PieTextOptions
+      location?: 'top-center' | 'top-left' | 'pie-center'
+      titleSubtitlePadding?: number
+    }
+    footer?: { location?: 'left' } & ID3PieTextOptions
+    size?: {
+      canvasHeight?: number
+      canvasWidth?: number
+      pieOuterRadius?: string | number
+      pieInnerRadius?: string | number
+    }
+    data: {
+      sortOrder?: 'none' | 'random' | 'value-asc' | 'value-desc' | 'label-asc' | 'label-desc'
+      smallSegmentGrouping?: {
+        enabled?: boolean
+        value?: number
+        valueType?: 'percentage' | 'value'
+        label?: string
+        color?: string
+      }
+      content: {
+        label: string
+        value: number
+        color?: string
+      }[]
+    }
+    labels?: {
+      outer?: { pieDistance?: number } & ID3PieLabelsOptions
+      inner?: ID3PieLabelsOptions
+      mainLabel?: ID3PieStyleOptions
+      percentage?: { decimalPlaces?: number } & ID3PieStyleOptions
+      value?: ID3PieStyleOptions
+      lines?: {
+        enabled?: boolean
+        style?: 'curved' | 'straight'
+        color?: string
+      }
+      truncation?: {
+        enabled?: boolean
+        truncateLength?: number
+      }
+      formatter?: (context: {
+        section: 'outer' | 'inner'
+        value: number
+        label: string
+      }) => string
+    }
+    effects?: {
+      load?: {
+        effect?: 'none' | 'default'
+        speed?: number
+      }
+      pullOutSegmentOnClick?: {
+        effect?: 'none' | 'linear' | 'bounce' | 'elastic' | 'back'
+        speed?: number
+        size?: number
+      }
+      highlightSegmentOnMouseover?: boolean
+      highlightLuminosity?: number
+    }
+    tooltips?: {
       enabled?: boolean
-      value?: number
-      valueType?: 'percentage' | 'value'
-      label?: string
-      color?: string
+      type?: 'placeholder' | 'caption'
+      string?: string
+      placeholderParser?: (index: number, data: { label?: string, percentage?: number, value?: number }) => void
+      styles?: {
+        fadeInSpeed?: number
+        backgroundColor?: string
+        backgroundOpacity?: number
+        color?: string
+        borderRadius?: number
+        font?: string
+        fontSize?: number
+        padding?: number
+      }
     }
-    content: {
-      label: string
-      value: number
-      color?: string
-    }[]
-  }
-  labels?: {
-    outer?: { pieDistance?: number } & ID3PieLabelsOptions
-    inner?: ID3PieLabelsOptions
-    mainLabel?: ID3PieStyleOptions
-    percentage?: { decimalPlaces?: number } & ID3PieStyleOptions
-    value?: ID3PieStyleOptions
-    lines?: {
-      enabled?: boolean
-      style?: 'curved' | 'straight'
-      color?: string
+    misc?: {
+      colors?: {
+        background?: string
+        segments?: string[]
+        segmentStroke?: string
+      }
+      gradient?: {
+        enabled?: boolean
+        percentage?: number
+        color?: string
+      }
+      canvasPadding?: {
+        top?: number
+        right?: number
+        bottom?: number
+        left?: number
+      }
+      pieCenterOffset?: {
+        x?: number
+        y?: number
+      }
+      cssPrefix?: string
     }
-    truncation?: {
-      enabled?: boolean
-      truncateLength?: number
-    }
-    formatter?: (context: {
-      section: 'outer' | 'inner'
-      value: number
-      label: string
-    }) => string
-  }
-  effects?: {
-    load?: {
-      effect?: 'none' | 'default'
-      speed?: number
-    }
-    pullOutSegmentOnClick?: {
-      effect?: 'none' | 'linear' | 'bounce' | 'elastic' | 'back'
-      speed?: number
-      size?: number
-    }
-    highlightSegmentOnMouseover?: boolean
-    highlightLuminosity?: number
-  }
-  tooltips?: {
-    enabled?: boolean
-    type?: 'placeholder' | 'caption'
-    string?: string
-    placeholderParser?: (index: number, data: { label?: string, percentage?: number, value?: number }) => void
-    styles?: {
-      fadeInSpeed?: number
-      backgroundColor?: string
-      backgroundOpacity?: number
-      color?: string
-      borderRadius?: number
-      font?: string
-      fontSize?: number
-      padding?: number
+    callbacks?: {
+      onload?: Function
+      onMouseoverSegment?: Function
+      onMouseoutSegment?: Function
+      onClickSegment?: Function
     }
   }
-  misc?: {
-    colors?: {
-      background?: string
-      segments?: string[]
-      segmentStroke?: string
-    }
-    gradient?: {
-      enabled?: boolean
-      percentage?: number
-      color?: string
-    }
-    canvasPadding?: {
-      top?: number
-      right?: number
-      bottom?: number
-      left?: number
-    }
-    pieCenterOffset?: {
-      x?: number
-      y?: number
-    }
-    cssPrefix?: string
-  }
-  callbacks?: {
-    onload?: Function
-    onMouseoverSegment?: Function
-    onMouseoutSegment?: Function
-    onClickSegment?: Function
+
+  interface ID3PieClass {
+    new (id: string | HTMLElement, options: ID3PieOptions): ID3PieChart
   }
 }
 
-interface ID3PieClass {
-  new (id: string | HTMLElement, options: ID3PieOptions): ID3PieChart
-}
-
-declare const d3pie: ID3PieClass
\ No newline at end of file
+declare const d3pie: d3pie.ID3PieClass
\ No newline at end of file

From a3b9360f8d47d1531e14f4f7013d21dbe225e830 Mon Sep 17 00:00:00 2001
From: k7sleeper <k7sleeper@gmail.com>
Date: Wed, 15 Jun 2016 14:02:39 +0200
Subject: [PATCH 106/278] add 4 missing functions

added functions registerFormat, unregisterFormat, getRegisteredFormats,
getDefaultOptions
---
 z-schema/z-schema.d.ts | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/z-schema/z-schema.d.ts b/z-schema/z-schema.d.ts
index 750abd2870..317a92247c 100644
--- a/z-schema/z-schema.d.ts
+++ b/z-schema/z-schema.d.ts
@@ -37,6 +37,11 @@ declare namespace ZSchema {
     }
 
     export class Validator {
+        public static registerFormat(name: string, validator: (value: any) => boolean): void;
+        public static unregisterFormat(name: string): void;
+        public static getRegisteredFormats(): string[];
+        public static getDefaultOptions(): Options;
+    
         constructor(options: Options);
 
         /**

From 0c83aae6cd0761a9d5176240f7dbf967e225ca84 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jo=C3=A3o=20Crist=C3=B3v=C3=A3o?= <jmacristovao@gmail.com>
Date: Fri, 17 Jun 2016 07:04:22 +0100
Subject: [PATCH 107/278] express routes can take arrays of handlers

---
 .../express-serve-static-core.d.ts            | 34 ++++++++++---------
 1 file changed, 18 insertions(+), 16 deletions(-)

diff --git a/express-serve-static-core/express-serve-static-core.d.ts b/express-serve-static-core/express-serve-static-core.d.ts
index 2662222d00..e15dbcb5b6 100644
--- a/express-serve-static-core/express-serve-static-core.d.ts
+++ b/express-serve-static-core/express-serve-static-core.d.ts
@@ -17,21 +17,23 @@ declare namespace Express {
 declare module "express-serve-static-core" {
     import * as http from "http";
 
+    type RequestHandlerParams = RequestHandler | RequestHandler[];
+
     interface IRoute {
         path: string;
         stack: any;
-        all(...handler: RequestHandler[]): IRoute;
-        get(...handler: RequestHandler[]): IRoute;
-        post(...handler: RequestHandler[]): IRoute;
-        put(...handler: RequestHandler[]): IRoute;
-        delete(...handler: RequestHandler[]): IRoute;
-        patch(...handler: RequestHandler[]): IRoute;
-        options(...handler: RequestHandler[]): IRoute;
-        head(...handler: RequestHandler[]): IRoute;
+        all(...handler: RequestHandlerParams[]): IRoute;
+        get(...handler: RequestHandlerParams[]): IRoute;
+        post(...handler: RequestHandlerParams[]): IRoute;
+        put(...handler: RequestHandlerParams[]): IRoute;
+        delete(...handler: RequestHandlerParams[]): IRoute;
+        patch(...handler: RequestHandlerParams[]): IRoute;
+        options(...handler: RequestHandlerParams[]): IRoute;
+        head(...handler: RequestHandlerParams[]): IRoute;
     }
 
     interface IRouterMatcher<T> {
-        (name: string | RegExp, ...handlers: RequestHandler[]): T;
+        (name: string | RegExp, ...handlers: RequestHandlerParams[]): T;
     }
 
     interface IRouter<T> extends RequestHandler {
@@ -88,13 +90,13 @@ declare module "express-serve-static-core" {
 
         route(path: string): IRoute;
 
-        use(...handler: RequestHandler[]): T;
-        use(handler: ErrorRequestHandler | RequestHandler): T;
-        use(path: string, ...handler: RequestHandler[]): T;
-        use(path: string, handler: ErrorRequestHandler | RequestHandler): T;
-        use(path: string[], ...handler: RequestHandler[]): T;
+        use(...handler: RequestHandlerParams[]): T;
+        use(handler: ErrorRequestHandler | RequestHandlerParams): T;
+        use(path: string, ...handler: RequestHandlerParams[]): T;
+        use(path: string, handler: ErrorRequestHandler | RequestHandlerParams): T;
+        use(path: string[], ...handler: RequestHandlerParams[]): T;
         use(path: string[], handler: ErrorRequestHandler): T;
-        use(path: RegExp, ...handler: RequestHandler[]): T;
+        use(path: RegExp, ...handler: RequestHandlerParams[]): T;
         use(path: RegExp, handler: ErrorRequestHandler): T;
         use(path: string, router: Router): T;
     }
@@ -860,7 +862,7 @@ declare module "express-serve-static-core" {
         set(setting: string, val: any): Application;
         get: {
             (name: string): any; // Getter
-            (name: string | RegExp, ...handlers: RequestHandler[]): Application;
+            (name: string | RegExp, ...handlers: RequestHandlerParams[]): Application;
         };
 
         /**

From 6b972c3e58c623e257fa7868d5decca16143271c Mon Sep 17 00:00:00 2001
From: Daryl LaBar <d3labar@hotmail.com>
Date: Fri, 17 Jun 2016 09:47:41 -0400
Subject: [PATCH 108/278] Changed OptionSetValue.Value to be a Number.  This is
 the way CRM is returning it when Turbo Forms are used which is the default
 now.

Added Missing ProcessManager functions getSelectedStage, addOnStageSelected, removeOnStageChange

Add UiFocusable Interface to Control

Changed Form Notification to Use String Literal Type
Changed setRequiredLevel to Use String Literal Type
Changed setSubmitMode to Use String Literal Type
Changed setDisplayState to Use String Literal Type
Changed getClient to Use String Literal Type
Changed getClientState to Use String Literal Type
Changed getCurrentTheme to Use String Literal Type
Changed setFormNotification to Use String Literal Type
Changed getStatus to Use String Literal Type
Changed savedMode to Use String Literal Type
Changed CmdBar to Use String Literal Type
Changed NavBar  to Use String Literal Type
Changed Action to Use String Literal Type
---
 xrm/xrm-tests.ts |  29 +++++
 xrm/xrm.d.ts     | 274 ++++++++++++++++++-----------------------------
 2 files changed, 133 insertions(+), 170 deletions(-)

diff --git a/xrm/xrm-tests.ts b/xrm/xrm-tests.ts
index 4dfb8e4090..db0608d8cf 100644
--- a/xrm/xrm-tests.ts
+++ b/xrm/xrm-tests.ts
@@ -105,3 +105,32 @@ Xrm.Page.data.entity.addOnSave(( context ) =>
 alert( `The current form type is: ${Xrm.Page.ui.getFormType() }` );
 
 alert( `The current entity type is: ${Xrm.Page.data.entity.getEntityName() }` );
+
+/// Demonstrate Optionset Value as int in Turbo Forms
+
+var optionSetAttribute = Xrm.Page.getAttribute<Xrm.Page.OptionSetAttribute>( "statuscode" );
+const optionValue: number = optionSetAttribute.getOptions()[0].value;
+
+/// Demonstrate Control.setFocus();
+
+optionSetAttribute.controls.get(0).setFocus();
+
+/// Demonstrate setFormNotification
+
+var level: Xrm.Page.ui.FormNotificationLevel;
+level = "ERROR";
+Xrm.Page.ui.setFormNotification("Test", level, "uniqueId"); 
+
+/// Demonstrate
+
+let requirementlevel: Xrm.Page.Attribute.RequirementLevel;
+requirementlevel = "none";
+let submitMode: Xrm.Page.Attribute.SubmitMode;
+submitMode = "always";
+
+let attribute = Xrm.Page.getAttribute<Xrm.Page.LookupAttribute>("customerid");
+attribute.setSubmitMode(submitMode);
+attribute.setRequiredLevel(requirementlevel);
+
+
+
diff --git a/xrm/xrm.d.ts b/xrm/xrm.d.ts
index d20dfd816c..14f1cf204b 100644
--- a/xrm/xrm.d.ts
+++ b/xrm/xrm.d.ts
@@ -220,14 +220,19 @@ declare namespace Xrm
          *
          * @return  The client, as either "Web", "Outlook", or "Mobile"
          */
-        getClient(): string;
+        getClient(): ClientContext.Client;
 
         /**
          * Gets client's current state.
          *
          * @return  The client state, as either "Online" or "Offline"
          */
-        getClientState(): string;
+        getClientState(): ClientContext.ClientState;
+    }
+
+    export module ClientContext {
+        export type Client = "Web" | "Outlook" | "Mobile";
+        export type ClientState = "Online" | "Offline";
     }
 
     /**
@@ -257,7 +262,7 @@ declare namespace Xrm
          *
          * @remarks This function does not work with Dynamics CRM for tablets.
          */
-        getCurrentTheme(): string;
+        getCurrentTheme(): Context.Theme;
 
         /**
          * Gets whether automatic save is enabled.
@@ -344,6 +349,9 @@ declare namespace Xrm
         prependOrgName( sPath: string ): string;
     }
 
+    export module Context {
+        export type Theme = "default" | "Office12Blue" | "Office14Silver";
+    }
     /**
      * Interface for the Xrm.Page.data object.
      */
@@ -437,49 +445,7 @@ declare namespace Xrm
          */
         refreshRibbon(): void;
 
-        /**
-         * Sets a form-level notification.
-         *
-         * @param   {string}    message     The message.
-         * @param   {"ERROR"}   level       An error message.
-         * @param   {string}    uniqueId    A unique identifier for the message.
-         *
-         * @return  true if it succeeds, false if it fails.
-         */
-        setFormNotification( message: string, level: "ERROR", uniqueId: string ): boolean;
-
-        /**
-         * Sets a form-level notification.
-         *
-         * @param   {string}    message     The message.
-         * @param   {"WARNING"} level       A warning message.
-         * @param   {string}    uniqueId    A unique identifier for the message.
-         *
-         * @return  true if it succeeds, false if it fails.
-         */
-        setFormNotification( message: string, level: "WARNING", uniqueId: string ): boolean;
-
-        /**
-         * Sets a form-level notification.
-         *
-         * @param   {string}    message     The message.
-         * @param   {"INFO"}    level       An informational message.
-         * @param   {string}    uniqueId    A unique identifier for the message.
-         *
-         * @return  true if it succeeds, false if it fails.
-         */
-        setFormNotification( message: string, level: "INFO", uniqueId: string ): boolean;
-
-        /**
-         * Sets a form-level notification.
-         *
-         * @param   {string}    message     The message.
-         * @param   {string}    level       The level, as either "ERROR", "WARNING", or "INFO".
-         * @param   {string}    uniqueId    A unique identifier for the message.
-         *
-         * @return  true if it succeeds, otherwise false.
-         */
-        setFormNotification( message: string, level: string, uniqueId: string ): boolean;
+        setFormNotification(message: string, level: Page.ui.FormNotificationLevel, uniqueId: string ): boolean;
 
         process: Page.data.ProcessManager;
 
@@ -725,7 +691,7 @@ declare namespace Xrm
              *
              * @remarks  This method will return either "active" or "inactive".
              */
-            getStatus(): string;
+            getStatus(): Stage.Status;
 
             /**
              * Returns a collection of steps in the stage.
@@ -735,6 +701,10 @@ declare namespace Xrm
             getSteps(): Step[];
         }
 
+        export module Stage {
+            export type Status = "active" | "inactive";
+        }
+
         export interface Step
         {
             /**
@@ -798,7 +768,7 @@ declare namespace Xrm
              *
              * @return  The event source.
              */
-            getEventSource(): Page.Attribute | Page.Entity;
+            getEventSource(): Attribute | Entity;
 
             /**
              * Gets the shared variable with the specified key.
@@ -912,12 +882,9 @@ declare namespace Xrm
             text: string;
 
             /**
-             * The value, as a string.
-             *
-             * @remarks     You must use parseInt to convert this value to a number before you can use it to
-             *              set the value of an OptionSetAttribute.
+             * The value, as a number
              */
-            value: string;
+            value: number;
         }
 
         /**
@@ -1024,7 +991,7 @@ declare namespace Xrm
              *
              * @return  The required level, as either "none", "required", or "recommended"
              */
-            getRequiredLevel(): string;
+            getRequiredLevel(): Attribute.RequirementLevel;
 
             /**
              * Gets current submit mode for the attribute.
@@ -1033,7 +1000,7 @@ declare namespace Xrm
              *
              * @remarks The default value is "dirty"
              */
-            getSubmitMode(): string;
+            getSubmitMode(): Attribute.SubmitMode;
 
             /**
              * Gets the current user's privileges for the attribute.
@@ -1049,54 +1016,12 @@ declare namespace Xrm
              */
             removeOnChange( handler: ContextSensitiveHandler ): void;
 
-            /**
-             * Sets required level.
-             *
-             * @param   {"none"}    requirementLevel    Not required.
-             */
-            setRequiredLevel( requirementLevel: "none" ): void;
-
-            /**
-             * Sets required level.
-             *
-             * @param   {"required"}    requirementLevel    Required.
-             */
-            setRequiredLevel( requirementLevel: "required" ): void;
-
-            /**
-             * Sets required level.
-             *
-             * @param   {"recommended"}    requirementLevel    Recommended.
-             */
-            setRequiredLevel( requirementLevel: "recommended" ): void;
-
             /**
              * Sets the required level.
              *
              * @param   {string}    requirementLevel    The requirement level, as either "none", "required", or "recommended"
              */
-            setRequiredLevel( requirementLevel: string ): void;
-
-            /**
-             * Sets submit mode.
-             *
-             * @param   {"always"}    submitMode  Always submit this attribute.
-             */
-            setSubmitMode( submitMode: "always" ): void;
-
-            /**
-             * Sets submit mode.
-             *
-             * @param   {"never"}    submitMode  Never submit this attribute.
-             */
-            setSubmitMode( submitMode: "never" ): void;
-
-            /**
-             * Sets submit mode.
-             *
-             * @param   {"dirty"}    submitMode  Submit this attribute when changed.
-             */
-            setSubmitMode( submitMode: "dirty" ): void;
+            setRequiredLevel(requirementLevel: Attribute.RequirementLevel): void;
 
             /**
              * Sets the submit mode.
@@ -1105,7 +1030,7 @@ declare namespace Xrm
              *
              * @remarks The default value is "dirty"
              */
-            setSubmitMode( submitMode: string ): void;
+            setSubmitMode(submitMode: Attribute.SubmitMode): void;
 
             /**
              * A collection of all the controls on the form that interface with this attribute.
@@ -1113,6 +1038,11 @@ declare namespace Xrm
             controls: Collection.ItemCollection<Control>;
         }
 
+        export module Attribute {
+            export type RequirementLevel = "none" | "recommended" | "required" ;
+            export type SubmitMode = "always" | "dirty" | "never";
+        }
+
         /**
          * Interface for a Number attribute.
          *
@@ -1426,27 +1356,13 @@ declare namespace Xrm
              */
             save(): void;
 
-            /**
-             * Saves the record with the given save mode.
-             *
-             * @param   {"saveandclose"}    saveMode    Saves the record, and closes the form.
-             */
-            save( saveMode: "saveandclose" ): void;
-
-            /**
-             * Saves the record with the given save mode.
-             *
-             * @param   {"saveandnew"}  saveMode    Saves the record, and opens a blank form.
-             */
-            save( saveMode: "saveandnew" ): void;
-
             /**
              * Saves the record with the given save mode.
              *
              * @param   {string}    saveMode    (Optional) the save mode to save, as either "saveandclose" or
              *                                  "saveandnew".
              */
-            save( saveMode: string ): void;
+            save( saveMode: Entity.SaveMode ): void;
 
             /**
              * The collection of attributes for the record.
@@ -1454,6 +1370,10 @@ declare namespace Xrm
             attributes: Collection.ItemCollection<Attribute>;
         }
 
+        export module Entity {
+            export type SaveMode = "saveandclose" | "saveandnew";
+        }
+
         /**
          * Interface for save event arguments.
          */
@@ -1512,7 +1432,7 @@ declare namespace Xrm
                 /**
                  * Set a Process as the active process.
                  *
-                 * @param   {string}    processId           the Id of the process to make the active process.
+                 * @param   {string}    processId           The Id of the process to make the active process.
                  * @param   {function}  callbackFunction    (Optional) a function to call when the operation is complete.
                  */
                 setActiveProcess( processId: string, callbackFunction?: ProcessCallbackDelegate ): void;
@@ -1548,30 +1468,59 @@ declare namespace Xrm
                  * Use this method to asynchronously retrieve the enabled business process flows that the user can switch to for an
                  * entity.
                  *
-                 * @param   {Function} callbackFunction                                 The callback function must accept a parameter
-                 *                                                                      that contains an object with dictionary
-                 *                                                                      properties where the name of the property is the
-                 *                                                                      Id of the business process flow and the value of
-                 *                                                                      the property is the name of the business process
-                 *                                                                      flow.
-                 *
-                 *                                                                      The enabled processes are filtered according to
-                 *                                                                      the user’s privileges. The list of enabled
-                 *                                                                      processes is the same ones a user can see in the
-                 *                                                                      UI if they want to change the process manually.
+                 * @param   {Function} callbackFunction The callback function must accept a parameter that contains an object with 
+                 *                                      dictionary properties where the name of the property is the Id of the
+                 *                                      business process flow and the value of the property is the name of the
+                 *                                      business process flow.
+                 *                                      
+                 *                                      The enabled processes are filtered according to the user’s privileges. The
+                 *                                      list of enabled processes is the same ones a user can see in the UI if they
+                 *                                      want to change the process manually.
                  */
                 getEnabledProcesses( callbackFunction: ( enabledProcesses: ProcessDictionary ) => void ): void;
 
+                /**
+                 * Use this method to get the currently selected stage.
+                 *
+                 * @return  The currently selected stage.
+                 */
+                getSelectedStage(): Stage;
+
                 /**
                  * Use this to add a function as an event handler for the OnStageChange event so that it will be called when the
                  * business process flow stage changes.
-                 *
-                 * @param   {ContextSensitiveHandler}   handler The function will be added to the bottom of the event handler
-                 *                                              pipeline. The execution context is automatically set to be the first
-                 *                                              parameter passed to the event handler.
+                 * @param   {ContextSensitiveHandler}   handler The function will be added to the bottom of the event
+                 *                                              handler pipeline. The execution context is automatically
+                 *                                              set to be the first parameter passed to the event handler.
+                 * 
+                 *                                              Use a reference to a named function rather than an
+                 *                                              anonymous function if you may later want to remove the
+                 *                                              event handler.
                  */
                 addOnStageChange( handler: ContextSensitiveHandler ): void;
 
+                /**
+                 * Use this to add a function as an event handler for the OnStageSelected event so that it will be called
+                 * when a business process flow stage is selected.
+                 *
+                 * @param   {ContextSensitiveHandler}   handler The function will be added to the bottom of the event
+                 *                                              handler pipeline. The execution context is automatically
+                 *                                              set to be the first parameter passed to the event handler.
+                 * 
+                 *                                              Use a reference to a named function rather than an
+                 *                                              anonymous function if you may later want to remove the
+                 *                                              event handler.
+                 */
+                addOnStageSelected(handler: ContextSensitiveHandler): void;
+
+                /**
+                 * Use this to remove a function as an event handler for the OnStageChange event.
+                 *
+                 * @param   {ContextSensitiveHandler}   handler If an anonymous function is set using the addOnStageChange method it
+                 *                                              cannot be removed using this method.
+                 */
+                removeOnStageChange(handler: ContextSensitiveHandler): void;
+
                 /**
                  * Use this to remove a function as an event handler for the OnStageChange event.
                  *
@@ -1621,7 +1570,7 @@ declare namespace Xrm
          *
          * @sa  UiElement
          */
-        export interface Control extends UiElement
+        export interface Control extends UiElement, UiFocusable
         {
             /**
              * Clears the notification identified by uniqueId.
@@ -2037,7 +1986,7 @@ declare namespace Xrm
              *
              * @return  The display state, as either "expanded" or "collapsed"
              */
-            getDisplayState(): string;
+            getDisplayState(): ui.DisplayState;
 
             /**
              * Gets the name of the tab.
@@ -2053,26 +2002,12 @@ declare namespace Xrm
              */
             getParent(): Ui;
 
-            /**
-             * Sets display state of the tab.
-             *
-             * @param   {"collapsed"}   displayState    Collapsed tab.
-             */
-            setDisplayState( displayState: "collapsed" ): void;
-
-            /**
-             * Sets display state of the tab.
-             *
-             * @param   {"expanded"}    displayState    Expanded tab.
-             */
-            setDisplayState( displayState: "expanded" ): void;
-
             /**
              * Sets display state of the tab.
              *
              * @param   {string}    displayState   Display state of the tab, as either "expanded" or "collapsed"
              */
-            setDisplayState( displayState: string ): void;
+            setDisplayState(displayState: ui.DisplayState ): void;
 
             /**
              * A reference to the collection of form sections within this tab.
@@ -2117,26 +2052,12 @@ declare namespace Xrm
              */
             export interface ProcessManager
             {
-                /**
-                 * Sets display state of the process flow control.
-                 *
-                 * @param   {"collapsed"}   displayState    Collapsed process flow control.
-                 */
-                setDisplayState( displayState: "collapsed" ): void;
-
-                /**
-                 * Sets display state of the process flow control.
-                 *
-                 * @param   {"expanded"}    displayState    Expanded process flow control.
-                 */
-                setDisplayState( displayState: "expanded" ): void;
-
                 /**
                  * Sets display state of the process flow control.
                  *
                  * @param   {string}    displayState   Display state of the process flow control, as either "expanded" or "collapsed"
                  */
-                setDisplayState( displayState: string ): void;
+                setDisplayState(displayState: ui.DisplayState ): void;
 
                 /**
                  * Sets the visibility state.
@@ -2280,6 +2201,10 @@ declare namespace Xrm
                  */
                 getEntityReference(): LookupValue;
             }
+
+            export type FormNotificationLevel = "ERROR" | "INFO" | "WARNING";
+
+            export type DisplayState = "collapsed" | "expanded";
         }
 
         /**
@@ -2393,7 +2318,7 @@ declare namespace Xrm
              * Accepted values are: "true"    (The command bar is displayed.)
              *                      "false"   (The command bar is not displayed.)
              */
-            cmdbar?: string;
+            cmdbar?: OpenParameters.CmdBarDisplay;
 
             /**
              * Controls whether the Navigation bar is displayed on the form.
@@ -2402,7 +2327,7 @@ declare namespace Xrm
              *                      "entity"  (On an entity form, only the navigation options for related
              *                                entities are available.)
              */
-            navbar?: string;
+            navbar?: OpenParameters.NavBarDisplay;
         }
 
         /**
@@ -2441,7 +2366,7 @@ declare namespace Xrm
              * Accepted values are: "true"    (The command bar is displayed.)
              *                      "false"   (The command bar is not displayed.)
              */
-            cmdbar?: string;
+            cmdbar?: OpenParameters.CmdBarDisplay;
 
             /**
              * Controls whether the Navigation bar is displayed on the form.
@@ -2450,7 +2375,7 @@ declare namespace Xrm
              *                      "entity"  (On an entity form, only the navigation options for related
              *                                entities are available.)
              */
-            navbar?: string;
+            navbar?: OpenParameters.NavBarDisplay;
         }
 
         /**
@@ -2494,7 +2419,7 @@ declare namespace Xrm
              * @remarks  "run"       Executes the report with default filters.
              *           "filter"    Presents the user with the filter editor, and a "Run Report" button.
              */
-            action: string;
+            action: ReportOpenParameters.Action;
 
             /**
              * The file name of the report.  For out-of-box reports, this parameter enables context-sensitive
@@ -2507,6 +2432,15 @@ declare namespace Xrm
              */
             id: string;
         }
+
+        export module ReportOpenParameters {
+            export type Action = "filter" | "run";
+        }
+    }
+
+    export module OpenParameters {
+        export type NavBarDisplay = "entity" | "off" | "on";
+        export type CmdBarDisplay = "true" | "false";
     }
 
     /**
@@ -2544,14 +2478,14 @@ declare namespace Xrm
              *                      "entity"  (On an entity form, only the navigation options for related
              *                                entities are available.)
              */
-            navbar?: string;
+            navbar?: OpenParameters.NavBarDisplay;
 
             /**
              * Controls whether the command bar is displayed.
              * Accepted values are: "true"    (The command bar is displayed.)
              *                      "false"   (The command bar is not displayed.)
              */
-            cmdbar?: string;
+            cmdbar?: OpenParameters.CmdBarDisplay;
         }
 
         /**
@@ -2634,4 +2568,4 @@ declare namespace XrmEnum
         SystemView = 1039,
         UserView = 4230
     }
-}
+}
\ No newline at end of file

From ac5abd39edb542befef9876c5e708bb3cf23a9fd Mon Sep 17 00:00:00 2001
From: Alexey Morozov <alexey.morozov@live.ru>
Date: Fri, 17 Jun 2016 17:37:13 +0300
Subject: [PATCH 109/278] Added Custom Tab Layout types to react-bootstrap.d.ts

---
 react-bootstrap/react-bootstrap-tests.tsx | 27 +++++++++++++++++
 react-bootstrap/react-bootstrap.d.ts      | 35 +++++++++++++++++++++--
 2 files changed, 60 insertions(+), 2 deletions(-)

diff --git a/react-bootstrap/react-bootstrap-tests.tsx b/react-bootstrap/react-bootstrap-tests.tsx
index 36d5c1ab23..3c181e2a9e 100644
--- a/react-bootstrap/react-bootstrap-tests.tsx
+++ b/react-bootstrap/react-bootstrap-tests.tsx
@@ -502,6 +502,33 @@ export class ReactBootstrapTest extends Component<any, any> {
                   </Tabs>
                 </div>
 
+                <div style={style}>
+                  <Tab.Container id="left-tabs-example" defaultActiveKey="first">
+                    <Row className="clearfix">
+                      <Col sm={4}>
+                        <Nav bsStyle="pills" stacked>
+                          <NavItem eventKey="first">
+                            Tab 1
+                          </NavItem>
+                          <NavItem eventKey="second">
+                            Tab 2
+                          </NavItem>
+                        </Nav>
+                      </Col>
+                      <Col sm={8}>
+                        <Tab.Content animation>
+                          <Tab.Pane eventKey="first">
+                            Tab 1 content
+                          </Tab.Pane>
+                          <Tab.Pane eventKey="second">
+                            Tab 2 content
+                          </Tab.Pane>
+                        </Tab.Content>
+                      </Col>
+                    </Row>
+                  </Tab.Container>
+                </div>
+
                 <div style={style}>
                   <Pager>
                     <PageItem href='#'>Previous</PageItem>
diff --git a/react-bootstrap/react-bootstrap.d.ts b/react-bootstrap/react-bootstrap.d.ts
index 366eeef7b5..6b962ae8fa 100644
--- a/react-bootstrap/react-bootstrap.d.ts
+++ b/react-bootstrap/react-bootstrap.d.ts
@@ -435,8 +435,39 @@ declare module "react-bootstrap" {
         animation?: boolean;
         eventKey?: any; // TODO: Add more specific type
     }
-    type Tab = React.ClassicComponent<TabProps, {}>;
-    var Tab: React.ClassicComponentClass<TabProps>;
+    interface TabClass extends React.ClassicComponentClass<TabProps> {
+      Container: TabContainer;
+      Pane: TabPane;
+      Content: TabClass;
+    }
+    type Tab = TabClass;
+    var Tab: TabClass;
+    
+    // <Tab.Container />
+    // ----------------------------------------
+    interface TabContainerProps extends React.HTMLAttributes {
+      activeKey?: any;
+      defaultActiveKey?: any;
+      generateChildId?: (eventKey: any, type: any) => string;
+    }
+    type TabContainer = React.ClassicComponentClass<TabContainerProps>;
+    
+    // <Tab.Pane />
+    // ----------------------------------------
+    interface TabPaneProps extends React.HTMLAttributes {
+      animation?: boolean | React.ComponentClass<any>;
+      'aria-labelledby'?: string;
+      bsClass?: string;
+      eventKey?: any;
+      onEnter?: Function;
+      onEntered?: Function;
+      onEntering?: Function;
+      onExit?: Function;
+      onExited?: Function;
+      onExiting?: Function;
+      unmountOnExit?: boolean;
+    }
+    type TabPane = React.ClassicComponentClass<TabPaneProps>;
 
     // <Pager />
     // ----------------------------------------

From 29a02fd8d48be28e395156adc5579cb5dafc9aaf Mon Sep 17 00:00:00 2001
From: SLathrop <steve@stevelathrop.net>
Date: Fri, 17 Jun 2016 10:46:58 -0400
Subject: [PATCH 110/278] Add public Knex API TableBuilder.bigIncrements

---
 knex/knex.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index c3ede588e8..e147f0db45 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -312,6 +312,7 @@ declare module "knex" {
 
     interface TableBuilder {
       increments(columnName?: string): ColumnBuilder;
+      bigIncrements(columnName?: string): ColumnBuilder;
       dropColumn(columnName: string): TableBuilder;
       dropColumns(...columnNames: string[]): TableBuilder;
       renameColumn(from: string, to: string): ColumnBuilder;

From 74ae4799a8a34958da998720be07e9da7a931c51 Mon Sep 17 00:00:00 2001
From: SLathrop <steve@stevelathrop.net>
Date: Fri, 17 Jun 2016 13:55:30 -0400
Subject: [PATCH 111/278] Add public Knex API
 SchemaBuilder.createTableIfNotExists

---
 knex/knex.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index e147f0db45..76c6d7e521 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -301,6 +301,7 @@ declare module "knex" {
 
     interface SchemaBuilder extends Promise<any> {
       createTable(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
+      createTableIfNotExists(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
       renameTable(oldTableName: string, newTableName: string): Promise<void>;
       dropTable(tableName: string): SchemaBuilder;
       hasTable(tableName: string): Promise<boolean>;

From 6218c2da990ee9d2a6986cb38f892b38b6509f21 Mon Sep 17 00:00:00 2001
From: delphinus <delphinus@remora.cx>
Date: Sat, 18 Jun 2016 21:14:15 +0900
Subject: [PATCH 112/278] Add definition for jquery.imagemapster

---
 .../jquery.imagemapster-tests.ts              |  88 ++
 jquery.imagemapster/jquery.imagemapster.d.ts  | 996 ++++++++++++++++++
 2 files changed, 1084 insertions(+)
 create mode 100644 jquery.imagemapster/jquery.imagemapster-tests.ts
 create mode 100644 jquery.imagemapster/jquery.imagemapster.d.ts

diff --git a/jquery.imagemapster/jquery.imagemapster-tests.ts b/jquery.imagemapster/jquery.imagemapster-tests.ts
new file mode 100644
index 0000000000..c02047849c
--- /dev/null
+++ b/jquery.imagemapster/jquery.imagemapster-tests.ts
@@ -0,0 +1,88 @@
+///<reference path="./jquery.imagemapster.d.ts" />
+///<reference path="../jquery/jquery.d.ts" />
+
+const areaOptions: JQueryImageMapster.AreaRenderingOptions = {
+    key:         "foo",
+    includeKeys: "foo",
+    isMask:      true,
+    toolTip:     "tooltip",
+};
+
+const onClickData: JQueryImageMapster.OnClickData = {
+    listTarget: $(),
+    key:        "foo",
+    e:          $.Event("click"),
+    selected:   true,
+}
+
+const onMouseData: JQueryImageMapster.OnMouseData = {
+    key:      "foo",
+    selected: true,
+    e:        $.Event("click"),
+    options:  areaOptions,
+};
+
+const onGetListData: JQueryImageMapster.OnGetListData = {
+    key:     "foo",
+    value:   "foo",
+    area:    [{}],
+    options: areaOptions,
+};
+
+const onStateChangeData: JQueryImageMapster.OnStateChangeData = {
+    key:      "foo",
+    state:    "highlight",
+    selected: true,
+};
+
+const onShowToolTipData: JQueryImageMapster.OnShowToolTipData = {
+    toolTip: $(),
+    key: "foo",
+    selected: true,
+    areaOptions,
+};
+
+const bool = true;
+
+const options: JQueryImageMapster.Options = {
+    mapKey:                "foo",
+    mapValue:              "foo",
+    clickNavigate:         true,
+    listKey:               "foo",
+    listSelectedAttribute: "foo",
+    listSelectedClass:     "foo",
+    wrapClass:             "foo",
+    wrapCss:               "foo",
+    mouseoutDelay:         123,
+    sortList:              "asc",
+    configTimeout:         123,
+    scaleMap:              true,
+    noHrefIsMask:          true,
+    boundList:             $(),
+    showToolTip:           true,
+    toolTipContainer:      $(),
+    toolTipClose:          ["area-mouseout", "area-click", "tooltip-click", "image-mouseout"],
+    onClick:               onClickData => {},
+    onMouseover:           onMouseData => {},
+    onMouseout:            onMouseData => {},
+    onGetList:             onGetListData => $(),
+    onConfigured:          bool => {},
+    onStateChange:         onStateChangeData => {},
+    onShowToolTip:         onShowToolTipData => {},
+};
+
+$("img").mapster(options)
+$("img").mapster("select")
+$("img").mapster("deselect")
+$("img").mapster("set", true, options)
+$("img").mapster("get", "foo")
+$("img").mapster("highlight", true)
+$("img").mapster("unbind", true)
+$("img").mapster("snapshot")
+$("img").mapster("rebind", options)
+$("img").mapster("resize", 123, 123, 123)
+$("img").mapster("keys", "foo", true)
+$("img").mapster("keys", true)
+$("img").mapster("set_options", options)
+$("img").mapster("get_options", "foo", true)
+$("img").mapster("tooltip", "foo");
diff --git a/jquery.imagemapster/jquery.imagemapster.d.ts b/jquery.imagemapster/jquery.imagemapster.d.ts
new file mode 100644
index 0000000000..3602f4eed3
--- /dev/null
+++ b/jquery.imagemapster/jquery.imagemapster.d.ts
@@ -0,0 +1,996 @@
+// Type definitions for jquery.imagemapster 1.2.10
+// Project: http://www.outsharked.com/imagemapster/
+// Definitions by: delphinus <https://github.com/delphinus35/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+///<reference path="../jquery/jquery.d.ts" />
+
+declare namespace JQueryImageMapster {
+
+    type Select = "select";
+    type Deselect = "deselect";
+    type Set = "set";
+    type Get = "get";
+    type Highlight = "highlight";
+    type Unbind = "unbind";
+    type Resize = "resize";
+    type Snapshot = "snapshot";
+    type Rebind = "rebind";
+    type Keys = "keys";
+    type SetOptions = "set_options";
+    type GetOptions = "get_options";
+    type Tooltip = "tooltip";
+    type ToolTipCloseEvent = "area-mouseout" | "area-click" | "tooltip-click" | "image-mouseout";
+    type State = "highlight" | "select";
+
+    interface RenderingOptions {
+
+        /**
+         * fade effect - can only be applied to "render_highlight".
+         *
+         * Use a fade effect when highlighting areas on mouseover.
+         */
+        fade?: boolean;
+
+        /**
+         * The duration of the fade-in effect, in milliseconds.
+         */
+        fadeDuration?: number;
+
+        /**
+         * highlight areas on mouseover. When null (default), the behavior is
+         * disabled for mobile browsers. You can explicitly enable or disable
+         * it by setting this option to a boolean value.
+         */
+        highlight?: boolean;
+
+        /**
+         * the map or an area on the map can be selected (or deselected).
+         *
+         * When true, the image map will function like a multiple-select menu.
+         * Users can click any area to select or deselect it. When applied to
+         * the entire map, it determines whether or not the click-selection
+         * functionality is enabled. When applied to an area, it determines
+         * whether that individual area (or group) can be selected. By default,
+         * the map and all areas are selectable.
+         */
+        isSelectable?: boolean;
+
+        /**
+         * the map or area on the map can be deselected.
+         *
+         * Normally true, this option can be used to prevent users from
+         * unselecting items once they have been selected. When combined with
+         * singleSelect, the effect is that one and only one option can be
+         * selected at any given time. Users cannot deselect the active option.
+         * This provides a menu-like functionality. It is possible for zero
+         * items to be selected if this is the default state (or the only
+         * selected item is deselected programatically).
+         */
+        isDeselectable?: boolean;
+
+        /**
+         * only one area can be selected at a time
+         *
+         * When true, only one or zero areas can be selected at any given time.
+         * If an area is selected and the user selects another area, the
+         * previously selected area will become deselected. Unlike
+         * "staticState", this property cannot be overridden by setting areas
+         * programatically, only one (or zero) areas can ever be selected when
+         * this option is true.
+         */
+        singleSelect?: boolean;
+
+        /**
+         * the map or area is permanently in a selected or deselected state.
+         *
+         * When true or false, the map or area to which this option applies
+         * will be permanently selected or deselected. Typically this is more
+         * useful applied to individual areas that you want to exclude from the
+         * interactive part of the map.
+         *
+         * staticState forces an area to be always selected or deselected. If
+         * set, this will supercede isSelectable. Something with a staticState
+         * will always be in that state and it cannot be changed by the user.
+         * Note that when setting states programatically, this option will not
+         * be honored; it only affects user interaction.
+         */
+        staticState?: boolean;
+
+        /**
+         * initial selection state of an area.
+         *
+         * The area in question is selected. To set default selections when
+         * creating a new mapster, use this option for a specific area (see
+         * above).
+         */
+        selected?: boolean;
+
+        /**
+         * Use an alternate image of the same size as the imagemap as the
+         * source for highlight or select effects.
+         *
+         * When specified, the mapster will highlight areas using the image
+         * data obtained from the same area in an alternate image, instead of
+         * using a fill effect to highlight or select the area. This feature is
+         * currently available in browsers with HTML5 canvas support. In
+         * practical terms, this means it will work in all commonly used
+         * browsers except IE 8 or lower.
+         *
+         * If this feature is enabled when an unsupported browser is used, it
+         * will fall back to the normal highlight method.
+         *
+         * The fill, stroke and opacity effects can be specified independently
+         * from those used for the normal higlight effect. This ensures that
+         * when your page is viewed with a non-supported browser, you can still
+         * control the rendering as would be appropriate for a normal
+         * fill/stroke effect, which may be different from when you're using an
+         * alternate image.
+         */
+        altImage?: string;
+        altImageFill?: boolean;
+        altImageStroke?: boolean;
+        altImageOpacity?: number;
+
+        /**
+         * Areas should be flood-filled when moused over or highlighted.
+         */
+        fill?: boolean;
+
+        /**
+         * The color used for flood fill.
+         */
+        fillColor?: string;
+        fillColorMask?: string;
+
+        /**
+         * The opacity of the fill. This is a number from 0 to 1.
+         */
+        fillOpacity?: number;
+
+        /**
+         * Areas should be outlined when moused over or highlighted.
+         */
+        stroke?: boolean;
+
+        /**
+         * The color of the outline.
+         */
+        strokeColor?: string;
+
+        /**
+         * The opacity of the outline.
+         */
+        strokeOpacity?: number;
+
+        /**
+         * The width of the outline.
+         */
+        strokeWidth?: number;
+
+        /**
+         * The options below control the way highlighted areas are rendered.
+         * Each can be applied globally to the map, or to each element, using
+         * the areas option to pass area-specific options. These options apply
+         * to either highlighted or selected areas. Highlighting occurs when
+         * the mouse enters an area on the image map. Selection occurs when an
+         * area is clicked, and selection is enabled. These options will be
+         * applied to both situations if present in the root of the options
+         * object. They can also be applied to one or the other situations
+         * specifically using the render_highlight and render_select options.
+         */
+        render_highlight?: string | RenderingOptions;
+        render_select?: string | RenderingOptions;
+    }
+
+    interface AreaRenderingOptions extends RenderingOptions {
+
+        key: string;
+
+        /**
+         * when rendering an area or area group, also render the areas in the
+         * other group (or groups) specified
+         *
+         * This is an area-specific option that allows you to create
+         * supergroups. A supergroup is a collection of groups that will all be
+         * highlighted simultaneously, but only when the area that defines the
+         * supergroup is moused over or activated through code.
+         *
+         * When the area for which this option has been set is activated, all
+         * the areas specified in the includeKeys list will also be rendered.
+         * This is a one-way relationship. Defining a supergroup in an area
+         * causes all the other groups to be highlighted, but not the other way
+         * around.
+         *
+         * A typical use of this is to define areas that you want to be
+         * highlighted when the mouse enters some specific area, but that you
+         * do not want to be highlighted on their own if the target area is
+         * moused over. This could be a hidden menu, for example: you want the
+         * menu to display when the hotspot is moused over, but when it's
+         * hidden, mousing over the menu area itself should have no effect.
+         */
+        includeKeys?: string;
+
+        /**
+         * the area is a mask rather than a highlighted area.
+         *
+         * Normally, every area in an imagemap is an active area, and would be
+         * highlighted when moused over (unless its behavior was otherwise
+         * specified with staticState). The isMask option allows you to
+         * identify an area as being a mask. When a mask is part of an area
+         * group, the masked area will be specifically excluded from the
+         * rendering of a highlight or selected state.
+         *
+         * This is usually used in conjunction, or instead of, the nohref
+         * attribute of the area tag. When nohref is specified on an area tag,
+         * that area is specifically excluded from the hotspot of any area that
+         * encompasses it. It will not respond to mouse events, and will not be
+         * highlighted. This can be used to create "holes" in hotspots. By
+         * default, ImageMapster will treat any area with nohref or no href tag
+         * as masks, the same as if this option had been applied.
+         *
+         * Sometimes you won't be able to use nohref to identify something as a
+         * mask, for example, if you intend to re-use an area has both a mask,
+         * and an independent hotspot. This would be typical if you wanted to a
+         * selectable area that was completely included within another
+         * selectable area, but functioned independently, such as concentric
+         * circles. In this case, you would need to identify the inner circle
+         * as both a mask, and a hotspot. The nohref attribute would make it
+         * not act as a hotspot, and only function as a mask. You couldn't also
+         * select the inner area. You can solve this problem by including the
+         * inner circle in two different groups - one group which is a mask for
+         * the main area, and another which is an independent selectable area.
+         * You can specify different options for each group, so even though
+         * it's just one area, it can function as two completely independent
+         * ones.
+         *
+         * There may also be situations where you do not want an area marked
+         * with nohref to be treated as a mask. For example, given "area1" and
+         * "area2," you may want to create a configuration where mousing over
+         * "area1" causes both "area1" and "area2" to be highlighted, but
+         * "area2" should not be highlighted on its own when it is moused over.
+         * In this situation, you'll need to use "nohref" to prevent the hover
+         * behavior for the area, but you still want it to be treated normally
+         * when it's rendered as a result of mousing over "area1." You can
+         * accomplish this using the noHrefIsMask global option, below.
+         *
+         * Generally, masked areas will appear as a window to the underlying
+         * image. If stroke is in effect, the stroke will be rendered for the
+         * mask as well as the areas, to create both inner and outer borders.
+         * You can always specifically enable or disable this, or any other
+         * effect, for any area as desired.
+         *
+         */
+        isMask?: boolean;
+
+        /**
+         * tool tip data for an area
+         *
+         * When this area-specific option is present and showToolTips = true, a
+         * toolTipContainer will be created this will be inserted into it,
+         * either as inner text (if only text as passed) or as HTML if a jQuery
+         * object is passed. In order to pass anything other than plain text
+         * using this option you must use a jQuery object. Any string will be
+         * treated as plain text (and special characters rendered correctly).
+         */
+        toolTip?: string;
+    }
+
+    interface OnClickData {
+
+        /**
+         * $(item) from boundList
+         */
+        listTarget?: JQuery;
+
+        /**
+         * mapKey for this area
+         */
+        key: string;
+
+        e: JQueryEventObject;
+        selected: boolean;
+    }
+
+    interface OnStateChangeData {
+
+        /**
+         * map key
+         */
+        key: string;
+
+        state: "highlight" | "select";
+
+        /**
+         * indicating the current state (following the event)
+         */
+        selected: boolean;
+    }
+
+    interface OnMouseData {
+
+        /**
+         * area key
+         */
+        key: string;
+
+        /**
+         * true if area is currently selected
+         */
+        selected: boolean;
+
+        e: JQueryEventObject;
+        options: AreaRenderingOptions;
+    }
+
+    interface OnGetListData {
+
+        /**
+         * primary mapKey for this area or area group
+         */
+        key: string;
+
+        /**
+         * mapValue for this area or group
+         */
+        value: string;
+
+        /**
+         * array of areas that make up this group
+         */
+        area: any[];
+
+        options: AreaRenderingOptions;
+    }
+
+    interface OnShowToolTipData {
+
+        /**
+         * jQuery object of the tooltip container
+         */
+        toolTip: JQuery;
+
+        /**
+         * map key for this area
+         */
+        key: string;
+
+        /**
+         * current state of the area
+         */
+        selected: boolean;
+
+        areaOptions: AreaRenderingOptions;
+    }
+
+    interface Options extends RenderingOptions {
+
+        /**
+         * an attribute identifying each imagemap area.
+         *
+         * If specified, this refers to an attribute on the area tags that will
+         * be used to group them logically. Any areas containing the same
+         * mapKey will be considered part of a group, and rendered together
+         * when any of these areas is activated. If you don't want this
+         * functionality, ensure each key is unique. When mapKey is omitted,
+         * then each area is considered to be independent from the other and no
+         * grouping is applied.
+         *
+         * When mapKey is present, any area tags that are missing this
+         * attribute will be excluded from the image map e ntirely. This is
+         * functionally identical to setting staticState=false for these areas,
+         * except they will be inaccessible through the API.
+         *
+         * ImageMapster will work with any attribute you identify as a key. If
+         * you wish to maintain HTML compliance, it's recommeded that you use
+         * attribute names starting with "data-", for example, data-mapkey. Any
+         * such names are legal for the HTML5 document type. If you are using
+         * older document types, the class attribute is part of the HTML spec
+         * for area and will not cause any visual effects, so this is also a
+         * good choice. It is not recommended to use id, since the values of
+         * this attribute must be unique. title and alt also will cause
+         * possibly undesired side effects.
+         *
+         * You can specify more than one value in the mapKey attribute,
+         * separated by commas. This will cause an area to be a member of more
+         * than one group. The area may have different options in the context
+         * of each group. When the area is physically moused over, the first
+         * key listed will identify the group that's effective for that action.
+         */
+        mapKey?: string;
+
+        /**
+         * an attribute on each area tag containing additional descriptive
+         * information about an area.
+         *
+         * This option is applicable only when using onGetList. When set, the
+         * data provided to the callback function will include the value of
+         * this attribute for each group. This can be used to simplify building
+         * a list with associated information, without having to match against
+         * another resource. It also ties this information to the image map
+         * itself. It is not required to use this option when using onGetList.
+         *
+         * For example, you could set mapValue: 'data-statename' to an imagemap
+         * of the united states, and add an attribute to your areas that
+         * provided the full name of each state, e.g. data-statename="Alaska".
+         * This text would be included in the onGetList callback, and so you
+         * could use it to construct an external list of states.
+         *
+         * If there are grouped areas (areas with the same key), then the value
+         * from the first area found with data in this attribute will be used.
+         */
+        mapValue?: string;
+
+        /**
+         * Clicking on a link should cause the browser to navigate to the href
+         * whenever it's not a hash sign (#). Version 1.2.4.050 and later
+         *
+         * By default, ImageMapster will prevent the default browser behavior
+         * in image maps, and "select" areas when they are clicked. If you want
+         * to navigate to the url for an area, use this option. When enabled,
+         * all areas that have an href attribute, and its value is not empty or
+         * "#" (just a hashtag).
+         *
+         * When area grouping is used, if an href is present for any area in
+         * the primary group, this will be used as the navigation target. This
+         * way you don't need to copy the url for every area in groups, rather,
+         * you can include it on just one, and clicking any area will cause the
+         * appropraite navigation.
+         */
+        clickNavigate?: boolean;
+
+        /**
+         * an attribute on items in a boundList that corresponds to the value
+         * of the mapKey attributes.
+         *
+         * This is used to synchronize the actions on the imagemap with the
+         * actions on a boundList. Each value should match a value from the
+         * imageMap mapKey tag. Any item in the boundList with missing or
+         * mismatched data will be ignored.
+         */
+        listKey?: string;
+
+        /**
+         * attribute to set or remove when an area is selected or deselected
+         *
+         * If boundList is present, when a map area is selected, set or remove
+         * this attribute on the list element that matches that area based on
+         * their respective keys.
+         */
+        listSelectedAttribute?: string;
+
+        /**
+         * a class to add or remove when an area is selected or deselected
+         *
+         * If a boundList is present, when a map area is selected, this class
+         * is added or removed from the corresponding list element. This can be
+         * used to easily create any kind of associated action when areas on
+         * the map are changed.
+         */
+        listSelectedClass?: string;
+
+        /**
+         *
+         * define area-specific options; each object in the array must contain
+         * a "key" property identifying a valid mapKey, and additional
+         * rendering options specific to that area or group
+         */
+        areas?: AreaRenderingOptions[],
+
+        /**
+         * add "classname" class to the wrapper created around the image, or
+         * copy classes from the image if "true"
+         */
+        wrapClass?: string | boolean;
+
+        /**
+         * add CSS to the wrapper created around the image
+         */
+        wrapCss?: string | boolean;
+
+        /**
+         * delay removing highlight when mouse exits an area (1.2.5b36)
+         *
+         * Normally, when the user's mouse pointer exits an area, the highlight
+         * effect is removed immediately. This behavior can be changed with
+         * this option. Setting it to a positive number causes a delay of n
+         * milliseconds before the effect is removed. Setting to -1 causes the
+         * effect to remain active until another hotspot is entered (e.g., it
+         * will only be removed when superceded by a different area being
+         * highlighted).
+         *
+         * When using mouseoutDelay, the onMouseover event will still be fired
+         * at the time the user's mouse pointer leaves the area. However, the
+         * onStateChange event will be delayed until the highlight is actually
+         * removed.
+         *
+         * Whether or not you are using mouseoutDelay, only one area can be
+         * highlighted at a time. That is, whenever the mouse pointer moves
+         * onto a new active area, any previously highlighted area will become
+         * un-highlighted, regardless of any delay in effect. Hovering over a
+         * new area will always supercede any delay and cause the new area (and
+         * only the new area) to be highlighted at that time. So, for dense
+         * imagemaps where most areas adjoin one another, this option may not
+         * have much effect within the boundaries of the imagemap. Rather, it
+         * is intended to help keep the higlights active for imagemaps that are
+         * sparse, or have very small areas.
+         */
+        mouseoutDelay?: number;
+
+        /**
+         * sort the values before calling onGetList
+         *
+         * If a non-false value or "asc" is passed, the list will be sorted in
+         * ascending order by the area value from mapValue. If "desc" is
+         * passed, the list will be sorted in descending order.
+         */
+        sortList?: boolean | "asc" | "desc";
+
+        /**
+         * time (in milliseconds) to wait for images to load before giving up
+         *
+         * When first bound, ImageMapster has to wait for the source image,and
+         * any altImage images to load before it can finish binding. This is
+         * necessary because otherwise it's not alwasy possible to know the
+         * native size of the images. After this period of time, ImageMapster
+         * will give up. If you have particularly large pages or images, you
+         * may want to increase this to account for long load times.
+         */
+        configTimeout?: number;
+
+        /**
+         * Automatically scale imagemaps to match the size of a
+         * dynamically-scaled image.
+         *
+         * When you render an image, you can optionally define a size through
+         * CSS or using the "height" and "width" attributes. If omitted, the
+         * image will be displayed in its native size. If included, browsers
+         * will automatically resize the image to display in the dimensions you
+         * have provided.
+         *
+         * Starting with 1.1.3, ImageMapster will automatically recalculate all
+         * area data to match the effective size of the image. This means that
+         * you can set the size of your image to anything you want and
+         * ImageMapster will work with no changes at all needed to the "area"
+         * data.
+         *
+         * If this behavior is not desired for some reason, this can be
+         * disabled by setting this option to false.
+         */
+        scaleMap?: boolean;
+
+        /**
+         * Treat areas containing the onhref attribute (or missing the href
+         * attribute) as masks. This is true by default.
+         *
+         * Set this to "false" to disable automatic masking of these areas. You
+         * can control them explicitly by creating independent groups for areas
+         * you wish to mask and assigning the isMask area-specific option when
+         * using this option.
+         *
+         * There are some things to be aware of when using nohref and masking:
+         *
+         * * You must put the area that include the nohref attribute before
+         * other areas that overlap it, or it will be ignored.
+         *
+         * * You should also explicitly omit the href tag when using nohref.
+         *
+         * * Due to limitations in rendering with VML (e.g. Internet Explorer
+         * 6-8), it is not possible to create a true mask, which would allow
+         * the underlying image to show through the masked area. Instead, the
+         * "masked" areas are rendered on top of the highlighted area in a
+         * different color. This can be specified for each area (see the
+         * fillColorMask option below) to create the best possible effect.
+         */
+        noHrefIsMask?: boolean;
+
+        /**
+         * a jQuery object whose elements are bound to the map.
+         *
+         * boundList can be any list of objects. To be bound to the map, they
+         * must contain an attribute whose name is identified by the option
+         * listKey, and whose value matches the value in an area tag's mapKey
+         * attribute. If more than one element in the list has the same value,
+         * the action will affect all matching elements.
+         */
+        boundList?: JQuery;
+
+        /**
+         * enable tooltips
+         *
+         * When showToolTip is true, mapster will look for a property called
+         * toolTip in the areas option for a an area. If present, a tool tip
+         * dialog will be shown on mouseover for that area. It will
+         * automatically be closed according to the behavior specified by
+         * toolTipClose. This option does not apply at the item level, but
+         * rather enables tooltips for the entire map. At the item level, only
+         * the presence of tooltip data is necessary for a tooltip to appear.
+         */
+        showToolTip?: boolean;
+
+        /**
+         * HTML describing the popup that will be created for tooltips.
+         *
+         * A div with some simple styling is included as the default tooltip
+         * container. This can be replaced with anything using this option.
+         *
+         * When tooltips are rendered, the code attempts to determine the best
+         * place for it. It will try to position it in near the top-left part
+         * of the area, and continue to try other corners in order to render it
+         * within the confines of the container where the image map resides. If
+         * it can't be placed within the image, it will be placed in the
+         * lower-right corner and extend outside the image.
+         */
+        toolTipContainer?: string | JQuery;
+
+        /**
+         * specify the behavior that causes a toolTip to close.
+         *
+         * This option should be passed an array of strings that define the
+         * events that cause active tooltips to close. The array can include
+         * one or more of the following stings:
+         *
+         * 'area-mouseout' - tooltips close when the mouse pointer leaves the
+         * area that activated it. This is the default.
+         *
+         * 'area-click' - tooltips close when another area (or the same one) is
+         * clicked
+         *
+         * 'tooltip-click' - tooltips close when the tooltip itself is clicked
+         * anywhere
+         *
+         * 'image-mouseout' - tooltips close when the mouse pointer leaves the
+         * image itself.
+         *
+         * Under any circumstances, active tooltip will disappear when a new
+         * one is created. You don't have to define an automatic closing
+         * behavior; setting this option to an empty array will result in
+         * tooltips never closing, leaving it to you to close them manually
+         * though the tooltip method.
+         */
+        toolTipClose?: ToolTipCloseEvent[];
+
+        /**
+         * callback when a hotspot area is clicked. Return false to cancel
+         * default select action, or true to navigate to the 'href'
+         */
+
+        /**
+         * a callback when an area is clicked.:silent doautocmd FocusLost %
+         *
+         * This event occurs when the usual click event happens, but includes
+         * data from the mapster about the area:
+         *
+         * This can be used to perform additional actions on a click without
+         * binding another event and having to obtain information manually.
+         */
+        onClick?: (data: OnClickData) => void;
+
+        /**
+         * callback when mouse enters a bound area.
+         *
+         * This function is called when the mouse enters a bound area.
+         */
+        onMouseover?: (data: OnMouseData) => void;
+
+        /**
+         * callback when mouse leavesd a bound area.
+         *
+         * Callback when the mouse leaves a bound area. The data structure
+         * passed to the callback is the same as onMouseover.
+         */
+        onMouseout?: (data: OnMouseData) => void;
+
+        /**
+         * a callback on mapster initialization that provides summary data
+         * about the image map, and expects a jQuery list to be returned.
+         *
+         * This callback allows you to dynamically provide a boundList based on
+         * summary data from the imagemap itself, rather than providing the
+         * list up front. The event passes an array of AreaData objects
+         *
+         * The client should return a jQuery object containing all the elements
+         * that make up the bound list, the same as if it was assigned
+         * manually.
+         */
+        onGetList?: (data: OnGetListData) => JQuery;
+
+        /**
+         * a callback when the mapster has finished initial configuration
+         *
+         * This event is fired when the mapster configuration completes. When
+         * control execution continues after a first-time bind operation, the
+         * mapster is not guaranteed to be configured, because images are
+         * loaded asynchronously by web browsers. If a mapster is bound to an
+         * image that is not yet loaded, it will attempt to rebind every 200
+         * milliseconds. This event will be fired when it is eventually
+         * successful, or the length of time specified by configTimeout is
+         * exceeded (default of ten seconds).
+         *
+         * The altImage option will also increase the time needed to configure,
+         * because the alternate image is loaded by the client at configure
+         * time to ensure it is available immediately when needed.
+         */
+        onConfigured?: (success: boolean) => void;
+
+        /**
+         * callback when area state is changed (either highlight or select).
+         *
+         * onStateChange can be used to get more specific information than the
+         * mouseover or click events.
+         */
+        onStateChange?: (data: OnStateChangeData) => void;
+
+        /**
+         * callback when a toolTip is created
+         *
+         * This can be used to control tooltip closing behavior directly, if
+         * desired.
+         */
+        onShowToolTip?: (data: OnShowToolTipData) => void;
+    }
+}
+
+interface JQuery {
+
+    /**
+     *
+     * All images in the jQuery object will be bound. The specific example
+     * above will attempt to bind to all images present on the page. Each image
+     * must be bound to an image map identified with the usemap attribute. If
+     * there is no usemap attribute, or it does not refer to a valid map, then
+     * the image will be ignored. Therefore you can use this syntax to activate
+     * all imagemaps on a page. Because pages often contain many images,
+     * though, it will be faster to select just the image you are targeting
+     * using a more specific selector.
+     *
+     * Images are often not completely loaded when script execution begins.
+     * ImageMapster will ensure that all images are loaded before it permits
+     * interaction from the client. If an alternate image is specified, this
+     * will also be preloaded.
+     *
+     * Because images are loaded asynchronously, code execution will often
+     * return to your script before the ImageMapster is available. If you apply
+     * other methods to it (such as selecting or deselecting areas), these
+     * commands will be queued until the image has been loaded, and then
+     * executed automatically. So you don't need to worry about using callbacks
+     * for initial configuration. You can assign a function to a callback when
+     * configuration is complete if needed to perform other setup activities on
+     * the page.
+     */
+    mapster(options?: JQueryImageMapster.Options): JQuery;
+
+    /**
+     * select: Cause an area to become selected. This is similar to a user
+     * click, but will not cause a click event to be fired.
+     *
+     * Programatically select elements from the image map. The programmatic
+     * selection/deselection methods will not honor the staticState property.
+     */
+    mapster(method: JQueryImageMapster.Select): void;
+
+    /**
+     * deselect: Cause an area to become deselected
+     *
+     * The opposite of select, this causes an area to become deselected. If it
+     * was not previously selected, nothing changes.
+     */
+    mapster(method: JQueryImageMapster.Deselect): void;
+
+    /**
+     * set: select or deselect an area
+     *
+     * Select or deselect elements from jQuery objects wrapping "area" tags on
+     * the map based on truthiness of selected. If the area represents a bound
+     * area on the imagemap, it will be selected or deselected. The method can
+     * be called from an AREA, or from a bound image, passing a specific key as
+     * a 2nd parameter
+     *
+     * If the selected parameter is omitted (or anything other than "true" or
+     * "false") then the state of each area will be toggled.
+     *
+     * You can include an object containing rendering options as the last
+     * parameter. When present, these will supercede the default and
+     * area-specific rendering options.
+     */
+    mapster(method: JQueryImageMapster.Set, selected: boolean, options: JQueryImageMapster.RenderingOptions): JQuery;
+    mapster(method: JQueryImageMapster.Set, options: JQueryImageMapster.RenderingOptions): JQuery;
+
+    /**
+     * get: get keys for all selected areas
+     *
+     * When no "key" parameter is included, returns a comma-separated list of
+     * keys representing the areas currently selected. If specified, returns
+     * true or false indicating whether the area specified is selected.
+     */
+    mapster(method: JQueryImageMapster.Get, key?: string): string | boolean;
+
+    /**
+     * highlight: highlight, clear, or return highlight state
+     *
+     * This method is used to control or obtain the current highlight state.
+     * Setting the highlight does not mimic a mouseover, rather, it only sets
+     * the highlight. Events and tooltips will not be activated. Even using
+     * these methods, it is not possible to highlight more than one area at a
+     * time. If another area is highlighted programatically, any existing
+     * highlight will be removed.
+     *
+     * Once set this way, the highlight will be removed when any user-event
+     * that would normally cause a highlight to be removed occurs (e.g. moving
+     * the mouse into any area), or it is removed programatically.
+     */
+    mapster(method: JQueryImageMapster.Highlight, flag?: string | boolean): void;
+
+    /**
+     * unbind: unbind ImageMapster from an image
+     *
+     * Removes the ImageMapster binding from an image and restores it to its
+     * original state. All visible elements (selections, tooltips) will be
+     * removed.
+     *
+     * If the optional "preserveState" parameter is true, the selection overlay
+     * and any active tooltips will be preserved. Tooltips can still be
+     * dismissed by a user click, but once unbound, the selection states can no
+     * longer be controlled either by the user or programatically. To remove
+     * them, the actual DOM elements must be removed.
+     *
+     * Notes: When a mapster is first bound, several things happen. A div
+     * element is created which wraps the image. A copy is made of the original
+     * image, and the original image is set be transparent. This allows
+     * creating visible elements for the selections & highlights without
+     * interfering with the image map. Additionally, canvas elements are
+     * created (for HTML5 browsers), or a VML elements are created for Internet
+     * Explorer, to render the effects. Profile information about each bound
+     * image map is stored in memory, and finally, event handlers are bound to
+     * the image map.
+     *
+     * The "unbind" method cleans up these resources: it removes the wrapper,
+     * restores the image to its original visibility state, and releases
+     * internal resources. When using 'preserveState', the internal resources
+     * are cleaned up and event handling is disabled, but HTML elements are not
+     * removed. Each element created by ImageMapster is assigned a class of
+     * "mapster_el", which can be used to target them for later removal, though
+     * it is not easy to complete this process manually because of the wrapper
+     * and styles applied during configuration, which will be left intact when
+     * using "preserveState."
+     */
+    mapster(method: JQueryImageMapster.Unbind, preserveState?: boolean): JQuery;
+
+    /**
+     * snapshot: take a "snapshot" of the current selection state, and reset
+     * ImageMapster
+     *
+     * This option is similar to unbind with preserveState. After a snapshot,
+     * any active selections will still appear as they did at the time of the
+     * snapshot, but they are no longer part of the ImageMapster. This is
+     * useful for configuring an initial state, or creating complex
+     * representations that may not be easily accomplished with area
+     * configuration options.
+     *
+     * For example, you could bind in image with a specific set of options;
+     * programatically select some areas; and take a snapshot; then set new
+     * options that cause a different rendering mode. This way you could have
+     * certain areas appear differently from the selection highlight, but be
+     * "highlighted again" using the new rendering options. Any effects in
+     * place at the time of the snapshot essentially become part of the image
+     * and are not affected by future operations.
+     */
+    mapster(method: JQueryImageMapster.Snapshot): JQuery;
+
+    /**
+     * rebind: rebind ImageMapster with new options
+     *
+     * This method is similar to set_options, in that its purpose is to change
+     * options for an existing bound map. However, unlike set_options rebind
+     * will immediately apply all the new options to the existing map. This
+     * means that rendering options will change areas that are already selected
+     * to be rendered with the new options. If you pass area-specific options,
+     * these will also be applied, e.g. you could cause new areas to be
+     * selected by passing selected: true in an area specific options.
+     *
+     * set_options, in contrast only changes the options, and does not apply
+     * them to any existing data. When using set_options the new options only
+     * apply to future actions.
+     */
+    mapster(method: JQueryImageMapster.Rebind, options: JQueryImageMapster.Options): JQuery;
+
+    /**
+     * resize: change the size of the image and map
+     *
+     * This will resize the image map to the dimensions specified. Note that
+     * either width or height should be passed, and the other will be
+     * calculated in the same aspect ratio as the original image. If you pass
+     * both, only the width will be used to calculate the new dimensions: the
+     * proportions must remain the same as the original image. (Though I intend
+     * to allow scaling without constraining proportions, it will be difficult
+     * to make work for certain shapes -- e.g. circles, which would have to
+     * become ovals).
+     *
+     * This method will recalculate and re-render the entire imagemap, so it
+     * will work exactly the same under the new sizing scheme. When the image
+     * is unbound, the imagemap will be restored to its original condition.
+     *
+     * When using HTML5 canvases, any existing selections, etc. will be
+     * preserved during the animation. VML data cannot be resized dynamically,
+     * however, so in IE<9 the selections will be erased, then redrawn when the
+     * animation is complete.
+     */
+    mapster(method: JQueryImageMapster.Resize, width: number, height: number, duration?: number): JQuery;
+
+    /**
+     * keys: get the primary mapKey (or comma-separated list of keys) for an
+     * area, set of areas, or key group. Version 1.2.4.050
+     *
+     * This method allows you to obtain the primary mapKey (or keys) associated
+     * with another key, or one or more areas. If the all parameter is true,
+     * the method returns all keys or groups that include the area.
+     *
+     * When using area groups, it is possible for more than one key to be
+     * associated with a map area. It's also possible for an area to be
+     * highlighted from code as part of a group, but be inaccessible to the
+     * end-user. This is because area groups are separate physical entities
+     * from the areas defined by their primary key. They can have different
+     * options, and are highlighted independently. Note: the way area groups
+     * work is not well documented here yet. I am working on a more
+     * comprehensive tutorial for the site. In the meantime please see this
+     * example which describes area groups in detail, and shows how they work
+     * through an active demonstration.
+     *
+     * There are reasons you may want to be able to access the primary keys
+     * that make up an area group directly. Perhaps you want to select a group
+     * of areas using the options from a group - but not as a separate group.
+     * Perhaps you want to be able to compare the area clicked against a group
+     * you have defined to take some action if the area is a member of a
+     * certain group. This method provides access to that information.
+     *
+     * This method allows working with groups in a variety of ways by providing
+     * access to a complete list of primary keys in any group, or all keys
+     * which contain a given primary key.
+     */
+    mapster(method: JQueryImageMapster.Keys, key: string, all?: boolean): string | string[];
+    mapster(method: JQueryImageMapster.Keys, all: boolean): string | string[];
+
+    /**
+     * set_options: set active options
+     *
+     * When called without the "options" parameter, returns an object with all
+     * active options. When the parameter is included, the active options are
+     * updated for the imagemap, and any area options are merged with existing
+     * area options. Unlike "rebind", this will not rebind or reapply any
+     * options, but only update the state. This may affect future actions, but
+     * it will not change any existing state information.
+     */
+    mapster(method: JQueryImageMapster.SetOptions, options?: JQueryImageMapster.Options): JQuery;
+
+    /**
+     * get_options: get active options
+     *
+     * When called with no parameters, returns the options that the mapster was
+     * configured using. When called with a single key it returns the
+     * area-specific options assigned to that area. The final parameter
+     * effective determines whether the actual options in effect for this area,
+     * or the specific options assigned are returned.
+     *
+     * Areas inherit the global options assigned, but can be overridden by
+     * area-specific options. The "effective" options contain all options
+     * including those that are inherited, as well as any specifically assigned
+     * to the area.
+     */
+    mapster(method: JQueryImageMapster.GetOptions, key?: string, effective?: boolean): JQueryImageMapster.Options | JQueryImageMapster.AreaRenderingOptions;
+
+    /**
+     * tooltip: show/hide tooltips from code
+     *
+     * See the tooltip options section below for options to control how
+     * tooltips appear and are dismissed.
+     *
+     * This method can be used to manipulate tooltips from code. If the global
+     * showToolTip option is false, these methods will still work, so you have
+     * the ability to control tooltips bound to areas completely using your own
+     * logic, if desired. These methods can also be used to have better control
+     * over events needed to close the tooltip, e.g. you could have no tooltip
+     * closing event, but add a "close" button to your contianer that will
+     * cause the tooltip to close when clicked.
+     */
+    mapster(method: JQueryImageMapster.Tooltip, key?: string): JQuery;
+}

From cde106000aa839d3a86710041d44e11bc1521b1e Mon Sep 17 00:00:00 2001
From: Prashant Tiwari <prashaantt@gmail.com>
Date: Sat, 18 Jun 2016 17:57:08 +0530
Subject: [PATCH 113/278] [material-ui] Add `containerElement` to buttons

All buttons accept a `containerElement` to embed other React elements, such as a `<Link />` from `react-router`.
---
 material-ui/material-ui.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/material-ui/material-ui.d.ts b/material-ui/material-ui.d.ts
index 198f49f7bc..367aae4e11 100644
--- a/material-ui/material-ui.d.ts
+++ b/material-ui/material-ui.d.ts
@@ -641,6 +641,7 @@ declare namespace __MaterialUI {
         touchRippleColor?: string;
         touchRippleOpacity?: number;
         type?: string;
+        containerElement?: React.ReactNode | string;
     }
 
     interface EnhancedButtonProps extends React.HTMLAttributes, SharedEnhancedButtonProps<EnhancedButton> {

From c2b4e013e464715c74e3d6722f98a3bff597d2b8 Mon Sep 17 00:00:00 2001
From: Jeongho Nam <samchon@samchon.org>
Date: Sat, 18 Jun 2016 22:34:42 +0900
Subject: [PATCH 114/278] TypeScript-STL v1.0.0-rc.1

---
 typescript-stl/typescript-stl.d.ts | 13423 +++++++++++++++------------
 1 file changed, 7356 insertions(+), 6067 deletions(-)

diff --git a/typescript-stl/typescript-stl.d.ts b/typescript-stl/typescript-stl.d.ts
index 1286a62084..0ef62635e8 100644
--- a/typescript-stl/typescript-stl.d.ts
+++ b/typescript-stl/typescript-stl.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for TypeScript-STL v0.9.9
+// Type definitions for TypeScript-STL v1.0.0-rc.1
 // Project: https://github.com/samchon/stl
 // Definitions by: Jeongho Nam <http://samchon.org>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -19,7 +19,143 @@
 // ------------------------------------------------------------------------------------
 
 /**
- * STL (Standard Template Library) Containers for TypeScript.
+ * <h1> TypeScript-STL </h1>
+ * <p> <a href="https://nodei.co/npm/typescript-stl">
+ *	<img src="https://nodei.co/npm/typescript-stl.png?downloads=true&downloadRank=true&stars=true"> </a> </p>
+ *
+ * <p> GitHub Repository: https://github.com/samchon/stl </p>
+ *
+ *
+ * <h2> Introduction </h2>
+ * <p> STL (Standard Template Library) Containers and Algorithms for TypeScript. </p>
+ *
+ * <p> TypeScript-STL is a TypeScript's <b>Standard Template Library</b> who is migrated from C++ STL. Most of classes
+ * and functions of STL have implemented. Just enjoy it. </p>
+ *
+ * <p> <img src="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png"
+ *			alt="Abstract Containers"
+ *			style="max-width: 100%" /> </p>
+ *
+ * <h4> Containers </h4>
+ * <ul>
+ *	<li> Linear Containers </li>
+ *	<ul>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.vector.html">Vector</a> </li>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.list.html">List</a> </li>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.deque.html">Deque</a> </li>
+ *		<li> Miscellaneous </li>
+ *		<ul>
+ *			<li> <a href="http://samchon.github.io/stl/api/classes/std.queue.html">Queue</a> </li>
+ *			<li> <a href="http://samchon.github.io/stl/api/classes/std.stack.html">Stack</a> </li>
+ *			<li> <a href="http://samchon.github.io/stl/api/classes/std.priorityqueue.html">PriorityQueue</a> </li>
+ *		</ul>
+ *	</ul>
+ *	<li> <a href="http://samchon.github.io/stl/api/classes/std.base.tree.rbtree.html">Tree-structured Containers</a> </li>
+ *	<ul>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treeset.html">TreeSet</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treemultiset.html">TreeMultiSet</a>
+ *		</li>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treemap.html">TreeMap</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treemultimap.html">TreeMultiMap</a>
+ *		</li>
+ *	</ul>
+ *	<li> <a href="http://samchon.github.io/stl/api/classes/std.base.hash.hashbuckets.html">Hashed Containers</a> </li>
+ *	<ul>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.hashset.html">HashSet</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.hashmultiset.html">TreeMultiset</a>
+ *		</li>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.hashmap.html">HashMap</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.HashMultiMap.html">HashMultiMap</a>
+ *		</li>
+ *	</ul>
+ * </ul>
+ *
+ * <h4> Global Functions </h4>
+ * <ul>
+ *	<li> <a href="http://www.cplusplus.com/reference/algorithm">&lt;algorithm&gt;</a> </li>
+ *	<li> <a href="http://www.cplusplus.com/reference/exception">&lt;exceptional&gt;</a> </li>
+ *	<li> <a href="http://www.cplusplus.com/reference/functional">&lt;functional&gt;</a> </li>
+ *	<ul>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.bind.html">std.bind</a> </li>
+ *	</ul>
+ *	<li> &lt;utility&gt; </li>
+ *	<ul>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.pair.html">std.Pair</a> </li>
+ *	</ul>
+ * </ul>
+ *
+ *
+ * <h2> References </h2>
+ * <p> You can learn and explore about TypeScript-STL more deeply with such below: </p>
+ * <ul>
+ *	<li> <a href="https://github.com/samchon/stl">GitHub Repository</a> </li>
+ *	<li> <a href="https://github.com/samchon/stl/wiki">Guidebook (wiki)</a> </li>
+ *	<li> <a href="http://samchon.github.io/stl/api">API Documents</a> </li>
+ *	<li> <a href="https://samchon.github.io/stl/design/class_diagram.pdf">Class Diagram</a> </li>
+ * </ul>
+ *
+ *
+ * <h2> Installation </h2>
+ * <h4> Node </h4>
+ * <code> npm install -g typescript-stl </code>
+ *
+ * <h5> TypeScript </h5>
+ * <code>
+ * // SOMEWHERE PLACE NODE AND STL HEADERS EXIST
+ * /// <reference path="node.d.ts" />
+ * /// <reference path="typescript-stl.d.ts" />
+ *
+ * global["std"] = require("typescript-stl");
+ * let list: std.List<string> = new std.List<string>();
+ * </code>
+ *
+ * <h5> Pure JavaScript </h5>
+ * <code>
+ * var std = require("typescript-stl");
+ * var list = new std.List();
+ * </code>
+ *
+ * <h4> Browser </h4>
+ * <h5> In HTML Document </h5>
+ *
+ * <h5> TypeScript, reference difinitions (header) </h5>
+ * <code>
+ * /// <reference path="typescript-stl.d.ts" />
+ * </code>
+ *
+ *
+ * <h2> Index of Guidance, Wiki </h2>
+ * <ul>
+ *	<li> <a href="https://github.com/samchon/stl/wiki/Home"><b>Outline</b></a> </li>
+ *	<ul>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Home#introduction">Introduction</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Home#references">References</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Home#installation">Installation</a> </li>
+ *	</ul>
+ *	<li> <a href="https://github.com/samchon/stl/wiki/Differences"><b>Differences between C++</b></a> </li>
+ *	<ul>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#naming-convention">Naming Convention</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#operator-overriding">Operator Overring</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#iterator">Iterator</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#tree-container">Tree Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#hash-container">Hash Container</a> </li>
+ *	</ul>
+ *	<li> <a href="https://github.com/samchon/stl/wiki/Tutorial"><b>Tutorial</b></a> </li>
+ *	<ul>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#linear-container">Linear Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#tree-container">Tree Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#hash-container">Hash Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous">Miscellaneous</a> </li>
+ *		<ul>
+ *			<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous#algorithm">Algorithm</a> </li>
+ *			<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous#functional">Functional</a> </li>
+ *		</ul>
+ *	</ul>
+ * </ul>
  *
  * @author Jeongho Nam <http://samchon.org>
  */
@@ -39,6 +175,2739 @@ declare namespace std.base {
  */
 declare namespace std.example {
 }
+declare namespace std {
+    /**
+     * <p> Apply function to range. </p>
+     *
+     * <p> Applies function <i>fn</i> to each of the elements in the range [<i>first</i>, <i>last</i>). </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param fn Unary function that accepts an element in the range as argument. This can either be a function p
+     *			 ointer or a move constructible function object. Its return value, if any, is ignored.
+     *
+     * @return Returns <i>fn</i>.
+     */
+    function for_each<T, InputIterator extends Iterator<T>, Func extends (val: T) => any>(first: InputIterator, last: InputIterator, fn: Func): Func;
+    /**
+     * <p> Test condition on all elements in range. </p>
+     *
+     * <p> Returns <code>true</code> if <i>pred</i> returns <code>true</code> for all the elements in the range
+     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
+     * </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
+     *			   checked by this function. The function shall not modify its argument.
+     *
+     * @return <code>true</code> if pred returns true for all the elements in the range or if the range is
+     *		   {@link IContainer.empty empty}, and <code>false</code> otherwise.
+     */
+    function all_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
+    /**
+     * <p> Test if any element in range fulfills condition. </p>
+     *
+     * <p> Returns <code>true</code> if <i>pred</i> returns true for any of the elements in the range
+     * [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. </p>
+     *
+     * <p> If [<i>first</i>, <i>last</i>) is an {@link IContainer.empty empty} range, the function returns
+     * <code>false</code>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
+     *			   checked by this function. The function shall not modify its argument.
+     *
+     * @return <code>true</code> if <i>pred</i> returns <code>true</code> for any of the elements in the range
+     *		   [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. If [<i>first</i>, <i>last</i>) is an
+     *		   {@link IContainer.empty empty} range, the function returns <code>false</code>.
+     */
+    function any_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
+    /**
+     * <p> Test if no elements fulfill condition. </p>
+     *
+     * <p> Returns <code>true</code> if <i>pred</i> returns false for all the elements in the range
+     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
+     * </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
+     *			   checked by this function. The function shall not modify its argument.
+     *
+     * @return <code>true</code> if <i>pred</i> returns <code>false</code> for all the elements in the range
+     *		   [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code>
+     *		   otherwise.
+     */
+    function none_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
+    /**
+     * <p> Test whether the elements in two ranges are equal. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
+     */
+    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>): boolean;
+    /**
+     * <p> Test whether the elements in two ranges are equal. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *			   the elements are considered to match in the context of this function.
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
+     */
+    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>, pred: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Test whether range is permutation of another. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
+     * order. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
+     */
+    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): boolean;
+    /**
+     * <p> Test whether range is permutation of another. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
+     * order. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *			   the elements are considered to match in the context of this function.
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
+     */
+    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, pred: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Lexicographical less-than comparison. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically less</i>
+     * than the range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
+     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
+     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
+     * elements is the result of the lexicographical comparison. </p>
+     *
+     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically less</i>
+     * than the longer one. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence.
+     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
+     *				[<i>first2</i>, <i>last2</i>).
+     *
+     * @return <code>true</code> if the first range compares <i>lexicographically less</i> than than the second.
+     *		   <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
+     */
+    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): boolean;
+    /**
+     * <p> Lexicographical comparison. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically
+     * relationship</i> than the range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
+     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
+     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
+     * elements is the result of the lexicographical comparison. </p>
+     *
+     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically
+     * relationship</i> than the longer one. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence.
+     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a
+     *		  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *		  considered to go before the second in the specific <i>strict weak ordering</i> it defines.
+     *
+     * @return <code>true</code> if the first range compares <i>lexicographically relationship</i> than than the
+     *		   second. <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
+     */
+    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Find value in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) that compares equal to
+     * <i>val</i>. If no such element is found, the function returns <i>last</i>. </p>
+     *
+     * <p> The function uses {@link equal_to equal_to} to compare the individual elements to <i>val</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value to search for in the range.
+     *
+     * @return An {@link Iterator} to the first element in the range that compares equal to <i>val</i>. If no elements
+     *		   match, the function returns <i>last</i>.
+     */
+    function find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
+    /**
+     * <p> Find element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
+     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
+     *			   the context of this function. The function shall not modify its argument.
+     *
+     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> does not return
+     *		   <code>false</code>. If <i>pred</i> is <code>false</code> for all elements, the function returns
+     *		   <i>last</i>.
+     */
+    function find_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
+    /**
+     * <p> Find element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
+     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
+     *			   the context of this function. The function shall not modify its argument.
+     *
+     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> returns <code>false</code>.
+     *		   If <i>pred</i> is <code>true</code> for all elements, the function returns <i>last</i>.
+     */
+    function find_if_not<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
+    /**
+     * <p> Find last subsequence in range. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
+     * occurrences are found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
+     * {@link search}. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
+     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *			   whether the elements are considered to match in the context of this function.
+     *
+     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
+     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
+     */
+    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
+    /**
+     * <p> Find last subsequence in range. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
+     * occurrences are found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
+     * {@link search}. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
+     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *			   whether the elements are considered to match in the context of this function.
+     *
+     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
+     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
+     */
+    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
+    /**
+     * <p> Find element from set in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
+     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
+     *
+     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
+     * [<i>first2</i>, <i>last2</i>) using {@link equal_to}, until a pair matches. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     *
+     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
+     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
+     */
+    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
+    /**
+     * <p> Find element from set in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
+     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
+     *
+     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
+     * [<i>first2</i>, <i>last2</i>) using <i>pred</i>, until a pair matches. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
+     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *			   whether the elements are considered to match in the context of this function.
+     *
+     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
+     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
+     */
+    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
+    /**
+     * <p> Find equal adjacent elements in range. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
+     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
+     *
+     * <p> Two elements match if they compare equal using {@link equal_to}. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
+     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
+     */
+    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
+    /**
+     * <p> Find equal adjacent elements in range. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
+     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
+     *
+     * <p> Two elements match if they compare equal using <i>pred</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is considered a match in the
+     *			   context of this function. The function shall not modify its argument.
+     *
+     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
+     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
+     */
+    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T, y: T) => boolean): InputIterator;
+    /**
+     * <p> Search range for subsequence. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
+     * found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
+     * {@link find_end}. </p>
+     *
+     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
+     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
+     *				used is [<i>first2</i>, <i>last2</i>).
+     *
+     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in <i>first1</i>
+     *		   and <i>last1</i>. If the sequence is not found, the function returns <i>last1</i>. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
+     */
+    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2): ForwardIterator1;
+    /**
+     * <p> Search range for subsequence. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
+     * found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
+     * {@link find_end}. </p>
+     *
+     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
+     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
+     *				used is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to bool. The returned value indicates whether the elements are
+     *			   considered to match in the context of this function. The function shall not modify any of its
+     *			   arguments.
+     *
+     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in
+     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns last1. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
+     */
+    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2, pred: (x: T, y: T) => boolean): ForwardIterator1;
+    /**
+     * <p> Search range for elements. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
+     * <i>val</i>. </p>
+     *
+     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
+     * </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param count Minimum number of successive elements to match.
+     * @param val Individual value to be compared, or to be used as argument for {@link equal_to}.
+     *
+     * @return An iterator to the first element of the sequence. If no such sequence is found, the function returns
+     *		   <i>last</i>.
+     */
+    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T): ForwardIterator;
+    /**
+     * <p> Search range for elements. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
+     * <i>val</i>. </p>
+     *
+     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
+     * </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param count Minimum number of successive elements to match.
+     * @param val Individual value to be compared, or to be used as argument for <i>pred</i>.
+     * @param pred Binary function that accepts two arguments (one element from the sequence as first, and <i>val</i> as
+     *			   second), and returns a value convertible to <code>bool</code>. The value returned indicates whether the
+     *			   element is considered a match in the context of this function. The function shall not modify any of its
+     *			   arguments.
+     *
+     * @return An {@link Iterator} to the first element of the sequence. If no such sequence is found, the function
+     *		   returns <i>last</i>.
+     */
+    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T, pred: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return first position where two ranges differ. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
+     *
+     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
+     * does not match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     *
+     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
+     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
+     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
+     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
+     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
+     */
+    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): Pair<Iterator1, Iterator2>;
+    /**
+     * <p> Return first position where two ranges differ. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
+     *
+     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
+     * does not match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *			   the elements are considered to match in the context of this function.
+     *
+     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
+     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
+     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
+     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
+     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
+     */
+    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, compare: (x: T, y: T) => boolean): Pair<Iterator1, Iterator2>;
+    /**
+     * <p> Count appearances of value in range. </p>
+     *
+     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>. </p>
+     *
+     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value to match.
+     *
+     * @return The number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>.
+     */
+    function count<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): number;
+    /**
+     * <p> Return number of elements in range satisfying condition. </p>
+     *
+     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) for which pred is <code>true</code>.
+     * </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether the element is counted by this function.
+     *			   The function shall not modify its argument. This can either be a function pointer or a function
+     *			   object.
+     */
+    function count_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): number;
+}
+declare namespace std {
+    /**
+     * <p> Copy range of elements. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) into the range beginning at <i>result</i>. </p>
+     *
+     * <p> The function returns an iterator to the end of the destination range (which points to the element following the
+     * last element copied). </p>
+     *
+     * <p> The ranges shall not overlap in such a way that result points to an element in the range
+     * [<i>first</i>, <i>last</i>). For such cases, see {@link copy_backward}. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
+     *				 point to any element in the range [<i>first</i>, <i>last</i>).
+     *
+     * @return An iterator to the end of the destination range where elements have been copied.
+     */
+    function copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Copy elements. </p>
+     *
+     * <p> Copies the first <i>n</i> elements from the range beginning at <i>first</i> into the range beginning at
+     * <i>result</i>. </p>
+     *
+     * <p> The function returns an iterator to the end of the destination range (which points to one past the last element
+     * copied). </p>
+     *
+     * <p> If <i>n</i> is negative, the function does nothing. </p>
+     *
+     * <p> If the ranges overlap, some of the elements in the range pointed by result may have undefined but valid values.
+     * </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence of at least <i>n</i> elements to
+     *				be copied. <i>InputIterator</i> shall point to a type assignable to the elements pointed by
+     *				<i>OutputIterator</i>.
+     * @param n Number of elements to copy. If this value is negative, the function does nothing.
+     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence of at least
+     *				 <i>n</i> elements. This shall not point to any element in the range [<i>first</i>, last].
+     *
+     * @return An iterator to the end of the destination range where elements have been copied.
+     */
+    function copy_n<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, n: number, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Copy certain elements of range. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which pred returns <code>true</code> to the
+     * range beginning at <i>result</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
+     *				 point to any element in the range [<i>first</i>, <i>last</i>).
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be copied (if
+     *			   <code>true</code>, it is copied). The function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the destination range where elements have been copied.
+     */
+    function copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T) => boolean): OutputIterator;
+    /**
+     * <p> Copy range of elements backward. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) starting from the end into the range terminating
+     * at <i>result</i>. </p>
+     *
+     * <p> The function returns an iterator to the first element in the destination range. </p>
+     *
+     * <p> The resulting range has the elements in the exact same order as [<i>first</i>, <i>last</i>). To reverse their
+     * order, see {@link reverse_copy}. </p>
+     *
+     * <p> The function begins by copying <code>*(last-1)</code> into <code>*(result-1)</code>, and then follows backward
+     * by the elements preceding these, until <i>first</i> is reached (and including it). </p>
+     *
+     * <p> The ranges shall not overlap in such a way that <i>result</i> (which is the <i>past-the-end element</i> in the
+     * destination range) points to an element in the range (first,last]. For such cases, see {@link copy}. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Bidirectional iterator} to the initial position in the destination sequence. This
+     *				 shall not point to any element in the range [<i>first</i>, <i>last</i>).
+     *
+     * @return An iterator to the first element of the destination sequence where elements have been copied.
+     */
+    function copy_backward<T, BidirectionalIterator1 extends Iterator<T>, BidirectionalIterator2 extends Iterator<T>>(first: BidirectionalIterator1, last: BidirectionalIterator1, result: BidirectionalIterator2): BidirectionalIterator2;
+    /**
+     * <p> Fill range with value. </p>
+     *
+     * <p> Assigns val to all the elements in the range [<i>first</i>, <i>last</i>). </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence of elements that support being
+     *				assigned a value of type <i>T</i>.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence of elements that support being
+     *				assigned a value of type <i>T</i>.. The range filled is [<i>first</i>, <i>last</i>), which contains
+     *				all the elements between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i>
+     *				but not the element pointed by <i>last</i>.
+     * @param val Value to assign to the elements in the filled range.
+     */
+    function fill<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): void;
+    /**
+     * <p> Fill sequence with value. </p>
+     *
+     * <p> Assigns <i>val</i> to the first <i>n</i> elements of the sequence pointed by <i>first</i>. </p>
+     *
+     * @param first {@link Iterator Output iterator} to the initial position in a sequence of elements that support being
+     *				assigned a value of type <i>T</i>.
+     * @param n Number of elements to fill. If negative, the function does nothing.
+     * @param val Value to be used to fill the range.
+     *
+     * @return An iterator pointing to the element that follows the last element filled.
+     */
+    function fill_n<T, OutputIterator extends Iterator<T>>(first: OutputIterator, n: number, val: T): OutputIterator;
+    /**
+     * <p> Transform range. </p>
+     *
+     * <p> Applies <i>op</i> to each of the elements in the range [<i>first</i>, <i>last</i>) and stores the value returned
+     * by each operation in the range that begins at <i>result</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be transformed.
+     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be transformed. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
+     *				 stored. The range includes as many elements as [<i>first</i>, <i>last</i>).
+     * @param op Unary function that accepts one element of the type pointed to by <i>InputIterator</i> as argument, and
+     *			 returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
+     */
+    function transform<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, op: (val: T) => T): OutputIterator;
+    /**
+     * <p> Transform range. </p>
+     *
+     * <p> Calls <i>binary_op</i> using each of the elements in the range [<i>first1</i>, <i>last1</i>) as first argument,
+     * and the respective argument in the range that begins at <i>first2</i> as second argument. The value returned by
+     * each call is stored in the range that begins at <i>result</i>. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second range. The range includes as
+     *				 many elements as [<i>first1</i>, <i>last1</i>).
+     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
+     *				 stored. The range includes as many elements as [<i>first1</i>, <i>last1</i>).
+     * @param binary_op Binary function that accepts two elements as argument (one of each of the two sequences), and
+     *					returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
+     */
+    function transform<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, result: OutputIterator, binary_op: (x: T, y: T) => T): OutputIterator;
+    /**
+     * <p> Generate values for range with function. </p>
+     *
+     * <p> Assigns the value returned by successive calls to gen to the elements in the range [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range affected is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
+     *			  those pointed by the iterators.
+     */
+    function generate<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, gen: () => T): void;
+    /**
+     * <p> Generate values for sequence with function. </p>
+     *
+     * <p> Assigns the value returned by successive calls to <i>gen</i> to the first <i>n</i> elements of the sequence
+     * pointed by <i>first</i>. </p>
+     *
+     * @param first {@link Iterator Output iterator} to the initial position in a sequence of at least <i>n</i> elements
+     *				that support being assigned a value of the type returned by <i>gen</i>.
+     * @param n Number of values to generate. If negative, the function does nothing.
+     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
+     *			  those pointed by the iterators.
+     *
+     * @return An iterator pointing to the element that follows the last element whose value has been generated.
+     */
+    function generate_n<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, n: number, gen: () => T): ForwardIterator;
+    /**
+     * <p> Remove consecutive duplicates in range. </p>
+     *
+     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
+     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
+     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
+     * the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
+     * iterator and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
+     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
+     */
+    function unique<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
+    /**
+     * <p> Remove consecutive duplicates in range. </p>
+     *
+     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
+     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
+     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
+     * the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
+     * iterator and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether both arguments are considered equivalent
+     *			  (if <code>true</code>, they are equivalent and one of them is removed). The function shall not modify
+     *			  any of its arguments.
+     *
+     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
+     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
+     */
+    function unique<t, InputIterator extends Iterator<t>>(first: InputIterator, last: InputIterator, pred: (left: t, right: t) => boolean): InputIterator;
+    /**
+     * <p> Copy range removing duplicates. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * consecutive duplicates (elements that compare equal to the element preceding). </p>
+     *
+     * <p> Only the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>) is copied. </p>
+     *
+     * <p> The comparison between elements is performed by applying {@lnk equal_to}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
+     *				 The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     *
+     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
+     */
+    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Copy range removing duplicates. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * consecutive duplicates (elements that compare equal to the element preceding). </p>
+     *
+     * <p> Only the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>) is copied. </p>
+     *
+     * <p> The comparison between elements is performed by applying <i>pred</i>. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
+     *				 The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether both arguments are considered equivalent (if
+     *			   <code>true</code>, they are equivalent and one of them is removed). The function shall not modify any
+     *			   of its arguments.
+     *
+     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
+     */
+    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Remove value from range. </p>
+     *
+     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements that compare equal to
+     * <i>val</i> removed, and returns an iterator to the new last of that range. </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot alter
+     * the size of an array or a container): The removal is done by replacing the elements that compare equal to
+     * <i>val</i> by the next element that does not, and signaling the new size of the shortened range by returning an
+     * iterator to the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned iterator
+     * and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value to be removed.
+     */
+    function remove<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
+    /**
+     * <p> Remove elements from range. </p>
+     *
+     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements for which pred returns
+     * <code>true</code> removed, and returns an iterator to the new last of that range. </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
+     * alter the size of an array or a container): The removal is done by replacing the elements for which pred returns
+     * <code>true</code> by the next element for which it does not, and signaling the new size of the shortened range
+     * by returning an iterator to the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
+     * iterator and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be removed (if
+     *			   <code>true</code>, it is removed). The function shall not modify its argument.
+     */
+    function remove_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (left: T) => boolean): InputIterator;
+    /**
+     * <p> Copy range removing value. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * those elements that compare equal to <i>val</i>. </p>
+     *
+     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches in the sequence,
+     * which are "removed". </p>
+     *
+     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param val Value to be removed.
+     *
+     * @return An iterator pointing to the end of the copied range, which includes all the elements in
+     *		   [<i>first</i>, <i>last</i>) except those that compare equal to <i>val</i>.
+     */
+    function remove_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, val: T): OutputIterator;
+    /**
+     * <p> Copy range removing values. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * those elements for which <i>pred</i> returns <code>true</code>. </p>
+     *
+     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches, which are
+     * "removed". </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
+     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
+     *
+     * @return An iterator pointing to the end of the copied range, which includes all the elements in
+     *		   [<i>first</i>, <i>last</i>) except those for which <i>pred</i> returns <code>true</code>.
+     */
+    function remove_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean): OutputIterator;
+    /**
+     * <p> Replace value in range. </p>
+     *
+     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) that compare equal to
+     * <i>old_val</i>. </p>
+     *
+     * <p> The function uses {@link equal_to} to compare the individual elements to old_val. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param old_val Value to be replaced.
+     * @param new_val Replacement value.
+     */
+    function replace<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, old_val: T, new_val: T): void;
+    /**
+     * <p> Replace value in range. </p>
+     *
+     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) for which pred returns
+     * <code>true</code>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be replaced (if
+     *			   <code>true</code>, it is replaced). The function shall not modify its argument.
+     * @param new_val Value to assign to replaced elements.
+     */
+    function replace_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean, new_val: T): void;
+    /**
+     * <p> Copy range replacing value. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
+     * the appearances of <i>old_value</i> by <i>new_value</i>. </p>
+     *
+     * <p> The function uses {@link std.equal_to} to compare the individual elements to <i>old_value</i>. </p>
+     *
+     * <p> The ranges shall not overlap in such a way that result points to an element in the range
+     * [<i>first</i>, <i>last</i>). </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param old_val Value to be replaced.
+     * @param new_val Replacement value.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function replace_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, old_val: T, new_val: T): OutputIterator;
+    /**
+     * <p> Copy range replacing value. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
+     * those for which <i>pred</i> returns <code>true</code> by <i>new_value</i>. </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
+     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
+     * @param new_val Value to assign to replaced values.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function replace_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean, new_val: T): OutputIterator;
+    /**
+     * <p> Exchange values of objects pointed to by two iterators. </p>
+     *
+     * <p> Swaps the elements pointed to by <i>x</i> and <i>y</i>. </p>
+     *
+     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
+     *
+     * @param x {@link Iterator Forward iterator} to the objects to swap.
+     * @param y {@link Iterator Forward iterator} to the objects to swap.
+     */
+    function iter_swap<T>(x: Iterator<T>, y: Iterator<T>): void;
+    /**
+     * <p> Exchange values of two ranges. </p>
+     *
+     * <p> Exchanges the values of each of the elements in the range [<i>first1</i>, <i>last1</i>) with those of their
+     * respective elements in the range beginning at <i>first2</i>. </p>
+     *
+     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
+     *
+     * @param first1 {@link Iterator Forward iterator} to the initial position of the first sequence.
+     * @param last1 {@link Iterator Forward iterator} to the final position of the first sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Forward iterator} to the initial position of the second range. The range includes as
+     *				 many elements as [<i>first1</i>, <i>last1</i>). The two ranges shall not overlap.
+     *
+     * @return An iterator to the last element swapped in the second sequence.
+     */
+    function swap_ranges<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2): ForwardIterator2;
+    /**
+     * <p> Reverse range. </p>
+     *
+     * <p> Reverses the order of the elements in the range [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The function calls {@link iter_swap} to swap the elements to their new locations. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     */
+    function reverse<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): void;
+    /**
+     * <p> Copy range reversed. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but in
+     * reverse order. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     *
+     * @return An output iterator pointing to the end of the copied range, which contains the same elements in reverse
+     *		   order.
+     */
+    function reverse_copy<T, BidirectionalIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Rotate left the elements in range. </p>
+     *
+     * <p> Rotates the order of the elements in the range [<i>first</i>, <i>last</i>), in such a way that the element
+     * pointed by middle becomes the new first element. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param middle An {@link Iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is
+     *				 moved to the first position in the range.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator pointing to the element that now contains the value previously pointed by <i>first</i>.
+     */
+    function rotate<T, InputIterator extends Iterator<T>>(first: InputIterator, middle: InputIterator, last: InputIterator): InputIterator;
+    /**
+     * <p> Copy range rotated left. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but
+     * rotating the order of the elements in such a way that the element pointed by <i>middle</i> becomes the first
+     * element in the resulting range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the range to be copy-rotated.
+     * @param middle Forward iterator pointing to the element within the range [<i>first</i>, <i>last</i>) that is copied as the first element in the resulting range.
+     * @param last {@link Iterator Forward iterator} to the final positions of the range to be copy-rotated. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   Notice that in this function, these are not consecutive parameters, but the first and <b>third</b> ones.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     *
+     * @return An output iterator pointing to the end of the copied range.
+     */
+    function rotate_copy<T, ForwardIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: ForwardIterator, middle: ForwardIterator, last: ForwardIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Randomly rearrange elements in range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly. </p>
+     *
+     * <p> The function swaps the value of each element with that of some other randomly picked element. When provided,
+     * the function gen determines which element is picked in every case. Otherwise, the function uses some unspecified
+     * source of randomness. </p>
+     *
+     * <p> To specify a uniform random generator, see {@link shuffle}. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     */
+    function random_shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Randomly rearrange elements in range using generator. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly, using <i>g</i> as uniform random
+     * number generator. </p>
+     *
+     * <p> The function swaps the value of each element with that of some other randomly picked element. The function
+     * determines the element picked by calling <i>g()</i>. </p>
+     *
+     * <p> To shuffle the elements of the range without such a generator, see {@link random_shuffle} instead. </p>
+     *
+     * <h5> Note </h5>
+     * <p> Using random generator engine is not implemented yet. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     */
+    function shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
+}
+declare namespace std {
+    /**
+     * <p> Sort elements in range. </p>
+     *
+     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into ascending order. The elements are compared
+     * using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			  {@link Iterator.swap swap} is properly defined.
+     */
+    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Sort elements in range. </p>
+     *
+     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into specific order. The elements are compared
+     * using <i>compare</i>. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			  {@link Iterator.swap swap} is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *		  convertible to <code>boolean</code>. The value returned indicates whether the element passed as first
+     *		  argument is considered to go before the second in the specific strict weak ordering it defines. The
+     *		  function shall not modify any of its arguments. This can either be a function pointer or a function
+     *		  object.
+     */
+    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (left: T, right: T) => boolean): void;
+    /**
+     * <p> Partially sort elements in range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
+     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
+     * elements are left without any specific order. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
+     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>.
+     */
+    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Partially sort elements in range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
+     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
+     * elements are left without any specific order. </p>
+     *
+     * <p> The elements are compared using <i>comp</i>. </p>
+     *
+     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
+     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it
+     *				  defines. The function shall not modify any of its arguments.
+     */
+    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Copy and partially sort range. </p>
+     *
+     * <p> Copies the smallest  elements in the range [<i>first</i>, <i>last</i>) to
+     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
+     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
+     * elements in [<i>first</i>, <i>last</i>)). </p>
+     *
+     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
+     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
+     *			   <i>RandomAccessIterator</i>.
+     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
+     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
+     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
+     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
+     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
+     *				  defines. The function shall not modify any of its arguments.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator): RandomAccessIterator;
+    /**
+     * <p> Copy and partially sort range. </p>
+     *
+     * <p> Copies the smallest (or largest) elements in the range [<i>first</i>, <i>last</i>) to
+     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
+     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
+     * elements in [<i>first</i>, <i>last</i>)). </p>
+     *
+     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
+     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
+     *			   <i>RandomAccessIterator</i>.
+     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
+     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
+     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
+     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
+     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
+     *				  defines. The function shall not modify any of its arguments.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator, compare: (x: T, y: T) => boolean): RandomAccessIterator;
+    /**
+     * <p> Check whether range is sorted. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
+     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
+     *		   the function always returns <code>true</code>.
+     */
+    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): boolean;
+    /**
+     * <p> Check whether range is sorted. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered to go before the second in the specific strict weak ordering it defines. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
+     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
+     *		   the function always returns <code>true</code>.
+     */
+    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Find first unsorted element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
+     * ascending order. </p>
+     *
+     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
+     *
+     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using {@link equal_to}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered to go before the second in the specific strict weak ordering it defines. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
+     *		   all elements are sorted or if the range contains less than two elements.
+     */
+    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
+    /**
+     * <p> Find first unsorted element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
+     * ascending order. </p>
+     *
+     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
+     *
+     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered to go before the second in the specific strict weak ordering it defines. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
+     *		   all elements are sorted or if the range contains less than two elements.
+     */
+    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
+}
+declare namespace std {
+    /**
+     * <p> Make heap from range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) in such a way that they form a heap. </p>
+     *
+     * <p> A heap is a way to organize the elements of a range that allows for fast retrieval of the element with the
+     * highest value at any moment (with {@link pop_heap}), even repeatedly, while allowing for fast insertion of new
+     * elements (with {@link push_heap}). </p>
+     *
+     * <p> The element with the highest value is always pointed by first. The order of the other elements depends on the
+     * particular implementation, but it is consistent throughout all heap-related functions of this header. </p>
+     *
+     * <p> The elements are compared using {@link less}: The element with the highest value is an element for which this
+     * would return false when compared to every other element in the range. </p>
+     *
+     * <p> The standard container adaptor {@link PriorityQueue} calls {@link make_heap}, {@link push_heap} and
+     * {@link pop_heap} automatically to maintain heap properties for a container. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be
+     *				transformed into a heap.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be transformed
+     *			   into a heap. The range used is [<i>first</i>, <i>last</i>), which contains all the elements between
+     *			   <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed
+     *			   by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     */
+    function make_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Make heap from range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) in such a way that they form a heap. </p>
+     *
+     * <p> A heap is a way to organize the elements of a range that allows for fast retrieval of the element with the
+     * highest value at any moment (with {@link pop_heap}), even repeatedly, while allowing for fast insertion of new
+     * elements (with {@link push_heap}). </p>
+     *
+     * <p> The element with the highest value is always pointed by first. The order of the other elements depends on the
+     * particular implementation, but it is consistent throughout all heap-related functions of this header. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>: The element with the highest value is an element for which this
+     * would return false when compared to every other element in the range. </p>
+     *
+     * <p> The standard container adaptor {@link PriorityQueue} calls {@link make_heap}, {@link push_heap} and
+     * {@link pop_heap} automatically to maintain heap properties for a container. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be
+     *				transformed into a heap.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be transformed
+     *			   into a heap. The range used is [<i>first</i>, <i>last</i>), which contains all the elements between
+     *			   <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed
+     *			   by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function make_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Push element into heap range. </p>
+     *
+     * <p> Given a heap in the range [<i>first</i>, <i>last</i> - 1), this function extends the range considered a heap to
+     * [<i>first</i>, <i>last</i>) by placing the value in (<i>last</i> - 1) into its corresponding location within it.
+     * </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the new heap range, including
+     *				the pushed element.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the new heap range, including
+     *			   the pushed element.  The range used is [<i>first</i>, <i>last</i>), which contains all the elements
+     *			   between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element
+     *			   pointed by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     */
+    function push_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Push element into heap range. </p>
+     *
+     * <p> Given a heap in the range [<i>first</i>, <i>last</i> - 1), this function extends the range considered a heap to
+     * [<i>first</i>, <i>last</i>) by placing the value in (<i>last</i> - 1) into its corresponding location within it.
+     * </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the new heap range, including
+     *				the pushed element.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the new heap range, including
+     *			   the pushed element.  The range used is [<i>first</i>, <i>last</i>), which contains all the elements
+     *			   between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element
+     *			   pointed by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function push_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Pop element from heap range. </p>
+     *
+     * <p> Rearranges the elements in the heap range [<i>first</i>, <i>last</i>) in such a way that the part considered a
+     * heap is shortened by one: The element with the highest value is moved to (<i>last</i> - 1). </p>
+     *
+     * <p> While the element with the highest value is moved from first to (<i>last</i> - 1) (which now is out of the
+     * heap), the other elements are reorganized in such a way that the range [<i>first</i>, <i>last</i> - 1) preserves
+     * the properties of a heap. </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the heap to be shrank by one.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the heap to be shrank by one.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     */
+    function pop_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Pop element from heap range. </p>
+     *
+     * <p> Rearranges the elements in the heap range [<i>first</i>, <i>last</i>) in such a way that the part considered a
+     * heap is shortened by one: The element with the highest value is moved to (<i>last</i> - 1). </p>
+     *
+     * <p> While the element with the highest value is moved from first to (<i>last</i> - 1) (which now is out of the
+     * heap), the other elements are reorganized in such a way that the range [<i>first</i>, <i>last</i> - 1) preserves
+     * the properties of a heap. </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the heap to be shrank by one.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the heap to be shrank by one.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function pop_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Test if range is heap. </p>
+     *
+     * <p> Returns true if the range [<i>first</i>, <i>last</i>) forms a heap, as if constructed with {@link make_heap}.
+     * </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is a heap (as if constructed with
+     *		   {@link make_heap}), <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less
+     *		   than two elements, the function always returns <code>true</code>.
+     */
+    function is_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): boolean;
+    /**
+     * <p> Test if range is heap. </p>
+     *
+     * <p> Returns true if the range [<i>first</i>, <i>last</i>) forms a heap, as if constructed with {@link make_heap}.
+     * </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is a heap (as if constructed with
+     *		   {@link make_heap}), <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less
+     *		   than two elements, the function always returns <code>true</code>.
+     */
+    function is_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Find first element not in heap order. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which is not in a valid
+     * position if the range is considered a heap (as if constructed with {@link make_heap}). </p>
+     *
+     * <p> The range between first and the iterator returned is a heap. </p>
+     *
+     * <p> If the entire range is a valid heap, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     */
+    function is_heap_until<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): RandomAccessIterator;
+    /**
+     * <p> Find first element not in heap order. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which is not in a valid
+     * position if the range is considered a heap (as if constructed with {@link make_heap}). </p>
+     *
+     * <p> The range between first and the iterator returned is a heap. </p>
+     *
+     * <p> If the entire range is a valid heap, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function is_heap_until<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): RandomAccessIterator;
+    /**
+     * <p> Sort elements of heap. </p>
+     *
+     * <p> Sorts the elements in the heap range [<i>first</i>, <i>last</i>) into ascending order. </p>
+     *
+     * <p> The elements are compared using {@link less}, which shall be the same as used to construct the heap. </p>
+     *
+     * <p> The range loses its properties as a heap. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     */
+    function sort_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Sort elements of heap. </p>
+     *
+     * <p> Sorts the elements in the heap range [<i>first</i>, <i>last</i>) into ascending order. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>, which shall be the same as used to construct the heap. </p>
+     *
+     * <p> The range loses its properties as a heap. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function sort_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+}
+declare namespace std {
+    /**
+     * <p> Return iterator to lower bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
+     * compare less than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
+     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
+     * <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
+     * to <i>val</i>, and not only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
+    /**
+     * <p> Return iterator to lower bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
+     * compare less than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
+     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
+     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
+     * to <i>val</i>, and not only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
+     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
+     *				  returned indicates whether the first argument is considered to go before the second. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return iterator to upper bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
+     * greater than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
+     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
+     * <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
+     * <i>val</i>, only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
+    /**
+     * <p> Return iterator to upper bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
+     * greater than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
+     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
+     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
+     * <i>val</i>, only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
+     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
+     *				  returned indicates whether the first argument is considered to go before the second. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
+     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
+     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
+     */
+    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): Pair<ForwardIterator, ForwardIterator>;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
+     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *				  the first argument is considered to go before the second. The function shall not modify any of its
+     *				  arguments.
+     *
+     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
+     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
+     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
+     */
+    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
+     */
+    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): boolean;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {<i>compare</i>}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
+     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *				  the first argument is considered to go before the second. The function shall not modify any of its
+     *				  arguments.
+     *
+     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
+     */
+    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): boolean;
+}
+declare namespace std {
+    /**
+     * <p> Test whether range is partitioned. </p>
+     *
+     * <p> Returns <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i>
+     * returns <code>true</code> precede those for which it returns <code>false</code>. </p>
+     *
+     * <p> If the range is {@link IContainer.empty empty}, the function returns <code>true</code>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Input iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
+     *			   <code>true</code>, the element is expected before all the elements for which it returns
+     *			   <code>false</code>). The function shall not modify its argument.
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns
+     *		   <code>true</code> precede those for which it returns <code>false</code>. Otherwise it returns
+     *		   <code>false</code>. If the range is {@link IContainer.empty empty}, the function returns <code>true</code>.
+     */
+    function is_partitioned<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T) => boolean): boolean;
+    /**
+     * <p> Partition range in two. </p>
+     *
+     * <p> Rearranges the elements from the range [<i>first</i>, <i>last</i>), in such a way that all the elements for
+     * which <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>. The iterator
+     * returned points to the first element of the second group. </p>
+     *
+     * <p> The relative ordering within each group is not necessarily the same as before the call. See
+     * {@link stable_partition} for a function with a similar behavior but with stable ordering within each group. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence to partition.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence to partition. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
+     *			   <code>true</code>, the element is expected before all the elements for which it returns
+     *			   <code>false</code>). The function shall not modify its argument.
+     *
+     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
+     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
+     */
+    function partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
+    /**
+     * <p> Partition range in two - stable ordering. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that all the elements for which
+     * <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>, and, unlike
+     * function {@link partition}, the relative order of elements within each group is preserved. </p>
+     *
+     * <p> This is generally implemented using an internal temporary buffer. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position of the sequence to partition.
+     * @param last {@link Iterator Bidirectional iterator} to the final position of the sequence to partition. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
+     *			   <code>true</code>, the element is expected before all the elements for which it returns
+     *			   <code>false</code>). The function shall not modify its argument.
+     *
+     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
+     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
+     */
+    function stable_partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
+    /**
+     * <p> Partition range into two. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns <code>true</code>
+     * into the range pointed by <i>result_true</i>, and those for which it does not into the range pointed by
+     * <i>result_false</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the range to be copy-partitioned.
+     * @param last {@link Iterator Input iterator} to the final position of the range to be copy-partitioned. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result_true {@link Iterator Output iterator} to the initial position of the range where the elements for
+     *					  which <i>pred</i> returns <code>true</code> are stored.
+     * @param result_false {@link Iterator Output iterator} to the initial position of the range where the elements for
+     *					   which <i>pred</i> returns <code>false</code> are stored.
+     * @param pred Unary function that accepts an element pointed by <i>InputIterator</i> as argument, and returns a value
+     *			   convertible to <code>bool</code>. The value returned indicates on which result range the element is
+     *			   copied. The function shall not modify its argument.
+     *
+     * @return A {@link Pair} of iterators with the end of the generated sequences pointed by <i>result_true</i> and
+     *		   <i>result_false</i>, respectivelly. Its member {@link Pair.first first} points to the element that follows
+     *		   the last element copied to the sequence of elements for which <i>pred</i> returned <code>true</code>. Its
+     *		   member {@link Pair.second second} points to the element that follows the last element copied to the sequence
+     *		   of elements for which <i>pred</i> returned <code>false</code>.
+     */
+    function partition_copy<T, InputIterator extends Iterator<T>, OutputIterator1 extends Iterator<T>, OutputIterator2 extends Iterator<T>>(first: InputIterator, last: InputIterator, result_true: OutputIterator1, result_false: OutputIterator2, pred: (val: T) => T): Pair<OutputIterator1, OutputIterator2>;
+    /**
+     * <p> Get partition point. </p>
+     *
+     * <p> Returns an iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which
+     * <i>pred</i> is not <code>true</code>, indicating its partition point. </p>
+     *
+     * <p> The elements in the range shall already {@link is_partitioned be partitioned}, as if {@link partition} had been
+     * called with the same arguments. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link Iteartor random-access iterators}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the partitioned sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the partitioned sequence. The range checked
+     *		  is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> an <i>last</i>,
+     *		  including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element goes before the partition point (if
+     *			   <code>true</code>, it goes before; if <code>false</code> goes at or after it). The function shall not
+     *			   modify its argument.
+     *
+     * @return An iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which <i>pred</i>
+     *		   is not <code>true</code>, or <i>last</i> if it is not <code>true</code> for any element.
+     */
+    function partition_point<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, pred: (x: T) => boolean): ForwardIterator;
+}
+declare namespace std {
+    /**
+     * <p> Merge sorted ranges. </p>
+     *
+     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
+     * a new range beginning at <i>result</i> with all its elements sorted. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
+     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
+     *				 range is stored. Its size is equal to the sum of both ranges above.
+     *
+     * @return An iterator pointing to the past-the-end element in the resulting sequence.
+     */
+    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Merge sorted ranges. </p>
+     *
+     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
+     * a new range beginning at <i>result</i> with all its elements sorted. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
+     * this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
+     *				 range is stored. Its size is equal to the sum of both ranges above.
+     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator pointing to the past-the-end element in the resulting sequence.
+     */
+    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Merge consecutive sorted ranges. </p>
+     *
+     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
+     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
+     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
+     *
+     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
+     * range preceding those equivalent in the second. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
+     *				This is also the initial position where the resulting merged range is stored.
+     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
+     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
+     *				 sequence.
+     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
+     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
+     *			   stored.
+     */
+    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator): void;
+    /**
+     * <p> Merge consecutive sorted ranges. </p>
+     *
+     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
+     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. The elements in both ranges shall already be ordered according
+     * to this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
+     *
+     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
+     * range preceding those equivalent in the second. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
+     *				This is also the initial position where the resulting merged range is stored.
+     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
+     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
+     *				 sequence.
+     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
+     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
+     *			   stored.
+     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     */
+    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Test whether sorted range includes another sorted range. </p>
+     *
+     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
+     * sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be ordered according to this same criterion ({@link less}). </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
+     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
+     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
+     *				<i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
+     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
+     *
+     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
+     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
+     *		   range, the function returns <code>true</code>.
+     */
+    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2): boolean;
+    /**
+     * <p> Test whether sorted range includes another sorted range. </p>
+     *
+     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
+     * sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be ordered according to this same criterion (<i>compare</i>). </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
+     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
+     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
+     *				<i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
+     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
+     * @param compare Binary function that accepts two elements as arguments (one from each of the two sequences, in the
+     *				  same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *				  whether the element passed as first argument is considered to go before the second in the specific
+     *				  <i>strict weak ordering</i> it defines. The function shall not modify any of its arguments.
+     *
+     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
+     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
+     *		   range, the function returns <code>true</code>.
+     */
+    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Union of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
+     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
+     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
+     * range. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Union of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
+     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
+     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
+     * range. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Intersection of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
+     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
+     * copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Intersection of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
+     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
+     * copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
+     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
+     * second one. The elements copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
+     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
+     *
+     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
+     * </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
+     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
+     * second one. The elements copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
+     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
+     *
+     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
+     * </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Symmetric difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
+     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
+     * </p>
+     *
+     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
+     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
+     * existent order before the call. The existing order is also preserved for the copied elements. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link std.less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Symmetric difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
+     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
+     * </p>
+     *
+     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
+     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
+     * existent order before the call. The existing order is also preserved for the copied elements. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+}
+declare namespace std {
+    /**
+     * <p> Return the smallest. </p>
+     *
+     * <p> Returns the smallest of all the elements in the <i>args</i>. </p>
+     *
+     * @param args Values to compare.
+     *
+     * @return The lesser of the values passed as arguments.
+     */
+    function min<T>(...args: T[]): T;
+    /**
+     * <p> Return the largest. </p>
+     *
+     * <p> Returns the largest of all the elements in the <i>args</i>. </p>
+     *
+     * @param args Values to compare.
+     *
+     * @return The largest of the values passed as arguments.
+     */
+    function max<T>(...args: T[]): T;
+    /**
+     * <p> Return smallest and largest elements. </p>
+     *
+     * <p> Returns a {@link Pair} with the smallest of all the elements in the <i>args</i> as first element (the first of
+     * them, if there are more than one), and the largest as second (the last of them, if there are more than one). </p>
+     *
+     * @param args Values to compare.
+     *
+     * @return The lesser and greatest of the values passed as arguments.
+     */
+    function minmax<T>(...args: T[]): Pair<T, T>;
+    /**
+     * <p> Return smallest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either {@link less}; An element is the smallest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
+     */
+    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
+    /**
+     * <p> Return smallest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either <i>compare</i>; An element is the smallest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
+     */
+    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return largest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either {@link greater}; An element is the largest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
+     */
+    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
+    /**
+     * <p> Return largest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either <i>compare</i>; An element is the largest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
+     */
+    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return smallest and largest elements in range. </p>
+     *
+     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
+     *
+     * <p> The comparisons are performed using either {@link less} and {@link greater}. </p>
+     *
+     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
+     * elements. </p>
+     *
+     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
+     * elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
+     */
+    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): Pair<ForwardIterator, ForwardIterator>;
+    /**
+     * <p> Return smallest and largest elements in range. </p>
+     *
+     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
+     *
+     * <p> The comparisons are performed using either <i>compare</i>. </p>
+     *
+     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
+     * elements. </p>
+     *
+     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
+     * elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
+     */
+    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
+}
+declare namespace std.base {
+    /**
+     * <p> An abstract container. </p>
+     *
+     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     * 	<dt> Sequence </dt>
+     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
+     *		 accessed by their position in this sequence. </dd>
+     *
+     * 	<dt> Doubly-linked list </dt>
+     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing
+     *		 constant time insert and erase operations before or after a specific element (even of entire ranges),
+     *		 but no direct random access. </dd>
+     * </dl>
+     *
+     * @param <T> Type of elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    abstract class Container<T> implements IContainer<T> {
+        /**
+         * <p> Default Constructor. </p>
+         *
+         * <p> Constructs an empty container, with no elements. </p>
+         */
+        constructor();
+        /**
+         * <p> Initializer list Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
+         *
+         * @param array An array containing elements to be copied and contained.
+         */
+        constructor(array: Array<T>);
+        /**
+         * <p> Copy Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
+         *
+         * @param container Another container object of the same type (with the same class template
+         *					arguments <i>T</i>), whose contents are either copied or acquired.
+         */
+        constructor(container: IContainer<T>);
+        /**
+         * <p> Range Constructor. </p>
+         *
+         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
+         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @inheritdoc
+         */
+        abstract assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        abstract begin(): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract end(): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract rbegin(): base.IReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract rend(): base.IReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract size(): number;
+        /**
+         * @inheritdoc
+         */
+        empty(): boolean;
+        /**
+         * @inheritdoc
+         */
+        abstract push<U extends T>(...items: U[]): number;
+        /**
+         * @inheritdoc
+         */
+        abstract insert(position: Iterator<T>, val: T): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract erase(position: Iterator<T>): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract erase<U extends T>(begin: Iterator<U>, end: Iterator<U>): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: IContainer<T>): void;
+    }
+}
 declare namespace std {
     /**
      * <p> Bi-directional iterator. </p>
@@ -118,6 +2987,8 @@ declare namespace std {
         value: T;
         abstract swap(obj: Iterator<T>): void;
     }
+}
+declare namespace std {
     /**
      * <p> This class reverses the direction in which a bidirectional or random-access iterator iterates through a range.
      * </p>
@@ -334,625 +3205,6 @@ declare namespace std {
      */
     function end<Key, T>(container: base.MapContainer<Key, T>): MapIterator<Key, T>;
 }
-declare namespace std {
-    /**
-     * <p> Vector, the dynamic array. </p>
-     *
-     * <p> {@link Vector}s are sequence containers representing arrays that can change in size. </p>
-     *
-     * <p> Just like arrays, {@link Vector}s use contiguous storage locations for their elements, which means that
-     * their elements can also be accessed using offsets on regular pointers to its elements, and just as efficiently
-     * as in arrays. But unlike arrays, their size can change dynamically, with their storage being handled
-     * automatically by the  </p>
-     *
-     * <p> Internally, {@link Vector}s use a dynamically allocated array to store their elements. This array may need
-     * to be reallocated in order to grow in size when new elements are inserted, which implies allocating a new
-     * array and moving all elements to it. This is a relatively expensive task in terms of processing time, and
-     * thus, {@link Vector}s do not reallocate each time an element is added to the  </p>
-     *
-     * <p> Instead, {@link Vector} containers may allocate some extra storage to accommodate for possible growth, and
-     * thus the container may have an actual {@link capacity} greater than the storage strictly needed to contain its
-     * elements (i.e., its {@link size}). Libraries can implement different strategies for growth to balance between
-     * memory usage and reallocations, but in any case, reallocations should only happen at logarithmically growing
-     * intervals of {@link size} so that the insertion of individual elements at the end of the {@link Vector} can be
-     * provided with amortized constant time complexity (see {@link push_back push_back()}). </p>
-     *
-     * <p> Therefore, compared to arrays, {@link Vector}s consume more memory in exchange for the ability to manage
-     * storage and grow dynamically in an efficient way. </p>
-     *
-     * <p> Compared to the other dynamic sequence containers ({@link Deque}s, {@link List}s), {@link Vector Vectors}
-     * are very efficient accessing its elements (just like arrays) and relatively efficient adding or removing
-     * elements from its end. For operations that involve inserting or removing elements at positions other than the
-     * end, they perform worse than the others, and have less consistent iterators and references than {@link List}s.
-     * </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Sequence </dt>
-     *	<dd>
-     *		Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
-     *		accessed by their position in this sequence.
-     *	</dd>
-     *
-     *	<dt> Dynamic array </dt>
-     *	<dd>
-     *		Allows direct access to any element in the sequence, even through pointer arithmetics, and provides
-     *		relatively fast addition/removal of elements at the end of the sequence.
-     *	</dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @reference http://www.cplusplus.com/reference/vector/vector
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class Vector<T> extends Array<T> implements base.IArrayContainer<T> {
-        /**
-         * Type definition of {@link Vector}'s {@link VectorIterator iterator}.
-         */
-        static iterator: typeof VectorIterator;
-        /**
-         * <p> Default Constructor. </p>
-         *
-         * <p> Constructs an empty container, with no elements. </p>
-         */
-        constructor();
-        /**
-         * @inheritdoc
-         */
-        constructor(array: Array<T>);
-        /**
-         * <p> Initializer list Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
-         *
-         * @param array An array containing elements to be copied and contained.
-         */
-        constructor(n: number);
-        /**
-         * <p> Fill Constructor. </p>
-         *
-         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
-         *
-         * @param n Initial container size (i.e., the number of elements in the container at construction).
-         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
-         *			  initialized to a copy of this value.
-         */
-        constructor(n: number, val: T);
-        /**
-         * <p> Copy Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
-         *
-         * @param container Another container object of the same type (with the same class template
-         *					arguments <i>T</i>), whose contents are either copied or acquired.
-         */
-        constructor(container: base.IContainer<T>);
-        /**
-         * <p> Range Constructor. </p>
-         *
-         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
-         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * @inheritdoc
-         */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        assign(n: number, val: T): void;
-        /**
-         * @inheritdoc
-         */
-        reserve(size: number): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        begin(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        end(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rbegin(): VectorReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rend(): VectorReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        size(): number;
-        /**
-         * @inheritdoc
-         */
-        capacity(): number;
-        /**
-         * @inheritdoc
-         */
-        empty(): boolean;
-        /**
-         * @inheritdoc
-         */
-        at(index: number): T;
-        /**
-         * @inheritdoc
-         */
-        set(index: number, val: T): T;
-        /**
-         * @inheritdoc
-         */
-        front(): T;
-        /**
-         * @inheritdoc
-         */
-        back(): T;
-        /**
-         * @inheritdoc
-         */
-        push_back(val: T): void;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
-         * <i>position</i>, effectively increasing the container size by one. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Position in the {@link Vector} where the new element is inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param val Value to be copied to the inserted element.
-         *
-         * @return An iterator that points to the newly inserted element.
-         */
-        insert(position: VectorIterator<T>, val: T): VectorIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
-         * @param val Value to be copied (or moved) to the inserted elements.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
-         * iterators. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorIterator<T>, begin: InputIterator, end: InputIterator): VectorIterator<T>;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
-         * <i>position</i>, effectively increasing the container size by one. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Position in the {@link Vector} where the new element is inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param val Value to be copied to the inserted element.
-         *
-         * @return An iterator that points to the newly inserted element.
-         */
-        insert(position: VectorReverseIterator<T>, val: T): VectorReverseIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
-         * @param val Value to be copied (or moved) to the inserted elements.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: VectorReverseIterator<T>, n: number, val: T): VectorReverseIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
-         * iterators. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorReverseIterator<T>, begin: InputIterator, end: InputIterator): VectorReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        private insert_by_val(position, val);
-        /**
-         * @hidden
-         */
-        protected insert_by_repeating_val(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<InputIterator extends Iterator<T>>(position: VectorIterator<T>, first: InputIterator, last: InputIterator): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        pop_back(): void;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(position: VectorIterator<T>): VectorIterator<T>;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(position: VectorReverseIterator<T>): VectorReverseIterator<T>;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(first: VectorReverseIterator<T>, last: VectorReverseIterator<T>): VectorReverseIterator<T>;
-        /**
-         * @hiddde
-         */
-        protected erase_by_range(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.IContainer<T>): void;
-    }
-    /**
-     * <p> An iterator of Vector. </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class VectorIterator<T> extends Iterator<T> implements base.IArrayIterator<T> {
-        /**
-         * Sequence number of iterator in the source {@link Vector}.
-         */
-        private index_;
-        /**
-         * <p> Construct from the source {@link Vector container}. </p>
-         *
-         * <h4> Note </h4>
-         * <p> Do not create the iterator directly, by yourself. </p>
-         * <p> Use {@link Vector.begin begin()}, {@link Vector.end end()} in {@link Vector container} instead. </p>
-         *
-         * @param source The source {@link Vector container} to reference.
-         * @param index Sequence number of the element in the source {@link Vector}.
-         */
-        constructor(source: Vector<T>, index: number);
-        /**
-         * @hidden
-         */
-        private vector;
-        /**
-         * @inheritdoc
-         */
-        /**
-         * Set value.
-         */
-        value: T;
-        /**
-         * Get index.
-         */
-        index: number;
-        /**
-         * @inheritdoc
-         */
-        prev(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        next(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        advance(n: number): VectorIterator<T>;
-        /**
-         * <p> Whether an iterator is equal with the iterator. </p>
-         *
-         * <p> Compare two iterators and returns whether they are equal or not. </p>
-         *
-         * <h4> Note </h4>
-         * <p> Iterator's equal_to() only compare souce container and index number. </p>
-         *
-         * <p> Although elements in a pair, key and value are equal_to, if the source map or
-         * index number is different, then the {@link equal_to equal_to()} will return false. If you want to
-         * compare the elements of a pair, compare them directly by yourself. </p>
-         *
-         * @param obj An iterator to compare
-         * @return Indicates whether equal or not.
-         */
-        equal_to<U extends T>(obj: VectorIterator<U>): boolean;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: VectorIterator<T>): void;
-    }
-    /**
-     * <p> A reverse-iterator of Vector. </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class VectorReverseIterator<T> extends ReverseIterator<T, VectorIterator<T>, VectorReverseIterator<T>> implements base.IArrayIterator<T> {
-        constructor(base: VectorIterator<T>);
-        /**
-         * @inheritdoc
-         */
-        protected create_neighbor(): VectorReverseIterator<T>;
-        /**
-         * Set value.
-         */
-        value: T;
-        /**
-         * Get index.
-         */
-        index: number;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> An abstract container. </p>
-     *
-     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     * 	<dt> Sequence </dt>
-     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
-     *		 accessed by their position in this sequence. </dd>
-     *
-     * 	<dt> Doubly-linked list </dt>
-     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing
-     *		 constant time insert and erase operations before or after a specific element (even of entire ranges),
-     *		 but no direct random access. </dd>
-     * </dl>
-     *
-     * @param <T> Type of elements.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    abstract class Container<T> implements IContainer<T> {
-        /**
-         * <p> Default Constructor. </p>
-         *
-         * <p> Constructs an empty container, with no elements. </p>
-         */
-        constructor();
-        /**
-         * <p> Initializer list Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
-         *
-         * @param array An array containing elements to be copied and contained.
-         */
-        constructor(array: Array<T>);
-        /**
-         * <p> Copy Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
-         *
-         * @param container Another container object of the same type (with the same class template
-         *					arguments <i>T</i>), whose contents are either copied or acquired.
-         */
-        constructor(container: IContainer<T>);
-        /**
-         * <p> Range Constructor. </p>
-         *
-         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
-         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * @inheritdoc
-         */
-        abstract assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        abstract begin(): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract end(): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract rbegin(): base.IReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract rend(): base.IReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract size(): number;
-        /**
-         * @inheritdoc
-         */
-        empty(): boolean;
-        /**
-         * @inheritdoc
-         */
-        abstract push<U extends T>(...items: U[]): number;
-        /**
-         * @inheritdoc
-         */
-        abstract insert(position: Iterator<T>, val: T): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract erase(position: Iterator<T>): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract erase<U extends T>(begin: Iterator<U>, end: Iterator<U>): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: IContainer<T>): void;
-    }
-}
 declare namespace std {
     /**
      * <p> Double ended queue. </p>
@@ -1266,6 +3518,8 @@ declare namespace std {
          */
         private swap_deque(obj);
     }
+}
+declare namespace std {
     /**
      * <p> An iterator of {@link Deque}. </p>
      *
@@ -1334,6 +3588,8 @@ declare namespace std {
          */
         swap(obj: DequeIterator<T>): void;
     }
+}
+declare namespace std {
     /**
      * <p> A reverse-iterator of Deque. </p>
      *
@@ -1361,1824 +3617,820 @@ declare namespace std {
 }
 declare namespace std {
     /**
-     * <p> Doubly linked list. </p>
+     * <p> Function handling termination on exception </p>
      *
-     * <p> {@link List}s are sequence containers that allow constant time insert and erase operations anywhere within the
-     * sequence, and iteration in both directions. </p>
+     * <p> Calls the current terminate handler. </p>
      *
-     * <p> List containers are implemented as doubly-linked lists; Doubly linked lists can store each of the elements they
-     * contain in different and unrelated storage locations. The ordering is kept internally by the association to each
-     * element of a link to the element preceding it and a link to the element following it. </p>
+     * <p> By default, the terminate handler calls abort. But this behavior can be redefined by calling
+     * {@link set_terminate}. </p>
      *
-     * <p> They are very similar to forward_list: The main difference being that forward_list objects are single-linked
-     * lists, and thus they can only be iterated forwards, in exchange for being somewhat smaller and more efficient. </p>
+     * <p> This function is automatically called when no <code>catch</code> handler can be found for a thrown exception,
+     * or for some other exceptional circumstance that makes impossible to continue the exception handling process. </p>
      *
-     * <p> Compared to other base standard sequence containers (array, vector and deque), lists perform generally better
-     * in inserting, extracting and moving elements in any position within the container for which an iterator has already
-     * been obtained, and therefore also in algorithms that make intensive use of these, like sorting algorithms. </p>
+     * <p> This function is provided so that the terminate handler can be explicitly called by a program that needs to
+     * abnormally terminate, and works even if {@link set_terminate} has not been used to set a custom terminate handler
+     * (calling abort in this case). </p>
+     */
+    function terminate(): void;
+    /**
+     * <p> Set <i>terminate handler</i> function. </p>
      *
-     * <p> The main drawback of lists and forward_lists compared to these other sequence containers is that they lack
-     * direct access to the elements by their position; For example, to access the sixth element in a list, one has to
-     * iterate from a known position (like the beginning or the end) to that position, which takes linear time in the
-     * distance between these. They also consume some extra memory to keep the linking information associated to each
-     * element (which may be an important factor for large lists of small-sized elements). </p>
+     * <p> A <i>terminate handler</i> function is a function automatically called when the exception handling process has
+     * to be abandoned for some reason. This happens when no catch handler can be found for a thrown exception, or for
+     * some other exceptional circumstance that makes impossible to continue the exception handling process. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> Before this function is called by the program for the first time, the default behavior is to call abort. </p>
      *
-     * <h3> Container properties </h3>
-     * <dl>
-     * 	<dt> Sequence </dt>
-     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are accessed by
-     *		 their position in this sequence. </dd>
+     * <p> A program may explicitly call the current terminate handler function by calling {@link terminate}. </p>
      *
-     * 	<dt> Doubly-linked list </dt>
-     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing constant time
-     *		 insert and erase operations before or after a specific element (even of entire ranges), but no direct random
-     *		 access. </dd>
-     * </dl>
+     * @param f Function that takes no parameters and returns no value (<i>void</i>).
+     */
+    function set_terminate(f: () => void): void;
+    /**
+     * <p> Get <i>terminate handler</i> function. </p>
      *
-     * @param <T> Type of the elements.
+     * <p> The <i>terminate handler</i> function is automatically called when no <code>catch</code> handler can be found
+     * for a thrown exception, or for some other exceptional circumstance that makes impossible to continue the exception
+     * handling process. </p>
      *
-     * @reference http://www.cplusplus.com/reference/list/list/
+     * <p> If no such function has been set by a previous call to {@link set_terminate}, the function returns a
+     * <i>null-pointer</i>. </p>
+     *
+     * @return If {@link set_terminate} has previously been called by the program, the function returns the current
+     *		   <i>terminate handler</i> function. Otherwise, it returns a <i>null-pointer</i>.
+     */
+    function get_terminate(): () => void;
+    /**
+     * <p> Standard exception class. </p>
+     *
+     * <p> Base class for standard exceptions. </p>
+     *
+     * <p> All objects thrown by components of the standard library are derived from this class.
+     * Therefore, all standard exceptions can be caught by catching this type by reference. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/exception/exception
      * @author Jeongho Nam <http://samchon.org>
      */
-    class List<T> extends base.Container<T> implements base.IDequeContainer<T> {
+    class Exception extends Error {
         /**
-         * An iterator of beginning.
+         * A message representing specification about the Exception.
          */
-        protected begin_: ListIterator<T>;
+        private description;
         /**
-         * An iterator of end.
-         */
-        protected end_: ListIterator<T>;
-        /**
-         * Number of elements in the {@link List}.
-         */
-        protected size_: number;
-        /**
-         * <p> Default Constructor. </p>
-         *
-         * <p> Constructs an empty container, with no elements. </p>
+         * Default Constructor.
          */
         constructor();
         /**
-         * <p> Initializer list Constructor. </p>
+         * <p> Construct from a message. </p>
          *
-         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
-         *
-         * @param array An array containing elements to be copied and contained.
+         * @param message A message representing specification about the Exception.
          */
-        constructor(items: Array<T>);
+        constructor(message: string);
         /**
-         * <p> Fill Constructor. </p>
+         * <p> Get string identifying exception. </p>
+         * <p> Returns a string that may be used to identify the exception. </p>
          *
-         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
-         *
-         * @param n Initial container size (i.e., the number of elements in the container at construction).
-         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
-         *			  initialized to a copy of this value.
+         * <p> The particular representation pointed by the returned value is implementation-defined.
+         * As a virtual function, derived classes may redefine this function so that specify value are
+         * returned. </p>
          */
-        constructor(size: number, val: T);
-        /**
-         * <p> Copy Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
-         *
-         * @param container Another container object of the same type (with the same class template
-         *					arguments <i>T</i>), whose contents are either copied or acquired.
-         */
-        constructor(container: base.IContainer<T>);
-        /**
-         * <p> Range Constructor. </p>
-         *
-         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
-         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
+        what(): string;
         /**
          * @inheritdoc
          */
-        assign(n: number, val: T): void;
+        message: string;
         /**
          * @inheritdoc
          */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        begin(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        end(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rbegin(): ListReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rend(): ListReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        size(): number;
-        /**
-         * @inheritdoc
-         */
-        front(): T;
-        /**
-         * @inheritdoc
-         */
-        back(): T;
-        /**
-         * @inheritdoc
-         */
-        push<U extends T>(...items: U[]): number;
-        /**
-         * @inheritdoc
-         */
-        push_front(val: T): void;
-        /**
-         * @inheritdoc
-         */
-        push_back(val: T): void;
-        /**
-         * @inheritdoc
-         */
-        pop_front(): void;
-        /**
-         * @inheritdoc
-         */
-        pop_back(): void;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new element is inserted.
-         *				   {@link iterator}> is a member type, defined as a
-         *				   {@link ListIterator bidirectional iterator} type that points to elements.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the newly inserted element; <i>val</i>.
-         */
-        insert(position: ListIterator<T>, val: T): ListIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param size Number of elements to insert.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param begin An iterator specifying range of the begining element.
-         * @param end An iterator specifying range of the ending element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new element is inserted.
-         *				   {@link iterator}> is a member type, defined as a
-         *				   {@link ListReverseIterator bidirectional iterator} type that points to elements.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the newly inserted element; <i>val</i>.
-         */
-        insert(position: ListReverseIterator<T>, val: T): ListReverseIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param size Number of elements to insert.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: ListReverseIterator<T>, size: number, val: T): ListReverseIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param begin An iterator specifying range of the begining element.
-         * @param end An iterator specifying range of the ending element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: ListReverseIterator<T>, begin: InputIterator, end: InputIterator): ListReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        private insert_by_val(position, val);
-        /**
-         * @hidden
-         */
-        protected insert_by_repeating_val(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
-        /**
-         * <p> Erase an element. </p>
-         *
-         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link List}.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
-         */
-        erase(position: ListIterator<T>): ListIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         *
-         * <p> Removes from the {@link List} container a range of elements. </p>
-         *
-         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
-         */
-        erase(begin: ListIterator<T>, end: ListIterator<T>): ListIterator<T>;
-        /**
-         * <p> Erase an element. </p>
-         *
-         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link List}.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
-         */
-        erase(position: ListReverseIterator<T>): ListReverseIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         *
-         * <p> Removes from the {@link List} container a range of elements. </p>
-         *
-         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
-         */
-        erase(begin: ListReverseIterator<T>, end: ListReverseIterator<T>): ListReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        protected erase_by_range(first: ListIterator<T>, last: ListIterator<T>): ListIterator<T>;
-        /**
-         * <p> Remove duplicate values. </p>
-         *
-         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
-         *
-         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
-         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
-         */
-        unique(): void;
-        /**
-         * <p> Remove duplicate values. </p>
-         *
-         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
-         *
-         * <p> The argument <i>binary_pred</i> is a specific comparison function that determine the <u>uniqueness</u>
-         * of an element. In fact, any behavior can be implemented (and not only an equality comparison), but notice
-         * that the function will call <code>binary_pred(it.value, it.prev().value)</code> for all pairs of elements
-         * (where <code>it</code> is an iterator to an element, starting from the second) and remove <code>it</code>
-         * from the {@link List} if the predicate returns <code>true</code>.
-         *
-         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
-         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
-         *
-         * @param binary_pred Binary predicate that, taking two values of the same type than those contained in the
-         *					  {@link List}, returns <code>true</code> to remove the element passed as first argument
-         *					  from the container, and <code>false</code> otherwise. This shall be a function pointer
-         *					  or a function object.
-         */
-        unique(binary_pred: (left: T, right: T) => boolean): void;
-        /**
-         * <p> Remove elements with specific value. </p>
-         *
-         * <p> Removes from the container all the elements that compare equal to <i>val</i>. This calls the
-         * destructor of these objects and reduces the container {@link size} by the number of elements removed. </p>
-         *
-         * <p> Unlike member function {@link List.erase}, which erases elements by their position (using an
-         * iterator), this function ({@link List.remove}) removes elements by their value. </p>
-         *
-         * <p> A similar function, {@link List.remove_if}, exists, which allows for a condition other than an
-         * equality comparison to determine whether an element is removed. </p>
-         *
-         * @param val Value of the elements to be removed.
-         */
-        remove(val: T): void;
-        /**
-         * <p> Remove elements fulfilling condition. </p>
-         *
-         * <p> Removes from the container all the elements for which <i>pred</i> returns <code>true</code>. This
-         * calls the destructor of these objects and reduces the container {@link size} by the number of elements
-         * removed. </p>
-         *
-         * <p> The function calls <code>pred(it.value)</code> for each element (where <code>it</code> is an iterator
-         * to that element). Any of the elements in the list for which this returns <code>true</code>, are removed
-         * from the  </p>
-         *
-         * @param pred Unary predicate that, taking a value of the same type as those contained in the forward_list
-         *			   object, returns <code>true</code> for those values to be removed from the container, and
-         *			   <code>false</code> for those remaining. This can either be a function pointer or a function
-         *			   object.
-         */
-        remove_if(pred: (val: T) => boolean): void;
-        /**
-         * <p> Merge sorted {@link List Lists}. </p>
-         *
-         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
-         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
-         * </p>
-         *
-         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
-         * them into their ordered position within container (which expands in {@link size} by the number of elements
-         * transferred). The operation is performed without constructing nor destroying any element: they are
-         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
-         * move-construction or not. </p>
-         *
-         * <p> This function requires that the {@link List} containers have their elements already ordered by value
-         * ({@link less}) before the call. For an alternative on unordered {@link List Lists}, see
-         * {@link List.splice}. </p>
-         *
-         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
-         * value according to the strict weak ordering defined by {@link less}. The resulting order of equivalent
-         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
-         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
-         *
-         * The function does nothing if <code>this == obj</code>.
-         *
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
-         *			  passed.
-         */
-        merge<U extends T>(obj: List<U>): void;
-        /**
-         * <p> Merge sorted {@link List Lists}. </p>
-         *
-         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
-         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
-         * </p>
-         *
-         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
-         * them into their ordered position within container (which expands in {@link size} by the number of elements
-         * transferred). The operation is performed without constructing nor destroying any element: they are
-         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
-         * move-construction or not. </p>
-         *
-         * <p> The argument <i>compare</i> is a specific predicate to perform the comparison operation between
-         * elements. This comparison shall produce a strict weak ordering of the elements (i.e., a consistent
-         * transitive comparison, without considering its reflexiveness).
-         *
-         * <p> This function requires that the {@link List} containers have their elements already ordered by
-         * <i>compare</i> before the call. For an alternative on unordered {@link List Lists}, see
-         * {@link List.splice}. </p>
-         *
-         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
-         * value according to the strict weak ordering defined by <i>compare</i>. The resulting order of equivalent
-         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
-         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
-         *
-         * The function does nothing if <code>this == obj</code>.
-         *
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
-         *			  passed.
-         * @param compare Binary predicate that, taking two values of the same type than those contained in the
-         *				  {@link list}, returns <code>true</code> if the first argument is considered to go before
-         *				  the second in the strict weak ordering it defines, and <code>false</code> otherwise.
-         *				  This shall be a function pointer or a function object.
-         */
-        merge<U extends T>(obj: List<U>, compare: (left: T, right: T) => boolean): void;
-        /**
-         * <p> Transfer elements from {@link List} to {@link List}. </p>
-         *
-         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
-         *
-         * <p> This effectively inserts all elements into the container and removes them from <i>obj</i>, altering
-         * the sizes of both containers. The operation does not involve the construction or destruction of any
-         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
-         * value_type supports move-construction or not. </p>
-         *
-         * <p> This first version (1) transfers all the elements of <i>obj</i> into the  </p>
-         *
-         * @param position Position within the container where the elements of <i>obj</i> are inserted.
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         */
-        splice<U extends T>(position: ListIterator<T>, obj: List<U>): void;
-        /**
-         * <p> Transfer an element from {@link List} to {@link List}. </p>
-         *
-         * <p> Transfers an element from <i>obj</i>, which is pointed by an {@link ListIterator iterator} <i>it</i>,
-         * into the container, inserting the element at specified <i>position</i>. </p>
-         *
-         * <p> This effectively inserts an element into the container and removes it from <i>obj</i>, altering the
-         * sizes of both containers. The operation does not involve the construction or destruction of any element.
-         * They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type
-         * supports move-construction or not. </p>
-         *
-         * <p> This second version (2) transfers only the element pointed by <i>it</i> from <i>obj</i> into the
-         *  </p>
-         *
-         * @param position Position within the container where the element of <i>obj</i> is inserted.
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
-         *			  being spliced.
-         * @param it {@link ListIterator Iterator} to an element in <i>obj</i>. Only this single element is
-         *			 transferred.
-         */
-        splice<U extends T>(position: ListIterator<T>, obj: List<U>, it: ListIterator<U>): void;
-        /**
-         * <p> Transfer elements from {@link List} to {@link List}. </p>
-         *
-         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
-         *
-         * <p> This effectively inserts those elements into the container and removes them from <i>obj</i>, altering
-         * the sizes of both containers. The operation does not involve the construction or destruction of any
-         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
-         * value_type supports move-construction or not. </p>
-         *
-         * <p> This third version (3) transfers the range [<i>begin</i>, <i>end</i>) from <i>obj</i> into the
-         *  </p>
-         *
-         * @param position Position within the container where the elements of <i>obj</i> are inserted.
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
-         *			  being spliced.
-         * @param begin {@link ListIterator An Iterator} specifying initial position of a range of elements in
-         *				<i>obj</i>. Transfers the elements in the range [<b><i>begin</i></b>, <i>end</i>) to
-         *				<i>position</i>.
-         * @param end {@link ListIterator An Iterator} specifying final position of a range of elements in
-         *			  <i>obj</i>. Transfers the elements in the range [<i>begin</i>, <b><i>end</i></b>) to
-         *			  <i>position</i>. Notice that the range includes all the elements between <i>begin<i/> and
-         *			  <i>end</i>, including the element pointed by <i>begin</i> but not the one pointed by <i>end</i>.
-         */
-        splice<U extends T>(position: ListIterator<T>, obj: List<U>, begin: ListIterator<U>, end: ListIterator<U>): void;
-        /**
-         * <p> Sort elements in  </p>
-         *
-         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
-         *
-         * <p> The sorting is performed by applying an algorithm that uses {@link less}. This comparison shall
-         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
-         * considering its reflexiveness). </p>
-         *
-         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
-         * order they had before the call. </p>
-         *
-         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
-         * Elements are moved within the  </p>
-         */
-        sort(): void;
-        /**
-         * <p> Sort elements in  </p>
-         *
-         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
-         *
-         * <p> The sorting is performed by applying an algorithm that uses <i>compare</i>. This comparison shall
-         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
-         * considering its reflexiveness). </p>
-         *
-         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
-         * order they had before the call. </p>
-         *
-         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
-         * Elements are moved within the  </p>
-         *
-         * @param compare Binary predicate that, taking two values of the same type of those contained in the
-         *				  {@link List}, returns <code>true</code> if the first argument goes before the second
-         *				  argument in the strict weak ordering it defines, and <code>false</code> otherwise. This
-         *				  shall be a function pointer or a function object.
-         */
-        sort(compare: (left: T, right: T) => boolean): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.IContainer<T>): void;
-        /**
-         * @hidden
-         */
-        private swap_list(obj);
+        name: string;
     }
     /**
-     * <p> An iterator, node of a List. </p>
+     * <p> Logic error exception. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> This class defines the type of objects thrown as exceptions to report errors in the internal
+     * logical of the program, such as violation of logical preconditions or class invariants. </p>
      *
+     * <p> These errors are presumably detectable before the program executes. </p>
+     *
+     * <p> It is used as a base class for several logical error exceptions. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/logic_error
      * @author Jeongho Nam <http://samchon.org>
      */
-    class ListIterator<T> extends Iterator<T> {
-        private prev_;
-        private next_;
-        private value_;
+    class LogicError extends Exception {
         /**
-         * <p> Construct from the source {@link List container}. </p>
+         * <p> Construct from a message. </p>
          *
-         * <h4> Note </h4>
-         * <p> Do not create the iterator directly, by yourself. </p>
-         * <p> Use {@link List.begin begin()}, {@link List.end end()} in {@link List container} instead. </p>
-         *
-         * @param source The source {@link List container} to reference.
-         * @param prev A refenrece of previous node ({@link ListIterator iterator}).
-         * @param next A refenrece of next node ({@link ListIterator iterator}).
-         * @param value Value to be stored in the node (iterator).
+         * @param message A message representing specification about the Exception.
          */
-        constructor(source: List<T>, prev: ListIterator<T>, next: ListIterator<T>, value: T);
-        /**
-         * @inheritdoc
-         */
-        set_prev(it: ListIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_next(next: ListIterator<T>): void;
-        private list();
-        /**
-         * @inheritdoc
-         */
-        prev(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        next(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        advance(step: number): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        value: T;
-        /**
-         * @inheritdoc
-         */
-        equal_to(obj: ListIterator<T>): boolean;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: ListIterator<T>): void;
+        constructor(message: string);
     }
     /**
-     * <p> A reverse-iterator of List. </p>
+     * <p> Domain error exception. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> This class defines the type of objects thrown as exceptions to report domain errors. </p>
      *
-     * @param <T> Type of the elements.
+     * <p> Generally, the domain of a mathematical function is the subset of values that it is defined for.
+     * For example, the square root function is only defined for non-negative numbers. Thus, a negative number
+     * for such a function would qualify as a domain error. </p>
      *
+     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
+     * exception to be thrown by programs. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/domain_error
      * @author Jeongho Nam <http://samchon.org>
      */
-    class ListReverseIterator<T> extends ReverseIterator<T, ListIterator<T>, ListReverseIterator<T>> {
-        constructor(base: ListIterator<T>);
+    class DomainError extends LogicError {
         /**
-         * @inheritdoc
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
          */
-        protected create_neighbor(): ListReverseIterator<T>;
+        constructor(message: string);
+    }
+    /**
+     * <p> Invalid argument exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report an invalid argument. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
+     * also throw exceptions of this type to signal invalid arguments. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/invalid_argument
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class InvalidArgument extends LogicError {
         /**
-         * @inheritdoc
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
          */
-        value: T;
+        constructor(message: string);
+    }
+    /**
+     * <p> Length error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report a length error. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
+     * such as vector and string also throw exceptions of this type to signal errors resizing. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/length_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class LengthError extends LogicError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Out-of-range exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report an out-of-range error. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
+     * such as vector, deque, string and bitset also throw exceptions of this type to signal arguments
+     * out of range. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/out_of_range
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class OutOfRange extends LogicError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Runtime error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report errors that can only be
+     * detected during runtime. </p>
+     *
+     * <p> It is used as a base class for several runtime error exceptions. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/runtime_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class RuntimeError extends Exception {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Overflow error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to arithmetic overflow errors. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
+     * also throw exceptions of this type to signal range errors. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/outflow_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class OverflowError extends RuntimeError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Underflow error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to arithmetic underflow errors. </p>
+     *
+     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
+     * exception to be thrown by programs. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/underflow_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class UnderflowError extends RuntimeError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Range error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report range errors in internal
+     * computations. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
+     * also throw exceptions of this type to signal range errors. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/range_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class RangeError extends RuntimeError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
     }
 }
 declare namespace std {
     /**
-     * <p> FIFO queue. </p>
+     * <p> Function object class for equality comparison. </p>
      *
-     * <p> {@link Queue}s are a type of container adaptor, specifically designed to operate in a FIFO context
-     * (first-in first-out), where elements are inserted into one end of the container and extracted from the other.
-     * </p>
+     * <p> Binary function object class whose call returns whether its two arguments compare <i>equal</i> (as returned by
+     * operator ==). </p>
      *
-     * <p> {@link Queue}s are implemented as containers adaptors, which are classes that use an encapsulated object of
-     * a specific container class as its underlying container, providing a specific set of member functions to access
-     * its elements. Elements are pushed into the {@link IDeque.back back()} of the specific container and popped from
-     * its {@link IDeque.front front()}. </p>
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
+     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
      *
-     * <p> {@link container_ The underlying container} may be one of the standard container class template or some
-     * other specifically designed container class. This underlying container shall support at least the following
-     * operations: </p>
+     * @param x First element to compare.
+     * @param y Second element to compare.
      *
-     * <ul>
-     *	<li> empty </li>
-     *	<li> size </li>
-     *	<li> front </li>
-     *	<li> back </li>
-     *	<li> push_back </li>
-     *	<li> pop_front </li>
-     * </ul>
+     * @return Whether the arguments are equal.
+     */
+    function equal_to<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function object class for non-equality comparison. </p>
      *
-     * <p> The standard container classes {@link Deque} and {@link List} fulfill these requirements.
-     * By default, if no container class is specified for a particular {@link Queue} class instantiation, the standard
-     * container {@link List} is used. </p>
+     * <p> Binary function object class whose call returns whether its two arguments compare <i>not equal</i> (as returned
+     * by operator operator!=). </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
+     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
      *
-     * @param <T> Type of elements.
+     * @param x First element to compare.
+     * @param y Second element to compare.
      *
-     * @reference http://www.cplusplus.com/reference/queue/queue
+     * @return Whether the arguments are not equal.
+     */
+    function not_equal_to<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function for less-than inequality comparison. </p>
+     *
+     * <p> Binary function returns whether the its first argument compares less than the second. </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
+     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
+     * This member function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()}</code>,
+     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
+     *
+     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
+     *			  <i>operator<()</i> or method {@link IComparable.less less}.
+     *
+     * @param x First element, the standard of comparison.
+     * @param y Second element compare with the first.
+     *
+     * @return Whether the first parameter is less than the second.
+     */
+    function less<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function object class for less-than-or-equal-to comparison. </p>
+     *
+     * <p> Binary function object class whose call returns whether the its first argument compares {@link less less than} or
+     * {@link equal_to equal to} the second (as returned by operator <=). </p>
+     *
+     * <p> Generically, <i>function objects</i> are instances of a class with member function {@link IComparable.less less}
+     * and {@link IComparable.equal_to equal_to} defined. This member function allows the object to be used with the same
+     * syntax as a function call. </p>
+     *
+     * @param x First element, the standard of comparison.
+     * @param y Second element compare with the first.
+     *
+     * @return Whether the <i>x</i> is {@link less less than} or {@link equal_to equal to} the <i>y</i>.
+     */
+    function less_equal<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function for greater-than inequality comparison. </p>
+     *
+     * <p> Binary function returns whether the its first argument compares greater than the second. </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function {@link less} and
+     * {@link equal_to equal_to()} defined. If an object doesn't have those methods, then its own uid will be used
+     * to compare insteadly. This member function allows the object to be used with the same syntax as a function
+     * call. </p>
+     *
+     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()},
+     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
+     *
+     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
+     *			  <i>operator>()</i> or method {@link IComparable.greater greater}.
+     *
+     * @return Whether the <i>x</i> is greater than the <i>y</i>.
+     */
+    function greater<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function object class for greater-than-or-equal-to comparison. </p>
+     *
+     * <p> Binary function object class whose call returns whether the its first argument compares
+     * {@link greater greater than} or {@link equal_to equal to} the second (as returned by operator >=). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
+     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
+     * This member function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x First element, the standard of comparison.
+     * @param y Second element compare with the first.
+     *
+     * @return Whether the <i>x</i> is {@link greater greater than} or {@link equal_to equal to} the <i>y</i>.
+     */
+    function greater_equal<T>(x: T, y: T): boolean;
+    /**
+     * <p> Logical AND function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of the <i>logical "and"</i> operation between its two
+     * arguments (as returned by operator &&). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
+     * function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of logical AND operation.
+     */
+    function logical_and<T>(x: T, y: T): boolean;
+    /**
+     * <p> Logical OR function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of the <i>logical "or"</i> operation between its two
+     * arguments (as returned by operator ||). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
+     * function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of logical OR operation.
+     */
+    function logical_or<T>(x: T, y: T): boolean;
+    /**
+     * <p> Logical NOT function object class. </p>
+     *
+     * <p> Unary function object class whose call returns the result of the <i>logical "not"</i> operation on its argument
+     * (as returned by operator !). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
+     * function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x Target element.
+     *
+     * @return Result of logical NOT operation.
+     */
+    function logical_not<T>(x: T): boolean;
+    /**
+     * <p> Bitwise AND function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
+     * its two arguments (as returned by operator &). </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of bitwise AND operation.
+     */
+    function bit_and(x: number, y: number): number;
+    /**
+     * <p> Bitwise OR function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
+     * its two arguments (as returned by operator &). </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of bitwise OR operation.
+     */
+    function bit_or(x: number, y: number): number;
+    /**
+     * <p> Bitwise XOR function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "exclusive or"</i>
+     * operation between its two arguments (as returned by operator ^). </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of bitwise XOR operation.
+     */
+    function bit_xor(x: number, y: number): number;
+    /**
+     * <p> Comparable instance. </p>
+     *
+     * <p> {@link IComparable} is a common interface for objects who can compare each other. </p>
+     *
+     * @reference https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html
      * @author Jeongho Nam <http://samchon.org>
      */
-    class Queue<T> {
-        /**
-         * The <i>underlying object</i> for implementing the <i>FIFO</i>
-         */
-        private container_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: Queue<T>);
-        /**
-         * <p> Return size. </p>
-         * <p> Returns the number of elements in the {@link Queue}. </p>
-         *
-         * <p> This member function effectively calls member {@link IDeque.size size()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return The number of elements in the {@link container_ underlying container}.
-         */
-        size(): number;
-        /**
-         * <p> Test whether container is empty. </p>
-         * <p> returns whether the {@link Queue} is empty: i.e. whether its <i>size</i> is zero. </p>
-         *
-         * <p> This member function efeectively calls member {@link IDeque.empty empty()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return <code>true</code> if the {@link container_ underlying container}'s size is 0,
-         *		   <code>false</code> otherwise. </p>
-         */
-        empty(): boolean;
-        /**
-         * <p> Access next element. </p>
-         * <p> Returns a value of the next element in the {@link Queue}. </p>
-         *
-         * <p> The next element is the "oldest" element in the {@link Queue} and the same element that is popped out
-         * from the queue when {@link pop Queue.pop()} is called. </p>
-         *
-         * <p> This member function effectively calls member {@link IDeque.front front()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A value of the next element in the {@link Queue}.
-         */
-        front(): T;
-        /**
-         * <p> Access last element. </p>
-         *
-         * <p> Returns a vaue of the last element in the queue. This is the "newest" element in the queue (i.e. the
-         * last element pushed into the queue). </p>
-         *
-         * <p> This member function effectively calls the member function {@link IDeque.back back()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A value of the last element in the {@link Queue}.
-         */
-        back(): T;
-        /**
-         * <p> Insert element. </p>
-         *
-         * <p> Inserts a new element at the end of the {@link Queue}, after its current last element.
-         * The content of this new element is initialized to <i>val</i>. </p>
-         *
-         * <p> This member function effectively calls the member function {@link IDeque.push_back push_back()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @param val Value to which the inserted element is initialized.
-         */
-        push(val: T): void;
-        /**
-         * <p> Remove next element. </p>
-         *
-         * <p> Removes the next element in the {@link Queue}, effectively reducing its size by one. </p>
-         *
-         * <p> The element removed is the "oldest" element in the {@link Queue} whose value can be retrieved by calling
-         * member {@link front Queue.front()} </p>.
-         *
-         * <p> This member function effectively calls the member function {@link IDeque.pop_front pop_front()} of the
-         * {@link container_ underlying container} object. </p>
-         */
-        pop(): void;
-        /**
-         * <p> Swap contents. </p>
-         *
-         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
-         *
-         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
-         * the {@link container_ underlying containers}. </p>
-         *
-         * @param obj Another {@link Queue} container adaptor of the same type (i.e., instantiated with the same
-         *			  template parameter, <b>T</b>). Sizes may differ. </p>
-         */
-        swap(obj: Queue<T>): void;
-    }
-    /**
-     * <p> Priority queue. </p>
-     *
-     * <p> {@link PriorityQueue Priority queues} are a type of container adaptors, specifically designed such that its
-     * first element is always the greatest of the elements it contains, according to some <i>strict weak ordering</i>
-     * criterion. </p>
-     *
-     * <p> This context is similar to a <i>heap</i>, where elements can be inserted at any moment, and only the
-     * <i>max heap</i> element can be retrieved (the one at the top in the {@link PriorityQueue priority queue}). </p>
-     *
-     * <p> {@link PriorityQueue Priority queues} are implemented as <i>container adaptors</i>, which are classes that
-     * use an encapsulated object of a specific container class as its {@link container_ underlying container},
-     * providing a specific set of member functions to access its elements. Elements are popped from the <i>"back"</i>
-     * of the specific container, which is known as the <i>top</i> of the {@link PriorityQueue Priority queue}. </p>
-     *
-     * <p> The {@link container_ underlying container} may be any of the standard container class templates or some
-     * other specifically designed container class. The container shall be accessible through
-     * {@link IArrayIterator random access iterators} and support the following operations: </p>
-     *
-     * <ul>
-     *	<li> empty() </li>
-     *	<li> size() </li>
-     *	<li> front() </li>
-     *	<li> push_back() </li>
-     *	<li> pop_back() </li>
-     * </ul>
-     *
-     * <p> The standard container classes {@link Vector} and {@link Deque} fulfill these requirements. By default, if
-     * no container class is specified for a particular {@link PriorityQueue} class instantiation, the standard
-     * container {@link Vector} is used. </p>
-     *
-     * <p> Support of {@link IArrayIterator random access iterators} is required to keep a heap structure internally
-     * at all times. This is done automatically by the container adaptor by automatically calling the algorithm
-     * functions <i>make_heap</i>, <i>push_heap</i> and <i>pop_heap</i> when needed. </p>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @reference http://www.cplusplus.com/reference/queue/priority_queue/
-     * @author Jeongho Nam
-     */
-    class PriorityQueue<T> {
-        /**
-         * <p> The <i>underlying container</i> for implementing the <i>priority queue</i>. </p>
-         *
-         * <p> Following standard definition from the C++ committee, the <i>underlying container</i> should be one of
-         * {@link Vector} or {@link Deque}, however, I've adopted {@link TreeMultiSet} instead of them. Of course,
-         * there are proper reasons for adapting the {@link TreeMultiSet} even violating standard advice. </p>
-         *
-         * <p> <i>Underlying container</i> of {@link PriorityQueue} must keep a condition; the highest (or lowest)
-         * element must be placed on the terminal node for fast retrieval and deletion. To keep the condition with
-         * {@link Vector} or {@link Deque}, lots of times will only be spent for re-arranging elements. It calls
-         * rearrangement functions like <i>make_heap</i>, <i>push_heap</i> and <i>pop_head</i> for rearrangement. </p>
-         *
-         * <p> However, the {@link TreeMultiSet} container always keeps arrangment automatically without additional
-         * operations and it even meets full criteria of {@link PriorityQueue}. Those are the reason why I've adopted
-         * {@link TreeMultiSet} as the <i>underlying container</i> of {@link PriorityQueue}. </p>
-         */
-        private container_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
-         *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: T, right: T) => boolean);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<T>);
-        /**
-         * Contruct from elements with compare.
-         *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: base.Container<T>);
-        /**
-         * Copy Constructor with compare.
-         *
-         * @param container A container to be copied.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.Container<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Range Constructor.
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * Range Constructor with compare.
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_container(container: base.IContainer<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_range(begin: Iterator<T>, end: Iterator<T>): void;
-        /**
-         * <p> Return size. </p>
-         *
-         * <p> Returns the number of elements in the {@link PriorityQueue}. </p>
-         *
-         * <p> This member function effectively calls member {@link IArray.size size} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return The number of elements in the underlying
-         */
-        size(): number;
-        /**
-         * <p> Test whether container is empty. </p>
-         *
-         * <p> Returns whether the {@link PriorityQueue} is empty: i.e. whether its {@link size} is zero. </p>
-         *
-         * <p> This member function effectively calls member {@link IARray.empty empty} of the
-         * {@link container_ underlying container} object. </p>
-         */
-        empty(): boolean;
-        /**
-         * <p> Access top element. </p>
-         *
-         * <p> Returns a constant reference to the top element in the {@link PriorityQueue}. </p>
-         *
-         * <p> The top element is the element that compares higher in the {@link PriorityQueue}, and the next that is
-         * removed from the container when {@link PriorityQueue.pop} is called. </p>
-         *
-         * <p> This member function effectively calls member {@link IArray.front front} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A reference to the top element in the {@link PriorityQueue}.
-         */
-        top(): T;
-        /**
-         * <p> Insert element. </p>
-         *
-         * <p> Inserts a new element in the {@link PriorityQueue}. The content of this new element is initialized to
-         * <i>val</i>.
-         *
-         * <p> This member function effectively calls the member function {@link IArray.push_back push_back} of the
-         * {@link container_ underlying container} object, and then reorders it to its location in the heap by calling
-         * the <i>push_heap</i> algorithm on the range that includes all the elements of the  </p>
-         *
-         * @param val Value to which the inserted element is initialized.
-         */
-        push(val: T): void;
-        /**
-         * <p> Remove top element. </p>
-         *
-         * <p> Removes the element on top of the {@link PriorityQueue}, effectively reducing its {@link size} by one.
-         * The element removed is the one with the highest (or lowest) value. </p>
-         *
-         * <p> The value of this element can be retrieved before being popped by calling member
-         * {@link PriorityQueue.top}. </p>
-         *
-         * <p> This member function effectively calls the <i>pop_heap</i> algorithm to keep the heap property of
-         * {@link PriorityQueue PriorityQueues} and then calls the member function {@link IArray.pop_back pop_back} of
-         * the {@link container_ underlying container} object to remove the element. </p>
-         */
-        pop(): void;
-        /**
-         * <p> Swap contents. </p>
-         *
-         * <p> Exchanges the contents of the container adaptor by those of <i>obj</i>, swapping both the
-         * {@link container_ underlying container} value and their comparison function using the corresponding
-         * {@link std.swap swap} non-member functions (unqualified). </p>
-         *
-         * <p> This member function has a <i>noexcept</i> specifier that matches the combined <i>noexcept</i> of the
-         * {@link IArray.swap swap} operations on the {@link container_ underlying container} and the comparison
-         * functions. </p>
-         *
-         * @param obj {@link PriorityQueue} container adaptor of the same type (i.e., instantiated with the same
-         *			  template parameters, <b>T</b>). Sizes may differ.
-         */
-        swap(obj: PriorityQueue<T>): void;
-    }
-}
-declare namespace std {
-    /**
-     * <p> LIFO stack. </p>
-     *
-     * <p> {@link Stack}s are a type of container adaptor, specifically designed to operate in a LIFO context
-     * (last-in first-out), where elements are inserted and extracted only from one end of the  </p>
-     *
-     * <p> {@link Stack}s are implemented as containers adaptors, which are classes that use an encapsulated object of
-     * a specific container class as its <i>underlying container</i>, providing a specific set of member functions to
-     * access its elements. Elements are pushed/popped from the {@link ILinearContainer.back back()} of the
-     * {@link ILinearContainer specific container}, which is known as the top of the {@link Stack}. </p>
-     *
-     * <p> {@link container_ The underlying container} may be any of the standard container class templates or some
-     * other specifically designed container class. The container shall support the following operations: </p>
-     *
-     * <ul>
-     *	<li> empty </li>
-     *	<li> size </li>
-     *	<li> front </li>
-     *	<li> back </li>
-     *	<li> push_back </li>
-     *	<li> pop_back </li>
-     * </ul>
-     *
-     * <p> The standard container classes {@link Vector}, {@link Deque} and {@link List} fulfill these requirements.
-     * By default, if no container class is specified for a particular {@link Stack} class instantiation, the standard
-     * container {@link List} is used. </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @param <T> Type of elements.
-     *
-     * @reference http://www.cplusplus.com/reference/stack/stack
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class Stack<T> {
-        /**
-         * The <i>underlying object</i> for implementing the <i>LIFO</i>
-         */
-        private container_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Copy Constructor.
-         */
-        constructor(stack: Stack<T>);
-        /**
-         * <p> Return size. </p>
-         *
-         * <p> Returns the number of elements in the {@link Stack}. </p>
-         *
-         * <p> This member function effectively calls member {@link ILinearContainer.size size()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return The number of elements in the {@link container_ underlying container}.
-         */
-        size(): number;
-        /**
-         * <p> Test whether container is empty. </p>
-         *
-         * <p> returns whether the {@link Stack} is empty: i.e. whether its <i>size</i> is zero. </p>
-         *
-         * <p> This member function effectively calls member {@link ILinearContainer.empty empty()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return <code>true</code> if the <i>underlying container</i>'s size is 0,
-         *		   <code>false</code> otherwise. </p>
-         */
-        empty(): boolean;
-        /**
-         * <p> Access next element. </p>
-         *
-         * <p> Returns a value of the top element in the {@link Stack} </p>.
-         *
-         * <p> Since {@link Stack}s are last-in first-out containers, the top element is the last element inserted into
-         * the {@link Stack}. </p>
-         *
-         * <p> This member function effectively calls member {@link ILinearContainer.back back()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A value of the top element in the {@link Stack}.
-         */
-        top(): T;
-        /**
-         * <p> Insert element. </p>
-         *
-         * <p> Inserts a new element at the top of the {@link Stack}, above its current top element. </p>
-         *
-         * <p> This member function effectively calls the member function
-         * {@link ILinearContainer.push_back push_back()} of the {@link container_ underlying container} object. </p>
-         *
-         * @param val Value to which the inserted element is initialized.
-         */
-        push(val: T): void;
-        /**
-         * <p> Remove top element. </p>
-         *
-         * <p> Removes the element on top of the {@link Stack}, effectively reducing its size by one. </p>
-         *
-         * <p> The element removed is the latest element inserted into the {@link Stack}, whose value can be retrieved
-         * by calling member {@link top Stack.top()} </p>.
-         *
-         * <p> This member function effectively calls the member function {@link ILinearContainer.pop_back pop_back()}
-         * of the {@link container_ underlying container} object. </p>
-         */
-        pop(): void;
-        /**
-         * <p> Swap contents. </p>
-         *
-         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
-         *
-         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
-         * the {@link container_ underlying containers}. </p>
-         *
-         * @param obj Another {@link Stack} container adaptor of the same type (i.e., instantiated with the same
-         *			  template parameter, <b>T</b>). Sizes may differ. </p>
-         */
-        swap(obj: Stack<T>): void;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> An abstract set. </p>
-     *
-     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
-     * individual elements based on their value. </p>
-     *
-     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
-     *
-     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
-     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
-     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    abstract class SetContainer<T> extends Container<T> {
-        /**
-         * Type definition of {@link SetContainer}'s {@link SetIterator iterator}.
-         */
-        static iterator: typeof SetIterator;
-        /**
-         * <p> {@link List} storing elements. </p>
-         *
-         * <p> Storing elements and keeping those sequence of the {@link SetContainer} are implemented by
-         * {@link data_ this list container}. Implementing index-table is also related with {@link data_ this list}
-         * by storing {@link ListIterator iterators} ({@link SetIterator} references {@link ListIterator}) who are
-         * created from {@link data_ here}. </p>
-         */
-        protected data_: List<T>;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from elements.
-         */
-        constructor(items: Array<T>);
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: IContainer<T>);
-        /**
-         * Construct from range iterators.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * @hidden
-         */
-        protected init(): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_container(container: IContainer<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_range<InputIterator extends Iterator<T>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: Iterator<U>, end: Iterator<U>): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * <p> Get iterator to element. </p>
-         *
-         * <p> Searches the container for an element with <i>key</i> as value and returns an iterator to it if found,
-         * otherwise it returns an iterator to {@link end end()} (the element past the end of the container). </p>
-         *
-         * <p> Another member function, {@link count count()}, can be used to just check whether a particular element
-         * exists. </p>
-         *
-         * @param key Key to be searched for.
-         *
-         * @return An iterator to the element, if the specified value is found, or {@link end end()} if it is not
-         *		   found in the
-         */
-        abstract find(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        begin(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        end(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rbegin(): SetReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rend(): SetReverseIterator<T>;
-        /**
-         * <p> Whether have the item or not. </p>
-         *
-         * <p> Indicates whether a set has an item having the specified identifier. </p>
-         *
-         * @param key Key value of the element whose mapped value is accessed.
-         *
-         * @return Whether the set has an item having the specified identifier.
-         */
-        has(val: T): boolean;
-        /**
-         * <p> Count elements with a specific key. </p>
-         *
-         * <p> Searches the container for elements with a value of k and returns the number of elements found. </p>
-         *
-         * @param key Value of the elements to be counted.
-         *
-         * @return The number of elements in the container with a <i>key</i>.
-         */
-        abstract count(val: T): number;
-        /**
-         * @inheritdoc
-         */
-        size(): number;
-        /**
-         * @inheritdoc
-         */
-        push<U extends T>(...args: U[]): number;
-        /**
-         * <p> Insert an element with hint. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
-         * number of elements inserted. </p>
-         *
-         * @param hint Hint for the position where the element can be inserted.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator pointing to either the newly inserted element or to the element that already had its
-         *		   same value in the {@link SetContainer}.
-         */
-        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * <p> Insert an element with hint. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
-         * number of elements inserted. </p>
-         *
-         * @param hint Hint for the position where the element can be inserted.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator pointing to either the newly inserted element or to the element that already had its
-         *		   same value in the {@link SetContainer}.
-         */
-        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
-        /**
-         * <p> Insert elements with a range of a  </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
-         * number of elements inserted. </p>
-         *
-         * @param begin An iterator specifying range of the begining element.
-         * @param end An iterator specifying range of the ending element.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @hidden
-         */
-        protected abstract insert_by_val(val: T): any;
-        /**
-         * @hidden
-         */
-        protected abstract insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected abstract insert_by_range<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * <p> Erase an element. </p>
-         * <p> Removes from the set container the elements whose value is <i>key</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * @param key Value of the elements to be erased.
-         *
-         * @return Number of elements erased.
-         */
-        erase(val: T): number;
-        /**
-         * @inheritdoc
-         */
-        erase(it: SetIterator<T>): SetIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         * <p> Removes from the set container a range of elements.. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         */
-        erase(begin: SetIterator<T>, end: SetIterator<T>): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        erase(it: SetReverseIterator<T>): SetReverseIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         * <p> Removes from the set container a range of elements.. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         */
-        erase(begin: SetReverseIterator<T>, end: SetReverseIterator<T>): SetReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        private erase_by_iterator(first, last?);
-        /**
-         * @hidden
-         */
-        private erase_by_val(val);
-        /**
-         * @hidden
-         */
-        private erase_by_range(begin, end);
-        /**
-         * <p> Abstract method handling insertions for indexing. </p>
-         *
-         * <p> This method, {@link handle_insert} is designed to register the <i>first to last</i> to somewhere storing
-         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
-         *
-         * <p> When {@link insert} is called, new elements will be inserted into the {@link data_ list container} and new
-         * {@link SetIterator iterators} <i>first to last</i>, pointing the inserted elements, will be created and the
-         * newly created iterators <i>first to last</i> will be shifted into this method {@link handle_insert} after the
-         * insertions. </p>
-         *
-         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
-         * will be registered into the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
-         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first</i> to <i>last</i> will be
-         * registered into the {@link HashSet.hash_buckets_ hash bucket}. </p>
-         *
-         * @param first An {@link SetIterator} to the initial position in a sequence.
-         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
-         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-         */
-        protected abstract handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * <p> Abstract method handling deletions for indexing. </p>
-         *
-         * <p> This method, {@link handle_insert} is designed to unregister the <i>first to last</i> to somewhere storing
-         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
-         *
-         * <p> When {@link erase} is called with <i>first to last</i>, {@link SetIterator iterators} positioning somewhere
-         * place to be deleted, is memorized and shifted to this method {@link handle_erase} after the deletion process is
-         * terminated. </p>
-         *
-         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
-         * will be unregistered from the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
-         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first to last</i> will be
-         * unregistered from the {@link HashSet.hash_buckets_ hash bucket}. </p>
-         *
-         * @param first An {@link SetIterator} to the initial position in a sequence.
-         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
-         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-         */
-        protected abstract handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
-    }
-}
-declare namespace std {
-    /**
-     * <p> An iterator of a Set. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class SetIterator<T> extends Iterator<T> implements IComparable<SetIterator<T>> {
-        private list_iterator_;
-        /**
-         * <p> Construct from source and index number. </p>
-         *
-         * <h4> Note </h4>
-         * <p> Do not create iterator directly. </p>
-         * <p> Use begin(), find() or end() in Map instead. </p>
-         *
-         * @param map The source Set to reference.
-         * @param index Sequence number of the element in the source Set.
-         */
-        constructor(source: base.SetContainer<T>, it: ListIterator<T>);
-        /**
-         * @inheritdoc
-         */
-        prev(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        next(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        advance(size: number): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        private set;
-        get_list_iterator(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        value: T;
-        /**
-         * @inheritdoc
-         */
-        equal_to<U extends T>(obj: SetIterator<U>): boolean;
-        /**
-         * @inheritdoc
-         */
-        less<U extends T>(obj: SetIterator<U>): boolean;
-        /**
-         * @inheritdoc
+    interface IComparable<T> extends Object {
+        /**
+         * <p> Indicates whether some other object is &quot;equal to&quot; this one. </p>
+         *
+         * <p> The {@link equal_to} method implements an equivalence relation on non-null object references: </p>
+         *
+         * <ul>
+         *	<li>
+         *		It is <b>reflexive</b>: for any non-null reference value <code>x</code>, <code>x.equal_to(x)</code>
+         *		should return <code>true</code>.
+         *	</li>
+         *	<li>
+         *		It is <b>symmetric</b>: for any non-null reference values <code>x</code> and <code>y</code>,
+         *		<code>x.equal_to(y)</code> should return <code>true</code> if and only if <code>y.equal_to(x)</code>
+         *		returns <code>true</code>. </li>
+         *	<li>
+         *		It is <b>transitive</b>: for any non-null reference values <code>x</code>, <code>y</code>, and
+         *		<code>z</code>, if <code>x.equal_to(y)</code> returns <code>true</code> and <code>y.equal_to(z)</code>
+         *		returns <code>true</code>, then <code>x.equal_to(z)</code> should return <code>true</code>.
+         *	</li>
+         *	<li>
+         *		It is <b>consistent</b>: for any non-null reference values <code>x</code> and <code>y</code>, multiple
+         *		invocations of <code>x.equal_to(y)</code> consistently return <code>true</code> or consistently return
+         *		<code>false</code>, provided no information used in equal_to comparisons on the objects is modified.
+         *	</li>
+         *	<li>
+         *		For any non-null reference value <code>x</code>, <code>x.equal_to(null)</code> should return
+         *		<code>false</code>.
+         *	</li>
+         * </ul>
+         *
+         * <p> The {@link equal_to} method for interface {@link IComparable} implements the most discriminating possible
+         * equivalence relation on objects; that is, for any non-null reference values <code>x</code> and
+         * <code>y</code>, this method returns <code>true</code> if and only if <code>x</code> and <code>y</code>
+         * refer to the same object (<code>x == y</code> has the value <code>true</code>). </p>
+         *
+         * <p> Note that it is generally necessary to override the {@link hash_code} method whenever this method is
+         * overridden, so as to maintain the general contract for the {@link hash_code} method, which states that
+         * equal objects must have equal hash codes. </p>
+         *
+         * <ul>
+         *	<li> {@link IComparable.equal_to} is called by {@link std.equal_to}. </li>
+         * </ul>
+         *
+         * @param obj the reference object with which to compare.
+         *
+         * @return <code>true</code> if this object is the same as the obj argument; <code>false</code> otherwise.
+         */
+        equal_to(obj: T): boolean;
+        /**
+         * <p> Less-than inequality comparison. </p>
+         *
+         * <p> Binary method returns whether the the instance compares less than the <i>obj</i>. </p>
+         *
+         * <ul>
+         *	<li>
+         *		{@link IComparable.less} is called by {@link std.less}. Also, this method can be used on standard
+         *		algorithms such as {@link sort sort()}</code>, {@link merge merge()} or
+         *		{@link TreeMap.lower_bound lower_bound()}.
+         *	</li>
+         * </ul>
+         *
+         * @param obj the reference object with which to compare.
+         *
+         * @return Whether the first parameter is less than the second.
+         */
+        less(obj: T): boolean;
+        /**
+         * <p> Issue a hash code. </p>
+         *
+         * <p> Returns a hash code value for the object. This method is supported for the benefit of hash tables such
+         * as those provided by hash containers; {@link HashSet}, {@link HashMap}, {@link MultiHashSet} and
+         * {@link MultiHashMap}. </p>
+         *
+         * <p> As much as is reasonably practical, the {@link hash_code} method defined by interface
+         * {@link IComparable} does return distinct integers for distinct objects. (This is typically implemented by
+         * converting the internal address of the object into an integer, but this implementation technique is not
+         * required by the JavaScript programming language.) </p>
+         *
+         * <ul>
+         *	<li>
+         *		{@link IComparable.hash_code} is called by {@link std.hash_code}. If you want to keep basically
+         *		provided hash function, then returns {@link std.Hash.code}; <code>return std.Hash.code(this);</code>
+         *	</li>
+         * </ul>
+         *
+         * @return An hash code who represents the object.
          */
         hash(): number;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: SetIterator<T>): void;
     }
     /**
-     * <p> A reverse-iterator of Set. </p>
+     * <p> Default hash function for number. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> Unary function that defines the default hash function used by the standard library. </p>
      *
-     * @param <T> Type of the elements.
+     * <p> The functional call returns a hash value of its argument: A hash value is a value that depends solely on
+     * its argument, returning always the same value for the same argument (for a given execution of a program). The
+     * value returned shall have a small likelihood of being the same as the one returned for a different argument.
+     * </p>
      *
-     * @author Jeongho Nam <http://samchon.org>
+     * @param val Value to be hashed.
+     *
+     * @return Returns a hash value for its argument, as a value of type number. The number is an unsigned integer.
      */
-    class SetReverseIterator<T> extends ReverseIterator<T, SetIterator<T>, SetReverseIterator<T>> {
-        constructor(base: SetIterator<T>);
-        /**
-         * @inheritdoc
-         */
-        protected create_neighbor(): SetReverseIterator<T>;
-    }
-}
-declare namespace std.base {
+    function hash(val: number): number;
     /**
-     * <p> An abstract set. </p>
+     * <p> Default hash function for string. </p>
      *
-     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
-     * individual elements based on their value. </p>
+     * <p> Unary function that defines the default hash function used by the standard library. </p>
      *
-     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to uniquely
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be modified
-     * once in the container - they can be inserted and removed, though. </p>
+     * <p> The functional call returns a hash value of its argument: A hash value is a value that depends solely on
+     * its argument, returning always the same value for the same argument (for a given execution of a program). The
+     * value returned shall have a small likelihood of being the same as the one returned for a different argument.
+     * </p>
      *
-     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
-     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
-     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     * @param str A string to be hashed.
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Unique keys </dt>
-     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
-     *
-     * @author Jeongho Nam <http://samchon.org>
+     * @return Returns a hash value for its argument, as a value of type number. The number is an unsigned integer.
      */
-    abstract class UniqueSet<T> extends SetContainer<T> {
-        /**
-         * @inheritdoc
-         */
-        count(key: T): number;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
-         * the number of element inserted (zero or one). </p>
-         *
-         * <p> Because elements in a {@link UniqueSet UniqueSets} are unique, the insertion operation checks whether
-         * each inserted element is equivalent to an element already in the container, and if so, the element is not
-         * inserted, returning an iterator to this existing element (if the function returns a value). </p>
-         *
-         * <p> For a similar container allowing for duplicate elements, see {@link MultiSet}. </p>
-         *
-         * @param key Value to be inserted as an element.
-         *
-         * @return A {@link Pair}, with its member {@link Pair.first} set to an iterator pointing to either the newly
-         *		   inserted element or to the equivalent element already in the {@link UniqueSet}. The
-         *		   {@link Pair.second} element in the {@link Pair} is set to true if a new element was inserted or
-         *		   false if an equivalent element already existed.
-         */
-        insert(val: T): Pair<SetIterator<T>, boolean>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: UniqueSet<T>): void;
-    }
-}
-declare namespace std.base {
+    function hash(str: string): number;
     /**
-     * <p> An abstract set. </p>
+     * <p> Default hash function for Object. </p>
      *
-     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
-     * individual elements based on their value. </p>
+     * <p> Unary function that defines the default hash function used by the standard library. </p>
      *
-     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
+     * <p> The functional call returns a hash value of its argument: A hash value is a value that depends solely on
+     * its argument, returning always the same value for the same argument (for a given execution of a program). The
+     * value returned shall have a small likelihood of being the same as the one returned for a different argument.
+     * </p>
      *
-     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
-     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
-     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     * <p> The default {@link hash} function of Object returns a value returned from {@link hash hash(number)} with
+     * an <b>unique id</b> of each Object. If you want to specify {@link hash} function of a specific class, then
+     * define a member function <code>public hash(): number</code> in the class. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * @param obj Object to be hashed.
      *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Multiple equivalent keys </dt>
-     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
-     *
-     * @author Jeongho Nam <http://samchon.org>
+     * @return Returns a hash value for its argument, as a value of type number. The number is an unsigned integer.
      */
-    abstract class MultiSet<T> extends SetContainer<T> {
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
-         * the number of elements inserted. </p>
-         *
-         * @param key Value to be inserted as an element.
-         *
-         * @return An iterator to the newly inserted element.
-         */
-        insert(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: MultiSet<T>): void;
-    }
+    function hash(obj: Object): number;
+    /**
+     * <p> Exchange contents of {@link IContainers containers}. </p>
+     *
+     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must have
+     * same type of elements (same template parameters), although sizes may differ. </p>
+     *
+     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i> before
+     * the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references and
+     * pointers remain valid for the swapped objects. </p>
+     *
+     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
+     * ownership over their assets to the other container (i.e., the containers exchange references to their data, without
+     * actually performing any element copy or movement): It behaves as if <i>left</i>.
+     * {@link IContainer.swap swap}(<i>right</i>) was called. </p>
+     *
+     * @param left A {@link IContainer container} to swap its contents.
+     * @param right A {@link IContainer container} to swap its contents.
+     */
+    function swap<T>(left: base.IContainer<T>, right: base.IContainer<T>): void;
+    /**
+     * <p> Exchange contents of queues. </p>
+     *
+     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
+     *
+     * @param left A {@link Queue} container of the same type. Size may differ.
+     * @param right A {@link Queue} container of the same type. Size may differ.
+     */
+    function swap<T>(left: Queue<T>, right: Queue<T>): void;
+    /**
+     * <p> Exchange contents of {@link PriorityQueue PriorityQueues}. </p>
+     *
+     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
+     *
+     * @param left A {@link PriorityQueue} container of the same type. Size may differ.
+     * @param right A {@link PriorityQueue} container of the same type. Size may differ.
+     */
+    function swap<T>(left: PriorityQueue<T>, right: PriorityQueue<T>): void;
+    /**
+     * <p> Exchange contents of {@link Stack Stacks}. </p>
+     *
+     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
+     *
+     * @param left A {@link Stack} container of the same type. Size may differ.
+     * @param right A {@link Stack} container of the same type. Size may differ.
+     */
+    function swap<T>(left: Stack<T>, right: Stack<T>): void;
+    /**
+     * <p> Exchanges the contents of two {@link UniqueMap unique maps}. </p>
+     *
+     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
+     * be of the same type (same template parameters), although sizes may differ. </p>
+     *
+     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
+     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
+     * and pointers remain valid for the swapped objects. </p>
+     *
+     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
+     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
+     * without actually performing any element copy or movement): It behaves as if
+     * <i>left</i>.{@link UniqueMap.swap swap}(<i>right</i>) was called. </p>
+     *
+     * @param left An {@link UniqueMap unique map} to swap its conents.
+     * @param right An {@link UniqueMap unique map} to swap its conents.
+     */
+    function swap<Key, T>(left: base.UniqueMap<Key, T>, right: base.UniqueMap<Key, T>): void;
+    /**
+     * <p> Exchanges the contents of two {@link MultiMap multi maps}. </p>
+     *
+     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
+     * be of the same type (same template parameters), although sizes may differ. </p>
+     *
+     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
+     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
+     * and pointers remain valid for the swapped objects. </p>
+     *
+     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
+     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
+     * without actually performing any element copy or movement): It behaves as if
+     * <i>left</i>.{@link MultiMap.swap swap}(<i>right</i>) was called. </p>
+     *
+     * @param left A {@link MultiMap multi map} to swap its conents.
+     * @param right A {@link MultiMap multi map} to swap its conents.
+     */
+    function swap<Key, T>(left: base.MultiMap<Key, T>, right: base.MultiMap<Key, T>): void;
 }
 declare namespace std {
     /**
-     * <p> Hashed, unordered set. </p>
+     * <p> Bind function arguments. </p>
      *
-     * <p> {@link HashSet}s are containers that store unique elements in no particular order, and which
-     * allow for fast retrieval of individual elements based on their value. </p>
+     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
      *
-     * <p> In an {@link HashSet}, the value of an element is at the same time its <i>key</i>, that
-     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link HashSet} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
+     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
+     * <ul>
+     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
+     *	<li>
+     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
+     *		call (the one whose order number is specified by the placeholder).
+     *	</li>
+     * </ul>
      *
-     * <p> Internally, the elements in the {@link HashSet} are not sorted in any particular order, but
-     * organized into buckets depending on their hash values to allow for fast access to individual elements
-     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
+     * <p> Calling the returned object returns the same type as fn. </p>
      *
-     * <p> {@link HashSet} containers are faster than {@link TreeSet} containers to access individual
-     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
-     * subset of their elements. </p>
+     * @param fn A function object, pointer to function or pointer to member.
+     * @param args List of arguments to bind: either values, or {@link placeholders}.
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Hashed </dt>
-     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
-     *		 by their <i>key</i>. </dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Unique keys </dt>
-     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements.
-     *			  Each element in an {@link HashSet} is also uniquely identified by this value.
-     *
-     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
-     * @author Jeongho Nam <http://samchon.org>
+     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
+     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
+     *		   is a member.
      */
-    class HashSet<T> extends base.UniqueSet<T> {
-        private hash_buckets_;
-        /**
-         * @hidden
-         */
-        protected init(): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_val(val: T): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.UniqueSet<T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_set(obj);
+    function bind<Ret>(fn: (...args: any[]) => Ret, ...args: any[]): (...args: any[]) => Ret;
+    /**
+     * <p> Bind function arguments. </p>
+     *
+     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
+     *
+     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
+     * <ul>
+     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
+     *	<li>
+     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
+     *		call (the one whose order number is specified by the placeholder).
+     *	</li>
+     * </ul>
+     *
+     * <p> Calling the returned object returns the same type as fn. </p>
+     *
+     * @param fn A function object, pointer to function or pointer to member.
+     * @param thisArg This argument, owner object of the member method <i>fn</i>.
+     * @param args List of arguments to bind: either values, or {@link placeholders}.
+     *
+     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
+     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
+     *		   is a member.
+     */
+    function bind<Ret, T>(fn: (...args: any[]) => Ret, thisArg: T, ...args: any[]): (...args: any[]) => Ret;
+}
+/**
+ * <p> Bind argument placeholders. </p>
+ *
+ * <p> This namespace declares an unspecified number of objects: <i>_1</i>, <i>_2</i>, <i>_3</i>, ...</i>, which are
+ * used to specify placeholders in calls to function {@link std.bind}. </p>
+ *
+ * <p> When the function object returned by bind is called, an argument with placeholder {@link _1} is replaced by the
+ * first argument in the call, {@link _2} is replaced by the second argument in the call, and so on... For example: </p>
+ *
+ * <code>
+ * let vec: Vector<number> = new Vector<number>();
+ *
+ * let bind = std.bind(Vector.insert, _1, vec.end(), _2, _3);
+ * bind.apply(vec, 5, 1); // vec.insert(vec.end(), 5, 1);
+ * // [1, 1, 1, 1, 1]
+ * </code>
+ *
+ * <p> When a call to {@link bind} is used as a subexpression in another call to <i>bind</i>, the {@link placeholders}
+ * are relative to the outermost {@link bind} expression. </p>
+ *
+ * @reference http://www.cplusplus.com/reference/functional/placeholders/
+ * @author Jeongho Nam <http://samchon.org>
+ */
+declare namespace std.placeholders {
+    /**
+     * @hidden
+     */
+    class PlaceHolder {
+        private index_;
+        constructor(index: number);
+        index: number;
     }
     /**
-     * <p> Hashed, unordered Multiset. </p>
-     *
-     * <p> {@link HashMultiSet HashMultiSets} are containers that store elements in no particular order, allowing fast
-     * retrieval of individual elements based on their value, much like {@link HashSet} containers,
-     * but allowing different elements to have equivalent values. </p>
-     *
-     * <p> In an {@link HashMultiSet}, the value of an element is at the same time its <i>key</i>, used to
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link HashMultiSet} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
-     *
-     * <p> Internally, the elements in the {@link HashMultiSet} are not sorted in any particular, but
-     * organized into <i>buckets</i> depending on their hash values to allow for fast access to individual
-     * elements directly by their <i>values</i> (with a constant average time complexity on average). </p>
-     *
-     * <p> Elements with equivalent values are grouped together in the same bucket and in such a way that an
-     * iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Hashed </dt>
-     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
-     *		 by their <i>key</i>. </dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Multiple equivalent keys </dt>
-     *	<dd> The container can hold multiple elements with equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements.
-     *		   Each element in an {@link UnorderedMultiSet} is also identified by this value..
-     *
-     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_multiset
-     * @author Jeongho Nam <http://samchon.org>
+     * Replaced by the first argument in the function call.
      */
-    class HashMultiSet<T> extends base.MultiSet<T> {
-        private hash_buckets_;
-        /**
-         * @hidden
-         */
-        protected init(): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        count(val: T): number;
-        /**
-         * @hidden
-         */
-        protected insert_by_val(val: T): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.MultiSet<T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_set(obj);
-    }
+    const _1: PlaceHolder;
+    /**
+     * Replaced by the second argument in the function call.
+     */
+    const _2: PlaceHolder;
+    /**
+     * Replaced by the third argument in the function call.
+     */
+    const _3: PlaceHolder;
+    const _4: PlaceHolder;
+    const _5: PlaceHolder;
+    const _6: PlaceHolder;
+    const _7: PlaceHolder;
+    const _8: PlaceHolder;
+    const _9: PlaceHolder;
+    const _10: PlaceHolder;
+    const _11: PlaceHolder;
+    const _12: PlaceHolder;
+    const _13: PlaceHolder;
+    const _14: PlaceHolder;
+    const _15: PlaceHolder;
+    const _16: PlaceHolder;
+    const _17: PlaceHolder;
+    const _18: PlaceHolder;
+    const _19: PlaceHolder;
+    const _20: PlaceHolder;
 }
 declare namespace std.base {
     /**
@@ -3950,6 +5202,246 @@ declare namespace std.base {
         swap(obj: MultiMap<Key, T>): void;
     }
 }
+declare namespace std.base {
+    /**
+     * <p> Common interface for hash map. </p>
+     *
+     * <p> {@link IHashMap}s are associative containers that store elements formed by the combination of
+     * a <i>key value</i> and a <i>mapped value</i>. </p>
+     *
+     * <p> In an {@link IHashMap}, the <i>key value</i> is generally used to uniquely identify the
+     * element, while the <i>mapped value</i> is an object with the content associated to this <i>key</i>.
+     * Types of <i>key</i> and <i>mapped value</i> may differ. </p>
+     *
+     * <p> Internally, the elements in the {@link IHashMap} are not sorted in any particular order with
+     * respect to either their <i>key</i> or <i>mapped values</i>, but organized into <i>buckets</i> depending on
+     * their hash values to allow for fast access to individual elements directly by their <i>key values</i>
+     * (with a constant average time complexity on average). </p>
+     *
+     * <p> Elements with equivalent <i>keys</i> are grouped together in the same bucket and in such a way that
+     * an iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the key values.
+     *				Each element in an {@link IHashMap} is identified by a key value.
+     * @param <T> Type of the mapped value.
+     *			  Each element in an {@link IHashMap} is used to store some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_map
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IHashMap<Key, T> {
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the {@link IHashMap}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * container, until invalidated. </p>
+         *
+         * @return An iterator to the first element in the container.
+         */
+        begin(): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashMap}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the first element in the bucket.
+         */
+        begin(index: number): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @return An iterator to the element past the end of the container.
+         */
+        end(): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the element past the end of the bucket.
+         */
+        end(index: number): MapIterator<Key, T>;
+        rbegin(): MapReverseIterator<Key, T>;
+        rbegin(index: number): MapReverseIterator<Key, T>;
+        rend(): MapReverseIterator<Key, T>;
+        rend(index: number): MapReverseIterator<Key, T>;
+        /**
+         * <p> Return number of buckets. </p>
+         *
+         * <p> Returns the number of buckets in the {@link IHashMap} container. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their key. </p>
+         *
+         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
+         * table (and thus the probability of collision). The container automatically increases the number of buckets to
+         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
+         * time the number of buckets needs to be increased. </p>
+         *
+         * @return The current amount of buckets.
+         */
+        bucket_count(): number;
+        /**
+         * <p> Return bucket size. </p>
+         *
+         * <p> Returns the number of elements in bucket <i>n</i>. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
+         * value of their key. </p>
+         *
+         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
+         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
+         * (which is the average bucket size) below its {@link max_load_factor}. </p>
+         *
+         * @param n Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return The number of elements in bucket <i>n</i>.
+         */
+        bucket_size(n: number): number;
+        /**
+         * <p> Get maximum load factor. </p>
+         *
+         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @return The current load factor.
+         */
+        max_load_factor(): number;
+        /**
+         * <p> Set maximum load factor. </p>
+         *
+         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @param z The new maximum load factor.
+         */
+        max_load_factor(z: number): void;
+        /**
+         * <p> Locate element's bucket. </p>
+         *
+         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
+         *
+         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
+         * {@link begin} and {@link end}. </p>
+         *
+         * @param key Key whose bucket is to be located.
+         */
+        bucket(key: Key): number;
+        /**
+         * <p> Request a capacity change. </p>
+         *
+         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
+         * least <i>n</i> elements. </p>
+         *
+         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
+         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
+         *
+         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
+         *
+         * @param n The number of elements requested as minimum capacity.
+         */
+        reserve(n: number): void;
+        /**
+         * <p> Set number of buckets. </p>
+         *
+         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
+         *
+         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
+         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
+         * greater than <i>n</i>. </p>
+         *
+         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
+         * function may have no effect on the {@link bucket_count bucket count} and may not force a
+         * {@link HashBuckets.rehash rehash}. </p>
+         *
+         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
+         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
+         * of iteration of elements within the container. </p>
+         *
+         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
+         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
+         *
+         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
+         * {@link reserve}, that expects the number of elements in the container as argument. </p>
+         *
+         * @param n The minimum number of buckets for the container hash table.
+         */
+        rehash(n: number): void;
+    }
+}
 declare namespace std {
     /**
      * <p> Hashed, unordered map. </p>
@@ -3998,7 +5490,7 @@ declare namespace std {
      * @reference http://www.cplusplus.com/reference/unordered_map/unordered_map
      * @author Jeongho Nam <http://samchon.org>
      */
-    class HashMap<Key, T> extends base.UniqueMap<Key, T> {
+    class HashMap<Key, T> extends base.UniqueMap<Key, T> implements base.IHashMap<Key, T> {
         private hash_buckets_;
         /**
          * @hidden
@@ -4016,6 +5508,66 @@ declare namespace std {
          * @inheritdoc
          */
         find(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        begin(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        begin(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(index: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
         /**
          * @hidden
          */
@@ -4045,6 +5597,8 @@ declare namespace std {
          */
         private swap_hash_map(obj);
     }
+}
+declare namespace std {
     /**
      * <p> Hashed, unordered Multimap. </p>
      *
@@ -4117,6 +5671,66 @@ declare namespace std {
          * @inheritdoc
          */
         count(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        begin(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        begin(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(n: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
         /**
          * @hidden
          */
@@ -4147,25 +5761,20 @@ declare namespace std {
         private swap_hash_multimap(obj);
     }
 }
-declare namespace std {
+declare namespace std.base {
     /**
-     * <p> Tree-structured set, <code>std::set</code> of STL. </p>
+     * <p> An abstract set. </p>
      *
-     * <p> {@link TreeSet}s are containers that store unique elements following a specific order. </p>
+     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
+     * individual elements based on their value. </p>
      *
-     * <p> In a {@link TreeSet}, the value of an element also identifies it (the value is itself the
-     * <i>key</i>, of type <i>T</i>), and each value must be unique. The value of the elements in a
-     * {@link TreeSet} cannot be modified once in the container (the elements are always const), but they
-     * can be inserted or removed from the  </p>
+     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
      *
-     * <p> Internally, the elements in a {@link TreeSet} are always sorted following a specific strict weak
-     * ordering criterion indicated by its internal comparison method (of {@link less}). </p>
-     *
-     * <p> {@link TreeSet} containers are generally slower than {@link HashSet} containers to access
-     * individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on their
-     * order. </p>
-     *
-     * <p> {@link TreeSet}s are typically implemented as binary search trees. </p>
+     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
+     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
+     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
      * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
      *
@@ -4177,10 +5786,371 @@ declare namespace std {
      *		position in the container.
      *	</dd>
      *
-     *	<dt> Ordered </dt>
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    abstract class SetContainer<T> extends Container<T> {
+        /**
+         * Type definition of {@link SetContainer}'s {@link SetIterator iterator}.
+         */
+        static iterator: typeof SetIterator;
+        /**
+         * <p> {@link List} storing elements. </p>
+         *
+         * <p> Storing elements and keeping those sequence of the {@link SetContainer} are implemented by
+         * {@link data_ this list container}. Implementing index-table is also related with {@link data_ this list}
+         * by storing {@link ListIterator iterators} ({@link SetIterator} references {@link ListIterator}) who are
+         * created from {@link data_ here}. </p>
+         */
+        protected data_: List<T>;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from elements.
+         */
+        constructor(items: Array<T>);
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: IContainer<T>);
+        /**
+         * Construct from range iterators.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @hidden
+         */
+        protected init(): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_array(items: Array<T>): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_container(container: IContainer<T>): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_range<InputIterator extends Iterator<T>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: Iterator<U>, end: Iterator<U>): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * <p> Get iterator to element. </p>
+         *
+         * <p> Searches the container for an element with <i>key</i> as value and returns an iterator to it if found,
+         * otherwise it returns an iterator to {@link end end()} (the element past the end of the container). </p>
+         *
+         * <p> Another member function, {@link count count()}, can be used to just check whether a particular element
+         * exists. </p>
+         *
+         * @param key Key to be searched for.
+         *
+         * @return An iterator to the element, if the specified value is found, or {@link end end()} if it is not
+         *		   found in the
+         */
+        abstract find(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        begin(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): SetReverseIterator<T>;
+        /**
+         * <p> Whether have the item or not. </p>
+         *
+         * <p> Indicates whether a set has an item having the specified identifier. </p>
+         *
+         * @param key Key value of the element whose mapped value is accessed.
+         *
+         * @return Whether the set has an item having the specified identifier.
+         */
+        has(val: T): boolean;
+        /**
+         * <p> Count elements with a specific key. </p>
+         *
+         * <p> Searches the container for elements with a value of k and returns the number of elements found. </p>
+         *
+         * @param key Value of the elements to be counted.
+         *
+         * @return The number of elements in the container with a <i>key</i>.
+         */
+        abstract count(val: T): number;
+        /**
+         * @inheritdoc
+         */
+        size(): number;
+        /**
+         * @inheritdoc
+         */
+        push<U extends T>(...args: U[]): number;
+        /**
+         * <p> Insert an element with hint. </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
+         * number of elements inserted. </p>
+         *
+         * @param hint Hint for the position where the element can be inserted.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator pointing to either the newly inserted element or to the element that already had its
+         *		   same value in the {@link SetContainer}.
+         */
+        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * <p> Insert an element with hint. </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
+         * number of elements inserted. </p>
+         *
+         * @param hint Hint for the position where the element can be inserted.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator pointing to either the newly inserted element or to the element that already had its
+         *		   same value in the {@link SetContainer}.
+         */
+        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
+        /**
+         * <p> Insert elements with a range of a  </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
+         * number of elements inserted. </p>
+         *
+         * @param begin An iterator specifying range of the begining element.
+         * @param end An iterator specifying range of the ending element.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @hidden
+         */
+        protected abstract insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
+        protected abstract insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected abstract insert_by_range<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * <p> Erase an element. </p>
+         * <p> Removes from the set container the elements whose value is <i>key</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * @param key Value of the elements to be erased.
+         *
+         * @return Number of elements erased.
+         */
+        erase(val: T): number;
+        /**
+         * @inheritdoc
+         */
+        erase(it: SetIterator<T>): SetIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         * <p> Removes from the set container a range of elements.. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         */
+        erase(begin: SetIterator<T>, end: SetIterator<T>): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        erase(it: SetReverseIterator<T>): SetReverseIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         * <p> Removes from the set container a range of elements.. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         */
+        erase(begin: SetReverseIterator<T>, end: SetReverseIterator<T>): SetReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        private erase_by_iterator(first, last?);
+        /**
+         * @hidden
+         */
+        private erase_by_val(val);
+        /**
+         * @hidden
+         */
+        private erase_by_range(begin, end);
+        /**
+         * <p> Abstract method handling insertions for indexing. </p>
+         *
+         * <p> This method, {@link handle_insert} is designed to register the <i>first to last</i> to somewhere storing
+         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
+         *
+         * <p> When {@link insert} is called, new elements will be inserted into the {@link data_ list container} and new
+         * {@link SetIterator iterators} <i>first to last</i>, pointing the inserted elements, will be created and the
+         * newly created iterators <i>first to last</i> will be shifted into this method {@link handle_insert} after the
+         * insertions. </p>
+         *
+         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
+         * will be registered into the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
+         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first</i> to <i>last</i> will be
+         * registered into the {@link HashSet.hash_buckets_ hash bucket}. </p>
+         *
+         * @param first An {@link SetIterator} to the initial position in a sequence.
+         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
+         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+         */
+        protected abstract handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * <p> Abstract method handling deletions for indexing. </p>
+         *
+         * <p> This method, {@link handle_insert} is designed to unregister the <i>first to last</i> to somewhere storing
+         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
+         *
+         * <p> When {@link erase} is called with <i>first to last</i>, {@link SetIterator iterators} positioning somewhere
+         * place to be deleted, is memorized and shifted to this method {@link handle_erase} after the deletion process is
+         * terminated. </p>
+         *
+         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
+         * will be unregistered from the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
+         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first to last</i> will be
+         * unregistered from the {@link HashSet.hash_buckets_ hash bucket}. </p>
+         *
+         * @param first An {@link SetIterator} to the initial position in a sequence.
+         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
+         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+         */
+        protected abstract handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> An iterator of a Set. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class SetIterator<T> extends Iterator<T> implements IComparable<SetIterator<T>> {
+        private list_iterator_;
+        /**
+         * <p> Construct from source and index number. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Do not create iterator directly. </p>
+         * <p> Use begin(), find() or end() in Map instead. </p>
+         *
+         * @param map The source Set to reference.
+         * @param index Sequence number of the element in the source Set.
+         */
+        constructor(source: base.SetContainer<T>, it: ListIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        prev(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        next(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        advance(size: number): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        private set;
+        get_list_iterator(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        value: T;
+        /**
+         * @inheritdoc
+         */
+        equal_to<U extends T>(obj: SetIterator<U>): boolean;
+        /**
+         * @inheritdoc
+         */
+        less<U extends T>(obj: SetIterator<U>): boolean;
+        /**
+         * @inheritdoc
+         */
+        hash(): number;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: SetIterator<T>): void;
+    }
+    /**
+     * <p> A reverse-iterator of Set. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class SetReverseIterator<T> extends ReverseIterator<T, SetIterator<T>, SetReverseIterator<T>> {
+        constructor(base: SetIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        protected create_neighbor(): SetReverseIterator<T>;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> An abstract set. </p>
+     *
+     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
+     * individual elements based on their value. </p>
+     *
+     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to uniquely
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be modified
+     * once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
+     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
+     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
      *	<dd>
-     *		The elements in the container follow a strict order at all times. All inserted elements are
-     *		given a position in this order.
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
      *	</dd>
      *
      *	<dt> Set </dt>
@@ -4190,66 +6160,412 @@ declare namespace std {
      *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
      * </dl>
      *
-     * @param <T> Type of the elements.
-     *			  Each element in an {@link TreeSet} is also uniquely identified by this value.
+     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
      *
-     * @reference http://www.cplusplus.com/reference/set/set
      * @author Jeongho Nam <http://samchon.org>
      */
-    class TreeSet<T> extends base.UniqueSet<T> {
+    abstract class UniqueSet<T> extends SetContainer<T> {
         /**
-         * <i>RB-Tree+</i> object for implemeting the {@link TreeSet}.
+         * @inheritdoc
          */
-        private tree_;
+        count(key: T): number;
         /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
+         * <p> Insert an element. </p>
          *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: T, right: T) => boolean);
-        /**
-         * Contruct from elements.
+         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
+         * the number of element inserted (zero or one). </p>
          *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<T>);
-        /**
-         * Contruct from elements with compare.
+         * <p> Because elements in a {@link UniqueSet UniqueSets} are unique, the insertion operation checks whether
+         * each inserted element is equivalent to an element already in the container, and if so, the element is not
+         * inserted, returning an iterator to this existing element (if the function returns a value). </p>
          *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: base.IContainer<T>);
-        /**
-         * Copy Constructor with compare.
+         * <p> For a similar container allowing for duplicate elements, see {@link MultiSet}. </p>
          *
-         * @param container A container to be copied.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.IContainer<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Range Constructor.
+         * @param key Value to be inserted as an element.
          *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
+         * @return A {@link Pair}, with its member {@link Pair.first} set to an iterator pointing to either the newly
+         *		   inserted element or to the equivalent element already in the {@link UniqueSet}. The
+         *		   {@link Pair.second} element in the {@link Pair} is set to true if a new element was inserted or
+         *		   false if an equivalent element already existed.
          */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
+        insert(val: T): Pair<SetIterator<T>, boolean>;
         /**
-         * Range Constructor with compare.
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
+         * @inheritdoc
          */
-        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: UniqueSet<T>): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> An abstract set. </p>
+     *
+     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
+     * individual elements based on their value. </p>
+     *
+     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
+     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
+     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Multiple equivalent keys </dt>
+     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    abstract class MultiSet<T> extends SetContainer<T> {
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
+         * the number of elements inserted. </p>
+         *
+         * @param key Value to be inserted as an element.
+         *
+         * @return An iterator to the newly inserted element.
+         */
+        insert(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: MultiSet<T>): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> A common interface for hash set. </p>
+     *
+     * <p> {@link IHashSet}s are containers that store unique elements in no particular order, and which
+     * allow for fast retrieval of individual elements based on their value. </p>
+     *
+     * <p> In an {@link IHashSet}, the value of an element is at the same time its <i>key</i>, that
+     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link IHashSet} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> Internally, the elements in the {@link IHashSet} are not sorted in any particular order, but
+     * organized into buckets depending on their hash values to allow for fast access to individual elements
+     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
+     *
+     * <p> {@link IHashSet} containers are faster than {@link TreeSet} containers to access individual
+     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
+     * subset of their elements. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *			  Each element in an {@link IHashSet} is also uniquely identified by this value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IHashSet<T> {
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the {@link IHashSet}. </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * container, until invalidated. </p>
+         *
+         * @return An iterator to the first element in the container.
+         */
+        begin(): SetIterator<T>;
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashSet}. </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the first element in the bucket.
+         */
+        begin(index: number): SetIterator<T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @return An iterator to the element past the end of the container.
+         */
+        end(): SetIterator<T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the element past the end of the bucket.
+         */
+        end(index: number): SetIterator<T>;
+        rbegin(): SetReverseIterator<T>;
+        rbegin(index: number): SetReverseIterator<T>;
+        rend(): SetReverseIterator<T>;
+        rend(index: number): SetReverseIterator<T>;
+        /**
+         * <p> Return number of buckets. </p>
+         *
+         * <p> Returns the number of buckets in the {@link IHashSet} container. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their key. </p>
+         *
+         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
+         * table (and thus the probability of collision). The container automatically increases the number of buckets to
+         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
+         * time the number of buckets needs to be increased. </p>
+         *
+         * @return The current amount of buckets.
+         */
+        bucket_count(): number;
+        /**
+         * <p> Return bucket size. </p>
+         *
+         * <p> Returns the number of elements in bucket <i>n</i>. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
+         * value of their key. </p>
+         *
+         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
+         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
+         * (which is the average bucket size) below its {@link max_load_factor}. </p>
+         *
+         * @param n Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return The number of elements in bucket <i>n</i>.
+         */
+        bucket_size(n: number): number;
+        /**
+         * <p> Get maximum load factor. </p>
+         *
+         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @return The current load factor.
+         */
+        max_load_factor(): number;
+        /**
+         * <p> Set maximum load factor. </p>
+         *
+         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @param z The new maximum load factor.
+         */
+        max_load_factor(z: number): void;
+        /**
+         * <p> Locate element's bucket. </p>
+         *
+         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
+         *
+         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
+         * {@link begin} and {@link end}. </p>
+         *
+         * @param key Key whose bucket is to be located.
+         */
+        bucket(key: T): number;
+        /**
+         * <p> Request a capacity change. </p>
+         *
+         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
+         * least <i>n</i> elements. </p>
+         *
+         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
+         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
+         *
+         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
+         *
+         * @param n The number of elements requested as minimum capacity.
+         */
+        reserve(n: number): void;
+        /**
+         * <p> Set number of buckets. </p>
+         *
+         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
+         *
+         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
+         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
+         * greater than <i>n</i>. </p>
+         *
+         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
+         * function may have no effect on the {@link bucket_count bucket count} and may not force a
+         * {@link HashBuckets.rehash rehash}. </p>
+         *
+         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
+         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
+         * of iteration of elements within the container. </p>
+         *
+         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
+         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
+         *
+         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
+         * {@link reserve}, that expects the number of elements in the container as argument. </p>
+         *
+         * @param n The minimum number of buckets for the container hash table.
+         */
+        rehash(n: number): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> Hashed, unordered set. </p>
+     *
+     * <p> {@link HashSet}s are containers that store unique elements in no particular order, and which
+     * allow for fast retrieval of individual elements based on their value. </p>
+     *
+     * <p> In an {@link HashSet}, the value of an element is at the same time its <i>key</i>, that
+     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link HashSet} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> Internally, the elements in the {@link HashSet} are not sorted in any particular order, but
+     * organized into buckets depending on their hash values to allow for fast access to individual elements
+     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
+     *
+     * <p> {@link HashSet} containers are faster than {@link TreeSet} containers to access individual
+     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
+     * subset of their elements. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Unique keys </dt>
+     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *			  Each element in an {@link HashSet} is also uniquely identified by this value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class HashSet<T> extends base.UniqueSet<T> {
+        private hash_buckets_;
+        /**
+         * @hidden
+         */
+        protected init(): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_array(items: Array<T>): void;
         /**
          * @inheritdoc
          */
@@ -4257,78 +6573,74 @@ declare namespace std {
         /**
          * @inheritdoc
          */
-        find(val: T): SetIterator<T>;
+        find(key: T): SetIterator<T>;
         /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is not considered to go
-         * before <i>val</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(element, val) would return false. </p>
-         *
-         * <p> If the {@link Set} class is instantiated with the default comparison type ({@link less}), the
-         * function returns an iterator to the first element that is not less than <i>val</i>. </p>
-         *
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound},
-         * except in the case that the {@link Set} contains an element equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns
-         * an iterator pointing to the next element. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is not considered to go before
-         *		   <i>val</i>, or {@link Set.end} if all elements are considered to go before <i>val</i>.
+         * @inheritdoc
          */
-        lower_bound(val: T): SetIterator<T>;
+        begin(): SetIterator<T>;
         /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is not considered to go
-         * after <i>val</i>. </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(element, val) would return true. </p>
-         *
-         * <p> If the {@link Set} class is instantiated with the default comparison type ({@link less}), the
-         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the {@link Set} contains an element equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns
-         * an iterator pointing to the next element. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is not considered to go before
-         *		   <i>val</i>, or {@link Set.end} if all elements are considered to go after <i>val</i>.
+         * @inheritdoc
          */
-        upper_bound(val: T): SetIterator<T>;
+        begin(index: number): SetIterator<T>;
         /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Because all elements in a {@link Set} container are unique, the range returned will contain a
-         * single element at most. </p>
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that is considered to go after <i>val</i> according to the container's
-         * internal comparison object (key_comp). </p>
-         *
-         * <p> Two elements of a {@link Set} are considered equivalent if the container's comparison object
-         * returns false reflexively (i.e., no matter the order in which the elements are passed as arguments).
-         * </p>
-         *
-         * @param val Value to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
+         * @inheritdoc
          */
-        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        end(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(n: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: T): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
         /**
          * @hidden
          */
         protected insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
         protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
         /**
          * @hidden
@@ -4351,60 +6663,1029 @@ declare namespace std {
          */
         private swap_tree_set(obj);
     }
+}
+declare namespace std {
     /**
-     * <p> Tree-structured multiple-key set. </p>
+     * <p> Hashed, unordered Multiset. </p>
      *
-     * <p> {@link TreeMultiSet TreeMultiSets} are containers that store elements following a specific order, and
-     * where multiple elements can have equivalent values. </p>
+     * <p> {@link HashMultiSet HashMultiSets} are containers that store elements in no particular order, allowing fast
+     * retrieval of individual elements based on their value, much like {@link HashSet} containers,
+     * but allowing different elements to have equivalent values. </p>
      *
-     * <p> In a {@link TreeMultiSet}, the value of an element also identifies it (the value is itself
-     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link TreeMultiSet} cannot
-     * be modified once in the container (the elements are always const), but they can be inserted or removed
-     * from the  </p>
+     * <p> In an {@link HashMultiSet}, the value of an element is at the same time its <i>key</i>, used to
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link HashMultiSet} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
      *
-     * <p> Internally, the elements in a {@link TreeMultiSet TreeMultiSets} are always sorted following a strict
-     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
+     * <p> Internally, the elements in the {@link HashMultiSet} are not sorted in any particular, but
+     * organized into <i>buckets</i> depending on their hash values to allow for fast access to individual
+     * elements directly by their <i>values</i> (with a constant average time complexity on average). </p>
      *
-     * <p> {@link TreeMultiSet} containers are generally slower than {@link HashMultiSet} containers
-     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
-     * their order. </p>
-     *
-     * <p> {@link TreeMultiSet TreeMultiSets} are typically implemented as binary search trees. </p>
+     * <p> Elements with equivalent values are grouped together in the same bucket and in such a way that an
+     * iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
      *
      * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
      *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
      *
-     *	<dt> Ordered </dt>
-     *	<dd>
-     *		The elements in the container follow a strict order at all times. All inserted elements are
-     *		given a position in this order.
-     *	</dd>
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
      *
      *	<dt> Set </dt>
      *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
      *
      *	<dt> Multiple equivalent keys </dt>
-     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     *	<dd> The container can hold multiple elements with equivalent <i>keys</i>. </dd>
      * </dl>
      *
-     * @param <T> Type of the elements. Each element in a {@link TreeMultiSet} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
+     * @param <T> Type of the elements.
+     *		   Each element in an {@link UnorderedMultiSet} is also identified by this value..
      *
-     * @reference http://www.cplusplus.com/reference/set/multiset
+     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_multiset
      * @author Jeongho Nam <http://samchon.org>
      */
-    class TreeMultiSet<T> extends base.MultiSet<T> {
+    class HashMultiSet<T> extends base.MultiSet<T> {
+        private hash_buckets_;
         /**
-         * <i>RB-Tree+</i> object for implemeting the {@link TreeMultiSet}.
+         * @hidden
          */
-        private tree_;
+        protected init(): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_array(items: Array<T>): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(key: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        count(key: T): number;
+        /**
+         * @inheritdoc
+         */
+        begin(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        begin(index: number): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(n: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: T): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
+        /**
+         * @hidden
+         */
+        protected insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.MultiSet<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_set(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Doubly linked list. </p>
+     *
+     * <p> {@link List}s are sequence containers that allow constant time insert and erase operations anywhere within the
+     * sequence, and iteration in both directions. </p>
+     *
+     * <p> List containers are implemented as doubly-linked lists; Doubly linked lists can store each of the elements they
+     * contain in different and unrelated storage locations. The ordering is kept internally by the association to each
+     * element of a link to the element preceding it and a link to the element following it. </p>
+     *
+     * <p> They are very similar to forward_list: The main difference being that forward_list objects are single-linked
+     * lists, and thus they can only be iterated forwards, in exchange for being somewhat smaller and more efficient. </p>
+     *
+     * <p> Compared to other base standard sequence containers (array, vector and deque), lists perform generally better
+     * in inserting, extracting and moving elements in any position within the container for which an iterator has already
+     * been obtained, and therefore also in algorithms that make intensive use of these, like sorting algorithms. </p>
+     *
+     * <p> The main drawback of lists and forward_lists compared to these other sequence containers is that they lack
+     * direct access to the elements by their position; For example, to access the sixth element in a list, one has to
+     * iterate from a known position (like the beginning or the end) to that position, which takes linear time in the
+     * distance between these. They also consume some extra memory to keep the linking information associated to each
+     * element (which may be an important factor for large lists of small-sized elements). </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     * 	<dt> Sequence </dt>
+     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are accessed by
+     *		 their position in this sequence. </dd>
+     *
+     * 	<dt> Doubly-linked list </dt>
+     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing constant time
+     *		 insert and erase operations before or after a specific element (even of entire ranges), but no direct random
+     *		 access. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @reference http://www.cplusplus.com/reference/list/list/
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class List<T> extends base.Container<T> implements base.IDequeContainer<T> {
+        /**
+         * An iterator of beginning.
+         */
+        protected begin_: ListIterator<T>;
+        /**
+         * An iterator of end.
+         */
+        protected end_: ListIterator<T>;
+        /**
+         * Number of elements in the {@link List}.
+         */
+        protected size_: number;
+        /**
+         * <p> Default Constructor. </p>
+         *
+         * <p> Constructs an empty container, with no elements. </p>
+         */
+        constructor();
+        /**
+         * <p> Initializer list Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
+         *
+         * @param array An array containing elements to be copied and contained.
+         */
+        constructor(items: Array<T>);
+        /**
+         * <p> Fill Constructor. </p>
+         *
+         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
+         *
+         * @param n Initial container size (i.e., the number of elements in the container at construction).
+         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
+         *			  initialized to a copy of this value.
+         */
+        constructor(size: number, val: T);
+        /**
+         * <p> Copy Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
+         *
+         * @param container Another container object of the same type (with the same class template
+         *					arguments <i>T</i>), whose contents are either copied or acquired.
+         */
+        constructor(container: base.IContainer<T>);
+        /**
+         * <p> Range Constructor. </p>
+         *
+         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
+         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @inheritdoc
+         */
+        assign(n: number, val: T): void;
+        /**
+         * @inheritdoc
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        begin(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): ListReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): ListReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        size(): number;
+        /**
+         * @inheritdoc
+         */
+        front(): T;
+        /**
+         * @inheritdoc
+         */
+        back(): T;
+        /**
+         * @inheritdoc
+         */
+        push<U extends T>(...items: U[]): number;
+        /**
+         * @inheritdoc
+         */
+        push_front(val: T): void;
+        /**
+         * @inheritdoc
+         */
+        push_back(val: T): void;
+        /**
+         * @inheritdoc
+         */
+        pop_front(): void;
+        /**
+         * @inheritdoc
+         */
+        pop_back(): void;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new element is inserted.
+         *				   {@link iterator}> is a member type, defined as a
+         *				   {@link ListIterator bidirectional iterator} type that points to elements.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the newly inserted element; <i>val</i>.
+         */
+        insert(position: ListIterator<T>, val: T): ListIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param size Number of elements to insert.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param begin An iterator specifying range of the begining element.
+         * @param end An iterator specifying range of the ending element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new element is inserted.
+         *				   {@link iterator}> is a member type, defined as a
+         *				   {@link ListReverseIterator bidirectional iterator} type that points to elements.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the newly inserted element; <i>val</i>.
+         */
+        insert(position: ListReverseIterator<T>, val: T): ListReverseIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param size Number of elements to insert.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: ListReverseIterator<T>, size: number, val: T): ListReverseIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param begin An iterator specifying range of the begining element.
+         * @param end An iterator specifying range of the ending element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: ListReverseIterator<T>, begin: InputIterator, end: InputIterator): ListReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        private insert_by_val(position, val);
+        /**
+         * @hidden
+         */
+        protected insert_by_repeating_val(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
+        /**
+         * <p> Erase an element. </p>
+         *
+         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link List}.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
+         */
+        erase(position: ListIterator<T>): ListIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         *
+         * <p> Removes from the {@link List} container a range of elements. </p>
+         *
+         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
+         */
+        erase(begin: ListIterator<T>, end: ListIterator<T>): ListIterator<T>;
+        /**
+         * <p> Erase an element. </p>
+         *
+         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link List}.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
+         */
+        erase(position: ListReverseIterator<T>): ListReverseIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         *
+         * <p> Removes from the {@link List} container a range of elements. </p>
+         *
+         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
+         */
+        erase(begin: ListReverseIterator<T>, end: ListReverseIterator<T>): ListReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        protected erase_by_range(first: ListIterator<T>, last: ListIterator<T>): ListIterator<T>;
+        /**
+         * <p> Remove duplicate values. </p>
+         *
+         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
+         *
+         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
+         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
+         */
+        unique(): void;
+        /**
+         * <p> Remove duplicate values. </p>
+         *
+         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
+         *
+         * <p> The argument <i>binary_pred</i> is a specific comparison function that determine the <u>uniqueness</u>
+         * of an element. In fact, any behavior can be implemented (and not only an equality comparison), but notice
+         * that the function will call <code>binary_pred(it.value, it.prev().value)</code> for all pairs of elements
+         * (where <code>it</code> is an iterator to an element, starting from the second) and remove <code>it</code>
+         * from the {@link List} if the predicate returns <code>true</code>.
+         *
+         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
+         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
+         *
+         * @param binary_pred Binary predicate that, taking two values of the same type than those contained in the
+         *					  {@link List}, returns <code>true</code> to remove the element passed as first argument
+         *					  from the container, and <code>false</code> otherwise. This shall be a function pointer
+         *					  or a function object.
+         */
+        unique(binary_pred: (left: T, right: T) => boolean): void;
+        /**
+         * <p> Remove elements with specific value. </p>
+         *
+         * <p> Removes from the container all the elements that compare equal to <i>val</i>. This calls the
+         * destructor of these objects and reduces the container {@link size} by the number of elements removed. </p>
+         *
+         * <p> Unlike member function {@link List.erase}, which erases elements by their position (using an
+         * iterator), this function ({@link List.remove}) removes elements by their value. </p>
+         *
+         * <p> A similar function, {@link List.remove_if}, exists, which allows for a condition other than an
+         * equality comparison to determine whether an element is removed. </p>
+         *
+         * @param val Value of the elements to be removed.
+         */
+        remove(val: T): void;
+        /**
+         * <p> Remove elements fulfilling condition. </p>
+         *
+         * <p> Removes from the container all the elements for which <i>pred</i> returns <code>true</code>. This
+         * calls the destructor of these objects and reduces the container {@link size} by the number of elements
+         * removed. </p>
+         *
+         * <p> The function calls <code>pred(it.value)</code> for each element (where <code>it</code> is an iterator
+         * to that element). Any of the elements in the list for which this returns <code>true</code>, are removed
+         * from the  </p>
+         *
+         * @param pred Unary predicate that, taking a value of the same type as those contained in the forward_list
+         *			   object, returns <code>true</code> for those values to be removed from the container, and
+         *			   <code>false</code> for those remaining. This can either be a function pointer or a function
+         *			   object.
+         */
+        remove_if(pred: (val: T) => boolean): void;
+        /**
+         * <p> Merge sorted {@link List Lists}. </p>
+         *
+         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
+         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
+         * </p>
+         *
+         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
+         * them into their ordered position within container (which expands in {@link size} by the number of elements
+         * transferred). The operation is performed without constructing nor destroying any element: they are
+         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
+         * move-construction or not. </p>
+         *
+         * <p> This function requires that the {@link List} containers have their elements already ordered by value
+         * ({@link less}) before the call. For an alternative on unordered {@link List Lists}, see
+         * {@link List.splice}. </p>
+         *
+         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
+         * value according to the strict weak ordering defined by {@link less}. The resulting order of equivalent
+         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
+         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
+         *
+         * The function does nothing if <code>this == obj</code>.
+         *
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
+         *			  passed.
+         */
+        merge<U extends T>(obj: List<U>): void;
+        /**
+         * <p> Merge sorted {@link List Lists}. </p>
+         *
+         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
+         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
+         * </p>
+         *
+         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
+         * them into their ordered position within container (which expands in {@link size} by the number of elements
+         * transferred). The operation is performed without constructing nor destroying any element: they are
+         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
+         * move-construction or not. </p>
+         *
+         * <p> The argument <i>compare</i> is a specific predicate to perform the comparison operation between
+         * elements. This comparison shall produce a strict weak ordering of the elements (i.e., a consistent
+         * transitive comparison, without considering its reflexiveness).
+         *
+         * <p> This function requires that the {@link List} containers have their elements already ordered by
+         * <i>compare</i> before the call. For an alternative on unordered {@link List Lists}, see
+         * {@link List.splice}. </p>
+         *
+         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
+         * value according to the strict weak ordering defined by <i>compare</i>. The resulting order of equivalent
+         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
+         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
+         *
+         * The function does nothing if <code>this == obj</code>.
+         *
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
+         *			  passed.
+         * @param compare Binary predicate that, taking two values of the same type than those contained in the
+         *				  {@link list}, returns <code>true</code> if the first argument is considered to go before
+         *				  the second in the strict weak ordering it defines, and <code>false</code> otherwise.
+         *				  This shall be a function pointer or a function object.
+         */
+        merge<U extends T>(obj: List<U>, compare: (left: T, right: T) => boolean): void;
+        /**
+         * <p> Transfer elements from {@link List} to {@link List}. </p>
+         *
+         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
+         *
+         * <p> This effectively inserts all elements into the container and removes them from <i>obj</i>, altering
+         * the sizes of both containers. The operation does not involve the construction or destruction of any
+         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
+         * value_type supports move-construction or not. </p>
+         *
+         * <p> This first version (1) transfers all the elements of <i>obj</i> into the  </p>
+         *
+         * @param position Position within the container where the elements of <i>obj</i> are inserted.
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         */
+        splice<U extends T>(position: ListIterator<T>, obj: List<U>): void;
+        /**
+         * <p> Transfer an element from {@link List} to {@link List}. </p>
+         *
+         * <p> Transfers an element from <i>obj</i>, which is pointed by an {@link ListIterator iterator} <i>it</i>,
+         * into the container, inserting the element at specified <i>position</i>. </p>
+         *
+         * <p> This effectively inserts an element into the container and removes it from <i>obj</i>, altering the
+         * sizes of both containers. The operation does not involve the construction or destruction of any element.
+         * They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type
+         * supports move-construction or not. </p>
+         *
+         * <p> This second version (2) transfers only the element pointed by <i>it</i> from <i>obj</i> into the
+         *  </p>
+         *
+         * @param position Position within the container where the element of <i>obj</i> is inserted.
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
+         *			  being spliced.
+         * @param it {@link ListIterator Iterator} to an element in <i>obj</i>. Only this single element is
+         *			 transferred.
+         */
+        splice<U extends T>(position: ListIterator<T>, obj: List<U>, it: ListIterator<U>): void;
+        /**
+         * <p> Transfer elements from {@link List} to {@link List}. </p>
+         *
+         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
+         *
+         * <p> This effectively inserts those elements into the container and removes them from <i>obj</i>, altering
+         * the sizes of both containers. The operation does not involve the construction or destruction of any
+         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
+         * value_type supports move-construction or not. </p>
+         *
+         * <p> This third version (3) transfers the range [<i>begin</i>, <i>end</i>) from <i>obj</i> into the
+         *  </p>
+         *
+         * @param position Position within the container where the elements of <i>obj</i> are inserted.
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
+         *			  being spliced.
+         * @param begin {@link ListIterator An Iterator} specifying initial position of a range of elements in
+         *				<i>obj</i>. Transfers the elements in the range [<b><i>begin</i></b>, <i>end</i>) to
+         *				<i>position</i>.
+         * @param end {@link ListIterator An Iterator} specifying final position of a range of elements in
+         *			  <i>obj</i>. Transfers the elements in the range [<i>begin</i>, <b><i>end</i></b>) to
+         *			  <i>position</i>. Notice that the range includes all the elements between <i>begin<i/> and
+         *			  <i>end</i>, including the element pointed by <i>begin</i> but not the one pointed by <i>end</i>.
+         */
+        splice<U extends T>(position: ListIterator<T>, obj: List<U>, begin: ListIterator<U>, end: ListIterator<U>): void;
+        /**
+         * <p> Sort elements in  </p>
+         *
+         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
+         *
+         * <p> The sorting is performed by applying an algorithm that uses {@link less}. This comparison shall
+         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
+         * considering its reflexiveness). </p>
+         *
+         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
+         * order they had before the call. </p>
+         *
+         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
+         * Elements are moved within the  </p>
+         */
+        sort(): void;
+        /**
+         * <p> Sort elements in  </p>
+         *
+         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
+         *
+         * <p> The sorting is performed by applying an algorithm that uses <i>compare</i>. This comparison shall
+         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
+         * considering its reflexiveness). </p>
+         *
+         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
+         * order they had before the call. </p>
+         *
+         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
+         * Elements are moved within the  </p>
+         *
+         * @param compare Binary predicate that, taking two values of the same type of those contained in the
+         *				  {@link List}, returns <code>true</code> if the first argument goes before the second
+         *				  argument in the strict weak ordering it defines, and <code>false</code> otherwise. This
+         *				  shall be a function pointer or a function object.
+         */
+        sort(compare: (left: T, right: T) => boolean): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.IContainer<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_list(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> An iterator, node of a List. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class ListIterator<T> extends Iterator<T> {
+        private prev_;
+        private next_;
+        private value_;
+        /**
+         * <p> Construct from the source {@link List container}. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Do not create the iterator directly, by yourself. </p>
+         * <p> Use {@link List.begin begin()}, {@link List.end end()} in {@link List container} instead. </p>
+         *
+         * @param source The source {@link List container} to reference.
+         * @param prev A refenrece of previous node ({@link ListIterator iterator}).
+         * @param next A refenrece of next node ({@link ListIterator iterator}).
+         * @param value Value to be stored in the node (iterator).
+         */
+        constructor(source: List<T>, prev: ListIterator<T>, next: ListIterator<T>, value: T);
+        /**
+         * @inheritdoc
+         */
+        set_prev(it: ListIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        set_next(next: ListIterator<T>): void;
+        private list();
+        /**
+         * @inheritdoc
+         */
+        prev(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        next(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        advance(step: number): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        value: T;
+        /**
+         * @inheritdoc
+         */
+        equal_to(obj: ListIterator<T>): boolean;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: ListIterator<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> A reverse-iterator of List. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class ListReverseIterator<T> extends ReverseIterator<T, ListIterator<T>, ListReverseIterator<T>> {
+        constructor(base: ListIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        protected create_neighbor(): ListReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        value: T;
+    }
+}
+declare namespace std {
+    /**
+     * <p> FIFO queue. </p>
+     *
+     * <p> {@link Queue}s are a type of container adaptor, specifically designed to operate in a FIFO context
+     * (first-in first-out), where elements are inserted into one end of the container and extracted from the other.
+     * </p>
+     *
+     * <p> {@link Queue}s are implemented as containers adaptors, which are classes that use an encapsulated object of
+     * a specific container class as its underlying container, providing a specific set of member functions to access
+     * its elements. Elements are pushed into the {@link IDeque.back back()} of the specific container and popped from
+     * its {@link IDeque.front front()}. </p>
+     *
+     * <p> {@link container_ The underlying container} may be one of the standard container class template or some
+     * other specifically designed container class. This underlying container shall support at least the following
+     * operations: </p>
+     *
+     * <ul>
+     *	<li> empty </li>
+     *	<li> size </li>
+     *	<li> front </li>
+     *	<li> back </li>
+     *	<li> push_back </li>
+     *	<li> pop_front </li>
+     * </ul>
+     *
+     * <p> The standard container classes {@link Deque} and {@link List} fulfill these requirements.
+     * By default, if no container class is specified for a particular {@link Queue} class instantiation, the standard
+     * container {@link List} is used. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of elements.
+     *
+     * @reference http://www.cplusplus.com/reference/queue/queue
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class Queue<T> {
+        /**
+         * The <i>underlying object</i> for implementing the <i>FIFO</i>
+         */
+        private container_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: Queue<T>);
+        /**
+         * <p> Return size. </p>
+         * <p> Returns the number of elements in the {@link Queue}. </p>
+         *
+         * <p> This member function effectively calls member {@link IDeque.size size()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return The number of elements in the {@link container_ underlying container}.
+         */
+        size(): number;
+        /**
+         * <p> Test whether container is empty. </p>
+         * <p> returns whether the {@link Queue} is empty: i.e. whether its <i>size</i> is zero. </p>
+         *
+         * <p> This member function efeectively calls member {@link IDeque.empty empty()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return <code>true</code> if the {@link container_ underlying container}'s size is 0,
+         *		   <code>false</code> otherwise. </p>
+         */
+        empty(): boolean;
+        /**
+         * <p> Access next element. </p>
+         * <p> Returns a value of the next element in the {@link Queue}. </p>
+         *
+         * <p> The next element is the "oldest" element in the {@link Queue} and the same element that is popped out
+         * from the queue when {@link pop Queue.pop()} is called. </p>
+         *
+         * <p> This member function effectively calls member {@link IDeque.front front()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A value of the next element in the {@link Queue}.
+         */
+        front(): T;
+        /**
+         * <p> Access last element. </p>
+         *
+         * <p> Returns a vaue of the last element in the queue. This is the "newest" element in the queue (i.e. the
+         * last element pushed into the queue). </p>
+         *
+         * <p> This member function effectively calls the member function {@link IDeque.back back()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A value of the last element in the {@link Queue}.
+         */
+        back(): T;
+        /**
+         * <p> Insert element. </p>
+         *
+         * <p> Inserts a new element at the end of the {@link Queue}, after its current last element.
+         * The content of this new element is initialized to <i>val</i>. </p>
+         *
+         * <p> This member function effectively calls the member function {@link IDeque.push_back push_back()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @param val Value to which the inserted element is initialized.
+         */
+        push(val: T): void;
+        /**
+         * <p> Remove next element. </p>
+         *
+         * <p> Removes the next element in the {@link Queue}, effectively reducing its size by one. </p>
+         *
+         * <p> The element removed is the "oldest" element in the {@link Queue} whose value can be retrieved by calling
+         * member {@link front Queue.front()} </p>.
+         *
+         * <p> This member function effectively calls the member function {@link IDeque.pop_front pop_front()} of the
+         * {@link container_ underlying container} object. </p>
+         */
+        pop(): void;
+        /**
+         * <p> Swap contents. </p>
+         *
+         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
+         *
+         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
+         * the {@link container_ underlying containers}. </p>
+         *
+         * @param obj Another {@link Queue} container adaptor of the same type (i.e., instantiated with the same
+         *			  template parameter, <b>T</b>). Sizes may differ. </p>
+         */
+        swap(obj: Queue<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> Priority queue. </p>
+     *
+     * <p> {@link PriorityQueue Priority queues} are a type of container adaptors, specifically designed such that its
+     * first element is always the greatest of the elements it contains, according to some <i>strict weak ordering</i>
+     * criterion. </p>
+     *
+     * <p> This context is similar to a <i>heap</i>, where elements can be inserted at any moment, and only the
+     * <i>max heap</i> element can be retrieved (the one at the top in the {@link PriorityQueue priority queue}). </p>
+     *
+     * <p> {@link PriorityQueue Priority queues} are implemented as <i>container adaptors</i>, which are classes that
+     * use an encapsulated object of a specific container class as its {@link container_ underlying container},
+     * providing a specific set of member functions to access its elements. Elements are popped from the <i>"back"</i>
+     * of the specific container, which is known as the <i>top</i> of the {@link PriorityQueue Priority queue}. </p>
+     *
+     * <p> The {@link container_ underlying container} may be any of the standard container class templates or some
+     * other specifically designed container class. The container shall be accessible through
+     * {@link IArrayIterator random access iterators} and support the following operations: </p>
+     *
+     * <ul>
+     *	<li> empty() </li>
+     *	<li> size() </li>
+     *	<li> front() </li>
+     *	<li> push_back() </li>
+     *	<li> pop_back() </li>
+     * </ul>
+     *
+     * <p> The standard container classes {@link Vector} and {@link Deque} fulfill these requirements. By default, if
+     * no container class is specified for a particular {@link PriorityQueue} class instantiation, the standard
+     * container {@link Vector} is used. </p>
+     *
+     * <p> Support of {@link IArrayIterator random access iterators} is required to keep a heap structure internally
+     * at all times. This is done automatically by the container adaptor by automatically calling the algorithm
+     * functions <i>make_heap</i>, <i>push_heap</i> and <i>pop_heap</i> when needed. </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @reference http://www.cplusplus.com/reference/queue/priority_queue/
+     * @author Jeongho Nam
+     */
+    class PriorityQueue<T> {
+        /**
+         * <p> The <i>underlying container</i> for implementing the <i>priority queue</i>. </p>
+         *
+         * <p> Following standard definition from the C++ committee, the <i>underlying container</i> should be one of
+         * {@link Vector} or {@link Deque}, however, I've adopted {@link TreeMultiSet} instead of them. Of course,
+         * there are proper reasons for adapting the {@link TreeMultiSet} even violating standard advice. </p>
+         *
+         * <p> <i>Underlying container</i> of {@link PriorityQueue} must keep a condition; the highest (or lowest)
+         * element must be placed on the terminal node for fast retrieval and deletion. To keep the condition with
+         * {@link Vector} or {@link Deque}, lots of times will only be spent for re-arranging elements. It calls
+         * rearrangement functions like <i>make_heap</i>, <i>push_heap</i> and <i>pop_head</i> for rearrangement. </p>
+         *
+         * <p> However, the {@link TreeMultiSet} container always keeps arrangment automatically without additional
+         * operations and it even meets full criteria of {@link PriorityQueue}. Those are the reason why I've adopted
+         * {@link TreeMultiSet} as the <i>underlying container</i> of {@link PriorityQueue}. </p>
+         */
+        private container_;
         /**
          * Default Constructor.
          */
@@ -4447,7 +7728,7 @@ declare namespace std {
          */
         constructor(begin: Iterator<T>, end: Iterator<T>);
         /**
-         * Construct from range and compare.
+         * Range Constructor with compare.
          *
          * @param begin Input interator of the initial position in a sequence.
          * @param end Input interator of the final position in a sequence.
@@ -4455,3621 +7736,215 @@ declare namespace std {
          */
         constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
         /**
-         * @inheritdoc
+         * @hidden
          */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        count(val: T): number;
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is not considered to
-         * go before <i>val</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(element,val) would return false. </p>
-         *
-         * <p> If the {@link TreeMultiSet} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element that is not less than <i>val</i>. </p>
-
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link TreeMultiSet} contains elements equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is not considered to go before
-         *		   <i>val</i>, or {@link TreeMultiSet.end} if all elements are considered to go before <i>val</i>.
-         */
-        lower_bound(val: T): SetIterator<T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is considered to go after
-         * <i>val</i>. </p>
-
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(val,element) would return true. </p>
-
-         * <p> If the {@code TreeMultiSet} class is instantiated with the default comparison type (less), the
-         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the {@TreeMultiSet} contains elements equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is considered to go after
-         *		   <i>val</i>, or {@link TreeMultiSet.end} if no elements are considered to go after <i>val</i>.
-         */
-        upper_bound(val: T): SetIterator<T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container that are equivalent
-         * to <i>val</i>. </p>
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that is considered to go after val according to the container's
-         * internal comparison object (key_comp). </p>
-         *
-         * <p> Two elements of a multiset are considered equivalent if the container's comparison object returns
-         * false reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
-         *
-         * @param key Value to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        protected construct_from_array(items: Array<T>): void;
         /**
          * @hidden
          */
-        protected insert_by_val(val: T): any;
+        protected construct_from_container(container: base.IContainer<T>): void;
         /**
          * @hidden
          */
-        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        protected construct_from_range(begin: Iterator<T>, end: Iterator<T>): void;
         /**
-         * @hidden
+         * <p> Return size. </p>
+         *
+         * <p> Returns the number of elements in the {@link PriorityQueue}. </p>
+         *
+         * <p> This member function effectively calls member {@link IArray.size size} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return The number of elements in the underlying
          */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        size(): number;
         /**
-         * @inheritdoc
+         * <p> Test whether container is empty. </p>
+         *
+         * <p> Returns whether the {@link PriorityQueue} is empty: i.e. whether its {@link size} is zero. </p>
+         *
+         * <p> This member function effectively calls member {@link IARray.empty empty} of the
+         * {@link container_ underlying container} object. </p>
          */
-        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        empty(): boolean;
         /**
-         * @inheritdoc
+         * <p> Access top element. </p>
+         *
+         * <p> Returns a constant reference to the top element in the {@link PriorityQueue}. </p>
+         *
+         * <p> The top element is the element that compares higher in the {@link PriorityQueue}, and the next that is
+         * removed from the container when {@link PriorityQueue.pop} is called. </p>
+         *
+         * <p> This member function effectively calls member {@link IArray.front front} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A reference to the top element in the {@link PriorityQueue}.
          */
-        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        top(): T;
         /**
-         * @inheritdoc
+         * <p> Insert element. </p>
+         *
+         * <p> Inserts a new element in the {@link PriorityQueue}. The content of this new element is initialized to
+         * <i>val</i>.
+         *
+         * <p> This member function effectively calls the member function {@link IArray.push_back push_back} of the
+         * {@link container_ underlying container} object, and then reorders it to its location in the heap by calling
+         * the <i>push_heap</i> algorithm on the range that includes all the elements of the  </p>
+         *
+         * @param val Value to which the inserted element is initialized.
          */
-        swap(obj: base.MultiSet<T>): void;
+        push(val: T): void;
         /**
-         * @hidden
+         * <p> Remove top element. </p>
+         *
+         * <p> Removes the element on top of the {@link PriorityQueue}, effectively reducing its {@link size} by one.
+         * The element removed is the one with the highest (or lowest) value. </p>
+         *
+         * <p> The value of this element can be retrieved before being popped by calling member
+         * {@link PriorityQueue.top}. </p>
+         *
+         * <p> This member function effectively calls the <i>pop_heap</i> algorithm to keep the heap property of
+         * {@link PriorityQueue PriorityQueues} and then calls the member function {@link IArray.pop_back pop_back} of
+         * the {@link container_ underlying container} object to remove the element. </p>
          */
-        private swap_tree_set(obj);
+        pop(): void;
+        /**
+         * <p> Swap contents. </p>
+         *
+         * <p> Exchanges the contents of the container adaptor by those of <i>obj</i>, swapping both the
+         * {@link container_ underlying container} value and their comparison function using the corresponding
+         * {@link std.swap swap} non-member functions (unqualified). </p>
+         *
+         * <p> This member function has a <i>noexcept</i> specifier that matches the combined <i>noexcept</i> of the
+         * {@link IArray.swap swap} operations on the {@link container_ underlying container} and the comparison
+         * functions. </p>
+         *
+         * @param obj {@link PriorityQueue} container adaptor of the same type (i.e., instantiated with the same
+         *			  template parameters, <b>T</b>). Sizes may differ.
+         */
+        swap(obj: PriorityQueue<T>): void;
     }
 }
 declare namespace std {
     /**
-     * <p> Tree-structured map, <code>std::map</code> of STL. </p>
+     * <p> LIFO stack. </p>
      *
-     * <p> {@link TreeMap TreeMaps} are associative containers that store elements formed by a combination of a
-     * <i>key value</i> (<i>Key</i>) and a <i>mapped value</i> (<i>T</i>), following order. </p>
+     * <p> {@link Stack}s are a type of container adaptor, specifically designed to operate in a LIFO context
+     * (last-in first-out), where elements are inserted and extracted only from one end of the  </p>
      *
-     * <p> In a {@link TreeMap}, the <i>key values</i> are generally used to sort and uniquely identify the elements,
-     * while the <i>mapped values</i> store the content associated to this key. The types of <i>key</i> and
-     * <i>mapped value</i> may differ, and are grouped together in member type <i>value_type</i>, which is a {@link Pair}
-     * type combining both: </p>
+     * <p> {@link Stack}s are implemented as containers adaptors, which are classes that use an encapsulated object of
+     * a specific container class as its <i>underlying container</i>, providing a specific set of member functions to
+     * access its elements. Elements are pushed/popped from the {@link ILinearContainer.back back()} of the
+     * {@link ILinearContainer specific container}, which is known as the top of the {@link Stack}. </p>
      *
-     * <p> <code>typedef Pair<Key, T> value_type;</code> </p>
+     * <p> {@link container_ The underlying container} may be any of the standard container class templates or some
+     * other specifically designed container class. The container shall support the following operations: </p>
      *
-     * <p> Internally, the elements in a {@link TreeMap} are always sorted by its <i>key</i> following a
-     * <i>strict weak ordering</i> criterion indicated by its internal comparison method {@link less}.
-     *
-     * <p> {@link TreeMap} containers are generally slower than {@link HashMap HashMap} containers to access individual
-     * elements by their <i>key</i>, but they allow the direct iteration on subsets based on their order. </p>
-     *
-     * <p> {@link TreeMap}s are typically implemented as binary search trees. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Ordered </dt>
-     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
-     *		 given a position in this order. </dd>
-     *
-     *	<dt> Map </dt>
-     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
-     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
-     *
-     *	<dt> Unique keys </dt>
-     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
-     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
-     *
-     * @reference http://www.cplusplus.com/reference/map/map
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeMap<Key, T> extends base.UniqueMap<Key, T> {
-        /**
-         * <i>RB-Tree+</i> object for implemeting the {@link TreeMap}.
-         */
-        private tree_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
-         *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<Pair<Key, T>>);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         */
-        constructor(array: Array<[Key, T]>);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         */
-        constructor(container: base.MapContainer<Key, T>);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
-         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
-         *
-         * <p> If the {@link TreeMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link TreeMap} contains an element with a key equivalent to <i>k</i>: In this
-         * case, {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound}
-         * returns an iterator pointing to the next element. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is not considered to go before
-         *		   <i>k</i>, or {@link TreeMap.end} if all keys are considered to go before <i>k</i>.
-         */
-        lower_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
-         * go after <i>k</i> </p>.
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
-         *
-         * <p> If the {@link TreeMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the map contains an element with a key equivalent to <i>k</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns an
-         * iterator pointing to the next element. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is considered to go after
-         *		   <i>k</i>, or {@link TreeMap.end} if no keys are considered to go after <i>k</i>.
-         */
-        upper_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
-         * equivalent to <i>k</i> </p>.
-         *
-         * <p> Because the elements in a {@link TreeMap} container have unique keys, the range returned will
-         * contain a single element at most. </p>
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that has a key considered to go after <i>k</i> according to the container's internal
-         * comparison object (key_comp). </p>
-         *
-         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
-         * (i.e., no matter the order in which the keys are passed as arguments). </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
-        /**
-         * @hidden
-         */
-        protected insert_by_pair(pair: Pair<Key, T>): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.UniqueMap<Key, T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_map(obj);
-    }
-    /**
-     * <p> Tree-structured multiple-key map. </p>
-     *
-     * <p> {@link TreeMultiMap TreeMultiMaps} are associative containers that store elements formed by a combination of
-     * a <i>key value</i> and a <i>mapped value</i>, following a specific order, and where multiple elements can
-     * have equivalent keys. </p>
-     *
-     * <p> In a {@link TreeMultiMap}, the <i>key values</i> are generally used to sort and uniquely identify
-     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
-     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
-     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
-     *
-     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
-     *
-     * <p> Internally, the elements in a {@link TreeMultiMap}are always sorted by its key following a
-     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
-     *
-     * <p> {@link TreeMultiMap}containers are generally slower than {@link HashMap} containers
-     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
-     * on their order. </p>
-     *
-     * <p> {@link TreeMultiMap TreeMultiMaps} are typically implemented as binary search trees. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Ordered </dt>
-     *	<dd>
-     *		The elements in the container follow a strict order at all times. All inserted elements are
-     *		given a position in this order.
-     *	</dd>
-     *
-     *	<dt> Map </dt>
-     *	<dd>
-     *		Each element associates a <i>key</i> to a <i>mapped value</i>:
-     *		<i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>.
-     *	</dd>
-     *
-     *	<dt> Multiple equivalent keys </dt>
-     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
-     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
-     *
-     * @reference http://www.cplusplus.com/reference/map/multimap
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeMultiMap<Key, T> extends base.MultiMap<Key, T> {
-        private tree_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
-         *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<Pair<Key, T>>);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         */
-        constructor(array: Array<[Key, T]>);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         */
-        constructor(container: base.MapContainer<Key, T>);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(key: Key): MapIterator<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        count(key: Key): number;
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
-         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
-         *
-         * <p> If the {@link TreeMultiMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link TreeMultiMap} contains an element with keys equivalent to <i>k</i>:
-         * In this case, {@link lower_bound} returns an iterator pointing to the first of such elements,
-         * whereas {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is not considered to go before
-         *		   <i>k</i>, or {@link TreeMultiMap.end} if all keys are considered to go before <i>k</i>.
-         */
-        lower_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
-         * go after <i>k</i> </p>.
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
-         *
-         * <p> If the {@link TreeMultiMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the {@link TreeMultiMap} contains an element with keys equivalent to <i>k</i>:
-         * In this case {@link lower_bound} returns an iterator pointing to first of such element, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is considered to go after
-         *		   <i>k</i>, or {@link TreeMultiMap.end} if no keys are considered to go after <i>k</i>.
-         */
-        upper_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
-         * equivalent to <i>k</i> </p>.
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that has a key considered to go after <i>k</i> according to the container's internal
-         * comparison object (key_comp). </p>
-         *
-         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
-         * (i.e., no matter the order in which the keys are passed as arguments). </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
-        /**
-         * @hidden
-         */
-        protected insert_by_pair(pair: Pair<Key, T>): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.MultiMap<Key, T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_multimap(obj);
-    }
-}
-declare namespace std {
-    /**
-     * <p> Apply function to range. </p>
-     *
-     * <p> Applies function <i>fn</i> to each of the elements in the range [<i>first</i>, <i>last</i>). </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param fn Unary function that accepts an element in the range as argument. This can either be a function p
-     *			 ointer or a move constructible function object. Its return value, if any, is ignored.
-     *
-     * @return Returns <i>fn</i>.
-     */
-    function for_each<T, InputIterator extends Iterator<T>, Func extends (val: T) => any>(first: InputIterator, last: InputIterator, fn: Func): Func;
-    /**
-     * <p> Test condition on all elements in range. </p>
-     *
-     * <p> Returns <code>true</code> if <i>pred</i> returns <code>true</code> for all the elements in the range
-     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
-     * </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
-     *			   checked by this function. The function shall not modify its argument.
-     *
-     * @return <code>true</code> if pred returns true for all the elements in the range or if the range is
-     *		   {@link IContainer.empty empty}, and <code>false</code> otherwise.
-     */
-    function all_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
-    /**
-     * <p> Test if any element in range fulfills condition. </p>
-     *
-     * <p> Returns <code>true</code> if <i>pred</i> returns true for any of the elements in the range
-     * [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. </p>
-     *
-     * <p> If [<i>first</i>, <i>last</i>) is an {@link IContainer.empty empty} range, the function returns
-     * <code>false</code>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
-     *			   checked by this function. The function shall not modify its argument.
-     *
-     * @return <code>true</code> if <i>pred</i> returns <code>true</code> for any of the elements in the range
-     *		   [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. If [<i>first</i>, <i>last</i>) is an
-     *		   {@link IContainer.empty empty} range, the function returns <code>false</code>.
-     */
-    function any_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
-    /**
-     * <p> Test if no elements fulfill condition. </p>
-     *
-     * <p> Returns <code>true</code> if <i>pred</i> returns false for all the elements in the range
-     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
-     * </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
-     *			   checked by this function. The function shall not modify its argument.
-     *
-     * @return <code>true</code> if <i>pred</i> returns <code>false</code> for all the elements in the range
-     *		   [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code>
-     *		   otherwise.
-     */
-    function none_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
-    /**
-     * <p> Test whether the elements in two ranges are equal. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
-     */
-    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>): boolean;
-    /**
-     * <p> Test whether the elements in two ranges are equal. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *			   the elements are considered to match in the context of this function.
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
-     */
-    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>, pred: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Test whether range is permutation of another. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
-     * order. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
-     */
-    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): boolean;
-    /**
-     * <p> Test whether range is permutation of another. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
-     * order. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *			   the elements are considered to match in the context of this function.
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
-     */
-    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, pred: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Lexicographical less-than comparison. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically less</i>
-     * than the range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
-     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
-     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
-     * elements is the result of the lexicographical comparison. </p>
-     *
-     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically less</i>
-     * than the longer one. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence.
-     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
-     *				[<i>first2</i>, <i>last2</i>).
-     *
-     * @return <code>true</code> if the first range compares <i>lexicographically less</i> than than the second.
-     *		   <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
-     */
-    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): boolean;
-    /**
-     * <p> Lexicographical comparison. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically
-     * relationship</i> than the range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
-     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
-     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
-     * elements is the result of the lexicographical comparison. </p>
-     *
-     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically
-     * relationship</i> than the longer one. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence.
-     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a
-     *		  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *		  considered to go before the second in the specific <i>strict weak ordering</i> it defines.
-     *
-     * @return <code>true</code> if the first range compares <i>lexicographically relationship</i> than than the
-     *		   second. <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
-     */
-    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Find value in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) that compares equal to
-     * <i>val</i>. If no such element is found, the function returns <i>last</i>. </p>
-     *
-     * <p> The function uses {@link equal_to equal_to} to compare the individual elements to <i>val</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value to search for in the range.
-     *
-     * @return An {@link Iterator} to the first element in the range that compares equal to <i>val</i>. If no elements
-     *		   match, the function returns <i>last</i>.
-     */
-    function find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
-    /**
-     * <p> Find element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
-     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
-     *			   the context of this function. The function shall not modify its argument.
-     *
-     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> does not return
-     *		   <code>false</code>. If <i>pred</i> is <code>false</code> for all elements, the function returns
-     *		   <i>last</i>.
-     */
-    function find_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
-    /**
-     * <p> Find element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
-     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
-     *			   the context of this function. The function shall not modify its argument.
-     *
-     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> returns <code>false</code>.
-     *		   If <i>pred</i> is <code>true</code> for all elements, the function returns <i>last</i>.
-     */
-    function find_if_not<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
-    /**
-     * <p> Find last subsequence in range. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
-     * occurrences are found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
-     * {@link search}. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
-     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *			   whether the elements are considered to match in the context of this function.
-     *
-     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
-     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
-     */
-    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
-    /**
-     * <p> Find last subsequence in range. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
-     * occurrences are found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
-     * {@link search}. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
-     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *			   whether the elements are considered to match in the context of this function.
-     *
-     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
-     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
-     */
-    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
-    /**
-     * <p> Find element from set in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
-     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
-     *
-     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
-     * [<i>first2</i>, <i>last2</i>) using {@link equal_to}, until a pair matches. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     *
-     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
-     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
-     */
-    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
-    /**
-     * <p> Find element from set in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
-     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
-     *
-     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
-     * [<i>first2</i>, <i>last2</i>) using <i>pred</i>, until a pair matches. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
-     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *			   whether the elements are considered to match in the context of this function.
-     *
-     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
-     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
-     */
-    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
-    /**
-     * <p> Find equal adjacent elements in range. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
-     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
-     *
-     * <p> Two elements match if they compare equal using {@link equal_to}. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
-     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
-     */
-    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
-    /**
-     * <p> Find equal adjacent elements in range. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
-     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
-     *
-     * <p> Two elements match if they compare equal using <i>pred</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is considered a match in the
-     *			   context of this function. The function shall not modify its argument.
-     *
-     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
-     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
-     */
-    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T, y: T) => boolean): InputIterator;
-    /**
-     * <p> Search range for subsequence. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
-     * found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
-     * {@link find_end}. </p>
-     *
-     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
-     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
-     *				used is [<i>first2</i>, <i>last2</i>).
-     *
-     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in <i>first1</i>
-     *		   and <i>last1</i>. If the sequence is not found, the function returns <i>last1</i>. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
-     */
-    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2): ForwardIterator1;
-    /**
-     * <p> Search range for subsequence. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
-     * found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
-     * {@link find_end}. </p>
-     *
-     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
-     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
-     *				used is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to bool. The returned value indicates whether the elements are
-     *			   considered to match in the context of this function. The function shall not modify any of its
-     *			   arguments.
-     *
-     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in
-     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns last1. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
-     */
-    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2, pred: (x: T, y: T) => boolean): ForwardIterator1;
-    /**
-     * <p> Search range for elements. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
-     * <i>val</i>. </p>
-     *
-     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
-     * </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param count Minimum number of successive elements to match.
-     * @param val Individual value to be compared, or to be used as argument for {@link equal_to}.
-     *
-     * @return An iterator to the first element of the sequence. If no such sequence is found, the function returns
-     *		   <i>last</i>.
-     */
-    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T): ForwardIterator;
-    /**
-     * <p> Search range for elements. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
-     * <i>val</i>. </p>
-     *
-     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
-     * </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param count Minimum number of successive elements to match.
-     * @param val Individual value to be compared, or to be used as argument for <i>pred</i>.
-     * @param pred Binary function that accepts two arguments (one element from the sequence as first, and <i>val</i> as
-     *			   second), and returns a value convertible to <code>bool</code>. The value returned indicates whether the
-     *			   element is considered a match in the context of this function. The function shall not modify any of its
-     *			   arguments.
-     *
-     * @return An {@link Iterator} to the first element of the sequence. If no such sequence is found, the function
-     *		   returns <i>last</i>.
-     */
-    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T, pred: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return first position where two ranges differ. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
-     *
-     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
-     * does not match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     *
-     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
-     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
-     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
-     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
-     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
-     */
-    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): Pair<Iterator1, Iterator2>;
-    /**
-     * <p> Return first position where two ranges differ. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
-     *
-     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
-     * does not match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *			   the elements are considered to match in the context of this function.
-     *
-     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
-     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
-     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
-     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
-     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
-     */
-    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, compare: (x: T, y: T) => boolean): Pair<Iterator1, Iterator2>;
-    /**
-     * <p> Count appearances of value in range. </p>
-     *
-     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>. </p>
-     *
-     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value to match.
-     *
-     * @return The number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>.
-     */
-    function count<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): number;
-    /**
-     * <p> Return number of elements in range satisfying condition. </p>
-     *
-     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) for which pred is <code>true</code>.
-     * </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether the element is counted by this function.
-     *			   The function shall not modify its argument. This can either be a function pointer or a function
-     *			   object.
-     */
-    function count_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): number;
-    /**
-     * <p> Copy range of elements. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) into the range beginning at <i>result</i>. </p>
-     *
-     * <p> The function returns an iterator to the end of the destination range (which points to the element following the
-     * last element copied). </p>
-     *
-     * <p> The ranges shall not overlap in such a way that result points to an element in the range
-     * [<i>first</i>, <i>last</i>). For such cases, see {@link copy_backward}. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
-     *				 point to any element in the range [<i>first</i>, <i>last</i>).
-     *
-     * @return An iterator to the end of the destination range where elements have been copied.
-     */
-    function copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Copy elements. </p>
-     *
-     * <p> Copies the first <i>n</i> elements from the range beginning at <i>first</i> into the range beginning at
-     * <i>result</i>. </p>
-     *
-     * <p> The function returns an iterator to the end of the destination range (which points to one past the last element
-     * copied). </p>
-     *
-     * <p> If <i>n</i> is negative, the function does nothing. </p>
-     *
-     * <p> If the ranges overlap, some of the elements in the range pointed by result may have undefined but valid values.
-     * </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence of at least <i>n</i> elements to
-     *				be copied. <i>InputIterator</i> shall point to a type assignable to the elements pointed by
-     *				<i>OutputIterator</i>.
-     * @param n Number of elements to copy. If this value is negative, the function does nothing.
-     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence of at least
-     *				 <i>n</i> elements. This shall not point to any element in the range [<i>first</i>, last].
-     *
-     * @return An iterator to the end of the destination range where elements have been copied.
-     */
-    function copy_n<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, n: number, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Copy certain elements of range. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which pred returns <code>true</code> to the
-     * range beginning at <i>result</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
-     *				 point to any element in the range [<i>first</i>, <i>last</i>).
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be copied (if
-     *			   <code>true</code>, it is copied). The function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the destination range where elements have been copied.
-     */
-    function copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T) => boolean): OutputIterator;
-    /**
-     * <p> Copy range of elements backward. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) starting from the end into the range terminating
-     * at <i>result</i>. </p>
-     *
-     * <p> The function returns an iterator to the first element in the destination range. </p>
-     *
-     * <p> The resulting range has the elements in the exact same order as [<i>first</i>, <i>last</i>). To reverse their
-     * order, see {@link reverse_copy}. </p>
-     *
-     * <p> The function begins by copying <code>*(last-1)</code> into <code>*(result-1)</code>, and then follows backward
-     * by the elements preceding these, until <i>first</i> is reached (and including it). </p>
-     *
-     * <p> The ranges shall not overlap in such a way that <i>result</i> (which is the <i>past-the-end element</i> in the
-     * destination range) points to an element in the range (first,last]. For such cases, see {@link copy}. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Bidirectional iterator} to the initial position in the destination sequence. This
-     *				 shall not point to any element in the range [<i>first</i>, <i>last</i>).
-     *
-     * @return An iterator to the first element of the destination sequence where elements have been copied.
-     */
-    function copy_backward<T, BidirectionalIterator1 extends Iterator<T>, BidirectionalIterator2 extends Iterator<T>>(first: BidirectionalIterator1, last: BidirectionalIterator1, result: BidirectionalIterator2): BidirectionalIterator2;
-    /**
-     * <p> Fill range with value. </p>
-     *
-     * <p> Assigns val to all the elements in the range [<i>first</i>, <i>last</i>). </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence of elements that support being
-     *				assigned a value of type <i>T</i>.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence of elements that support being
-     *				assigned a value of type <i>T</i>.. The range filled is [<i>first</i>, <i>last</i>), which contains
-     *				all the elements between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i>
-     *				but not the element pointed by <i>last</i>.
-     * @param val Value to assign to the elements in the filled range.
-     */
-    function fill<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): void;
-    /**
-     * <p> Fill sequence with value. </p>
-     *
-     * <p> Assigns <i>val</i> to the first <i>n</i> elements of the sequence pointed by <i>first</i>. </p>
-     *
-     * @param first {@link Iterator Output iterator} to the initial position in a sequence of elements that support being
-     *				assigned a value of type <i>T</i>.
-     * @param n Number of elements to fill. If negative, the function does nothing.
-     * @param val Value to be used to fill the range.
-     *
-     * @return An iterator pointing to the element that follows the last element filled.
-     */
-    function fill_n<T, OutputIterator extends Iterator<T>>(first: OutputIterator, n: number, val: T): OutputIterator;
-    /**
-     * <p> Transform range. </p>
-     *
-     * <p> Applies <i>op</i> to each of the elements in the range [<i>first</i>, <i>last</i>) and stores the value returned
-     * by each operation in the range that begins at <i>result</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be transformed.
-     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be transformed. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
-     *				 stored. The range includes as many elements as [<i>first</i>, <i>last</i>).
-     * @param op Unary function that accepts one element of the type pointed to by <i>InputIterator</i> as argument, and
-     *			 returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
-     */
-    function transform<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, op: (val: T) => T): OutputIterator;
-    /**
-     * <p> Transform range. </p>
-     *
-     * <p> Calls <i>binary_op</i> using each of the elements in the range [<i>first1</i>, <i>last1</i>) as first argument,
-     * and the respective argument in the range that begins at <i>first2</i> as second argument. The value returned by
-     * each call is stored in the range that begins at <i>result</i>. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second range. The range includes as
-     *				 many elements as [<i>first1</i>, <i>last1</i>).
-     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
-     *				 stored. The range includes as many elements as [<i>first1</i>, <i>last1</i>).
-     * @param binary_op Binary function that accepts two elements as argument (one of each of the two sequences), and
-     *					returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
-     */
-    function transform<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, result: OutputIterator, binary_op: (x: T, y: T) => T): OutputIterator;
-    /**
-     * <p> Generate values for range with function. </p>
-     *
-     * <p> Assigns the value returned by successive calls to gen to the elements in the range [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range affected is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
-     *			  those pointed by the iterators.
-     */
-    function generate<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, gen: () => T): void;
-    /**
-     * <p> Generate values for sequence with function. </p>
-     *
-     * <p> Assigns the value returned by successive calls to <i>gen</i> to the first <i>n</i> elements of the sequence
-     * pointed by <i>first</i>. </p>
-     *
-     * @param first {@link Iterator Output iterator} to the initial position in a sequence of at least <i>n</i> elements
-     *				that support being assigned a value of the type returned by <i>gen</i>.
-     * @param n Number of values to generate. If negative, the function does nothing.
-     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
-     *			  those pointed by the iterators.
-     *
-     * @return An iterator pointing to the element that follows the last element whose value has been generated.
-     */
-    function generate_n<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, n: number, gen: () => T): ForwardIterator;
-    /**
-     * <p> Remove consecutive duplicates in range. </p>
-     *
-     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
-     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
-     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
-     * the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
-     * iterator and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
-     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
-     */
-    function unique<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
-    /**
-     * <p> Remove consecutive duplicates in range. </p>
-     *
-     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
-     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
-     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
-     * the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
-     * iterator and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether both arguments are considered equivalent
-     *			  (if <code>true</code>, they are equivalent and one of them is removed). The function shall not modify
-     *			  any of its arguments.
-     *
-     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
-     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
-     */
-    function unique<t, InputIterator extends Iterator<t>>(first: InputIterator, last: InputIterator, pred: (left: t, right: t) => boolean): InputIterator;
-    /**
-     * <p> Copy range removing duplicates. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * consecutive duplicates (elements that compare equal to the element preceding). </p>
-     *
-     * <p> Only the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>) is copied. </p>
-     *
-     * <p> The comparison between elements is performed by applying {@lnk equal_to}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
-     *				 The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     *
-     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
-     */
-    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Copy range removing duplicates. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * consecutive duplicates (elements that compare equal to the element preceding). </p>
-     *
-     * <p> Only the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>) is copied. </p>
-     *
-     * <p> The comparison between elements is performed by applying <i>pred</i>. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
-     *				 The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether both arguments are considered equivalent (if
-     *			   <code>true</code>, they are equivalent and one of them is removed). The function shall not modify any
-     *			   of its arguments.
-     *
-     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
-     */
-    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Remove value from range. </p>
-     *
-     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements that compare equal to
-     * <i>val</i> removed, and returns an iterator to the new last of that range. </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot alter
-     * the size of an array or a container): The removal is done by replacing the elements that compare equal to
-     * <i>val</i> by the next element that does not, and signaling the new size of the shortened range by returning an
-     * iterator to the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned iterator
-     * and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value to be removed.
-     */
-    function remove<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
-    /**
-     * <p> Remove elements from range. </p>
-     *
-     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements for which pred returns
-     * <code>true</code> removed, and returns an iterator to the new last of that range. </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
-     * alter the size of an array or a container): The removal is done by replacing the elements for which pred returns
-     * <code>true</code> by the next element for which it does not, and signaling the new size of the shortened range
-     * by returning an iterator to the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
-     * iterator and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be removed (if
-     *			   <code>true</code>, it is removed). The function shall not modify its argument.
-     */
-    function remove_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (left: T) => boolean): InputIterator;
-    /**
-     * <p> Copy range removing value. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * those elements that compare equal to <i>val</i>. </p>
-     *
-     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches in the sequence,
-     * which are "removed". </p>
-     *
-     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param val Value to be removed.
-     *
-     * @return An iterator pointing to the end of the copied range, which includes all the elements in
-     *		   [<i>first</i>, <i>last</i>) except those that compare equal to <i>val</i>.
-     */
-    function remove_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, val: T): OutputIterator;
-    /**
-     * <p> Copy range removing values. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * those elements for which <i>pred</i> returns <code>true</code>. </p>
-     *
-     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches, which are
-     * "removed". </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
-     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
-     *
-     * @return An iterator pointing to the end of the copied range, which includes all the elements in
-     *		   [<i>first</i>, <i>last</i>) except those for which <i>pred</i> returns <code>true</code>.
-     */
-    function remove_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean): OutputIterator;
-    /**
-     * <p> Replace value in range. </p>
-     *
-     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) that compare equal to
-     * <i>old_val</i>. </p>
-     *
-     * <p> The function uses {@link equal_to} to compare the individual elements to old_val. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param old_val Value to be replaced.
-     * @param new_val Replacement value.
-     */
-    function replace<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, old_val: T, new_val: T): void;
-    /**
-     * <p> Replace value in range. </p>
-     *
-     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) for which pred returns
-     * <code>true</code>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be replaced (if
-     *			   <code>true</code>, it is replaced). The function shall not modify its argument.
-     * @param new_val Value to assign to replaced elements.
-     */
-    function replace_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean, new_val: T): void;
-    /**
-     * <p> Copy range replacing value. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
-     * the appearances of <i>old_value</i> by <i>new_value</i>. </p>
-     *
-     * <p> The function uses {@link std.equal_to} to compare the individual elements to <i>old_value</i>. </p>
-     *
-     * <p> The ranges shall not overlap in such a way that result points to an element in the range
-     * [<i>first</i>, <i>last</i>). </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param old_val Value to be replaced.
-     * @param new_val Replacement value.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function replace_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, old_val: T, new_val: T): OutputIterator;
-    /**
-     * <p> Copy range replacing value. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
-     * those for which <i>pred</i> returns <code>true</code> by <i>new_value</i>. </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
-     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
-     * @param new_val Value to assign to replaced values.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function replace_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean, new_val: T): OutputIterator;
-    /**
-     * <p> Exchange values of objects pointed to by two iterators. </p>
-     *
-     * <p> Swaps the elements pointed to by <i>x</i> and <i>y</i>. </p>
-     *
-     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
-     *
-     * @param x {@link Iterator Forward iterator} to the objects to swap.
-     * @param y {@link Iterator Forward iterator} to the objects to swap.
-     */
-    function iter_swap<T>(x: Iterator<T>, y: Iterator<T>): void;
-    /**
-     * <p> Exchange values of two ranges. </p>
-     *
-     * <p> Exchanges the values of each of the elements in the range [<i>first1</i>, <i>last1</i>) with those of their
-     * respective elements in the range beginning at <i>first2</i>. </p>
-     *
-     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
-     *
-     * @param first1 {@link Iterator Forward iterator} to the initial position of the first sequence.
-     * @param last1 {@link Iterator Forward iterator} to the final position of the first sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Forward iterator} to the initial position of the second range. The range includes as
-     *				 many elements as [<i>first1</i>, <i>last1</i>). The two ranges shall not overlap.
-     *
-     * @return An iterator to the last element swapped in the second sequence.
-     */
-    function swap_ranges<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2): ForwardIterator2;
-    /**
-     * <p> Reverse range. </p>
-     *
-     * <p> Reverses the order of the elements in the range [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The function calls {@link iter_swap} to swap the elements to their new locations. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     */
-    function reverse<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): void;
-    /**
-     * <p> Copy range reversed. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but in
-     * reverse order. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     *
-     * @return An output iterator pointing to the end of the copied range, which contains the same elements in reverse
-     *		   order.
-     */
-    function reverse_copy<T, BidirectionalIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Rotate left the elements in range. </p>
-     *
-     * <p> Rotates the order of the elements in the range [<i>first</i>, <i>last</i>), in such a way that the element
-     * pointed by middle becomes the new first element. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param middle An {@link Iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is
-     *				 moved to the first position in the range.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator pointing to the element that now contains the value previously pointed by <i>first</i>.
-     */
-    function rotate<T, InputIterator extends Iterator<T>>(first: InputIterator, middle: InputIterator, last: InputIterator): InputIterator;
-    /**
-     * <p> Copy range rotated left. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but
-     * rotating the order of the elements in such a way that the element pointed by <i>middle</i> becomes the first
-     * element in the resulting range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the range to be copy-rotated.
-     * @param middle Forward iterator pointing to the element within the range [<i>first</i>, <i>last</i>) that is copied as the first element in the resulting range.
-     * @param last {@link Iterator Forward iterator} to the final positions of the range to be copy-rotated. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *			   Notice that in this function, these are not consecutive parameters, but the first and <b>third</b> ones.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     *
-     * @return An output iterator pointing to the end of the copied range.
-     */
-    function rotate_copy<T, ForwardIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: ForwardIterator, middle: ForwardIterator, last: ForwardIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Randomly rearrange elements in range. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly. </p>
-     *
-     * <p> The function swaps the value of each element with that of some other randomly picked element. When provided,
-     * the function gen determines which element is picked in every case. Otherwise, the function uses some unspecified
-     * source of randomness. </p>
-     *
-     * <p> To specify a uniform random generator, see {@link shuffle}. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     */
-    function random_shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Randomly rearrange elements in range using generator. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly, using <i>g</i> as uniform random
-     * number generator. </p>
-     *
-     * <p> The function swaps the value of each element with that of some other randomly picked element. The function
-     * determines the element picked by calling <i>g()</i>. </p>
-     *
-     * <p> To shuffle the elements of the range without such a generator, see {@link random_shuffle} instead. </p>
-     *
-     * <h5> Note </h5>
-     * <p> Using random generator engine is not implemented yet. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     */
-    function shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Sort elements in range. </p>
-     *
-     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into ascending order. The elements are compared
-     * using {@link less}. </p>
-     *
-     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
-     *				The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *				and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *				<i>first</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *				{@link Iterator.swap swap} is properly defined.
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *			  {@link Iterator.swap swap} is properly defined.
-     */
-    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Sort elements in range. </p>
-     *
-     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into specific order. The elements are compared
-     * using <i>compare</i>. </p>
-     *
-     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
-     *				The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *				and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *				<i>first</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *				{@link Iterator.swap swap} is properly defined.
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *			  {@link Iterator.swap swap} is properly defined.
-     *
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
-     *		  convertible to <code>boolean</code>. The value returned indicates whether the element passed as first
-     *		  argument is considered to go before the second in the specific strict weak ordering it defines. The
-     *		  function shall not modify any of its arguments. This can either be a function pointer or a function
-     *		  object.
-     */
-    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (left: T, right: T) => boolean): void;
-    /**
-     * <p> Partially sort elements in range. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
-     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
-     * elements are left without any specific order. </p>
-     *
-     * <p> The elements are compared using {@link less}. </p>
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
-     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>.
-     */
-    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Partially sort elements in range. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
-     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
-     * elements are left without any specific order. </p>
-     *
-     * <p> The elements are compared using <i>comp</i>. </p>
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
-     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
-     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
-     *				  first argument is considered to go before the second in the specific strict weak ordering it
-     *				  defines. The function shall not modify any of its arguments.
-     */
-    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
-    /**
-     * <p> Copy and partially sort range. </p>
-     *
-     * <p> Copies the smallest  elements in the range [<i>first</i>, <i>last</i>) to
-     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
-     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
-     * elements in [<i>first</i>, <i>last</i>)). </p>
-     *
-     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
-     *
-     * <p> The elements are compared using {@link less}. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
-     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
-     *			   <i>RandomAccessIterator</i>.
-     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
-     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
-     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
-     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
-     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
-     *				  defines. The function shall not modify any of its arguments.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator): RandomAccessIterator;
-    /**
-     * <p> Copy and partially sort range. </p>
-     *
-     * <p> Copies the smallest (or largest) elements in the range [<i>first</i>, <i>last</i>) to
-     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
-     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
-     * elements in [<i>first</i>, <i>last</i>)). </p>
-     *
-     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
-     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
-     *			   <i>RandomAccessIterator</i>.
-     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
-     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
-     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
-     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
-     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
-     *				  defines. The function shall not modify any of its arguments.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator, compare: (x: T, y: T) => boolean): RandomAccessIterator;
-    /**
-     * <p> Check whether range is sorted. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
-     *
-     * <p> The elements are compared using {@link less}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
-     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
-     *		   the function always returns <code>true</code>.
-     */
-    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): boolean;
-    /**
-     * <p> Check whether range is sorted. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered to go before the second in the specific strict weak ordering it defines. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
-     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
-     *		   the function always returns <code>true</code>.
-     */
-    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Find first unsorted element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
-     * ascending order. </p>
-     *
-     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
-     *
-     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
-     *
-     * <p> The elements are compared using {@link equal_to}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered to go before the second in the specific strict weak ordering it defines. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
-     *		   all elements are sorted or if the range contains less than two elements.
-     */
-    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
-    /**
-     * <p> Find first unsorted element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
-     * ascending order. </p>
-     *
-     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
-     *
-     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered to go before the second in the specific strict weak ordering it defines. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
-     *		   all elements are sorted or if the range contains less than two elements.
-     */
-    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return iterator to lower bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
-     * compare less than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
-     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
-     * <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
-     * to <i>val</i>, and not only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
-    /**
-     * <p> Return iterator to lower bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
-     * compare less than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
-     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
-     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
-     * to <i>val</i>, and not only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
-     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
-     *				  returned indicates whether the first argument is considered to go before the second. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return iterator to upper bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
-     * greater than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
-     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
-     * <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
-     * <i>val</i>, only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
-    /**
-     * <p> Return iterator to upper bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
-     * greater than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
-     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
-     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
-     * <i>val</i>, only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
-     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
-     *				  returned indicates whether the first argument is considered to go before the second. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
-     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
-     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
-     */
-    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): Pair<ForwardIterator, ForwardIterator>;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
-     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *				  the first argument is considered to go before the second. The function shall not modify any of its
-     *				  arguments.
-     *
-     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
-     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
-     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
-     */
-    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
-     */
-    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): boolean;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {<i>compare</i>}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
-     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *				  the first argument is considered to go before the second. The function shall not modify any of its
-     *				  arguments.
-     *
-     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
-     */
-    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Test whether range is partitioned. </p>
-     *
-     * <p> Returns <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i>
-     * returns <code>true</code> precede those for which it returns <code>false</code>. </p>
-     *
-     * <p> If the range is {@link IContainer.empty empty}, the function returns <code>true</code>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Input iterator} to the final position of the sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
-     *			   <code>true</code>, the element is expected before all the elements for which it returns
-     *			   <code>false</code>). The function shall not modify its argument.
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns
-     *		   <code>true</code> precede those for which it returns <code>false</code>. Otherwise it returns
-     *		   <code>false</code>. If the range is {@link IContainer.empty empty}, the function returns <code>true</code>.
-     */
-    function is_partitioned<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T) => boolean): boolean;
-    /**
-     * <p> Partition range in two. </p>
-     *
-     * <p> Rearranges the elements from the range [<i>first</i>, <i>last</i>), in such a way that all the elements for
-     * which <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>. The iterator
-     * returned points to the first element of the second group. </p>
-     *
-     * <p> The relative ordering within each group is not necessarily the same as before the call. See
-     * {@link stable_partition} for a function with a similar behavior but with stable ordering within each group. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence to partition.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence to partition. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
-     *			   <code>true</code>, the element is expected before all the elements for which it returns
-     *			   <code>false</code>). The function shall not modify its argument.
-     *
-     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
-     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
-     */
-    function partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
-    /**
-     * <p> Partition range in two - stable ordering. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that all the elements for which
-     * <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>, and, unlike
-     * function {@link partition}, the relative order of elements within each group is preserved. </p>
-     *
-     * <p> This is generally implemented using an internal temporary buffer. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position of the sequence to partition.
-     * @param last {@link Iterator Bidirectional iterator} to the final position of the sequence to partition. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
-     *			   <code>true</code>, the element is expected before all the elements for which it returns
-     *			   <code>false</code>). The function shall not modify its argument.
-     *
-     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
-     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
-     */
-    function stable_partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
-    /**
-     * <p> Partition range into two. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns <code>true</code>
-     * into the range pointed by <i>result_true</i>, and those for which it does not into the range pointed by
-     * <i>result_false</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the range to be copy-partitioned.
-     * @param last {@link Iterator Input iterator} to the final position of the range to be copy-partitioned. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result_true {@link Iterator Output iterator} to the initial position of the range where the elements for
-     *					  which <i>pred</i> returns <code>true</code> are stored.
-     * @param result_false {@link Iterator Output iterator} to the initial position of the range where the elements for
-     *					   which <i>pred</i> returns <code>false</code> are stored.
-     * @param pred Unary function that accepts an element pointed by <i>InputIterator</i> as argument, and returns a value
-     *			   convertible to <code>bool</code>. The value returned indicates on which result range the element is
-     *			   copied. The function shall not modify its argument.
-     *
-     * @return A {@link Pair} of iterators with the end of the generated sequences pointed by <i>result_true</i> and
-     *		   <i>result_false</i>, respectivelly. Its member {@link Pair.first first} points to the element that follows
-     *		   the last element copied to the sequence of elements for which <i>pred</i> returned <code>true</code>. Its
-     *		   member {@link Pair.second second} points to the element that follows the last element copied to the sequence
-     *		   of elements for which <i>pred</i> returned <code>false</code>.
-     */
-    function partition_copy<T, InputIterator extends Iterator<T>, OutputIterator1 extends Iterator<T>, OutputIterator2 extends Iterator<T>>(first: InputIterator, last: InputIterator, result_true: OutputIterator1, result_false: OutputIterator2, pred: (val: T) => T): Pair<OutputIterator1, OutputIterator2>;
-    /**
-     * <p> Get partition point. </p>
-     *
-     * <p> Returns an iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which
-     * <i>pred</i> is not <code>true</code>, indicating its partition point. </p>
-     *
-     * <p> The elements in the range shall already {@link is_partitioned be partitioned}, as if {@link partition} had been
-     * called with the same arguments. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link Iteartor random-access iterators}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the partitioned sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the partitioned sequence. The range checked
-     *		  is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> an <i>last</i>,
-     *		  including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element goes before the partition point (if
-     *			   <code>true</code>, it goes before; if <code>false</code> goes at or after it). The function shall not
-     *			   modify its argument.
-     *
-     * @return An iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which <i>pred</i>
-     *		   is not <code>true</code>, or <i>last</i> if it is not <code>true</code> for any element.
-     */
-    function partition_point<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, pred: (x: T) => boolean): ForwardIterator;
-    /**
-     * <p> Merge sorted ranges. </p>
-     *
-     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
-     * a new range beginning at <i>result</i> with all its elements sorted. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
-     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
-     *				 range is stored. Its size is equal to the sum of both ranges above.
-     *
-     * @return An iterator pointing to the past-the-end element in the resulting sequence.
-     */
-    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Merge sorted ranges. </p>
-     *
-     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
-     * a new range beginning at <i>result</i> with all its elements sorted. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
-     * this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
-     *				 range is stored. Its size is equal to the sum of both ranges above.
-     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator pointing to the past-the-end element in the resulting sequence.
-     */
-    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Merge consecutive sorted ranges. </p>
-     *
-     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
-     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
-     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
-     *
-     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
-     * range preceding those equivalent in the second. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
-     *				This is also the initial position where the resulting merged range is stored.
-     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
-     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
-     *				 sequence.
-     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
-     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
-     *			   stored.
-     */
-    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator): void;
-    /**
-     * <p> Merge consecutive sorted ranges. </p>
-     *
-     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
-     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. The elements in both ranges shall already be ordered according
-     * to this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
-     *
-     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
-     * range preceding those equivalent in the second. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
-     *				This is also the initial position where the resulting merged range is stored.
-     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
-     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
-     *				 sequence.
-     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
-     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
-     *			   stored.
-     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     */
-    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator, compare: (x: T, y: T) => boolean): void;
-    /**
-     * <p> Test whether sorted range includes another sorted range. </p>
-     *
-     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
-     * sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be ordered according to this same criterion ({@link less}). </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
-     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
-     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
-     *				<i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
-     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
-     *
-     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
-     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
-     *		   range, the function returns <code>true</code>.
-     */
-    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2): boolean;
-    /**
-     * <p> Test whether sorted range includes another sorted range. </p>
-     *
-     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
-     * sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be ordered according to this same criterion (<i>compare</i>). </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
-     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
-     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
-     *				<i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
-     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
-     * @param compare Binary function that accepts two elements as arguments (one from each of the two sequences, in the
-     *				  same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *				  whether the element passed as first argument is considered to go before the second in the specific
-     *				  <i>strict weak ordering</i> it defines. The function shall not modify any of its arguments.
-     *
-     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
-     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
-     *		   range, the function returns <code>true</code>.
-     */
-    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Union of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
-     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
-     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
-     * range. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Union of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
-     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
-     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
-     * range. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Intersection of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
-     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
-     * copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Intersection of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
-     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
-     * copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
-     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
-     * second one. The elements copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
-     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
-     *
-     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
-     * </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
-     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
-     * second one. The elements copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
-     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
-     *
-     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
-     * </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Symmetric difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
-     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
-     * </p>
-     *
-     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
-     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
-     * existent order before the call. The existing order is also preserved for the copied elements. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link std.less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Symmetric difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
-     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
-     * </p>
-     *
-     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
-     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
-     * existent order before the call. The existing order is also preserved for the copied elements. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Return the smallest. </p>
-     *
-     * <p> Returns the smallest of all the elements in the <i>args</i>. </p>
-     *
-     * @param args Values to compare.
-     *
-     * @return The lesser of the values passed as arguments.
-     */
-    function min<T>(...args: T[]): T;
-    /**
-     * <p> Return the largest. </p>
-     *
-     * <p> Returns the largest of all the elements in the <i>args</i>. </p>
-     *
-     * @param args Values to compare.
-     *
-     * @return The largest of the values passed as arguments.
-     */
-    function max<T>(...args: T[]): T;
-    /**
-     * <p> Return smallest and largest elements. </p>
-     *
-     * <p> Returns a {@link Pair} with the smallest of all the elements in the <i>args</i> as first element (the first of
-     * them, if there are more than one), and the largest as second (the last of them, if there are more than one). </p>
-     *
-     * @param args Values to compare.
-     *
-     * @return The lesser and greatest of the values passed as arguments.
-     */
-    function minmax<T>(...args: T[]): Pair<T, T>;
-    /**
-     * <p> Return smallest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either {@link less}; An element is the smallest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
-     */
-    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
-    /**
-     * <p> Return smallest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either <i>compare</i>; An element is the smallest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
-     */
-    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return largest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either {@link greater}; An element is the largest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
-     */
-    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
-    /**
-     * <p> Return largest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either <i>compare</i>; An element is the largest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
-     */
-    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return smallest and largest elements in range. </p>
-     *
-     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
-     *
-     * <p> The comparisons are performed using either {@link less} and {@link greater}. </p>
-     *
-     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
-     * elements. </p>
-     *
-     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
-     * elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
-     */
-    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): Pair<ForwardIterator, ForwardIterator>;
-    /**
-     * <p> Return smallest and largest elements in range. </p>
-     *
-     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
-     *
-     * <p> The comparisons are performed using either <i>compare</i>. </p>
-     *
-     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
-     * elements. </p>
-     *
-     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
-     * elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
-     */
-    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
-}
-declare namespace std {
-    /**
-     * <p> Function object class for equality comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether its two arguments compare <i>equal</i> (as returned by
-     * operator ==). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
-     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element to compare.
-     * @param y Second element to compare.
-     *
-     * @return Whether the arguments are equal.
-     */
-    function equal_to<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function object class for non-equality comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether its two arguments compare <i>not equal</i> (as returned
-     * by operator operator!=). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
-     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element to compare.
-     * @param y Second element to compare.
-     *
-     * @return Whether the arguments are not equal.
-     */
-    function not_equal_to<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function for less-than inequality comparison. </p>
-     *
-     * <p> Binary function returns whether the its first argument compares less than the second. </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
-     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
-     * This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()}</code>,
-     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
-     *
-     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
-     *			  <i>operator<()</i> or method {@link IComparable.less less}.
-     *
-     * @param x First element, the standard of comparison.
-     * @param y Second element compare with the first.
-     *
-     * @return Whether the first parameter is less than the second.
-     */
-    function less<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function object class for less-than-or-equal-to comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether the its first argument compares {@link less less than} or
-     * {@link equal_to equal to} the second (as returned by operator <=). </p>
-     *
-     * <p> Generically, <i>function objects</i> are instances of a class with member function {@link IComparable.less less}
-     * and {@link IComparable.equal_to equal_to} defined. This member function allows the object to be used with the same
-     * syntax as a function call. </p>
-     *
-     * @param x First element, the standard of comparison.
-     * @param y Second element compare with the first.
-     *
-     * @return Whether the <i>x</i> is {@link less less than} or {@link equal_to equal to} the <i>y</i>.
-     */
-    function less_equal<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function for greater-than inequality comparison. </p>
-     *
-     * <p> Binary function returns whether the its first argument compares greater than the second. </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link less} and
-     * {@link equal_to equal_to()} defined. If an object doesn't have those methods, then its own uid will be used
-     * to compare insteadly. This member function allows the object to be used with the same syntax as a function
-     * call. </p>
-     *
-     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()},
-     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
-     *
-     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
-     *			  <i>operator>()</i> or method {@link IComparable.greater greater}.
-     *
-     * @return Whether the <i>x</i> is greater than the <i>y</i>.
-     */
-    function greater<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function object class for greater-than-or-equal-to comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether the its first argument compares
-     * {@link greater greater than} or {@link equal_to equal to} the second (as returned by operator >=). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
-     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
-     * This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element, the standard of comparison.
-     * @param y Second element compare with the first.
-     *
-     * @return Whether the <i>x</i> is {@link greater greater than} or {@link equal_to equal to} the <i>y</i>.
-     */
-    function greater_equal<T>(x: T, y: T): boolean;
-    /**
-     * <p> Logical AND function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of the <i>logical "and"</i> operation between its two
-     * arguments (as returned by operator &&). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
-     * function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of logical AND operation.
-     */
-    function logical_and<T>(x: T, y: T): boolean;
-    /**
-     * <p> Logical OR function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of the <i>logical "or"</i> operation between its two
-     * arguments (as returned by operator ||). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
-     * function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of logical OR operation.
-     */
-    function logical_or<T>(x: T, y: T): boolean;
-    /**
-     * <p> Logical NOT function object class. </p>
-     *
-     * <p> Unary function object class whose call returns the result of the <i>logical "not"</i> operation on its argument
-     * (as returned by operator !). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
-     * function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x Target element.
-     *
-     * @return Result of logical NOT operation.
-     */
-    function logical_not<T>(x: T): boolean;
-    /**
-     * <p> Bitwise AND function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
-     * its two arguments (as returned by operator &). </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of bitwise AND operation.
-     */
-    function bit_and(x: number, y: number): number;
-    /**
-     * <p> Bitwise OR function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
-     * its two arguments (as returned by operator &). </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of bitwise OR operation.
-     */
-    function bit_or(x: number, y: number): number;
-    /**
-     * <p> Bitwise XOR function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "exclusive or"</i>
-     * operation between its two arguments (as returned by operator ^). </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of bitwise XOR operation.
-     */
-    function bit_xor(x: number, y: number): number;
-    /**
-     * <p> Comparable instance. </p>
-     *
-     * <p> {@link IComparable} is a common interface for objects who can compare each other. </p>
-     *
-     * @reference https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IComparable<T> extends Object {
-        /**
-         * <p> Indicates whether some other object is &quot;equal to&quot; this one. </p>
-         *
-         * <p> The {@link equal_to} method implements an equivalence relation on non-null object references: </p>
-         *
-         * <ul>
-         *	<li>
-         *		It is <b>reflexive</b>: for any non-null reference value <code>x</code>, <code>x.equal_to(x)</code>
-         *		should return <code>true</code>.
-         *	</li>
-         *	<li>
-         *		It is <b>symmetric</b>: for any non-null reference values <code>x</code> and <code>y</code>,
-         *		<code>x.equal_to(y)</code> should return <code>true</code> if and only if <code>y.equal_to(x)</code>
-         *		returns <code>true</code>. </li>
-         *	<li>
-         *		It is <b>transitive</b>: for any non-null reference values <code>x</code>, <code>y</code>, and
-         *		<code>z</code>, if <code>x.equal_to(y)</code> returns <code>true</code> and <code>y.equal_to(z)</code>
-         *		returns <code>true</code>, then <code>x.equal_to(z)</code> should return <code>true</code>.
-         *	</li>
-         *	<li>
-         *		It is <b>consistent</b>: for any non-null reference values <code>x</code> and <code>y</code>, multiple
-         *		invocations of <code>x.equal_to(y)</code> consistently return <code>true</code> or consistently return
-         *		<code>false</code>, provided no information used in equal_to comparisons on the objects is modified.
-         *	</li>
-         *	<li>
-         *		For any non-null reference value <code>x</code>, <code>x.equal_to(null)</code> should return
-         *		<code>false</code>.
-         *	</li>
-         * </ul>
-         *
-         * <p> The {@link equal_to} method for interface {@link IComparable} implements the most discriminating possible
-         * equivalence relation on objects; that is, for any non-null reference values <code>x</code> and
-         * <code>y</code>, this method returns <code>true</code> if and only if <code>x</code> and <code>y</code>
-         * refer to the same object (<code>x == y</code> has the value <code>true</code>). </p>
-         *
-         * <p> Note that it is generally necessary to override the {@link hash_code} method whenever this method is
-         * overridden, so as to maintain the general contract for the {@link hash_code} method, which states that
-         * equal objects must have equal hash codes. </p>
-         *
-         * <ul>
-         *	<li> {@link IComparable.equal_to} is called by {@link std.equal_to}. </li>
-         * </ul>
-         *
-         * @param obj the reference object with which to compare.
-         *
-         * @return <code>true</code> if this object is the same as the obj argument; <code>false</code> otherwise.
-         */
-        equal_to(obj: T): boolean;
-        /**
-         * <p> Less-than inequality comparison. </p>
-         *
-         * <p> Binary method returns whether the the instance compares less than the <i>obj</i>. </p>
-         *
-         * <ul>
-         *	<li>
-         *		{@link IComparable.less} is called by {@link std.less}. Also, this method can be used on standard
-         *		algorithms such as {@link sort sort()}</code>, {@link merge merge()} or
-         *		{@link TreeMap.lower_bound lower_bound()}.
-         *	</li>
-         * </ul>
-         *
-         * @param obj the reference object with which to compare.
-         *
-         * @return Whether the first parameter is less than the second.
-         */
-        less(obj: T): boolean;
-        /**
-         * <p> Issue a hash code. </p>
-         *
-         * <p> Returns a hash code value for the object. This method is supported for the benefit of hash tables such
-         * as those provided by hash containers; {@link HashSet}, {@link HashMap}, {@link MultiHashSet} and
-         * {@link MultiHashMap}. </p>
-         *
-         * <p> As much as is reasonably practical, the {@link hash_code} method defined by interface
-         * {@link IComparable} does return distinct integers for distinct objects. (This is typically implemented by
-         * converting the internal address of the object into an integer, but this implementation technique is not
-         * required by the JavaScript programming language.) </p>
-         *
-         * <ul>
-         *	<li>
-         *		{@link IComparable.hash_code} is called by {@link std.hash_code}. If you want to keep basically
-         *		provided hash function, then returns {@link std.Hash.code}; <code>return std.Hash.code(this);</code>
-         *	</li>
-         * </ul>
-         *
-         * @return An hash code who represents the object.
-         */
-        hash(): number;
-    }
-    /**
-     * Default hash function.
-     *
-     * @param obj
-     */
-    function hash(obj: any): number;
-    /**
-     * <p> Exchange contents of {@link IContainers containers}. </p>
-     *
-     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must have
-     * same type of elements (same template parameters), although sizes may differ. </p>
-     *
-     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i> before
-     * the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references and
-     * pointers remain valid for the swapped objects. </p>
-     *
-     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
-     * ownership over their assets to the other container (i.e., the containers exchange references to their data, without
-     * actually performing any element copy or movement): It behaves as if <i>left</i>.
-     * {@link IContainer.swap swap}(<i>right</i>) was called. </p>
-     *
-     * @param left A {@link IContainer container} to swap its contents.
-     * @param right A {@link IContainer container} to swap its contents.
-     */
-    function swap<T>(left: base.IContainer<T>, right: base.IContainer<T>): void;
-    /**
-     * <p> Exchange contents of queues. </p>
-     *
-     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
-     *
-     * @param left A {@link Queue} container of the same type. Size may differ.
-     * @param right A {@link Queue} container of the same type. Size may differ.
-     */
-    function swap<T>(left: Queue<T>, right: Queue<T>): void;
-    /**
-     * <p> Exchange contents of {@link PriorityQueue PriorityQueues}. </p>
-     *
-     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
-     *
-     * @param left A {@link PriorityQueue} container of the same type. Size may differ.
-     * @param right A {@link PriorityQueue} container of the same type. Size may differ.
-     */
-    function swap<T>(left: PriorityQueue<T>, right: PriorityQueue<T>): void;
-    /**
-     * <p> Exchange contents of {@link Stack Stacks}. </p>
-     *
-     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
-     *
-     * @param left A {@link Stack} container of the same type. Size may differ.
-     * @param right A {@link Stack} container of the same type. Size may differ.
-     */
-    function swap<T>(left: Stack<T>, right: Stack<T>): void;
-    /**
-     * <p> Exchanges the contents of two {@link UniqueMap unique maps}. </p>
-     *
-     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
-     * be of the same type (same template parameters), although sizes may differ. </p>
-     *
-     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
-     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
-     * and pointers remain valid for the swapped objects. </p>
-     *
-     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
-     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
-     * without actually performing any element copy or movement): It behaves as if
-     * <i>left</i>.{@link UniqueMap.swap swap}(<i>right</i>) was called. </p>
-     *
-     * @param left An {@link UniqueMap unique map} to swap its conents.
-     * @param right An {@link UniqueMap unique map} to swap its conents.
-     */
-    function swap<Key, T>(left: base.UniqueMap<Key, T>, right: base.UniqueMap<Key, T>): void;
-    /**
-     * <p> Exchanges the contents of two {@link MultiMap multi maps}. </p>
-     *
-     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
-     * be of the same type (same template parameters), although sizes may differ. </p>
-     *
-     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
-     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
-     * and pointers remain valid for the swapped objects. </p>
-     *
-     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
-     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
-     * without actually performing any element copy or movement): It behaves as if
-     * <i>left</i>.{@link MultiMap.swap swap}(<i>right</i>) was called. </p>
-     *
-     * @param left A {@link MultiMap multi map} to swap its conents.
-     * @param right A {@link MultiMap multi map} to swap its conents.
-     */
-    function swap<Key, T>(left: base.MultiMap<Key, T>, right: base.MultiMap<Key, T>): void;
-    /**
-     * <p> Bind function arguments. </p>
-     *
-     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
-     *
-     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
      * <ul>
-     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
-     *	<li>
-     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
-     *		call (the one whose order number is specified by the placeholder).
-     *	</li>
+     *	<li> empty </li>
+     *	<li> size </li>
+     *	<li> front </li>
+     *	<li> back </li>
+     *	<li> push_back </li>
+     *	<li> pop_back </li>
      * </ul>
      *
-     * <p> Calling the returned object returns the same type as fn. </p>
+     * <p> The standard container classes {@link Vector}, {@link Deque} and {@link List} fulfill these requirements.
+     * By default, if no container class is specified for a particular {@link Stack} class instantiation, the standard
+     * container {@link List} is used. </p>
      *
-     * @param fn A function object, pointer to function or pointer to member.
-     * @param args List of arguments to bind: either values, or {@link placeholders}.
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
      *
-     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
-     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
-     *		   is a member.
-     */
-    function bind<Ret>(fn: (...args: any[]) => Ret, ...args: any[]): (...args: any[]) => Ret;
-    /**
-     * <p> Bind function arguments. </p>
+     * @param <T> Type of elements.
      *
-     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
-     *
-     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
-     * <ul>
-     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
-     *	<li>
-     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
-     *		call (the one whose order number is specified by the placeholder).
-     *	</li>
-     * </ul>
-     *
-     * <p> Calling the returned object returns the same type as fn. </p>
-     *
-     * @param fn A function object, pointer to function or pointer to member.
-     * @param thisArg This argument, owner object of the member method <i>fn</i>.
-     * @param args List of arguments to bind: either values, or {@link placeholders}.
-     *
-     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
-     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
-     *		   is a member.
-     */
-    function bind<Ret, T>(fn: (...args: any[]) => Ret, thisArg: T, ...args: any[]): (...args: any[]) => Ret;
-    /**
-     * <p> Bind argument placeholders. </p>
-     *
-     * <p> This namespace declares an unspecified number of objects: <i>_1</i>, <i>_2</i>, <i>_3</i>, ...</i>, which are
-     * used to specify placeholders in calls to function {@link std.bind}. </p>
-     *
-     * <p> When the function object returned by bind is called, an argument with placeholder {@link _1} is replaced by the
-     * first argument in the call, {@link _2} is replaced by the second argument in the call, and so on... For example: </p>
-     *
-     * <code>
-    let vec: Vector<number> = new Vector<number>();
-
-    let bind = std.bind(Vector.insert, _1, vec.end(), _2, _3);
-    bind.apply(vec, 5, 1); // vec.insert(vec.end(), 5, 1);
-        // [1, 1, 1, 1, 1]
-     * </code>
-     *
-     * <p> When a call to {@link bind} is used as a subexpression in another call to <i>bind</i>, the {@link placeholders}
-     * are relative to the outermost {@link bind} expression. </p>
-     *
-     * @reference http://www.cplusplus.com/reference/functional/placeholders/
+     * @reference http://www.cplusplus.com/reference/stack/stack
      * @author Jeongho Nam <http://samchon.org>
      */
-    namespace placeholders {
+    class Stack<T> {
         /**
-         * @hidden
+         * The <i>underlying object</i> for implementing the <i>LIFO</i>
          */
-        class PlaceHolder {
-            private index_;
-            constructor(index: number);
-            index: number;
-        }
-        /**
-         * Replaced by the first argument in the function call.
-         */
-        const _1: PlaceHolder;
-        /**
-         * Replaced by the second argument in the function call.
-         */
-        const _2: PlaceHolder;
-        /**
-         * Replaced by the third argument in the function call.
-         */
-        const _3: PlaceHolder;
-        const _4: PlaceHolder;
-        const _5: PlaceHolder;
-        const _6: PlaceHolder;
-        const _7: PlaceHolder;
-        const _8: PlaceHolder;
-        const _9: PlaceHolder;
-        const _10: PlaceHolder;
-        const _11: PlaceHolder;
-        const _12: PlaceHolder;
-        const _13: PlaceHolder;
-        const _14: PlaceHolder;
-        const _15: PlaceHolder;
-        const _16: PlaceHolder;
-        const _17: PlaceHolder;
-        const _18: PlaceHolder;
-        const _19: PlaceHolder;
-        const _20: PlaceHolder;
-    }
-}
-declare namespace std {
-    /**
-     * <p> Standard exception class. </p>
-     *
-     * <p> Base class for standard exceptions. </p>
-     *
-     * <p> All objects thrown by components of the standard library are derived from this class.
-     * Therefore, all standard exceptions can be caught by catching this type by reference. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/exception/exception
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class Exception {
-        /**
-         * A message representing specification about the Exception.
-         */
-        protected message: string;
+        private container_;
         /**
          * Default Constructor.
          */
         constructor();
         /**
-         * <p> Construct from a message. </p>
-         *
-         * @param message A message representing specification about the Exception.
+         * Copy Constructor.
          */
-        constructor(what: string);
+        constructor(stack: Stack<T>);
         /**
-         * <p> Get string identifying exception. </p>
-         * <p> Returns a string that may be used to identify the exception. </p>
+         * <p> Return size. </p>
          *
-         * <p> The particular representation pointed by the returned value is implementation-defined.
-         * As a virtual function, derived classes may redefine this function so that specify value are
-         * returned. </p>
+         * <p> Returns the number of elements in the {@link Stack}. </p>
+         *
+         * <p> This member function effectively calls member {@link ILinearContainer.size size()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return The number of elements in the {@link container_ underlying container}.
          */
-        what(): string;
-    }
-    /**
-     * <p> Logic error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report errors in the internal
-     * logical of the program, such as violation of logical preconditions or class invariants. </p>
-     *
-     * <p> These errors are presumably detectable before the program executes. </p>
-     *
-     * <p> It is used as a base class for several logical error exceptions. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/logic_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class LogicError extends Exception {
+        size(): number;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Test whether container is empty. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> returns whether the {@link Stack} is empty: i.e. whether its <i>size</i> is zero. </p>
+         *
+         * <p> This member function effectively calls member {@link ILinearContainer.empty empty()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return <code>true</code> if the <i>underlying container</i>'s size is 0,
+         *		   <code>false</code> otherwise. </p>
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Domain error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report domain errors. </p>
-     *
-     * <p> Generally, the domain of a mathematical function is the subset of values that it is defined for.
-     * For example, the square root function is only defined for non-negative numbers. Thus, a negative number
-     * for such a function would qualify as a domain error. </p>
-     *
-     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
-     * exception to be thrown by programs. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/domain_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class DomainError extends LogicError {
+        empty(): boolean;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Access next element. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> Returns a value of the top element in the {@link Stack} </p>.
+         *
+         * <p> Since {@link Stack}s are last-in first-out containers, the top element is the last element inserted into
+         * the {@link Stack}. </p>
+         *
+         * <p> This member function effectively calls member {@link ILinearContainer.back back()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A value of the top element in the {@link Stack}.
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Invalid argument exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report an invalid argument. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
-     * also throw exceptions of this type to signal invalid arguments. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/invalid_argument
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class InvalidArgument extends LogicError {
+        top(): T;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Insert element. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> Inserts a new element at the top of the {@link Stack}, above its current top element. </p>
+         *
+         * <p> This member function effectively calls the member function
+         * {@link ILinearContainer.push_back push_back()} of the {@link container_ underlying container} object. </p>
+         *
+         * @param val Value to which the inserted element is initialized.
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Length error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report a length error. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
-     * such as vector and string also throw exceptions of this type to signal errors resizing. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/length_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class LengthError extends LogicError {
+        push(val: T): void;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Remove top element. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> Removes the element on top of the {@link Stack}, effectively reducing its size by one. </p>
+         *
+         * <p> The element removed is the latest element inserted into the {@link Stack}, whose value can be retrieved
+         * by calling member {@link top Stack.top()} </p>.
+         *
+         * <p> This member function effectively calls the member function {@link ILinearContainer.pop_back pop_back()}
+         * of the {@link container_ underlying container} object. </p>
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Out-of-range exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report an out-of-range error. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
-     * such as vector, deque, string and bitset also throw exceptions of this type to signal arguments
-     * out of range. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/out_of_range
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class OutOfRange extends LogicError {
+        pop(): void;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Swap contents. </p>
          *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
-    }
-    /**
-     * <p> Runtime error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report errors that can only be
-     * detected during runtime. </p>
-     *
-     * <p> It is used as a base class for several runtime error exceptions. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/runtime_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class RuntimeError extends Exception {
-        /**
-         * <p> Construct from a message. </p>
+         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
          *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
-    }
-    /**
-     * <p> Overflow error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to arithmetic overflow errors. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
-     * also throw exceptions of this type to signal range errors. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/outflow_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class OverflowError extends RuntimeError {
-        /**
-         * <p> Construct from a message. </p>
+         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
+         * the {@link container_ underlying containers}. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * @param obj Another {@link Stack} container adaptor of the same type (i.e., instantiated with the same
+         *			  template parameter, <b>T</b>). Sizes may differ. </p>
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Underflow error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to arithmetic underflow errors. </p>
-     *
-     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
-     * exception to be thrown by programs. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/underflow_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class UnderflowError extends RuntimeError {
-        /**
-         * <p> Construct from a message. </p>
-         *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
-    }
-    /**
-     * <p> Range error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report range errors in internal
-     * computations. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
-     * also throw exceptions of this type to signal range errors. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/range_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class RangeError extends RuntimeError {
-        /**
-         * <p> Construct from a message. </p>
-         *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
+        swap(obj: Stack<T>): void;
     }
 }
 declare namespace std.base {
@@ -8246,6 +8121,8 @@ declare namespace std {
          */
         code(): ErrorCode;
     }
+}
+declare namespace std {
     /**
      * <p> Error category. </p>
      *
@@ -8367,6 +8244,8 @@ declare namespace std {
          */
         equivalent(code: ErrorCode, val_cond: number): boolean;
     }
+}
+declare namespace std {
     /**
      * <p> Error condition. </p>
      *
@@ -8402,6 +8281,8 @@ declare namespace std {
          */
         constructor(val: number, category: ErrorCategory);
     }
+}
+declare namespace std {
     /**
      * <p> Error code. </p>
      *
@@ -8433,7 +8314,896 @@ declare namespace std {
         constructor(val: number, category: ErrorCategory);
     }
 }
+declare namespace std.base {
+    /**
+     * <p> Common interface for tree-structured map. </p>
+     *
+     * <p> {@link ITreeMap ITreeMaps} are associative containers that store elements formed by a combination of
+     * a <i>key value</i> and a <i>mapped value</i>, following a specific order. </p>
+     *
+     * <p> In a {@link ITreeMap}, the <i>key values</i> are generally used to sort and uniquely identify
+     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
+     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
+     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
+     *
+     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
+     *
+     * <p> Internally, the elements in a {@link ITreeMap}are always sorted by its key following a
+     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
+     *
+     * <p> {@link ITreeMap}containers are generally slower than {@link IHashMap} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
+     * on their order. </p>
+     *
+     * <p> {@link ITreeMap TreeMultiMaps} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
+     *		 given a position in this order. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
+     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/map
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface ITreeMap<Key, T> {
+        /**
+         * <p> Return iterator to lower bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
+         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
+         *
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeMap} contains an element with a key equivalent to <i>k</i>: In this
+         * case, {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound}
+         * returns an iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is not considered to go before
+         *		   <i>k</i>, or {@link ITreeMap.end} if all keys are considered to go before <i>k</i>.
+         */
+        lower_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to upper bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
+         * go after <i>k</i> </p>.
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
+         *
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the map contains an element with a key equivalent to <i>k</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns an
+         * iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is considered to go after
+         *		   <i>k</i>, or {@link TreeMap.end end} if no keys are considered to go after <i>k</i>.
+         */
+        upper_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * <p> Get range of equal elements. </p>
+         *
+         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
+         * equivalent to <i>k</i> </p>.
+         *
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that has a key considered to go after <i>k</i> according to the container's internal
+         * comparison object (key_comp). </p>
+         *
+         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
+         * (i.e., no matter the order in which the keys are passed as arguments). </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
+         */
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
+    }
+}
 declare namespace std {
+    /**
+     * <p> Tree-structured map, <code>std::map</code> of STL. </p>
+     *
+     * <p> {@link TreeMap TreeMaps} are associative containers that store elements formed by a combination of a
+     * <i>key value</i> (<i>Key</i>) and a <i>mapped value</i> (<i>T</i>), following order. </p>
+     *
+     * <p> In a {@link TreeMap}, the <i>key values</i> are generally used to sort and uniquely identify the elements,
+     * while the <i>mapped values</i> store the content associated to this key. The types of <i>key</i> and
+     * <i>mapped value</i> may differ, and are grouped together in member type <i>value_type</i>, which is a {@link Pair}
+     * type combining both: </p>
+     *
+     * <p> <code>typedef Pair<Key, T> value_type;</code> </p>
+     *
+     * <p> Internally, the elements in a {@link TreeMap} are always sorted by its <i>key</i> following a
+     * <i>strict weak ordering</i> criterion indicated by its internal comparison method {@link less}.
+     *
+     * <p> {@link TreeMap} containers are generally slower than {@link HashMap HashMap} containers to access individual
+     * elements by their <i>key</i>, but they allow the direct iteration on subsets based on their order. </p>
+     *
+     * <p> {@link TreeMap}s are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
+     *		 given a position in this order. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
+     *
+     *	<dt> Unique keys </dt>
+     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
+     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/map/map
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMap<Key, T> extends base.UniqueMap<Key, T> implements base.ITreeMap<Key, T> {
+        /**
+         * <i>RB-Tree+</i> object for implemeting the {@link TreeMap}.
+         */
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<Pair<Key, T>>);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         */
+        constructor(array: Array<[Key, T]>);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         */
+        constructor(container: base.MapContainer<Key, T>);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_pair(pair: Pair<Key, T>): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.UniqueMap<Key, T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_map(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Tree-structured multiple-key map. </p>
+     *
+     * <p> {@link TreeMultiMap TreeMultiMaps} are associative containers that store elements formed by a combination of
+     * a <i>key value</i> and a <i>mapped value</i>, following a specific order, and where multiple elements can
+     * have equivalent keys. </p>
+     *
+     * <p> In a {@link TreeMultiMap}, the <i>key values</i> are generally used to sort and uniquely identify
+     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
+     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
+     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
+     *
+     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
+     *
+     * <p> Internally, the elements in a {@link TreeMultiMap}are always sorted by its key following a
+     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
+     *
+     * <p> {@link TreeMultiMap}containers are generally slower than {@link HashMap} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
+     * on their order. </p>
+     *
+     * <p> {@link TreeMultiMap TreeMultiMaps} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd>
+     *		Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		<i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>.
+     *	</dd>
+     *
+     *	<dt> Multiple equivalent keys </dt>
+     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
+     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/map/multimap
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMultiMap<Key, T> extends base.MultiMap<Key, T> implements base.ITreeMap<Key, T> {
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<Pair<Key, T>>);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         */
+        constructor(array: Array<[Key, T]>);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         */
+        constructor(container: base.MapContainer<Key, T>);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        count(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_pair(pair: Pair<Key, T>): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.MultiMap<Key, T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_multimap(obj);
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> A common interface for tree-structured set. </p>
+     *
+     * <p> {@link ITreeSet TreeMultiSets} are containers that store elements following a specific order. </p>
+     *
+     * <p> In a {@link ITreeSet}, the value of an element also identifies it (the value is itself
+     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link ITreeSet} cannot
+     * be modified once in the container (the elements are always const), but they can be inserted or removed
+     * from the  </p>
+     *
+     * <p> Internally, the elements in a {@link ITreeSet TreeMultiSets} are always sorted following a strict
+     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
+     *
+     * <p> {@link ITreeSet} containers are generally slower than {@link IHashSet} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
+     * their order. </p>
+     *
+     * <p> {@link ITreeSet TreeMultiSets} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link ITreeSet} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @reference http://www.cplusplus.com/reference/set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface ITreeSet<T> {
+        /**
+         * <p> Return iterator to lower bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is not considered to
+         * go before <i>val</i> (i.e., either it is equivalent or goes after). </p>
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(element,val) would return false. </p>
+         *
+         * <p> If the {@link ITreeSet} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element that is not less than <i>val</i>. </p>
+
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is not considered to go before
+         *		   <i>val</i>, or {@link ITreeSet.end} if all elements are considered to go before <i>val</i>.
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Return iterator to upper bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is considered to go after
+         * <i>val</i>. </p>
+
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(val,element) would return true. </p>
+
+         * <p> If the {@code ITreeSet} class is instantiated with the default comparison type (less), the
+         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the {@ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is considered to go after
+         *		   <i>val</i>, or {@link TreeSet.end end} if no elements are considered to go after <i>val</i>.
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Get range of equal elements. </p>
+         *
+         * <p> Returns the bounds of a range that includes all the elements in the container that are equivalent
+         * to <i>val</i>. </p>
+         *
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that is considered to go after val according to the container's
+         * internal comparison object (key_comp). </p>
+         *
+         * <p> Two elements of a multiset are considered equivalent if the container's comparison object returns
+         * false reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * @param key Value to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+    }
+}
+declare namespace std {
+    /**
+     * <p> Tree-structured set, <code>std::set</code> of STL. </p>
+     *
+     * <p> {@link TreeSet}s are containers that store unique elements following a specific order. </p>
+     *
+     * <p> In a {@link TreeSet}, the value of an element also identifies it (the value is itself the
+     * <i>key</i>, of type <i>T</i>), and each value must be unique. The value of the elements in a
+     * {@link TreeSet} cannot be modified once in the container (the elements are always const), but they
+     * can be inserted or removed from the  </p>
+     *
+     * <p> Internally, the elements in a {@link TreeSet} are always sorted following a specific strict weak
+     * ordering criterion indicated by its internal comparison method (of {@link less}). </p>
+     *
+     * <p> {@link TreeSet} containers are generally slower than {@link HashSet} containers to access
+     * individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on their
+     * order. </p>
+     *
+     * <p> {@link TreeSet}s are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Unique keys </dt>
+     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *			  Each element in an {@link TreeSet} is also uniquely identified by this value.
+     *
+     * @reference http://www.cplusplus.com/reference/set/set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeSet<T> extends base.UniqueSet<T> implements base.ITreeSet<T> {
+        /**
+         * <i>RB-Tree+</i> object for implemeting the {@link TreeSet}.
+         */
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: T, right: T) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<T>);
+        /**
+         * Contruct from elements with compare.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: base.IContainer<T>);
+        /**
+         * Copy Constructor with compare.
+         *
+         * @param container A container to be copied.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.IContainer<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * Range Constructor with compare.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_val(val: T): any;
+        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.UniqueSet<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_set(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Tree-structured multiple-key set. </p>
+     *
+     * <p> {@link TreeMultiSet TreeMultiSets} are containers that store elements following a specific order, and
+     * where multiple elements can have equivalent values. </p>
+     *
+     * <p> In a {@link TreeMultiSet}, the value of an element also identifies it (the value is itself
+     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link TreeMultiSet} cannot
+     * be modified once in the container (the elements are always const), but they can be inserted or removed
+     * from the  </p>
+     *
+     * <p> Internally, the elements in a {@link TreeMultiSet TreeMultiSets} are always sorted following a strict
+     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
+     *
+     * <p> {@link TreeMultiSet} containers are generally slower than {@link HashMultiSet} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
+     * their order. </p>
+     *
+     * <p> {@link TreeMultiSet TreeMultiSets} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Multiple equivalent keys </dt>
+     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link TreeMultiSet} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @reference http://www.cplusplus.com/reference/set/multiset
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMultiSet<T> extends base.MultiSet<T> implements base.ITreeSet<T> {
+        /**
+         * <i>RB-Tree+</i> object for implemeting the {@link TreeMultiSet}.
+         */
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: T, right: T) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<T>);
+        /**
+         * Contruct from elements with compare.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: base.Container<T>);
+        /**
+         * Copy Constructor with compare.
+         *
+         * @param container A container to be copied.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.Container<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * Construct from range and compare.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        count(val: T): number;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.MultiSet<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_set(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Running on Node. </p>
+     *
+     * <p> Test whether the JavaScript is running on Node. </p>
+     *
+     * @references http://stackoverflow.com/questions/17575790/environment-detection-node-js-or-browser
+     */
+    function is_node(): boolean;
     /**
      * <p> Pair of values. </p>
      *
@@ -8496,8 +9266,518 @@ declare namespace std {
      */
     function make_pair<T1, T2>(x: T1, y: T2): Pair<T1, T2>;
 }
-declare namespace std.example {
-    function test_all(): void;
+declare namespace std {
+    /**
+     * <p> Vector, the dynamic array. </p>
+     *
+     * <p> {@link Vector}s are sequence containers representing arrays that can change in size. </p>
+     *
+     * <p> Just like arrays, {@link Vector}s use contiguous storage locations for their elements, which means that
+     * their elements can also be accessed using offsets on regular pointers to its elements, and just as efficiently
+     * as in arrays. But unlike arrays, their size can change dynamically, with their storage being handled
+     * automatically by the  </p>
+     *
+     * <p> Internally, {@link Vector}s use a dynamically allocated array to store their elements. This array may need
+     * to be reallocated in order to grow in size when new elements are inserted, which implies allocating a new
+     * array and moving all elements to it. This is a relatively expensive task in terms of processing time, and
+     * thus, {@link Vector}s do not reallocate each time an element is added to the  </p>
+     *
+     * <p> Instead, {@link Vector} containers may allocate some extra storage to accommodate for possible growth, and
+     * thus the container may have an actual {@link capacity} greater than the storage strictly needed to contain its
+     * elements (i.e., its {@link size}). Libraries can implement different strategies for growth to balance between
+     * memory usage and reallocations, but in any case, reallocations should only happen at logarithmically growing
+     * intervals of {@link size} so that the insertion of individual elements at the end of the {@link Vector} can be
+     * provided with amortized constant time complexity (see {@link push_back push_back()}). </p>
+     *
+     * <p> Therefore, compared to arrays, {@link Vector}s consume more memory in exchange for the ability to manage
+     * storage and grow dynamically in an efficient way. </p>
+     *
+     * <p> Compared to the other dynamic sequence containers ({@link Deque}s, {@link List}s), {@link Vector Vectors}
+     * are very efficient accessing its elements (just like arrays) and relatively efficient adding or removing
+     * elements from its end. For operations that involve inserting or removing elements at positions other than the
+     * end, they perform worse than the others, and have less consistent iterators and references than {@link List}s.
+     * </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Sequence </dt>
+     *	<dd>
+     *		Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
+     *		accessed by their position in this sequence.
+     *	</dd>
+     *
+     *	<dt> Dynamic array </dt>
+     *	<dd>
+     *		Allows direct access to any element in the sequence, even through pointer arithmetics, and provides
+     *		relatively fast addition/removal of elements at the end of the sequence.
+     *	</dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @reference http://www.cplusplus.com/reference/vector/vector
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class Vector<T> extends Array<T> implements base.IArrayContainer<T> {
+        /**
+         * Type definition of {@link Vector}'s {@link VectorIterator iterator}.
+         */
+        static iterator: typeof VectorIterator;
+        /**
+         * <p> Default Constructor. </p>
+         *
+         * <p> Constructs an empty container, with no elements. </p>
+         */
+        constructor();
+        /**
+         * @inheritdoc
+         */
+        constructor(array: Array<T>);
+        /**
+         * <p> Initializer list Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
+         *
+         * @param array An array containing elements to be copied and contained.
+         */
+        constructor(n: number);
+        /**
+         * <p> Fill Constructor. </p>
+         *
+         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
+         *
+         * @param n Initial container size (i.e., the number of elements in the container at construction).
+         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
+         *			  initialized to a copy of this value.
+         */
+        constructor(n: number, val: T);
+        /**
+         * <p> Copy Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
+         *
+         * @param container Another container object of the same type (with the same class template
+         *					arguments <i>T</i>), whose contents are either copied or acquired.
+         */
+        constructor(container: base.IContainer<T>);
+        /**
+         * <p> Range Constructor. </p>
+         *
+         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
+         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @inheritdoc
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        assign(n: number, val: T): void;
+        /**
+         * @inheritdoc
+         */
+        reserve(size: number): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        begin(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): VectorReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): VectorReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        size(): number;
+        /**
+         * @inheritdoc
+         */
+        capacity(): number;
+        /**
+         * @inheritdoc
+         */
+        empty(): boolean;
+        /**
+         * @inheritdoc
+         */
+        at(index: number): T;
+        /**
+         * @inheritdoc
+         */
+        set(index: number, val: T): T;
+        /**
+         * @inheritdoc
+         */
+        front(): T;
+        /**
+         * @inheritdoc
+         */
+        back(): T;
+        /**
+         * @inheritdoc
+         */
+        push_back(val: T): void;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
+         * <i>position</i>, effectively increasing the container size by one. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Position in the {@link Vector} where the new element is inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param val Value to be copied to the inserted element.
+         *
+         * @return An iterator that points to the newly inserted element.
+         */
+        insert(position: VectorIterator<T>, val: T): VectorIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
+         * @param val Value to be copied (or moved) to the inserted elements.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
+         * iterators. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorIterator<T>, begin: InputIterator, end: InputIterator): VectorIterator<T>;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
+         * <i>position</i>, effectively increasing the container size by one. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Position in the {@link Vector} where the new element is inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param val Value to be copied to the inserted element.
+         *
+         * @return An iterator that points to the newly inserted element.
+         */
+        insert(position: VectorReverseIterator<T>, val: T): VectorReverseIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
+         * @param val Value to be copied (or moved) to the inserted elements.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: VectorReverseIterator<T>, n: number, val: T): VectorReverseIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
+         * iterators. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorReverseIterator<T>, begin: InputIterator, end: InputIterator): VectorReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        private insert_by_val(position, val);
+        /**
+         * @hidden
+         */
+        protected insert_by_repeating_val(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<InputIterator extends Iterator<T>>(position: VectorIterator<T>, first: InputIterator, last: InputIterator): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        pop_back(): void;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(position: VectorIterator<T>): VectorIterator<T>;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(position: VectorReverseIterator<T>): VectorReverseIterator<T>;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(first: VectorReverseIterator<T>, last: VectorReverseIterator<T>): VectorReverseIterator<T>;
+        /**
+         * @hiddde
+         */
+        protected erase_by_range(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.IContainer<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> An iterator of Vector. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class VectorIterator<T> extends Iterator<T> implements base.IArrayIterator<T> {
+        /**
+         * Sequence number of iterator in the source {@link Vector}.
+         */
+        private index_;
+        /**
+         * <p> Construct from the source {@link Vector container}. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Do not create the iterator directly, by yourself. </p>
+         * <p> Use {@link Vector.begin begin()}, {@link Vector.end end()} in {@link Vector container} instead. </p>
+         *
+         * @param source The source {@link Vector container} to reference.
+         * @param index Sequence number of the element in the source {@link Vector}.
+         */
+        constructor(source: Vector<T>, index: number);
+        /**
+         * @hidden
+         */
+        private vector;
+        /**
+         * @inheritdoc
+         */
+        /**
+         * Set value.
+         */
+        value: T;
+        /**
+         * Get index.
+         */
+        index: number;
+        /**
+         * @inheritdoc
+         */
+        prev(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        next(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        advance(n: number): VectorIterator<T>;
+        /**
+         * <p> Whether an iterator is equal with the iterator. </p>
+         *
+         * <p> Compare two iterators and returns whether they are equal or not. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Iterator's equal_to() only compare souce container and index number. </p>
+         *
+         * <p> Although elements in a pair, key and value are equal_to, if the source map or
+         * index number is different, then the {@link equal_to equal_to()} will return false. If you want to
+         * compare the elements of a pair, compare them directly by yourself. </p>
+         *
+         * @param obj An iterator to compare
+         * @return Indicates whether equal or not.
+         */
+        equal_to<U extends T>(obj: VectorIterator<U>): boolean;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: VectorIterator<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> A reverse-iterator of Vector. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class VectorReverseIterator<T> extends ReverseIterator<T, VectorIterator<T>, VectorReverseIterator<T>> implements base.IArrayIterator<T> {
+        constructor(base: VectorIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        protected create_neighbor(): VectorReverseIterator<T>;
+        /**
+         * Set value.
+         */
+        value: T;
+        /**
+         * Get index.
+         */
+        index: number;
+    }
 }
 declare namespace std.base {
     /**
@@ -9189,18 +10469,17 @@ declare namespace std.base {
     }
 }
 declare namespace std.base {
-    const MIN_SIZE: number;
-    const RATIO: number;
-    const MAX_RATIO: number;
-    function code(par: any): number;
-}
-declare namespace std.base {
+    enum Hash {
+        MIN_SIZE = 10,
+        RATIO = 1,
+        MAX_RATIO = 2,
+    }
     /**
      * <p> Hask buckets. </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
-    abstract class HashBuckets<T> {
+    class HashBuckets<T> {
         private buckets_;
         private item_size_;
         /**
@@ -9208,14 +10487,21 @@ declare namespace std.base {
          */
         constructor();
         /**
-         * Reserve the bucket size.
+         * <p> Reconstruction of hash table. </p>
          *
-         * @param size Number of bucket size to reserve.
+         * <p> All the elements in the hash buckets are rearranged according to their hash value into the new set of
+         * buckets. This may alter the order of iteration of elements within the container. </p>
+         *
+         * <p> Notice that {@link rehash rehashes} are automatically performed whenever its number of elements is going
+         * to greater than its own {@link capacity}. </p>
+         *
+         * @param size Number of bucket size to rehash.
          */
-        reserve(size: number): void;
+        rehash(size: number): void;
         clear(): void;
         size(): number;
         item_size(): number;
+        capacity(): number;
         at(index: number): Vector<T>;
         hash_index(val: T): number;
         insert(val: T): void;
@@ -9830,6 +11116,9 @@ declare namespace std.base {
         uncle: XTreeNode<T>;
     }
 }
+declare namespace std.example {
+    function test_all(): void;
+}
 declare namespace std.example {
     function test_bind(): void;
 }

From d28aa3ff18d8e0e9485dc70c0eba72fb365366f4 Mon Sep 17 00:00:00 2001
From: chrisdrobison <chrisdrobison@gmail.com>
Date: Sat, 18 Jun 2016 11:18:02 -0600
Subject: [PATCH 115/278] Adding missing documented method (#7659)

* Adding missing documented method

* Fixing missing return type
---
 kendo-ui/kendo-ui.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/kendo-ui/kendo-ui.d.ts b/kendo-ui/kendo-ui.d.ts
index b283f21c14..29cb1527d6 100644
--- a/kendo-ui/kendo-ui.d.ts
+++ b/kendo-ui/kendo-ui.d.ts
@@ -1282,6 +1282,7 @@ declare namespace kendo.data {
 
     interface DataSourceRequestStartEvent extends DataSourceEvent {
         type?: string;
+        preventDefault(): void;
     }
 
     interface DataSourceRequestEndEvent extends DataSourceEvent {

From 0f5d541ed332eb6165e1d6488a900c1bac0c3da8 Mon Sep 17 00:00:00 2001
From: igrayson <igrayson@users.noreply.github.com>
Date: Sat, 18 Jun 2016 10:21:17 -0700
Subject: [PATCH 116/278] Create sinon-as-promised.d.ts (#9638)

* Create sinon-as-promised.d.ts

* Rename sinon-as-promised reject parameter
---
 sinon-as-promised/sinon-as-promised-tests.ts | 11 ++++++++++
 sinon-as-promised/sinon-as-promised.d.ts     | 23 ++++++++++++++++++++
 2 files changed, 34 insertions(+)
 create mode 100644 sinon-as-promised/sinon-as-promised-tests.ts
 create mode 100644 sinon-as-promised/sinon-as-promised.d.ts

diff --git a/sinon-as-promised/sinon-as-promised-tests.ts b/sinon-as-promised/sinon-as-promised-tests.ts
new file mode 100644
index 0000000000..97ff6aaa3c
--- /dev/null
+++ b/sinon-as-promised/sinon-as-promised-tests.ts
@@ -0,0 +1,11 @@
+/// <reference path="sinon-as-promised.d.ts"/>
+function testResolve() {
+    sinon.stub().resolves('test val');
+}
+
+function testReject() {
+    sinon.stub().rejects('test val');
+}
+
+testResolve();
+testReject();
diff --git a/sinon-as-promised/sinon-as-promised.d.ts b/sinon-as-promised/sinon-as-promised.d.ts
new file mode 100644
index 0000000000..3a214ea254
--- /dev/null
+++ b/sinon-as-promised/sinon-as-promised.d.ts
@@ -0,0 +1,23 @@
+// Type definitions for sinon-as-promised v4.0.0
+// Project: https://github.com/bendrucker/sinon-as-promised
+// Definitions by: igrayson <https://github.com/igrayson>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../sinon/sinon.d.ts"/>
+
+declare namespace Sinon {
+
+  export interface SinonStub {
+
+    /**
+     * When called, the stub will return a "thenable" object which will return a promise for the provided value. Any Promises/A+ compliant library will handle this object properly.
+     */
+    resolves(value:any):SinonStub;
+
+    /**
+     * When called, the stub will return a thenable which will return a reject promise with the provided err. If err is a string, it will be set as the message on an Error object.
+     */
+    rejects(err:any):SinonStub;
+  } 
+
+}

From 203dd22f97e219f0aa374902280e6a8c775fcd99 Mon Sep 17 00:00:00 2001
From: Linda_pp <rhysd@users.noreply.github.com>
Date: Sun, 19 Jun 2016 02:47:30 +0900
Subject: [PATCH 117/278] Added 'why-did-you-update' package (#9629)

* Add 'why-did-you-update' package

* Add reference magic comments to test code
---
 why-did-you-update/why-did-you-update-tests.ts |  8 ++++++++
 why-did-you-update/why-did-you-update.d.ts     | 15 +++++++++++++++
 2 files changed, 23 insertions(+)
 create mode 100644 why-did-you-update/why-did-you-update-tests.ts
 create mode 100644 why-did-you-update/why-did-you-update.d.ts

diff --git a/why-did-you-update/why-did-you-update-tests.ts b/why-did-you-update/why-did-you-update-tests.ts
new file mode 100644
index 0000000000..7c8432d61c
--- /dev/null
+++ b/why-did-you-update/why-did-you-update-tests.ts
@@ -0,0 +1,8 @@
+/// <reference path="./why-did-you-update.d.ts" />
+/// <reference path="../react/react.d.ts" />
+
+import * as React from "react";
+import {whyDidYouUpdate} from "why-did-you-update";
+
+whyDidYouUpdate(React);
+whyDidYouUpdate(React, { include: /^pure/, exclude: /^Connect/ });
diff --git a/why-did-you-update/why-did-you-update.d.ts b/why-did-you-update/why-did-you-update.d.ts
new file mode 100644
index 0000000000..da94eddb3e
--- /dev/null
+++ b/why-did-you-update/why-did-you-update.d.ts
@@ -0,0 +1,15 @@
+// Type definitions for why-did-you-update v0.0.8
+// Project: https://github.com/garbles/why-did-you-update
+// Definitions by: rhysd <https://rhysd.github.io>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../react/react.d.ts" />
+
+declare module "why-did-you-update" {
+	interface Options {
+		include?: RegExp;
+		exclude?: RegExp;
+	}
+	export function whyDidYouUpdate(react: typeof __React, options?: Options): void;
+}
+

From ab57e0e0a39e05b8c4fa637b99b2d94db82eac2d Mon Sep 17 00:00:00 2001
From: Chintan Shah <chintans@users.noreply.github.com>
Date: Sat, 18 Jun 2016 23:20:59 +0530
Subject: [PATCH 118/278] Updated version to 1.3.8 and added destroy property.
 Updated documentation to follow ts documentation guide. (#9643)

---
 jquery.slimScroll/jquery.SlimScroll-tests.ts |  17 +++-
 jquery.slimScroll/jquery.slimScroll.d.ts     | 102 ++++++++++++++-----
 2 files changed, 93 insertions(+), 26 deletions(-)

diff --git a/jquery.slimScroll/jquery.SlimScroll-tests.ts b/jquery.slimScroll/jquery.SlimScroll-tests.ts
index deb4f2406d..046eda840f 100644
--- a/jquery.slimScroll/jquery.SlimScroll-tests.ts
+++ b/jquery.slimScroll/jquery.SlimScroll-tests.ts
@@ -41,6 +41,21 @@ $('#slimtest3').slimScroll({
     alwaysVisible: true
 });
 
+$('#slimtest3').slimScroll({
+    color: '#00f',
+    size: '10px',
+    height: '180px',
+    alwaysVisible: true,
+    destroy: true
+});
+
 $("div").slimScroll().bind('slimscroll', function(e){
     console.log("Reached " + e);
-});
\ No newline at end of file
+});
+
+var options : IJQuerySlimScrollOptions = {
+    destroy: true,
+    position: 'left'
+};
+
+$('#slimtest3').slimScroll(options);
diff --git a/jquery.slimScroll/jquery.slimScroll.d.ts b/jquery.slimScroll/jquery.slimScroll.d.ts
index 4d77d28817..b5d3dab17f 100644
--- a/jquery.slimScroll/jquery.slimScroll.d.ts
+++ b/jquery.slimScroll/jquery.slimScroll.d.ts
@@ -1,58 +1,110 @@
-// Type definitions for jQuery.slimScroll v1.3.3
+// Type definitions for jQuery.slimScroll v1.3.8
 // Project: https://github.com/rochal/jQuery-slimScroll
 // Definitions by: Chintan Shah <https://github.com/Promact>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 /// <reference path="../jquery/jquery.d.ts"/>
 
 interface IJQuerySlimScrollOptions {
-    // width in pixels of the visible scroll area
+    /**
+     * width in pixels of the visible scroll area
+     */
     width? :string;
-    // height in pixels of the visible scroll area
+    /**
+     * height in pixels of the visible scroll area
+     */
     height? :string;
-    // width in pixels of the scrollbar and rail
+    /**
+     * width in pixels of the scrollbar and rail
+     */
     size? :string;
-    // scrollbar color, accepts any hex/color value
+    /**
+     * scrollbar color, accepts any hex/color value
+     */
     color?:string;
-    // scrollbar position - left/right
+    /**
+     * scrollbar position - left/right
+     */
     position?:string;
-    // distance in pixels between the side edge and the scrollbar
+    /**
+     * distance in pixels between the side edge and the scrollbar
+     */
     distance?:string;
-    // default scroll position on load - top / bottom / $('selector')
+    /**
+     * default scroll position on load - top / bottom / $('selector')
+     */
     start?:any;
-    // sets scrollbar opacity
+    /**
+     * sets scrollbar opacity
+     */
     opacity? :number;
-    // enables always-on mode for the scrollbar
+    /**
+     * enables always-on mode for the scrollbar
+     */
     alwaysVisible?: boolean;
-    // check if we should hide the scrollbar when user is hovering over
+    /**
+     * check if we should hide the scrollbar when user is hovering over
+     */
     disableFadeOut?: boolean;
-    // sets visibility of the rail
+    /**
+     * sets visibility of the rail
+     */
     railVisible?: boolean;
-    // sets rail color
+    /**
+     * sets rail color
+     */
     railColor?: string;
-    // sets rail opacity
+    /**
+     * sets rail opacity
+     */
     railOpacity?:number;
-    // whether  we should use jQuery UI Draggable to enable bar dragging
+    /**
+     * whether  we should use jQuery UI Draggable to enable bar dragging
+     */
     railDraggable?: boolean;
-    // defautlt CSS class of the slimscroll rail
+    /**
+     * default CSS class of the slimscroll rail
+     */
     railClass?: string;
-    // defautlt CSS class of the slimscroll bar
+    /**
+     * default CSS class of the slimscroll bar
+     */
     barClass?: string;
-    // defautlt CSS class of the slimscroll wrapper
+    /**
+     * default CSS class of the slimscroll wrapper
+     */
     wrapperClass?: string;
-    // check if mousewheel should scroll the window if we reach top/bottom
+    /**
+     * check if mousewheel should scroll the window if we reach top/bottom
+     */
     allowPageScroll?: boolean;
-    // scroll amount applied to each mouse wheel step
+    /**
+     * scroll amount applied to each mouse wheel step
+     */
     wheelStep?: number;
-    // scroll amount applied when user is using gestures
+    /**
+     * scroll amount applied when user is using gestures
+     */
     touchScrollStep?: number;
-    // sets border radius
+    /**
+     * sets border radius
+     */
     borderRadius?: string;
-    // sets border radius of the rail
+    /**
+     * sets border radius of the rail
+     */
     railBorderRadius?: string;
-    // jumps to the specified scroll value
+    /**
+     * jumps to the specified scroll value
+     */
     scrollTo?: string;
-    // increases/decreases current scroll value by specified amount
+    /**
+     * increases/decreases current scroll value by specified amount
+     */
     scrollBy?: string;
+    /**
+     * release resources held by the plugin
+     */
+    destroy?:boolean;
 }
 
 interface JQuery {

From 7f27d319da3bf08429b2b2bb017091d14e7b9046 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jan=20=C5=BD=C3=A1k?= <zj@zakjan.cz>
Date: Sat, 18 Jun 2016 21:53:57 +0400
Subject: [PATCH 119/278] Update heatmap.js typings - valueField is not
 required (#9644)

---
 heatmap.js/heatmap.d.ts | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/heatmap.js/heatmap.d.ts b/heatmap.js/heatmap.d.ts
index 3a0bd2ba08..7cd14fc214 100644
--- a/heatmap.js/heatmap.d.ts
+++ b/heatmap.js/heatmap.d.ts
@@ -77,8 +77,9 @@ interface HeatmapConfiguration {
 
     /*
      * The property name of the value/weight in a datapoint
+     * Default value: 'value'
      */
-    valueField: string;
+    valueField?: string;
 }
 
 /*

From 04afc82c84e4517cc0827f4451f09c7e7d752440 Mon Sep 17 00:00:00 2001
From: Tim Barclay <timrbarclay@gmail.com>
Date: Sat, 18 Jun 2016 18:54:20 +0100
Subject: [PATCH 120/278] Add exported middleware handler to request-ip
 declaration (#9647)

---
 request-ip/request-ip-tests.ts | 4 ++++
 request-ip/request-ip.d.ts     | 6 ++++++
 2 files changed, 10 insertions(+)

diff --git a/request-ip/request-ip-tests.ts b/request-ip/request-ip-tests.ts
index 8c5111e331..a4bf5f96d6 100644
--- a/request-ip/request-ip-tests.ts
+++ b/request-ip/request-ip-tests.ts
@@ -4,6 +4,10 @@
 import express = require('express');
 import requestIp = require('request-ip');
 
+var app = express();
+
+app.use(requestIp.mw());
+
 var ipMiddleware = function(req:express.Request, res:express.Response, next:Function) {
     var clientIp = requestIp.getClientIp(req);
     next();
diff --git a/request-ip/request-ip.d.ts b/request-ip/request-ip.d.ts
index 11ed21d63a..6dbff54d6b 100644
--- a/request-ip/request-ip.d.ts
+++ b/request-ip/request-ip.d.ts
@@ -28,5 +28,11 @@ declare module "request-ip" {
         };
     }
 
+    interface Options {
+        attributeName: string;
+    }
+
     export function getClientIp(req:Request):string;
+
+    export function mw(options?: Options): (req: Request, res: any, next: any) => any;
 }

From 40b735e3b179b263192e8e81f0c1202b4a47707b Mon Sep 17 00:00:00 2001
From: IvanKozlov95 <ikozlov9000@gmail.com>
Date: Sat, 18 Jun 2016 20:54:46 +0300
Subject: [PATCH 121/278] Added NabigationBarMode to MapOtpions and setMap
 method to InfoBox (#9623)

---
 bingmaps/Microsoft.Maps.d.ts | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/bingmaps/Microsoft.Maps.d.ts b/bingmaps/Microsoft.Maps.d.ts
index 95e39a043e..1e7e464930 100644
--- a/bingmaps/Microsoft.Maps.d.ts
+++ b/bingmaps/Microsoft.Maps.d.ts
@@ -174,6 +174,7 @@ declare namespace Microsoft.Maps {
         fixedMapPosition?: boolean;
         height?: number;
         inertiaIntensity?: number;
+        navigationBarMode?: number;
         showBreadcrumb?: boolean;
         showCopyright?: boolean;
         showDashboard?: boolean;
@@ -216,6 +217,12 @@ declare namespace Microsoft.Maps {
         getY(): number;
     }
 
+    export enum NavigationBarMode {
+        default,
+        compact,
+        minified
+    }
+
     export enum PixelReference {
         control,
         page,
@@ -307,6 +314,7 @@ declare namespace Microsoft.Maps {
         getZIndex(): number;
         setHtmlContent(content: string): void;
         setLocation(location: Location): void;
+        setMap(map: Map): void;
         setOptions(options: InfoboxOptions): void;
         toString(): string;
     }

From a1c646f26aa7cf3d170b85e938fffde23bd4c7af Mon Sep 17 00:00:00 2001
From: Thomas Townsend <thomas.haakon@gmail.com>
Date: Sat, 18 Jun 2016 19:55:31 +0200
Subject: [PATCH 122/278] Update flux typings (#9592)

* Make fbemitter a namespace

* Tighten up typing of flux

* Update flux tests

* Address code comments

* Fix RealOptions interface
---
 fbemitter/fbemitter.d.ts |  8 +++++--
 flux/flux-tests.ts       |  6 ++---
 flux/flux.d.ts           | 48 +++++++++++++++++++++++++++++-----------
 3 files changed, 44 insertions(+), 18 deletions(-)

diff --git a/fbemitter/fbemitter.d.ts b/fbemitter/fbemitter.d.ts
index b26b1a3162..0f5f6af528 100644
--- a/fbemitter/fbemitter.d.ts
+++ b/fbemitter/fbemitter.d.ts
@@ -3,7 +3,7 @@
 // Definitions by: kmxz <https://github.com/kmxz>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-declare module 'fbemitter' {
+declare namespace FBEmitter {
     
     export class EventSubscription {
         
@@ -64,4 +64,8 @@ declare module 'fbemitter' {
          
     }
     
-}
\ No newline at end of file
+}
+
+declare module 'fbemitter' {
+    export = FBEmitter;
+}
diff --git a/flux/flux-tests.ts b/flux/flux-tests.ts
index 24369ef2dd..6bb4350dc6 100644
--- a/flux/flux-tests.ts
+++ b/flux/flux-tests.ts
@@ -1,5 +1,5 @@
 /// <reference path="flux.d.ts" />
-/// <reference path="../react/react.d.ts" />
+/// <reference path="../react/react.d.ts" />
 
 import flux = require('flux')
 import FluxUtils = require('flux/utils')
@@ -88,7 +88,7 @@ export = customDispatcher
 
 
 // Sample Reduce Store
-class CounterStore extends FluxUtils.ReduceStore<number> {
+class CounterStore extends FluxUtils.ReduceStore<number, Action> {
   getInitialState(): number {
     return 0;
   }
@@ -126,4 +126,4 @@ class CounterContainer extends Component<any, any> {
   }
 }
 
-const container = Container.create(CounterContainer);
+const container = Container.create<CounterContainer>(CounterContainer);
diff --git a/flux/flux.d.ts b/flux/flux.d.ts
index 944d23b011..944aa54f3a 100644
--- a/flux/flux.d.ts
+++ b/flux/flux.d.ts
@@ -4,6 +4,8 @@
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 /// <reference path="../react/react.d.ts" />
+/// <reference path="../fbemitter/fbemitter.d.ts" />
+/// <reference path="../immutable/immutable.d.ts" />
 
 declare namespace Flux {
 
@@ -71,6 +73,29 @@ declare module "flux" {
 declare namespace FluxUtils {
 
     import React = __React;
+    import fbEmitter = FBEmitter;
+    import immutable = Immutable;
+    
+    /**
+     * Default options to create a Container with
+     * 
+     * @interface RealOptions
+     */
+    interface RealOptions {
+        /**
+         * Default value: true
+         * 
+         * @type {boolean}
+         */
+        pure?: boolean;
+        /**
+         * Default value: false
+         * 
+         * @type {boolean}
+         */
+        withProps?: boolean;
+    }
+    
     export class Container {
         constructor();
         /**
@@ -78,14 +103,13 @@ declare namespace FluxUtils {
         * that updates its state when relevant stores change.
         * The provided base class must have static methods getStores() and calculateState().
         */
-        static create(base: React.ComponentClass<any>, options?: any): React.ComponentClass<any>;
+        static create<TComponent>(base: React.ComponentClass<TComponent>, options?: RealOptions): React.ComponentClass<TComponent>;
     }
 
     /**
     * This class extends ReduceStore and defines the state as an immutable map.
     */
-    // TODO: Change <any>  to <Immutable.Map<K, V>>
-    export class MapStore<K extends string | number, V> extends ReduceStore<any> {
+    export class MapStore<K extends string | number, V, TPayload> extends ReduceStore<immutable.Map<K, V>, TPayload> {
         /**
         * Access the value at the given key.
         * Throws an error if the key does not exist in the cache.
@@ -108,12 +132,10 @@ declare namespace FluxUtils {
         * it allows providing a previous result to update instead of generating a new map.
         * Providing a previous result allows the possibility of keeping the same reference if the keys did not change.
         */
-        // TODO: Update with Immutable interface.
-        // getAll(keys: Immutable.IndexedIterable<K>, prev?: Immutable.Map<K, V>): Immutable.Map<K, V>;
-        getAll(keys: any, prev?: any): any;
+        getAll(keys: immutable.Iterable.Indexed<K>, prev?: immutable.Map<K, V>): immutable.Map<K, V>;
     }
 
-    export class ReduceStore<T> extends Store {
+    export class ReduceStore<T, TPayload> extends Store<TPayload> {
         /**
         * Getter that exposes the entire state of this store.
         * If your state is not immutable you should override this and not expose state directly.
@@ -131,7 +153,7 @@ declare namespace FluxUtils {
         * All subclasses must implement this method.
         * This method should be pure and have no side-effects.
         */
-        reduce(state: T, action: any): T;
+        reduce(state: T, action: TPayload): T;
 
         /**
         * Checks if two versions of state are the same.
@@ -141,24 +163,24 @@ declare namespace FluxUtils {
 
     }
 
-    export class Store {
+    export class Store<TPayload> {
 
         /**
         * Constructs and registers an instance of this store with the given dispatcher.
         */
-        constructor(dispatcher: Flux.Dispatcher<any>);
+        constructor(dispatcher: Flux.Dispatcher<TPayload>);
 
         /**
         * Adds a listener to the store, when the store changes the given callback will be called.
         * A token is returned that can be used to remove the listener.
         * Calling the remove() function on the returned token will remove the listener.
         */
-        addListener(callback: Function): { remove: Function };
+        addListener(callback: Function): fbEmitter.EventSubscription;
 
         /**
         * Returns the dispatcher this store is registered with.
         */
-        getDispatcher(): Flux.Dispatcher<any>;
+        getDispatcher(): Flux.Dispatcher<TPayload>;
 
         /**
         * Returns the dispatch token that the dispatcher recognizes this store by.
@@ -185,7 +207,7 @@ declare namespace FluxUtils {
         * This is how the store receives actions from the dispatcher.
         * All state mutation logic must be done during this method.
         */
-        __onDispatch(payload: any): void;
+        __onDispatch(payload: TPayload): void;
     }
 }
 

From fe8dc9ea05a1553af9584089903975b53dce398b Mon Sep 17 00:00:00 2001
From: dutchmega <robbie.groenewoudt@gmail.com>
Date: Sat, 18 Jun 2016 19:56:09 +0200
Subject: [PATCH 123/278] Fix AngularJS IComponentOptions.require signature
 (#9605)

* Fix AngularJS IComponentOptions.require signature.

* Fix AngularJS test.
---
 angularjs/angular-tests.ts | 2 +-
 angularjs/angular.d.ts     | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/angularjs/angular-tests.ts b/angularjs/angular-tests.ts
index c804519727..7eaf0be763 100644
--- a/angularjs/angular-tests.ts
+++ b/angularjs/angular-tests.ts
@@ -869,7 +869,7 @@ angular.module('docsTabsExample', [])
 
 angular.module('componentExample', [])
     .component('counter', {
-        require: ['^ctrl'],
+        require: {'ctrl': '^ctrl'},
         bindings: {
             count: '='
         },
diff --git a/angularjs/angular.d.ts b/angularjs/angular.d.ts
index 94d6678a24..4c99e6661b 100644
--- a/angularjs/angular.d.ts
+++ b/angularjs/angular.d.ts
@@ -1716,7 +1716,7 @@ declare namespace angular {
          * Whether transclusion is enabled. Enabled by default.
          */
         transclude?: boolean | string | {[slot: string]: string};
-        require?: string | string[] | {[controller: string]: string};
+        require?: {[controller: string]: string};
     }
 
     interface IComponentTemplateFn {

From c02b03f677ca88e364cfda5308c58d0832664581 Mon Sep 17 00:00:00 2001
From: Dennis <davh@davh.dk>
Date: Sun, 19 Jun 2016 00:56:31 +0700
Subject: [PATCH 124/278] Massive update to match the actual 2.1.1 release
 (#9613)

* Massive update to match the actual 2.1.1 release

* Fix jquery usage
---
 knockout.kogrid/ko-grid.d.ts | 349 +++++++++++++++++++++--------------
 1 file changed, 213 insertions(+), 136 deletions(-)

diff --git a/knockout.kogrid/ko-grid.d.ts b/knockout.kogrid/ko-grid.d.ts
index fe9877e038..a8f3984acf 100644
--- a/knockout.kogrid/ko-grid.d.ts
+++ b/knockout.kogrid/ko-grid.d.ts
@@ -6,192 +6,270 @@
 // These are very definitely preliminary. Please feel free to improve.
 
 /// <reference path="../knockout/knockout.d.ts" />
+/// <reference path="../jquery/jquery.d.ts" />
 
 declare namespace kg {
-    interface DomUtilityService {
-        UpdateGridLayout(grid: Grid<any>): void;
-        BuildStyles(grid: Grid<any>): void;
-    }
+   interface DomUtilityService {
+      UpdateGridLayout(grid: Grid<any>): void;
+      BuildStyles(grid: Grid<any>): void;
+   }
 
-    interface Row<EntityType> {
-        selected: KnockoutObservable<boolean>;
-        entity: EntityType;
-    }
+   interface Row<EntityType> {
+      selected: KnockoutObservable<boolean>;
+      entity: EntityType;
+   }
 
-    interface RowFactory<EntityType> {
-        rowCache: Row<EntityType>[];
-    }
+   interface RowFactory<EntityType> {
+      rowCache: Row<EntityType>[];
+   }
 
-    interface SelectionService<EntityType>  {
-        setSelection(row: Row<EntityType>, selected: boolean): void;
-        multi: boolean;
-        lastClickedRow: Row<EntityType>;
-    }
+   interface SelectionService<EntityType> {
+      setSelection(row: Row<EntityType>, selected: boolean): void;
+      multi: boolean;
+      lastClickedRow: Row<EntityType>;
+   }
 
-    interface Grid<EntityType> {
-        configureColumnWidths(): void;
-        rowFactory: RowFactory<EntityType>;
-        config: GridOptions<EntityType>;
-        $$selectionPhase: boolean;
-        selectionService: SelectionService<EntityType>;
-    }
+   interface Grid<EntityType> {
+      configureColumnWidths(): void;
+      rowFactory: RowFactory<EntityType>;
+      config: GridOptions<EntityType>;
+      $$selectionPhase: boolean;
+      selectionService: SelectionService<EntityType>;
+   }
 
-    interface Plugin<EntityType> {
-        onGridInit(grid: Grid<EntityType>): void;
-    }
+   interface Plugin<EntityType> {
+      onGridInit(grid: Grid<EntityType>): void;
+   }
 
-    interface GridOptions<EntityType> {
-        /** Callback for when you want to validate something after selection. */
-        afterSelectionChange?(row: Row<EntityType>): void;
+   interface GridOptions<EntityType> {
+      /** Callback for when you want to validate something after selection. */
+      afterSelectionChange?(row: Row<EntityType>): void;
 
-        /** Callback if you want to inspect something before selection,
-        return false if you want to cancel the selection. return true otherwise.
-        If you need to wait for an async call to proceed with selection you can
-        use rowItem.changeSelection(event) method after returning false initially.
-        Note: when shift+ Selecting multiple items in the grid this will only get called
-        once and the rowItem will be an array of items that are queued to be selected. */
-        beforeSelectionChange?: Function;
+      /** Callback if you want to inspect something before selection,
+      return false if you want to cancel the selection. return true otherwise.
+      If you need to wait for an async call to proceed with selection you can
+      use rowItem.changeSelection(event) method after returning false initially.
+      Note: when shift+ Selecting multiple items in the grid this will only get called
+      once and the rowItem will be an array of items that are queued to be selected. */
+      beforeSelectionChange?(row: Row<EntityType>): boolean;
 
-        /** definitions of columns as an array [], if not defined columns are auto-generated. See github wiki for more details. */
-        columnDefs?: ColumnDef[];
+      /** To be able to have selectable rows in grid. */
+      canSelectRows?:boolean;
 
-        /** Column width of columns in grid. */
-        columnWidth?: number;
+      /** definitions of columns as an array [], if not defined columns are auto-generated. See github wiki for more details. */
+      columnDefs?: ColumnDef[] | KnockoutObservable<ColumnDef[]>;
 
-        /** Data being displayed in the grid. Each item in the array is mapped to a row being displayed. */
-        data?: KnockoutObservableArray<EntityType>;
+      /** Column width of columns in grid. */
+      columnWidth?: number;
 
-        /** Row selection check boxes appear as the first column. */
-        displaySelectionCheckbox: boolean;
+      /** Data being displayed in the grid. Each item in the array is mapped to a row being displayed. */
+      data?: KnockoutObservableArray<EntityType>;
 
-        /** Enable or disable resizing of columns */
-        enableColumnResize?: boolean;
+      /** Row selection check boxes appear as the first column. */
+      displaySelectionCheckbox: boolean;
 
-        /** Enables the server-side paging feature */
-        enablePaging?: boolean;
+      /** Enable or disable resizing of columns */
+      enableColumnResize?: boolean;
 
-        /** Enable column pinning */
-        enablePinning?: boolean;
+      /** Enables the server-side paging feature */
+      enablePaging?: boolean;
 
-        /** Enable drag and drop row reordering. Only works in HTML5 compliant browsers. */
-        enableRowReordering?: boolean;
+      /** Enable drag and drop row reordering. Only works in HTML5 compliant browsers. */
+      enableRowReordering?: boolean;
 
-        /** To be able to have selectable rows in grid. */
-        enableRowSelection?: boolean;
+      /** Enables or disables sorting in grid. */
+      enableSorting?: boolean;
 
-        /** Enables or disables sorting in grid. */
-        enableSorting?: boolean;
+      /** filterOptions -
+      filterText: The text bound to the built-in search box.
+      useExternalFilter: Bypass internal filtering if you want to roll your own filtering mechanism but want to use builtin search box.
+      */
+      filterOptions?: FilterOptions;
 
-        /** filterOptions -
-        filterText: The text bound to the built-in search box.
-        useExternalFilter: Bypass internal filtering if you want to roll your own filtering mechanism but want to use builtin search box.
-        */
-        filterOptions?: FilterOptions;
+      /** Defining the height of the footer in pixels. */
+      footerRowHeight?: number;
 
-        /** Defining the height of the footer in pixels. */
-        footerRowHeight?: number;
+      /** Show or hide the footer alltogether the footer is enabled by default */
+      footerVisible?: boolean;
 
-        /** Show or hide the footer alltogether the footer is enabled by default */
-        footerVisible?: boolean;
+      /** Initial fields to group data by. Array of field names, not displayName. */
+      groups?: string[];
 
-        /** Initial fields to group data by. Array of field names, not displayName. */
-        groups?: string[];
+      /** The height of the header row in pixels. */
+      headerRowHeight?: number;
 
-        /** The height of the header row in pixels. */
-        headerRowHeight?: number;
+      /** Define a header row template for further customization. See github wiki for more details. */
+      headerRowTemplate?: string | JQueryGenericPromise<string>;
 
-        /** Define a header row template for further customization. See github wiki for more details. */
-        headerRowTemplate?: any;
+      /** Enables the use of jquery UI reaggable/droppable plugin. requires jqueryUI to work if enabled.
+      Useful if you want drag + drop but your users insist on crappy browsers. */
+      jqueryUIDraggable?: boolean;
 
-        /** Enables the use of jquery UI reaggable/droppable plugin. requires jqueryUI to work if enabled.
-        Useful if you want drag + drop but your users insist on crappy browsers. */
-        jqueryUIDraggable?: boolean;
+      /** Enable the use jqueryUIThemes */
+      jqueryUITheme?: boolean;
 
-        /** Enable the use jqueryUIThemes */
-        jqueryUITheme?: boolean;
+      /** Prevent unselections when in single selection mode. */
+      keepLastSelected?: boolean;
 
-        /** Prevent unselections when in single selection mode. */
-        keepLastSelected?: boolean;
+      /** Maintains the column widths while resizing.
+      Defaults to true when using *'s or undefined widths. Can be ovverriden by setting to false. */
+      maintainColumnRatios?: any;
 
-        /** Maintains the column widths while resizing.
-        Defaults to true when using *'s or undefined widths. Can be ovverriden by setting to false. */
-        maintainColumnRatios?: any;
+      /** Set this to false if you only want one item selected at a time */
+      multiSelect?: boolean;
 
-        /** Set this to false if you only want one item selected at a time */
-        multiSelect?: boolean;
+      /**  pagingOptions - */
+      pagingOptions?: PagingOptions;
 
-        /**  pagingOptions - */
-        pagingOptions?: PagingOptions;
+      /** Array of plugin functions to register in ng-grid */
+      plugins?: Plugin<EntityType>[];
 
-        /** Array of plugin functions to register in ng-grid */
-        plugins?: Plugin<EntityType>[];
+      /** Row height of rows in grid. */
+      rowHeight?: number;
 
-        /** Row height of rows in grid. */
-        rowHeight?: number;
+      /** Define a row template to customize output. See github wiki for more details. */
+      rowTemplate?: string | JQueryGenericPromise<string>;
 
-        /** Define a row template to customize output. See github wiki for more details. */
-        rowTemplate?: any;
+      /** Defines the binding to select all at once */
+      selectAllState?: KnockoutObservable<boolean>;
 
-        /** all of the items selected in the grid. In single select mode there will only be one item in the array. */
-        selectedItems?: KnockoutObservableArray<any>;
+      /** all of the items selected in the grid. In single select mode there will only be one item in the array. */
+      selectedItems?: KnockoutObservableArray<any>;
 
-        /** Disable row selections by clicking on the row and only when the checkbox is clicked. */
-        selectWithCheckboxOnly?: boolean;
+      /** Disable row selections by clicking on the row and only when the checkbox is clicked. */
+      selectWithCheckboxOnly?: boolean;
 
-        /** Enables menu to choose which columns to display and group by.
-        If both showColumnMenu and showFilter are false the menu button will not display.*/
-        showColumnMenu?: boolean;
+      /** Enables menu to choose which columns to display and group by.
+      If both showColumnMenu and showFilter are false the menu button will not display.*/
+      showColumnMenu?: boolean;
 
-        /** Enables display of the filterbox in the column menu.
-        If both showColumnMenu and showFilter are false the menu button will not display.*/
-        showFilter?: boolean;
+      /** Enables display of the filterbox in the column menu.
+      If both showColumnMenu and showFilter are false the menu button will not display.*/
+      showFilter?: boolean;
 
-        /** Show the dropzone for drag and drop grouping */
-        showGroupPanel?: boolean;
+      /** Show the dropzone for drag and drop grouping */
+      showGroupPanel?: boolean;
 
-        /** Define a sortInfo object to specify a default sorting state.
-        You can also observe this variable to utilize server-side sorting (see useExternalSorting).
-        Syntax is sortinfo: { fields: ['fieldName1',' fieldName2'], direction: 'ASC'/'asc' || 'desc'/'DESC'}*/
-        sortInfo?: any;
+      /** Define a sortInfo object to specify a default sorting state.
+      You can also observe this variable to utilize server-side sorting (see useExternalSorting).
+      Syntax is sortinfo: { fields: ['fieldName1',' fieldName2'], direction: 'ASC'/'asc' || 'desc'/'DESC'}*/
+      sortInfo?: SortInfo | KnockoutObservable<SortInfo>;
 
-        /** Set the tab index of the Vieport. */
-        tabIndex?: number;
+      /** Set the tab index of the Vieport. */
+      tabIndex?: number;
 
-        /** Prevents the internal sorting from executing.
-        The sortInfo object will be updated with the sorting information so you can handle sorting (see sortInfo)*/
-        useExternalSorting?: boolean;
-    }
+      /** Prevents the internal sorting from executing.
+      The sortInfo object will be updated with the sorting information so you can handle sorting (see sortInfo)*/
+      useExternalSorting?: boolean;
+   }
 
-    interface ColumnDef {
-        /** The string name of the property in your data model you want that column to represent. Can also be a property path on your data model. 'foo.bar.myField', 'Name.First', etc.. */
-        field: string;
+   type Direction = "asc" | "desc";
 
-        /** Sets the pretty display name of the column. default is the field given */
-        displayName?: string;
+   interface SortInfo {
+      /** Which column to sort */
+      column: SortColumn;
 
-        /** Sets the width of the column. Can be a fixed width in pixels as an int (42), string px('42px'), percentage string ('42%'), weighted asterisks (width divided by total number of *'s is all column definition widths) See github wiki for more details. */
-        width?: string;
-    }
+      /** Which direction to sort */
+      direction: Direction;
+   }
+   
+   interface SortColumn {
+      /** The string name of the property in your data model you want that column to represent. Can also be a property path on your data model. 'foo.bar.myField', 'Name.First', etc.. */
+      field: string;
 
-    interface FilterOptions {
-        filterText?: string;
-        useExternalFilter?: boolean;
-    }
+      /** Sets the sort function for the column. Useful when you have data that is formatted in an unusal way or if you want to sort on an underlying data type. Example: function(a,b){return a > b} */
+      sortingAlgorithm?: ((a:any, b:any) => number);
+   }
 
-    interface PagingOptions {
-        /**  pageSizes: list of available page sizes.  */
-        pageSizes?: number[];
-        /** pageSize: currently selected page size.  */
-        pageSize?: number;
-        /** totalServerItems: Total items are on the server.  */
-        totalServerItems?: number;
-        /** currentPage: the uhm... current page. */
-        currentPage?: number;
-    }
+   interface ColumnDef {
+      /** Appends a css class for the column cells */
+      cellClass?:string;
+
+      /**
+       * A function which takes the value of the cell and returns the display value. Useful when your data model has an underlying value which you need to convert to a human readable format.
+       * @param val 
+       * @returns the display value
+       * @example function(unixTimeTicks) { return new Date(unixTimeTicks); }
+       */
+      cellFormatter?(val:any): string;
+
+      /**Sets the cell template for the column. See github wiki for more details.*/
+      cellTemplate?: string | JQueryGenericPromise<string>;
+
+      /** Sets the pretty display name of the column. default is the field given */
+      displayName?: string;
+
+      /** The string name of the property in your data model you want that column to represent. Can also be a property path on your data model. 'foo.bar.myField', 'Name.First', etc.. */
+      field: string;
+
+      /** Sets the template for the column header cell. See github wiki for more details. */
+      headerCellTemplate?: string | JQueryGenericPromise<string>;
+
+      /** Appends a css class for the column header. */
+      headerClass?: string;
+
+      /**Sets the maximum width of the column.*/
+      maxWidth?: number;
+
+      /**Whether or not column is resizable. */
+      resizable?: boolean;
+
+      /**Whether or not column is sortable. */
+      sortable?: boolean;
+
+      /** Sets the sort function for the column. Useful when you have data that is formatted in an unusal way or if you want to sort on an underlying data type. Example: function(a,b){return a > b} */
+      sortFn?: ((a: any, b: any) => number);
+
+      /** Sets the width of the column. Can be a fixed width in pixels as an int (42), string px('42px'), percentage string ('42%'), weighted asterisks (width divided by total number of *'s is all column definition widths) See github wiki for more details. */
+      width?: string;
+   }
+
+   interface FilterOptions {
+      /** Variable to contain the current search filter */
+      filterText?: KnockoutObservable<string>;
+
+      /** Is the filtering internal or does it require a server visit. You should subscribe to filterText to refresh */
+      useExternalFilter?: boolean;
+
+      /** Number of seconds to throttle before reapplying search */
+      filterThrottle?: number;
+   }
+
+   interface PagingOptions {
+      /**  pageSizes: list of available page sizes.  */
+      pageSizes?: KnockoutObservableArray<number>;
+
+      /** pageSize: currently selected page size.  */
+      pageSize?: KnockoutObservable<number>;
+
+      /** totalServerItems: Total items are on the server.  */
+      totalServerItems?: KnockoutObservable<number>;
+
+      /** currentPage: the uhm... current page. */
+      currentPage?: KnockoutObservable<number>;
+   }
 }
 
 interface IKg {
    domUtilityService: kg.DomUtilityService;
+
+   /** Default grid template */
+   defaultGridTemplate():string;
+
+   /** Default row template. Can be overriden in GridOptions.rowTemplate */
+   defaultRowTemplate(): string;
+
+   /** Default cell template. Can be overriden in GridOptions.cellTemplate */
+   defaultCellTemplate(): string;
+
+   /** Default aggregate template */
+   aggregateTemplate(): string;
+
+   /** Default headerrow template. Can be overriden in GridOptions.headerRowTemplate */
+   defaultHeaderRowTemplate(): string;
+
+   /** Default headercell template. Can be overriden in GridOptions.headerCellTemplate */
+   defaultHeaderCellTemplate():string;
 }
 
 declare var kg: IKg;
@@ -199,4 +277,3 @@ declare var kg: IKg;
 declare module "kg" {
    export = kg;
 }
-

From 229eb44eaf7bb1b541be04fdb456f209201e1511 Mon Sep 17 00:00:00 2001
From: SLathrop <steve@stevelathrop.net>
Date: Sat, 18 Jun 2016 17:25:18 -0400
Subject: [PATCH 125/278] Add public Knex API QueryBuilder.on() event hook

---
 knex/knex.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index 76c6d7e521..27ed317e37 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -31,6 +31,7 @@ declare module "knex" {
     migrate: Knex.Migrator;
     seed: any;
     fn: any;
+    on(eventName: string, callback: Function): Knex.QueryBuilder;
   }
 
   function Knex(config: Knex.Config) : Knex;

From 3729674f67363b4bb83eacf58202d804f924b905 Mon Sep 17 00:00:00 2001
From: Maksim Kozhukh <mkozhukh@ya.ru>
Date: Sun, 19 Jun 2016 04:21:00 +0300
Subject: [PATCH 126/278] definitions updated to Webix 3.3 (#9649)

---
 webix/webix-2.3.0.d.ts | 7533 ----------------------------------------
 webix/webix-tests.ts   |   14 +
 webix/webix.d.ts       | 3456 ++++++++++--------
 3 files changed, 2113 insertions(+), 8890 deletions(-)
 delete mode 100644 webix/webix-2.3.0.d.ts

diff --git a/webix/webix-2.3.0.d.ts b/webix/webix-2.3.0.d.ts
deleted file mode 100644
index a168406892..0000000000
--- a/webix/webix-2.3.0.d.ts
+++ /dev/null
@@ -1,7533 +0,0 @@
-// Type definitions for Webix UI v2.3.0
-// Project: http://webix.com
-// Definitions by: Maksim Kozhukh <http://github.com/mkozhukh>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
-
-declare namespace webix {
-
-type WebixTemplate = (...args: any[])=>string;
-type WebixCallback = (...args: any[])=>any;
-interface PromisedData {
-    then(handler:(data:any)=>any):PromisedData;
-}
-
-function ajax():webix._ajax;
-function $$(id: string|Event|HTMLElement):webix.ui.view;
-
-
-interface _ajax{
-	bind(master:any):webix._ajax;
-	del(url:string, params?:any, callback?:WebixCallback):PromisedData;
-	get(url:string, params?:any, callback?:WebixCallback):PromisedData;
-	getXHR():any;
-	headers(values:any):webix._ajax;
-	post(url:string, params?:any, callback?:WebixCallback):PromisedData;
-	put(url:string, params?:any, callback?:WebixCallback):PromisedData;
-	response(type:string):void;
-	stringify():void;
-	sync():webix._ajax;
-	master: any;
-}
-interface clipbuffer{
-	destructor():void;
-	focus():void;
-	init():void;
-	set(text:string):void;
-}
-interface color{
-	hexToDec(hex:string):number;
-	hsvToRgb(h:number, s:number, v:number):any[];
-	rgbToHsv(r:number, g:number, b:number):any[];
-	toHex(number:number, length?:number):string;
-	toRgb(rgb:string):any[];
-}
-interface csv{
-	parse(text:string, delimiter?:any):any[];
-	stringify(data:any[], delimiter?:any):string;
-	delimiter: any;
-	escape: boolean;
-}
-interface editors{
-	$popup: any;
-	checkbox: string;
-	color: string;
-	combo: string;
-	date: string;
-	"inline-checkbox": any;
-	"inline-text": any;
-	multiselect: string;
-	password: string;
-	popup: string;
-	richselect: string;
-	select: string;
-	text: string;
-}
-interface env{
-	cssPrefix: string;
-	isFF: boolean;
-	isIE: boolean;
-	isSafari: boolean;
-	isWebKit: boolean;
-	jsPrefix: string;
-	mouse: any;
-	strict: boolean;
-	svg: boolean;
-	transform: boolean;
-	transition: boolean;
-	transitionDuration: string;
-	transitionEnd: string;
-	translate: string;
-}
-interface history{
-	push(view:string, url:string, value:any):void;
-	track(view:string, url:string):void;
-}
-interface html{
-	addCss(node:HTMLElement, name:string):void;
-	addMeta(name:string, value:string):void;
-	addStyle(css:string):void;
-	allowSelect():void;
-	create(name:string, attrs:any, html?:string):HTMLElement;
-	createCss(data:any):string;
-	denySelect():void;
-	getValue(node:HTMLElement):string;
-	index(node:HTMLElement):number;
-	insertBefore(node:HTMLElement, before:HTMLElement, rescue?:HTMLElement):void;
-	locate(ev:Event|HTMLElement, name:string):string;
-	offset(node:HTMLElement):any;
-	pos(ev:Event):any;
-	posRelative(ev:Event):any;
-	preventEvent(ev:Event):boolean;
-	remove(node:HTMLElement|HTMLElement[]):void;
-	removeCss(node:HTMLElement, name:string):void;
-	stopEvent(ev:Event):boolean;
-}
-interface i18n{
-	dateFormatDate(date:string):any;
-	dateFormatStr(date:any):string;
-	fullDateFormatDate(date:string):any;
-	fullDateFormatStr(date:Date):string;
-	intFormat(num:number):string;
-	longDateFormatDate(date:string):any;
-	longDateFormatStr(date:any):string;
-	numberFormat(number:number):string;
-	parseFormatDate(date:string):any;
-	parseFormatStr(date:any):string;
-	parseTimeFormatDate(date:string):void;
-	parseTimeFormatStr(date:any):void;
-	priceFormat(number:number):string;
-	setLocale(name:string):void;
-	timeFormatDate(time:string):any;
-	timeFormatStr(date:any):string;
-	calendar: any;
-	controls: any;
-	dateFormat: string;
-	decimalDelimiter: string;
-	decimalSize: number;
-	fileSize: any[];
-	fullDateFormat: string;
-	groupDelimiter: string;
-	groupSize: number;
-	locales: any;
-	longDateFormat: string;
-	parseFormat: string;
-	parseTimeFormat: string;
-	price: string;
-	priceSettings: any;
-	timeFormat: string;
-}
-interface locale{
-	pager: any;
-}
-interface markup{
-	init(node:string, target:string):webix.ui.baseview;
-	parse(data:any, datatype:string):void;
-	attribute: any;
-	dataTag: any;
-	namespace: any;
-}
-interface promise{
-	all(promise:PromisedData, morepromises?:PromisedData):void;
-	defer():PromisedData;
-	fcall():PromisedData;
-	nfcall():PromisedData;
-}
-interface rules{
-	isEmail():void;
-	isNotEmpty():void;
-	isNumber():void;
-}
-interface cookie{
-	clear():void;
-	get(name:string):any;
-	put(name:string, value:any):void;
-	remove(name:string):void;
-}
-interface local{
-	clear():void;
-	get(name:string):any;
-	put(name:string, value:any):void;
-	remove(name:string):void;
-}
-interface session{
-	clear():void;
-	get(name:string):any;
-	put(name:string, value:any):void;
-	remove(name:string):void;
-}
-interface storage{
-	cookie:webix.cookie;
-	local:webix.local;
-	session:webix.session;
-}
-
-function alert(text:string, callback:WebixCallback):HTMLElement;
-function animate(html_element:HTMLElement, animation:any):void;
-function attachEvent(type:string, functor:WebixCallback, id?:string):string;
-function bind(code:WebixCallback, master:any):WebixCallback;
-function blockEvent():void;
-function callEvent(name:string, params:any[]):boolean;
-function clone(source:any):any;
-function confirm(text:string, callback:WebixCallback):HTMLElement;
-function copy(source:any):any;
-function delay(code:WebixCallback, owner?:any, params?:any[], delay?:number):number;
-function detachEvent(id:string):void;
-function dp(name:string):any;
-function editStop():void;
-function event(node:HTMLElement, event:string, handler:WebixCallback, master?:any):string;
-function eventRemove(id:string):void;
-function exec(code:string):void;
-function extend(target:any, source:any, overwrite:boolean):any;
-function hasEvent(name:string):boolean;
-function isArray(check:any):boolean;
-function isDate(check:any):boolean;
-function isUndefined(check:any):boolean;
-function jsonp(url:string, params?:any, callback?:WebixCallback, master?:any):void;
-function mapEvent(map:any):void;
-function message(text:string):void;
-function modalbox(text:string, callback:WebixCallback):HTMLElement;
-function once(code:WebixCallback):void;
-function proto(target:any, mixin1?:any, mixinN?:any):any;
-function protoUI(target:any, view:any, mixin1?:any, mixinN?:any):any;
-function proxy(type:string, source:string):any;
-function ready(code:WebixCallback):void;
-function remote():void;
-function require(url:string):void;
-function send(url:string, values:any, method:string, target:string):void;
-function single(source:WebixCallback):WebixCallback;
-function template(template:string):WebixCallback;
-function toArray(array:any[]):any[];
-function toFunctor(name:string):WebixCallback;
-function toNode(id:string):HTMLElement;
-function type(config:any):void;
-function ui(config:any, parent?:any, replacement?:any):webix.ui.baseview;
-function uid():string;
-function unblockEvent():void;
-function wrap(target:WebixCallback, source:WebixCallback):WebixCallback;
-var codebase: string;
-var name: string;
-var version: string;
-var clipbuffer:webix.clipbuffer;
-var color:webix.color;
-var csv:webix.csv;
-var editors:webix.editors;
-var env:webix.env;
-var history:webix.history;
-var html:webix.html;
-var i18n:webix.i18n;
-var locale:webix.locale;
-var markup:webix.markup;
-var promise:webix.promise;
-var rules:webix.rules;
-var storage:webix.storage;
-
-interface ActiveContent{
-	}
-var ActiveContent:ActiveContent;
-
-interface AtomDataLoader{
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	parse(data:any, type:string):void;
-}
-var AtomDataLoader:AtomDataLoader;
-
-interface AtomRender{
-	render(id:string, data:any, type:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-}
-var AtomRender:AtomRender;
-
-interface AutoTooltip{
-	}
-var AutoTooltip:AutoTooltip;
-
-interface BaseBind{
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	unbind():void;
-}
-var BaseBind:BaseBind;
-
-interface BindSource{
-	addBind(source:any, rule:string, format:string):void;
-	getBindData(key:string, update:boolean):void;
-	removeBind(source:any):void;
-	saveBatch(func:WebixCallback):void;
-	setBindData(data:any, key:string):void;
-}
-var BindSource:BindSource;
-
-interface Canvas{
-	clearCanvas():void;
-	getCanvas(context:string):any;
-	hideCanvas():void;
-	renderText(x:number, y:number, text:string, css:string, w:number):void;
-	renderTextAt(valign:string, align:string, x:number, y:number, t:string, c:string, w:number):void;
-	showCanvas():void;
-	toggleCanvas():void;
-}
-var Canvas:Canvas;
-
-interface CollectionBind{
-	getCursor():number;
-	refreshCursor():void;
-	setCursor(cursor:string):void;
-}
-var CollectionBind:CollectionBind;
-
-interface ContextHelper{
-	attachTo(view:any):void;
-	getContext():any;
-}
-var ContextHelper:ContextHelper;
-
-interface CopyPaste{
-	}
-var CopyPaste:CopyPaste;
-
-interface CustomScroll{
-	enable(html_node:HTMLElement|webix.ui.baseview):void;
-	init():void;
-	scrollStep: number;
-}
-var CustomScroll:CustomScroll;
-
-interface DataCollection{
-	add(obj:any, index?:number):string;
-	addBind(source:any, rule:string, format:string):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearValidation():void;
-	count():number;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBindData(key:string, update:boolean):void;
-	getCursor():number;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getPrevId(id:string, step:number):string;
-	hasEvent(name:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	refreshCursor():void;
-	remove(id:string):void;
-	removeBind(source:any):void;
-	saveBatch(func:WebixCallback):void;
-	serialize():any;
-	setBindData(data:any, key:string):void;
-	setCursor(cursor:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	config: { [key: string]: any; };
-	name: string;
-}
-interface DataCollectionFactory{
-	new():DataCollection;
-}
-var DataCollection:DataCollectionFactory;
-
-interface DataDriver{
-	csv: any;
-	html: any;
-	htmltable: any;
-	jsarray: any;
-	json: any;
-	xml: any;
-}
-var DataDriver:DataDriver;
-
-interface DataLoader{
-	add(obj:any, index?:number):string;
-	clearAll():void;
-	count():number;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getPrevId(id:string, step:number):string;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	serialize():any;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	updateItem(id:string, data:any):void;
-}
-var DataLoader:DataLoader;
-
-interface DataMarks{
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	clearCss(css:string, silent?:boolean):void;
-	hasCss(id:string, css:string):boolean;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-}
-var DataMarks:DataMarks;
-
-interface DataMove{
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-}
-var DataMove:DataMove;
-
-interface DataProcessor{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	attachProgress(start:WebixCallback, end:WebixCallback, error:WebixCallback):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearValidation():void;
-	define(property:string, value:any):void;
-	detachEvent(id:string):void;
-	escape(value:string):string;
-	getItemState(itemId:string):any;
-	getState():string|boolean;
-	hasEvent(name:string):boolean;
-	ignore(code:WebixCallback, master:any):void;
-	mapEvent(map:any):void;
-	off():void;
-	on():void;
-	processResult(data:any):void;
-	reset():void;
-	save(id:string, operation:string):void;
-	send():void;
-	setItemState(itemId:string, state:boolean):void;
-	unblockEvent():void;
-	validate():boolean;
-	config: { [key: string]: any; };
-	name: string;
-}
-var DataProcessor:DataProcessor;
-
-interface DataRecord{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	detachEvent(id:string):void;
-	getValues():any;
-	hasEvent(name:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	setValues(values:any, update?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	config: { [key: string]: any; };
-	name: string;
-}
-var DataRecord:DataRecord;
-
-interface DataState{
-	getState():any;
-	setState(state:any):void;
-}
-var DataState:DataState;
-
-interface DataStore{
-	add(obj:any, index?:number):string;
-	addMark(id:string, name:string, css?:boolean, value?:any):any;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	changeId(old:string, newid:string):void;
-	clearAll():void;
-	clearMark(name:string):void;
-	count():number;
-	destructor():void;
-	detachEvent(id:string):void;
-	each(method:WebixCallback, master?:any, all?:boolean):void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getIndexRange(from:string, to:string):any[];
-	getItem(id:string):any;
-	getLastId():string;
-	getMark(id:string, mark_name:string):any;
-	getNextId(id:string, step:number):string;
-	getPrevId(id:string, step:number):string;
-	getRange(from:string, to:string):any[];
-	hasEvent(name:string):boolean;
-	id(item:any):string;
-	importData(source:webix.ui.baseview):void;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	provideApi(target:any, eventable:boolean):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeMark(id:string, name:string, css:boolean):void;
-	scheme(config:any):void;
-	serialize():any;
-	setDriver(type:string):void;
-	silent(code:WebixCallback):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unblockEvent():void;
-	unsync():void;
-	updateItem(id:string, data:any):void;
-	driver: any;
-	name: string;
-	order: any[];
-	pull: any;
-}
-var DataStore:DataStore;
-
-interface DataValue{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	detachEvent(id:string):void;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	setValue(value:string):void;
-	unbind():void;
-	unblockEvent():void;
-	name: string;
-}
-var DataValue:DataValue;
-
-interface Date{
-	add(date:any, inc:number, mode:string):any;
-	copy(date:any):any;
-	datePart(date:any):any;
-	dateToStr(format:string, utc:boolean):WebixCallback;
-	dayStart(date:any):any;
-	equal(datea:any, dateb:any):boolean;
-	getISOWeek(date:any):number;
-	getUTCISOWeek(data:any):number;
-	isHoliday(date:any):boolean;
-	monthStart(date:any):any;
-	strToDate(format:string, utc:boolean):WebixCallback;
-	timePart(date:any):number;
-	toFixed(num:number):number;
-	weekStart(date:any):any;
-	yearStart(date:any):any;
-	startOnMonday: boolean;
-}
-var Date:Date;
-
-interface Destruction{
-	destructor():void;
-}
-var Destruction:Destruction;
-
-interface DragControl{
-	addDrag(node:string|HTMLElement, ctrl:any):void;
-	addDrop(node:string|HTMLElement, ctrl:any, master_mode:boolean):void;
-	createDrag(event:Event):void;
-	destroyDrag():void;
-	getContext():any;
-	getMaster(target:any):any;
-	getNode():HTMLElement;
-	sendSignal(signal:string):void;
-	$drag(s:any, e:Event):HTMLElement;
-	$dragIn(s:any, t:any, e:Event):void;
-	$dragOut(s:any, t:any, n:any, e:Event):void;
-	$dragPos: WebixCallback;
-	$drop(s:any, t:any, d:any, e:Event):void;
-	left: number;
-	top: number;
-}
-var DragControl:DragControl;
-
-interface DragItem{
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-}
-var DragItem:DragItem;
-
-interface DragOrder{
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragPos: WebixCallback;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-}
-var DragOrder:DragOrder;
-
-interface EditAbility{
-	edit(id:any):void;
-	editCancel():void;
-	editNext():boolean;
-	editStop():void;
-	focusEditor():void;
-	getEditState():any;
-	getEditor(id?:string):any;
-	getEditorValue():string;
-	validateEditor(id?:string):boolean;
-}
-var EditAbility:EditAbility;
-
-interface EventSystem{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	detachEvent(id:string):void;
-	hasEvent(name:string):boolean;
-	mapEvent(map:any):void;
-	unblockEvent():void;
-}
-var EventSystem:EventSystem;
-
-interface Group{
-	group(config:any, mode:boolean):void;
-	ungroup(mode:boolean):void;
-}
-var Group:Group;
-
-interface GroupMethods{
-	any(property:string, data:any):void;
-	count(property:string, data:any):void;
-	max(property:string, data:any):void;
-	min(property:string, data:any):void;
-	string(property:string, data:any):void;
-	sum(property:string, data:any):void;
-}
-var GroupMethods:GroupMethods;
-
-interface GroupStore{
-	group(stats:any):void;
-	ungroup():void;
-}
-var GroupStore:GroupStore;
-
-interface HtmlMap{
-	addPoly(id:string, points:any[]):void;
-	addRect(id:string, points:any[], userdata?:string):void;
-	addSector(id:string, aplha0:number, aplha1:number, x:number, y:number, R:number, ky:number):void;
-	render(html:HTMLElement):void;
-}
-var HtmlMap:HtmlMap;
-
-interface IdSpace{
-	innerId(id:string):string;
-	ui(view:any):webix.ui.baseview;
-	$$: any;
-}
-var IdSpace:IdSpace;
-
-interface KeysNavigation{
-	moveSelection(direction:string):void;
-}
-var KeysNavigation:KeysNavigation;
-
-interface MapCollection{
-	}
-var MapCollection:MapCollection;
-
-interface Modality{
-	}
-var Modality:Modality;
-
-interface MouseEvents{
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-}
-var MouseEvents:MouseEvents;
-
-interface Movable{
-	}
-var Movable:Movable;
-
-interface NavigationButtons{
-	}
-var NavigationButtons:NavigationButtons;
-
-interface Number{
-	format(value:number, config:any):string;
-	numToStr(config:any):WebixCallback;
-}
-var Number:Number;
-
-interface OverlayBox{
-	hideOverlay():void;
-	showOverlay():void;
-}
-var OverlayBox:OverlayBox;
-
-interface PagingAbility{
-	getPage():number;
-	getPager():any;
-	setPage(page:number):void;
-}
-var PagingAbility:PagingAbility;
-
-interface PowerArray{
-	each(functor:WebixCallback, master:any):void;
-	filter(functor:WebixCallback, master:any):any[];
-	find(data:any):number;
-	insertAt(data:any, pos:number):void;
-	map(functor:WebixCallback, master:any):any[];
-	remove(value:any):void;
-	removeAt(pos:number, len:number):void;
-}
-var PowerArray:PowerArray;
-
-interface ProgressBar{
-	hideProgress():void;
-	showProgress(config?:any):void;
-}
-var ProgressBar:ProgressBar;
-
-interface RecordBind{
-	}
-var RecordBind:RecordBind;
-
-interface RenderStack{
-	customize(obj:any):void;
-	getItemNode(id:string):void;
-	locate(e:Event):string;
-	render(id:string, data:any, type:string):void;
-	showItem(id:string):void;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-var RenderStack:RenderStack;
-
-interface Scrollable{
-	getScrollState():any;
-	scrollTo(x:number, y:number):void;
-}
-var Scrollable:Scrollable;
-
-interface SelectionModel{
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	isSelected(id:string):boolean;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	unselect(id?:string):void;
-	unselectAll():void;
-}
-var SelectionModel:SelectionModel;
-
-interface Settings{
-	define(property:string, value:any):void;
-	config: { [key: string]: any; };
-	name: string;
-}
-var Settings:Settings;
-
-interface SingleRender{
-	customize(obj:any):void;
-	render(id:string, data:any, type:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	type: { [key: string]: any; };
-}
-var SingleRender:SingleRender;
-
-interface TablePaste{
-	}
-var TablePaste:TablePaste;
-
-interface Touch{
-	disable():void;
-	enable():void;
-	limit(mode:boolean):void;
-	scrollTo(node:HTMLElement, x:number, y:number, speed:string):void;
-	config: any;
-}
-var Touch:Touch;
-
-interface TreeAPI{
-	close(id:string):void;
-	closeAll():void;
-	getOpenItems():any[];
-	getState():any;
-	isBranchOpen(id:string):boolean;
-	open(id:string):void;
-	openAll():void;
-	setState(state:any):void;
-}
-var TreeAPI:TreeAPI;
-
-interface TreeClick{
-	webix_tree_checkbox(obj:any, common:{ [key: string]: any; }):string;
-	webix_tree_close(obj:any, common:{ [key: string]: any; }):string;
-	webix_tree_open(obj:any, common:{ [key: string]: any; }):string;
-}
-var TreeClick:TreeClick;
-
-interface TreeCollection{
-	add(obj:any, index?:number):string;
-	addBind(source:any, rule:string, format:string):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearValidation():void;
-	count():number;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBindData(key:string, update:boolean):void;
-	getBranchIndex(id:string, parent?:string):number;
-	getCursor():number;
-	getFirstChildId(id:string):string;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
-	getParentId(id:string):string;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
-	hasEvent(name:string):boolean;
-	isBranch(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	refreshCursor():void;
-	remove(id:string):void;
-	removeBind(source:any):void;
-	saveBatch(func:WebixCallback):void;
-	serialize():any;
-	setBindData(data:any, key:string):void;
-	setCursor(cursor:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	config: { [key: string]: any; };
-	name: string;
-}
-var TreeCollection:TreeCollection;
-
-interface TreeDataLoader{
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
-}
-var TreeDataLoader:TreeDataLoader;
-
-interface TreeDataMove{
-	copy(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
-	move(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
-	$dropAllow: WebixCallback;
-}
-var TreeDataMove:TreeDataMove;
-
-interface TreeRenderStack{
-	getItemNode(id:string):void;
-	getItemNode(id:string):HTMLElement;
-}
-var TreeRenderStack:TreeRenderStack;
-
-interface TreeStateCheckbox{
-	checkAll(id?:string):void;
-	checkItem(id:string):void;
-	getChecked():any[];
-	isChecked(id:string):boolean;
-	uncheckAll(id?:string):void;
-	uncheckItem(id:string):void;
-}
-var TreeStateCheckbox:TreeStateCheckbox;
-
-interface TreeStore{
-	add(obj:any, index:number, pid:string):string;
-	changeId(old:string, newid:string):void;
-	clearAll():void;
-	count():number;
-	each(code:WebixCallback, master:any, all:boolean, pid:string):void;
-	eachChild(pid:string, code:WebixCallback, master?:any, all?:boolean):void;
-	eachOpen(code:WebixCallback, master?:any, pid?:string):void;
-	eachSubItem(pid:string, code:WebixCallback):void;
-	getBranch(id:string):any[];
-	getBranchIndex(id:string, parent?:string):number;
-	getFirstChildId(id:string):string;
-	getNextSiblingId(id:any):string;
-	getParentId(id:string):string;
-	getPrevSiblingId(id:any):string;
-	getTopRange():any[];
-	isBranch(id:string):boolean;
-	provideApi(target:any, eventable:boolean):void;
-	remove(id:string):void;
-	serialize():any;
-	name: string;
-}
-var TreeStore:TreeStore;
-
-interface TreeTableClick{
-	}
-var TreeTableClick:TreeTableClick;
-
-interface TreeTablePaste{
-	insert(data:any[]):void;
-}
-var TreeTablePaste:TreeTablePaste;
-
-interface TreeType{
-	checkbox(obj:any, common:any):string;
-	folder(obj:any, common:any):string;
-	icon(obj:any, common:any):string;
-	space(obj:any, common:any):string;
-}
-var TreeType:TreeType;
-
-interface UIExtension{
-	}
-var UIExtension:UIExtension;
-
-interface UIManager{
-	addHotKey(key:string, handler:WebixCallback, obj?:any):void;
-	canFocus(id:string):boolean;
-	destructor():void;
-	getFocus():webix.ui.baseview;
-	getNext(view:any):any;
-	getPrev(view:any):any;
-	getState(id:string, childs:boolean):any;
-	getTop(id:string):any;
-	hasFocus(id:string):boolean;
-	removeHotKey(key:string, handler?:WebixCallback, obj?:any):void;
-	setFocus(id:string):void;
-	setState(state:any):void;
-}
-var UIManager:UIManager;
-
-interface UploadDriver{
-	flash: any;
-	html5: any;
-}
-var UploadDriver:UploadDriver;
-
-interface ValidateCollection{
-	clearValidation():void;
-	validate(id?:string):boolean;
-}
-var ValidateCollection:ValidateCollection;
-
-interface ValidateData{
-	clearValidation():void;
-	validate():boolean;
-}
-var ValidateData:ValidateData;
-
-interface ValueBind{
-	}
-var ValueBind:ValueBind;
-
-interface Values{
-	clear():void;
-	focus(item:string):void;
-	getCleanValues():any;
-	getDirtyValues():any;
-	getValues(details?:any):any[];
-	isDirty():boolean;
-	setDirty(mark?:boolean):void;
-	setValues(values:any, update?:boolean):void;
-}
-var Values:Values;
-
-interface VirtualRenderStack{
-	getItemNode(id:string):void;
-	render(id:string, data:any, type:string):void;
-	showItem(id:string):void;
-}
-var VirtualRenderStack:VirtualRenderStack;
-
-
-namespace ui {
-
-
-
-function delay(config:any):void;
-function fullScreen():void;
-function hasMethod(name:string, method_name:string):boolean;
-function resize():void;
-function zIndex():number;
-var scrollSize: number;
-var zIndexBase: number;
-
-interface baselayoutConfig{
-	animate?: any;
-	borderless?: boolean;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	responsive?: string;
-	rows?: any[];
-	visibleBatch?: string;
-	width?: number;
-}
-interface baselayout extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	reconstruct():void;
-	removeView(id:string):void;
-	resize():void;
-	resizeChildren():void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: baselayoutConfig;
-	name: string;
-}
-interface baseviewConfig{
-	animate?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	width?: number;
-}
-interface baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: baseviewConfig;
-	name: string;
-}
-interface protoConfig{
-	animate?: any;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	pager?: any;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	template?: string|WebixCallback;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-}
-interface proto extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getTopParentView():webix.ui.baseview;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	serialize():any;
-	setPage(page:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: protoConfig;
-	name: string;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface resizeareaConfig{
-	border?: boolean;
-	container?: string|HTMLElement;
-	cursor?: string;
-	dir?: string;
-	eventPos?: number;
-	height?: number;
-	id?: string;
-	on?: any;
-	start?: number;
-	width?: number;
-}
-interface resizearea{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	detachEvent(id:string):void;
-	hasEvent(name:string):boolean;
-	mapEvent(map:any):void;
-	unblockEvent():void;
-	config: resizeareaConfig;
-	name: string;
-}
-interface viewConfig{
-	animate?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	width?: number;
-}
-interface view extends webix.ui.baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: viewConfig;
-	name: string;
-}
-interface vscrollConfig{
-	container?: HTMLElement;
-	id?: string;
-	on?: any;
-	scroll?: string;
-	scrollHeight?: number;
-	scrollPos?: number;
-	scrollSize?: number;
-	scrollStep?: number;
-	scrollVisible?: boolean;
-	scrollWidth?: number;
-	zoom?: number;
-}
-interface vscroll extends webix.ui.baseview{
-	activeArea(node:HTMLElement):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	detachEvent(id:string):void;
-	getScroll():number;
-	getSize():number;
-	hasEvent(name:string):boolean;
-	mapEvent(map:any):void;
-	scrollTo(pos:number):void;
-	sizeTo(size:number):void;
-	unblockEvent():void;
-	config: vscrollConfig;
-	name: string;
-}
-interface accordionConfig{
-	animate?: any;
-	borderless?: boolean;
-	collapsed?: boolean;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	isolate?: boolean;
-	margin?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	multi?: boolean|string;
-	on?: any;
-	padding?: number;
-	paddingX?: number;
-	paddingY?: number;
-	panelClass?: string;
-	responsive?: string;
-	rows?: any[];
-	type?: string;
-	visibleBatch?: string;
-	width?: number;
-}
-interface accordion extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	reconstruct():void;
-	removeView(id:string):void;
-	resize():void;
-	resizeChildren():void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: accordionConfig;
-	name: string;
-}
-interface accordionitemConfig{
-	animate?: any;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	collapsed?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	header?: boolean|string|WebixCallback;
-	headerAlt?: string|WebixCallback;
-	headerAltHeight?: number;
-	headerHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	width?: number;
-}
-interface accordionitem extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	collapse():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	expand():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: accordionitemConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-}
-interface barcodeConfig{
-	animate?: any;
-	borderless?: boolean;
-	color?: string;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	paddingX?: number;
-	paddingY?: number;
-	textHeight?: number;
-	type?: any;
-	value?: string;
-	width?: number;
-}
-interface barcode extends webix.ui.baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	render():void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: barcodeConfig;
-	name: string;
-	types: any[];
-}
-interface buttonConfig{
-	align?: string;
-	animate?: any;
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: any;
-	popup?: any;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	value?: string;
-	width?: number;
-}
-interface button extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: buttonConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface calendarConfig{
-	animate?: any;
-	blockDates?: WebixCallback;
-	borderless?: boolean;
-	calendarHeader?: string;
-	calendarTime?: string;
-	calendarWeekHeader?: string;
-	cellHeight?: number;
-	container?: HTMLElement;
-	css?: string;
-	date?: any;
-	dayTemplate?: WebixCallback;
-	disabled?: boolean;
-	events?: WebixCallback;
-	gravity?: number;
-	headerHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	icons?: any;
-	id?: string;
-	maxDate?: Date|string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minDate?: Date|string;
-	minHeight?: number;
-	minWidth?: number;
-	minuteStep?: number;
-	monthSelect?: boolean;
-	mouseEventDelay?: number;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	select?: boolean;
-	skipEmptyWeeks?: boolean;
-	timepicker?: boolean;
-	timepickerHeight?: number;
-	type?: string;
-	weekHeader?: boolean;
-	weekNumber?: boolean;
-	width?: number;
-}
-interface calendar extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getSelectedDate():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():any;
-	getVisibleDate():any;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	selectDate(date:any):void;
-	setValue(date:any):void;
-	show(force?:boolean, animation?:boolean):void;
-	showCalendar(date:any):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: calendarConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-}
-interface chartConfig{
-	alpha?: number;
-	animate?: any;
-	barWidth?: number;
-	border?: boolean;
-	borderColor?: string;
-	borderless?: boolean;
-	cant?: number;
-	color?: string|WebixCallback;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disableLines?: boolean;
-	disabled?: boolean;
-	eventRadius?: number;
-	fill?: string;
-	fixOverflow?: boolean;
-	gradient?: boolean|string|WebixCallback;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	item?: any;
-	label?: string|WebixCallback;
-	labelOffset?: number;
-	legend?: any;
-	line?: any;
-	lineColor?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	offset?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	origin?: number;
-	padding?: any;
-	pieHeight?: number;
-	pieInnerText?: string|WebixCallback;
-	preset?: string;
-	radius?: number;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	save?: string;
-	scale?: string;
-	scheme?: any;
-	series?: any[];
-	shadow?: boolean;
-	tooltip?: any;
-	type?: string;
-	url?: string;
-	value?: string|WebixTemplate;
-	width?: number;
-	x?: number;
-	xAxis?: any;
-	xValue?: string;
-	y?: number;
-	yAxis?: any;
-	yValue?: string;
-}
-interface chart extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addSeries(obj:any):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCanvas():void;
-	count():number;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getTopParentView():webix.ui.baseview;
-	group(config:any, mode:boolean):void;
-	hasEvent(name:string):boolean;
-	hide():void;
-	hideSeries(series:string):void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeAllSeries():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	serialize():any;
-	show(force?:boolean, animation?:boolean):void;
-	showSeries(series:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	ungroup(mode:boolean):void;
-	updateItem(id:string, data:any):void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	colormap: { [key: string]: any; };
-	config: chartConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	presets: { [key: string]: any; };
-}
-interface checkboxConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	checkValue?: string;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	customCheckbox?: boolean;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	uncheckValue?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface checkbox extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	toggle():void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: checkboxConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface carouselConfig{
-	animate?: any;
-	borderless?: boolean;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	navigation?: any;
-	on?: any;
-	rows?: any[];
-	scrollSpeed?: string;
-	type?: string;
-	width?: number;
-}
-interface carousel extends webix.ui.baseview{
-	adjust():void;
-	adjustScroll(matrix:any):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getActiveId():string;
-	getActiveIndex():number;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getLayout():any;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	setActive(id:string):void;
-	setActiveIndex(index:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showNext():void;
-	showPrev():void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: carouselConfig;
-	name: string;
-}
-interface colorboardConfig{
-	animate?: any;
-	borderless?: boolean;
-	cols?: number;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxLightness?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minLightness?: number;
-	minWidth?: number;
-	on?: any;
-	palette?: any[];
-	rows?: number;
-	template?: WebixCallback;
-	value?: string;
-	width?: number;
-}
-interface colorboard extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):string;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: colorboardConfig;
-	name: string;
-}
-interface colorpickerConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	editable?: boolean;
-	format?: string;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	icon?: string;
-	icons?: any;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	stringResult?: any;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	timeIcon?: string;
-	timepicker?: boolean;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface colorpicker extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getPopup():webix.ui.baseview;
-	getText():void;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: colorpickerConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface comboConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	icon?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	options?: any;
-	placeholder?: string;
-	popup?: any;
-	popupWidth?: number;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	text?: string;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface combo extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getPopup():webix.ui.baseview;
-	getText():string;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: comboConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface contextConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	left?: number;
-	master?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	move?: boolean;
-	on?: any;
-	padding?: any;
-	position?: string|WebixCallback;
-	relative?: string;
-	top?: number;
-	width?: number;
-	zIndex?: number;
-}
-interface context extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	attachTo(view:any):void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	close():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getContext():any;
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	resize():void;
-	resizeChildren():void;
-	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: contextConfig;
-	name: string;
-}
-interface contextmenuConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	clipboard?: boolean|string;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragscroll?: boolean|string;
-	externalData?: WebixCallback;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	layout?: string;
-	left?: number;
-	master?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	mouseEventDelay?: number;
-	move?: boolean;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	padding?: any;
-	pager?: any;
-	position?: string|WebixCallback;
-	ready?: WebixCallback;
-	relative?: string;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	subMenuPos?: string;
-	submenu?: any;
-	template?: string|WebixCallback;
-	templateCopy?: WebixCallback;
-	tooltip?: any;
-	top?: number;
-	type?: any;
-	url?: string;
-	width?: number;
-	xCount?: number;
-	yCount?: number;
-	zIndex?: number;
-}
-interface contextmenu extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	attachTo(view:any):void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	close():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	disableItem(id:string):void;
-	enable():void;
-	enableItem(id:string):void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBody():any;
-	getChildViews():any[];
-	getContext():any;
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getMenu(id:string|number):any;
-	getMenuItem(id:string):any;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getSubMenu(id:string|number):any;
-	getTopMenu():any;
-	getTopParentView():webix.ui.baseview;
-	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	hideItem(id:string):void;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	resizeChildren():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setPage(page:number):void;
-	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: contextmenuConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface counterConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	max?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	min?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	step?: number;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface counter extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():number;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	next(step?:number):void;
-	prev(step?:number):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:number):void;
-	shift(value?:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: counterConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface datatableConfig{
-	animate?: any;
-	autoConfig?: boolean;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	blockselect?: boolean;
-	borderless?: boolean;
-	checkboxRefresh?: boolean;
-	clipboard?: boolean|string;
-	columnWidth?: number;
-	columns?: any[];
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datafetch?: number;
-	datathrottle?: number;
-	datatype?: string;
-	delimiter?: any;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragColumn?: boolean|string;
-	dragscroll?: boolean|string;
-	editMath?: boolean;
-	editValue?: string;
-	editable?: boolean;
-	editaction?: string;
-	externalData?: WebixCallback;
-	filterMode?: any;
-	fixedRowHeight?: boolean;
-	footer?: boolean;
-	form?: string;
-	gravity?: number;
-	header?: boolean;
-	headerRowHeight?: number;
-	headermenu?: any;
-	height?: number;
-	hidden?: boolean;
-	hover?: string;
-	id?: string;
-	leftSplit?: number;
-	liveValidation?: boolean;
-	loadahead?: number;
-	math?: boolean;
-	maxHeight?: number;
-	maxWidth?: number;
-	minColumnHeight?: number;
-	minColumnWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	multiselect?: boolean;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	prerender?: boolean;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	resizeColumn?: boolean;
-	resizeRow?: boolean;
-	rightSplit?: number;
-	rowHeight?: number;
-	rowLineHeight?: number;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean;
-	scrollAlignY?: boolean;
-	scrollX?: boolean;
-	scrollY?: boolean;
-	select?: boolean|string;
-	spans?: any[];
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-	yCount?: number;
-}
-interface datatable extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCellCss(id:string, name:string, css:string):void;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	addRowCss(id:string, css:string):void;
-	addSpan(id:any, column:string, width:number, height:number, value?:string, css?:string):void;
-	adjust():void;
-	adjustColumn(id:string|number, header?:string):void;
-	adjustRowHeight(columnId:string, silent:boolean):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearSelection():void;
-	clearValidation():void;
-	collectValues(id:string):any[];
-	columnId(index:number):string;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	eachColumn(handler:WebixCallback, all?:boolean):void;
-	eachRow(handler:WebixCallback, all?:boolean):void;
-	edit(id:any):void;
-	editCancel():void;
-	editCell(row:string, col:string, preserve?:boolean, show?:boolean):void;
-	editColumn(id:string):void;
-	editNext():boolean;
-	editRow(id:string):void;
-	editStop():void;
-	enable():void;
-	exists(id:string):boolean;
-	exportToExcel(url?:string):void;
-	exportToPDF(url?:string):void;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	filterByAll():void;
-	find(criterion:WebixCallback, first?:boolean):any;
-	focusEditor():void;
-	getChildViews():any[];
-	getColumnConfig(id:string):any;
-	getColumnIndex(id:string):number;
-	getEditState():any;
-	getEditor(row?:any, column?:string|number):any;
-	getEditorValue():string;
-	getFilter(columnID:string):any;
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getHeaderContent(id:string):{ [key: string]: any; };
-	getHeaderNode(columnId:string, rowIndex?:number):HTMLElement;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(asArray?:boolean, asString?:boolean):any;
-	getSelectedItem(mode?:boolean):void;
-	getState():any;
-	getText(rowid:string, colid:string):string;
-	getTopParentView():webix.ui.baseview;
-	getVisibleCount():number;
-	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	hideColumn(id:string):void;
-	hideOverlay():void;
-	isColumnVisible(id:string):boolean;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(node:HTMLElement|Event):any;
-	mapCells(startrow:number, startcol:string, numrows:number, numcols:number, callback:WebixCallback):void;
-	mapEvent(map:any):void;
-	mapSelection(callback:WebixCallback):void;
-	markSorting(column_id:string, dir:string):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveColumn(id:string, index:number):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	refreshColumns(config?:any[]):void;
-	refreshFilter(id:string):void;
-	refreshHeaderContent():void;
-	registerFilter(node:HTMLElement, config:any, obj:any):void;
-	remove(id:string):void;
-	removeCellCss(id:string, name:string, css_name:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	removeRowCss(id:string, css_name:string):void;
-	removeSpan(id:string|number, column:string):void;
-	render(id:string, data:any, operation:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(row_id:string, preserve:boolean):void;
-	selectRange(row_id:any, end_row_id:any):void;
-	serialize():any;
-	setColumnWidth(id:string, width:number):void;
-	setPage(page:number):void;
-	setRowHeight(id:string, height:number):void;
-	setState(state:any):void;
-	show(force?:boolean, animation?:boolean):void;
-	showCell(row:string, column:string):void;
-	showColumn(id:string):void;
-	showColumnBatch(batch:string|number):void;
-	showItem(id:string):void;
-	showItemByIndex(index:number):void;
-	showOverlay(message:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	ungroup(mode:boolean):void;
-	unselect(row_id:string):void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	validateEditor(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: datatableConfig;
-	headerContent: any;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	waitData: PromisedData;
-}
-interface dataviewConfig{
-	animate?: any;
-	autoheight?: boolean;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datafetch?: number;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragscroll?: boolean|string;
-	externalData?: WebixCallback;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	loadahead?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	template?: string|WebixCallback;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-	xCount?: number;
-	yCount?: number;
-}
-interface dataview extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getTopParentView():webix.ui.baseview;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setPage(page:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: dataviewConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-	waitData: PromisedData;
-}
-interface datepickerConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	editable?: boolean;
-	format?: string;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	icon?: string;
-	icons?: any;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	stringResult?: any;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	text?: string;
-	timeIcon?: string;
-	timepicker?: boolean;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface datepicker extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getPopup():webix.ui.baseview;
-	getText():void;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: datepickerConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface fieldsetConfig{
-	animate?: any;
-	body?: webix.ui.baseview;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	label?: any;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	width?: number;
-}
-interface fieldset extends webix.ui.baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: fieldsetConfig;
-	name: string;
-}
-interface formConfig{
-	animate?: any;
-	autoheight?: boolean;
-	borderless?: boolean;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datatype?: string;
-	disabled?: boolean;
-	elements?: any[];
-	elementsConfig?: { [key: string]: any; };
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	isolate?: boolean;
-	margin?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	padding?: number;
-	paddingX?: number;
-	paddingY?: number;
-	responsive?: string;
-	rows?: any[];
-	rules?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	type?: string;
-	url?: string;
-	visibleBatch?: string;
-	width?: number;
-}
-interface form extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clear():void;
-	clearValidation():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus(item:string):void;
-	getChildViews():any[];
-	getCleanValues():any;
-	getDirtyValues():any;
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getScrollState():any;
-	getTopParentView():webix.ui.baseview;
-	getValues(details?:any):any;
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isDirty():boolean;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	reconstruct():void;
-	refresh():void;
-	removeView(id:string):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	resizeChildren():void;
-	scrollTo(x:number, y:number):void;
-	setDirty(mark?:boolean):void;
-	setValues(values:any, update?:boolean):void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: formConfig;
-	name: string;
-}
-interface grouplistConfig{
-	animate?: any;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	clipboard?: boolean|string;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragscroll?: boolean|string;
-	externalData?: WebixCallback;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	layout?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	template?: string|WebixCallback;
-	templateBack?: string|WebixTemplate;
-	templateCopy?: WebixCallback;
-	templateGroup?: string|WebixTemplate;
-	templateItem?: string|WebixTemplate;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-	xCount?: number;
-	yCount?: number;
-}
-interface grouplist extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getOpenState():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getTopParentView():webix.ui.baseview;
-	getVisibleCount():number;
-	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setPage(page:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	ungroup(mode:boolean):void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: grouplistConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface headerlayoutConfig{
-	animate?: any;
-	borderless?: boolean;
-	collapsed?: boolean;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	isolate?: boolean;
-	margin?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	multi?: boolean|string;
-	on?: any;
-	padding?: number;
-	paddingX?: number;
-	paddingY?: number;
-	panelClass?: string;
-	responsive?: string;
-	rows?: any[];
-	type?: string;
-	visibleBatch?: string;
-	width?: number;
-}
-interface headerlayout extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	reconstruct():void;
-	removeView(id:string):void;
-	resize():void;
-	resizeChildren():void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: headerlayoutConfig;
-	name: string;
-}
-interface htmlformConfig{
-	animate?: any;
-	autoheight?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datatype?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	src?: string;
-	template?: string|WebixCallback;
-	type?: string;
-	url?: string;
-	width?: number;
-}
-interface htmlform extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clear(all?:boolean):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus(item:string):void;
-	getChildViews():any[];
-	getCleanValues():any;
-	getDirtyValues():any;
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getScrollState():any;
-	getTopParentView():webix.ui.baseview;
-	getValues(details?:any):any[];
-	hasEvent(name:string):boolean;
-	hide():void;
-	isDirty():boolean;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	setContent(node:any):void;
-	setDirty(mark?:boolean):void;
-	setHTML(html:string):void;
-	setValues(values:any, update?:boolean):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: htmlformConfig;
-	name: string;
-}
-interface iconConfig{
-	align?: string;
-	animate?: any;
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: any;
-	popup?: any;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	value?: string;
-	width?: number;
-}
-interface icon extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: iconConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface iframeConfig{
-	animate?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	src?: string;
-	width?: number;
-}
-interface iframe extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getIframe():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getWindow():HTMLElement;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(value:string):void;
-	mapEvent(map:any):void;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: iframeConfig;
-	name: string;
-}
-interface labelConfig{
-	align?: string;
-	animate?: any;
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: any;
-	popup?: any;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	value?: string;
-	width?: number;
-}
-interface label extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setHTML(html:string):void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: labelConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface layoutConfig{
-	animate?: any;
-	borderless?: boolean;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	isolate?: boolean;
-	margin?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	padding?: number;
-	paddingX?: number;
-	paddingY?: number;
-	responsive?: string;
-	rows?: any[];
-	type?: string;
-	visibleBatch?: string;
-	width?: number;
-}
-interface layout extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	reconstruct():void;
-	removeView(id:string):void;
-	resize():void;
-	resizeChildren():void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: layoutConfig;
-	name: string;
-}
-interface listConfig{
-	animate?: any;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	clipboard?: boolean|string;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragscroll?: boolean|string;
-	externalData?: WebixCallback;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	layout?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	template?: string|WebixCallback;
-	templateCopy?: WebixCallback;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-	xCount?: number;
-	yCount?: number;
-}
-interface list extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getTopParentView():webix.ui.baseview;
-	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setPage(page:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: listConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface menuConfig{
-	animate?: any;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	clipboard?: boolean|string;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragscroll?: boolean|string;
-	externalData?: WebixCallback;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	layout?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	subMenuPos?: string;
-	submenu?: any;
-	template?: string|WebixCallback;
-	templateCopy?: WebixCallback;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-	xCount?: number;
-	yCount?: number;
-}
-interface menu extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	disableItem(id:string):void;
-	enable():void;
-	enableItem(id:string):void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getMenu(id:string|number):any;
-	getMenuItem(id:string):any;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getSubMenu(id:string|number):any;
-	getTopMenu():any;
-	getTopParentView():webix.ui.baseview;
-	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	hideItem(id:string):void;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setPage(page:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: menuConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface multiviewConfig{
-	animate?: any;
-	borderless?: boolean;
-	cells?: any;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	fitBiggest?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	responsive?: string;
-	rows?: any[];
-	visibleBatch?: string;
-	width?: number;
-}
-interface multiview extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	back(step:number):void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getActiveId():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	reconstruct():void;
-	removeView(id:string):void;
-	resize():void;
-	resizeChildren():void;
-	setValue(toshow:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: multiviewConfig;
-	name: string;
-}
-interface organogramConfig{
-	animate?: any;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	filterMode?: any;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	template?: string|WebixCallback;
-	threeState?: boolean;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-}
-interface organogram extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	close(id:string):void;
-	closeAll():void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBranchIndex(id:string, parent?:string):number;
-	getChildViews():any[];
-	getFirstChildId(id:string):string;
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
-	getNode():any;
-	getOpenItems():any[];
-	getParentId(id:string):string;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getState():any;
-	getTopParentView():webix.ui.baseview;
-	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isBranch(id:string):boolean;
-	isBranchOpen(id:string):boolean;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	open(id:string):void;
-	openAll():void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setState(state:any):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	ungroup(mode:boolean):void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: organogramConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface pagerConfig{
-	animate?: any;
-	apiOnly?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	count?: number;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	group?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	limit?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	page?: number;
-	size?: number;
-	template?: string|WebixCallback;
-	width?: number;
-}
-interface pager extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clone(config:any):any;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh(id?:string):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	select(page:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: pagerConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-}
-interface popupConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	left?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	move?: boolean;
-	on?: any;
-	padding?: any;
-	position?: string|WebixCallback;
-	relative?: string;
-	top?: number;
-	width?: number;
-	zIndex?: number;
-}
-interface popup extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	close():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	resize():void;
-	resizeChildren():void;
-	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: popupConfig;
-	name: string;
-}
-interface propertyConfig{
-	animate?: any;
-	autoheight?: boolean;
-	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datatype?: string;
-	disabled?: boolean;
-	editValue?: string;
-	editable?: boolean;
-	editaction?: string;
-	elements?: any;
-	form?: string;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	nameWidth?: number;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	template?: string|WebixCallback;
-	url?: string;
-	width?: number;
-}
-interface property extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	edit(id:any):void;
-	editCancel():void;
-	editNext():boolean;
-	editStop():void;
-	enable():void;
-	focusEditor():void;
-	getChildViews():any[];
-	getEditState():any;
-	getEditor(id?:string):any;
-	getEditorValue():string;
-	getFormView():webix.ui.baseview;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getNode():any;
-	getParentView():any;
-	getScrollState():any;
-	getTopParentView():webix.ui.baseview;
-	getValues():any[];
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	registerType(name:string, data:any):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	setValues(values:any, update?:boolean):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	updateItem():void;
-	validateEditor(id?:string):boolean;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: propertyConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_edit: { [key: string]: any; };
-	on_mouse_move: WebixCallback;
-	on_render: { [key: string]: any; };
-	type: { [key: string]: any; };
-}
-interface radioConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	customRadio?: boolean;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	optionHeight?: number;
-	options?: any[];
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	vertical?: boolean;
-	width?: number;
-}
-interface radio extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: radioConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface resizerConfig{
-	animate?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	width?: number;
-}
-interface resizer extends webix.ui.baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: resizerConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-}
-interface richselectConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	icon?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	options?: any;
-	placeholder?: string;
-	popup?: any;
-	popupWidth?: number;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	text?: string;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface richselect extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getPopup():webix.ui.baseview;
-	getText():string;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: richselectConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface multitextConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	icon?: string;
-	iconWidth?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	separator?: string;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface multitext extends webix.ui.baseview{
-	addSection():string|number;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	getValueHere():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	removeSection(id?:string|number):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	setValueHere(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: multitextConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface multiselectConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	icon?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	optionWidth?: number;
-	options?: any;
-	placeholder?: string;
-	popup?: any;
-	popupWidth?: number;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	separator?: string;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	text?: string;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface multiselect extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getPopup():webix.ui.baseview;
-	getText():string;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: multiselectConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface scrollviewConfig{
-	animate?: any;
-	body?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	width?: number;
-}
-interface scrollview extends webix.ui.baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getScrollState():any;
-	getTopParentView():webix.ui.baseview;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	resize():void;
-	resizeChildren():void;
-	scrollTo(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showView(id:string):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: scrollviewConfig;
-	name: string;
-}
-interface searchConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	icon?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface search extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: searchConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface segmentedConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	multiview?: boolean;
-	name?: string;
-	on?: any;
-	options?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface segmented extends webix.ui.baseview{
-	addOption(id:string, value:any, show?:boolean, index?:number):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	optionIndex(ID:string):number;
-	refresh():void;
-	removeOption(id:string):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: segmentedConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface selectConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	options?: any[]|string;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface select extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: selectConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface sliderConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	max?: any;
-	maxHeight?: number;
-	maxWidth?: number;
-	min?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	step?: number;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	title?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface slider extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$touchCapture: any;
-	$view: HTMLElement;
-	$width: number;
-	config: sliderConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface spacerConfig{
-	animate?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	width?: number;
-}
-interface spacer extends webix.ui.baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: spacerConfig;
-	name: string;
-}
-interface submenuConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	clipboard?: boolean|string;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragscroll?: boolean|string;
-	externalData?: WebixCallback;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	layout?: string;
-	left?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	mouseEventDelay?: number;
-	move?: boolean;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	padding?: any;
-	pager?: any;
-	position?: string|WebixCallback;
-	ready?: WebixCallback;
-	relative?: string;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	subMenuPos?: string;
-	submenu?: any;
-	template?: string|WebixCallback;
-	templateCopy?: WebixCallback;
-	tooltip?: any;
-	top?: number;
-	type?: any;
-	url?: string;
-	width?: number;
-	xCount?: number;
-	yCount?: number;
-	zIndex?: number;
-}
-interface submenu extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	close():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	disableItem(id:string):void;
-	enable():void;
-	enableItem(id:string):void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBody():any;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getMenu(id:string|number):any;
-	getMenuItem(id:string):any;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getSubMenu(id:string|number):any;
-	getTopMenu():any;
-	getTopParentView():webix.ui.baseview;
-	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	hideItem(id:string):void;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	resizeChildren():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setPage(page:number):void;
-	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: submenuConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface suggestConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	filter?: WebixCallback;
-	fitMaster?: boolean;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	input?: any;
-	keyPressTimeout?: number;
-	left?: number;
-	master?: webix.ui.baseview;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	move?: boolean;
-	on?: any;
-	padding?: any;
-	position?: string|WebixCallback;
-	relative?: string;
-	template?: string|WebixTemplate;
-	textValue?: string;
-	top?: number;
-	type?: string;
-	width?: number;
-	zIndex?: number;
-}
-interface suggest extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	close():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getItemText(id:string):string;
-	getList():webix.ui.baseview;
-	getMasterValue():any;
-	getNode():any;
-	getParentView():any;
-	getSuggestion():string;
-	getTopParentView():webix.ui.baseview;
-	getValue():string|number;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	linkInput(input:HTMLElement):void;
-	mapEvent(map:any):void;
-	resize():void;
-	resizeChildren():void;
-	setMasterValue(value:any):void;
-	setPosition(x:number, y:number):void;
-	setValue(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: suggestConfig;
-	name: string;
-}
-interface multisuggestConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	buttonText?: string;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	filter?: WebixCallback;
-	fitMaster?: boolean;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	input?: any;
-	keyPressTimeout?: number;
-	left?: number;
-	master?: webix.ui.baseview;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	move?: boolean;
-	on?: any;
-	padding?: any;
-	position?: string|WebixCallback;
-	relative?: string;
-	separator?: string;
-	template?: string|WebixTemplate;
-	textValue?: string;
-	top?: number;
-	type?: string;
-	width?: number;
-	zIndex?: number;
-}
-interface multisuggest extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	close():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getButton():webix.ui.baseview;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getItemText(id:string):string;
-	getList():webix.ui.baseview;
-	getMasterValue():any;
-	getNode():any;
-	getParentView():any;
-	getSuggestion():string;
-	getTopParentView():webix.ui.baseview;
-	getValue():string|number;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	linkInput(input:HTMLElement):void;
-	mapEvent(map:any):void;
-	resize():void;
-	resizeChildren():void;
-	setMasterValue(value:any):void;
-	setPosition(x:number, y:number):void;
-	setValue(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: multisuggestConfig;
-	name: string;
-}
-interface datasuggestConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	filter?: WebixCallback;
-	fitMaster?: boolean;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	input?: any;
-	keyPressTimeout?: number;
-	left?: number;
-	master?: webix.ui.baseview;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	move?: boolean;
-	on?: any;
-	padding?: any;
-	position?: string|WebixCallback;
-	relative?: string;
-	template?: string|WebixTemplate;
-	textValue?: string;
-	top?: number;
-	type?: string;
-	width?: number;
-	zIndex?: number;
-}
-interface datasuggest extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	close():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getItemText(id:string):string;
-	getList():webix.ui.baseview;
-	getMasterValue():any;
-	getNode():any;
-	getParentView():any;
-	getSuggestion():string;
-	getTopParentView():webix.ui.baseview;
-	getValue():string|number;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	linkInput(input:HTMLElement):void;
-	mapEvent(map:any):void;
-	resize():void;
-	resizeChildren():void;
-	setMasterValue(value:any):void;
-	setPosition(x:number, y:number):void;
-	setValue(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: datasuggestConfig;
-	name: string;
-}
-interface gridsuggestConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	filter?: WebixCallback;
-	fitMaster?: boolean;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	input?: any;
-	keyPressTimeout?: number;
-	left?: number;
-	master?: webix.ui.baseview;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	move?: boolean;
-	on?: any;
-	padding?: any;
-	position?: string|WebixCallback;
-	relative?: string;
-	template?: string|WebixTemplate;
-	textValue?: string;
-	top?: number;
-	type?: string;
-	width?: number;
-	zIndex?: number;
-}
-interface gridsuggest extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	close():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getItemText(id:string):string;
-	getList():webix.ui.baseview;
-	getMasterValue():any;
-	getNode():any;
-	getParentView():any;
-	getSuggestion():string;
-	getTopParentView():webix.ui.baseview;
-	getValue():string|number;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	linkInput(input:HTMLElement):void;
-	mapEvent(map:any):void;
-	resize():void;
-	resizeChildren():void;
-	setMasterValue(value:any):void;
-	setPosition(x:number, y:number):void;
-	setValue(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: gridsuggestConfig;
-	name: string;
-}
-interface tabbarConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	bottomOffset?: number;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	moreTemplate?: WebixCallback;
-	multiview?: boolean;
-	name?: string;
-	on?: any;
-	options?: any;
-	placeholder?: string;
-	popup?: any;
-	popupTemplate?: WebixCallback;
-	popupWidth?: number;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	tabMargin?: number;
-	tabMinWidth?: number;
-	tabMoreWidth?: number;
-	tabOffset?: number;
-	tabbarPopup?: webix.ui.baseview;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	topOffset?: number;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-	yCount?: number;
-}
-interface tabbar extends webix.ui.baseview{
-	addOption(id:string, value:any, show?:boolean, index?:number):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getPopup():webix.ui.baseview;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	optionIndex(ID:string):number;
-	refresh():void;
-	removeOption(id:string):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: tabbarConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface tabviewConfig{
-	animate?: any;
-	borderless?: boolean;
-	cells?: any[];
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	isolate?: boolean;
-	margin?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	multiview?: any;
-	on?: any;
-	padding?: number;
-	paddingX?: number;
-	paddingY?: number;
-	responsive?: string;
-	rows?: any[];
-	tabbar?: any;
-	type?: string;
-	visibleBatch?: string;
-	width?: number;
-}
-interface tabview extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getMultiview():any;
-	getNode():any;
-	getParentView():any;
-	getTabbar():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	reconstruct():void;
-	removeView(id:string):void;
-	resize():void;
-	resizeChildren():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: tabviewConfig;
-	name: string;
-}
-interface templateConfig{
-	animate?: any;
-	autoheight?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datatype?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	src?: string;
-	template?: string|WebixCallback;
-	type?: string;
-	url?: string;
-	width?: number;
-}
-interface template extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getScrollState():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	setContent(node:any):void;
-	setHTML(html:string):void;
-	setValues(obj:any, update?:boolean):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: templateConfig;
-	name: string;
-}
-interface textConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface text extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: textConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface textareaConfig{
-	align?: string;
-	animate?: any;
-	attributes?: { [key: string]: any; };
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputPadding?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	labelWidth?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
-	relatedAction?: string;
-	relatedView?: string;
-	required?: boolean;
-	suggest?: string|webix.ui.baseview;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	validate?: boolean;
-	validateEvent?: string;
-	value?: string;
-	width?: number;
-}
-interface textarea extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: textareaConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface toggleConfig{
-	align?: string;
-	animate?: any;
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	name?: string;
-	on?: any;
-	placeholder?: any;
-	popup?: any;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	value?: string;
-	width?: number;
-}
-interface toggle extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	toggle():void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: toggleConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface toolbarConfig{
-	animate?: any;
-	borderless?: boolean;
-	cols?: any[];
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datatype?: string;
-	disabled?: boolean;
-	elements?: any[];
-	elementsConfig?: { [key: string]: any; };
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	isolate?: boolean;
-	margin?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	padding?: number;
-	paddingX?: number;
-	paddingY?: number;
-	responsive?: string;
-	rows?: any[];
-	rules?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	type?: string;
-	url?: string;
-	visibleBatch?: string;
-	width?: number;
-}
-interface toolbar extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clear():void;
-	clearValidation():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	focus(item:string):void;
-	getChildViews():any[];
-	getCleanValues():any;
-	getDirtyValues():any;
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getScrollState():any;
-	getTopParentView():webix.ui.baseview;
-	getValues(details?:any):any[];
-	hasEvent(name:string):boolean;
-	hide():void;
-	index(obj:any):number;
-	isDirty():boolean;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	mapEvent(map:any):void;
-	parse(data:any, type:string):void;
-	reconstruct():void;
-	refresh():void;
-	removeView(id:string):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	resizeChildren():void;
-	scrollTo(x:number, y:number):void;
-	setDirty(mark?:boolean):void;
-	setValues(values:any, update?:boolean):void;
-	show(force?:boolean, animation?:boolean):void;
-	showBatch(name:string):void;
-	unbind():void;
-	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
-	$height: number;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: toolbarConfig;
-	name: string;
-}
-interface tooltipConfig{
-	animate?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	dx?: number;
-	dy?: number;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	on?: any;
-	template?: string|WebixCallback;
-	width?: number;
-}
-interface tooltip extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: tooltipConfig;
-	name: string;
-	type: { [key: string]: any; };
-}
-interface treeConfig{
-	animate?: any;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	clipboard?: boolean|string;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean;
-	dragscroll?: boolean|string;
-	filterMode?: any;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean;
-	template?: string|WebixCallback;
-	templateCopy?: WebixCallback;
-	threeState?: boolean;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-}
-interface tree extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	checkAll(id?:string):void;
-	checkItem(id:string):void;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	close(id:string):void;
-	closeAll():void;
-	copy(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBranchIndex(id:string, parent?:string):number;
-	getChecked():any[];
-	getChildViews():any[];
-	getFirstChildId(id:string):string;
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
-	getNode():any;
-	getOpenItems():any[];
-	getParentId(id:string):string;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getState():any;
-	getTopParentView():webix.ui.baseview;
-	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isBranch(id:string):boolean;
-	isBranchOpen(id:string):boolean;
-	isChecked(id:string):boolean;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveSelection(direction:string):void;
-	open(id:string):void;
-	openAll():void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setState(state:any):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	uncheckAll(id?:string):void;
-	uncheckItem(id:string):void;
-	ungroup(mode:boolean):void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: treeConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface treetableConfig{
-	animate?: any;
-	autoConfig?: boolean;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	blockselect?: boolean;
-	borderless?: boolean;
-	checkboxRefresh?: boolean;
-	clipboard?: boolean|string;
-	columnWidth?: number;
-	columns?: any[];
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datafetch?: number;
-	datathrottle?: number;
-	datatype?: string;
-	delimiter?: any;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragColumn?: boolean|string;
-	dragscroll?: boolean|string;
-	editMath?: boolean;
-	editValue?: string;
-	editable?: boolean;
-	editaction?: string;
-	externalData?: WebixCallback;
-	filterMode?: any;
-	fixedRowHeight?: boolean;
-	footer?: boolean;
-	form?: string;
-	gravity?: number;
-	header?: boolean;
-	headerRowHeight?: number;
-	headermenu?: any;
-	height?: number;
-	hidden?: boolean;
-	hover?: string;
-	id?: string;
-	leftSplit?: number;
-	liveValidation?: boolean;
-	loadahead?: number;
-	math?: boolean;
-	maxHeight?: number;
-	maxWidth?: number;
-	minColumnHeight?: number;
-	minColumnWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	multiselect?: boolean;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	prerender?: boolean;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	resizeColumn?: boolean;
-	resizeRow?: boolean;
-	rightSplit?: number;
-	rowHeight?: number;
-	rowLineHeight?: number;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean;
-	scrollAlignY?: boolean;
-	scrollX?: boolean;
-	scrollY?: boolean;
-	select?: boolean|string;
-	spans?: any[];
-	threeState?: boolean;
-	tooltip?: any;
-	type?: any;
-	url?: string;
-	width?: number;
-	yCount?: number;
-}
-interface treetable extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCellCss(id:string, name:string, css:string):void;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	addRowCss(id:string, css:string):void;
-	adjust():void;
-	adjustColumn(id:string|number, header?:string):void;
-	adjustRowHeight(columnId:string, silent:boolean):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	checkAll(id?:string):void;
-	checkItem(id:string):void;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	close(id:string):void;
-	closeAll():void;
-	collectValues(id:string):any[];
-	columnId(index:number):string;
-	copy(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
-	count():number;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	eachColumn(handler:WebixCallback, all?:boolean):void;
-	eachRow(handler:WebixCallback, all?:boolean):void;
-	edit(id:any):void;
-	editCancel():void;
-	editCell(row:string, col:string, preserve?:boolean, show?:boolean):void;
-	editColumn(id:string):void;
-	editNext():boolean;
-	editRow(id:string):void;
-	editStop():void;
-	enable():void;
-	exists(id:string):boolean;
-	exportToExcel(url?:string):void;
-	exportToPDF(url?:string):void;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	filterByAll():void;
-	find(criterion:WebixCallback, first?:boolean):any;
-	focusEditor():void;
-	getBranchIndex(id:string, parent?:string):number;
-	getChecked():any[];
-	getChildViews():any[];
-	getColumnConfig(id:string):any;
-	getColumnIndex(id:string):number;
-	getEditState():any;
-	getEditor(row?:any, column?:string|number):any;
-	getEditorValue():string;
-	getFilter(columnID:string):any;
-	getFirstChildId(id:string):string;
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getHeaderContent(id:string):{ [key: string]: any; };
-	getHeaderNode(columnId:string, rowIndex?:number):HTMLElement;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
-	getNode():any;
-	getOpenItems():any[];
-	getPage():number;
-	getPager():any;
-	getParentId(id:string):string;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
-	getScrollState():any;
-	getSelectedId(asArray?:boolean, asString?:boolean):any;
-	getSelectedItem(mode?:boolean):void;
-	getState():any;
-	getText(rowid:string, colid:string):string;
-	getTopParentView():webix.ui.baseview;
-	getVisibleCount():number;
-	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	hideColumn(id:string):void;
-	hideOverlay():void;
-	isBranch(id:string):boolean;
-	isBranchOpen(id:string):boolean;
-	isChecked(id:string):boolean;
-	isColumnVisible(id:string):boolean;
-	isEnabled():boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(node:HTMLElement|Event):any;
-	mapCells(startrow:number, startcol:string, numrows:number, numcols:number, callback:WebixCallback):void;
-	mapEvent(map:any):void;
-	markSorting(column_id:string, dir:string):void;
-	move(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
-	moveBottom(id:string):void;
-	moveColumn(id:string, index:number):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	open(id:string):void;
-	openAll():void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	refreshColumns(config?:any[]):void;
-	refreshFilter(id:string):void;
-	refreshHeaderContent():void;
-	registerFilter(node:HTMLElement, config:any, obj:any):void;
-	remove(id:string):void;
-	removeCellCss(id:string, name:string, css_name:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	removeRowCss(id:string, css_name:string):void;
-	render(id:string, data:any, operation:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	serialize():any;
-	setColumnWidth(id:string, width:number):void;
-	setPage(page:number):void;
-	setRowHeight(id:string, height:number):void;
-	setState(state:any):void;
-	show(force?:boolean, animation?:boolean):void;
-	showCell(row:string, column:string):void;
-	showColumn(id:string):void;
-	showColumnBatch(batch:string|number):void;
-	showItem(id:string):void;
-	showItemByIndex(index:number):void;
-	showOverlay(message:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	uncheckAll(id?:string):void;
-	uncheckItem(id:string):void;
-	ungroup(mode:boolean):void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	validateEditor(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: treetableConfig;
-	headerContent: any;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	waitData: PromisedData;
-}
-interface unitlistConfig{
-	animate?: any;
-	autoheight?: boolean;
-	autowidth?: boolean;
-	borderless?: boolean;
-	click?: string|WebixCallback;
-	clipboard?: boolean|string;
-	container?: HTMLElement;
-	css?: string;
-	data?: string|any[];
-	dataFeed?: string|WebixCallback;
-	datathrottle?: number;
-	datatype?: string;
-	disabled?: boolean;
-	drag?: boolean|string;
-	dragscroll?: boolean|string;
-	externalData?: WebixCallback;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	layout?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	mouseEventDelay?: number;
-	navigation?: boolean;
-	on?: any;
-	onClick?: { [key: string]: any; };
-	onContext?: { [key: string]: any; };
-	onDblClick?: WebixCallback;
-	onMouseMove?: WebixCallback;
-	pager?: any;
-	ready?: WebixCallback;
-	removeMissed?: boolean;
-	rules?: any;
-	save?: string;
-	scheme?: any;
-	scroll?: boolean|string;
-	scrollSpeed?: string;
-	select?: boolean|string;
-	sort?: WebixCallback;
-	template?: string|WebixCallback;
-	templateCopy?: WebixCallback;
-	tooltip?: any;
-	type?: any;
-	uniteBy?: WebixCallback;
-	url?: string;
-	width?: number;
-	xCount?: number;
-	yCount?: number;
-}
-interface unitlist extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
-	addCss(id:string|number, css:string, silent?:boolean):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	clearAll():void;
-	clearCss(css:string, silent?:boolean):void;
-	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
-	count():number;
-	customize(obj:any):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	exists(id:string):boolean;
-	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getChildViews():any[];
-	getFirstId():string;
-	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNode():any;
-	getPage():number;
-	getPager():any;
-	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getScrollState():any;
-	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	getTopParentView():webix.ui.baseview;
-	getUnitList(name:string):any[];
-	getUnits():any[];
-	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isSelected(id:string):boolean;
-	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
-	mapEvent(map:any):void;
-	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
-	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	scrollTo(x:number, y:number):void;
-	select(id:string|any[], preserve:boolean):void;
-	selectAll(from?:string, to?:string):void;
-	serialize():any;
-	setPage(page:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
-	sort(by:string, dir?:string, as?:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	unselect(id?:string):void;
-	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	validate(id?:string):boolean;
-	$drag(source:HTMLElement, ev:Event):string;
-	$dragHTML: WebixCallback;
-	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
-	$dragMark(context:any, ev:Event):boolean;
-	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
-	$dropAllow: WebixCallback;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: unitlistConfig;
-	name: string;
-	on_click: WebixCallback;
-	on_context: { [key: string]: any; };
-	on_dblclick: WebixCallback;
-	on_mouse_move: WebixCallback;
-	type: { [key: string]: any; };
-	types: { [key: string]: any; };
-}
-interface uploaderConfig{
-	align?: string;
-	animate?: any;
-	apiOnly?: boolean;
-	autosend?: boolean;
-	borderless?: boolean;
-	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	formData?: { [key: string]: any; };
-	getValue():string;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	hotkey?: string;
-	id?: string;
-	inputHeight?: number;
-	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
-	link?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	multiple?: boolean;
-	name?: string;
-	on?: any;
-	placeholder?: any;
-	popup?: any;
-	tabFocus?: boolean;
-	template?: string|WebixCallback;
-	tooltip?: string;
-	type?: string;
-	value?: string;
-	width?: number;
-}
-interface uploader extends webix.ui.baseview{
-	addDropZone(element:HTMLElement):void;
-	addFile(name:string, size:number, type?:string):void;
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	blur():void;
-	callEvent(name:string, params:any[]):boolean;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	fileDialog(content?:any):void;
-	focus():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getInputNode():HTMLElement;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getValue():string;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isUploaded():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	refresh():void;
-	render(id:string, data:any, type:string):void;
-	resize():void;
-	send(id:number|string|WebixCallback, details:any):void;
-	setValue(value:string):void;
-	show(force?:boolean, animation?:boolean):void;
-	stopUpload(id:string):void;
-	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$setValue(value:string):void;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: uploaderConfig;
-	name: string;
-	on_click: WebixCallback;
-	touchable: any;
-}
-interface videoConfig{
-	animate?: any;
-	borderless?: boolean;
-	container?: HTMLElement;
-	controls?: boolean;
-	css?: string;
-	disabled?: boolean;
-	gravity?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	src?: any;
-	width?: number;
-}
-interface video extends webix.ui.baseview{
-	adjust():void;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	define(property:string, value:any):void;
-	destructor():void;
-	disable():void;
-	enable():void;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	getVideo():void;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	resize():void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: videoConfig;
-	name: string;
-}
-interface windowConfig{
-	animate?: any;
-	autofit?: boolean;
-	autofocus?: boolean;
-	body?: string|webix.ui.baseview;
-	borderless?: boolean;
-	container?: HTMLElement;
-	css?: string;
-	disabled?: boolean;
-	fullscreen?: boolean;
-	gravity?: number;
-	head?: any;
-	headHeight?: number;
-	height?: number;
-	hidden?: boolean;
-	id?: string;
-	left?: number;
-	maxHeight?: number;
-	maxWidth?: number;
-	minHeight?: number;
-	minWidth?: number;
-	modal?: boolean;
-	move?: boolean;
-	on?: any;
-	padding?: any;
-	position?: string|WebixCallback;
-	relative?: string;
-	top?: number;
-	width?: number;
-	zIndex?: number;
-}
-interface window extends webix.ui.baseview{
-	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
-	bind(target:any, rule?:WebixCallback, format?:string):void;
-	blockEvent():void;
-	callEvent(name:string, params:any[]):boolean;
-	close():void;
-	define(property:string, value:any):void;
-	destructor():void;
-	detachEvent(id:string):void;
-	disable():void;
-	enable():void;
-	getBody():any;
-	getChildViews():any[];
-	getFormView():webix.ui.baseview;
-	getHead():any;
-	getNode():any;
-	getParentView():any;
-	getTopParentView():webix.ui.baseview;
-	hasEvent(name:string):boolean;
-	hide():void;
-	isEnabled():boolean;
-	isVisible():boolean;
-	mapEvent(map:any):void;
-	resize():void;
-	resizeChildren():void;
-	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	unbind():void;
-	unblockEvent():void;
-	$getSize():any[];
-	$height: number;
-	$scope: any;
-	$setSize(x:number, y:number):boolean;
-	$skin: any;
-	$view: HTMLElement;
-	$width: number;
-	config: windowConfig;
-	name: string;
-}
-
-}}
-
-declare function $$(id: string|Event|HTMLElement):webix.ui.baseview;
diff --git a/webix/webix-tests.ts b/webix/webix-tests.ts
index 128bc666c7..f1d66c47ce 100644
--- a/webix/webix-tests.ts
+++ b/webix/webix-tests.ts
@@ -64,3 +64,17 @@ data.config["test"]= 123;
 //mixins
 var t = webix.DataDriver.json;
 
+//each ui type has its own events and config options
+var tObj = <webix.ui.treetable> $$("table");
+tObj.attachEvent("onAfterOpen", () => false);
+tObj.config.threeState = false;
+
+var mObj = <webix.ui.submenu> $$("menu");
+mObj.attachEvent("onMenuItemClick", () => false);
+mObj.config.submenuConfig = {};
+
+//template cna be a function or a string
+mObj.config.template = "";
+mObj.config.template = (obj) => obj.str;
+
+
diff --git a/webix/webix.d.ts b/webix/webix.d.ts
index fb9d3b2db1..9c516654a1 100644
--- a/webix/webix.d.ts
+++ b/webix/webix.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for Webix UI v2.4.0
+// Type definitions for Webix UI 3.3.0
 // Project: http://webix.com
 // Definitions by: Maksim Kozhukh <http://github.com/mkozhukh>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -184,7 +184,7 @@ interface storage{
 
 function alert(text:string, callback:WebixCallback):HTMLElement;
 function animate(html_element:HTMLElement, animation:any):void;
-function attachEvent(type:string, functor:WebixCallback, id?:string):string;
+function attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 function bind(code:WebixCallback, master:any):WebixCallback;
 function blockEvent():void;
 function callEvent(name:string, params:any[]):boolean;
@@ -195,8 +195,8 @@ function delay(code:WebixCallback, owner?:any, params?:any[], delay?:number):num
 function detachEvent(id:string):void;
 function dp(name:string):any;
 function editStop():void;
-function event(node:HTMLElement, event:string, handler:WebixCallback, master?:any):string;
-function eventRemove(id:string):void;
+function event(node:HTMLElement|string, event:string, handler:WebixCallback, context?:any):string|number;
+function eventRemove(id:string|number):void;
 function exec(code:string):void;
 function extend(target:any, source:any, overwrite:boolean):any;
 function hasEvent(name:string):boolean;
@@ -209,7 +209,7 @@ function message(text:string):void;
 function modalbox(text:string, callback:WebixCallback):HTMLElement;
 function once(code:WebixCallback):void;
 function proto(target:any, mixin1?:any, mixinN?:any):any;
-function protoUI(target:any, view:any, mixin1?:any, mixinN?:any):any;
+function protoUI(target:any, view:any, mixin1:any, mixinN:any):any;
 function proxy(type:string, source:string):any;
 function ready(code:WebixCallback):void;
 function remote():void;
@@ -218,13 +218,17 @@ function send(url:string, values:any, method:string, target:string):void;
 function single(source:WebixCallback):WebixCallback;
 function template(template:string):WebixCallback;
 function toArray(array:any[]):any[];
+function toExcel(id:any, options:any):void;
 function toFunctor(name:string):WebixCallback;
 function toNode(id:string):HTMLElement;
+function toPDF(id:string, name:string):void;
+function toPNG(id:string, name:string):void;
 function type(config:any):void;
 function ui(config:any, parent?:any, replacement?:any):webix.ui.baseview;
-function uid():string;
+function uid():number;
 function unblockEvent():void;
 function wrap(target:WebixCallback, source:WebixCallback):WebixCallback;
+
 var codebase: string;
 var name: string;
 var version: string;
@@ -243,40 +247,34 @@ var rules:webix.rules;
 var storage:webix.storage;
 
 interface ActiveContent{
-	}
+}
 var ActiveContent:ActiveContent;
-
 interface AtomDataLoader{
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	parse(data:any, type:string):void;
 }
 var AtomDataLoader:AtomDataLoader;
-
 interface AtomRender{
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 }
 var AtomRender:AtomRender;
-
 interface AutoTooltip{
-	}
+}
 var AutoTooltip:AutoTooltip;
-
 interface BaseBind{
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	unbind():void;
 }
 var BaseBind:BaseBind;
-
 interface BindSource{
 	addBind(source:any, rule:string, format:string):void;
-	getBindData(key:string, update:boolean):void;
+	getBindData(key:string|number, update:boolean):void;
 	removeBind(source:any):void;
 	saveBatch(func:WebixCallback):void;
-	setBindData(data:any, key:string):void;
+	setBindData(data:any, key:string|number):void;
 }
 var BindSource:BindSource;
-
 interface Canvas{
 	clearCanvas():void;
 	getCanvas(context:string):any;
@@ -287,85 +285,91 @@ interface Canvas{
 	toggleCanvas():void;
 }
 var Canvas:Canvas;
-
+interface CodeParser{
+	collapseNames(obj:any):{ [key: string]: any; };
+	expandNames(obj:{ [key: string]: any; }):any;
+}
+var CodeParser:CodeParser;
 interface CollectionBind{
 	getCursor():number;
 	refreshCursor():void;
-	setCursor(cursor:string):void;
+	setCursor(cursor:string|number):void;
 }
 var CollectionBind:CollectionBind;
-
 interface ContextHelper{
 	attachTo(view:any):void;
 	getContext():any;
+	setContext(context:any):void;
 }
 var ContextHelper:ContextHelper;
-
 interface CopyPaste{
-	}
+}
 var CopyPaste:CopyPaste;
-
 interface CustomScroll{
 	enable(html_node:HTMLElement|webix.ui.baseview):void;
 	init():void;
+	resize():void;
 	scrollStep: number;
 }
 var CustomScroll:CustomScroll;
-
 interface DataCollection{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addBind(source:any, rule:string, format:string):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearValidation():void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	define(property:string, value:any):void;
 	destructor():void;
 	detachEvent(id:string):void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBindData(key:string, update:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getBindData(key:string|number, update:boolean):void;
 	getCursor():number;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getPrevId(id:string, step:number):string;
+	getFirstId():string|number;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getPrevId(id:string|number, step:number):string|number;
 	hasEvent(name:string):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
 	mapEvent(map:any):void;
+	move(sid:string, tindex:number, tobj?:any, details?:any):string;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
+	refresh(id?:string|number):void;
 	refreshCursor():void;
-	remove(id:string):void;
+	remove(id:string|number):void;
 	removeBind(source:any):void;
 	saveBatch(func:WebixCallback):void;
 	serialize():any;
-	setBindData(data:any, key:string):void;
-	setCursor(cursor:string):void;
+	setBindData(data:any, key:string|number):void;
+	setCursor(cursor:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
 	config: { [key: string]: any; };
 	name: string;
 }
-interface DataCollectionFactory{
-	new():DataCollection;
-}
-var DataCollection:DataCollectionFactory;
 
 interface DataDriver{
 	csv: any;
+	excel: string;
 	html: any;
 	htmltable: any;
 	jsarray: any;
@@ -373,52 +377,49 @@ interface DataDriver{
 	xml: any;
 }
 var DataDriver:DataDriver;
-
 interface DataLoader{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	clearAll():void;
 	count():number;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getPrevId(id:string, step:number):string;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getFirstId():string|number;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getPrevId(id:string|number, step:number):string|number;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	serialize():any;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 }
 var DataLoader:DataLoader;
-
 interface DataMarks{
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	clearCss(css:string, silent?:boolean):void;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
 }
 var DataMarks:DataMarks;
-
 interface DataMove{
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 }
 var DataMove:DataMove;
-
 interface DataProcessor{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 	attachProgress(start:WebixCallback, end:WebixCallback, error:WebixCallback):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -426,7 +427,7 @@ interface DataProcessor{
 	define(property:string, value:any):void;
 	detachEvent(id:string):void;
 	escape(value:string):string;
-	getItemState(itemId:string):any;
+	getItemState(itemId:string|number):any;
 	getState():string|boolean;
 	hasEvent(name:string):boolean;
 	ignore(code:WebixCallback, master:any):void;
@@ -435,18 +436,17 @@ interface DataProcessor{
 	on():void;
 	processResult(data:any):void;
 	reset():void;
-	save(id:string, operation:string):void;
+	save(id:string|number, operation:string):void;
 	send():void;
-	setItemState(itemId:string, state:boolean):void;
+	setItemState(itemId:string|number, state:boolean):void;
 	unblockEvent():void;
-	validate():boolean;
+	validate(mode?:any):boolean;
 	config: { [key: string]: any; };
 	name: string;
 }
 var DataProcessor:DataProcessor;
-
 interface DataRecord{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -455,10 +455,10 @@ interface DataRecord{
 	getValues():any;
 	hasEvent(name:string):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	mapEvent(map:any):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
+	refresh(id?:string|number):void;
 	setValues(values:any, update?:boolean):void;
 	unbind():void;
 	unblockEvent():void;
@@ -466,46 +466,45 @@ interface DataRecord{
 	name: string;
 }
 var DataRecord:DataRecord;
-
 interface DataState{
 	getState():any;
 	setState(state:any):void;
 }
 var DataState:DataState;
-
 interface DataStore{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addMark(id:string, name:string, css?:boolean, value?:any):any;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
-	changeId(old:string, newid:string):void;
+	changeId(old:string|number, newid:string|number):void;
 	clearAll():void;
 	clearMark(name:string):void;
 	count():number;
 	destructor():void;
 	detachEvent(id:string):void;
 	each(method:WebixCallback, master?:any, all?:boolean):void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getIndexRange(from:string, to:string):any[];
-	getItem(id:string):any;
-	getLastId():string;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getFirstId():string|number;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getIndexRange(from:string|number, to:string|number):any[];
+	getItem(id:string|number):any;
+	getLastId():string|number;
 	getMark(id:string, mark_name:string):any;
-	getNextId(id:string, step:number):string;
-	getPrevId(id:string, step:number):string;
-	getRange(from:string, to:string):any[];
+	getNextId(id:string|number, step:number):string|number;
+	getPrevId(id:string|number, step:number):string|number;
+	getRange(from:string|number, to:string|number):any[];
 	hasEvent(name:string):boolean;
-	id(item:any):string;
+	id(item:any):string|number;
 	importData(source:webix.ui.baseview):void;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
 	provideApi(target:any, eventable:boolean):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeMark(id:string, name:string, css:boolean):void;
 	scheme(config:any):void;
 	serialize():any;
@@ -515,16 +514,15 @@ interface DataStore{
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unblockEvent():void;
 	unsync():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	driver: any;
 	name: string;
 	order: any[];
 	pull: any;
 }
 var DataStore:DataStore;
-
 interface DataValue{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -540,7 +538,6 @@ interface DataValue{
 	name: string;
 }
 var DataValue:DataValue;
-
 interface Date{
 	add(date:any, inc:number, mode:string):any;
 	copy(date:any):any;
@@ -560,15 +557,13 @@ interface Date{
 	startOnMonday: boolean;
 }
 var Date:Date;
-
 interface Destruction{
 	destructor():void;
 }
 var Destruction:Destruction;
-
 interface DragControl{
-	addDrag(node:string|HTMLElement, ctrl:any):void;
-	addDrop(node:string|HTMLElement, ctrl:any, master_mode:boolean):void;
+	addDrag(node:string|number|HTMLElement, ctrl:any):void;
+	addDrop(node:string|number|HTMLElement, ctrl:any, master_mode:boolean):void;
 	createDrag(event:Event):void;
 	destroyDrag():void;
 	getContext():any;
@@ -584,26 +579,23 @@ interface DragControl{
 	top: number;
 }
 var DragControl:DragControl;
-
 interface DragItem{
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
 }
 var DragItem:DragItem;
-
 interface DragOrder{
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragPos: WebixCallback;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 }
 var DragOrder:DragOrder;
-
 interface EditAbility{
 	edit(id:any):void;
 	editCancel():void;
@@ -613,12 +605,11 @@ interface EditAbility{
 	getEditState():any;
 	getEditor(id?:string):any;
 	getEditorValue():string;
-	validateEditor(id?:string):boolean;
+	validateEditor(id?:string|number):boolean;
 }
 var EditAbility:EditAbility;
-
 interface EventSystem{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	detachEvent(id:string):void;
@@ -627,13 +618,11 @@ interface EventSystem{
 	unblockEvent():void;
 }
 var EventSystem:EventSystem;
-
 interface Group{
 	group(config:any, mode:boolean):void;
 	ungroup(mode:boolean):void;
 }
 var Group:Group;
-
 interface GroupMethods{
 	any(property:string, data:any):void;
 	count(property:string, data:any):void;
@@ -643,41 +632,34 @@ interface GroupMethods{
 	sum(property:string, data:any):void;
 }
 var GroupMethods:GroupMethods;
-
 interface GroupStore{
 	group(stats:any):void;
 	ungroup():void;
 }
 var GroupStore:GroupStore;
-
 interface HtmlMap{
-	addPoly(id:string, points:any[]):void;
-	addRect(id:string, points:any[], userdata?:string):void;
-	addSector(id:string, aplha0:number, aplha1:number, x:number, y:number, R:number, ky:number):void;
+	addPoly(id:string|number, points:any[]):void;
+	addRect(id:string|number, points:any[], userdata?:string):void;
+	addSector(id:string|number, aplha0:number, aplha1:number, x:number, y:number, R:number, ky:number):void;
 	render(html:HTMLElement):void;
 }
 var HtmlMap:HtmlMap;
-
 interface IdSpace{
-	innerId(id:string):string;
+	innerId(id:string|number):string|number;
 	ui(view:any):webix.ui.baseview;
 	$$: any;
 }
 var IdSpace:IdSpace;
-
 interface KeysNavigation{
 	moveSelection(direction:string):void;
 }
 var KeysNavigation:KeysNavigation;
-
 interface MapCollection{
-	}
+}
 var MapCollection:MapCollection;
-
 interface Modality{
-	}
+}
 var Modality:Modality;
-
 interface MouseEvents{
 	on_click: WebixCallback;
 	on_context: { [key: string]: any; };
@@ -685,34 +667,28 @@ interface MouseEvents{
 	on_mouse_move: WebixCallback;
 }
 var MouseEvents:MouseEvents;
-
 interface Movable{
-	}
+}
 var Movable:Movable;
-
 interface NavigationButtons{
-	}
+}
 var NavigationButtons:NavigationButtons;
-
 interface Number{
 	format(value:number, config:any):string;
 	numToStr(config:any):WebixCallback;
 }
 var Number:Number;
-
 interface OverlayBox{
 	hideOverlay():void;
 	showOverlay():void;
 }
 var OverlayBox:OverlayBox;
-
 interface PagingAbility{
 	getPage():number;
 	getPager():any;
 	setPage(page:number):void;
 }
 var PagingAbility:PagingAbility;
-
 interface PowerArray{
 	each(functor:WebixCallback, master:any):void;
 	filter(functor:WebixCallback, master:any):any[];
@@ -723,64 +699,62 @@ interface PowerArray{
 	removeAt(pos:number, len:number):void;
 }
 var PowerArray:PowerArray;
-
 interface ProgressBar{
 	hideProgress():void;
 	showProgress(config?:any):void;
 }
 var ProgressBar:ProgressBar;
-
 interface RecordBind{
-	}
+}
 var RecordBind:RecordBind;
-
 interface RenderStack{
 	customize(obj:any):void;
-	getItemNode(id:string):void;
-	locate(e:Event):string;
-	render(id:string, data:any, type:string):void;
-	showItem(id:string):void;
+	getItemNode(id:string|number):void;
+	locate(e:Event):string|number;
+	render(id:string|number, data:any, type:string):void;
+	showItem(id:string|number):void;
 	type: { [key: string]: any; };
 	types: { [key: string]: any; };
 }
 var RenderStack:RenderStack;
-
 interface Scrollable{
 	getScrollState():any;
 	scrollTo(x:number, y:number):void;
 }
 var Scrollable:Scrollable;
-
 interface SelectionModel{
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
-	isSelected(id:string):boolean;
+	getSelectedItem(as_array:boolean):any;
+	isSelected(id:string|number):boolean;
 	select(id:string|any[], preserve:boolean):void;
 	selectAll(from?:string, to?:string):void;
 	unselect(id?:string):void;
 	unselectAll():void;
 }
 var SelectionModel:SelectionModel;
-
 interface Settings{
 	define(property:string, value:any):void;
 	config: { [key: string]: any; };
 	name: string;
 }
 var Settings:Settings;
-
 interface SingleRender{
 	customize(obj:any):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	type: { [key: string]: any; };
 }
 var SingleRender:SingleRender;
-
+interface Sparklines{
+	template(item:any, common:string, data:any[], column:any, index:number):string;
+	paddingX: number;
+	paddingY: number;
+	radius: number;
+}
+var Sparklines:Sparklines;
 interface TablePaste{
-	}
+}
 var TablePaste:TablePaste;
-
 interface Touch{
 	disable():void;
 	enable():void;
@@ -789,143 +763,140 @@ interface Touch{
 	config: any;
 }
 var Touch:Touch;
-
 interface TreeAPI{
-	close(id:string):void;
+	close(id:string|number):void;
 	closeAll():void;
 	getOpenItems():any[];
 	getState():any;
-	isBranchOpen(id:string):boolean;
-	open(id:string):void;
+	isBranchOpen(id:string|number):boolean;
+	open(id:string|number, show?:boolean):void;
 	openAll():void;
 	setState(state:any):void;
 }
 var TreeAPI:TreeAPI;
-
 interface TreeClick{
 	webix_tree_checkbox(obj:any, common:{ [key: string]: any; }):string;
 	webix_tree_close(obj:any, common:{ [key: string]: any; }):string;
 	webix_tree_open(obj:any, common:{ [key: string]: any; }):string;
 }
 var TreeClick:TreeClick;
-
 interface TreeCollection{
 	add(obj:any, index?:number, parentId?:string):string;
 	addBind(source:any, rule:string, format:string):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:string, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearValidation():void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	define(property:string, value:any):void;
 	destructor():void;
 	detachEvent(id:string):void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBindData(key:string, update:boolean):void;
-	getBranchIndex(id:string, parent?:string):number;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getBindData(key:string|number, update:boolean):void;
+	getBranchIndex(id:string|number, parent?:string|number):number;
 	getCursor():number;
-	getFirstChildId(id:string):string;
-	getFirstId():string;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
-	getParentId(id:string):string;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
+	getFirstChildId(id:string|number):string;
+	getFirstId():string|number;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getNextSiblingId(id:string|number):string|number;
+	getParentId(id:string|number):string|number;
+	getPrevId(id:string|number, step:number):string|number;
+	getPrevSiblingId(id:string|number):string|number;
 	hasEvent(name:string):boolean;
-	isBranch(id:string):boolean;
+	isBranch(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	loadBranch(id:string|number, callback:WebixCallback, url:string):void;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
 	mapEvent(map:any):void;
+	move(sid:string, tindex:number, tobj?:any, details?:any):string;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
+	refresh(id?:string|number):void;
 	refreshCursor():void;
-	remove(id:string):void;
+	remove(id:string|number):void;
 	removeBind(source:any):void;
 	saveBatch(func:WebixCallback):void;
 	serialize():any;
-	setBindData(data:any, key:string):void;
-	setCursor(cursor:string):void;
+	setBindData(data:any, key:string|number):void;
+	setCursor(cursor:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
 	config: { [key: string]: any; };
 	name: string;
 }
 var TreeCollection:TreeCollection;
-
 interface TreeDataLoader{
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
+	loadBranch(id:string|number, callback:WebixCallback, url:string):void;
 }
 var TreeDataLoader:TreeDataLoader;
-
 interface TreeDataMove{
-	copy(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
-	move(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
+	copy(sid:string|number, tindex:number, tobj?:webix.ui.baseview, details?:any):string|number;
+	move(sid:string|number, tindex:number, tobj?:webix.ui.baseview, details?:any):string|number;
 	$dropAllow: WebixCallback;
 }
 var TreeDataMove:TreeDataMove;
-
 interface TreeRenderStack{
-	getItemNode(id:string):void;
-	getItemNode(id:string):HTMLElement;
+	getItemNode(id:string|number):void;
+	render(id:string|number, data:any, type:string):void;
 }
 var TreeRenderStack:TreeRenderStack;
-
 interface TreeStateCheckbox{
-	checkAll(id?:string):void;
+	checkAll(id?:string|number):void;
 	checkItem(id:string):void;
 	getChecked():any[];
-	isChecked(id:string):boolean;
-	uncheckAll(id?:string):void;
+	isChecked(id:string|number):boolean;
+	uncheckAll(id?:string|number):void;
 	uncheckItem(id:string):void;
 }
 var TreeStateCheckbox:TreeStateCheckbox;
-
 interface TreeStore{
 	add(obj:any, index?:number, parentId?:string):string;
-	changeId(old:string, newid:string):void;
+	changeId(old:string|number, newid:string|number):void;
 	clearAll():void;
 	count():number;
 	each(code:WebixCallback, master:any, all:boolean, pid:string):void;
 	eachChild(pid:string, code:WebixCallback, master?:any, all?:boolean):void;
+	eachLeaf(pid:string, code:WebixCallback):void;
 	eachOpen(code:WebixCallback, master?:any, pid?:string):void;
 	eachSubItem(pid:string, code:WebixCallback):void;
 	getBranch(id:string):any[];
-	getBranchIndex(id:string, parent?:string):number;
-	getFirstChildId(id:string):string;
-	getNextSiblingId(id:any):string;
-	getParentId(id:string):string;
-	getPrevSiblingId(id:any):string;
+	getBranchIndex(id:string|number, parent?:string|number):number;
+	getFirstChildId(id:string|number):string;
+	getNextSiblingId(id:string|number):string|number;
+	getParentId(id:string|number):string|number;
+	getPrevSiblingId(id:string|number):string|number;
 	getTopRange():any[];
-	isBranch(id:string):boolean;
+	isBranch(id:string|number):boolean;
 	provideApi(target:any, eventable:boolean):void;
-	remove(id:string):void;
+	remove(id:string|number):void;
 	serialize():any;
 	name: string;
 }
 var TreeStore:TreeStore;
-
 interface TreeTableClick{
-	}
+}
 var TreeTableClick:TreeTableClick;
-
 interface TreeTablePaste{
 	insert(data:any[]):void;
 }
 var TreeTablePaste:TreeTablePaste;
-
 interface TreeType{
 	checkbox(obj:any, common:any):string;
 	folder(obj:any, common:any):string;
@@ -933,49 +904,49 @@ interface TreeType{
 	space(obj:any, common:any):string;
 }
 var TreeType:TreeType;
-
 interface UIExtension{
-	}
+}
 var UIExtension:UIExtension;
-
 interface UIManager{
 	addHotKey(key:string, handler:WebixCallback, obj?:any):void;
-	canFocus(id:string):boolean;
+	applyChanges():void;
+	canFocus(id:string|number):boolean;
 	destructor():void;
 	getFocus():webix.ui.baseview;
 	getNext(view:any):any;
 	getPrev(view:any):any;
 	getState(id:string, childs:boolean):any;
-	getTop(id:string):any;
-	hasFocus(id:string):boolean;
+	getTop(id:string|number):any;
+	hasFocus(id:string|number):boolean;
 	removeHotKey(key:string, handler?:WebixCallback, obj?:any):void;
-	setFocus(id:string):void;
+	setFocus(id:string|number):void;
 	setState(state:any):void;
 }
 var UIManager:UIManager;
-
+interface Undo{
+	ignoreUndo(functor:WebixCallback):void;
+	removeUndo(id:string):void;
+	undo(id:string):void;
+}
+var Undo:Undo;
 interface UploadDriver{
 	flash: any;
 	html5: any;
 }
 var UploadDriver:UploadDriver;
-
 interface ValidateCollection{
 	clearValidation():void;
 	validate(id?:string):boolean;
 }
 var ValidateCollection:ValidateCollection;
-
 interface ValidateData{
 	clearValidation():void;
-	validate():boolean;
+	validate(mode?:any):boolean;
 }
 var ValidateData:ValidateData;
-
 interface ValueBind{
-	}
+}
 var ValueBind:ValueBind;
-
 interface Values{
 	clear():void;
 	focus(item:string):void;
@@ -983,23 +954,27 @@ interface Values{
 	getDirtyValues():any;
 	getValues(details?:any):{ [key: string]: any; };
 	isDirty():boolean;
+	markInvalid(name:string, state?:boolean|string):void;
 	setDirty(mark?:boolean):void;
 	setValues(values:any, update?:boolean):void;
 }
 var Values:Values;
-
 interface VirtualRenderStack{
-	getItemNode(id:string):void;
-	render(id:string, data:any, type:string):void;
-	showItem(id:string):void;
+	getItemNode(id:string|number):void;
+	render(id:string|number, data:any, type:string):void;
+	showItem(id:string|number):void;
 }
 var VirtualRenderStack:VirtualRenderStack;
 
 
+interface DataCollectionFactory {
+	new (): DataCollection;
+}
+var DataCollection: DataCollectionFactory;
+
+
 namespace ui {
 
-
-
 function delay(config:any):void;
 function fullScreen():void;
 function hasMethod(name:string, method_name:string):boolean;
@@ -1012,13 +987,13 @@ interface baselayoutConfig{
 	animate?: any;
 	borderless?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -1029,10 +1004,11 @@ interface baselayoutConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type baselayoutEventName ='onBindRequest'|'onDestruct';
 interface baselayout extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:baselayoutEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -1053,14 +1029,15 @@ interface baselayout extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	reconstruct():void;
-	removeView(id:string):void;
+	removeView(id:string|number):void;
 	resize():void;
 	resizeChildren():void;
 	show(force?:boolean, animation?:boolean):void;
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -1072,19 +1049,20 @@ interface baselayout extends webix.ui.baseview{
 interface baseviewConfig{
 	animate?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	width?: number;
 }
+type baseviewEventName ='onBindRequest'|'onDestruct';
 interface baseview{
 	adjust():void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
@@ -1103,7 +1081,8 @@ interface baseview{
 	resize():void;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -1112,21 +1091,115 @@ interface baseview{
 	config: baseviewConfig;
 	name: string;
 }
+interface checksuggestConfig{
+	animate?: any;
+	autofit?: boolean;
+	autofocus?: boolean;
+	body?: string|webix.ui.baseview;
+	borderless?: boolean;
+	button?: boolean;
+	buttonText?: string;
+	container?: string|HTMLElement;
+	css?: string;
+	disabled?: boolean;
+	filter?: WebixCallback;
+	fitMaster?: boolean;
+	gravity?: number;
+	head?: any;
+	headHeight?: number;
+	height?: number;
+	hidden?: boolean;
+	id?: string|number;
+	input?: HTMLElement|string;
+	keyPressTimeout?: number;
+	left?: number;
+	master?: webix.ui.baseview;
+	maxHeight?: number;
+	maxWidth?: number;
+	minHeight?: number;
+	minWidth?: number;
+	modal?: boolean;
+	move?: boolean;
+	on?: any;
+	padding?: any;
+	position?: string|WebixCallback;
+	relative?: string;
+	resize?: boolean;
+	separator?: string;
+	template?: string|WebixTemplate;
+	textValue?: string;
+	toFront?: boolean;
+	top?: number;
+	type?: string;
+	value?: string|number;
+	width?: number;
+	zIndex?: number;
+}
+type checksuggestEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValueSuggest'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
+interface checksuggest extends webix.ui.baseview{
+	adjust():void;
+	attachEvent(type:checksuggestEventName, functor:WebixCallback, id?:string):string|number;
+	bind(target:any, rule?:WebixCallback, format?:string):void;
+	blockEvent():void;
+	callEvent(name:string, params:any[]):boolean;
+	close():void;
+	define(property:string, value:any):void;
+	destructor():void;
+	detachEvent(id:string):void;
+	disable():void;
+	enable():void;
+	getBody():any;
+	getButton():webix.ui.baseview;
+	getChildViews():any[];
+	getFormView():webix.ui.baseview;
+	getHead():any;
+	getItemText(id:string|number):string;
+	getList():webix.ui.baseview;
+	getMasterValue():any;
+	getNode():any;
+	getParentView():any;
+	getSuggestion():string;
+	getTopParentView():webix.ui.baseview;
+	getValue():string|number;
+	hasEvent(name:string):boolean;
+	hide():void;
+	isEnabled():boolean;
+	isVisible():boolean;
+	linkInput(input:HTMLElement):void;
+	mapEvent(map:any):void;
+	resize():void;
+	resizeChildren():void;
+	setMasterValue(value:any):void;
+	setPosition(x:number, y:number):void;
+	setValue(value:string|number):void;
+	show(force?:boolean, animation?:boolean):void;
+	unbind():void;
+	unblockEvent():void;
+
+	$getSize: any[];
+	$height: number;
+	$scope: any;
+	$setSize(x:number, y:number):boolean;
+	$skin: any;
+	$view: HTMLElement;
+	$width: number;
+	config: checksuggestConfig;
+	name: string;
+}
 interface protoConfig{
 	animate?: any;
 	borderless?: boolean;
 	click?: string|WebixCallback;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
-	dataFeed?: string|WebixCallback;
 	datathrottle?: number;
 	datatype?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -1144,11 +1217,12 @@ interface protoConfig{
 	url?: string;
 	width?: number;
 }
+type protoEventName ='onAfterAdd'|'onAfterDelete'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSort'|'onBeforeAdd'|'onBeforeDelete'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onFocus'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface proto extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:protoEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -1162,49 +1236,51 @@ interface proto extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getTopParentView():webix.ui.baseview;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	serialize():any;
 	setPage(page:number):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -1223,13 +1299,14 @@ interface resizeareaConfig{
 	dir?: string;
 	eventPos?: number;
 	height?: number;
-	id?: string;
+	id?: string|number;
 	on?: any;
 	start?: number;
 	width?: number;
 }
-interface resizearea{
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+type resizeareaEventName ='onResize'|'onResizeEnd';
+interface resizearea extends webix.ui.baseview{
+	attachEvent(type:resizeareaEventName, functor:WebixCallback, id?:string):string|number;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	define(property:string, value:any):void;
@@ -1237,25 +1314,27 @@ interface resizearea{
 	hasEvent(name:string):boolean;
 	mapEvent(map:any):void;
 	unblockEvent():void;
+
 	config: resizeareaConfig;
 	name: string;
 }
 interface viewConfig{
 	animate?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	width?: number;
 }
+type viewEventName ='onAfterScroll'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface view extends webix.ui.baseview{
 	adjust():void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
@@ -1274,7 +1353,8 @@ interface view extends webix.ui.baseview{
 	resize():void;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -1285,8 +1365,8 @@ interface view extends webix.ui.baseview{
 	name: string;
 }
 interface vscrollConfig{
-	container?: HTMLElement;
-	id?: string;
+	container?: string|HTMLElement;
+	id?: string|number;
 	on?: any;
 	scroll?: string;
 	scrollHeight?: number;
@@ -1297,9 +1377,10 @@ interface vscrollConfig{
 	scrollWidth?: number;
 	zoom?: number;
 }
+type vscrollEventName ='onScroll';
 interface vscroll extends webix.ui.baseview{
 	activeArea(node:HTMLElement):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:vscrollEventName, functor:WebixCallback, id?:string):string|number;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	define(property:string, value:any):void;
@@ -1311,6 +1392,7 @@ interface vscroll extends webix.ui.baseview{
 	scrollTo(pos:number):void;
 	sizeTo(size:number):void;
 	unblockEvent():void;
+
 	config: vscrollConfig;
 	name: string;
 }
@@ -1319,13 +1401,13 @@ interface accordionConfig{
 	borderless?: boolean;
 	collapsed?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	isolate?: boolean;
 	margin?: number;
 	maxHeight?: number;
@@ -1344,10 +1426,11 @@ interface accordionConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type accordionEventName ='onAfterCollapse'|'onAfterExpand'|'onBindRequest'|'onDestruct';
 interface accordion extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:accordionEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -1368,14 +1451,15 @@ interface accordion extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	reconstruct():void;
-	removeView(id:string):void;
+	removeView(id:string|number):void;
 	resize():void;
 	resizeChildren():void;
 	show(force?:boolean, animation?:boolean):void;
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -1386,10 +1470,10 @@ interface accordion extends webix.ui.baseview{
 }
 interface accordionitemConfig{
 	animate?: any;
-	body?: string|webix.ui.baseview;
+	body?: any;
 	borderless?: boolean;
 	collapsed?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -1399,7 +1483,7 @@ interface accordionitemConfig{
 	headerHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -1412,9 +1496,10 @@ interface accordionitemConfig{
 	onMouseMove?: WebixCallback;
 	width?: number;
 }
+type accordionitemEventName ='onAfterContextMenu'|'onAfterScroll'|'onBeforeContextMenu'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface accordionitem extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:accordionitemEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -1440,7 +1525,8 @@ interface accordionitem extends webix.ui.baseview{
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -1458,13 +1544,13 @@ interface barcodeConfig{
 	animate?: any;
 	borderless?: boolean;
 	color?: string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -1472,10 +1558,11 @@ interface barcodeConfig{
 	paddingX?: number;
 	paddingY?: number;
 	textHeight?: number;
-	type?: any;
+	type?: string;
 	value?: string;
 	width?: number;
 }
+type barcodeEventName ='onAfterScroll'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface barcode extends webix.ui.baseview{
 	adjust():void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
@@ -1497,7 +1584,8 @@ interface barcode extends webix.ui.baseview{
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -1511,17 +1599,17 @@ interface barcode extends webix.ui.baseview{
 interface buttonConfig{
 	align?: string;
 	animate?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputWidth?: number;
 	label?: string;
@@ -1533,17 +1621,17 @@ interface buttonConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
 	type?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type buttonEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface button extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:buttonEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -1567,16 +1655,18 @@ interface button extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
+	$renderInput(config:any):HTMLElement;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -1586,7 +1676,7 @@ interface button extends webix.ui.baseview{
 	config: buttonConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface calendarConfig{
 	animate?: any;
@@ -1595,10 +1685,10 @@ interface calendarConfig{
 	calendarHeader?: string;
 	calendarTime?: string;
 	calendarWeekHeader?: string;
-	cellHeight?: number;
-	container?: HTMLElement;
+	cellHeight?: number|string;
+	container?: string|HTMLElement;
 	css?: string;
-	date?: any;
+	date?: Date|string;
 	dayTemplate?: WebixCallback;
 	disabled?: boolean;
 	events?: WebixCallback;
@@ -1607,12 +1697,14 @@ interface calendarConfig{
 	height?: number;
 	hidden?: boolean;
 	icons?: any;
-	id?: string;
+	id?: string|number;
 	maxDate?: Date|string;
 	maxHeight?: number;
+	maxTime?: string;
 	maxWidth?: number;
 	minDate?: Date|string;
 	minHeight?: number;
+	minTime?: string;
 	minWidth?: number;
 	minuteStep?: number;
 	monthSelect?: boolean;
@@ -1632,9 +1724,10 @@ interface calendarConfig{
 	weekNumber?: boolean;
 	width?: number;
 }
+type calendarEventName ='onAfterContextMenu'|'onAfterDateSelect'|'onAfterMonthChange'|'onAfterRender'|'onAfterScroll'|'onAfterZoom'|'onBeforeContextMenu'|'onBeforeDateSelect'|'onBeforeMonthChange'|'onBeforeRender'|'onBeforeZoom'|'onBindRequest'|'onBlur'|'onChange'|'onDateClear'|'onDateSelect'|'onDestruct'|'onFocus'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTodaySet'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface calendar extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:calendarEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -1655,18 +1748,19 @@ interface calendar extends webix.ui.baseview{
 	hide():void;
 	isEnabled():boolean;
 	isVisible():boolean;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
-	selectDate(date:any):void;
+	selectDate(date:any, mode:boolean):void;
 	setValue(date:any):void;
 	show(force?:boolean, animation?:boolean):void;
 	showCalendar(date:any):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -1684,13 +1778,13 @@ interface carouselConfig{
 	animate?: any;
 	borderless?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -1702,10 +1796,11 @@ interface carouselConfig{
 	type?: string;
 	width?: number;
 }
+type carouselEventName ='onAfterScroll'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface carousel extends webix.ui.baseview{
 	adjust():void;
-	adjustScroll(matrix:any):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	adjustScroll():void;
+	attachEvent(type:carouselEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -1736,7 +1831,8 @@ interface carousel extends webix.ui.baseview{
 	showPrev():void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -1755,10 +1851,9 @@ interface chartConfig{
 	borderless?: boolean;
 	cant?: number;
 	color?: string|WebixCallback;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
-	dataFeed?: string|WebixCallback;
 	datathrottle?: number;
 	datatype?: string;
 	disableLines?: boolean;
@@ -1770,7 +1865,7 @@ interface chartConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	item?: any;
 	label?: string|WebixCallback;
 	labelOffset?: number;
@@ -1799,7 +1894,7 @@ interface chartConfig{
 	save?: string;
 	scale?: string;
 	scheme?: any;
-	series?: any[];
+	series?: any;
 	shadow?: boolean;
 	tooltip?: any;
 	type?: string;
@@ -1813,11 +1908,12 @@ interface chartConfig{
 	yAxis?: any;
 	yValue?: string;
 }
+type chartEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onFocus'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface chart extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addSeries(obj:any):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:chartEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -1829,19 +1925,20 @@ interface chart extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getTopParentView():webix.ui.baseview;
 	group(config:any, mode:boolean):void;
 	hasEvent(name:string):boolean;
@@ -1849,15 +1946,15 @@ interface chart extends webix.ui.baseview{
 	hideSeries(series:string):void;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeAllSeries():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	serialize():any;
 	show(force?:boolean, animation?:boolean):void;
@@ -1867,8 +1964,9 @@ interface chart extends webix.ui.baseview{
 	unbind():void;
 	unblockEvent():void;
 	ungroup(mode:boolean):void;
-	updateItem(id:string, data:any):void;
-	$getSize():any[];
+	updateItem(id:string|number, data:any):void;
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -1887,14 +1985,14 @@ interface chart extends webix.ui.baseview{
 interface checkboxConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	checkValue?: string;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	customCheckbox?: boolean;
 	disabled?: boolean;
@@ -1902,13 +2000,14 @@ interface checkboxConfig{
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
+	labelRight?: string;
 	labelWidth?: number;
 	maxHeight?: number;
 	maxWidth?: number;
@@ -1916,26 +2015,23 @@ interface checkboxConfig{
 	minWidth?: number;
 	name?: string;
 	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
+	popup?: string;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
 	uncheckValue?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type checkboxEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface checkbox extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:checkboxEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -1959,8 +2055,9 @@ interface checkbox extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
@@ -1968,13 +2065,14 @@ interface checkbox extends webix.ui.baseview{
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -1984,19 +2082,19 @@ interface checkbox extends webix.ui.baseview{
 	config: checkboxConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface colorboardConfig{
 	animate?: any;
 	borderless?: boolean;
 	cols?: number;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxLightness?: number;
 	maxWidth?: number;
@@ -2010,9 +2108,10 @@ interface colorboardConfig{
 	value?: string;
 	width?: number;
 }
+type colorboardEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface colorboard extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:colorboardEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -2033,16 +2132,18 @@ interface colorboard extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	setValue(value:string):string;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
+	$setValue(value:string):void;
 	$skin: any;
 	$view: HTMLElement;
 	$width: number;
@@ -2052,13 +2153,13 @@ interface colorboard extends webix.ui.baseview{
 interface colorpickerConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	editable?: boolean;
@@ -2067,13 +2168,12 @@ interface colorpickerConfig{
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	icon?: string;
 	icons?: boolean;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -2084,27 +2184,26 @@ interface colorpickerConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	stringResult?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	timeIcon?: string;
 	timepicker?: boolean;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type colorpickerEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface colorpicker extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:colorpickerEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -2130,21 +2229,23 @@ interface colorpicker extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -2154,18 +2255,18 @@ interface colorpicker extends webix.ui.baseview{
 	config: colorpickerConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface comboConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -2173,11 +2274,11 @@ interface comboConfig{
 	hidden?: boolean;
 	hotkey?: string;
 	icon?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -2189,26 +2290,26 @@ interface comboConfig{
 	on?: any;
 	options?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	popupWidth?: number;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	text?: string;
 	tooltip?: string;
 	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type comboEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface combo extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:comboEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -2222,6 +2323,7 @@ interface combo extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getInputNode():HTMLElement;
+	getList():webix.ui.baseview;
 	getNode():any;
 	getParentView():any;
 	getPopup():webix.ui.baseview;
@@ -2234,21 +2336,23 @@ interface combo extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -2258,7 +2362,7 @@ interface combo extends webix.ui.baseview{
 	config: comboConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface contextConfig{
 	animate?: any;
@@ -2266,7 +2370,7 @@ interface contextConfig{
 	autofocus?: boolean;
 	body?: string|webix.ui.baseview;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -2274,7 +2378,7 @@ interface contextConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	left?: number;
 	master?: string;
 	maxHeight?: number;
@@ -2287,13 +2391,16 @@ interface contextConfig{
 	padding?: any;
 	position?: string|WebixCallback;
 	relative?: string;
+	resize?: boolean;
+	toFront?: boolean;
 	top?: number;
 	width?: number;
 	zIndex?: number;
 }
+type contextEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface context extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:contextEventName, functor:WebixCallback, id?:string):string|number;
 	attachTo(view:any):void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
@@ -2319,11 +2426,13 @@ interface context extends webix.ui.baseview{
 	mapEvent(map:any):void;
 	resize():void;
 	resizeChildren():void;
+	setContext(context:any):void;
 	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
+	show(node?:HTMLElement, position?:any, point?:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+	show(force:boolean,animation:boolean):void;
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -2343,7 +2452,7 @@ interface contextmenuConfig{
 	borderless?: boolean;
 	click?: string|WebixCallback;
 	clipboard?: boolean|string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -2358,7 +2467,7 @@ interface contextmenuConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	layout?: string;
 	left?: number;
 	master?: string;
@@ -2369,19 +2478,21 @@ interface contextmenuConfig{
 	modal?: boolean;
 	mouseEventDelay?: number;
 	move?: boolean;
-	multiselect?: any;
+	multiselect?: boolean;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
 	onContext?: { [key: string]: any; };
 	onDblClick?: WebixCallback;
 	onMouseMove?: WebixCallback;
+	openAction?: string;
 	padding?: any;
 	pager?: any;
 	position?: string|WebixCallback;
 	ready?: WebixCallback;
 	relative?: string;
 	removeMissed?: boolean;
+	resize?: boolean;
 	rules?: any;
 	save?: string;
 	scheme?: any;
@@ -2389,9 +2500,10 @@ interface contextmenuConfig{
 	scrollSpeed?: string;
 	select?: boolean|string;
 	subMenuPos?: string;
-	submenu?: any;
+	submenuConfig?: any;
 	template?: string|WebixCallback;
 	templateCopy?: WebixCallback;
+	toFront?: boolean;
 	tooltip?: any;
 	top?: number;
 	type?: any;
@@ -2401,11 +2513,12 @@ interface contextmenuConfig{
 	yCount?: number;
 	zIndex?: number;
 }
+type contextmenuEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeShow'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onHide'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMenuItemClick'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPaste'|'onSelectChange'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface contextmenu extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:contextmenuEventName, functor:WebixCallback, id?:string):string|number;
 	attachTo(view:any):void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
@@ -2414,92 +2527,96 @@ interface contextmenu extends webix.ui.baseview{
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
 	close():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
 	destructor():void;
 	detachEvent(id:string):void;
 	disable():void;
-	disableItem(id:string):void;
+	disableItem(id:string|number):void;
 	enable():void;
-	enableItem(id:string):void;
-	exists(id:string):boolean;
+	enableItem(id:string|number):void;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getBody():any;
 	getChildViews():any[];
 	getContext():any;
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
 	getHead():any;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
 	getMenu(id:string|number):any;
-	getMenuItem(id:string):any;
-	getNextId(id:string, step:number):string;
+	getMenuItem(id:string|number):any;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getSubMenu(id:string|number):any;
 	getTopMenu():any;
 	getTopParentView():webix.ui.baseview;
 	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
-	hideItem(id:string):void;
+	hideItem(id:string|number):void;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	resizeChildren():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
 	selectAll(from?:string, to?:string):void;
 	serialize():any;
+	setContext(context:any):void;
 	setPage(page:number):void;
 	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	show(node?:HTMLElement, position?:any, point?:string):void;
+	showItem(id:string|number):void;
+	sizeToContent():void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+	show(force:boolean,animation:boolean):void;
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -2518,24 +2635,24 @@ interface contextmenu extends webix.ui.baseview{
 interface counterConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -2547,26 +2664,23 @@ interface counterConfig{
 	minWidth?: number;
 	name?: string;
 	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
+	popup?: string;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	step?: number;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type counterEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface counter extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:counterEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -2592,8 +2706,9 @@ interface counter extends webix.ui.baseview{
 	next(step?:number):void;
 	prev(step?:number):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:number):void;
 	shift(value?:number):void;
 	show(force?:boolean, animation?:boolean):void;
@@ -2601,13 +2716,14 @@ interface counter extends webix.ui.baseview{
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -2617,7 +2733,7 @@ interface counter extends webix.ui.baseview{
 	config: counterConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface datasuggestConfig{
 	animate?: any;
@@ -2625,7 +2741,7 @@ interface datasuggestConfig{
 	autofocus?: boolean;
 	body?: string|webix.ui.baseview;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	filter?: WebixCallback;
@@ -2635,8 +2751,8 @@ interface datasuggestConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
-	input?: any;
+	id?: string|number;
+	input?: HTMLElement|string;
 	keyPressTimeout?: number;
 	left?: number;
 	master?: webix.ui.baseview;
@@ -2650,16 +2766,19 @@ interface datasuggestConfig{
 	padding?: any;
 	position?: string|WebixCallback;
 	relative?: string;
+	resize?: boolean;
 	template?: string|WebixTemplate;
 	textValue?: string;
+	toFront?: boolean;
 	top?: number;
 	type?: string;
 	width?: number;
 	zIndex?: number;
 }
+type datasuggestEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValueSuggest'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface datasuggest extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:datasuggestEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -2673,7 +2792,7 @@ interface datasuggest extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getHead():any;
-	getItemText(id:string):string;
+	getItemText(id:string|number):string;
 	getList():webix.ui.baseview;
 	getMasterValue():any;
 	getNode():any;
@@ -2692,10 +2811,11 @@ interface datasuggest extends webix.ui.baseview{
 	setMasterValue(value:any):void;
 	setPosition(x:number, y:number):void;
 	setValue(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
+	show(node:HTMLElement, position?:any, point?:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+	show(force:boolean,animation:boolean):void;
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -2707,19 +2827,19 @@ interface datasuggest extends webix.ui.baseview{
 }
 interface datatableConfig{
 	animate?: any;
+	areaselect?: boolean;
 	autoConfig?: boolean;
 	autoheight?: boolean;
 	autowidth?: boolean;
-	blockselect?: boolean;
+	blockselect?: boolean|string;
 	borderless?: boolean;
 	checkboxRefresh?: boolean;
 	clipboard?: boolean|string;
 	columnWidth?: number;
 	columns?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
-	dataFeed?: string|WebixCallback;
 	datafetch?: number;
 	datathrottle?: number;
 	datatype?: string;
@@ -2744,10 +2864,11 @@ interface datatableConfig{
 	height?: number;
 	hidden?: boolean;
 	hover?: string;
-	id?: string;
+	id?: string|number;
 	leftSplit?: number;
 	liveValidation?: boolean;
 	loadahead?: number;
+	map?: any;
 	math?: boolean;
 	maxHeight?: number;
 	maxWidth?: number;
@@ -2775,28 +2896,33 @@ interface datatableConfig{
 	rules?: any;
 	save?: string;
 	scheme?: any;
-	scroll?: boolean;
+	scroll?: boolean|string;
 	scrollAlignY?: boolean;
 	scrollX?: boolean;
 	scrollY?: boolean;
 	select?: boolean|string;
 	spans?: any[];
-	tooltip?: any;
+	subRowHeight?: string;
+	subrow?: string;
+	subview?: webix.ui.baseview;
+	tooltip?: boolean;
 	type?: any;
 	url?: string;
 	width?: number;
 	yCount?: number;
 }
+type datatableEventName ='onAfterAdd'|'onAfterAreaAdd'|'onAfterAreaRemove'|'onAfterBlockSelect'|'onAfterColumnDrop'|'onAfterColumnDropOrder'|'onAfterColumnHide'|'onAfterColumnShow'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterEditStart'|'onAfterEditStop'|'onAfterFilter'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onAfterUnSelect'|'onAreaDrag'|'onBeforeAdd'|'onBeforeAreaAdd'|'onBeforeAreaRemove'|'onBeforeBlockSelect'|'onBeforeColumnDrag'|'onBeforeColumnDrop'|'onBeforeColumnDropOrder'|'onBeforeColumnHide'|'onBeforeColumnShow'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeEditStart'|'onBeforeEditStop'|'onBeforeFilter'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBeforeUnSelect'|'onBindRequest'|'onBlur'|'onCheck'|'onCollectValues'|'onColumnResize'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onHeaderClick'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLiveEdit'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onResize'|'onRowResize'|'onScrollX'|'onScrollY'|'onSelectChange'|'onStructureLoad'|'onStructureUpdate'|'onSubViewClose'|'onSubViewCreate'|'onSubViewOpen'|'onSubViewRender'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface datatable extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCellCss(id:string, name:string, css:string):void;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	addRowCss(id:string, css:string):void;
+	addSelectArea(start:any, end:any, preserve:boolean, area_name?:string, css?:string, handle?:boolean):void;
 	addSpan(id:any, column:string, width:number, height:number, value?:string, css?:string):void;
 	adjust():void;
 	adjustColumn(id:string|number, header?:string):void;
 	adjustRowHeight(columnId:string, silent:boolean):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:datatableEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -2804,9 +2930,10 @@ interface datatable extends webix.ui.baseview{
 	clearCss(css:string, silent?:boolean):void;
 	clearSelection():void;
 	clearValidation():void;
-	collectValues(id:string):any[];
-	columnId(index:number):string;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	closeSub(id:string|number):void;
+	collectValues(id:string|number):any[];
+	columnId(index:number):string|number;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	define(property:string, value:any):void;
 	destructor():void;
@@ -2822,91 +2949,98 @@ interface datatable extends webix.ui.baseview{
 	editRow(id:string):void;
 	editStop():void;
 	enable():void;
-	exists(id:string):boolean;
-	exportToExcel(url?:string):void;
-	exportToPDF(url?:string):void;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
 	filterByAll():void;
 	find(criterion:WebixCallback, first?:boolean):any;
 	focusEditor():void;
+	getAllSelectAreas():any;
 	getChildViews():any[];
 	getColumnConfig(id:string):any;
-	getColumnIndex(id:string):number;
+	getColumnIndex(id:string|number):number;
 	getEditState():any;
 	getEditor(row?:any, column?:string|number):any;
 	getEditorValue():string;
-	getFilter(columnID:string):any;
-	getFirstId():string;
+	getFilter(columnID:string|number):any;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getHeaderContent(id:string):{ [key: string]: any; };
+	getHeaderContent(id:string|number):{ [key: string]: any; };
 	getHeaderNode(columnId:string, rowIndex?:number):HTMLElement;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
-	getSelectedId(asArray?:boolean, asString?:boolean):any;
-	getSelectedItem(mode?:boolean):void;
+	getSelectArea(area_name:string):any;
+	getSelectedId(asArray:boolean, asString:boolean):any;
+	getSelectedItem(as_array?:boolean):any;
+	getSpan():any[];
 	getState():any;
-	getText(rowid:string, colid:string):string;
+	getSubView(id:string|number):any;
+	getText(rowid:string|number, colid:string|number):string;
 	getTopParentView():webix.ui.baseview;
 	getVisibleCount():number;
 	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
-	hideColumn(id:string):void;
+	hideColumn(id:string|number):void;
 	hideOverlay():void;
-	isColumnVisible(id:string):boolean;
+	isColumnVisible(id:string|number):boolean;
 	isEnabled():boolean;
+	isSelected(id:string|number):void;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
 	locate(node:HTMLElement|Event):any;
 	mapCells(startrow:number, startcol:string, numrows:number, numcols:number, callback:WebixCallback):void;
 	mapEvent(map:any):void;
 	mapSelection(callback:WebixCallback):void;
-	markSorting(column_id:string, dir:string):void;
+	markSorting(column_id:string, direction:string):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
+	moveBottom(id:string|number):void;
 	moveColumn(id:string, index:number):void;
-	moveDown(id:string, step:number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
+	openSub(id:string|number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	refreshColumns(config?:any[]):void;
-	refreshFilter(id:string):void;
+	refresh(id?:string|number):void;
+	refreshColumns(config?:any[], reset?:boolean):void;
+	refreshFilter(id:string|number):void;
 	refreshHeaderContent():void;
 	registerFilter(node:HTMLElement, config:any, obj:any):void;
-	remove(id:string):void;
+	remove(id:string|number):void;
 	removeCellCss(id:string, name:string, css_name:string):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
 	removeRowCss(id:string, css_name:string):void;
+	removeSelectArea(area_name:string):void;
 	removeSpan(id:string|number, column:string):void;
-	render(id:string, data:any, operation:string):void;
+	render(id:string|number, data:any, operation:string):void;
 	resize():void;
+	resizeSubView(id:string|number):void;
 	scrollTo(x:number, y:number):void;
-	select(row_id:string, preserve:boolean):void;
-	selectRange(row_id:any, end_row_id:any):void;
+	select(row_id:string|number, preserve:boolean):void;
+	selectAll():void;
+	selectRange(row_id:string|number, end_row_id:string|number, preserve?:boolean):void;
 	serialize():any;
-	setColumnWidth(id:string, width:number):void;
+	setColumnWidth(id:string|number, width:number):void;
 	setPage(page:number):void;
-	setRowHeight(id:string, height:number):void;
+	setRowHeight(id:string|number, height:number):void;
 	setState(state:any):void;
 	show(force?:boolean, animation?:boolean):void;
 	showCell(row:string, column:string):void;
-	showColumn(id:string):void;
-	showColumnBatch(batch:string|number):void;
-	showItem(id:string):void;
+	showColumn(id:string|number):void;
+	showColumnBatch(batch:string|number, preserve:boolean):void;
+	showItem(id:string|number):void;
 	showItemByIndex(index:number):void;
 	showOverlay(message:string):void;
 	sort(by:string, dir?:string, as?:string):void;
@@ -2914,18 +3048,20 @@ interface datatable extends webix.ui.baseview{
 	unbind():void;
 	unblockEvent():void;
 	ungroup(mode:boolean):void;
-	unselect(row_id:string):void;
-	updateItem(id:string, data:any):void;
+	unselect(row_id:string|number):void;
+	unselectAll():void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
-	validateEditor(id?:string):boolean;
+	validateEditor(id?:string|number):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -2939,14 +3075,14 @@ interface datatable extends webix.ui.baseview{
 	on_context: { [key: string]: any; };
 	on_dblclick: WebixCallback;
 	on_mouse_move: WebixCallback;
-	waitData: PromisedData;
+	waitData: webix.promise;
 }
 interface dataviewConfig{
 	animate?: any;
 	autoheight?: boolean;
 	borderless?: boolean;
 	click?: string|WebixCallback;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -2960,14 +3096,14 @@ interface dataviewConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	loadahead?: number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	mouseEventDelay?: number;
-	multiselect?: any;
+	multiselect?: boolean;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
@@ -2991,18 +3127,19 @@ interface dataviewConfig{
 	xCount?: number;
 	yCount?: number;
 }
+type dataviewEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface dataview extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:dataviewEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
@@ -3010,47 +3147,48 @@ interface dataview extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getTopParentView():webix.ui.baseview;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
@@ -3058,23 +3196,24 @@ interface dataview extends webix.ui.baseview{
 	serialize():any;
 	setPage(page:number):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -3089,18 +3228,18 @@ interface dataview extends webix.ui.baseview{
 	on_mouse_move: WebixCallback;
 	type: { [key: string]: any; };
 	types: { [key: string]: any; };
-	waitData: PromisedData;
+	waitData: webix.promise;
 }
 interface datepickerConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	editable?: boolean;
@@ -3111,11 +3250,11 @@ interface datepickerConfig{
 	hotkey?: string;
 	icon?: string;
 	icons?: boolean;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -3126,28 +3265,28 @@ interface datepickerConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	stringResult?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	text?: string;
 	timeIcon?: string;
 	timepicker?: boolean;
 	tooltip?: string;
 	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: Date|string;
 	width?: number;
 }
+type datepickerEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface datepicker extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:datepickerEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -3173,21 +3312,23 @@ interface datepicker extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -3197,26 +3338,27 @@ interface datepicker extends webix.ui.baseview{
 	config: datepickerConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface fieldsetConfig{
 	animate?: any;
 	body?: webix.ui.baseview;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
-	label?: any;
+	id?: string|number;
+	label?: string;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	width?: number;
 }
+type fieldsetEventName ='onAfterScroll'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface fieldset extends webix.ui.baseview{
 	adjust():void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
@@ -3236,7 +3378,8 @@ interface fieldset extends webix.ui.baseview{
 	resize():void;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -3251,7 +3394,8 @@ interface formConfig{
 	autoheight?: boolean;
 	borderless?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	complexData?: boolean;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -3262,7 +3406,7 @@ interface formConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	isolate?: boolean;
 	margin?: number;
 	maxHeight?: number;
@@ -3283,10 +3427,11 @@ interface formConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type formEventName ='onAfterLoad'|'onAfterScroll'|'onAfterValidation'|'onBeforeLoad'|'onBeforeValidate'|'onBindRequest'|'onChange'|'onDestruct'|'onLoadError'|'onSubmit'|'onValidationError'|'onValidationSuccess'|'onValues';
 interface form extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:formEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -3313,13 +3458,14 @@ interface form extends webix.ui.baseview{
 	isDirty():boolean;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	mapEvent(map:any):void;
+	markInvalid(name:string, state?:boolean|string):void;
 	parse(data:any, type:string):void;
 	reconstruct():void;
 	refresh():void;
-	removeView(id:string):void;
-	render(id:string, data:any, type:string):void;
+	removeView(id:string|number):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	resizeChildren():void;
 	scrollTo(x:number, y:number):void;
@@ -3329,8 +3475,9 @@ interface form extends webix.ui.baseview{
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
+	validate(mode?:any):boolean;
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -3345,7 +3492,7 @@ interface gridsuggestConfig{
 	autofocus?: boolean;
 	body?: string|webix.ui.baseview;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	filter?: WebixCallback;
@@ -3355,8 +3502,8 @@ interface gridsuggestConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
-	input?: any;
+	id?: string|number;
+	input?: HTMLElement|string;
 	keyPressTimeout?: number;
 	left?: number;
 	master?: webix.ui.baseview;
@@ -3370,16 +3517,19 @@ interface gridsuggestConfig{
 	padding?: any;
 	position?: string|WebixCallback;
 	relative?: string;
+	resize?: boolean;
 	template?: string|WebixTemplate;
 	textValue?: string;
+	toFront?: boolean;
 	top?: number;
 	type?: string;
 	width?: number;
 	zIndex?: number;
 }
+type gridsuggestEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValueSuggest'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface gridsuggest extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:gridsuggestEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -3393,7 +3543,7 @@ interface gridsuggest extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getHead():any;
-	getItemText(id:string):string;
+	getItemText(id:string|number):string;
 	getList():webix.ui.baseview;
 	getMasterValue():any;
 	getNode():any;
@@ -3412,10 +3562,11 @@ interface gridsuggest extends webix.ui.baseview{
 	setMasterValue(value:any):void;
 	setPosition(x:number, y:number):void;
 	setValue(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
+	show(node:HTMLElement, position?:any, point?:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+	show(force:boolean,animation:boolean):void;
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -3432,7 +3583,7 @@ interface grouplistConfig{
 	borderless?: boolean;
 	click?: string|WebixCallback;
 	clipboard?: boolean|string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -3445,14 +3596,14 @@ interface grouplistConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	layout?: string;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	mouseEventDelay?: number;
-	multiselect?: any;
+	multiselect?: boolean;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
@@ -3469,10 +3620,10 @@ interface grouplistConfig{
 	scrollSpeed?: string;
 	select?: boolean|string;
 	template?: string|WebixCallback;
-	templateBack?: string|WebixTemplate;
+	templateBack?: string|string|WebixTemplate;
 	templateCopy?: WebixCallback;
-	templateGroup?: string|WebixTemplate;
-	templateItem?: string|WebixTemplate;
+	templateGroup?: string|WebixCallback;
+	templateItem?: string|WebixCallback;
 	tooltip?: any;
 	type?: any;
 	url?: string;
@@ -3480,18 +3631,19 @@ interface grouplistConfig{
 	xCount?: number;
 	yCount?: number;
 }
+type grouplistEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPaste'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface grouplist extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:grouplistEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
@@ -3499,50 +3651,51 @@ interface grouplist extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getOpenState():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getTopParentView():webix.ui.baseview;
 	getVisibleCount():number;
 	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
@@ -3550,7 +3703,7 @@ interface grouplist extends webix.ui.baseview{
 	serialize():any;
 	setPage(page:number):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
@@ -3558,16 +3711,17 @@ interface grouplist extends webix.ui.baseview{
 	ungroup(mode:boolean):void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -3588,13 +3742,13 @@ interface headerlayoutConfig{
 	borderless?: boolean;
 	collapsed?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	isolate?: boolean;
 	margin?: number;
 	maxHeight?: number;
@@ -3613,10 +3767,11 @@ interface headerlayoutConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type headerlayoutEventName ='onAfterCollapse'|'onAfterExpand'|'onBindRequest'|'onDestruct';
 interface headerlayout extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:headerlayoutEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -3637,14 +3792,15 @@ interface headerlayout extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	reconstruct():void;
-	removeView(id:string):void;
+	removeView(id:string|number):void;
 	resize():void;
 	resizeChildren():void;
 	show(force?:boolean, animation?:boolean):void;
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -3655,19 +3811,19 @@ interface headerlayout extends webix.ui.baseview{
 }
 interface htmlformConfig{
 	animate?: any;
-	autoheight?: any;
+	autoheight?: boolean;
 	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	complexData?: boolean;
+	container?: string|HTMLElement;
+	content?: string|number|HTMLElement;
 	css?: string;
 	data?: string|any[];
-	dataFeed?: string|WebixCallback;
 	datatype?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -3678,15 +3834,16 @@ interface htmlformConfig{
 	scrollSpeed?: string;
 	src?: string;
 	template?: string|WebixCallback;
-	type?: string;
 	url?: string;
 	width?: number;
 }
+type htmlformEventName ='onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onBeforeLoad'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValues'|'onViewResize';
 interface htmlform extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:htmlformEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
+	blur():void;
 	callEvent(name:string, params:any[]):boolean;
 	clear(all?:boolean):void;
 	define(property:string, value:any):void;
@@ -3709,11 +3866,12 @@ interface htmlform extends webix.ui.baseview{
 	isDirty():boolean;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	mapEvent(map:any):void;
+	markInvalid(name:string, state?:boolean|string):void;
 	parse(data:any, type:string):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	setContent(node:any):void;
@@ -3724,7 +3882,8 @@ interface htmlform extends webix.ui.baseview{
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -3737,39 +3896,36 @@ interface htmlform extends webix.ui.baseview{
 interface iconConfig{
 	align?: string;
 	animate?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	icon?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	name?: string;
 	on?: any;
-	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type iconEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface icon extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:iconEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -3793,16 +3949,18 @@ interface icon extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
+	$renderInput(config:any):HTMLElement;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -3812,18 +3970,18 @@ interface icon extends webix.ui.baseview{
 	config: iconConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface iframeConfig{
 	animate?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -3832,9 +3990,10 @@ interface iframeConfig{
 	src?: string;
 	width?: number;
 }
+type iframeEventName ='onAfterLoad'|'onAfterScroll'|'onBeforeLoad'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface iframe extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:iframeEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -3860,7 +4019,8 @@ interface iframe extends webix.ui.baseview{
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -3873,17 +4033,17 @@ interface iframe extends webix.ui.baseview{
 interface labelConfig{
 	align?: string;
 	animate?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputWidth?: number;
 	label?: string;
@@ -3894,18 +4054,16 @@ interface labelConfig{
 	minWidth?: number;
 	name?: string;
 	on?: any;
-	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type labelEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface label extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:labelEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -3929,7 +4087,7 @@ interface label extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	setHTML(html:string):void;
 	setValue(value:string):void;
@@ -3937,9 +4095,11 @@ interface label extends webix.ui.baseview{
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
+	$renderInput(config:any):HTMLElement;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -3949,19 +4109,19 @@ interface label extends webix.ui.baseview{
 	config: labelConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface layoutConfig{
 	animate?: any;
 	borderless?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	isolate?: boolean;
 	margin?: number;
 	maxHeight?: number;
@@ -3978,10 +4138,11 @@ interface layoutConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type layoutEventName ='onBindRequest'|'onDestruct';
 interface layout extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:layoutEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -4002,14 +4163,15 @@ interface layout extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	reconstruct():void;
-	removeView(id:string):void;
+	removeView(id:string|number):void;
 	resize():void;
 	resizeChildren():void;
 	show(force?:boolean, animation?:boolean):void;
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -4025,7 +4187,7 @@ interface listConfig{
 	borderless?: boolean;
 	click?: string|WebixCallback;
 	clipboard?: boolean|string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -4038,14 +4200,14 @@ interface listConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	layout?: string;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	mouseEventDelay?: number;
-	multiselect?: any;
+	multiselect?: boolean;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
@@ -4070,18 +4232,19 @@ interface listConfig{
 	xCount?: number;
 	yCount?: number;
 }
+type listEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPaste'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface list extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:listEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
@@ -4089,48 +4252,49 @@ interface list extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getTopParentView():webix.ui.baseview;
 	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
@@ -4138,23 +4302,24 @@ interface list extends webix.ui.baseview{
 	serialize():any;
 	setPage(page:number):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -4177,7 +4342,7 @@ interface menuConfig{
 	borderless?: boolean;
 	click?: string|WebixCallback;
 	clipboard?: boolean|string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -4190,20 +4355,21 @@ interface menuConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	layout?: string;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	mouseEventDelay?: number;
-	multiselect?: any;
+	multiselect?: boolean;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
 	onContext?: { [key: string]: any; };
 	onDblClick?: WebixCallback;
 	onMouseMove?: WebixCallback;
+	openAction?: string;
 	pager?: any;
 	ready?: WebixCallback;
 	removeMissed?: boolean;
@@ -4214,7 +4380,7 @@ interface menuConfig{
 	scrollSpeed?: string;
 	select?: boolean|string;
 	subMenuPos?: string;
-	submenu?: any;
+	submenuConfig?: any;
 	template?: string|WebixCallback;
 	templateCopy?: WebixCallback;
 	tooltip?: any;
@@ -4224,74 +4390,76 @@ interface menuConfig{
 	xCount?: number;
 	yCount?: number;
 }
+type menuEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMenuItemClick'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPaste'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface menu extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:menuEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
 	destructor():void;
 	detachEvent(id:string):void;
 	disable():void;
-	disableItem(id:string):void;
+	disableItem(id:string|number):void;
 	enable():void;
-	enableItem(id:string):void;
-	exists(id:string):boolean;
+	enableItem(id:string|number):void;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
 	getMenu(id:string|number):any;
-	getMenuItem(id:string):any;
-	getNextId(id:string, step:number):string;
+	getMenuItem(id:string|number):any;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getSubMenu(id:string|number):any;
 	getTopMenu():any;
 	getTopParentView():webix.ui.baseview;
 	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
-	hideItem(id:string):void;
+	hideItem(id:string|number):void;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
@@ -4299,23 +4467,25 @@ interface menu extends webix.ui.baseview{
 	serialize():any;
 	setPage(page:number):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
+	sizeToContent():void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -4334,60 +4504,61 @@ interface menu extends webix.ui.baseview{
 interface multicomboConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
+	button?: boolean;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	icon?: string;
-	iconWidth?: any;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
+	keepText?: boolean;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
-	master?: any;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	name?: string;
+	newValues?: boolean;
 	on?: any;
 	optionWidth?: number;
 	options?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	popupWidth?: number;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	separator?: string;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
+	tagMode?: boolean;
+	tagTemplate?: WebixCallback;
 	text?: string;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type multicomboEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface multicombo extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:multicomboEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -4401,6 +4572,7 @@ interface multicombo extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getInputNode():HTMLElement;
+	getList():webix.ui.baseview;
 	getNode():any;
 	getParentView():any;
 	getPopup():webix.ui.baseview;
@@ -4413,22 +4585,23 @@ interface multicombo extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
+
 	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
-	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -4438,18 +4611,18 @@ interface multicombo extends webix.ui.baseview{
 	config: multicomboConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface multiselectConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -4457,15 +4630,14 @@ interface multiselectConfig{
 	hidden?: boolean;
 	hotkey?: string;
 	icon?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
-	master?: any;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -4475,27 +4647,26 @@ interface multiselectConfig{
 	optionWidth?: number;
 	options?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	popupWidth?: number;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	separator?: string;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	text?: string;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type multiselectEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface multiselect extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:multiselectEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -4509,6 +4680,7 @@ interface multiselect extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getInputNode():HTMLElement;
+	getList():webix.ui.baseview;
 	getNode():any;
 	getParentView():any;
 	getPopup():webix.ui.baseview;
@@ -4521,22 +4693,24 @@ interface multiselect extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
+
 	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -4546,7 +4720,7 @@ interface multiselect extends webix.ui.baseview{
 	config: multiselectConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface multisuggestConfig{
 	animate?: any;
@@ -4556,7 +4730,7 @@ interface multisuggestConfig{
 	borderless?: boolean;
 	button?: boolean;
 	buttonText?: string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	filter?: WebixCallback;
@@ -4566,8 +4740,8 @@ interface multisuggestConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
-	input?: any;
+	id?: string|number;
+	input?: HTMLElement|string;
 	keyPressTimeout?: number;
 	left?: number;
 	master?: webix.ui.baseview;
@@ -4581,17 +4755,21 @@ interface multisuggestConfig{
 	padding?: any;
 	position?: string|WebixCallback;
 	relative?: string;
+	resize?: boolean;
 	separator?: string;
 	template?: string|WebixTemplate;
 	textValue?: string;
+	toFront?: boolean;
 	top?: number;
 	type?: string;
+	value?: string|number;
 	width?: number;
 	zIndex?: number;
 }
+type multisuggestEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValueSuggest'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface multisuggest extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:multisuggestEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -4606,7 +4784,7 @@ interface multisuggest extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getHead():any;
-	getItemText(id:string):string;
+	getItemText(id:string|number):string;
 	getList():webix.ui.baseview;
 	getMasterValue():any;
 	getNode():any;
@@ -4628,7 +4806,8 @@ interface multisuggest extends webix.ui.baseview{
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -4641,13 +4820,13 @@ interface multisuggest extends webix.ui.baseview{
 interface multitextConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -4656,11 +4835,11 @@ interface multitextConfig{
 	hotkey?: string;
 	icon?: string;
 	iconWidth?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -4671,26 +4850,25 @@ interface multitextConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	separator?: string;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type multitextEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface multitext extends webix.ui.baseview{
 	addSection():string|number;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:multitextEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -4716,8 +4894,9 @@ interface multitext extends webix.ui.baseview{
 	mapEvent(map:any):void;
 	refresh():void;
 	removeSection(id?:string|number):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	setValueHere(value:string|number):void;
 	show(force?:boolean, animation?:boolean):void;
@@ -4725,14 +4904,15 @@ interface multitext extends webix.ui.baseview{
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
+
 	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -4742,22 +4922,22 @@ interface multitext extends webix.ui.baseview{
 	config: multitextConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface multiviewConfig{
 	animate?: any;
 	borderless?: boolean;
 	cells?: any;
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	fitBiggest?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
-	keepViews?: any;
+	id?: string|number;
+	keepViews?: boolean;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -4768,10 +4948,11 @@ interface multiviewConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type multiviewEventName ='onBeforeBack'|'onBindRequest'|'onDestruct'|'onViewChange';
 interface multiview extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:multiviewEventName, functor:WebixCallback, id?:string):string|number;
 	back(step:number):void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
@@ -4787,7 +4968,7 @@ interface multiview extends webix.ui.baseview{
 	getNode():any;
 	getParentView():any;
 	getTopParentView():webix.ui.baseview;
-	getValue():string;
+	getValue():string|number;
 	hasEvent(name:string):boolean;
 	hide():void;
 	index(obj:any):number;
@@ -4795,15 +4976,16 @@ interface multiview extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	reconstruct():void;
-	removeView(id:string):void;
+	removeView(id:string|number):void;
 	resize():void;
 	resizeChildren():void;
-	setValue(toshow:string):void;
+	setValue(toshow:string|number):void;
 	show(force?:boolean, animation?:boolean):void;
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -4818,7 +5000,7 @@ interface organogramConfig{
 	autowidth?: boolean;
 	borderless?: boolean;
 	click?: string|WebixCallback;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -4829,13 +5011,13 @@ interface organogramConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	mouseEventDelay?: number;
-	multiselect?: any;
+	multiselect?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
 	onContext?: { [key: string]: any; };
@@ -4855,17 +5037,18 @@ interface organogramConfig{
 	url?: string;
 	width?: number;
 }
+type organogramEventName ='onAfterAdd'|'onAfterClose'|'onAfterContextMenu'|'onAfterDelete'|'onAfterLoad'|'onAfterOpen'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeClose'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeLoad'|'onBeforeOpen'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onFocus'|'onItemCheck'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface organogram extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:organogramEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
-	close(id:string):void;
+	close(id:string|number):void;
 	closeAll():void;
 	count():number;
 	customize(obj:any):void;
@@ -4874,52 +5057,53 @@ interface organogram extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBranchIndex(id:string, parent?:string):number;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getBranchIndex(id:string|number, parent?:string|number):number;
 	getChildViews():any[];
-	getFirstChildId(id:string):string;
-	getFirstId():string;
+	getFirstChildId(id:string|number):string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getNextSiblingId(id:string|number):string|number;
 	getNode():any;
 	getOpenItems():any[];
-	getParentId(id:string):string;
+	getParentId(id:string|number):string|number;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
+	getPrevId(id:string|number, step:number):string|number;
+	getPrevSiblingId(id:string|number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getState():any;
 	getTopParentView():webix.ui.baseview;
 	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
-	isBranch(id:string):boolean;
-	isBranchOpen(id:string):boolean;
+	isBranch(id:string|number):boolean;
+	isBranchOpen(id:string|number):boolean;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	loadBranch(id:string|number, callback:WebixCallback, url:string):void;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
-	open(id:string):void;
+	open(id:string|number, show?:boolean):void;
 	openAll():void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
@@ -4927,7 +5111,7 @@ interface organogram extends webix.ui.baseview{
 	serialize():any;
 	setState(state:any):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
@@ -4935,8 +5119,9 @@ interface organogram extends webix.ui.baseview{
 	ungroup(mode:boolean):void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
-	$getSize():any[];
+	updateItem(id:string|number, data:any):void;
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -4954,10 +5139,9 @@ interface organogram extends webix.ui.baseview{
 }
 interface pagerConfig{
 	animate?: any;
-	apiOnly?: any;
+	apiOnly?: boolean;
 	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	count?: number;
 	css?: string;
 	disabled?: boolean;
@@ -4965,7 +5149,7 @@ interface pagerConfig{
 	group?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	limit?: number;
 	maxHeight?: number;
 	maxWidth?: number;
@@ -4982,9 +5166,10 @@ interface pagerConfig{
 	template?: string|WebixCallback;
 	width?: number;
 }
+type pagerEventName ='onAfterContextMenu'|'onAfterRender'|'onAfterScroll'|'onBeforeContextMenu'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface pager extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:pagerEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -5005,15 +5190,16 @@ interface pager extends webix.ui.baseview{
 	isEnabled():boolean;
 	isVisible():boolean;
 	mapEvent(map:any):void;
-	refresh(id?:string):void;
-	render(id:string, data:any, type:string):void;
+	refresh(id?:string|number):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	select(page:number):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -5034,7 +5220,7 @@ interface popupConfig{
 	autofocus?: boolean;
 	body?: string|webix.ui.baseview;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -5042,7 +5228,7 @@ interface popupConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	left?: number;
 	maxHeight?: number;
 	maxWidth?: number;
@@ -5054,13 +5240,16 @@ interface popupConfig{
 	padding?: any;
 	position?: string|WebixCallback;
 	relative?: string;
+	resize?: boolean;
+	toFront?: boolean;
 	top?: number;
 	width?: number;
 	zIndex?: number;
 }
+type popupEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface popup extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:popupEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -5085,10 +5274,11 @@ interface popup extends webix.ui.baseview{
 	resize():void;
 	resizeChildren():void;
 	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
+	show(node?:HTMLElement, position?:any, point?:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+	show(force:boolean,animation:boolean):void;
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -5103,13 +5293,13 @@ interface portletConfig{
 	body?: string|webix.ui.baseview;
 	borderless?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	isolate?: boolean;
 	layoutType?: string;
 	margin?: number;
@@ -5127,10 +5317,11 @@ interface portletConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type portletEventName ='onBindRequest'|'onDestruct';
 interface portlet extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:portletEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -5153,15 +5344,16 @@ interface portlet extends webix.ui.baseview{
 	markDropArea(target:string, mode:string):void;
 	movePortlet(target:string, mode:string):void;
 	reconstruct():void;
-	removeView(id:string):void;
+	removeView(id:string|number):void;
 	resize():void;
 	resizeChildren():void;
 	show(force?:boolean, animation?:boolean):void;
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
+
 	$drag(source:HTMLElement, ev:Event):string;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -5174,11 +5366,10 @@ interface propertyConfig{
 	animate?: any;
 	autoheight?: boolean;
 	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	complexData?: boolean;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
-	dataFeed?: string|WebixCallback;
 	datatype?: string;
 	disabled?: boolean;
 	editValue?: string;
@@ -5189,7 +5380,8 @@ interface propertyConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
+	map?: any;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -5204,12 +5396,14 @@ interface propertyConfig{
 	scroll?: boolean|string;
 	scrollSpeed?: string;
 	template?: string|WebixCallback;
+	tooltip?: any;
 	url?: string;
 	width?: number;
 }
+type propertyEventName ='onAfterContextMenu'|'onAfterEditStart'|'onAfterEditStop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onBeforeContextMenu'|'onBeforeEditStart'|'onBeforeEditStop'|'onBeforeLoad'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLiveEdit'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface property extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:propertyEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -5230,7 +5424,7 @@ interface property extends webix.ui.baseview{
 	getEditorValue():string;
 	getFormView():webix.ui.baseview;
 	getItem(id:string):any;
-	getItemNode(id:string):void;
+	getItemNode(id:string|number):void;
 	getNode():any;
 	getParentView():any;
 	getScrollState():any;
@@ -5240,24 +5434,25 @@ interface property extends webix.ui.baseview{
 	hide():void;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	locate(e:Event):string;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
+	refresh(id?:string|number):void;
 	registerType(name:string, data:any):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	setValues(values:any, update?:boolean):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	updateItem():void;
-	validateEditor(id?:string):boolean;
-	$getSize():any[];
+	validateEditor(id?:string|number):boolean;
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -5277,13 +5472,13 @@ interface property extends webix.ui.baseview{
 interface radioConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	customRadio?: boolean;
 	disabled?: boolean;
@@ -5291,11 +5486,11 @@ interface radioConfig{
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -5307,26 +5502,23 @@ interface radioConfig{
 	on?: any;
 	optionHeight?: number;
 	options?: any[];
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
+	popup?: string;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	vertical?: boolean;
 	width?: number;
 }
+type radioEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface radio extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:radioEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -5350,21 +5542,23 @@ interface radio extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -5374,33 +5568,178 @@ interface radio extends webix.ui.baseview{
 	config: radioConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
+}
+interface rangechartConfig{
+	alpha?: number;
+	animate?: any;
+	barWidth?: number;
+	border?: boolean;
+	borderColor?: string;
+	borderless?: boolean;
+	cant?: number;
+	color?: string|WebixCallback;
+	container?: string|HTMLElement;
+	css?: string;
+	data?: string|any[];
+	datathrottle?: number;
+	datatype?: string;
+	disableLines?: boolean;
+	disabled?: boolean;
+	eventRadius?: number;
+	fill?: string;
+	fixOverflow?: boolean;
+	frameId?: string;
+	gradient?: boolean|string|WebixCallback;
+	gravity?: number;
+	height?: number;
+	hidden?: boolean;
+	id?: string|number;
+	item?: any;
+	label?: string|WebixCallback;
+	labelOffset?: number;
+	legend?: any;
+	line?: any;
+	lineColor?: string;
+	maxHeight?: number;
+	maxWidth?: number;
+	minHeight?: number;
+	minWidth?: number;
+	mouseEventDelay?: number;
+	offset?: boolean;
+	on?: any;
+	onClick?: { [key: string]: any; };
+	onContext?: { [key: string]: any; };
+	onDblClick?: WebixCallback;
+	onMouseMove?: WebixCallback;
+	origin?: number;
+	padding?: any;
+	pieHeight?: number;
+	pieInnerText?: string|WebixCallback;
+	preset?: string;
+	radius?: number;
+	range?: any;
+	ready?: WebixCallback;
+	removeMissed?: boolean;
+	save?: string;
+	scale?: string;
+	scheme?: any;
+	series?: any;
+	shadow?: boolean;
+	tooltip?: any;
+	type?: string;
+	url?: string;
+	value?: string|WebixTemplate;
+	width?: number;
+	x?: number;
+	xAxis?: any;
+	xValue?: string;
+	y?: number;
+	yAxis?: any;
+	yValue?: string;
+}
+type rangechartEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterLoad'|'onAfterRangeChange'|'onAfterRender'|'onAfterScroll'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onFocus'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
+interface rangechart extends webix.ui.baseview{
+	add(obj:any, index?:number):string|number;
+	addSeries(obj:any):void;
+	adjust():void;
+	attachEvent(type:rangechartEventName, functor:WebixCallback, id?:string):string|number;
+	bind(target:any, rule?:WebixCallback, format?:string):void;
+	blockEvent():void;
+	callEvent(name:string, params:any[]):boolean;
+	clearAll():void;
+	clearCanvas():void;
+	count():number;
+	define(property:string, value:any):void;
+	destructor():void;
+	detachEvent(id:string):void;
+	disable():void;
+	enable():void;
+	exists(id:string|number):boolean;
+	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getChildViews():any[];
+	getFirstId():string|number;
+	getFormView():webix.ui.baseview;
+	getFrameData():any[];
+	getFrameRange():any;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getNode():any;
+	getParentView():any;
+	getPrevId(id:string|number, step:number):string|number;
+	getTopParentView():webix.ui.baseview;
+	group(config:any, mode:boolean):void;
+	hasEvent(name:string):boolean;
+	hide():void;
+	hideSeries(series:string):void;
+	isEnabled():boolean;
+	isVisible():boolean;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
+	locate(e:Event):string|number;
+	mapEvent(map:any):void;
+	parse(data:any, type:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
+	removeAllSeries():void;
+	render(id:string|number, data:any, type:string):void;
+	resize():void;
+	serialize():any;
+	setFrameRange(range:any):void;
+	show(force?:boolean, animation?:boolean):void;
+	showSeries(series:string):void;
+	sort(by:string, dir?:string, as?:string):void;
+	sync(source:any, filter:WebixCallback, silent:boolean):void;
+	unbind():void;
+	unblockEvent():void;
+	ungroup(mode:boolean):void;
+	updateItem(id:string|number, data:any):void;
+
+	$getSize: any[];
+	$height: number;
+	$scope: any;
+	$setSize(x:number, y:number):boolean;
+	$skin: any;
+	$view: HTMLElement;
+	$width: number;
+	colormap: { [key: string]: any; };
+	config: rangechartConfig;
+	name: string;
+	on_click: WebixCallback;
+	on_context: { [key: string]: any; };
+	on_dblclick: WebixCallback;
+	on_mouse_move: WebixCallback;
+	presets: { [key: string]: any; };
 }
 interface rangesliderConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
-	max?: any;
+	max?: number;
 	maxHeight?: number;
 	maxWidth?: number;
 	min?: number;
@@ -5408,29 +5747,26 @@ interface rangesliderConfig{
 	minWidth?: number;
 	name?: string;
 	on?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
+	popup?: string;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	separator?: string;
 	step?: number;
 	stringResult?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	title?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type rangesliderEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSliderDrag'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface rangeslider extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:rangesliderEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -5454,22 +5790,24 @@ interface rangeslider extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
+
 	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -5480,18 +5818,18 @@ interface rangeslider extends webix.ui.baseview{
 	config: rangesliderConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface resizerConfig{
 	animate?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -5503,6 +5841,7 @@ interface resizerConfig{
 	onMouseMove?: WebixCallback;
 	width?: number;
 }
+type resizerEventName ='onAfterContextMenu'|'onAfterScroll'|'onBeforeContextMenu'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface resizer extends webix.ui.baseview{
 	adjust():void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
@@ -5521,7 +5860,8 @@ interface resizer extends webix.ui.baseview{
 	resize():void;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -5538,13 +5878,13 @@ interface resizer extends webix.ui.baseview{
 interface richselectConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -5552,11 +5892,11 @@ interface richselectConfig{
 	hidden?: boolean;
 	hotkey?: string;
 	icon?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -5568,26 +5908,25 @@ interface richselectConfig{
 	on?: any;
 	options?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	popupWidth?: number;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	text?: string;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type richselectEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface richselect extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:richselectEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -5601,6 +5940,7 @@ interface richselect extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getInputNode():HTMLElement;
+	getList():webix.ui.baseview;
 	getNode():any;
 	getParentView():any;
 	getPopup():webix.ui.baseview;
@@ -5613,21 +5953,23 @@ interface richselect extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -5637,32 +5979,38 @@ interface richselect extends webix.ui.baseview{
 	config: richselectConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface scrollviewConfig{
 	animate?: any;
 	body?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
+	on?: any;
 	scroll?: boolean|string;
 	scrollSpeed?: string;
 	width?: number;
 }
+type scrollviewEventName ='onAfterScroll'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface scrollview extends webix.ui.baseview{
 	adjust():void;
+	attachEvent(type:scrollviewEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
+	blockEvent():void;
+	callEvent(name:string, params:any[]):boolean;
 	define(property:string, value:any):void;
 	destructor():void;
+	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
 	getBody():any;
@@ -5672,16 +6020,20 @@ interface scrollview extends webix.ui.baseview{
 	getParentView():any;
 	getScrollState():any;
 	getTopParentView():webix.ui.baseview;
+	hasEvent(name:string):boolean;
 	hide():void;
 	isEnabled():boolean;
 	isVisible():boolean;
+	mapEvent(map:any):void;
 	resize():void;
 	resizeChildren():void;
 	scrollTo(x:number, y:number):void;
 	show(force?:boolean, animation?:boolean):void;
-	showView(id:string):void;
+	showView(id:string|number):void;
 	unbind():void;
-	$getSize():any[];
+	unblockEvent():void;
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -5694,13 +6046,13 @@ interface scrollview extends webix.ui.baseview{
 interface searchConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
@@ -5708,11 +6060,11 @@ interface searchConfig{
 	hidden?: boolean;
 	hotkey?: string;
 	icon?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -5723,24 +6075,24 @@ interface searchConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
 	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type searchEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSearchIconClick'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface search extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:searchEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -5764,21 +6116,23 @@ interface search extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -5788,29 +6142,29 @@ interface search extends webix.ui.baseview{
 	config: searchConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface segmentedConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -5821,27 +6175,25 @@ interface segmentedConfig{
 	multiview?: boolean;
 	name?: string;
 	on?: any;
+	optionWidth?: number;
 	options?: any;
-	placeholder?: string;
-	popup?: any;
-	readonly?: boolean;
+	popup?: string;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type segmentedEventName ='onAfterRender'|'onAfterScroll'|'onAfterTabClick'|'onBeforeRender'|'onBeforeTabClick'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onOptionRemove'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface segmented extends webix.ui.baseview{
-	addOption(id:string, value:any, show?:boolean, index?:number):void;
+	addOption(id:string|number, value:any, show?:boolean, index?:number):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:segmentedEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -5864,24 +6216,26 @@ interface segmented extends webix.ui.baseview{
 	isEnabled():boolean;
 	isVisible():boolean;
 	mapEvent(map:any):void;
-	optionIndex(ID:string):number;
+	optionIndex(ID:string|number):number;
 	refresh():void;
-	removeOption(id:string):void;
-	render(id:string, data:any, type:string):void;
+	removeOption(id:string|number):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -5891,29 +6245,29 @@ interface segmented extends webix.ui.baseview{
 	config: segmentedConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface selectConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -5925,24 +6279,23 @@ interface selectConfig{
 	on?: any;
 	options?: any[]|string;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type selectEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface select extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:selectEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -5966,21 +6319,23 @@ interface select extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -5990,33 +6345,108 @@ interface select extends webix.ui.baseview{
 	config: selectConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
+}
+interface sidemenuConfig{
+	animate?: any;
+	autofit?: boolean;
+	autofocus?: boolean;
+	body?: string|webix.ui.baseview;
+	borderless?: boolean;
+	container?: string|HTMLElement;
+	css?: string;
+	disabled?: boolean;
+	gravity?: number;
+	head?: any;
+	headHeight?: number;
+	height?: number;
+	hidden?: boolean;
+	id?: string|number;
+	left?: number;
+	maxHeight?: number;
+	maxWidth?: number;
+	minHeight?: number;
+	minWidth?: number;
+	modal?: boolean;
+	move?: boolean;
+	on?: any;
+	padding?: any;
+	position?: string|WebixCallback;
+	relative?: string;
+	resize?: boolean;
+	state?: WebixCallback;
+	toFront?: boolean;
+	top?: number;
+	width?: number;
+	zIndex?: number;
+}
+type sidemenuEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
+interface sidemenu extends webix.ui.baseview{
+	adjust():void;
+	attachEvent(type:sidemenuEventName, functor:WebixCallback, id?:string):string|number;
+	bind(target:any, rule?:WebixCallback, format?:string):void;
+	blockEvent():void;
+	callEvent(name:string, params:any[]):boolean;
+	close():void;
+	define(property:string, value:any):void;
+	destructor():void;
+	detachEvent(id:string):void;
+	disable():void;
+	enable():void;
+	getBody():any;
+	getChildViews():any[];
+	getFormView():webix.ui.baseview;
+	getHead():any;
+	getNode():any;
+	getParentView():any;
+	getTopParentView():webix.ui.baseview;
+	hasEvent(name:string):boolean;
+	hide():void;
+	isEnabled():boolean;
+	isVisible():boolean;
+	mapEvent(map:any):void;
+	resize():void;
+	resizeChildren():void;
+	setPosition(x:number, y:number):void;
+	show(force?:boolean, animation?:boolean):void;
+	unbind():void;
+	unblockEvent():void;
+
+	$getSize: any[];
+	$height: number;
+	$scope: any;
+	$setSize(x:number, y:number):boolean;
+	$skin: any;
+	$view: HTMLElement;
+	$width: number;
+	config: sidemenuConfig;
+	name: string;
 }
 interface sliderConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
-	max?: any;
+	max?: number;
 	maxHeight?: number;
 	maxWidth?: number;
 	min?: number;
@@ -6025,26 +6455,25 @@ interface sliderConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
 	step?: number;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	title?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type sliderEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSliderDrag'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface slider extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:sliderEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -6068,21 +6497,23 @@ interface slider extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -6093,24 +6524,25 @@ interface slider extends webix.ui.baseview{
 	config: sliderConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface spacerConfig{
 	animate?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	width?: number;
 }
+type spacerEventName ='onAfterScroll'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface spacer extends webix.ui.baseview{
 	adjust():void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
@@ -6129,7 +6561,8 @@ interface spacer extends webix.ui.baseview{
 	resize():void;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -6139,6 +6572,107 @@ interface spacer extends webix.ui.baseview{
 	config: spacerConfig;
 	name: string;
 }
+interface spreadsheetConfig{
+	animate?: any;
+	borderless?: boolean;
+	buttons?: any;
+	cols?: any[];
+	columnCount?: number;
+	container?: string|HTMLElement;
+	css?: string;
+	data?: string|any[];
+	datatype?: string;
+	disabled?: boolean;
+	gravity?: number;
+	height?: number;
+	hidden?: boolean;
+	id?: string|number;
+	isolate?: boolean;
+	liveEditor?: boolean;
+	margin?: number;
+	math?: boolean;
+	maxHeight?: number;
+	maxWidth?: number;
+	minHeight?: number;
+	minWidth?: number;
+	on?: any;
+	padding?: number;
+	paddingX?: number;
+	paddingY?: number;
+	readonly?: boolean;
+	resizeCell?: boolean;
+	responsive?: string;
+	rowCount?: number;
+	rows?: any[];
+	subbar?: any;
+	type?: string;
+	url?: string;
+	visibleBatch?: string;
+	width?: number;
+}
+type spreadsheetEventName ='onAfterLoad'|'onAfterSelect'|'onBeforeLoad'|'onBeforeSpan'|'onBeforeSplit'|'onBindRequest'|'onCellChange'|'onComponentInit'|'onDataParse'|'onDataSerialize'|'onDestruct'|'onLoadError'|'onReset';
+interface spreadsheet extends webix.ui.baseview{
+	addView(view:any, index?:number):webix.ui.baseview;
+	adjust():void;
+	attachEvent(type:spreadsheetEventName, functor:WebixCallback, id?:string):string|number;
+	bind(target:any, rule?:WebixCallback, format?:string):void;
+	blockEvent():void;
+	callEvent(name:string, params:any[]):boolean;
+	combineCells(range:any):void;
+	define(property:string, value:any):void;
+	destructor():void;
+	detachEvent(id:string):void;
+	disable():void;
+	eachSelectedCell(handler:WebixCallback):void;
+	enable():void;
+	getCellValue(row:number, column:number):string;
+	getChildViews():any[];
+	getColumn(id:string):any;
+	getFormView():webix.ui.baseview;
+	getNode():any;
+	getParentView():any;
+	getRow(id:string):any;
+	getSelectedId():any[];
+	getStyle(row:number, column:number):string;
+	getTopParentView():webix.ui.baseview;
+	hasEvent(name:string):boolean;
+	hide():void;
+	index(obj:any):number;
+	innerId(id:string|number):string|number;
+	isEnabled():boolean;
+	isVisible():boolean;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	mapEvent(map:any):void;
+	parse(data:any, type:string):void;
+	reconstruct():void;
+	redo():void;
+	refresh():void;
+	removeView(id:string|number):void;
+	reset():void;
+	resize():void;
+	resizeChildren():void;
+	saveCell(row:number, column:number):void;
+	serialize():any;
+	setCellValue(row:number, column:any, value:string):void;
+	setStyle(row:number, column:number, style:string):void;
+	show(force?:boolean, animation?:boolean):void;
+	showBatch(name:string):void;
+	splitCell(row:number, column:number):void;
+	ui(view:any):webix.ui.baseview;
+	unbind():void;
+	unblockEvent():void;
+	undo(id:string):void;
+
+	$$: any;
+	$getSize: any[];
+	$height: number;
+	$setSize(x:number, y:number):boolean;
+	$skin: any;
+	$view: HTMLElement;
+	$width: number;
+	config: spreadsheetConfig;
+	name: string;
+}
 interface submenuConfig{
 	animate?: any;
 	autofit?: boolean;
@@ -6149,7 +6683,7 @@ interface submenuConfig{
 	borderless?: boolean;
 	click?: string|WebixCallback;
 	clipboard?: boolean|string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -6164,7 +6698,7 @@ interface submenuConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	layout?: string;
 	left?: number;
 	maxHeight?: number;
@@ -6174,19 +6708,21 @@ interface submenuConfig{
 	modal?: boolean;
 	mouseEventDelay?: number;
 	move?: boolean;
-	multiselect?: any;
+	multiselect?: boolean;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
 	onContext?: { [key: string]: any; };
 	onDblClick?: WebixCallback;
 	onMouseMove?: WebixCallback;
+	openAction?: string;
 	padding?: any;
 	pager?: any;
 	position?: string|WebixCallback;
 	ready?: WebixCallback;
 	relative?: string;
 	removeMissed?: boolean;
+	resize?: boolean;
 	rules?: any;
 	save?: string;
 	scheme?: any;
@@ -6194,9 +6730,10 @@ interface submenuConfig{
 	scrollSpeed?: string;
 	select?: boolean|string;
 	subMenuPos?: string;
-	submenu?: any;
+	submenuConfig?: any;
 	template?: string|WebixCallback;
 	templateCopy?: WebixCallback;
+	toFront?: boolean;
 	tooltip?: any;
 	top?: number;
 	type?: any;
@@ -6206,11 +6743,12 @@ interface submenuConfig{
 	yCount?: number;
 	zIndex?: number;
 }
+type submenuEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeShow'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onHide'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMenuItemClick'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPaste'|'onSelectChange'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface submenu extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:submenuEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -6218,65 +6756,66 @@ interface submenu extends webix.ui.baseview{
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
 	close():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
 	destructor():void;
 	detachEvent(id:string):void;
 	disable():void;
-	disableItem(id:string):void;
+	disableItem(id:string|number):void;
 	enable():void;
-	enableItem(id:string):void;
-	exists(id:string):boolean;
+	enableItem(id:string|number):void;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getBody():any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
 	getHead():any;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
 	getMenu(id:string|number):any;
-	getMenuItem(id:string):any;
-	getNextId(id:string, step:number):string;
+	getMenuItem(id:string|number):any;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getSubMenu(id:string|number):any;
 	getTopMenu():any;
 	getTopParentView():webix.ui.baseview;
 	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
-	hideItem(id:string):void;
+	hideItem(id:string|number):void;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	resizeChildren():void;
 	scrollTo(x:number, y:number):void;
@@ -6285,24 +6824,26 @@ interface submenu extends webix.ui.baseview{
 	serialize():any;
 	setPage(page:number):void;
 	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	show(node?:HTMLElement, position?:any, point?:string):void;
+	showItem(id:string|number):void;
+	sizeToContent():void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+	show(force:boolean,animation:boolean):void;
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -6324,7 +6865,7 @@ interface suggestConfig{
 	autofocus?: boolean;
 	body?: string|webix.ui.baseview;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	filter?: WebixCallback;
@@ -6334,8 +6875,8 @@ interface suggestConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
-	input?: any;
+	id?: string|number;
+	input?: HTMLElement|string;
 	keyPressTimeout?: number;
 	left?: number;
 	master?: webix.ui.baseview;
@@ -6349,16 +6890,19 @@ interface suggestConfig{
 	padding?: any;
 	position?: string|WebixCallback;
 	relative?: string;
+	resize?: boolean;
 	template?: string|WebixTemplate;
 	textValue?: string;
+	toFront?: boolean;
 	top?: number;
 	type?: string;
 	width?: number;
 	zIndex?: number;
 }
+type suggestEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValueSuggest'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface suggest extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:suggestEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -6372,7 +6916,7 @@ interface suggest extends webix.ui.baseview{
 	getChildViews():any[];
 	getFormView():webix.ui.baseview;
 	getHead():any;
-	getItemText(id:string):string;
+	getItemText(id:string|number):string;
 	getList():webix.ui.baseview;
 	getMasterValue():any;
 	getNode():any;
@@ -6391,10 +6935,11 @@ interface suggest extends webix.ui.baseview{
 	setMasterValue(value:any):void;
 	setPosition(x:number, y:number):void;
 	setValue(value:string|number):void;
-	show(force?:boolean, animation?:boolean):void;
+	show(node:HTMLElement, position?:any, point?:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+	show(force:boolean,animation:boolean):void;
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -6407,25 +6952,25 @@ interface suggest extends webix.ui.baseview{
 interface tabbarConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
+	bottomLabel?: string;
 	bottomOffset?: number;
-	bottomPadding?: any;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -6437,36 +6982,37 @@ interface tabbarConfig{
 	multiview?: boolean;
 	name?: string;
 	on?: any;
+	optionWidth?: number;
 	options?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	popupTemplate?: WebixCallback;
 	popupWidth?: number;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
 	tabMargin?: number;
 	tabMinWidth?: number;
 	tabMoreWidth?: number;
 	tabOffset?: number;
 	tabbarPopup?: webix.ui.baseview;
-	template?: string|WebixCallback;
 	tooltip?: string;
 	topOffset?: number;
 	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 	yCount?: number;
 }
+type tabbarEventName ='onAfterRender'|'onAfterScroll'|'onAfterTabClick'|'onBeforeRender'|'onBeforeTabClick'|'onBeforeTabClose'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onOptionRemove'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface tabbar extends webix.ui.baseview{
-	addOption(id:string, value:any, show?:boolean, index?:number):void;
+	addOption(id:string|number, value:any, show?:boolean, index?:number):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:tabbarEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -6490,24 +7036,26 @@ interface tabbar extends webix.ui.baseview{
 	isEnabled():boolean;
 	isVisible():boolean;
 	mapEvent(map:any):void;
-	optionIndex(ID:string):number;
+	optionIndex(ID:string|number):number;
 	refresh():void;
-	removeOption(id:string):void;
-	render(id:string, data:any, type:string):void;
+	removeOption(id:string|number):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -6517,20 +7065,20 @@ interface tabbar extends webix.ui.baseview{
 	config: tabbarConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface tabviewConfig{
 	animate?: any;
 	borderless?: boolean;
 	cells?: any[];
 	cols?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	isolate?: boolean;
 	margin?: number;
 	maxHeight?: number;
@@ -6549,10 +7097,11 @@ interface tabviewConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type tabviewEventName ='onBindRequest'|'onDestruct';
 interface tabview extends webix.ui.baseview{
-	addView(view:any, index?:number):webix.ui.baseview;
+	addView(view:any):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:tabviewEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -6576,7 +7125,7 @@ interface tabview extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	reconstruct():void;
-	removeView(id:string):void;
+	removeView(id:string|number):void;
 	resize():void;
 	resizeChildren():void;
 	setValue(value:string):void;
@@ -6584,7 +7133,8 @@ interface tabview extends webix.ui.baseview{
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -6595,10 +7145,10 @@ interface tabview extends webix.ui.baseview{
 }
 interface templateConfig{
 	animate?: any;
-	autoheight?: any;
+	autoheight?: boolean;
 	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
+	content?: string|number|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -6607,7 +7157,7 @@ interface templateConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -6622,9 +7172,10 @@ interface templateConfig{
 	url?: string;
 	width?: number;
 }
+type templateEventName ='onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onBeforeLoad'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface template extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:templateEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -6639,15 +7190,16 @@ interface template extends webix.ui.baseview{
 	getParentView():any;
 	getScrollState():any;
 	getTopParentView():webix.ui.baseview;
+	getValues():void;
 	hasEvent(name:string):boolean;
 	hide():void;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	mapEvent(map:any):void;
 	parse(data:any, type:string):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	setContent(node:any):void;
@@ -6657,7 +7209,8 @@ interface template extends webix.ui.baseview{
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -6670,24 +7223,25 @@ interface template extends webix.ui.baseview{
 interface textConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	icon?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -6698,24 +7252,24 @@ interface textConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
 	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type textEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface text extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:textEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -6739,21 +7293,23 @@ interface text extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(config:any):HTMLElement;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -6763,29 +7319,29 @@ interface text extends webix.ui.baseview{
 	config: textConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface textareaConfig{
 	align?: string;
 	animate?: any;
-	attributes?: { [key: string]: any; };
+	attributes?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
-	bottomLabel?: any;
-	bottomPadding?: any;
+	bottomLabel?: string;
+	bottomPadding?: number;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputPadding?: number;
 	inputWidth?: number;
-	invalidMessage?: any;
+	invalidMessage?: string;
 	label?: string;
 	labelPosition?: string;
 	labelWidth?: number;
@@ -6796,24 +7352,23 @@ interface textareaConfig{
 	name?: string;
 	on?: any;
 	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	readonly?: boolean;
 	relatedAction?: string;
 	relatedView?: string;
 	required?: boolean;
-	suggest?: string|webix.ui.baseview;
+	suggest?: any;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
-	type?: string;
-	validate?: boolean;
+	validate?: WebixCallback;
 	validateEvent?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type textareaEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface textarea extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:textareaEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -6837,21 +7392,23 @@ interface textarea extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
+	setBottomText(text:string):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	validate():boolean;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
 	$render: WebixCallback;
 	$renderIcon: WebixCallback;
-	$renderInput(obj:any, html:string, id:string):string;
-	$renderLabel(config:any, id:string):string;
+	$renderInput(obj:any, html:string, id:string|number):string;
+	$renderLabel(config:any, id:string|number):string;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -6861,44 +7418,46 @@ interface textarea extends webix.ui.baseview{
 	config: textareaConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface toggleConfig{
 	align?: string;
 	animate?: any;
+	autowidth?: boolean;
 	borderless?: boolean;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	icon?: string;
+	id?: string|number;
 	inputHeight?: number;
 	inputWidth?: number;
-	label?: string;
-	labelPosition?: string;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	name?: string;
+	offIcon?: string;
+	offLabel?: string;
 	on?: any;
-	placeholder?: string;
-	popup?: any;
+	onIcon?: string;
+	onLabel?: string;
+	popup?: string;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
 	type?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type toggleEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onChange'|'onDestruct'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface toggle extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:toggleEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -6922,7 +7481,7 @@ interface toggle extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
@@ -6930,9 +7489,11 @@ interface toggle extends webix.ui.baseview{
 	toggle():void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
-	$getValue():string;
+
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
+	$renderInput(config:any):HTMLElement;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
@@ -6942,13 +7503,14 @@ interface toggle extends webix.ui.baseview{
 	config: toggleConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface toolbarConfig{
 	animate?: any;
 	borderless?: boolean;
 	cols?: any[];
-	container?: HTMLElement;
+	complexData?: boolean;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -6959,7 +7521,7 @@ interface toolbarConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	isolate?: boolean;
 	margin?: number;
 	maxHeight?: number;
@@ -6980,10 +7542,11 @@ interface toolbarConfig{
 	visibleBatch?: string;
 	width?: number;
 }
+type toolbarEventName ='onAfterLoad'|'onAfterScroll'|'onAfterValidation'|'onBeforeLoad'|'onBeforeValidate'|'onBindRequest'|'onChange'|'onDestruct'|'onLoadError'|'onValidationError'|'onValidationSuccess'|'onValues';
 interface toolbar extends webix.ui.baseview{
 	addView(view:any, index?:number):webix.ui.baseview;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:toolbarEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -7010,13 +7573,14 @@ interface toolbar extends webix.ui.baseview{
 	isDirty():boolean;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	mapEvent(map:any):void;
+	markInvalid(name:string, state?:boolean|string):void;
 	parse(data:any, type:string):void;
 	reconstruct():void;
 	refresh():void;
-	removeView(id:string):void;
-	render(id:string, data:any, type:string):void;
+	removeView(id:string|number):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	resizeChildren():void;
 	scrollTo(x:number, y:number):void;
@@ -7026,8 +7590,9 @@ interface toolbar extends webix.ui.baseview{
 	showBatch(name:string):void;
 	unbind():void;
 	unblockEvent():void;
-	validate():boolean;
-	$getSize():any[];
+	validate(mode?:any):boolean;
+
+	$getSize: any[];
 	$height: number;
 	$setSize(x:number, y:number):boolean;
 	$skin: any;
@@ -7039,8 +7604,7 @@ interface toolbar extends webix.ui.baseview{
 interface tooltipConfig{
 	animate?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	dx?: number;
@@ -7048,7 +7612,7 @@ interface tooltipConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
@@ -7057,9 +7621,10 @@ interface tooltipConfig{
 	template?: string|WebixCallback;
 	width?: number;
 }
+type tooltipEventName ='onAfterRender'|'onAfterScroll'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface tooltip extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:tooltipEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -7079,13 +7644,14 @@ interface tooltip extends webix.ui.baseview{
 	isEnabled():boolean;
 	isVisible():boolean;
 	mapEvent(map:any):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	show(force?:boolean, animation?:boolean):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -7101,10 +7667,9 @@ interface treeConfig{
 	borderless?: boolean;
 	click?: string|WebixCallback;
 	clipboard?: boolean|string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
-	dataFeed?: string|WebixCallback;
 	datathrottle?: number;
 	datatype?: string;
 	disabled?: boolean;
@@ -7114,20 +7679,19 @@ interface treeConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	mouseEventDelay?: number;
-	multiselect?: any;
+	multiselect?: boolean|string;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
 	onContext?: { [key: string]: any; };
 	onDblClick?: WebixCallback;
 	onMouseMove?: WebixCallback;
-	pager?: any;
 	ready?: WebixCallback;
 	removeMissed?: boolean;
 	rules?: any;
@@ -7144,22 +7708,23 @@ interface treeConfig{
 	url?: string;
 	width?: number;
 }
+type treeEventName ='onAfterAdd'|'onAfterClose'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterOpen'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeClose'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeOpen'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onItemCheck'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPartialRender'|'onPaste'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface tree extends webix.ui.baseview{
 	add(obj:any, index?:number, parentId?:string):string;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:treeEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
-	checkAll(id?:string):void;
+	checkAll(id?:string|number):void;
 	checkItem(id:string):void;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
-	close(id:string):void;
+	close(id:string|number):void;
 	closeAll():void;
-	copy(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
+	copy(sid:string|number, tindex:number, tobj?:webix.ui.baseview, details?:any):string|number;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
@@ -7167,56 +7732,57 @@ interface tree extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
-	getBranchIndex(id:string, parent?:string):number;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getBranchIndex(id:string|number, parent?:string|number):number;
 	getChecked():any[];
 	getChildViews():any[];
-	getFirstChildId(id:string):string;
-	getFirstId():string;
+	getFirstChildId(id:string|number):string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getNextSiblingId(id:string|number):string|number;
 	getNode():any;
 	getOpenItems():any[];
-	getParentId(id:string):string;
+	getParentId(id:string|number):string|number;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
+	getPrevId(id:string|number, step:number):string|number;
+	getPrevSiblingId(id:string|number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getState():any;
 	getTopParentView():webix.ui.baseview;
 	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
-	isBranch(id:string):boolean;
-	isBranchOpen(id:string):boolean;
-	isChecked(id:string):boolean;
+	isBranch(id:string|number):boolean;
+	isBranchOpen(id:string|number):boolean;
+	isChecked(id:string|number):boolean;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	loadBranch(id:string|number, callback:WebixCallback, url:string):void;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
 	moveSelection(direction:string):void;
-	open(id:string):void;
+	open(id:string|number, show?:boolean):void;
 	openAll():void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
@@ -7224,26 +7790,27 @@ interface tree extends webix.ui.baseview{
 	serialize():any;
 	setState(state:any):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	uncheckAll(id?:string):void;
+	uncheckAll(id?:string|number):void;
 	uncheckItem(id:string):void;
 	ungroup(mode:boolean):void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -7259,21 +7826,181 @@ interface tree extends webix.ui.baseview{
 	type: { [key: string]: any; };
 	types: { [key: string]: any; };
 }
+interface treemapConfig{
+	activeItem?: boolean;
+	animate?: any;
+	borderless?: boolean;
+	branch?: string;
+	click?: string|WebixCallback;
+	clipboard?: boolean|string;
+	container?: string|HTMLElement;
+	css?: string;
+	data?: string|any[];
+	dataFeed?: string|WebixCallback;
+	datathrottle?: number;
+	datatype?: string;
+	disabled?: boolean;
+	filterMode?: any;
+	gravity?: number;
+	header?: boolean;
+	headerHeight?: number;
+	headerTemplate?: string;
+	height?: number;
+	hidden?: boolean;
+	id?: string|number;
+	maxHeight?: number;
+	maxWidth?: number;
+	minHeight?: number;
+	minWidth?: number;
+	mouseEventDelay?: number;
+	multiselect?: boolean;
+	navigation?: boolean;
+	on?: any;
+	onClick?: { [key: string]: any; };
+	onContext?: { [key: string]: any; };
+	onDblClick?: WebixCallback;
+	onMouseMove?: WebixCallback;
+	pager?: any;
+	ready?: WebixCallback;
+	removeMissed?: boolean;
+	rules?: any;
+	save?: string;
+	scheme?: any;
+	scroll?: boolean|string;
+	scrollSpeed?: string;
+	select?: boolean|string;
+	subRender?: boolean;
+	template?: string|WebixCallback;
+	templateCopy?: WebixCallback;
+	threeState?: boolean;
+	tooltip?: any;
+	type?: any;
+	url?: string;
+	value?: string|WebixCallback;
+	width?: number;
+}
+type treemapEventName ='onAfterAdd'|'onAfterClose'|'onAfterContextMenu'|'onAfterDelete'|'onAfterLoad'|'onAfterOpen'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeClose'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeLoad'|'onBeforeOpen'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onFocus'|'onItemCheck'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPartialRender'|'onPaste'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
+interface treemap extends webix.ui.baseview{
+	add(obj:any, index?:number):string|number;
+	addCss(id:string|number, css:string, silent?:boolean):void;
+	adjust():void;
+	attachEvent(type:treemapEventName, functor:WebixCallback, id?:string):string|number;
+	bind(target:any, rule?:WebixCallback, format?:string):void;
+	blockEvent():void;
+	callEvent(name:string, params:any[]):boolean;
+	clearAll():void;
+	clearCss(css:string, silent?:boolean):void;
+	clearValidation():void;
+	close(id:string|number):void;
+	closeAll():void;
+	count():number;
+	customize(obj:any):void;
+	define(property:string, value:any):void;
+	destructor():void;
+	detachEvent(id:string):void;
+	disable():void;
+	enable():void;
+	exists(id:string|number):boolean;
+	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
+	getBranchIndex(id:string|number, parent?:string|number):number;
+	getChildViews():any[];
+	getFirstChildId(id:string|number):string;
+	getFirstId():string|number;
+	getFormView():webix.ui.baseview;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getNextSiblingId(id:string|number):string|number;
+	getNode():any;
+	getOpenItems():any[];
+	getPage():number;
+	getPager():any;
+	getParentId(id:string|number):string|number;
+	getParentView():any;
+	getPrevId(id:string|number, step:number):string|number;
+	getPrevSiblingId(id:string|number):string|number;
+	getScrollState():any;
+	getSelectedId(as_array:boolean):string|any[];
+	getSelectedItem(as_array:boolean):any;
+	getState():any;
+	getTopParentView():webix.ui.baseview;
+	group(config:any, mode:boolean):void;
+	hasCss(id:string|number, css:string):boolean;
+	hasEvent(name:string):boolean;
+	hide():void;
+	isBranch(id:string|number):boolean;
+	isBranchOpen(id:string|number):boolean;
+	isEnabled():boolean;
+	isSelected(id:string|number):boolean;
+	isVisible():boolean;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	loadBranch(id:string|number, callback:WebixCallback, url:string):void;
+	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
+	locate(e:Event):string|number;
+	mapEvent(map:any):void;
+	moveSelection(direction:string):void;
+	open(id:string|number, show?:boolean):void;
+	openAll():void;
+	parse(data:any, type:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
+	removeCss(id:string|number, css:string, silent?:boolean):void;
+	render(id:string|number, data:any, type:string):void;
+	resize():void;
+	scrollTo(x:number, y:number):void;
+	select(id:string|any[], preserve:boolean):void;
+	selectAll(from?:string, to?:string):void;
+	serialize():any;
+	setPage(page:number):void;
+	setState(state:any):void;
+	show(force?:boolean, animation?:boolean):void;
+	showBranch(branchId:string|number):void;
+	showItem(id:string|number):void;
+	sort(by:string, dir?:string, as?:string):void;
+	sync(source:any, filter:WebixCallback, silent:boolean):void;
+	unbind():void;
+	unblockEvent():void;
+	ungroup(mode:boolean):void;
+	unselect(id?:string):void;
+	unselectAll():void;
+	updateItem(id:string|number, data:any):void;
+	validate(id?:string):boolean;
+
+	$getSize: any[];
+	$height: number;
+	$scope: any;
+	$setSize(x:number, y:number):boolean;
+	$skin: any;
+	$view: HTMLElement;
+	$width: number;
+	config: treemapConfig;
+	name: string;
+	on_click: WebixCallback;
+	on_context: { [key: string]: any; };
+	on_dblclick: WebixCallback;
+	on_mouse_move: WebixCallback;
+	type: { [key: string]: any; };
+	types: { [key: string]: any; };
+}
 interface treetableConfig{
 	animate?: any;
+	areaselect?: boolean;
 	autoConfig?: boolean;
 	autoheight?: boolean;
 	autowidth?: boolean;
-	blockselect?: boolean;
+	blockselect?: boolean|string;
 	borderless?: boolean;
 	checkboxRefresh?: boolean;
 	clipboard?: boolean|string;
 	columnWidth?: number;
 	columns?: any[];
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
-	dataFeed?: string|WebixCallback;
 	datafetch?: number;
 	datathrottle?: number;
 	datatype?: string;
@@ -7298,10 +8025,11 @@ interface treetableConfig{
 	height?: number;
 	hidden?: boolean;
 	hover?: string;
-	id?: string;
+	id?: string|number;
 	leftSplit?: number;
 	liveValidation?: boolean;
 	loadahead?: number;
+	map?: any;
 	math?: boolean;
 	maxHeight?: number;
 	maxWidth?: number;
@@ -7329,19 +8057,23 @@ interface treetableConfig{
 	rules?: any;
 	save?: string;
 	scheme?: any;
-	scroll?: boolean;
+	scroll?: boolean|string;
 	scrollAlignY?: boolean;
 	scrollX?: boolean;
 	scrollY?: boolean;
 	select?: boolean|string;
 	spans?: any[];
+	subRowHeight?: string;
+	subrow?: string;
+	subview?: webix.ui.baseview;
 	threeState?: boolean;
-	tooltip?: any;
+	tooltip?: boolean;
 	type?: any;
 	url?: string;
 	width?: number;
 	yCount?: number;
 }
+type treetableEventName ='onAfterAdd'|'onAfterAreaAdd'|'onAfterAreaRemove'|'onAfterBlockSelect'|'onAfterClose'|'onAfterColumnDrop'|'onAfterColumnDropOrder'|'onAfterColumnHide'|'onAfterColumnShow'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterEditStart'|'onAfterEditStop'|'onAfterFilter'|'onAfterLoad'|'onAfterOpen'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onAfterUnSelect'|'onAreaDrag'|'onBeforeAdd'|'onBeforeAreaAdd'|'onBeforeAreaRemove'|'onBeforeBlockSelect'|'onBeforeClose'|'onBeforeColumnDrag'|'onBeforeColumnDrop'|'onBeforeColumnDropOrder'|'onBeforeColumnHide'|'onBeforeColumnShow'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeEditStart'|'onBeforeEditStop'|'onBeforeFilter'|'onBeforeLoad'|'onBeforeOpen'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBeforeUnSelect'|'onBindRequest'|'onBlur'|'onCheck'|'onCollectValues'|'onColumnResize'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onHeaderClick'|'onItemCheck'|'onItemClick'|'onItemDblClick'|'onKeyPress'|'onLiveEdit'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onResize'|'onRowResize'|'onScrollX'|'onScrollY'|'onSelectChange'|'onStructureLoad'|'onStructureUpdate'|'onSubViewClose'|'onSubViewCreate'|'onSubViewOpen'|'onSubViewRender'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface treetable extends webix.ui.baseview{
 	add(obj:any, index?:number, parentId?:string):string;
 	addCellCss(id:string, name:string, css:string):void;
@@ -7350,20 +8082,20 @@ interface treetable extends webix.ui.baseview{
 	adjust():void;
 	adjustColumn(id:string|number, header?:string):void;
 	adjustRowHeight(columnId:string, silent:boolean):void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:treetableEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
-	checkAll(id?:string):void;
+	checkAll(id?:string|number):void;
 	checkItem(id:string):void;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
-	close(id:string):void;
+	close(id:string|number):void;
 	closeAll():void;
-	collectValues(id:string):any[];
-	columnId(index:number):string;
-	copy(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
+	collectValues(id:string|number):any[];
+	columnId(index:number):string|number;
+	copy(sid:string|number, tindex:number, tobj?:webix.ui.baseview, details?:any):string|number;
 	count():number;
 	define(property:string, value:any):void;
 	destructor():void;
@@ -7379,120 +8111,119 @@ interface treetable extends webix.ui.baseview{
 	editRow(id:string):void;
 	editStop():void;
 	enable():void;
-	exists(id:string):boolean;
-	exportToExcel(url?:string):void;
-	exportToPDF(url?:string):void;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
 	filterByAll():void;
 	find(criterion:WebixCallback, first?:boolean):any;
 	focusEditor():void;
-	getBranchIndex(id:string, parent?:string):number;
+	getBranchIndex(id:string|number, parent?:string|number):number;
 	getChecked():any[];
 	getChildViews():any[];
 	getColumnConfig(id:string):any;
-	getColumnIndex(id:string):number;
+	getColumnIndex(id:string|number):number;
 	getEditState():any;
 	getEditor(row?:any, column?:string|number):any;
 	getEditorValue():string;
-	getFilter(columnID:string):any;
-	getFirstChildId(id:string):string;
-	getFirstId():string;
+	getFilter(columnID:string|number):any;
+	getFirstChildId(id:string|number):string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getHeaderContent(id:string):{ [key: string]: any; };
+	getHeaderContent(id:string|number):{ [key: string]: any; };
 	getHeaderNode(columnId:string, rowIndex?:number):HTMLElement;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
-	getNextSiblingId(id:any):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
+	getNextSiblingId(id:string|number):string|number;
 	getNode():any;
 	getOpenItems():any[];
 	getPage():number;
 	getPager():any;
-	getParentId(id:string):string;
+	getParentId(id:string|number):string|number;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
-	getPrevSiblingId(id:any):string;
+	getPrevId(id:string|number, step:number):string|number;
+	getPrevSiblingId(id:string|number):string|number;
 	getScrollState():any;
-	getSelectedId(asArray?:boolean, asString?:boolean):any;
-	getSelectedItem(mode?:boolean):void;
+	getSelectedId(asArray:boolean, asString:boolean):any;
+	getSelectedItem(as_array?:boolean):any;
 	getState():any;
-	getText(rowid:string, colid:string):string;
+	getText(rowid:string|number, colid:string|number):string;
 	getTopParentView():webix.ui.baseview;
 	getVisibleCount():number;
 	group(config:any, mode:boolean):void;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
-	hideColumn(id:string):void;
+	hideColumn(id:string|number):void;
 	hideOverlay():void;
-	isBranch(id:string):boolean;
-	isBranchOpen(id:string):boolean;
-	isChecked(id:string):boolean;
-	isColumnVisible(id:string):boolean;
+	isBranch(id:string|number):boolean;
+	isBranchOpen(id:string|number):boolean;
+	isChecked(id:string|number):boolean;
+	isColumnVisible(id:string|number):boolean;
 	isEnabled():boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
-	loadBranch(id:string, callback:WebixCallback, url:string):void;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
+	loadBranch(id:string|number, callback:WebixCallback, url:string):void;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
 	locate(node:HTMLElement|Event):any;
 	mapCells(startrow:number, startcol:string, numrows:number, numcols:number, callback:WebixCallback):void;
 	mapEvent(map:any):void;
-	markSorting(column_id:string, dir:string):void;
-	move(sid:string, tindex:number, tobj?:webix.ui.baseview, details?:any):string;
-	moveBottom(id:string):void;
+	markSorting(column_id:string, direction:string):void;
+	move(sid:string|number, tindex:number, tobj?:webix.ui.baseview, details?:any):string|number;
+	moveBottom(id:string|number):void;
 	moveColumn(id:string, index:number):void;
-	moveDown(id:string, step:number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
-	open(id:string):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
+	open(id:string|number, show?:boolean):void;
 	openAll():void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	refreshColumns(config?:any[]):void;
-	refreshFilter(id:string):void;
+	refresh(id?:string|number):void;
+	refreshColumns(config?:any[], reset?:boolean):void;
+	refreshFilter(id:string|number):void;
 	refreshHeaderContent():void;
 	registerFilter(node:HTMLElement, config:any, obj:any):void;
-	remove(id:string):void;
+	remove(id:string|number):void;
 	removeCellCss(id:string, name:string, css_name:string):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
 	removeRowCss(id:string, css_name:string):void;
-	render(id:string, data:any, operation:string):void;
+	render(id:string|number, data:any, operation:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	serialize():any;
-	setColumnWidth(id:string, width:number):void;
+	setColumnWidth(id:string|number, width:number):void;
 	setPage(page:number):void;
-	setRowHeight(id:string, height:number):void;
+	setRowHeight(id:string|number, height:number):void;
 	setState(state:any):void;
 	show(force?:boolean, animation?:boolean):void;
 	showCell(row:string, column:string):void;
-	showColumn(id:string):void;
-	showColumnBatch(batch:string|number):void;
-	showItem(id:string):void;
+	showColumn(id:string|number):void;
+	showColumnBatch(batch:string|number, preserve:boolean):void;
+	showItem(id:string|number):void;
 	showItemByIndex(index:number):void;
 	showOverlay(message:string):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
-	uncheckAll(id?:string):void;
+	uncheckAll(id?:string|number):void;
 	uncheckItem(id:string):void;
 	ungroup(mode:boolean):void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
-	validateEditor(id?:string):boolean;
+	validateEditor(id?:string|number):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -7506,7 +8237,7 @@ interface treetable extends webix.ui.baseview{
 	on_context: { [key: string]: any; };
 	on_dblclick: WebixCallback;
 	on_mouse_move: WebixCallback;
-	waitData: PromisedData;
+	waitData: webix.promise;
 }
 interface unitlistConfig{
 	animate?: any;
@@ -7515,7 +8246,7 @@ interface unitlistConfig{
 	borderless?: boolean;
 	click?: string|WebixCallback;
 	clipboard?: boolean|string;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	data?: string|any[];
 	dataFeed?: string|WebixCallback;
@@ -7528,14 +8259,14 @@ interface unitlistConfig{
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	layout?: string;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
 	mouseEventDelay?: number;
-	multiselect?: any;
+	multiselect?: boolean;
 	navigation?: boolean;
 	on?: any;
 	onClick?: { [key: string]: any; };
@@ -7562,18 +8293,19 @@ interface unitlistConfig{
 	xCount?: number;
 	yCount?: number;
 }
+type unitlistEventName ='onAfterAdd'|'onAfterContextMenu'|'onAfterDelete'|'onAfterDrop'|'onAfterLoad'|'onAfterRender'|'onAfterScroll'|'onAfterSelect'|'onAfterSort'|'onBeforeAdd'|'onBeforeContextMenu'|'onBeforeDelete'|'onBeforeDrag'|'onBeforeDragIn'|'onBeforeDrop'|'onBeforeDropOut'|'onBeforeLoad'|'onBeforeRender'|'onBeforeSelect'|'onBeforeSort'|'onBindRequest'|'onBlur'|'onDataRequest'|'onDataUpdate'|'onDestruct'|'onDragOut'|'onFocus'|'onItemClick'|'onItemDblClick'|'onItemRender'|'onKeyPress'|'onLoadError'|'onLongTouch'|'onMouseMove'|'onMouseMoving'|'onMouseOut'|'onPaste'|'onSelectChange'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onValidationError'|'onValidationSuccess'|'onViewResize';
 interface unitlist extends webix.ui.baseview{
-	add(obj:any, index?:number):string;
+	add(obj:any, index?:number):string|number;
 	addCss(id:string|number, css:string, silent?:boolean):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:unitlistEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
 	clearAll():void;
 	clearCss(css:string, silent?:boolean):void;
 	clearValidation():void;
-	copy(sid:string, tindex:number, tobj?:any, details?:any):void;
+	copy(sid:string|number, tindex:number, tobj?:any, details?:any):void;
 	count():number;
 	customize(obj:any):void;
 	define(property:string, value:any):void;
@@ -7581,50 +8313,51 @@ interface unitlist extends webix.ui.baseview{
 	detachEvent(id:string):void;
 	disable():void;
 	enable():void;
-	exists(id:string):boolean;
+	exists(id:string|number):boolean;
 	filter(text:string|WebixTemplate|WebixCallback, value:string, preserve:boolean):void;
+	find(criterion:WebixCallback, first?:boolean):any;
 	getChildViews():any[];
-	getFirstId():string;
+	getFirstId():string|number;
 	getFormView():webix.ui.baseview;
-	getIdByIndex(index:number):string;
-	getIndexById(id:string):number;
-	getItem(id:string):any;
-	getItemNode(id:string):void;
-	getLastId():string;
-	getNextId(id:string, step:number):string;
+	getIdByIndex(index:number):string|number;
+	getIndexById(id:string|number):number;
+	getItem(id:string|number):any;
+	getItemNode(id:string|number):void;
+	getLastId():string|number;
+	getNextId(id:string|number, step:number):string|number;
 	getNode():any;
 	getPage():number;
 	getPager():any;
 	getParentView():any;
-	getPrevId(id:string, step:number):string;
+	getPrevId(id:string|number, step:number):string|number;
 	getScrollState():any;
 	getSelectedId(as_array:boolean):string|any[];
-	getSelectedItem(as_array?:boolean):any;
+	getSelectedItem(as_array:boolean):any;
 	getTopParentView():webix.ui.baseview;
 	getUnitList(name:string):any[];
 	getUnits():any[];
 	getVisibleCount():number;
-	hasCss(id:string, css:string):boolean;
+	hasCss(id:string|number, css:string):boolean;
 	hasEvent(name:string):boolean;
 	hide():void;
 	isEnabled():boolean;
-	isSelected(id:string):boolean;
+	isSelected(id:string|number):boolean;
 	isVisible():boolean;
-	load(url:string, type?:string, callback?:WebixCallback):PromisedData;
+	load(url:string, type?:string, callback?:WebixCallback):webix.promise;
 	loadNext(count:number, start:number, callback:WebixCallback, url:string, now:boolean):void;
-	locate(e:Event):string;
+	locate(e:Event):string|number;
 	mapEvent(map:any):void;
 	move(sid:string, tindex:number, tobj?:any, details?:any):string;
-	moveBottom(id:string):void;
-	moveDown(id:string, step:number):void;
+	moveBottom(id:string|number):void;
+	moveDown(id:string|number, step:number):void;
 	moveSelection(direction:string):void;
-	moveTop(id:string):void;
-	moveUp(id:string, step:number):void;
+	moveTop(id:string|number):void;
+	moveUp(id:string|number, step:number):void;
 	parse(data:any, type:string):void;
-	refresh(id?:string):void;
-	remove(id:string):void;
+	refresh(id?:string|number):void;
+	remove(id:string|number):void;
 	removeCss(id:string|number, css:string, silent?:boolean):void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	scrollTo(x:number, y:number):void;
 	select(id:string|any[], preserve:boolean):void;
@@ -7632,23 +8365,24 @@ interface unitlist extends webix.ui.baseview{
 	serialize():any;
 	setPage(page:number):void;
 	show(force?:boolean, animation?:boolean):void;
-	showItem(id:string):void;
+	showItem(id:string|number):void;
 	sort(by:string, dir?:string, as?:string):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
 	unselect(id?:string):void;
 	unselectAll():void;
-	updateItem(id:string, data:any):void;
+	updateItem(id:string|number, data:any):void;
 	validate(id?:string):boolean;
+
 	$drag(source:HTMLElement, ev:Event):string;
 	$dragHTML: WebixCallback;
 	$dragIn(source:HTMLElement, target:HTMLElement, ev:Event):HTMLElement;
 	$dragMark(context:any, ev:Event):boolean;
 	$dragOut(source:HTMLElement, old_target:HTMLElement, new_target:HTMLElement, ev:Event):void;
-	$drop(source:HTMLElement, target:HTMLElement, ev:any):void;
+	$drop(source:HTMLElement, target:HTMLElement, ev:Event):void;
 	$dropAllow: WebixCallback;
-	$getSize():any[];
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -7669,23 +8403,22 @@ interface uploaderConfig{
 	animate?: any;
 	apiOnly?: boolean;
 	autosend?: boolean;
+	autowidth?: boolean;
 	borderless?: boolean;
 	click?: WebixCallback;
-	container?: HTMLElement;
-	content?: string|HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	formData?: { [key: string]: any; };
-	getValue():string;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
 	hotkey?: string;
-	id?: string;
+	id?: string|number;
 	inputHeight?: number;
+	inputName?: string;
 	inputWidth?: number;
 	label?: string;
-	labelPosition?: string;
 	link?: string;
 	maxHeight?: number;
 	maxWidth?: number;
@@ -7694,20 +8427,19 @@ interface uploaderConfig{
 	multiple?: boolean;
 	name?: string;
 	on?: any;
-	placeholder?: string;
-	popup?: any;
+	popup?: string;
 	tabFocus?: boolean;
-	template?: string|WebixCallback;
 	tooltip?: string;
 	type?: string;
-	value?: string;
+	value?: string|number;
 	width?: number;
 }
+type uploaderEventName ='onAfterFileAdd'|'onAfterRender'|'onAfterScroll'|'onBeforeFileAdd'|'onBeforeRender'|'onBindRequest'|'onBlur'|'onDestruct'|'onFileUpload'|'onFileUploadError'|'onFocus'|'onItemClick'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onUploadComplete'|'onViewResize';
 interface uploader extends webix.ui.baseview{
 	addDropZone(element:HTMLElement):void;
 	addFile(name:string, size:number, type?:string):void;
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:uploaderEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	blur():void;
@@ -7733,48 +8465,53 @@ interface uploader extends webix.ui.baseview{
 	isVisible():boolean;
 	mapEvent(map:any):void;
 	refresh():void;
-	render(id:string, data:any, type:string):void;
+	render(id:string|number, data:any, type:string):void;
 	resize():void;
 	send(id:number|string|WebixCallback, details:any):void;
 	setValue(value:string):void;
 	show(force?:boolean, animation?:boolean):void;
-	stopUpload(id:string):void;
+	stopUpload(id:string|number):void;
 	sync(source:any, filter:WebixCallback, silent:boolean):void;
 	unbind():void;
 	unblockEvent():void;
+
 	$cssName: string;
-	$getSize():any[];
-	$getValue():string;
+	$getSize: any[];
+	$getValue: string;
 	$height: number;
+	$onUploadComplete: WebixCallback;
+	$renderInput(config:any):HTMLElement;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
 	$setValue(value:string):void;
 	$skin: any;
+	$updateProgress: WebixCallback;
 	$view: HTMLElement;
 	$width: number;
 	config: uploaderConfig;
 	name: string;
 	on_click: WebixCallback;
-	touchable: any;
+	touchable: boolean;
 }
 interface videoConfig{
 	animate?: any;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	controls?: boolean;
 	css?: string;
 	disabled?: boolean;
 	gravity?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	maxHeight?: number;
 	maxWidth?: number;
 	minHeight?: number;
 	minWidth?: number;
-	src?: any;
+	src?: string;
 	width?: number;
 }
+type videoEventName ='onAfterScroll'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onKeyPress'|'onLongTouch'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewResize';
 interface video extends webix.ui.baseview{
 	adjust():void;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
@@ -7794,7 +8531,8 @@ interface video extends webix.ui.baseview{
 	resize():void;
 	show(force?:boolean, animation?:boolean):void;
 	unbind():void;
-	$getSize():any[];
+
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -7810,7 +8548,7 @@ interface windowConfig{
 	autofocus?: boolean;
 	body?: string|webix.ui.baseview;
 	borderless?: boolean;
-	container?: HTMLElement;
+	container?: string|HTMLElement;
 	css?: string;
 	disabled?: boolean;
 	fullscreen?: boolean;
@@ -7819,7 +8557,7 @@ interface windowConfig{
 	headHeight?: number;
 	height?: number;
 	hidden?: boolean;
-	id?: string;
+	id?: string|number;
 	left?: number;
 	maxHeight?: number;
 	maxWidth?: number;
@@ -7831,13 +8569,16 @@ interface windowConfig{
 	padding?: any;
 	position?: string|WebixCallback;
 	relative?: string;
+	resize?: boolean;
+	toFront?: boolean;
 	top?: number;
 	width?: number;
 	zIndex?: number;
 }
+type windowEventName ='onAfterScroll'|'onBeforeShow'|'onBindRequest'|'onBlur'|'onDestruct'|'onFocus'|'onHide'|'onKeyPress'|'onLongTouch'|'onShow'|'onSwipeX'|'onSwipeY'|'onTimedKeyPress'|'onTouchEnd'|'onTouchMove'|'onTouchStart'|'onViewMove'|'onViewMoveEnd'|'onViewResize';
 interface window extends webix.ui.baseview{
 	adjust():void;
-	attachEvent(type:string, functor:WebixCallback, id?:string):string;
+	attachEvent(type:windowEventName, functor:WebixCallback, id?:string):string|number;
 	bind(target:any, rule?:WebixCallback, format?:string):void;
 	blockEvent():void;
 	callEvent(name:string, params:any[]):boolean;
@@ -7862,10 +8603,11 @@ interface window extends webix.ui.baseview{
 	resize():void;
 	resizeChildren():void;
 	setPosition(x:number, y:number):void;
-	show(force?:boolean, animation?:boolean):void;
+	show(node?:HTMLElement, position?:any, point?:string):void;
 	unbind():void;
 	unblockEvent():void;
-	$getSize():any[];
+	show(force:boolean,animation:boolean):void;
+	$getSize: any[];
 	$height: number;
 	$scope: any;
 	$setSize(x:number, y:number):boolean;
@@ -7878,4 +8620,4 @@ interface window extends webix.ui.baseview{
 
 }}
 
-declare function $$(id: string|Event|HTMLElement):webix.ui.baseview;
+declare function $$(id: string | Event | HTMLElement): webix.ui.baseview;
\ No newline at end of file

From 77a07e79372fc789b2bb1d6bba24e110726fbab8 Mon Sep 17 00:00:00 2001
From: raijinsetsu <raijinsetsu@gmail.com>
Date: Sat, 18 Jun 2016 21:21:16 -0400
Subject: [PATCH 127/278] Fixes #9609 (#9617)

---
 redlock/redlock-tests.ts | 130 ++++++++++++---------------------------
 redlock/redlock.d.ts     |  80 ++++++++++++------------
 2 files changed, 79 insertions(+), 131 deletions(-)

diff --git a/redlock/redlock-tests.ts b/redlock/redlock-tests.ts
index 8c05f6441e..309f687fbb 100644
--- a/redlock/redlock-tests.ts
+++ b/redlock/redlock-tests.ts
@@ -1,103 +1,49 @@
 /// <reference path="./redlock.d.ts" />
 
-import Redlock = require('redlock');
+import * as Redlock from 'redlock';
+import * as Promise from 'bluebird';
+import {RedisClient} from 'redis';
 
-import NodeifyCallback = RedlockTypes.NodeifyCallback;
-import Lock = RedlockTypes.Lock;
-import RedlockOptions = RedlockTypes.RedlockOptions;
+import Lock = Redlock.Lock;
 
 namespace RedlockTest {
-	// constructor
-	{
-		let redlock: Redlock;
-		let client: any;
-		let options: RedlockOptions;
-		redlock = new Redlock([client]);
-		redlock = new Redlock([client], options);
-	}
+	
+	let redlock: Redlock;
+	let client: RedisClient;
+	let lock: Lock;
+	
+	redlock = new Redlock([client]);
+	redlock = new Redlock([client], {
+		driftFactor: 0.1,
+		retryCount: 2,
+		retryDelay: 3
+	});
+	
+	redlock.acquire('resource', 30).then((lock: Lock) => {});
+	redlock.acquire('resource', 30, (err: any, lock: Lock) => {});
+	redlock.lock('resource', 30).then((lock: Lock) => {});
+	redlock.lock('resource', 30, (err: any, lock: Lock) => {});
 
-	// acquire, lock
-	{
-		let redlock: Redlock;
-		let resource: string;
-		let ttl: number;
-		let callback: NodeifyCallback<Lock>;
-		let result: Promise<Lock>;
-		result = redlock.acquire(resource, ttl);
-		result = redlock.acquire(resource, ttl, callback);
-		result = redlock.lock(resource, ttl);
-		result = redlock.lock(resource, ttl, callback);
-	}
+	// There is currently no way to test the disposer as the bluebird typings does not
+	//	expose the .using method.
+	// promise.using(redlock.disposer('resource', 30), (lock: Lock) => {});
+	
+	redlock.release(lock);
+	redlock.release(lock, (err: any) => {});
+	redlock.unlock(lock);
+	redlock.unlock(lock, (err: any) => {});
 
-	// disposer
-	{
-		let redlock: Redlock;
-		let resource: string;
-		let ttl: number;
-		let result: any;
-		result = redlock.acquire(resource, ttl);
-	}
-
-	// release, unlock
-	{
-		let redlock: Redlock;
-		let lock: Lock;
-		let callback: NodeifyCallback<void>;
-		let result: Promise<void>;
-		result = redlock.release(lock);
-		result = redlock.release(lock, callback);
-		result = redlock.unlock(lock);
-		result = redlock.unlock(lock, callback);
-	}
-
-	// extend
-	{
-		let redlock: Redlock;
-		let lock: Lock;
-		let ttl: number;
-		let callback: NodeifyCallback<Lock>;
-		let result: Promise<Lock>;
-		result = redlock.extend(lock, ttl);
-		result = redlock.extend(lock, ttl, callback);
-	}
-
-	// _lock
-	{
-		let redlock: Redlock;
-		let resource: string;
-		let value: string;
-		let ttl: number;
-		let callback: NodeifyCallback<Lock>;
-		let result: Promise<Lock>;
-		result = redlock._lock(resource, value, ttl);
-		result = redlock._lock(resource, value, ttl, callback);
-	}
-
-	// _random
-	{
-		let redlock: Redlock;
-		let result: string;
-		result = redlock._random();
-	}
+	redlock.extend(lock, 30).then((lock: Lock) => {});
+	redlock.extend(lock, 30, (err: any, lock: Lock) => {});
 }
 
 namespace LockTest {
-	// unlock
-	{
-		let lock: Lock;
-		let callback: NodeifyCallback<void>;
-		let result: Promise<void>;
-		result = lock.unlock();
-		result = lock.unlock(callback);
-	}
-
-	// extend
-	{
-		let lock: Lock;
-		let ttl: number;
-		let callback: NodeifyCallback<Lock>;
-		let result: Promise<Lock>;
-		result = lock.extend(ttl);
-		result = lock.extend(ttl, callback);
-	}
+	
+	let lock: Lock;
+	
+	lock.unlock();
+	lock.unlock((err) => {});
+	
+	lock.extend(30).then((lock: Lock) => {});
+	lock.extend(30, (err: any, lock: Lock) => {});
 }
diff --git a/redlock/redlock.d.ts b/redlock/redlock.d.ts
index 6db97b9f9e..94ee8f3c7a 100644
--- a/redlock/redlock.d.ts
+++ b/redlock/redlock.d.ts
@@ -4,59 +4,61 @@
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 /// <reference path="../bluebird/bluebird.d.ts" />
+/// <reference path="../redis/redis.d.ts" />
 
-declare namespace RedlockTypes {
-	interface LockError extends Error {}
 
-	interface NodeifyCallback<T> {
-		(err: any, value?: T): void;
+declare module "redlock" {
+
+	import * as redis from 'redis';
+	import * as Promise from 'bluebird';	
+		
+	namespace Redlock {
+		
+		interface Callback<T> {
+			(err: any, value?: T): void;
+		}
+
+		interface Lock {
+			
+			redlock: Redlock;
+			resource: string;
+			value: any;
+			expiration: number;
+
+			unlock(callback?: Callback<void>): Promise<void>;
+
+			extend(ttl: number, callback?: Callback<Lock>): Promise<Lock>;
+		}
+
+		interface Options {
+			driftFactor?: number;
+			retryCount?: number;
+			retryDelay?: number;
+		}
+
+		interface LockError extends Error {}
 	}
-
-	interface Lock {
-		redlock: Redlock;
-		resource: string;
-		value: any;
-		expiration: number;
-
-		unlock(callback?: NodeifyCallback<void>): Promise<void>;
-
-		extend(ttl: number, callback?: NodeifyCallback<Lock>): Promise<Lock>;
-	}
-
-	interface RedlockOptions {
-		driftFactor?: number;
-		retryCount?: number;
-		retryDelay?: number;
-	}
-
+	
 	class Redlock {
-		LockError: LockError;
 
 		driftFactor: number;
 		retryCount: number;
 		retryDelay: number;
 
-		servers: any[]; // array of redis.RedisClient
+		servers: redis.RedisClient[];
 
-		constructor(clients: any[], options?: RedlockOptions);
+		constructor(clients: any[], options?: Redlock.Options);
 
-		acquire(resource: string, ttl: number, callback?: NodeifyCallback<Lock>): Promise<Lock>;
-		lock(resource: string, ttl: number, callback?: NodeifyCallback<Lock>): Promise<Lock>;
+		acquire(resource: string, ttl: number, callback?: Redlock.Callback<Redlock.Lock>): Promise<Redlock.Lock>;
+		lock(resource: string, ttl: number, callback?: Redlock.Callback<Redlock.Lock>): Promise<Redlock.Lock>;
 
-		disposer(resource: string, ttl: number): any; // return bluebird.Disposer
+		disposer(resource: string, ttl: number, errorHandler?: Redlock.Callback<void>): any; // bluebird Disposer
 
-		release(lock: Lock, callback?: NodeifyCallback<void>): Promise<void>;
-		unlock(lock: Lock, callback?: NodeifyCallback<void>): Promise<void>;
+		release(lock:  Redlock.Lock, callback?: Redlock.Callback<void>): Promise<void>;
+		unlock(lock:  Redlock.Lock, callback?: Redlock.Callback<void>): Promise<void>;
 
-		extend(lock: Lock, ttl: number, callback?: NodeifyCallback<Lock>): Promise<Lock>;
-
-		_lock(resource: string, value: string, ttl: number, callback?: NodeifyCallback<Lock>): Promise<Lock>;
-
-		_random(): string;
+		extend(lock:  Redlock.Lock, ttl: number, callback?: Redlock.Callback<Redlock.Lock>): Promise<Redlock.Lock>;
 	}
-}
-
-declare module "redlock" {
-	import Redlock = RedlockTypes.Redlock;
+	
 	export = Redlock;
 }

From 4199cfdac86382427d6e4027f93693efeae5c562 Mon Sep 17 00:00:00 2001
From: Allan Nienhuis <allan@allanandshelley.ca>
Date: Sat, 18 Jun 2016 18:22:24 -0700
Subject: [PATCH 128/278] add streetview panorama options (#9650)

* add streetview panorama options

including undocumented 'mode' parameter
http://osdir.com/ml/google-maps-js-api-v3/2013-02/msg00015.html

* add FullscreenControlOptions type
---
 googlemaps/google.maps.d.ts | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/googlemaps/google.maps.d.ts b/googlemaps/google.maps.d.ts
index 4d225779ce..f005582cb2 100644
--- a/googlemaps/google.maps.d.ts
+++ b/googlemaps/google.maps.d.ts
@@ -1585,6 +1585,10 @@ declare namespace google.maps {
         setZoom(zoom: number): void;
     }
 
+    export interface FullscreenControlOptions {
+        position?: ControlPosition;
+    }
+
     export interface StreetViewPanoramaOptions {
         addressControl?: boolean;
         addressControlOptions?: StreetViewAddressControlOptions;
@@ -1592,8 +1596,11 @@ declare namespace google.maps {
         disableDefaultUi?: boolean;
         disableDoubleClickZoom?: boolean;
         enableCloseButton?: boolean;
+        fullscreenControl?: boolean;
+        fullscreenControlOptions?: FullscreenControlOptions;
         imageDateControl?: boolean;
         linksControl?: boolean;
+        mode?: "html4" | "html5" |"webgl";
         panControl?: boolean;
         panControlOptions?: PanControlOptions;
         pano?: string;

From 7c0005e0db9f15c2cb436ca43b9988d9d797217a Mon Sep 17 00:00:00 2001
From: Kamil Szostak <kszostak@microsoft.com>
Date: Sat, 18 Jun 2016 18:26:40 -0700
Subject: [PATCH 129/278] Updating JS SDK d.ts files (#9651)

---
 .../applicationinsights-js-tests.ts           |  25 +-
 .../applicationinsights-js.d.ts               | 566 ++++++++----------
 2 files changed, 265 insertions(+), 326 deletions(-)

diff --git a/applicationinsights-js/applicationinsights-js-tests.ts b/applicationinsights-js/applicationinsights-js-tests.ts
index a852259539..b90ec6c6fe 100644
--- a/applicationinsights-js/applicationinsights-js-tests.ts
+++ b/applicationinsights-js/applicationinsights-js-tests.ts
@@ -27,7 +27,26 @@ var config: Microsoft.ApplicationInsights.IConfig = {
     cookieDomain: ""
 };
 
-var appInsights = new Microsoft.ApplicationInsights.AppInsights(config);
+var appInsights: Microsoft.ApplicationInsights.IAppInsights = {
+    config: config,
+    context: null,
+    queue: null,
+
+    startTrackPage(name?: string) { return null; },
+    stopTrackPage(name?: string, url?: string, properties?: { [name: string]: string; }, measurements?: { [name: string]: number; }) { return null; },
+    trackPageView(name?: string, url?: string, properties?: { [name: string]: string; }, measurements?: { [name: string]: number; }, duration?: number) { return null; },
+    startTrackEvent(name: string) { return null },
+    stopTrackEvent(name: string, properties?: { [name: string]: string; }, measurements?: { [name: string]: number; }) { return null },
+    trackEvent(name: string, properties?: { [name: string]: string; }, measurements?: { [name: string]: number; }) { return null },
+    trackAjax(id: string, absoluteUrl: string, pathName: string, totalTime: number, success: boolean, resultCode: number, method?: string) { return null },
+    trackException(exception: Error, handledAt?: string, properties?: { [name: string]: string; }, measurements?: { [name: string]: number; }, severityLevel?: AI.SeverityLevel) { return null },
+    trackMetric(name: string, average: number, sampleCount?: number, min?: number, max?: number, properties?: { [name: string]: string; }) { return null },
+    trackTrace(message: string, properties?: { [name: string]: string; }) { return null },
+    flush() { return null },
+    setAuthenticatedUserContext(authenticatedUserId: string, accountId?: string) { return null },
+    clearAuthenticatedUserContext() { return null },
+    _onerror(message: string, url: string, lineNumber: number, columnNumber: number, error: Error) { return null }
+};
 
 // trackPageView
 appInsights.trackPageView("page1");
@@ -68,7 +87,7 @@ appInsights.config.instrumentationKey = "<new key>";
 
 
 // TelementryContext
-var context = appInsights.context;
+var context: Microsoft.ApplicationInsights.ITelemetryContext = appInsights.context;
 
 context.application.ver = "v0.0.0";
 context.application.build = "1.1.1";
@@ -89,7 +108,7 @@ context.operation.syntheticSource = "testAgent";
 
 // track
 var data = new Microsoft.Telemetry.Base();
-var envelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(data, "name");
+var envelope = new Microsoft.Telemetry.Envelope();
 
 context.track(envelope);
 
diff --git a/applicationinsights-js/applicationinsights-js.d.ts b/applicationinsights-js/applicationinsights-js.d.ts
index f49863b35a..5bb2a535f9 100644
--- a/applicationinsights-js/applicationinsights-js.d.ts
+++ b/applicationinsights-js/applicationinsights-js.d.ts
@@ -3,399 +3,297 @@
 // Definitions by: Kamil Szostak <https://github.com/kamilszostak>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
+declare module AI {
+    enum SeverityLevel {
+        Verbose = 0,
+        Information = 1,
+        Warning = 2,
+        Error = 3,
+        Critical = 4,
+    }
+}
+
 declare module Microsoft.ApplicationInsights.Context {
-    class Application {
+    interface IApplication {
         /**
          * The application version.
          */
         ver: string;
-
         /**
          * The application build version.
          */
         build: string;
     }
-
-    class Device {
+	
+	interface IDevice {
         /**
          * The type for the current device.
          */
         type: string;
-
         /**
          * A device unique ID.
          */
         id: string;
-
         /**
          * The device OEM for the current device.
          */
         oemName: string;
-
         /**
          * The device model for the current device.
          */
         model: string;
-
         /**
          * The IANA interface type for the internet connected network adapter.
          */
         network: number;
-
         /**
          * The application screen resolution.
          */
         resolution: string;
-
         /**
          * The current display language of the operating system.
          */
         locale: string;
-
         /**
          * The IP address.
          */
         ip: string;
-
         /**
          * The device language.
          */
         language: string;
-
         /**
          * The OS name.
          */
         os: string;
-
         /**
          * The OS version.
          */
         osversion: string;
-
-        /**
-         * Constructs a new instance of the Device class
-         */
-        constructor();
     }
-
-    class User {
-        /**
-         * The user ID.
-         */
-        id: string;
-
-        /**
-         * Authenticated user id
-         */
-        authenticatedId: string;
-
-        /**
-         * The account ID.
-         */
-        accountId: string;
-
-        /**
-         * The account acquisition date.
-         */
-        accountAcquisitionDate: string;
-
-        /**
-         * The user agent string.
-         */
-        agent: string;
-
-        /**
-         * The store region.
-         */
-        storeRegion: string;
-
-        /**
-        * Sets the autheticated user id and the account id in this session.
-        *
-        * @param authenticatedUserId {string} - The authenticated user id. A unique and persistent string that represents each authenticated user in the service.
-        * @param accountId {string} - An optional string to represent the account associated with the authenticated user.
-        */
-        setAuthenticatedUserContext(authenticatedUserId: string, accountId?: string): void;
-
-        /**
-         * Clears the authenticated user id and the account id from the user context.
-         * @returns {}
-         */
-        clearAuthenticatedUserContext(): void;
-
-        constructor(config: ITelemetryConfig);
-    }
-
-    class Session {
-        /**
-         * The session ID.
-         */
-        id: string;
-
-        /**
-         * The true if this is the first session
-         */
-        isFirst: boolean;
-
-        /**
-         * The date at which this guid was genereated.
-         * Per the spec the ID will be regenerated if more than acquisitionSpan milliseconds ellapse from this time.
-         */
-        acquisitionDate: number;
-
-        /**
-         * The date at which this session ID was last reported.
-         * This value should be updated whenever telemetry is sent using this ID.
-         * Per the spec the ID will be regenerated if more than renewalSpan milliseconds elapse from this time with no activity.
-         */
-        renewalDate: number;
-    }
-
-    class Location {
+	
+    interface ILocation {
         /**
          * Client IP address for reverse lookup
          */
         ip: string;
     }
 
-    class Operation {
+    interface IInternal {
         /**
-         * Unique id
+        * The SDK version used to create this telemetry item.
+        */
+        sdkVersion: string;
+        /**
+         * The SDK agent version.
+         */
+        agentVersion: string;
+    }	
+	
+    interface ISample {
+        /**
+        * Sample rate
+        */
+        sampleRate: number;
+    }
+	
+    interface ISession {
+        /**
+        * The session ID.
+        */
+        id: string;
+        /**
+         * The true if this is the first session
+         */
+        isFirst: boolean;
+        /**
+         * The date at which this guid was genereated.
+         * Per the spec the ID will be regenerated if more than acquisitionSpan milliseconds ellapse from this time.
+         */
+        acquisitionDate: number;
+        /**
+         * The date at which this session ID was last reported.
+         * This value should be updated whenever telemetry is sent using this ID.
+         * Per the spec the ID will be regenerated if more than renewalSpan milliseconds elapse from this time with no activity.
+         */
+        renewalDate: number;
+    }	
+	
+    interface IOperation {
+        /**
+         * Operation id
          */
         id: string;
-
-        name: string;
-
-        parentId: string;
-
-        rootId: string;
-
         /**
-         * String identifying the bot or test agent.
+         * Operation name
+         */
+        name: string;
+        /**
+         * Parent operation id
+         */
+        parentId: string;
+        /**
+         * Root operation id
+         */
+        rootId: string;
+        /**
+         * Synthetic source of the operation
          */
         syntheticSource: string;
     }
+	
+	interface IUser {
+        /**
+        * The telemetry configuration.
+        */
+        config: any;
+        /**
+         * The user ID.
+         */
+        id: string;
+        /**
+         * Authenticated user id
+         */
+        authenticatedId: string;
+        /**
+         * The account ID.
+         */
+        accountId: string;
+        /**
+         * The account acquisition date.
+         */
+        accountAcquisitionDate: string;
+        /**
+         * The user agent string.
+         */
+        agent: string;
+        /**
+         * The store region.
+         */
+        storeRegion: string;
+    }
 }
 
 declare module Microsoft.Telemetry {
-    export class Base {
-        public baseType: string;
-        constructor() 
+    class Base {
+        baseType: string;
+        constructor();
     }
-
-    class Envelope {
-        public ver: number;
-        public name: string;
-        public time: string;
-        public sampleRate: number;
-        public seq: string;
-        public iKey: string;
-        public flags: number;
-        public deviceId: string;
-        public os: string;
-        public osVer: string;
-        public appId: string;
-        public appVer: string;
-        public userId: string;
-        public tags: any;
-        public data: Base;
-
+	
+	class Envelope {
+        ver: number;
+        name: string;
+        time: string;
+        sampleRate: number;
+        seq: string;
+        iKey: string;
+        flags: number;
+        deviceId: string;
+        os: string;
+        osVer: string;
+        appId: string;
+        appVer: string;
+        userId: string;
+        tags: any;
+        data: Base;
         constructor();
     }
 }
 
-declare module Microsoft.ApplicationInsights.Telemetry.Common {
-    class Envelope extends Microsoft.Telemetry.Envelope  {
-        /**
-         * The data contract for serializing this object.
-         */
-        aiDataContract: any;
-
-        /**
-         * Constructs a new instance of telemetry data.
-         */
-        constructor(data: Microsoft.Telemetry.Base, name: string);
-    }
-}
-
-
 declare module Microsoft.ApplicationInsights {
-
-    var Version: string;
-
     interface IConfig {
-        // The key of your Application Insights resource in Azure
-        instrumentationKey: string;
-
-        // The Application Insights server
-        endpointUrl: string;
-
-        emitLineDelimitedJson: boolean;
-
-        accountId: string;
-
-        // A session is logged if the user is inactive for this time in milliseconds. Default 30 mins.
-        sessionRenewalMs: number;
-
-        // A session is logged if it has continued for this time in milliseconds. Default 24h.
-        sessionExpirationMs: number;
-
-        //Default 100k
-        maxBatchSizeInBytes: number;
-
-        // Default 15s
-        maxBatchInterval: number;
-
-        // If true, data is sent immediately and not batched.
-        enableDebug: boolean;
-
-        // If true, telemetry data is not collected or sent. Default false.
-        disableTelemetry: boolean;
-
-        verboseLogging: boolean;
-
-        // Default 10s:
-        diagnosticLogInterval: number;
-
-        samplingPercentage: number;
-
-        autoTrackPageVisitTime: boolean;
-
-        // If true, exceptions are not monitored. 
-        disableExceptionTracking: boolean;
-
-        // If true, ajax calls are not monitored.
-        disableAjaxTracking: boolean;
-
-        // If true, default behavior of trackPageView is changed to record end of page view duration interval when 
-        // trackPageView is called. If false and no custom duration is provided to trackPageView, the page view
-        // performance is calculated using the navigation timing API.
-        overridePageViewDuration: boolean;
-
-        // Default 500 - controls how many ajax calls will be monitored per page view.
-        // Set to -1 to monitor all ajax calls on the page.
-        maxAjaxCallsPerView: number;
-
-        disableDataLossAnalysis: boolean;
-
-        disableCorrelationHeaders: boolean;
-
-        disableFlushOnBeforeUnload: boolean;
-
-        enableSessionStorageBuffer: boolean;
-
-        // Custom cookie domain. This is helpful if you want to share Application Insights cookies across subdomains.
-        cookieDomain: string;
+        instrumentationKey?: string;
+        endpointUrl?: string;
+        emitLineDelimitedJson?: boolean;
+        accountId?: string;
+        sessionRenewalMs?: number;
+        sessionExpirationMs?: number;
+        maxBatchSizeInBytes?: number;
+        maxBatchInterval?: number;
+        enableDebug?: boolean;
+        disableExceptionTracking?: boolean;
+        disableTelemetry?: boolean;
+        verboseLogging?: boolean;
+        diagnosticLogInterval?: number;
+        samplingPercentage?: number;
+        autoTrackPageVisitTime?: boolean;
+        disableAjaxTracking?: boolean;
+        overridePageViewDuration?: boolean;
+        maxAjaxCallsPerView?: number;
+        disableDataLossAnalysis?: boolean;
+        disableCorrelationHeaders?: boolean;
+        disableFlushOnBeforeUnload?: boolean;
+        enableSessionStorageBuffer?: boolean;
+        cookieDomain?: string;
+        url?: string;
     }
 
-    interface ISenderConfig {
+    interface ITelemetryContext {
         /**
-         * The url to which payloads will be sent
-         */
-        endpointUrl: () => string;
-        /**
-        * The JSON format (normal vs line delimited). True means line delimited JSON.
+        * The object describing a component tracked by this object.
         */
-        emitLineDelimitedJson: () => boolean;
-        /**
-         * The maximum size of a batch in bytes
-         */
-        maxBatchSizeInBytes: () => number;
-        /**
-         * The maximum interval allowed between calls to batchInvoke
-         */
-        maxBatchInterval: () => number;
-        /**
-         * The master off switch.  Do not send any data if set to TRUE
-         */
-        disableTelemetry: () => boolean;
-        /**
-         * Store a copy of a send buffer in the session storage
-         */
-        enableSessionStorageBuffer: () => boolean;
-    }
-
-    interface ITelemetryConfig extends ISenderConfig {
-        instrumentationKey: () => string;
-        accountId: () => string;
-        sessionRenewalMs: () => number;
-        sessionExpirationMs: () => number;
-        sampleRate: () => number;
-        endpointUrl: () => string;
-        cookieDomain: () => string;
-    }
-
-
-    class TelemetryContext {
-        /**
-         * The object describing a component tracked by this object.
-         */
-        application: Context.Application;
-
+        application: Context.IApplication;
         /**
          * The object describing a device tracked by this object.
          */
-        device: Context.Device;
-
+        device: Context.IDevice;
         /**
-         * The object describing a user tracked by this object.
-         */
-        user: Context.User;
-
-        /**
-         * The object describing a session tracked by this object.
-         */
-        session: Context.Session;
-
+        * The object describing internal settings.
+        */
+        internal: Context.IInternal;
         /**
          * The object describing a location tracked by this object.
          */
-        location: Context.Location;
-
+        location: Context.ILocation;
         /**
          * The object describing a operation tracked by this object.
          */
-        operation: Context.Operation;
-
+        operation: Context.IOperation;
         /**
-         * Use Sender.ts to send telemetry object to the endpoint
+        * The object describing sampling settings.
+        */
+        sample: Context.ISample;
+        /**
+         * The object describing a user tracked by this object.
          */
-        track(envelope: Telemetry.Common.Envelope): Telemetry.Common.Envelope;
-
+        user: Context.IUser;
+        /**
+         * The object describing a session tracked by this object.
+         */
+        session: Context.ISession;
         /**
         * Adds telemetry initializer to the collection. Telemetry initializers will be called one by one
         * before telemetry item is pushed for sending and in the order they were added.
         */
-        addTelemetryInitializer(telemetryInitializer: (envelope: Telemetry.Common.Envelope) => boolean): void;
+        addTelemetryInitializer(telemetryInitializer: (envelope: Microsoft.Telemetry.Envelope) => boolean): any;
+        /**
+        * Tracks telemetry object.
+        */
+        track(envelope: Microsoft.Telemetry.Envelope): any;
     }
 
-    /**
-     * The main API that sends telemetry to Application Insights.
-     * Learn more: http://go.microsoft.com/fwlink/?LinkID=401493
-     */
-    class AppInsights {
-        constructor(config: IConfig);
-
+    interface IAppInsights {
         config: IConfig;
-
-        context: TelemetryContext;
-
+        context: ITelemetryContext;
+        queue: (() => void)[];
         /**
-         * Starts timing how long the user views a page or other item. Call this when the page opens.
-         * This method doesn't send any telemetry. Call {@link stopTrackTelemetry} to log the page when it closes.
-         * @param   name  A string that idenfities this item, unique within this HTML document. Defaults to the document title.
-         */
-        startTrackPage(name?: string): void;
-
+        * Starts timing how long the user views a page or other item. Call this when the page opens.
+        * This method doesn't send any telemetry. Call {@link stopTrackTelemetry} to log the page when it closes.
+        * @param   name  A string that idenfities this item, unique within this HTML document. Defaults to the document title.
+        */
+        startTrackPage(name?: string): any;
         /**
-         * Logs how long a page or other item was visible, after {@link startTrackPage}. Call this when the page closes.
-         * @param   name  The string you used as the name in startTrackPage. Defaults to the document title.
-         * @param   url   String - a relative or absolute URL that identifies the page or other item. Defaults to the window location.
-         * @param   properties  map[string, string] - additional data used to filter pages and metrics in the portal. Defaults to empty.
-         * @param   measurements    map[string, number] - metrics associated with this page, displayed in Metrics Explorer on the portal. Defaults to empty.
-         */
-        stopTrackPage(name?: string, url?: string, properties?: Object, measurements?: Object): void;
-
+        * Logs how long a page or other item was visible, after {@link startTrackPage}. Call this when the page closes.
+        * @param   name  The string you used as the name in startTrackPage. Defaults to the document title.
+        * @param   url   String - a relative or absolute URL that identifies the page or other item. Defaults to the window location.
+        * @param   properties  map[string, string] - additional data used to filter pages and metrics in the portal. Defaults to empty.
+        * @param   measurements    map[string, number] - metrics associated with this page, displayed in Metrics Explorer on the portal. Defaults to empty.
+        */
+        stopTrackPage(name?: string, url?: string, properties?: {
+            [name: string]: string;
+        }, measurements?: {
+            [name: string]: number;
+        }): any;
         /**
          * Logs that a page or other item was viewed.
          * @param   name  The string you used as the name in startTrackPage. Defaults to the document title.
@@ -404,39 +302,61 @@ declare module Microsoft.ApplicationInsights {
          * @param   measurements    map[string, number] - metrics associated with this page, displayed in Metrics Explorer on the portal. Defaults to empty.
          * @param   duration    number - the number of milliseconds it took to load the page. Defaults to undefined. If set to default value, page load time is calculated internally.
          */
-        trackPageView(name?: string, url?: string, properties?: Object, measurements?: Object, duration?: number): void;
-
+        trackPageView(name?: string, url?: string, properties?: {
+            [name: string]: string;
+        }, measurements?: {
+            [name: string]: number;
+        }, duration?: number): any;
         /**
          * Start timing an extended event. Call {@link stopTrackEvent} to log the event when it ends.
          * @param   name    A string that identifies this event uniquely within the document.
          */
-        startTrackEvent(name: string): void;
-
+        startTrackEvent(name: string): any;
         /**
          * Log an extended event that you started timing with {@link startTrackEvent}.
          * @param   name    The string you used to identify this event in startTrackEvent.
          * @param   properties  map[string, string] - additional data used to filter events and metrics in the portal. Defaults to empty.
          * @param   measurements    map[string, number] - metrics associated with this event, displayed in Metrics Explorer on the portal. Defaults to empty.
          */
-        stopTrackEvent(name: string, properties?: Object, measurements?: Object): void;
-
+        stopTrackEvent(name: string, properties?: {
+            [name: string]: string;
+        }, measurements?: {
+            [name: string]: number;
+        }): any;
         /**
-         * Log a user action or other occurrence.
-         * @param   name    A string to identify this event in the portal.
-         * @param   properties  map[string, string] - additional data used to filter events and metrics in the portal. Defaults to empty.
-         * @param   measurements    map[string, number] - metrics associated with this event, displayed in Metrics Explorer on the portal. Defaults to empty.
-         */
-        trackEvent(name: string, properties?: Object, measurements?: Object): void;
-
-        trackAjax(id: string, absoluteUrl: string, pathName: string, totalTime: number, success: boolean, resultCode: number, method?: string): void;
-
+        * Log a user action or other occurrence.
+        * @param   name    A string to identify this event in the portal.
+        * @param   properties  map[string, string] - additional data used to filter events and metrics in the portal. Defaults to empty.
+        * @param   measurements    map[string, number] - metrics associated with this event, displayed in Metrics Explorer on the portal. Defaults to empty.
+        */
+        trackEvent(name: string, properties?: {
+            [name: string]: string;
+        }, measurements?: {
+            [name: string]: number;
+        }): any;
+        /**
+        * Log an AJAX request
+        * @param  id  Event id
+        * @param  absoluteUrl Full url
+        * @param  pathName Leave this parameter blank
+        * @param  totalTime Total time it took for AJAX request to complete
+        * @param  success Whether AJAX request succeeded or failed
+        * @param  resultCode Result code returned from AJAX call
+        * @param  method  HTTP verb that was used (GET, POST)
+        */
+        trackAjax(id: string, absoluteUrl: string, pathName: string, totalTime: number, success: boolean, resultCode: number, method?: string): any;
         /**
          * Log an exception you have caught.
          * @param   exception   An Error from a catch clause, or the string error message.
          * @param   properties  map[string, string] - additional data used to filter events and metrics in the portal. Defaults to empty.
          * @param   measurements    map[string, number] - metrics associated with this event, displayed in Metrics Explorer on the portal. Defaults to empty.
+         * @param   severityLevel   AI.SeverityLevel - severity level
          */
-        trackException(exception: Error, handledAt?: string, properties?: Object, measurements?: Object): void;
+        trackException(exception: Error, handledAt?: string, properties?: {
+            [name: string]: string;
+        }, measurements?: {
+            [name: string]: number;
+        }, severityLevel?: AI.SeverityLevel): any;
         /**
          * Log a numeric value that is not associated with a specific event. Typically used to send regular reports of performance indicators.
          * To send a single measurement, use just the first two parameters. If you take measurements very frequently, you can reduce the
@@ -447,34 +367,34 @@ declare module Microsoft.ApplicationInsights {
          * @param   min The smallest measurement in the sample. Defaults to the average.
          * @param   max The largest measurement in the sample. Defaults to the average.
          */
-        trackMetric(name: string, average: number, sampleCount?: number, min?: number, max?: number, properties?: Object): void;
-
+        trackMetric(name: string, average: number, sampleCount?: number, min?: number, max?: number, properties?: {
+            [name: string]: string;
+        }): any;
         /**
         * Log a diagnostic message.
         * @param    message A message string
         * @param   properties  map[string, string] - additional data used to filter traces in the portal. Defaults to empty.
         */
-        trackTrace(message: string, properties?: Object): void;
-
+        trackTrace(message: string, properties?: {
+            [name: string]: string;
+        }): any;
         /**
          * Immediately send all queued telemetry.
          */
-        flush(): void;
-
+        flush(): any;
         /**
-         * Sets the autheticated user id and the account id in this session.
-         * User auth id and account id should be of type string. They should not contain commas, semi-colons, equal signs, spaces, or vertical-bars.
-         *
-         * @param authenticatedUserId {string} - The authenticated user id. A unique and persistent string that represents each authenticated user in the service.
-         * @param accountId {string} - An optional string to represent the account associated with the authenticated user.
-         */
-        setAuthenticatedUserContext(authenticatedUserId: string, accountId?: string): void;
-
+        * Sets the autheticated user id and the account id in this session.
+        * User auth id and account id should be of type string. They should not contain commas, semi-colons, equal signs, spaces, or vertical-bars.
+        *
+        * @param authenticatedUserId {string} - The authenticated user id. A unique and persistent string that represents each authenticated user in the service.
+        * @param accountId {string} - An optional string to represent the account associated with the authenticated user.
+        */
+        setAuthenticatedUserContext(authenticatedUserId: string, accountId?: string): any;
         /**
          * Clears the authenticated user id and the account id from the user context.
          */
-        clearAuthenticatedUserContext(): void;
-
+        clearAuthenticatedUserContext(): any;
+        downloadAndSetup?(config: Microsoft.ApplicationInsights.IConfig): void;
         /**
          * The custom error handler for Application Insights
          * @param {string} message - The error message
@@ -483,6 +403,6 @@ declare module Microsoft.ApplicationInsights {
          * @param {number} columnNumber - The column number for the line where the error was raised
          * @param {Error}  error - The Error object
          */
-        _onerror(message: string, url: string, lineNumber: number, columnNumber: number, error: Error): void;
+        _onerror(message: string, url: string, lineNumber: number, columnNumber: number, error: Error): any;
     }
 }

From f1e58fbffa045b858d42a425a91b53136d2a0df3 Mon Sep 17 00:00:00 2001
From: Dave Allen <fullflavedave@users.noreply.github.com>
Date: Sat, 18 Jun 2016 18:28:10 -0700
Subject: [PATCH 130/278] Deprecated and updated README appropriately (#9652)

* Deprecated, fixed tests to pass

* Improved deprecation message in README
---
 meteor/README.md       | 11 ++++++++++-
 meteor/meteor-tests.ts |  6 +++---
 2 files changed, 13 insertions(+), 4 deletions(-)

diff --git a/meteor/README.md b/meteor/README.md
index d9d7898ffb..7c8aa5cb1d 100644
--- a/meteor/README.md
+++ b/meteor/README.md
@@ -1,4 +1,13 @@
-# Meteor Type Definitions
+# Meteor Type Definitions [DEPRECATED]
+
+## Deprecated
+
+These definitions for Meteor are now deprecated.  They should still work for versions of Meteor up to 1.2.1.
+
+The canonical TypeScript definitions for Meteor can now be found using the NPM [Typings definition manager](https://www.npmjs.com/package/typings).  If you prefer to view the definitions directly, or contribute to them, they can be found here: <https://github.com/meteor-typings/meteor>.
+
+
+## Description
 
 These are the definitions for version 1.3 of Meteor.  These definitions were generated from the from the same [Meteor data.js file] (https://github.com/meteor/meteor/blob/devel/docs/client/data.js) that is used to generate the official [Meteor docs] (http://docs.meteor.com/).  The code that generates these definitions can be found [here](https://github.com/meteor-typescript/meteor-typescript-libs/).
 
diff --git a/meteor/meteor-tests.ts b/meteor/meteor-tests.ts
index bc877bdea0..4b5a154794 100644
--- a/meteor/meteor-tests.ts
+++ b/meteor/meteor-tests.ts
@@ -650,16 +650,16 @@ Accounts.emailTemplates.siteName = "AwesomeSite";
 Accounts.emailTemplates.from = "AwesomeSite Admin <accounts@example.com>";
 Accounts.emailTemplates.headers = { asdf: 'asdf', qwer: 'qwer' };
 
-Accounts.emailTemplates.enrollAccount.subject = function (user) {
+Accounts.emailTemplates.enrollAccount.subject = function (user: Meteor.User) {
   return "Welcome to Awesome Town, " + user.profile.name;
 };
-Accounts.emailTemplates.enrollAccount.html = function (user, url) {
+Accounts.emailTemplates.enrollAccount.html = function (user: Meteor.User, url: string) {
   return "<h1>Some html here</h1>";
 };
 Accounts.emailTemplates.enrollAccount.from = function() {
   return "asdf@asdf.com";
 };
-Accounts.emailTemplates.enrollAccount.text = function (user, url) {
+Accounts.emailTemplates.enrollAccount.text = function (user: Meteor.User, url: string) {
   return "You have been selected to participate in building a better future!"
         + " To activate your account, simply click the link below:\n\n"
         + url;

From 62fcf9596ecd62320b23e373a0b083133bf638a3 Mon Sep 17 00:00:00 2001
From: Chris Dell <cjdell@gmail.com>
Date: Sun, 19 Jun 2016 02:28:19 +0100
Subject: [PATCH 131/278] Browser now has strongly typed `on` method (#9648)

---
 mdns/mdns.d.ts | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/mdns/mdns.d.ts b/mdns/mdns.d.ts
index d159ee7dba..63e1e7b72a 100644
--- a/mdns/mdns.d.ts
+++ b/mdns/mdns.d.ts
@@ -49,6 +49,9 @@ declare namespace MDNS {
     interface Browser extends NodeJS.EventEmitter {
         start():any;
         stop():any;
+        on(event:string, listener:Function):this;
+        on(event:'serviceUp', listener:(info:Service)=>void):this;
+        on(event:'serviceDown', listener:(info:Service)=>void):this;
     }
 
     interface BrowserStatic {

From 8a7cc0615ecdbb476238e4fb82adbfa8dda79b39 Mon Sep 17 00:00:00 2001
From: philippdrebes <philipp.drebes@gmail.com>
Date: Sun, 19 Jun 2016 03:28:55 +0200
Subject: [PATCH 132/278] Extended bootstrap.datepicker for custom formatting
 option (#9645)

* bootstrap.datepicker: added property assumeNearbyYear to DatepickerOptions

* bootstrap.datepicker: formatting

* Extended bootstrap.datepicker with custom formatting option: https://bootstrap-datepicker.readthedocs.io/en/stable/options.html#format
---
 bootstrap.datepicker/bootstrap.datepicker.d.ts | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/bootstrap.datepicker/bootstrap.datepicker.d.ts b/bootstrap.datepicker/bootstrap.datepicker.d.ts
index 686cc6b423..f60a0ffed6 100644
--- a/bootstrap.datepicker/bootstrap.datepicker.d.ts
+++ b/bootstrap.datepicker/bootstrap.datepicker.d.ts
@@ -15,7 +15,7 @@
  *  http://bootstrap-datepicker.readthedocs.org/en/release/options.html
  */
 interface DatepickerOptions {
-    format?: string;
+    format?: string | DatepickerCustomFormatOptions;
     weekStart?: number;
     startDate?: any;
     endDate?: any;
@@ -38,6 +38,11 @@ interface DatepickerOptions {
     assumeNearbyYear?: any;
 }
 
+interface DatepickerCustomFormatOptions {
+    toDisplay?(date: string, format: any, language: any): string;
+    toValue?(date: string, format: any, language: any): Date;
+}
+
 interface DatepickerEventObject extends JQueryEventObject {
     date: Date;
     format(format?: string): string;

From 1b272795b6fa35ded627d27476fb724110a9c673 Mon Sep 17 00:00:00 2001
From: michalgra <michal.grabkowski@gmail.com>
Date: Sun, 19 Jun 2016 03:36:16 +0200
Subject: [PATCH 133/278] Linq (#9655)

* Dictionary with two generic arguments

* Add generic arguments to SelectMany method

* Add generic arguments to ToLookup method
---
 linq/linq-tests.ts |  2 +-
 linq/linq.d.ts     | 40 +++++++++++++++++++++-------------------
 2 files changed, 22 insertions(+), 20 deletions(-)

diff --git a/linq/linq-tests.ts b/linq/linq-tests.ts
index fb9c3f3d6e..d30ccc8f8c 100644
--- a/linq/linq-tests.ts
+++ b/linq/linq-tests.ts
@@ -30,7 +30,7 @@ describe("Linq.js tests", function () {
     it("Grouping Methods", function () {
         expect(Enumerable.From(["a","aa","aaa","a","a","aaa"])
             .GroupBy((item:string) => item.length)
-            .Select((g: linq.Grouping<string>) => { return { key: g.Key(), count: g.Count() }; })
+            .Select((g: linq.Grouping<number, string>) => { return { key: g.Key(), count: g.Count() }; })
             .OrderBy(g => g.key)
             .Select(g => g.key+":"+g.count)
             .ToString(",")).toBe("1:3,2:1,3:2");
diff --git a/linq/linq.d.ts b/linq/linq.d.ts
index facd5d5901..f7417fc8da 100644
--- a/linq/linq.d.ts
+++ b/linq/linq.d.ts
@@ -49,8 +49,10 @@ declare namespace linq {
         Scan(seed: any, func: string, resultSelector?: string): Enumerable<any>;
         Select<TResult>(selector: ($: T, i: number) => TResult): Enumerable<TResult>;
         Select(selector: string): Enumerable<any>;
-        SelectMany(collectionSelector: ($: any, i: number) => any[], resultSelector?: ($: any, item: any) => any): Enumerable<any>;
-        SelectMany(collectionSelector: ($: any, i: number) => Enumerable<any>, resultSelector?: ($: any, item: any) => any): Enumerable<any>;
+        SelectMany<TResult>(collectionSelector: ($: T, i: number) => TResult[]): Enumerable<TResult>;
+        SelectMany<TResult>(collectionSelector: ($: T, i: number) => Enumerable<TResult>): Enumerable<TResult>;
+        SelectMany<TCollectionItem, TResult>(collectionSelector: ($: T, i: number) => TCollectionItem[], resultSelector: ($: T, item: TCollectionItem) => TResult): Enumerable<TResult>;
+        SelectMany<TCollectionItem, TResult>(collectionSelector: ($: T, i: number) => Enumerable<TCollectionItem>, resultSelector: ($: T, item: TCollectionItem) => TResult): Enumerable<TResult>;
         SelectMany(collectionSelector: string, resultSelector?: string): Enumerable<any>;
         Where(predicate: ($ : T, i: number) => boolean): Enumerable<T>;
         Where(predicate: string): Enumerable<any>;
@@ -170,12 +172,12 @@ declare namespace linq {
         LastIndexOf(item: T): number;
         // Convert Methods
         ToArray(): T[];
-        ToLookup(keySelector: ($: T) => any, elementSelector?: ($: T) => any, compareSelector?: (key: any) => any): Lookup<T>;
-        ToLookup(keySelector: string, elementSelector?: string, compareSelector?: string): Lookup<T>;
+        ToLookup<TKey, TValue>(keySelector: ($: T) => TKey, elementSelector?: ($: T) => TValue, compareSelector?: (key: TKey) => any): Lookup<TKey, TValue>;
+        ToLookup(keySelector: string, elementSelector?: string, compareSelector?: string): Lookup<any, any>;
         ToObject(keySelector: ($: T) => string, elementSelector: ($: T) => any): any;
         ToObject(keySelector: string, elementSelector: string): any;
-        ToDictionary(keySelector: ($: T) => any, elementSelector: ($: T) => any, compareSelector?: (key: T) => any): Dictionary<T>;
-        ToDictionary(keySelector: string, elementSelector: string, compareSelector?: string): Dictionary<T>;
+        ToDictionary<TKey, TValue>(keySelector: ($: T) => TKey, elementSelector: ($: T) => TValue, compareSelector?: (key: TKey) => any): Dictionary<TKey, TValue>;
+        ToDictionary(keySelector: string, elementSelector: string, compareSelector?: string): Dictionary<any, any>;
         ToJSON(replacer?: (key: any, value: any) => any, space?: number): string;
         ToJSON(replacer?: string, space?: number): string;
         ToString(separator?: string, selector?: ($: T) =>any): string;
@@ -211,26 +213,26 @@ declare namespace linq {
         ThenByDescending(keySelector: string): OrderedEnumerable<T>;
     }
 
-    interface Grouping<T> extends Enumerable<T> {
-        Key(): any;
+    interface Grouping<TKey, T> extends Enumerable<T> {
+        Key(): TKey;
     }
 
-    interface Lookup<TValue> {
+    interface Lookup<TKey, TValue> {
         Count(): number;
-        Get(key: any): Enumerable<TValue>;
-        Contains(key: any): boolean;
-        ToEnumerable(): Enumerable<TValue>;
+        Get(key: TKey): Enumerable<TValue>;
+        Contains(key: TKey): boolean;
+        ToEnumerable(): Enumerable<Grouping<TKey, TValue>>;
     }
 
-    interface Dictionary<TValue> {
-        Add(key: any, value: TValue): void;
-        Get(key: any): any;
-        Set(key: any, value: TValue): boolean;
-        Contains(key: any): boolean;
+    interface Dictionary<TKey, TValue> {
+        Add(key: TKey, value: TValue): void;
+        Get(key: TKey): TValue;
+        Set(key: TKey, value: TValue): boolean;
+        Contains(key: TKey): boolean;
         Clear(): void;
-        Remove(key: any): void;
+        Remove(key: TKey): void;
         Count(): number;
-        ToEnumerable(): Enumerable<TValue>;
+        ToEnumerable(): Enumerable<KeyValuePair<TKey, TValue>>;
     }
 
     interface KeyValuePair<TKey, TValue> {

From 2373d3f801616faa2bc452f3e71af741ba8b9f1e Mon Sep 17 00:00:00 2001
From: Mizunashi Mana <mizunashi_mana@mma.club.uec.ac.jp>
Date: Sun, 19 Jun 2016 11:15:32 +0900
Subject: [PATCH 134/278] fix passport google oauth type (#9653)

---
 passport-google-oauth/passport-google-oauth-tests.ts |  5 +++--
 passport-google-oauth/passport-google-oauth.d.ts     | 10 +++++++++-
 2 files changed, 12 insertions(+), 3 deletions(-)

diff --git a/passport-google-oauth/passport-google-oauth-tests.ts b/passport-google-oauth/passport-google-oauth-tests.ts
index ef7a4e9ef9..e2d47c23b2 100644
--- a/passport-google-oauth/passport-google-oauth-tests.ts
+++ b/passport-google-oauth/passport-google-oauth-tests.ts
@@ -18,10 +18,11 @@ passport.use(new google.OAuthStrategy({
             consumerSecret: process.env.GOOGLE_CONSUMER_SECRET,
             callbackURL: process.env.PASSPORT_GOOGLE_CALLBACK_URL
     },
-    function(accessToken:string, refreshToken:string, profile:google.Profile, done:(error:any, user?:any) => void) {
+    function(accessToken:string, refreshToken:string, profile:google.Profile, done:(error:any, user?:any, msg?: google.VerifyOptions) => void) {
          User.findOrCreate(profile.id, profile.provider, function(err, user) {
              if (err) { return done(err); }
-             done(null, user);
+             else if(!user) return done(null, false, {message: 'not found user'});
+             return done(null, user);
          });
     })
 );
diff --git a/passport-google-oauth/passport-google-oauth.d.ts b/passport-google-oauth/passport-google-oauth.d.ts
index 11645c4411..fd24eb3323 100644
--- a/passport-google-oauth/passport-google-oauth.d.ts
+++ b/passport-google-oauth/passport-google-oauth.d.ts
@@ -28,9 +28,17 @@ declare module 'passport-google-oauth' {
         sessionKey?: string;
     }
 
+    interface VerifyOptions {
+        message: string;
+    }
+
+    interface VerifyFunction {
+        (error: any, user?: any, msg?: VerifyOptions): void;
+    }
+
     class OAuthStrategy implements passport.Strategy {
         constructor(options: IOAuthStrategyOption,
-                    verify: (accessToken: string, refreshToken: string, profile: Profile, done: (error: any, user?: any) => void) => void);
+                    verify: (accessToken: string, refreshToken: string, profile: Profile, done: VerifyFunction) => void);
         name: string;
         authenticate: (req: express.Request, options?: Object) => void;
     }

From 98cca0ec978fa412650e4c5be88fca6da8fe0d3e Mon Sep 17 00:00:00 2001
From: Brian Surowiec <xtorted@optonline.net>
Date: Sat, 18 Jun 2016 22:15:52 -0400
Subject: [PATCH 135/278] Update project url (#9656)

---
 .../jquery-validation-unobtrusive.d.ts                          | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/jquery-validation-unobtrusive/jquery-validation-unobtrusive.d.ts b/jquery-validation-unobtrusive/jquery-validation-unobtrusive.d.ts
index fcc3bac9da..9c13b5a28f 100644
--- a/jquery-validation-unobtrusive/jquery-validation-unobtrusive.d.ts
+++ b/jquery-validation-unobtrusive/jquery-validation-unobtrusive.d.ts
@@ -1,5 +1,5 @@
 // Type definitions for Microsoft jQuery Unobtrusive Validation v3.2.3
-// Project: http://aspnetwebstack.codeplex.com/
+// Project: https://github.com/aspnet/jquery-validation-unobtrusive
 // Definitions by: Matt Brooks <https://github.com/EnableSoftware>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 

From 0eb97d80348f04535ebc4c88fa2b60d8f61507f0 Mon Sep 17 00:00:00 2001
From: velveret <velveret@users.noreply.github.com>
Date: Sat, 18 Jun 2016 19:16:21 -0700
Subject: [PATCH 136/278] Add typings for react-codemirror (#9658)

---
 codemirror/codemirror.d.ts                  | 18 +++++-----
 react-codemirror/react-codemirror-tests.tsx | 40 +++++++++++++++++++++
 react-codemirror/react-codemirror.d.ts      | 35 ++++++++++++++++++
 3 files changed, 85 insertions(+), 8 deletions(-)
 create mode 100644 react-codemirror/react-codemirror-tests.tsx
 create mode 100644 react-codemirror/react-codemirror.d.ts

diff --git a/codemirror/codemirror.d.ts b/codemirror/codemirror.d.ts
index f513057216..b1bf33e2d2 100644
--- a/codemirror/codemirror.d.ts
+++ b/codemirror/codemirror.d.ts
@@ -220,14 +220,7 @@ declare namespace CodeMirror {
 
         /** Get an { left , top , width , height , clientWidth , clientHeight } object that represents the current scroll position, the size of the scrollable area,
         and the size of the visible area(minus scrollbars). */
-        getScrollInfo(): {
-            left: any;
-            top: any;
-            width: any;
-            height: any;
-            clientWidth: any;
-            clientHeight: any;
-        }
+        getScrollInfo(): CodeMirror.ScrollInfo;
 
         /** Scrolls the given element into view. pos is a { line , ch } position, referring to a given character, null, to refer to the cursor.
         The margin parameter is optional. When given, it indicates the amount of pixels around the given area that should be made visible as well. */
@@ -609,6 +602,15 @@ declare namespace CodeMirror {
         text: string;
     }
 
+    interface ScrollInfo {
+        left: any;
+        top: any;
+        width: any;
+        height: any;
+        clientWidth: any;
+        clientHeight: any;
+    }
+
     interface TextMarker {
         /** Remove the mark. */
         clear(): void;
diff --git a/react-codemirror/react-codemirror-tests.tsx b/react-codemirror/react-codemirror-tests.tsx
new file mode 100644
index 0000000000..185f3b229d
--- /dev/null
+++ b/react-codemirror/react-codemirror-tests.tsx
@@ -0,0 +1,40 @@
+/// <reference path="../react/react.d.ts" />
+/// <reference path="../react/react-dom.d.ts" />
+/// <reference path="./react-codemirror.d.ts" />
+
+import * as React from "react";
+import * as ReactDOM from "react-dom";
+import * as Codemirror from "react-codemirror";
+
+class CodemirrorTest extends React.Component<React.Props<{}>, {}> {
+    private editorRef: ReactCodeMirror.ReactCodeMirror;
+
+    componentDidMount() {
+        this.editorRef.focus();
+        this.editorRef.getCodeMirror();
+    }
+
+    render() {
+        const options = {
+            lineNumbers: true,
+            readOnly: false,
+            mode: "markdown"
+        };
+        const onChange = (value: any) => console.log(value);
+        const onFocusChange = (focused: boolean) => console.log(focused);
+        const onScroll = (scrollInfo: CodeMirror.ScrollInfo) => console.log(scrollInfo.top);
+        const codeMirrorInstance = CodeMirror(document.body);
+
+        return <div>
+            <Codemirror className="test-codemirror"
+                        codeMirrorInstance={codeMirrorInstance}
+                        onChange={onChange}
+                        onFocusChange={onFocusChange}
+                        onScroll={onScroll}
+                        options={options}
+                        path="editor"
+                        ref={(r: ReactCodeMirror.ReactCodeMirror) => this.editorRef = r}
+                        value="foo bar" />
+        </div>;
+    }
+}
diff --git a/react-codemirror/react-codemirror.d.ts b/react-codemirror/react-codemirror.d.ts
new file mode 100644
index 0000000000..12311a2665
--- /dev/null
+++ b/react-codemirror/react-codemirror.d.ts
@@ -0,0 +1,35 @@
+// Type definitions for React Codemirror v0.2.6
+// Project: https://github.com/JedWatson/react-codemirror
+// Definitions by: Vicky Lai <https://github.com/velveret>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../react/react.d.ts"/>
+/// <reference path="../codemirror/codemirror.d.ts"/>
+
+declare namespace ReactCodeMirror {
+    interface ReactCodeMirrorProps extends __React.Props<ReactCodeMirror> {
+        onChange?: (newValue: string) => any; // called when a change is made
+        onFocusChange?: (focused: boolean) => any; // called when the editor is focused or loses focus
+        onScroll?: (scrollInfo: CodeMirror.ScrollInfo) => any; // called when the editor is scrolled
+        options?: CodeMirror.EditorConfiguration; // options passed to the CodeMirror instance
+        path?: string; // the identifying name for the textarea
+        value?: string; // the editor value
+        className?: string; // CSS className for the outer element
+        codeMirrorInstance?: CodeMirror.Editor; // the CodeMirror instance
+    }
+
+    interface ReactCodeMirror extends __React.Component<ReactCodeMirrorProps, {}> {
+        /** Focuses the CodeMirror instance. */
+        focus(): void;
+
+        /** Returns the CodeMirror instance, if available. */
+        getCodeMirror(): CodeMirror.Editor;
+    }
+
+    interface ReactCodeMirrorClass extends __React.ComponentClass<ReactCodeMirrorProps> { }
+}
+
+declare module "react-codemirror" {
+    const RCM: ReactCodeMirror.ReactCodeMirrorClass;
+    export = RCM;
+}

From 756973e248ab7508d7925e0fe7e35fa9ab4fbabd Mon Sep 17 00:00:00 2001
From: Hagai <hagai26@users.noreply.github.com>
Date: Sun, 19 Jun 2016 05:18:32 +0300
Subject: [PATCH 137/278] add some definitions for leaflet 1.0.0 (#9659)

* add some definitions I'm using from leaflet 1.0.0

* revert private members

* add more paramters of ZoomPanOptions
Add PositionString as type for leaflet position
---
 leaflet/leaflet.d.ts | 33 +++++++++++++++++++++++++--------
 1 file changed, 25 insertions(+), 8 deletions(-)

diff --git a/leaflet/leaflet.d.ts b/leaflet/leaflet.d.ts
index 04e8a44a36..47f377682f 100644
--- a/leaflet/leaflet.d.ts
+++ b/leaflet/leaflet.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for Leaflet.js 0.7.3
+// Type definitions for Leaflet.js 1.0.0
 // Project: https://github.com/Leaflet/Leaflet
 // Definitions by: Vladimir Zotov <https://github.com/rgripper>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -6,6 +6,7 @@
 declare namespace L {
     type LatLngExpression = LatLng | number[] | ({ lat: number; lng: number })
     type LatLngBoundsExpression = LatLngBounds | LatLngExpression[];
+    type PositionString = 'topleft' | 'topright' | 'bottomleft' | 'bottomright';
 }
 
 declare namespace L {
@@ -16,7 +17,7 @@ declare namespace L {
           * The position of the control (one of the map corners). See control positions.
           * Default value: 'bottomright'.
           */
-        position?: string;
+        position?: PositionString;
 
         /**
           * The HTML text shown before the attributions. Pass false to disable.
@@ -343,12 +344,12 @@ declare namespace L {
         /**
           * Sets the position of the control. See control positions.
           */
-        setPosition(position: string): Control;
+        setPosition(position: PositionString): Control;
 
         /**
           * Returns the current position of the control.
           */
-        getPosition(): string;
+        getPosition(): PositionString;
 
         /**
           * Adds the control to the map.
@@ -400,7 +401,7 @@ declare namespace L {
               *
               * Default value: 'topright'.
               */
-            position?: string; // 'topleft' | 'topright' | 'bottomleft' | 'bottomright'
+            position?: PositionString;
 
             /**
              * The text set on the zoom in button.
@@ -550,7 +551,7 @@ declare namespace L {
           * positions.
           * Default value: 'topright'.
           */
-        position?: string;
+        position?: PositionString;
 
     }
 }
@@ -1739,7 +1740,7 @@ declare namespace L {
           *
           * Default value: 'topright'.
           */
-        position?: string;
+        position?: PositionString;
 
         /**
           * If true, the control will be collapsed into an icon and expanded on mouse hover
@@ -2734,6 +2735,22 @@ declare namespace L.Map {
          * If true, it will delay moveend event so that it doesn't happen many times in a row.
          */
         debounceMoveend?: boolean;
+
+        /**
+         * Duration of animated panning, in seconds.
+         */
+        duration?: number;
+
+        /**
+         * The curvature factor of panning animation easing (third parameter of the Cubic Bezier curve).
+         * 1.0 means linear animation, the less the more bowed the curve.
+         */
+        easeLinearity?: number;
+
+        /**
+         * If true, panning won't fire movestart event on start (used internally for panning inertia).
+         */
+        noMoveStart?: boolean;
     }
 
     export interface FitBoundsOptions extends ZoomPanOptions {
@@ -3858,7 +3875,7 @@ declare namespace L {
           * The position of the control (one of the map corners). See control positions.
           * Default value: 'bottomleft'.
           */
-        position?: string;
+        position?: PositionString;
 
         /**
           * Maximum width of the control in pixels. The width is set dynamically to show

From d5b821616108eec3a47805f85d8ada504e62a0be Mon Sep 17 00:00:00 2001
From: Klaus Sevensleeper <k7sleeper@gmail.com>
Date: Sun, 19 Jun 2016 04:19:05 +0200
Subject: [PATCH 138/278] removed wasted word (#9664)

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 5c218aaa19..279be10799 100644
--- a/README.md
+++ b/README.md
@@ -32,7 +32,7 @@ Please see the [contribution guide](http://definitelytyped.org/guides/contributi
 
 ## Requested definitions
 
-Here is are the [currently requested definitions](https://github.com/DefinitelyTyped/DefinitelyTyped/labels/Definition%3ARequest).
+Here are the [currently requested definitions](https://github.com/DefinitelyTyped/DefinitelyTyped/labels/Definition%3ARequest).
 
 ## License
 

From 2bffb329a03a26842ff12e594947edce2c5555d3 Mon Sep 17 00:00:00 2001
From: Klaus Sevensleeper <k7sleeper@gmail.com>
Date: Sun, 19 Jun 2016 04:24:06 +0200
Subject: [PATCH 139/278] add 4 missing functions (#9666)

added functions registerFormat, unregisterFormat, getRegisteredFormats,
getDefaultOptions
---
 z-schema/z-schema.d.ts | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/z-schema/z-schema.d.ts b/z-schema/z-schema.d.ts
index 750abd2870..317a92247c 100644
--- a/z-schema/z-schema.d.ts
+++ b/z-schema/z-schema.d.ts
@@ -37,6 +37,11 @@ declare namespace ZSchema {
     }
 
     export class Validator {
+        public static registerFormat(name: string, validator: (value: any) => boolean): void;
+        public static unregisterFormat(name: string): void;
+        public static getRegisteredFormats(): string[];
+        public static getDefaultOptions(): Options;
+    
         constructor(options: Options);
 
         /**

From 1f2b27f8a1f4aab8d090b29eec2693b4f4ab8308 Mon Sep 17 00:00:00 2001
From: jakubskopal <j@kubs.cz>
Date: Sun, 19 Jun 2016 04:30:14 +0200
Subject: [PATCH 140/278] add sscan to redis (#9669)

---
 redis/redis.d.ts | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/redis/redis.d.ts b/redis/redis.d.ts
index d76b35f501..6dd257bd9b 100644
--- a/redis/redis.d.ts
+++ b/redis/redis.d.ts
@@ -364,6 +364,8 @@ declare module "redis" {
         script(key: string, callback?: ResCallbackT<any>): boolean;
         quit(args:any[], callback?:ResCallbackT<any>): boolean;
         quit(...args:any[]): boolean;
+        sscan(...args:any[]): boolean;
+        sscan(args:any[], callback?:ResCallbackT<any>): boolean;
         scan(...args:any[]): boolean;
         scan(args:any[], callback?:ResCallbackT<any>): boolean;
         hscan(...args:any[]): boolean;

From 6227a28e56f9c085733635ed1c9189f17e425431 Mon Sep 17 00:00:00 2001
From: Pablo Ois Lagarde <p@oislagarde.com.ar>
Date: Sat, 18 Jun 2016 23:32:15 -0300
Subject: [PATCH 141/278] Fix body-parser json options object (#9657)

receiver -> reviver
---
 body-parser/body-parser.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/body-parser/body-parser.d.ts b/body-parser/body-parser.d.ts
index 16f639dfaf..f7e691a365 100644
--- a/body-parser/body-parser.d.ts
+++ b/body-parser/body-parser.d.ts
@@ -33,7 +33,7 @@ declare module "body-parser" {
         /**
          * passed to JSON.parse().
          */
-        receiver?: (key: string, value: any) => any;
+        reviver?: (key: string, value: any) => any;
         /**
          * parse extended syntax with the qs module. (default: true)
          */
@@ -65,7 +65,7 @@ declare module "body-parser" {
             /**
              * passed to JSON.parse().
              */
-            receiver?: (key: string, value: any) => any;
+            reviver?: (key: string, value: any) => any;
         }): express.RequestHandler;
 
         export function raw(options?: {

From 2a1181267d10f14efe4fdf269d6c6ebd3f8c4b94 Mon Sep 17 00:00:00 2001
From: Oliver Joseph Ash <oliverjash@gmail.com>
Date: Sun, 19 Jun 2016 03:33:13 +0100
Subject: [PATCH 142/278] d3: Correct overload order (#9663)

Given `selection.datum((d,i,o) => 'string')`, TypeScript would always use the first overload, when it should be using the second. Correcting the order fixes this.
---
 d3/d3.d.ts | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/d3/d3.d.ts b/d3/d3.d.ts
index 683fb8532c..880e379a92 100644
--- a/d3/d3.d.ts
+++ b/d3/d3.d.ts
@@ -292,17 +292,17 @@ declare namespace d3 {
              */
             datum(): Datum;
 
-            /**
-             * Set the data item for each node in the selection.
-             * @param value the constant element to use for each node
-             */
-            datum<NewDatum>(value: NewDatum): Update<NewDatum>;
-
             /**
              * Derive the data item for each node in the selection. Useful for situations such as the HTML5 'dataset' attribute.
              * @param value the function to compute data for each node
              */
             datum<NewDatum>(value: (datum: Datum, index: number, outerIndex: number) => NewDatum): Update<NewDatum>;
+            
+            /**
+             * Set the data item for each node in the selection.
+             * @param value the constant element to use for each node
+             */
+            datum<NewDatum>(value: NewDatum): Update<NewDatum>;
 
             /**
              * Reorders nodes in the selection based on the given comparator. Nodes are re-inserted into the document once sorted.

From c99bcd6e34c5b3d98bec55cf183ea591eb4867f8 Mon Sep 17 00:00:00 2001
From: Viktor Zozuliak <zozulyakviktor@gmail.com>
Date: Sun, 19 Jun 2016 04:33:37 +0200
Subject: [PATCH 143/278] add definitions for common-tags (#9671)

---
 common-tags/common-tags-tests.ts | 156 +++++++++++++++++++++++++++++++
 common-tags/common-tags.d.ts     |  62 ++++++++++++
 2 files changed, 218 insertions(+)
 create mode 100644 common-tags/common-tags-tests.ts
 create mode 100644 common-tags/common-tags.d.ts

diff --git a/common-tags/common-tags-tests.ts b/common-tags/common-tags-tests.ts
new file mode 100644
index 0000000000..9114f4414c
--- /dev/null
+++ b/common-tags/common-tags-tests.ts
@@ -0,0 +1,156 @@
+/// <reference path="common-tags.d.ts" />
+
+import * as commonTags from 'common-tags';
+
+/* Test Built-in Tags */
+
+commonTags.commaLists `
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+commonTags.commaListsAnd`
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+commonTags.commaListsOr`
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+let fruits = ['apple', 'orange', 'watermelon'];
+
+commonTags.html`
+  <div class="list">
+    <ul>
+      ${fruits.map(fruit => `<li>${fruit}</li>`)}
+      ${'<li>kiwi</li>\n<li>guava</li>'}
+    </ul>
+  </div>
+`;
+
+commonTags.codeBlock`
+  <div class="list">
+    <ul>
+      ${fruits.map(fruit => `<li>${fruit}</li>`)}
+      ${'<li>kiwi</li>\n<li>guava</li>'}
+    </ul>
+  </div>
+`;
+
+commonTags.source`
+  <div class="list">
+    <ul>
+      ${fruits.map(fruit => `<li>${fruit}</li>`)}
+      ${'<li>kiwi</li>\n<li>guava</li>'}
+    </ul>
+  </div>
+`;
+
+commonTags.oneLine`
+  foo
+  bar
+  baz
+`;
+
+commonTags.oneLineTrim`
+  https://news.com/article
+  ?utm_source=designernews.co
+`;
+
+commonTags.oneLineCommaLists`
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+commonTags.oneLineCommaListsOr`
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+commonTags.oneLineCommaListsAnd`
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+commonTags.inlineLists`
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+commonTags.oneLineInlineLists`
+  I like ${['apples', 'bananas', 'watermelons']}
+  They're good!
+`;
+
+let verb = 'notice';
+
+commonTags.stripIndent`
+  This is a multi-line string.
+  You'll ${verb} that it is indented.
+  We don't want to output this indentation.
+    But we do want to keep this line indented.
+`;
+
+commonTags.stripIndents`
+  This is a multi-line string.
+  You'll ${verb} that it is indented.
+  We don't want to output this indentation.
+    We don't want to keep this line indented either.
+`;
+
+/* Test Tag Constructor */
+
+new commonTags.TemplateTag();
+
+const substitutionReplacer = (oldValue : string, newValue : string) => ({
+    onSubstitution(substitution : string, resultSoFar : string) {
+        if (substitution === oldValue) {
+            return newValue;
+        }
+        return substitution;
+    }
+});
+
+new commonTags.TemplateTag(substitutionReplacer('fizz', 'buzz'));
+
+new commonTags.TemplateTag(
+    substitutionReplacer('fizz', 'buzz'),
+    substitutionReplacer('foo', 'bar')
+);
+
+new commonTags.TemplateTag([
+    substitutionReplacer('fizz', 'buzz'),
+    substitutionReplacer('foo', 'bar')
+]);
+
+new commonTags.TemplateTag({});
+
+new commonTags.TemplateTag({
+    onEndResult: endResult => `${endResult}!`
+});
+
+new commonTags.TemplateTag({
+    onSubstitution: substitution => `${substitution}!`,
+    onEndResult: endResult => `${endResult}!`
+});
+
+/* Tests Built-in Transformers */
+
+new commonTags.TemplateTag(commonTags.trimResultTransformer());
+new commonTags.TemplateTag(commonTags.trimResultTransformer('left'));
+new commonTags.TemplateTag(commonTags.trimResultTransformer('right'));
+
+new commonTags.TemplateTag(commonTags.stripIndentTransformer());
+new commonTags.TemplateTag(commonTags.stripIndentTransformer('initial'));
+new commonTags.TemplateTag(commonTags.stripIndentTransformer('all'));
+
+new commonTags.TemplateTag(commonTags.replaceResultTransformer('foo', 'bar'));
+
+new commonTags.TemplateTag(commonTags.inlineArrayTransformer());
+new commonTags.TemplateTag(commonTags.inlineArrayTransformer({}));
+new commonTags.TemplateTag(commonTags.inlineArrayTransformer({separator: 'foo'}));
+new commonTags.TemplateTag(commonTags.inlineArrayTransformer({conjunction: 'bar'}));
+
+new commonTags.TemplateTag(commonTags.splitStringTransformer('foo'));
diff --git a/common-tags/common-tags.d.ts b/common-tags/common-tags.d.ts
new file mode 100644
index 0000000000..aa443ac33d
--- /dev/null
+++ b/common-tags/common-tags.d.ts
@@ -0,0 +1,62 @@
+// Type definitions for common-tags v1.2.1
+// Project: https://github.com/declandewet/common-tags
+// Definitions by: Viktor Zozuliak <https://github.com/zuzusik>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module 'common-tags' {
+    type TemplateTag = (literals: string[], ...placeholders: any[]) => string;
+
+    type TemplateTransformer = {
+        onSubstitution?: (substitution: string, resultSoFar: string) => string;
+        onEndResult?: (endResult : string) => string;
+    }
+
+    /* Built-in Tags */
+    export var commaLists: TemplateTag;
+
+    export var commaListsAnd: TemplateTag;
+
+    export var commaListsOr: TemplateTag;
+
+    export var html: TemplateTag;
+
+    export var codeBlock: TemplateTag;
+
+    export var source: TemplateTag;
+
+    export var oneLine: TemplateTag;
+
+    export var oneLineTrim: TemplateTag;
+
+    export var oneLineCommaLists: TemplateTag;
+
+    export var oneLineCommaListsOr: TemplateTag;
+
+    export var oneLineCommaListsAnd: TemplateTag;
+
+    export var inlineLists: TemplateTag;
+
+    export var oneLineInlineLists: TemplateTag;
+
+    export var stripIndent: TemplateTag;
+
+    export var stripIndents: TemplateTag;
+
+    /* New Tag Constructor */
+    export var TemplateTag: {
+        new(): TemplateTag;
+        new(...transformers: TemplateTransformer[]): TemplateTag;
+        new(transformers: TemplateTransformer[]): TemplateTag;
+    };
+
+    /* Built-in Transformers */
+    export var trimResultTransformer: (side?: 'left'|'right') => TemplateTransformer;
+
+    export var stripIndentTransformer: (type?: 'initial'|'all') => TemplateTransformer;
+
+    export var replaceResultTransformer: (replaceWhat: string, replaceWith: string) => TemplateTransformer;
+
+    export var inlineArrayTransformer: (opts?: {separator?: string, conjunction?: string}) => TemplateTransformer;
+
+    export var splitStringTransformer: (splitBy: string) => TemplateTransformer;
+}

From 53e018f956dcf5c20f646f6be9a8d3180b2babcb Mon Sep 17 00:00:00 2001
From: Konstantin Burkalev <KSDaemon@ya.ru>
Date: Sun, 19 Jun 2016 05:33:48 +0300
Subject: [PATCH 144/278] Updated definitions for wampy.js v3.0.x (#9667)

---
 wampy/wampy-tests.ts |  5 +++--
 wampy/wampy.d.ts     | 22 +++++++++++++++++-----
 2 files changed, 20 insertions(+), 7 deletions(-)

diff --git a/wampy/wampy-tests.ts b/wampy/wampy-tests.ts
index f7dcf9fe52..c0ac8d6656 100644
--- a/wampy/wampy-tests.ts
+++ b/wampy/wampy-tests.ts
@@ -13,7 +13,8 @@ ws.options({
     onConnect: function () { console.log('Yahoo! We are online!'); },
     onClose: function () { console.log('See you next time!'); },
     onError: function () { console.log('Breakdown happened'); },
-    onReconnect: function () { console.log('Reconnecting...'); }
+    onReconnect: function () { console.log('Reconnecting...'); },
+    onReconnectSuccess: function () { console.log('Successfully reconnected!'); }
 });
 
 ws.connect();
@@ -93,7 +94,7 @@ var status = ws.getOpStatus();
 
 ws.cancel(status.reqId);
 
-var sqrt_f = function (x: number) { return x*x; };
+var sqrt_f = function (x: number, y: any) { return [{}, x*x]; };
 
 ws.register('sqrt.value', sqrt_f);
 
diff --git a/wampy/wampy.d.ts b/wampy/wampy.d.ts
index 650a8a91a5..e068b97a25 100644
--- a/wampy/wampy.d.ts
+++ b/wampy/wampy.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for wampy.js v2.0.1
+// Type definitions for wampy.js v3.0.x
 // Project: https://github.com/KSDaemon/wampy.js
 // Definitions by: Konstantin Burkalev <https://github.com/KSDaemon>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -12,10 +12,13 @@ declare module "wampy" {
         transportEncoding?: string;
         realm?: string;
         helloCustomDetails?: any;
+        onChallenge?: (auth_method: string, challenge_details: string) => string;
+        authid?: string;
         onConnect?: () => void;
         onClose?: () => void;
         onError?: () => void;
         onReconnect?: () => void;
+        onReconnectSuccess?: () => void;
         ws?: any;
         msgpackCoder?: any;
     }
@@ -36,7 +39,7 @@ declare module "wampy" {
     }
 
     interface RegisterCallbacksHash extends SuccessErrorCallbacksHash {
-        rpc: (data: any) => any;
+        rpc: (data: any, options: any) => any[];
     }
 
     interface CallSuccessErrorCallbacksHash {
@@ -51,8 +54,17 @@ declare module "wampy" {
         disclose_me?: boolean;
     }
 
-    interface CallAdvancedOptions extends AdvancedOptions {
+    interface PublishAdvancedOptions extends AdvancedOptions {
+        exclude_authid?: string | string[];
+        exclude_authrole?: string | string[];
+        eligible_authid?: string | string[];
+        eligible_authrole?: string | string[];
+    }
+
+    interface CallAdvancedOptions {
+        disclose_me?: boolean;
         receive_progress?: boolean;
+        timeout?: number;
     }
 
     interface CancelAdvancedOptions {
@@ -71,7 +83,7 @@ declare module "wampy" {
         publish(topicURI: string,
                 payload?: any,
                 callbacks?: SuccessErrorCallbacksHash,
-                advancedOptions?: AdvancedOptions): Wampy;
+                advancedOptions?: PublishAdvancedOptions): Wampy;
         call(topicURI: string,
              payload?: any,
              callbacks?: (((data: any) => void) | CallSuccessErrorCallbacksHash),
@@ -79,7 +91,7 @@ declare module "wampy" {
         cancel(reqId: number,
                callbacks?: ((() => void) | SuccessErrorCallbacksHash),
                advancedOptions?: CancelAdvancedOptions): Wampy;
-        register(topicURI: string, callbacks: (((data: any) => any) | RegisterCallbacksHash)): Wampy;
+        register(topicURI: string, callbacks: (((data: any, options: any) => any[]) | RegisterCallbacksHash)): Wampy;
         unregister(topicURI: string, callbacks?: ((() => void) | SuccessErrorCallbacksHash)): Wampy;
     }
 

From 1f0791147c6c145227b1778bb26781a79d516917 Mon Sep 17 00:00:00 2001
From: Brian Surowiec <xtorted@optonline.net>
Date: Sat, 18 Jun 2016 22:34:04 -0400
Subject: [PATCH 145/278] Add missing bootstrap transition support (#9673)

---
 bootstrap/bootstrap-tests.ts |  5 +++++
 bootstrap/bootstrap.d.ts     | 12 +++++++++++-
 2 files changed, 16 insertions(+), 1 deletion(-)

diff --git a/bootstrap/bootstrap-tests.ts b/bootstrap/bootstrap-tests.ts
index c497e0abcd..f7cfdeab43 100644
--- a/bootstrap/bootstrap-tests.ts
+++ b/bootstrap/bootstrap-tests.ts
@@ -44,3 +44,8 @@ $('.typeahead').typeahead({
 });
 
 $('#navbar').affix();
+
+$('.item').emulateTransitionEnd(2000);
+
+$.support.transition = false;
+console.log(($.support.transition as TransitionEventNames).end === "transitionend");
diff --git a/bootstrap/bootstrap.d.ts b/bootstrap/bootstrap.d.ts
index b0e8fbf858..ae84454332 100644
--- a/bootstrap/bootstrap.d.ts
+++ b/bootstrap/bootstrap.d.ts
@@ -53,7 +53,7 @@ interface PopoverOptions {
 }
 
 interface CollapseOptions {
-    parent?: any;    
+    parent?: any;
     toggle?: boolean;
 }
 
@@ -79,6 +79,10 @@ interface AffixOptions {
     target?: any;
 }
 
+interface TransitionEventNames {
+    end: string;
+}
+
 interface JQuery {
     modal(options?: ModalOptions): JQuery;
     modal(options?: ModalOptionsBackdropString): JQuery;
@@ -114,6 +118,12 @@ interface JQuery {
     typeahead(options?: TypeaheadOptions): JQuery;
 
     affix(options?: AffixOptions): JQuery;
+
+    emulateTransitionEnd(duration: number): JQuery;
+}
+
+interface JQuerySupport {
+    transition: boolean | TransitionEventNames;
 }
 
 declare module "bootstrap" {

From cd4af2f88f3ea96c9059b17e33dc20df0f4bcce1 Mon Sep 17 00:00:00 2001
From: Alireza Dabiri Nejad <alirdn@users.noreply.github.com>
Date: Sun, 19 Jun 2016 07:05:36 +0430
Subject: [PATCH 146/278] Add Nw.js (https://github.com/nwjs/nw.js) Definitions
 (#9595)

* Add NW.js Definitions File

* Add NW.js Tests File

* Rename nw.js.tests.ts to nw.js-tests.ts

* Fix tests of nw.js-test.ts fails

Tests of `nw.js-test.ts` fails because `nw` was declared as module not namespace.

* Final fixes for tests failures

Fix below issues:
1- no reference to nw.js.d.ts
2- not defined some variables types (item: line 91 - screen: lines 136, 140, 144 - optional: line 167 - msg: line 230 )
---
 nw.js/nw.js-tests.ts |  352 ++++++++
 nw.js/nw.js.d.ts     | 1883 ++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 2235 insertions(+)
 create mode 100644 nw.js/nw.js-tests.ts
 create mode 100644 nw.js/nw.js.d.ts

diff --git a/nw.js/nw.js-tests.ts b/nw.js/nw.js-tests.ts
new file mode 100644
index 0000000000..585b7ebe3c
--- /dev/null
+++ b/nw.js/nw.js-tests.ts
@@ -0,0 +1,352 @@
+/// <reference path="nw.js.d.ts" />
+/*
+ * nw.App Tests
+ */
+var argv = nw.App.argv;
+var fullArgv = nw.App.fullArgv;
+var filteredArgv = nw.App.filteredArgv;
+var dataPath = nw.App.dataPath;
+var manifest = nw.App.manifest;
+
+nw.App.clearCache();
+nw.App.closeAllWindows();
+nw.App.crashBrowser();
+nw.App.crashRenderer();
+nw.App.getProxyForURL( 'https://github.com/alirdn' );
+nw.App.setProxyConfig( 'http=foopy:80;ftp=foopy2' );
+nw.App.quit();
+nw.App.addOriginAccessWhitelistEntry( 'http://github.com/', 'chrome-extension', location.host, true );
+nw.App.removeOriginAccessWhitelistEntry( 'http://github.com/', 'chrome-extension', location.host, true );
+
+/*
+ * Note:
+ * nw.App.registerGlobalHotKey() tested in Shortcut Tests
+ * nw.App.unregisterGlobalHotKey() tested in Shortcut Tests
+ * */
+
+nw.App.on( 'open', function ( args ) {
+    console.log( args );
+});
+
+nw.App.on( 'reopen', function () {
+    console.log( 'reopened' );
+});
+
+/**
+ * nw.Clipboard Tests
+ */
+// get the system clipboard
+var clipboard = nw.Clipboard.get();
+// Read from clipboard
+var text = clipboard.get( 'text' );
+console.log( text );
+
+// Or write something
+clipboard.set( 'I love NW.js :)', 'text' );
+
+// And clear it!
+clipboard.clear();
+
+/**
+ * nw.Menu Tests
+ */
+// Create an empty context menu
+var menu = new nw.Menu();
+
+// Add some items
+menu.append( new nw.MenuItem( { label: 'Item A' }) );
+menu.append( new nw.MenuItem( { label: 'Item B' }) );
+menu.append( new nw.MenuItem( { type: 'separator' }) );
+menu.append( new nw.MenuItem( { label: 'Item C' }) );
+
+// Remove one item
+menu.removeAt( 1 );
+
+// Popup as context menu
+menu.popup( 10, 10 );
+
+// Iterate menu's items
+for ( var i = 0; i < menu.items.length; ++i ) {
+    console.log( menu.items[i] );
+}
+// Create an empty menubar
+var menu = new nw.Menu( { type: 'menubar' });
+
+// Create a submenu as the 2nd level menu
+var submenu = new nw.Menu();
+submenu.append( new nw.MenuItem( { label: 'Item A' }) );
+submenu.append( new nw.MenuItem( { label: 'Item B' }) );
+
+// Create and append the 1st level menu to the menubar
+menu.append( new nw.MenuItem( {
+    label: 'First Menu',
+    submenu: submenu
+}) );
+
+// Assign it to `window.menu` to get the menu displayed
+nw.Window.get().menu = menu;
+
+/**
+ * nw.MenuItem Tests
+ */
+var item: any;
+
+// Create a separator
+item = new nw.MenuItem( { type: 'separator' });
+
+// Create a normal item with label and icon
+item = new nw.MenuItem( {
+    type: "normal",
+    label: "I'm a menu item",
+    icon: "img/icon.png"
+});
+
+// Or you can omit the 'type' field for normal items
+item = new nw.MenuItem( { label: 'Simple item' });
+
+// Bind a callback to item
+item = new nw.MenuItem( {
+    label: "Click me",
+    click: function () {
+        console.log( "I'm clicked" );
+    },
+    key: "s",
+    modifiers: "ctrl+alt",
+});
+
+// You can have submenu!
+var submenu = new nw.Menu();
+submenu.append( new nw.MenuItem( { label: 'Item 1' }) );
+submenu.append( new nw.MenuItem( { label: 'Item 2' }) );
+submenu.append( new nw.MenuItem( { label: 'Item 3' }) );
+item.submenu = submenu;
+
+// And everything can be changed at runtime
+item.label = 'New label';
+item.click = function () {
+    console.log( 'New click callback' );
+};
+
+/**
+ * nw.Screen Tests
+ */
+//init must be called once during startup, before any function to nw.Screen can be called
+nw.Screen.Init();
+
+var screenCB = {
+    onDisplayBoundsChanged: function ( screen: any ) {
+        console.log( 'displayBoundsChanged', screen );
+    },
+
+    onDisplayAdded: function ( screen: any ) {
+        console.log( 'displayAdded', screen );
+    },
+
+    onDisplayRemoved: function ( screen: any ) {
+        console.log( 'displayRemoved', screen )
+    }
+};
+
+// listen to screen events
+nw.Screen.on( 'displayBoundsChanged', screenCB.onDisplayBoundsChanged );
+nw.Screen.on( 'displayAdded', screenCB.onDisplayAdded );
+nw.Screen.on( 'displayRemoved', screenCB.onDisplayRemoved );
+
+/**
+ * nw.Screen.chooseDesktopMedia() Tests
+ */
+nw.Screen.Init(); // you only need to call this once
+nw.Screen.chooseDesktopMedia( ["window", "screen"],
+    function ( streamId ) {
+        var vid_constraint = {
+            mandatory: {
+                chromeMediaSource: 'desktop',
+                chromeMediaSourceId: streamId,
+                maxWidth: 1920,
+                maxHeight: 1080
+            },
+            optional: <any[]>[]
+        };
+        //navigator.webkitGetUserMedia( { audio: false, video: constraint }, success_func, fallback_func );
+    }
+);
+
+/**
+ * nw.Screen.DesktopCaptureMonitor Tests
+ */
+var dcm = nw.Screen.DesktopCaptureMonitor;
+nw.Screen.Init();
+dcm.on( "added", function ( id, name, order, type ) {
+    //select first stream and shutdown
+    var constraints = {
+        audio: {
+            mandatory: {
+                chromeMediaSource: "system",
+                chromeMediaSourceId: dcm.registerStream( id )
+            }
+        },
+        video: {
+            mandatory: {
+                chromeMediaSource: 'desktop',
+                chromeMediaSourceId: dcm.registerStream( id )
+            }
+        }
+    };
+
+    // TODO: call getUserMedia with contraints
+
+    dcm.stop();
+});
+
+dcm.on( "removed", function ( id ) {
+});
+dcm.on( "orderchanged", function ( id, new_order, old_order ) {
+});
+dcm.on( "namechanged", function ( id, name ) {
+});
+dcm.on( "thumbnailchanged", function ( id, thumbnail ) {
+});
+dcm.start( true, true );
+
+/**
+ * nw.Shell Tests
+ */
+// Open URL with default browser.
+nw.Shell.openExternal( 'https://github.com/nwjs/nw.js' );
+
+// Open a text file with default text editor.
+nw.Shell.openItem( 'test.txt' );
+
+// Show a file in parent folder with file manager.
+nw.Shell.showItemInFolder( 'test.txt' );
+
+/**
+ * nw.Shortcut Tests
+ */
+var option = {
+    key: "Ctrl+Shift+A",
+    active: function () {
+        console.log( "Global desktop keyboard shortcut: " + this.key + " active." );
+    },
+    failed: function ( msg: any ) {
+        // :(, fail to register the |key| or couldn't parse the |key|.
+        console.log( msg );
+    }
+};
+
+// Create a shortcut with |option|.
+var shortcut = new nw.Shortcut( option );
+
+// Register global desktop shortcut, which can work without focus.
+nw.App.registerGlobalHotKey( shortcut );
+
+// If register |shortcut| successfully and user struck "Ctrl+Shift+A", |shortcut|
+// will get an "active" event.
+
+// You can also add listener to shortcut's active and failed event.
+shortcut.on( 'active', function () {
+    console.log( "Global desktop keyboard shortcut: " + this.key + " active." );
+});
+
+shortcut.on( 'failed', function ( msg: any ) {
+    console.log( msg );
+});
+
+// Unregister the global desktop shortcut.
+nw.App.unregisterGlobalHotKey( shortcut );
+
+/**
+ * nw.Tray Tests
+ */
+// Create a tray icon
+var tray = new nw.Tray( { title: 'Tray', icon: 'img/icon.png' });
+
+// Give it a menu
+var menu = new nw.Menu();
+menu.append( new nw.MenuItem( { type: 'checkbox', label: 'box1' }) );
+tray.menu = menu;
+
+// Remove the tray
+tray.remove();
+tray = null;
+
+/**
+ * nw.Window Tests
+ */
+// Get the current window
+var win = nw.Window.get();
+
+// Listen to the minimize event
+win.on( 'minimize', function () {
+    console.log( 'Window is minimized' );
+});
+
+// Minimize the window
+win.minimize();
+
+// Unlisten the minimize event
+win.removeAllListeners( 'minimize' );
+
+// Create a new window and get it
+nw.Window.open( 'https://github.com', {}, function ( new_win ) {
+    // And listen to new window's focus event
+    new_win.on( 'focus', function () {
+        console.log( 'New window is focused' );
+    });
+});
+
+// Get the current window
+var win = nw.Window.get();
+
+// Create a new window and get it
+nw.Window.open( 'https://github.com/nwjs/nw.js', {}, function ( new_win ) {
+    // do something with the newly created window
+});
+
+win.on( 'close', function () {
+    this.hide(); // Pretend to be closed already
+    console.log( "We're closing..." );
+    this.close( true ); // then close it forcely
+});
+
+win.close();
+
+// png as base64string
+win.capturePage( function ( base64string ) {
+    // do something with the base64string
+}, { format: 'png', datatype: 'raw' });
+
+// png as node buffer
+win.capturePage( function ( buffer ) {
+    // do something with the buffer
+}, { format: 'png', datatype: 'buffer' });
+
+// Open a new window.
+nw.Window.open( 'popup.html', {}, function ( win ) {
+
+    // Release the 'win' object here after the new window is closed.
+    win.on( 'closed', function () {
+        win = null;
+    });
+
+    // Listen to main window's close event
+    nw.Window.get().on( 'close', function () {
+        // Hide the window to give user the feeling of closing immediately
+        this.hide();
+
+        // If the new window is still open then close it.
+        if ( win != null )
+            win.close( true );
+
+        // After closing the new window, close the main window.
+        this.close( true );
+    });
+
+});
+
+nw.Window.get().on( 'new-win-policy', function ( frame, url, policy ) {
+    // do not open the window
+    policy.ignore();
+    // and open it in external browser
+    nw.Shell.openExternal( url );
+});
diff --git a/nw.js/nw.js.d.ts b/nw.js/nw.js.d.ts
new file mode 100644
index 0000000000..6ae2582e50
--- /dev/null
+++ b/nw.js/nw.js.d.ts
@@ -0,0 +1,1883 @@
+// Type definitions for nw.js v0.13.x and later
+// Project: http://nwjs.io
+// Definitions by: Alireza Dabiri Nejad <https://github.com/alirdn>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+
+/**
+ * Helpers class and interfaces defined here, to make `nw` module cleaner.
+ */
+declare module NWJS_Helpers {
+
+    /**
+     * Node.js v6.x EventEmitter Class
+     */
+    class EventEmitter implements NodeJS.EventEmitter {
+        static EventEmitter: EventEmitter;
+
+        static listenerCount( emitter: EventEmitter, event: string ): number; // deprecated
+        static defaultMaxListeners: number;
+
+        addListener( event: string, listener: Function ): this;
+
+        on( event: string, listener: Function ): this;
+
+        once( event: string, listener: Function ): this;
+
+        removeListener( event: string, listener: Function ): this;
+
+        removeAllListeners( event?: string ): this;
+
+        setMaxListeners( n: number ): this;
+
+        getMaxListeners(): number;
+
+        listeners( event: string ): Function[];
+
+        emit( event: string, ...args: any[] ): boolean;
+
+        listenerCount( type: string ): number;
+    }
+
+    /**
+     * The clipboard object.
+     */
+    interface clip {
+
+        /**
+         * Write `data` of `type` to the clipboard.
+         *
+         * @param data {string} the data to write to the clipboard
+         * @param type {string} (Optional) the type of the data. Support text, png, jpeg, html and rtf. By default, type is set to "text".
+         * @param raw {boolean} (Optional) requiring raw image data. This option is only valid if type is png or jpeg. By default, raw is set to false.
+         */
+        set( data: string, type?: string, raw?: boolean ): void;
+
+        /**
+         * Get the data of `type` from clipboard.
+         *
+         * @param type {string} (Optional) the type of the data. Support text, png, jpeg, html and rtf. By default, type is set to "text".
+         * @param raw {boolean} (Optional) requiring raw image data. This option is only valid if type is png or jpeg.
+         * @returns {string} the data retrieved from the clipboard.
+         */
+        get( type?: string, raw?: boolean ): string;
+
+        /**
+         * Get an array contains list of available types of data in clipboard currenly.
+         * You can use the returned list as a suggestion to get the right data from clipboard.
+         *
+         * @returns {string[]} List of available types of data in clipboard currenly.
+         */
+        readAvailableTypes(): string[];
+
+        /**
+         * Clear the clipboard.
+         */
+        clear(): void;
+    }
+
+    /**
+     * Object that contains options to use while creation of nw.Menu. example: new nw.Menu(MenuOption)
+     */
+    interface MenuOption {
+        /**
+         * {string} (Optional) two types are accepted by this method: "menubar" or "contextmenu". The value is set to "contextmenu" by default.
+         */
+        type: string;
+    }
+
+    /**
+     * Options to modify default `edit` and `window` MenuItems in Mac.
+     */
+    interface CreateMacBuiltinOption {
+
+        /**
+         * {Boolean} (Optional) do not populate the Edit menu
+         */
+        hideEdit?: boolean;
+
+        /**
+         * {Boolean} (Optional) do not populate the Window menu
+         */
+        hideWindow?: boolean;
+    }
+
+    /**
+     * Options for MenuItem.
+     */
+    interface MenuItemOption {
+
+        /**
+         * {string} (Optional) Label for normal item or checkbox
+         */
+        label?: string;
+
+        /**
+         * {string} (Optional) Icon for normal item or checkbox
+         */
+        icon?: string;
+
+        /**
+         * {string} (Optional) Tooltip for normal item or checkbox
+         */
+        tooltip?: string;
+
+        /**
+         * {string} (Optional) The type of the item. Three types are accepted: normal, checkbox, separator
+         */
+        type?: string | "normal" | "checkbox" | "separator";
+
+        /**
+         * {Function} (Optional) The callback function when item is triggered by mouse click or keyboard shortcut
+         */
+        click?: Function;
+
+        /**
+         * {boolean} (Optional) Whether the item is enabled or disabled. It"s set to true by default.
+         */
+        enabled?: boolean;
+
+        /**
+         * {boolean} (Optional) Whether the checkbox is checked or not. It"s set to false by default.
+         */
+        checked?: boolean;
+
+        /**
+         * {nw.Menu} (Optional) A submenu
+         */
+        submenu?: nw.Menu;
+
+        /**
+         * {string} (Optional) The key of the shortcut
+         */
+        key?: string;
+
+        /**
+         * {string} (Optional) The modifiers of the shortcut
+         */
+        modifiers?: string;
+    }
+
+    /**
+     * nw.Screen screen object
+     */
+    interface screen {
+
+        /**
+         * Unique id for a screen
+         */
+        id: number,
+
+        /**
+         * Physical screen resolution, can be negative, not necessarily start from 0,depending on screen arrangement
+         */
+        bounds: {
+            x: number,
+            y: number,
+            width: number,
+            height: number
+        },
+
+        /**
+         * Useable area within the screen bound
+         */
+        work_area: {
+            x: number,
+            y: number,
+            width: number,
+            height: number
+        },
+
+        scaleFactor: number,
+
+        isBuiltIn: boolean,
+
+        rotation: number,
+
+        touchSupport: number
+    }
+
+    /**
+     * This API behaves similar functions as Screen.chooseDesktopMedia. But it doesn"t have GUI.
+     */
+    interface DesktopCaptureMonitor extends EventEmitter {
+
+        /**
+         * Boolean of whether the DesktopCaptureMonitor is started.
+         */
+        started: boolean;
+
+        /**
+         * The DesktopCaptureMonitor will start monitoring the system and trigger the the events.
+         *
+         * @param should_include_screens {boolean} Whether should include screens
+         * @param should_include_windows {boolean} Whether should include windows
+         */
+        start( should_include_screens: boolean, should_include_windows: boolean ): void;
+
+        /**
+         * The DesktopCaptureMonitor will stop monitoring the system.
+         */
+        stop(): void;
+
+        /**
+         * Register and return a valid stream id passed into chromeMediaSourceId in getUserMedia constraints.
+         *
+         * @param id {string} valid stream id.
+         */
+        registerStream( id: string ): void;
+
+        on( event: string, listener: Function ): this;
+
+        /**
+         * Emit when a new source was added.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(id?,name?,order?,type?,primary?)} The callback that handles the `added` event.
+         * - (optional) id {string} Is the media id.
+         * - (optional) name {string} Is the title of the window or screen.
+         * - (optional) order {number} Is the z-order of the windows, if screens are selected they will appear first.
+         * - (optional) type {string} Type of the stream: "screen", "window", "other" or "unknown".
+         * - (optional) primary {boolean} This will be true if the source is the primary monitor. (Windows OS only)
+         */
+        on( event: 'added', listener: ( id?: string, name?: string, order?: number, type?: string, primary?: boolean ) => any ): this;
+
+        /**
+         * Emit when a source was removed.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(order?)} The callback that handles the `remove` event.
+         * - (optional) order {number} Is the order of the media source that is no longer capturable.
+         */
+        on( event: 'removed', listener: ( order?: number ) => any ): this;
+
+        /**
+         * Emit when the Z-order of a source changed (this may change for windows as others are focused).
+         *
+         * @param event {string} Event name
+         * @param listener {Function(id?,new_order?,old_order?)} The callback that handles the `orderchanged` event.
+         * - (optional) id {string} Is the media id of the screen or window that has changed z-order.
+         * - (optional) new_order {number} Is the new z-order.
+         * - (optional) old_order {number} Is the old z-order.
+         */
+        on( event: 'orderchanged', listener: ( id?: string, new_order?: number, old_order?: number ) => any ): this;
+
+        /**
+         * Emit when the name of the source has changed. This can happen when a window changes title.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(id?,new_order?,old_order?)} The callback that handles the `namechanged ` event.
+         * - (optional) id {string} Is the media id of the screen or window that has a name changed.
+         * - (optional) name {string} Is the new name of the screen or window.
+         */
+        on( event: 'namechanged', listener: ( id?: string, name?: string ) => any ): this;
+
+        /**
+         * Emit when the thumbnail of a source changed.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(id?,new_order?,old_order?)} The callback that handles the `thumbnailchanged ` event.
+         * - (optional) id {string} Is the media id of the screen or window that has an updated thumbnail.
+         * - (optional) name {string} Is the base64 encoded png of the thumbnail.
+         */
+        on( event: 'thumbnailchanged', listener: ( id?: string, thumbnail?: string ) => any ): this;
+    }
+
+    /**
+     * Shortcut option is an object contains initial settings for the Shortcut.
+     */
+    interface ShortcutOption {
+
+        /**
+         * {Function} (Optional) A callback when the hotkey is triggered.
+         */
+        active: Function;
+
+        /**
+         * {Function} (Optional) A callback when failed to register the hotkey.
+         *
+         * @param msg {string} Failure message
+         */
+        failed: ( msg?: string ) => any;
+
+        /**
+         * {string} Key combinations of the shortcut, such as "ctrl+shift+a".
+         */
+        key: string;
+    }
+
+    /**
+     *  Option for tray that contains initial settings for the Tray.
+     */
+    interface TrayOption {
+
+        /**
+         * {string} title
+         */
+        title?: string;
+
+        /**
+         * {string} tooltip
+         */
+        tooltip?: string;
+
+        /**
+         * {string} icon
+         */
+        icon?: string;
+
+        /**
+         * {string} alternate
+         */
+        alticon?: string;
+
+        /**
+         * {boolean} whether icons are templates
+         */
+        iconsAreTemplates?: boolean;
+
+        /**
+         * {Menu} popup menu
+         */
+        menu?: nw.Menu;
+    }
+
+    /**
+     * Options for nw.Window.get().print().
+     */
+    interface PrintOption {
+
+        /**
+         * The device name of the printer
+         */
+        printer: string;
+
+        /**
+         * The path of the output PDF when printing to PDF
+         */
+        pdf_path: string;
+
+        /**
+         * Whether to enable header and footer
+         */
+        headerFooterEnabled: boolean;
+
+        /**
+         * Whether to use landscape or portrait
+         */
+        landscape: boolean;
+
+        /**
+         * The paper size spec
+         * example: 'mediaSize':{'name': 'CUSTOM', 'width_microns': 279400, 'height_microns': 215900, 'custom_display_name':'Letter', 'is_default': true}
+         */
+        mediaSize: JSON;
+
+        /**
+         * Whether to print CSS backgrounds
+         */
+        shouldPrintBackgrounds: boolean;
+    }
+
+    /**
+     * Config for nw.Window.get().capturePage().
+     */
+    interface CapturePageConfig {
+
+        /**
+         * (Optional) The image format used to generate the image. It supports two formats: "png" and "jpeg". If ignored, it’s "jpeg" by default.
+         */
+        format?: string
+
+        /**
+         *  (Optional) It supports three types: "raw", "buffer" and "datauri". If ignored, it’s "datauri" by default.
+         */
+        datatype?: string
+    }
+
+    /**
+     * This includes multiple functions to manipulate the cookies.
+     */
+    interface Cookies {
+
+        /**
+         * Retrieves information about a single cookie.
+         *
+         * @param details {Objet} Details to identify the cookie being retrieved.
+         * @param callback {function(cookie?)} The callback when cookie retrieved.
+         * - (Optional) cookie {Cookie} Contains details about the cookie. This parameter is null if no such cookie was found.
+         */
+        get( details: CookiesGetDetails, callback: ( cookie?: Cookie ) => void ): void;
+
+        /**
+         * Retrieves all cookies from a single cookie store that match the given information.
+         *
+         * @param details {Objet} Information to filter the cookies being retrieved.
+         * @param callback {function(cookies?)} The callback when cookies retrieved.
+         * - (Optional) cookies {Cookie[]} All the existing, unexpired cookies that match the given cookie info.
+         */
+        getAll( details: CookiesGetAllDetails, callback: ( cookies?: Cookie[] ) => void ): void;
+
+        /**
+         * Sets a cookie with the given cookie data; may overwrite equivalent cookies if they exist.
+         *
+         * @param details {Objet} Details about the cookie being set.
+         * @param callback {function(cookie?)} The callback when cookie has been set.
+         * - (Optional) cookie {Cookie} Contains details about the cookie that's been set. If setting failed for any reason, this will be "null", and "chrome.runtime.lastError" will be set.
+         */
+        set( details: CookiesSetDetails, callback: ( cookie?: Cookie ) => void ): void;
+
+        /**
+         * Deletes a cookie by name.
+         *
+         * @param details {Objet} Information to identify the cookie to remove.
+         * @param callback {function(cookie?)} The callback when cookie has been set.
+         * - (Optional) details {Objet} Contains details about the cookie that's been removed. If removal failed for any reason, this will be "null", and "chrome.runtime.lastError" will be set.
+         */
+        remove( details: CookiesRemoveDetails, callback: ( details?: CookiesRemovedDetails ) => void ): void;
+
+        /**
+         * Fired when a cookie is set or removed.
+         */
+        onChanged: {
+            /**
+             * Add a new listener for onChanged event.
+             *
+             * @param callback {function(changeInfo?)} The callback when cookie has been changed.
+             * - (Optional) changeInfo {Objet} Contains details about the cookie that's been changed.
+             */
+            addListener( callback: ( changeInfo: CookiesOnChangedCallbackChangeInfo ) => void ): void;
+        }
+    }
+
+    /**
+     * Represents information about an HTTP cookie.
+     */
+    interface Cookie {
+
+        /**
+         * The name of the cookie.
+         */
+        name: string;
+
+        /**
+         * The value of the cookie.
+         */
+        value: string;
+
+        /**
+         * The domain of the cookie (e.g. "www.google.com", "example.com").
+         */
+        domain: string;
+
+        /**
+         * True if the cookie is a host-only cookie (i.e. a request's host must exactly match the domain of the cookie).
+         */
+        hostOnly: boolean;
+
+        /**
+         * The path of the cookie.
+         */
+        path: string;
+
+        /**
+         * True if the cookie is marked as Secure (i.e. its scope is limited to secure channels, typically HTTPS).
+         */
+        secure: boolean;
+
+        /**
+         * True if the cookie is marked as HttpOnly (i.e. the cookie is inaccessible to client-side scripts).
+         */
+        httpOnly: boolean;
+
+        /**
+         * The cookie's same-site status (i.e. whether the cookie is sent with cross-site requests).
+         */
+        sameSite: string | "no_restriction" | "lax" | "strict";
+
+        /**
+         * True if the cookie is a session cookie, as opposed to a persistent cookie with an expiration date.
+         */
+        session: boolean;
+
+        /**
+         * (Optional) The expiration date of the cookie as the number of seconds since the UNIX epoch. Not provided for session cookies.
+         */
+        expirationDate?: number;
+
+        /**
+         * The ID of the cookie store containing this cookie.
+         */
+        storeId: string;
+    }
+
+    /**
+     * Coockies.get() details argument object
+     */
+    interface CookiesGetDetails {
+
+        /**
+         * The URL with which the cookie to retrieve is associated.
+         */
+        url: string;
+
+        /**
+         * The name of the cookie to retrieve.
+         */
+        name: string;
+
+        /**
+         * The ID of the cookie store in which to look for the cookie.
+         */
+        storeId: string;
+    }
+
+    /**
+     * Coockies.getAll() details argument object
+     */
+    interface CookiesGetAllDetails {
+
+        /**
+         * Restricts the retrieved cookies to those that would match the given URL.
+         */
+        url?: string;
+
+        /**
+         * Filters the cookies by name.
+         */
+        name?: string;
+
+        /**
+         * Restricts the retrieved cookies to those whose domains match or are subdomains of this one.
+         */
+        domain?: string;
+
+        /**
+         * Restricts the retrieved cookies to those whose path exactly matches this string.
+         */
+        path?: string;
+
+        /**
+         * Filters the cookies by their Secure property.
+         */
+        secure?: boolean;
+
+        /**
+         * Filters out session vs. persistent cookies.
+         */
+        session: boolean;
+
+        /**
+         * The cookie store to retrieve cookies from. If omitted, the current execution context's cookie store will be used.
+         */
+        storeId?: string;
+    }
+
+    /**
+     * Coockies.set() details argument object
+     */
+    interface CookiesSetDetails {
+
+        /**
+         * The request-URI to associate with the setting of the cookie.
+         */
+        url: string;
+
+        /**
+         * The name of the cookie. Empty by default if omitted.
+         */
+        name?: string;
+
+        /**
+         * The value of the cookie. Empty by default if omitted.
+         */
+        value?: string;
+
+        /**
+         * The domain of the cookie. If omitted, the cookie becomes a host-only cookie.
+         */
+        domain?: string;
+
+        /**
+         * The path of the cookie. Defaults to the path portion of the url parameter.
+         */
+        path?: string;
+
+        /**
+         * Whether the cookie should be marked as Secure. Defaults to false.
+         */
+        secure?: boolean;
+
+        /**
+         * Whether the cookie should be marked as HttpOnly. Defaults to false.
+         */
+        httpOnly?: boolean;
+
+        /**
+         * The cookie's same-site status: defaults to 'no_restriction'.
+         */
+        sameSite?: string | "no_restriction" | "lax" | "strict";
+
+        /**
+         * The expiration date of the cookie as the number of seconds since the UNIX epoch. If omitted, the cookie becomes a session cookie.
+         */
+        expirationDate?: number;
+
+        /**
+         * The ID of the cookie store in which to set the cookie. By default, the cookie is set in the current execution context's cookie store.
+         */
+        storeId?: string;
+    }
+
+    /**
+     * Coockies.remove() details argument object
+     */
+    interface CookiesRemoveDetails {
+
+        /**
+         * The URL associated with the cookie.
+         */
+        url: string;
+
+        /**
+         * The name of the cookie to remove.
+         */
+        name: string;
+
+        /**
+         * The ID of the cookie store to look in for the cookie.
+         */
+        storeId: string;
+    }
+
+    /**
+     * Coockies.remove() callback details argument object
+     */
+    interface CookiesRemovedDetails {
+
+        /**
+         * The URL associated with the cookie that's been removed.
+         */
+        url: string;
+
+        /**
+         * The name of the cookie that's been removed.
+         */
+        name: string;
+
+        /**
+         * The ID of the cookie store from which the cookie was removed.
+         */
+        storeId: string;
+    }
+
+    /**
+     * Coockies.onChanged.addListener() callback details argument object
+     */
+    interface CookiesOnChangedCallbackChangeInfo {
+
+        /**
+         * True if a cookie was removed.
+         */
+        removed: boolean;
+
+        /**
+         * Information about the cookie that was set or removed.
+         */
+        cookie: Cookie;
+
+        /**
+         * The underlying reason behind the cookie's change.
+         */
+        cause: string | "evicted" | "expired" | "explicit" | "expired_overwrite" | "overwrite"
+    }
+
+    /**
+     * nw.Window.get().on('new-win-policy') callback policy argument object
+     */
+    interface WinPolicy {
+
+        /**
+         * Ignore the request, navigation won’t happen.
+         */
+        ignore(): void;
+
+        /**
+         * Force the link to be opened in the same frame
+         */
+        forceCurrent(): void;
+
+        /**
+         * Force the link to be a downloadable, or open by external program
+         */
+        forceDownload(): void;
+
+        /**
+         * Force the link to be opened in a new window
+         */
+        forceNewWindow(): void;
+
+        /**
+         * Force the link to be opened in a new popup window
+         */
+        forceNewPopup(): void;
+
+        /**
+         * Control the options for the new popup window.
+         *
+         *@param m {Object} The object is in the same format as the Window subfields in manifest format.
+         */
+        setNewWindowManifest( m: WindowOption ): void;
+    }
+
+    /**
+     * nw.Window Option that is in the same format as the Window subfields in manifest format.
+     */
+    interface WindowOption {
+
+        /**
+         * The id used to identify the window.
+         */
+        id?: string;
+
+        /**
+         * The default title of window created by NW.js
+         */
+        title?: string;
+
+        /**
+         * The initial width of the main window.
+         */
+        width?: number;
+
+        /**
+         * The initial height of the main window.
+         */
+        height?: number;
+
+        /**
+         * Path to window’s icon
+         */
+        icon?: string;
+
+        /**
+         * Controls where window will be put, be `null` or `center` or `mouse`
+         */
+        position?: string;
+
+        /**
+         * Minimum width of window
+         */
+        min_width?: number;
+
+        /**
+         * Minimum height of window
+         */
+        min_height?: number;
+
+        /**
+         * Maximum width of window
+         */
+        max_width?: number;
+
+        /**
+         * Maximum height of window
+         */
+        max_height?: number;
+
+        /**
+         * Show as desktop background window under X11 environment
+         */
+        as_desktop?: boolean;
+
+        /**
+         * Whether window is resizable
+         */
+        resizable?: boolean;
+
+        /**
+         * Whether the window should always stay on top of other windows.
+         */
+        always_on_top?: boolean;
+
+        /**
+         * Whether the window should be visible on all workspaces simultaneously (on platforms that support multiple workspaces, currently Mac OS X and Linux).
+         */
+        visible_on_all_workspaces?: boolean;
+
+        /**
+         * Whether window is fullscreen
+         */
+        fullscreen?: boolean;
+
+        /**
+         * Whether the window is shown in taskbar or dock. The default is true.
+         */
+        show_in_taskbar?: boolean;
+
+        /**
+         * Specify it to false to make the window frameless
+         */
+        frame?: boolean;
+
+        /**
+         * Specify it to false if you want your app to be hidden on startup
+         */
+        show?: boolean;
+
+        /**
+         * Whether to use Kiosk mode.
+         */
+        kiosk?: boolean;
+
+        /**
+         * Whether to turn on transparent window mode.
+         */
+        transparent?: boolean;
+    }
+
+    interface WindowOpenOption extends WindowOption {
+
+        /**
+         * (Optional) Whether to open a new window in a separate render process.
+         */
+        new_instance?: boolean;
+
+        /**
+         * (Optional) The script to be injected before document loaded.
+         */
+        inject_js_start?: string;
+
+        /**
+         * (Optional) The script to be injected before document unloaded.
+         */
+        inject_js_end?: string;
+
+        /**
+         * (Optional) The id used to identify the window.
+         */
+        id?: string;
+    }
+
+    /**
+     * nw.Window.get().on('navigation') callback policy argument object
+     */
+    interface WinNavigationPolicy {
+
+        /**
+         * Ignore the request, navigation won’t happen.
+         */
+        ignore(): void;
+    }
+
+    interface win extends EventEmitter {
+
+        /**
+         * Get the corresponding DOM window object of the native window.
+         */
+        window: Object;
+
+        /**
+         * Get or set left offset from window to screen.
+         */
+        x: number;
+
+        /**
+         * Get or set top offset from window to screen.
+         */
+        y: number;
+
+        /**
+         * Get or set window's width.
+         */
+        width: number;
+
+        /**
+         * Get or set window's height.
+         */
+        height: number;
+
+        /**
+         * Get or set window's title.
+         */
+        title: string;
+
+        /**
+         * Get or set window's menubar.
+         */
+        menu: nw.Menu;
+
+        /**
+         * Get whether we're in fullscreen mode.
+         */
+        isFullscreen: boolean;
+
+        /**
+         * Get whether transparency is turned on
+         */
+        isTransparent: boolean;
+
+        /**
+         * Get whether we're in kiosk mode.
+         */
+        isKioskMode: boolean;
+
+        /**
+         * Get or set the page zoom.
+         */
+        zoomLevel: number;
+
+        /**
+         * This includes multiple functions to manipulate the cookies.
+         */
+        cookies: Cookies;
+
+        /**
+         * Moves a window's left and top edge to the specified coordinates.
+         *
+         * @param x {Integer} Offset to the left of the screen
+         * @param y {Integer} Offset to the top of the screen
+         */
+        moveTo( x: number, y: number ): void;
+
+        /**
+         * Moves a window a specified number of pixels relative to its current coordinates.
+         *
+         * @param x {Integer} Horizontal offset
+         * @param y {Integer} Vertical offset
+         */
+        moveBy( x: number, y: number ): void;
+
+        /**
+         * Resizes a window to the specified width and height.
+         *
+         * @param width {Integer} The width of the window
+         * @param height {Integer} The height of the window
+         */
+        resizeTo( width: number, height: number ): void;
+
+        /**
+         * Resizes a window by the specified amount.
+         *
+         * @param width {Integer} The offset width of the window
+         * @param height {Integer} The offset height of the window
+         */
+        resizeBy( width: number, height: number ): void;
+
+        /**
+         * Focus on the window.
+         */
+        focus(): void;
+
+        /**
+         * Move focus away.
+         */
+        blur(): void;
+
+        /**
+         * Show the window if it's not shown.
+         *
+         * @param is_show {boolean} (Optional) Specify whether the window should be shown or hidden. It's set to true by default.
+         */
+        show( is_show?: boolean ): void;
+
+        /**
+         * Hide the window.
+         */
+        hide(): void;
+
+        /**
+         * Close current window.
+         *
+         * @param force {boolean} (Optional) Specify whether to close the window forcely and bypass close event.
+         */
+        close( force?: boolean ): void;
+
+        /**
+         * Reloads the current window.
+         */
+        reload(): void;
+
+        /**
+         * Reloads the current page by starting a new renderer process from scratch.
+         */
+        reloadDev(): void;
+
+        /**
+         * Like reload(), but don't use caches (aka 'shift-reload').
+         */
+        reloadIgnoringCache(): void;
+
+        /**
+         * Maximize the window on GTK and Windows, and zoom the window on Mac OS X.
+         */
+        maximize(): void;
+
+        /**
+         * Minimize the window to task bar on Windows, iconify the window on GTK, and miniaturize the window on Mac OS X.
+         */
+        minimize(): void;
+
+        /**
+         * Restore window to previous state after the window is minimized.
+         */
+        restore(): void;
+
+        /**
+         * Make the window fullscreen.
+         */
+        enterFullscreen(): void;
+
+        /**
+         * Leave the fullscreen mode.
+         */
+        leaveFullscreen(): void;
+
+        /**
+         * Toggle the fullscreen mode.
+         */
+        toggleFullscreen(): void;
+
+        /**
+         * Enter the Kiosk mode.
+         */
+        enterKioskMode(): void;
+
+        /**
+         * Leave the Kiosk mode.
+         */
+        leaveKioskMode(): void;
+
+        /**
+         * Toggle the kiosk mode.
+         */
+        toggleKioskMode(): void;
+
+        /**
+         * Open the devtools to inspect the window.
+         *
+         * @param iframe {Integer} (Optional) the id or the element of the <iframe> to be jailed on. By default, the DevTools is shown for entire window.
+         * @param callback {function(dev_win?)} callback with the native window of the DevTools window.
+         * - (optional) dev_win {window} Window object that you can use any properties and methods of Window except the events
+         */
+        showDevTools( iframe?: string | HTMLIFrameElement, callback?: ( dev_win?: Window ) => void ): void;
+
+        /**
+         * Close the devtools window.
+         */
+        closeDevTools(): void;
+
+        /**
+         * Enumerate the printers in the system.
+         *
+         * @param callback {function(dev_win?)} callback with the native window of the DevTools window.
+         * - (optional) printers {JSON[]} An array of JSON objects for the printer information.
+         */
+        getPrinters( callback: ( printers?: JSON[] ) => void ): void;
+
+        /**
+         * Query the status of devtools window.
+         */
+        isDevToolsOpen(): boolean;
+
+        /**
+         * Print the web contents in the window without the need for user’s interaction.
+         *
+         * @param options {Object} Specify whether to close the window forcely and bypass close event.
+         */
+        print( options: JSON | PrintOption ): void;
+
+        /**
+         * Set window's maximum size.
+         *
+         * @param width {Integer} The maximum width of the window
+         * @param height {Integer} The maximum height of the window
+         */
+        setMaximumSize( width: number, height: number ): void;
+
+        /**
+         * Set window's minimum size.
+         *
+         * @param width {Integer} The minimum width of the window
+         * @param height {Integer} The minimum height of the window
+         */
+        setMinimumSize( width: number, height: number ): void;
+
+        /**
+         * Set whether window is resizable.
+         *
+         * @param resizable {boolean} Whether the window can be resized
+         */
+        setResizable( resizable: boolean ): void;
+
+        /**
+         * Sets the widget to be on top of all other windows in the window system.
+         *
+         * @param top {boolean} Whether the window should always be on top
+         */
+        setAlwaysOnTop( top: boolean ): void;
+
+        /**
+         * For platforms that support multiple workspaces (currently Mac OS X and Linux), this allows NW.js windows to be visible on all workspaces simultaneously.
+         *
+         * @param visible {boolean} Whether the window should be visible on all workspaces
+         */
+        setVisibleOnAllWorkspaces( visible: boolean ): void;
+
+        /**
+         * Returns a a boolean indicating if the platform (currently Mac OS X and Linux) support Window API method setVisibleOnAllWorkspace(Boolean).
+         */
+        canSetVisibleOnAllWorkspaces(): boolean;
+
+        /**
+         * Move window to specified position.
+         *
+         * @param position {string} The position of the window. There are three valid positions: null or center or mouse
+         */
+        setPosition( position: string ): void;
+
+        /**
+         * Control whether to show window in taskbar or dock.
+         *
+         * @param show {boolean} Whether show in task bar
+         */
+        setShowInTaskbar( show: boolean ): void;
+
+        /**
+         * Request the user’s attension by making the window flashes in the task bar.
+         *
+         * @param attension {boolean | number} If a Boolean, it indicates to request or cancel user’s attension. If an Integer, it indicates the number of times the window flashes.
+         */
+        requestAttention( attension: boolean | number ): void;
+
+        /**
+         * Captures the visible area of the window.
+         *
+         * @param callback {string} The callback when finished capturing the window
+         * - (optional) arg {base64string|Buffer} Captured page data.
+         * @param config {string|CapturePageConfig} (Optional) Conig how captured page returned.
+         */
+        capturePage( callback: ( arg: string | Object ) => void, config?: string | CapturePageConfig ): void;
+
+        /**
+         * Show window progress bar.
+         *
+         * @param progress {number} valid values within [0, 1]. Setting to negative value (<0) removes the progress bar.
+         */
+        setProgressBar( progress: number ): void;
+
+        /**
+         * Set the badge label on the window icon in taskbar or dock.
+         *
+         * @param label {string} Badge label.
+         */
+        setBadgeLabel( label: string ): void;
+
+        /**
+         * Execute a piece of JavaScript in the frame.
+         *
+         * @param frame {HTMLIFrameElement} The frame to execute in. If iframe is null, it assumes in current window / frame.
+         * @param script {string} The source code of the script to be executed
+         */
+        eval( frame: HTMLIFrameElement, script: string ): void;
+
+        /**
+         * Load and execute the compiled snapshot in the frame.
+         *
+         * @param frame {HTMLIFrameElement} The frame to execute in. If iframe is null, it assumes in current window / frame.
+         * @param path {string} the path of the snapshot file generated by nwjc
+         */
+        evalNWBin( frame: HTMLIFrameElement, path: string ): void;
+
+        on( event: string, listener: Function ): this;
+
+        /**
+         * The close event is a special event that will affect the result of the Window.close() function.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `close` event.
+         * - (optional) byCommandQ {string} Whether it’s being closed by ⌘+Q.
+         */
+        on( event: 'close', listener: ( byCommandQ?: string | any ) => any ): this;
+
+        /**
+         * The closed event is emitted after corresponding window is closed.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `closed` event.
+         */
+        on( event: 'closed', listener: () => any ): this;
+
+        /**
+         * Emitted when the window starts to reload, normally you cannot catch this event because usually it’s emitted before you actually setup the callback.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `loading` event.
+         */
+        on( event: 'loading', listener: () => any ): this;
+
+        /**
+         * Emitted when the window is fully loaded, this event behaves the same with window.onload, but doesn’t rely on the DOM.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `loaded` event.
+         */
+        on( event: 'loaded', listener: () => any ): this;
+
+        /**
+         * Emitted when the document object in this window or a child iframe is available, after all files are loaded, but before DOM is constructed or any script is run.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `document-start` event.
+         * - (optional) frame {HTMLIFrameElement|any} Is the iframe object, or null if the event is for the window..
+         */
+        on( event: 'document-start', listener: ( frame: HTMLIFrameElement | any ) => any ): this;
+
+        /**
+         * Emitted when the document object in this window or a child iframe is unloaded, but before the onunload event is emitted.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `document-end` event.
+         * - (optional) frame {HTMLIFrameElement|any} Is the iframe object, or null if the event is for the window..
+         */
+        on( event: 'document-end', listener: ( frame: HTMLIFrameElement | any ) => any ): this;
+
+        /**
+         * Emitted when window gets focus.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `focus` event.
+         */
+        on( event: 'focus', listener: () => any ): this;
+
+        /**
+         * Emitted when window loses focus.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `blur` event.
+         */
+        on( event: 'blur', listener: () => any ): this;
+
+        /**
+         * Emitted when window is minimized.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `minimize` event.
+         */
+        on( event: 'minimize', listener: () => any ): this;
+
+        /**
+         * Emitted when window is restored from minimize, maximize and fullscreen state.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `restore` event.
+         */
+        on( event: 'restore', listener: () => any ): this;
+
+        /**
+         * Emitted when window is maximized.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `maximize` event.
+         */
+        on( event: 'maximize', listener: () => any ): this;
+
+        /**
+         * Emitted after window is moved.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `move` event.
+         * - (optional) x {Integer} The new location of the left corner of the window.
+         * - (optional) y {Integer} The new location of the top corner of the window.
+         */
+        on( event: 'move', listener: ( x?: number, y?: number ) => any ): this;
+
+        /**
+         * Emitted after window is resized.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `resize` event.
+         * - (optional) width {Integer} The new width of the window.
+         * - (optional) height {Integer} The new height of the window.
+         */
+        on( event: 'resize', listener: ( width?: number, height?: number ) => any ): this;
+
+        /**
+         * Emitted when window enters fullscreen state.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `enter-fullscreen` event.
+         */
+        on( event: 'enter-fullscreen', listener: () => any ): this;
+
+        /**
+         * Emitted when window zooming changed.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `zoom` event.
+         * - (optional) zoom {Integer} Indicating the new zoom level
+         */
+        on( event: 'zoom', listener: ( zoom?: number ) => any ): this;
+
+        /**
+         * Emitted after Devtools is closed.
+         *
+         * @param event {string} Event name
+         * @param listener {function} The callback that handles the `devtools-closed` event.
+         */
+        on( event: 'devtools-closed', listener: () => any ): this;
+
+        /**
+         * Emitted when a new window is requested from this window or a child iframe.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `new-win-policy` event.
+         * - (optional) frame {HTMLIFrameElement} Is the object of the child iframe where the request is from, or null if it’s from the top window.
+         * - (optional) url {string} Is the address of the requested link
+         * - (optional) policy {Object} Is an object contain window policy.
+         */
+        on( event: 'new-win-policy', listener: ( frame?: HTMLIFrameElement | any, url?: string, policy?: WinPolicy ) => any ): this;
+
+        /**
+         * Emitted when navigating to another page.
+         *
+         * @param event {string} Event name
+         * @param listener {function(byCommandQ?)} The callback that handles the `navigation` event.
+         * - (optional) frame {HTMLIFrameElement} Is the object of the child iframe where the request is from, or null if it’s from the top window.
+         * - (optional) url {string} Is the address of the requested link
+         * - (optional) policy {Object} Is an object contain window policy.
+         */
+        on( event: 'navigation', listener: ( frame?: HTMLIFrameElement | any, url?: string, policy?: WinNavigationPolicy ) => any ): this;
+    }
+}
+
+declare namespace nw {
+
+    /* Reference: http://docs.nwjs.io/en/latest/References/App/ */
+    /**
+     * Application General Functionality And Properties.
+     */
+    export interface App {
+
+        /**
+         * Get the filtered command line arguments when starting the app.
+         */
+        argv: string[];
+
+        /**
+         * Get all the command line arguments when starting the app.
+         */
+        fullArgv: string[];
+
+        /**
+         * Get a list of patterns of filtered command line arguments used by `App.argv`.
+         */
+        filteredArgv: Object[];
+
+        /**
+         * Get the application's data path in user's directory.
+         */
+        dataPath: string;
+
+        /**
+         * Get the JSON object of the manifest file.
+         */
+        manifest: JSON;
+
+        /**
+         * Clear the HTTP cache in memory and the one on disk. This method call is synchronized.
+         */
+        clearCache(): void;
+
+        /**
+         * Send the `close` event to all windows of current app.
+         */
+        closeAllWindows(): void;
+
+        /**
+         * Crash the browser process to test the Crash dump feature.
+         */
+        crashBrowser(): void;
+
+        /**
+         * Crash the renderer process to test the Crash dump feature.
+         */
+        crashRenderer(): void;
+
+        /**
+         * Query the proxy to be used for loading `url` in DOM.
+         *
+         * @param url {string} the URL to query for proxy
+         * @returns {string} Proxy config that is in the same format used in PAC (e.g. "DIRECT", "PROXY localhost:8080").
+         */
+        getProxyForURL( url: string ): string;
+
+        /**
+         * Set the proxy config which the web engine will be used to request network resources.
+         *
+         * @param config {string} Proxy rules
+         */
+        setProxyConfig( config: string ): void;
+
+        /**
+         * Quit current app.
+         */
+        quit(): void;
+
+        /**
+         * Add an entry to the whitelist used for controlling cross-origin access.
+         *
+         * @param sourceOrigin {string} The source origin. e.g. http://github.com/
+         * @param destinationProtocol {string} The destination protocol where the sourceOrigin can access to. e.g. app
+         * @param destinationHost {string} The destination host where the sourceOrigin can access to. e.g. myapp
+         * @param allowDestinationSubdomains {Boolean} If set to true, the sourceOrigin is allowed to access subdomains of
+         */
+        addOriginAccessWhitelistEntry( sourceOrigin: string,
+            destinationProtocol: string,
+            destinationHost: string,
+            allowDestinationSubdomains: boolean ): void;
+
+        /**
+         * Remove an entry from the whitelist used for controlling cross-origin access.
+         *
+         * @param sourceOrigin {string} The source origin. e.g. http://github.com/
+         * @param destinationProtocol {string} The destination protocol where the sourceOrigin can access to. e.g. app
+         * @param destinationHost {string} The destination host where the sourceOrigin can access to. e.g. myapp
+         * @param allowDestinationSubdomains {Boolean} If set to true, the sourceOrigin is allowed to access subdomains of
+         */
+        removeOriginAccessWhitelistEntry( sourceOrigin: string,
+            destinationProtocol: string,
+            destinationHost: string,
+            allowDestinationSubdomains: boolean ): void;
+
+        /**
+         * Register a global keyboard shortcut (also known as system-wide hot key) to the system.
+         *
+         * @param shortcut {Shortcut} the Shortcut object to register.
+         */
+        registerGlobalHotKey( shortcut: Shortcut ): void;
+
+        /**
+         * Unregisters a global keyboard shortcut.
+         *
+         * @param shortcut {Shortcut} the Shortcut object to register.
+         */
+        unregisterGlobalHotKey( shortcut: Shortcut ): void;
+
+        on( event: string, listener: Function ): this;
+
+        /**
+         * Emitted when users opened a file with your app.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(args?)} The callback that handles the `open` event.
+         * - (optional) args {string} the full command line of the program.
+         */
+        on( event: 'open', listener: ( args?: string ) => any ): this;
+
+        /**
+         * This event is sent when the user clicks the dock icon for an already running application. This is a Mac specific feature.
+         *
+         * @param event {string} Event name
+         * @param listener {Function} The callback that handles the `reopen` event.
+         */
+        on( event: 'reopen', listener: () => any ): this;
+    }
+
+    /* Clipboard: http://docs.nwjs.io/en/latest/References/Clipboard/ */
+    /**
+     * `Clipboard` is an abstraction of clipboard for Windows, Linux and Mac.
+     */
+    export interface Clipboard {
+        /**
+         * Get the clipboard object.
+         *
+         * @returns {Clipboard} the clipboard object.
+         */
+        get(): NWJS_Helpers.clip;
+    }
+
+    /* Menu: http://docs.nwjs.io/en/latest/References/Menu/ */
+    /**
+     * `Menu` represents a menubar or a context menu.
+     */
+    class Menu {
+        /**
+         * Create a Menu object.
+         *
+         * @param option {Object} (Optional) Option to customize returned menu object.
+         */
+        constructor( option?: NWJS_Helpers.MenuOption );
+
+        /**
+         * Get an array that contains all items of a menu. Each item is an instance of MenuItem.
+         */
+        items: MenuItem[];
+
+        /**
+         * Append `item` to the tail of the menu.
+         *
+         * @param item {MenuItem} the item to be appended to the tail of the menu
+         */
+        append( item: MenuItem ): void;
+
+        /**
+         * Insert the `item` at `i`th position of the menu. The index is started from 0.
+         *
+         * @param item {MenuItem} the item to be inserted into the menu
+         * @param i {Integer} the index in the menu list to insert the the item
+         */
+        insert( item: MenuItem, i: number ): void;
+
+        /**
+         * Remove `item` from the menu.
+         *
+         * @param item {MenuItem} the item to be removed
+         */
+        remove( item: MenuItem ): void;
+
+        /**
+         * Remove the `i`th item form the menu.
+         *
+         * @param i {Integer} the index of the item to be removed from the menu
+         */
+        removeAt( i: number ): void;
+
+        /**
+         * Popup the context menu at the anchor in (`x`, `y`) in current window.
+         *
+         * @param x {Integer} the x position of the anchor
+         * @param y {Integer} the y position of the anchor
+         */
+        popup( x: number, y: number ): void;
+
+        /**
+         * Creates the builtin menus (App, Edit and Window) within the menubar on Mac.
+         *
+         * @param appname {string} The application name
+         * @param options {Object} (Optional) Options to modify default `edit` and `window` MenuItems in Mac
+         */
+        createMacBuiltin( appname: string, options?: NWJS_Helpers.CreateMacBuiltinOption ): void;
+    }
+
+    /* MenuItem: http://docs.nwjs.io/en/latest/References/MenuItem/ */
+    /**
+     * `MenuItem` represents an item in a menu.
+     */
+    class MenuItem extends NWJS_Helpers.EventEmitter {
+
+        /**
+         * Create a new MenuItem.
+         *
+         * @param option {Object} Customize how MenuItem render and behave.
+         */
+        constructor( option: NWJS_Helpers.MenuItemOption );
+
+        /**
+         * Get the `type` of a `MenuItem`
+         */
+        type: string;
+
+        /**
+         * Get or set the `label` of a `MenuItem`
+         */
+        lable: string;
+
+        /**
+         * Get or set the `icon` of a `MenuItem`
+         */
+        icon: string;
+
+        /**
+         * Get or set whether `icon` image is treated as "template" (`true` by default).
+         */
+        iconIsTemplate: boolean;
+
+        /**
+         * Get or set the `tooltip` of a `MenuItem`
+         */
+        tooltip: boolean;
+
+        /**
+         * Get or set whether the `MenuItem` is `checked`
+         */
+        checked: boolean;
+
+        /**
+         * Get or set whether the `MenuItem` is `enabled`
+         */
+        enabled: string;
+
+        /**
+         * Get or set the `submenu` of a `MenuItem`, the `submenu` must be a `Menu` object.
+         */
+        submenu: Menu;
+
+        /**
+         * Get or set the click `callback` of a `MenuItem`
+         */
+        click: Function;
+
+        /**
+         * A single character string to specify the shortcut key for the menu item.
+         */
+        key: string;
+
+        /**
+         * A string to specify the modifier keys for the shortcut of the menu item.
+         */
+        modifiers: string;
+
+        on( event: string, listener: Function ): this;
+
+        /**
+         * Emitted when user activates the menu item.
+         *
+         * @param event {string} Event name
+         * @param listener {Function} The callback that handles the `click` event.
+         */
+        on( event: 'click', listener: () => any ): this;
+    }
+
+    /* Screen: http://docs.nwjs.io/en/latest/References/Screen/ */
+    /**
+     * Screen is an instance of EventEmitter object, and you"re able to use Screen.on(...) to respond to native screen"s events.
+     * Screen is a singleton object, need to be initiated once by calling nw.Screen.Init().
+     */
+    interface Screen extends NWJS_Helpers.EventEmitter {
+
+        /**
+         * Init the Screen singleton object, you only need to call this once.
+         */
+        Init(): void;
+
+        /**
+         * Get the array of screen (number of screen connected to the computer)
+         */
+        screens: NWJS_Helpers.screen[];
+
+        /**
+         *
+         * @param sources {string[]} Array of source types.
+         * @param callback {Function} callback function with chosed streamId.
+         * - (optional) streamId {string}  streamId will be false if failed to execute or existing session is alive.
+         */
+        chooseDesktopMedia( sources: string[], callback: ( streamId?: string | boolean ) => void ): void;
+
+        /**
+         * Use this API to monitor the changes of screens and windows on desktop. This is an instance of EventEmitter.
+         */
+        DesktopCaptureMonitor: NWJS_Helpers.DesktopCaptureMonitor;
+
+        on( event: string, listener: Function ): this;
+
+        /**
+         * Emitted when the screen resolution, arrangement is changed.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(screen?)} The callback that handles the `displayBoundsChanged` event.
+         * - (optional) screen {screen} screen object
+         */
+        on( event: 'displayBoundsChanged', listener: ( screen: NWJS_Helpers.screen ) => any ): this;
+
+        /**
+         * Emitted when a new screen added.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(screen?)} The callback that handles the `displayAdded` event.
+         * - (optional) screen {screen} screen object
+         */
+        on( event: 'displayAdded ', listener: ( screen: NWJS_Helpers.screen ) => any ): this;
+
+        /**
+         * Emitted when existing screen removed.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(screen?)} The callback that handles the `displayRemoved` event.
+         * - (optional) screen {screen} screen object
+         */
+        on( event: 'displayRemoved ', listener: ( screen: NWJS_Helpers.screen ) => any ): this;
+    }
+
+    /* Shell: http://docs.nwjs.io/en/latest/References/Shell/ */
+    /**
+     * `Shell` is a collection of APIs that do desktop related jobs.
+     */
+    interface Shell {
+
+        /**
+         * Open the given external URI in the desktop"s default manner.
+         *
+         * @param uri {string} A URL to open in system default manner.
+         */
+        openExternal( uri: string ): void;
+
+        /**
+         * Open the given file_path in the desktop"s default manner.
+         *
+         * @param file_path {string} path to a local file
+         */
+        openItem( file_path: string ): void;
+
+        /**
+         * Show the given file_path in the parent folder with file manager. If possible, select the file.
+         *
+         * @param file_path {string} path to a local file
+         */
+        showItemInFolder( file_path: string ): void;
+    }
+
+    /* Shortcut: http://docs.nwjs.io/en/latest/References/Shortcut/ */
+    /**
+     * `Shortcut` represents a global keyboard shortcut, also known as system-wide hotkey.
+     */
+    export class Shortcut extends NWJS_Helpers.EventEmitter {
+
+        /**
+         * Create new Shortcut.
+         *
+         * @param option {Object} Shortcut option is an object contains initial settings for the Shortcut.
+         */
+        constructor( option: NWJS_Helpers.ShortcutOption );
+
+        /**
+         * Get or set the active callback of a Shortcut. It will be called when user presses the shortcut.
+         */
+        active: Function;
+
+        /**
+         * Get or set the failed callback of a Shortcut. It will be called when application passes an invalid key , or failed to register the key.
+         *
+         * @param msg {string} Failure message
+         */
+        failed: ( msg?: string ) => any;
+
+        /**
+         * Get the key of a Shortcut.
+         */
+        key: string;
+
+        on( event: string, listener: Function ): this;
+
+        /**
+         * Get or set the active callback of a Shortcut. It will be called when user presses the shortcut.
+         *
+         * @param event {string} Event name
+         * @param listener {Function} The callback that handles the `active` event.
+         */
+        on( event: 'active', listener: () => any ): this;
+
+        /**
+         * Get or set the failed callback of a Shortcut. It will be called when application passes an invalid key, or failed to register the key.
+         *
+         * @param event {string} Event name
+         * @param listener {Function(msg?)} The callback that handles the `failed` event.
+         * - (optional) msg {string} Failure message
+         */
+        on( event: 'failed', listener: ( msg?: string ) => any ): this;
+    }
+
+    /* Tray: http://docs.nwjs.io/en/latest/References/Tray/ */
+    /**
+     * `Tray` is an abstraction of different controls on different platforms, usually it"s a small icon shown on the OS"s notification area. On Mac OS X it"s called Status Item, on GTK it"s Status Icon, and on Windows it"s System Tray Icon.
+     */
+    export class Tray extends NWJS_Helpers.EventEmitter {
+        /**
+         * Create a new Tray.
+         * @param option {Object} Contains initial settings for the Tray.
+         */
+        constructor( option: NWJS_Helpers.TrayOption );
+
+        /**
+         * Get or set the title of the tray.
+         */
+        title: string;
+
+        /**
+         * Get or set the tooltip of the tray.
+         */
+        tooltip: string;
+
+        /**
+         * Get or set the icon of the tray.
+         */
+        icon: string;
+
+        /**
+         * Get or set the alternate (active) tray icon. (Mac)
+         */
+        alticon: string;
+
+        /**
+         * Get or set whether icon and alticon images are treated as "templates" (true by default). (Mac)
+         */
+        iconsAreTemplates: boolean;
+
+        /**
+         * Get or set the menu of the tray.
+         */
+        menu: Menu;
+
+        /**
+         * Remove the tray.
+         */
+        remove(): void;
+
+        on( event: string, listener: Function ): this;
+
+        /**
+         * Emitted when user clicks the menu item with left mouse button.
+         *
+         * @param event {string} Event name
+         * @param listener {Function} The callback that handles the `click` event.
+         */
+        on( event: 'click ', listener: () => any ): this;
+    }
+
+    /* Window: http://docs.nwjs.io/en/latest/References/Window/ */
+    /**
+     * Window is a wrapper of the DOM's window object. It has extended operations and can receive various window events.
+     */
+    interface Window extends NWJS_Helpers.EventEmitter {
+
+        /**
+         * Get the native Window Object.
+         *
+         * @param event {DOM Window} (Optional) Is the DOM window
+         */
+        get( window_object?: Object ): NWJS_Helpers.win;
+
+        /**
+         * Open a new window and load url in it.
+         *
+         * @param url {string} URL to be loaded in the opened window
+         * @param option {object} (Optional) New window open options like window subfields in manifest format plus some more options
+         * @param callback {string} (Optional) Callback when with the opened native Window object
+         * - (Optional) new_win {object} New opened window object.
+         */
+        open( url: string, option?: NWJS_Helpers.WindowOpenOption, callback?: ( new_win?: NWJS_Helpers.win ) => void ): void;
+    }
+
+    export var App: App;
+    export var Clipboard: Clipboard;
+    export var Screen: Screen;
+    export var Shell: Shell;
+    export var Window: Window;
+}
+
+declare module "nw.gui" {
+    export class Menu extends nw.Menu {
+    }
+    export class MenuItem extends nw.MenuItem {
+    }
+    export class Shortcut extends nw.Shortcut {
+    }
+    export class Tray extends nw.Tray {
+    }
+    export var App: nw.App;
+    export var Clipboard: nw.Clipboard;
+    export var Screen: nw.Screen;
+    export var Shell: nw.Shell;
+    export var Window: nw.Window;
+}

From 9dba99926762bf676bb310686b566e59f1d638f7 Mon Sep 17 00:00:00 2001
From: Scott Bessler <scottbessler@gmail.com>
Date: Sat, 18 Jun 2016 19:37:05 -0700
Subject: [PATCH 147/278] [knex] allow object for .raw parameters (see
 http://knexjs.org/#Raw-Bindings) (#9674)

---
 knex/knex-tests.ts | 2 ++
 knex/knex.d.ts     | 1 +
 2 files changed, 3 insertions(+)

diff --git a/knex/knex-tests.ts b/knex/knex-tests.ts
index 410139f4b6..c01c54691e 100644
--- a/knex/knex-tests.ts
+++ b/knex/knex-tests.ts
@@ -162,6 +162,8 @@ knex.select('*').from('users').join('accounts', function() {
 
 knex.select('*').from('users').join('accounts', 'accounts.type', knex.raw('?', ['admin']));
 
+knex.raw('select * from users where id = :user_id', { user_id: 1 });
+
 knex.from('users').innerJoin('accounts', 'users.id', 'accounts.user_id');
 
 knex.table('users').innerJoin('accounts', 'users.id', '=', 'accounts.user_id');
diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index c3ede588e8..d59b749e95 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -249,6 +249,7 @@ declare module "knex" {
       (value: Value): Raw;
       (sql: string, ...bindings: Value[]): Raw;
       (sql: string, bindings: Value[]): Raw;
+      (sql: string, bindings: Object): Raw;
     }
 
     //

From 1d03fe40909a143078cdd13e5b9583f1dc5f9dba Mon Sep 17 00:00:00 2001
From: Fahad Hossain <fa7ad@users.noreply.github.com>
Date: Sun, 19 Jun 2016 08:44:49 +0600
Subject: [PATCH 148/278] add title v1.0.0 by tj (#9675)

* add title v1.0.0 by tj

* i made a mistake naming the file
---
 title/title-tests.ts | 10 ++++++++++
 title/title.d.ts     | 14 ++++++++++++++
 2 files changed, 24 insertions(+)
 create mode 100644 title/title-tests.ts
 create mode 100644 title/title.d.ts

diff --git a/title/title-tests.ts b/title/title-tests.ts
new file mode 100644
index 0000000000..7a96ceed02
--- /dev/null
+++ b/title/title-tests.ts
@@ -0,0 +1,10 @@
+/// <reference path="./title.d.ts"/>
+import title = require("title");
+
+var document = {title: "original"};
+
+title("newtitle"); // document.title === 'newtitle'
+
+title("%s - %o", "new"); // document.title === 'new - original'
+
+title.reset(); // document.title === 'original'
diff --git a/title/title.d.ts b/title/title.d.ts
new file mode 100644
index 0000000000..19982aa3fb
--- /dev/null
+++ b/title/title.d.ts
@@ -0,0 +1,14 @@
+// Type definitions for title v1.0.0
+// Project: https://www.npmjs.com/package/title
+// Definitions by: Fahad <https://github.com/fa7ad>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module "title"{
+    function Title(newtitle: string): void;
+    function Title(pattern: string, newtitle?: string): void;
+    namespace Title {
+        function reset(): void;
+    }
+
+    export = Title;
+}

From 1bb5729fd4d63f0eebc750dcef4d9ab5de976f40 Mon Sep 17 00:00:00 2001
From: Ryan Gomoto <gomoto27@gmail.com>
Date: Sat, 18 Jun 2016 19:58:52 -0700
Subject: [PATCH 149/278] Update angular.d.ts (#9678)

---
 angularjs/angular.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/angularjs/angular.d.ts b/angularjs/angular.d.ts
index 4c99e6661b..1ae64c8e45 100644
--- a/angularjs/angular.d.ts
+++ b/angularjs/angular.d.ts
@@ -156,7 +156,7 @@ declare namespace angular {
 
         noop(...args: any[]): void;
         reloadWithDebugInfo(): void;
-        toJson(obj: any, pretty?: boolean): string;
+        toJson(obj: any, pretty?: boolean | number): string;
         uppercase(str: string): string;
         version: {
             full: string;

From 9646a7deb2240d9fca2f940c6ce6986f34e11147 Mon Sep 17 00:00:00 2001
From: Morgan Benton <registered@morphatic.com>
Date: Sat, 18 Jun 2016 22:59:36 -0400
Subject: [PATCH 150/278] added all tests (#9680)

---
 d3kit/d3kit-tests.ts | 1112 ++++++++++++++++++++++++++++++++++++++++++
 d3kit/d3kit.d.ts     |  155 ++++++
 2 files changed, 1267 insertions(+)
 create mode 100644 d3kit/d3kit-tests.ts
 create mode 100644 d3kit/d3kit.d.ts

diff --git a/d3kit/d3kit-tests.ts b/d3kit/d3kit-tests.ts
new file mode 100644
index 0000000000..1b8d2a24f9
--- /dev/null
+++ b/d3kit/d3kit-tests.ts
@@ -0,0 +1,1112 @@
+/// <reference path="d3kit.d.ts" />
+/// <reference path="../d3/d3.d.ts" />
+/// <reference path="../mocha/mocha.d.ts" />
+/// <reference path="../chai/chai.d.ts" />
+
+/* jshint expr: true */
+
+var expect = chai.expect;
+describe('Skeleton', function(){
+    var element: Element, $element: d3.Selection<any>, $svg: d3.Selection<any>, skeleton: d3kit.Skeleton;
+
+    beforeEach(function(done){
+      element = document.body.appendChild(document.createElement('div')) as Element;
+      skeleton = new d3kit.Skeleton(element, null, ['custom1', 'custom2']);
+      $element = d3.select(element);
+      $svg = $element.select('svg');
+      done();
+    });
+
+    describe('new Skeleton()', function(){
+      it('should create <svg> inside the element', function(){
+        expect($element.select('svg').size()).to.be.equal(1);
+      });
+      it('should create <g> inside <svg> inside the element', function(){
+        expect($element.select('svg').select('g').size()).to.be.equal(1);
+      });
+    });
+
+    describe('#getCustomEventNames()', function(){
+      it('should return custom event names', function(){
+        expect(skeleton.getCustomEventNames()).to.deep.equal(['custom1', 'custom2']);
+      });
+    });
+
+    describe('#getDispatcher()', function(){
+      it('should return event dispatcher', function(){
+        expect(skeleton.getDispatcher()).to.be.an('Object');
+        expect(skeleton.getDispatcher().data).to.be.a('Function');
+      });
+    });
+
+    describe('#getInnerWidth()', function(){
+      it('should return width of the skeleton excluding margin', function(){
+        skeleton.options({
+          margin: {left: 10, right: 10}
+        });
+        skeleton.width(100);
+        expect(skeleton.getInnerWidth()).to.equal(80);
+      });
+    });
+
+    describe('#getInnerHeight()', function(){
+      it('should return height of the skeleton excluding margin', function(){
+        skeleton.options({
+          margin: {top: 10, bottom: 20}
+        });
+        skeleton.height(100);
+        expect(skeleton.getInnerHeight()).to.equal(70);
+      });
+    });
+
+    describe('#getLayerOrganizer()', function(){
+      it('should return the LayerOrganizer', function(){
+        expect(skeleton.getLayerOrganizer()).to.be.an('Object');
+      });
+    });
+
+    describe('#getRootG()', function(){
+      it('should return d3 selection of the root <g>', function(){
+        var g = skeleton.getRootG();
+        expect(g.size()).to.equal(1);
+        expect((g[0][0] as Element).tagName).to.equal('g');
+      });
+    });
+
+    describe('#getSvg()', function(){
+      it('should return d3 selection of the <svg>', function(){
+        var svg = skeleton.getSvg();
+        expect(svg.size()).to.equal(1);
+        expect((svg[0][0] as Element).tagName).to.equal('svg');
+      });
+    });
+
+    describe('#data(data, doNotDispatch)', function(){
+      it('should return data when called without argument', function(){
+        skeleton.data({a: 1});
+        expect(skeleton.data()).to.deep.equal({a: 1});
+      });
+      it('should set data when called with at least one argument', function(){
+        skeleton.data('test');
+        expect(skeleton.data()).to.equal('test');
+      });
+      it('after setting, should dispatch "data" event', function(done){
+        skeleton.on('data.test', function(){
+          // This block should be reached to pass the test.
+          expect(true).to.be.true;
+          done();
+        });
+        skeleton.data({a: 1});
+      });
+      it('after setting, should not dispatch "data" event if doNotDispatch is true', function(done){
+        skeleton.on('data.test', function(){
+          // This block should not be reached.
+          expect(true).to.be.false;
+          done();
+        });
+        skeleton.data({a: 1}, true);
+        setTimeout(done, 100);
+      });
+    });
+
+    describe('#options(options, doNotDispatch)', function(){
+      it('should return options when called without argument', function(){
+        skeleton.options({a: 2});
+        expect(skeleton.options()).to.include.keys(['a']);
+        expect(skeleton.options().a).to.equal(2);
+      });
+      it('should set options when called with at least one argument', function(){
+        skeleton.options({a: 1});
+        expect(skeleton.options()).to.include.keys(['a']);
+        expect(skeleton.options().a).to.equal(1);
+      });
+      it('should not overwrite but extend existing options when setting', function(){
+        skeleton.options({a: 1});
+        skeleton.options({b: 2});
+        expect(skeleton.options()).to.include.keys(['a', 'b']);
+        expect(skeleton.options().a).to.equal(1);
+        expect(skeleton.options().b).to.equal(2);
+      });
+      it('after setting, should dispatch "options" event', function(done){
+        skeleton.on('options.test', function(){
+          // This block should be reached to pass the test.
+          expect(true).to.be.true;
+          done();
+        });
+        skeleton.options({a: 1});
+      });
+      it('after setting, should not dispatch "options" event if doNotDispatch is true', function(done){
+        skeleton.on('options.test', function(){
+          // This block should not be reached.
+          expect(true).to.be.false;
+          done();
+        });
+        skeleton.options({a: 1}, true);
+        setTimeout(done, 100);
+      });
+    });
+
+    describe('#margin(margin, doNotDispatch)', function(){
+      it('should return margin when called without argument', function(){
+        var margin = {left: 10, right: 10, top: 10, bottom: 10};
+        skeleton.margin(margin);
+        expect(skeleton.margin()).to.deep.equal(margin);
+      });
+      it('should set margin when called with at least one argument', function(){
+        var margin = {left: 10, right: 10, top: 10, bottom: 10};
+        skeleton.margin(margin);
+
+        skeleton.margin({left: 20});
+        expect(skeleton.margin().left).to.equal(20);
+        expect(skeleton.margin().right).to.equal(10);
+        skeleton.margin({right: 20});
+        expect(skeleton.margin().right).to.equal(20);
+        skeleton.margin({top: 20});
+        expect(skeleton.margin().top).to.equal(20);
+        skeleton.margin({bottom: 20});
+        expect(skeleton.margin().bottom).to.equal(20);
+      });
+      it('should update innerWidth after setting margin', function(){
+        skeleton.width(100);
+        skeleton.margin({left: 10, right:10});
+        expect(skeleton.getInnerWidth()).to.equal(80);
+        skeleton.margin({left: 15, right:15});
+        expect(skeleton.getInnerWidth()).to.equal(70);
+      });
+      it('should update innerHeight after setting margin', function(){
+        skeleton.height(100);
+        skeleton.margin({top: 10, bottom:10});
+        expect(skeleton.getInnerHeight()).to.equal(80);
+        skeleton.margin({top: 15, bottom:15});
+        expect(skeleton.getInnerHeight()).to.equal(70);
+      });
+      it('should update the root <g> transform/translate', function(){
+        skeleton.margin({left: 30, top: 30});
+        skeleton.offset([0.5, 0.5]);
+        skeleton.margin({left: 10, top: 10});
+        var translate = skeleton.getRootG().attr('transform');
+        expect(translate).to.equal('translate(10.5,10.5)');
+      });
+      it('after setting, should dispatch "resize" event', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should be reached to pass the test.
+          expect(true).to.be.true;
+          done();
+        });
+        skeleton.margin({left: 33});
+      });
+      it('after setting, should not dispatch "resize" event if doNotDispatch is true', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should not be reached.
+          expect(true).to.be.false;
+          done();
+        });
+        skeleton.margin({left: 33}, true);
+        setTimeout(done, 100);
+      });
+    });
+
+    describe('#offset(offset)', function(){
+      it('should return offset when called without argument', function(){
+        var offset = [1,1];
+        skeleton.offset(offset);
+        expect(skeleton.offset()).to.deep.equal(offset);
+      });
+      it('should set offset when called with at least one argument', function(){
+        var offset = [1,1];
+        skeleton.offset(offset);
+        skeleton.offset([2,3]);
+        expect(skeleton.offset()).to.deep.equal([2,3]);
+      });
+      it('should update the root <g> transform/translate', function(){
+        skeleton.offset([0.5, 0.5]);
+        skeleton.margin({left: 10, top: 10});
+        skeleton.offset([2,3]);
+        var translate = skeleton.getRootG().attr('transform');
+        expect(translate).to.equal('translate(12,13)');
+      });
+    });
+
+    describe('#width(width, doNotDispatch)', function(){
+      it('should return <svg> width when called without argument', function(){
+        var w = $svg.attr('width');
+        expect(skeleton.width()).to.equal(+w);
+      });
+      it('should set <svg> width when called with Number as the first argument', function(){
+        skeleton.width(300);
+        expect(+$svg.attr('width')).to.equal(300);
+      });
+      it('should set <svg> width when called with a Number and "px" such as "100px" as the first argument', function(){
+        skeleton.width('299px');
+        expect(+$svg.attr('width')).to.equal(299);
+      });
+      it('should set <svg> width to container\'s width when called with "auto" as the first argument', function(){
+        var w = element.clientWidth;
+        skeleton.width('auto');
+        expect(+$svg.attr('width')).to.equal(w);
+      });
+      it('after setting, should dispatch "resize" event', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should be reached to pass the test.
+          expect(true).to.be.true;
+          done();
+        });
+        skeleton.width(200);
+      });
+      it('after setting, should not dispatch "resize" event if doNotDispatch is true', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should not be reached.
+          expect(true).to.be.false;
+          done();
+        });
+        skeleton.width(200, true);
+        setTimeout(done, 100);
+      });
+    });
+
+    describe('#height(height, doNotDispatch)', function(){
+      it('should return <svg> height when called without argument', function(){
+        var w = $svg.attr('height');
+        expect(skeleton.height()).to.equal(+w);
+      });
+      it('should set <svg> height when called with Number as the first argument', function(){
+        skeleton.height(300);
+        expect(+$svg.attr('height')).to.equal(300);
+      });
+      it('should set <svg> height when called with a Number and "px" such as "100px" as the first argument', function(){
+        skeleton.height('299px');
+        expect(+$svg.attr('height')).to.equal(299);
+      });
+      it('should set <svg> height to container\'s height when called with "auto" as the first argument', function(){
+        var w = element.clientHeight;
+        skeleton.height('auto');
+        expect(+$svg.attr('height')).to.equal(w);
+      });
+      it('after setting, should dispatch "resize" event', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should be reached to pass the test.
+          expect(true).to.be.true;
+          done();
+        });
+        skeleton.height(200);
+      });
+      it('after setting, should not dispatch "resize" event if doNotDispatch is true', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should not be reached.
+          expect(true).to.be.false;
+          done();
+        });
+        skeleton.height(200, true);
+        setTimeout(done, 100);
+      });
+    });
+
+    describe('#dimension(dimension, doNotDispatch)', function(){
+      it('should return an array [width, height] when called without argument', function(){
+        var dim = [+$svg.attr('width'), +$svg.attr('height')];
+        expect(skeleton.dimension()).to.deep.equal(dim);
+      });
+      it('should set width and height of the <svg> when called with an array [width, height] as the first argument', function(){
+        skeleton.dimension([118, 118]);
+        expect([+$svg.attr('width'), +$svg.attr('height')]).to.deep.equal([118, 118]);
+      });
+      it('after setting, should dispatch "resize" event', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should be reached to pass the test.
+          expect(true).to.be.true;
+          done();
+        });
+        skeleton.dimension([150, 150]);
+      });
+      it('after setting, should not dispatch "resize" event if doNotDispatch is true', function(done){
+        skeleton.on('resize.test', function(){
+          // This block should not be reached.
+          expect(true).to.be.false;
+          done();
+        });
+        skeleton.dimension([150, 150], true);
+        setTimeout(done, 100);
+      });
+    });
+
+    describe('#hasData()', function(){
+      it('should return true when data are not null nor undefined', function(){
+        skeleton.data({});
+        expect(skeleton.hasData()).to.be.true;
+        skeleton.data({test: 1});
+        expect(skeleton.hasData()).to.be.true;
+        skeleton.data([]);
+        expect(skeleton.hasData()).to.be.true;
+        skeleton.data(['test']);
+        expect(skeleton.hasData()).to.be.true;
+      });
+      it('should return false when data are null or undefined', function(){
+        skeleton.data(null);
+        expect(skeleton.hasData()).to.be.false;
+        skeleton.data(undefined);
+        expect(skeleton.hasData()).to.be.false;
+      });
+    });
+
+    describe('#hasNonZeroArea()', function(){
+      it('should return true if <svg>\'s width & height excluding margin is more than zero', function(){
+        skeleton.options({
+          margin: {left: 10, right: 10}
+        });
+        skeleton.width(80);
+        skeleton.options({
+          margin: {top: 10, bottom: 20}
+        });
+        skeleton.height(50);
+        expect(skeleton.hasNonZeroArea()).to.be.true;
+      });
+      it('should return false otherwise', function(){
+        skeleton.options({
+          margin: {left: 10, right: 10}
+        });
+        skeleton.width(20);
+        skeleton.options({
+          margin: {top: 10, bottom: 20}
+        });
+        skeleton.height(30);
+        expect(skeleton.hasNonZeroArea()).to.be.false;
+      });
+    });
+
+    describe('#mixin({})', function(){
+      it('should extend this skeleton with new fields/functions', function(){
+        skeleton.mixin({
+          a: 1,
+          b: 2
+        });
+        expect(skeleton).to.include.keys(['a', 'b']);
+        expect((<any>skeleton).a).to.equal(1);
+        expect((<any>skeleton).b).to.equal(2);
+      });
+      it('should overwrite existing fields', function(){
+        skeleton.mixin({
+          b: 2
+        });
+        skeleton.mixin({
+          b: 3
+        });
+        expect(skeleton).to.include.keys(['b']);
+        expect((<any>skeleton).b).to.equal(3);
+      });
+      it('should keep original fields if not overwritten', function(){
+        skeleton.mixin({
+          a: 1,
+          b: 2
+        });
+        skeleton.mixin({
+          c: 20,
+          b: 3
+        });
+        expect(skeleton).to.include.keys(['a', 'b', 'c']);
+        expect((<any>skeleton).a).to.equal(1);
+        expect((<any>skeleton).b).to.equal(3);
+        expect((<any>skeleton).c).to.equal(20);
+      });
+    });
+
+    describe('#resizeToFitContainer(mode)', function(){
+      it('when mode is "all" should resize to fit both width and height', function(){
+        skeleton.dimension([element.clientWidth/2, element.clientHeight/2]);
+        var w = element.clientWidth;
+        var h = element.clientHeight;
+        skeleton.resizeToFitContainer('all');
+        expect(skeleton.dimension()).to.deep.equal([w, h]);
+      });
+      it('when mode is "both" should resize to fit both width and height', function(){
+        skeleton.dimension([element.clientWidth/2, element.clientHeight/2]);
+        var w = element.clientWidth;
+        var h = element.clientHeight;
+        skeleton.resizeToFitContainer('both');
+        expect(skeleton.dimension()).to.deep.equal([w, h]);
+      });
+      it('when mode is "full" should resize to fit both width and height', function(){
+        skeleton.dimension([element.clientWidth/2, element.clientHeight/2]);
+        var w = element.clientWidth;
+        var h = element.clientHeight;
+        skeleton.resizeToFitContainer('full');
+        expect(skeleton.dimension()).to.deep.equal([w, h]);
+      });
+      it('when mode is "width" should resize width to fit container but keep original height', function(){
+        var w1 = element.clientWidth/2;
+        var h1 = element.clientHeight/2;
+
+        skeleton.dimension([w1, h1]);
+
+        var w2 = element.clientWidth;
+        var h2 = element.clientHeight;
+
+        skeleton.resizeToFitContainer('width');
+
+        expect(skeleton.width()).to.equal(Math.floor(w2));
+        expect(skeleton.height()).to.equal(Math.floor(h1));
+        expect(skeleton.width()).to.not.equal(w1);
+        expect(skeleton.height()).to.not.equal(h2);
+      });
+      it('when mode is "height" should resize height to fit container but keep original width', function(){
+        var w1 = element.clientWidth/2;
+        var h1 = element.clientHeight*2;
+
+        skeleton.dimension([w1, h1]);
+
+        var w2 = element.clientWidth;
+        var h2 = element.clientHeight;
+
+        skeleton.resizeToFitContainer('height');
+
+        expect(skeleton.width()).to.equal(Math.floor(w1));
+        expect(skeleton.height()).to.equal(Math.floor(h2));
+        expect(skeleton.width()).to.not.equal(w2);
+        expect(skeleton.height()).to.not.equal(h1);
+      });
+    });
+
+    describe('#resizeToAspectRatio(ratio)', function(){
+      // todo
+    });
+
+    describe('#autoResize(mode)', function(){
+      it('should return current mode when called without argument', function(){
+        skeleton.autoResize(false);
+        expect(skeleton.autoResize()).to.be.false;
+        skeleton.autoResize('width');
+        expect(skeleton.autoResize()).to.equal('width');
+      });
+      it('should enable auto resize when set mode to "width/height/both/etc.", similar to parameters of resizeToFitContainer()', function(done){
+        // set initial size
+        skeleton.width(50);
+        skeleton.autoResize('width');
+        setTimeout(function(){
+          expect(skeleton.width()).to.equal(element.clientWidth);
+          done();
+        }, 500);
+      });
+      it('should disable auto resize when set mode to false', function(done){
+        // set initial size
+        skeleton.width(50);
+        skeleton.autoResize('width');
+        setTimeout(function(){
+          expect(skeleton.width()).to.equal(element.clientWidth);
+          // disable resize and
+          skeleton.autoResize(false);
+          skeleton.width(50);
+          setTimeout(function(){
+            expect(skeleton.width()).to.not.equal(element.clientWidth);
+            done();
+          }, 500);
+        }, 500);
+      });
+    });
+
+    describe('#autoResizeDetection(detection)', function(){
+      // todo
+    });
+
+    describe('#autoResizeToAspectRatio(ratio)', function(){
+      // todo
+    });
+
+
+});
+
+describe.only('LayerOrganizer', function(){
+
+  describe('new LayerOrganizer(container) will create layers as <g> by default', function(){
+    var container: d3.Selection<any>, layers: d3kit.LayerOrganizer;
+    before(function(done){
+      container = d3.select('body').append('svg').append('g');
+      layers = new d3kit.LayerOrganizer(container);
+      done();
+    });
+
+    describe('#create(names)', function(){
+      it('should create single layer given a String', function(){
+        layers.create('single');
+        expect(container.select('g.single-layer').size()).to.be.equal(1);
+      });
+
+      it('should create multiple layers given an array', function(){
+        layers.create(['a', 'b', 'c']);
+        expect(container.select('g.a-layer').size()).to.be.equal(1);
+        expect(container.select('g.b-layer').size()).to.be.equal(1);
+        expect(container.select('g.c-layer').size()).to.be.equal(1);
+      });
+
+      it('should create nested layers given a plain Object with a String inside', function(){
+        layers.create({d: 'e'});
+        expect(container.select('g.d-layer').size()).to.be.equal(1);
+        expect(container.select('g.d-layer g.e-layer').size()).to.be.equal(1);
+      });
+
+      it('should create nested layers given a plain Object with an Array inside', function(){
+        layers.create({f: ['g', 'h']});
+        expect(container.select('g.f-layer').size()).to.be.equal(1);
+        expect(container.select('g.f-layer g.g-layer').size()).to.be.equal(1);
+        expect(container.select('g.f-layer g.h-layer').size()).to.be.equal(1);
+      });
+
+      it('should create multiple nested layers given an array of objects', function(){
+        layers.create([{'i': ['x']}, {'j': 'x'}, {'k': ['x','y']}]);
+        expect(container.select('g.i-layer').size()).to.be.equal(1);
+        expect(container.select('g.j-layer').size()).to.be.equal(1);
+        expect(container.select('g.k-layer').size()).to.be.equal(1);
+        expect(container.select('g.i-layer g.x-layer').size()).to.be.equal(1);
+        expect(container.select('g.i-layer g.x-layer').size()).to.be.equal(1);
+        expect(container.select('g.k-layer g.x-layer').size()).to.be.equal(1);
+        expect(container.select('g.k-layer g.y-layer').size()).to.be.equal(1);
+      });
+
+      it('should create multi-level nested layers given a nested plain Object', function(){
+        layers.create({
+          l: [
+            'm',
+            {'n': [
+              {'o': ['p']}, 'q'
+            ]}
+          ]
+        });
+        expect(container.select('g.l-layer').size()).to.be.equal(1);
+        expect(container.select('g.l-layer g.m-layer').size()).to.be.equal(1);
+        expect(container.select('g.l-layer g.n-layer').size()).to.be.equal(1);
+        expect(container.select('g.l-layer g.n-layer g.o-layer').size()).to.be.equal(1);
+        expect(container.select('g.l-layer g.n-layer g.o-layer g.p-layer').size()).to.be.equal(1);
+        expect(container.select('g.l-layer g.n-layer g.q-layer').size()).to.be.equal(1);
+      });
+
+    });
+
+    describe('#has(name)', function(){
+      it('should be able to check first-level layer', function(){
+        expect(layers.has('single')).to.be.true;
+        expect(layers.has('test')).to.be.false;
+      });
+      it('should be able to check second-level layer', function(){
+        expect(layers.has('l.m')).to.be.true;
+        expect(layers.has('l.x')).to.be.false;
+      });
+      it('should be able to check third-level layer', function(){
+        expect(layers.has('l.n.q')).to.be.true;
+        expect(layers.has('l.n.x')).to.be.false;
+      });
+    });
+
+    describe('#get(name)', function(){
+      it('should be able to get first-level layer', function(){
+        expect(layers.get('single')).to.exist;
+        expect(layers.get('test')).to.be.not.exist;
+      });
+      it('should be able to get second-level layer', function(){
+        expect(layers.get('l.m')).to.exist;
+        expect(layers.get('l.x')).to.not.exist;
+      });
+      it('should be able to get third-level layer', function(){
+        expect(layers.get('l.n.o')).to.exist;
+        expect(layers.get('l.n.x')).to.not.exist;
+      });
+    });
+  });
+
+  describe('new LayerOrganizer(container, tag) will create layers with the given tag instead of <g>', function(){
+    var container: d3.Selection<any>, layers: d3kit.LayerOrganizer;
+    before(function(done){
+      container = d3.select('body').append('div');
+      layers = new d3kit.LayerOrganizer(container, 'div');
+      done();
+    });
+
+    describe('#create(names)', function(){
+      it('should create single layer given a String', function(){
+        layers.create('single');
+        expect(container.select('div.single-layer').size()).to.be.equal(1);
+      });
+
+      it('should create multiple layers given an array', function(){
+        layers.create(['a', 'b', 'c']);
+        expect(container.select('div.a-layer').size()).to.be.equal(1);
+        expect(container.select('div.b-layer').size()).to.be.equal(1);
+        expect(container.select('div.c-layer').size()).to.be.equal(1);
+      });
+
+      it('should create nested layers given a plain Object with a String inside', function(){
+        layers.create({d: 'e'});
+        expect(container.select('div.d-layer').size()).to.be.equal(1);
+        expect(container.select('div.d-layer div.e-layer').size()).to.be.equal(1);
+      });
+
+      it('should create nested layers given a plain Object with an Array inside', function(){
+        layers.create({f: ['g', 'h']});
+        expect(container.select('div.f-layer').size()).to.be.equal(1);
+        expect(container.select('div.f-layer div.g-layer').size()).to.be.equal(1);
+        expect(container.select('div.f-layer div.h-layer').size()).to.be.equal(1);
+      });
+
+      it('should create multiple nested layers given an array of objects', function(){
+        layers.create([{'i': ['x']}, {'j': 'x'}, {'k': ['x','y']}]);
+        expect(container.select('div.i-layer').size()).to.be.equal(1);
+        expect(container.select('div.j-layer').size()).to.be.equal(1);
+        expect(container.select('div.k-layer').size()).to.be.equal(1);
+        expect(container.select('div.i-layer div.x-layer').size()).to.be.equal(1);
+        expect(container.select('div.i-layer div.x-layer').size()).to.be.equal(1);
+        expect(container.select('div.k-layer div.x-layer').size()).to.be.equal(1);
+        expect(container.select('div.k-layer div.y-layer').size()).to.be.equal(1);
+      });
+
+      it('should create multi-level nested layers given a nested plain Object', function(){
+        layers.create({
+          l: [
+            'm',
+            {'n': [
+              {'o': ['p']}, 'q'
+            ]}
+          ]
+        });
+        expect(container.select('div.l-layer').size()).to.be.equal(1);
+        expect(container.select('div.l-layer div.m-layer').size()).to.be.equal(1);
+        expect(container.select('div.l-layer div.n-layer').size()).to.be.equal(1);
+        expect(container.select('div.l-layer div.n-layer div.o-layer').size()).to.be.equal(1);
+        expect(container.select('div.l-layer div.n-layer div.o-layer div.p-layer').size()).to.be.equal(1);
+        expect(container.select('div.l-layer div.n-layer div.q-layer').size()).to.be.equal(1);
+      });
+
+    });
+
+    describe('#has(name)', function(){
+      it('should be able to check first-level layer', function(){
+        expect(layers.has('single')).to.be.true;
+        expect(layers.has('test')).to.be.false;
+      });
+      it('should be able to check second-level layer', function(){
+        expect(layers.has('l.m')).to.be.true;
+        expect(layers.has('l.x')).to.be.false;
+      });
+      it('should be able to check third-level layer', function(){
+        expect(layers.has('l.n.q')).to.be.true;
+        expect(layers.has('l.n.x')).to.be.false;
+      });
+    });
+
+    describe('#get(name)', function(){
+      it('should be able to get first-level layer', function(){
+        expect(layers.get('single')).to.exist;
+        expect(layers.get('test')).to.be.not.exist;
+      });
+      it('should be able to get second-level layer', function(){
+        expect(layers.get('l.m')).to.exist;
+        expect(layers.get('l.x')).to.not.exist;
+      });
+      it('should be able to get third-level layer', function(){
+        expect(layers.get('l.n.o')).to.exist;
+        expect(layers.get('l.n.x')).to.not.exist;
+      });
+    });
+  });
+
+});
+
+describe('Chartlet', function(){
+  interface ConfigureFunction {
+      (parent: d3kit.Chartlet, child: d3kit.Chartlet): void;
+  }
+  var enter: d3kit.ChartletEventFunction, update: d3kit.ChartletEventFunction, exit: d3kit.ChartletEventFunction, chartlet: d3kit.Chartlet;
+  var customEvents: Array<string> = ['fooEvent'];
+  var ChildChartlet: () => d3kit.Chartlet;
+  var ParentChartlet: (configureFunction: ConfigureFunction) => d3kit.Chartlet;
+
+  var callback = function(selection?: d3.Selection<any>, done?: any) { return (sel: d3.Selection<any>) => {done();};};
+  beforeEach(function(done){
+    ChildChartlet = function() {
+      var chartlet = new d3kit.Chartlet(callback, callback, callback);
+      (<any>chartlet).runTest = function (testFunction: any) {
+        testFunction(chartlet);
+      };
+      return chartlet;
+    };
+
+    ParentChartlet = function(configureFunction: ConfigureFunction) {
+      var chartlet = new d3kit.Chartlet(callback, callback, callback);
+      var child = ChildChartlet();
+      configureFunction(chartlet, child);
+      (<any>chartlet).runTest = (<any>child).runTest;
+      return chartlet;
+    };
+
+    enter  = callback;
+    update = callback;
+    exit   = callback;
+    chartlet = new d3kit.Chartlet(enter, update, exit, customEvents);
+    done();
+  });
+
+  describe('new Chartlet(enter, update, exit, customEvents)', function(){
+    it('should create a chartlet', function(){
+      expect(chartlet).to.be.an('Object');
+      expect(chartlet).to.include.keys(['property', 'on']);
+      expect(chartlet.enter).to.be.a('Function');
+      expect(chartlet.update).to.be.a('Function');
+      expect(chartlet.exit).to.be.a('Function');
+      expect(function(){ chartlet.enter(); }).to.not.throw(Error);
+      expect(function(){ chartlet.update(); }).to.not.throw(Error);
+      expect(function(){ chartlet.exit(); }).to.not.throw(Error);
+      expect(chartlet.getCustomEventNames()).to.deep.equal(customEvents);
+    });
+    it('arguments "update", "exit" and "customEvents" are optional', function(){
+      var comp = new d3kit.Chartlet(enter);
+      expect(comp).to.be.an('Object');
+      expect(comp).to.include.keys(['property', 'on']);
+      expect(comp.enter).to.be.a('Function');
+      expect(comp.update).to.be.a('Function');
+      expect(comp.exit).to.be.a('Function');
+      expect(function(){ comp.enter(); }).to.not.throw(Error);
+      expect(function(){ comp.update(); }).to.not.throw(Error);
+      expect(function(){ comp.exit(); }).to.not.throw(Error);
+    });
+  });
+
+  describe('#getDispatcher()', function(){
+    it('should return a dispatcher', function(){
+      var dispatcher = chartlet.getDispatcher();
+      expect(dispatcher).to.exist;
+    });
+    it('returned dispatcher should handle enter/update/exit events', function(){
+      var dispatcher = chartlet.getDispatcher();
+      expect(dispatcher).to.include.keys(['enterDone', 'updateDone', 'exitDone'].concat(customEvents));
+    });
+  });
+
+  describe('#getPropertyValue(name, d, i)', function(){
+    it('should return computed value for specified property name, d and i', function(){
+      var d = {a: 99};
+      var i = 2;
+
+      chartlet.property('foo', 1);
+      chartlet.property('bar', 'two');
+      chartlet.property('baz', function(d:{a:number}, i: number) {return 3;});
+      chartlet.property('qux', function(d:{a:number}, i: number) {return 'four';});
+      chartlet.property('nux', function(d:{a:number}, i: number) {return d.a * i;});
+
+      expect(chartlet.getPropertyValue('foo', d, i)).to.equal(1);
+      expect(chartlet.getPropertyValue('bar', d, i)).to.equal('two');
+      expect(chartlet.getPropertyValue('baz', d, i)).to.equal(3);
+      expect(chartlet.getPropertyValue('qux', d, i)).to.equal('four');
+      expect(chartlet.getPropertyValue('nux', d, i)).to.equal(198);
+    });
+  });
+
+  describe('#property(name, valueOrFn)', function(){
+    describe('should act as a getter when called with one argument', function(){
+      it('should always return a function', function(){
+        chartlet.property('foo', 1);
+        expect(chartlet.property('foo')).to.be.a('Function');
+        chartlet.property('bar', function(){ return 100; });
+        expect(chartlet.property('bar')).to.be.a('Function');
+      });
+      it('should return a function that return undefined for unknown property name', function(){
+        expect(chartlet.property('unknown name')).to.be.a('Function');
+        expect(chartlet.property('unknown name')()).to.equal(undefined);
+      });
+    });
+
+    describe('should act as a setter when called with two arguments', function(){
+      it('should set specified property to a functor of given value', function(){
+        chartlet.property('foo', 1);
+        expect(chartlet.property('foo')).to.be.a('Function');
+        expect(chartlet.property('foo')()).to.equal(1);
+        chartlet.property('bar', function(){ return 100; });
+        expect(chartlet.property('bar')).to.be.a('Function');
+        expect(chartlet.property('bar')()).to.equal(100);
+      });
+      it('should overwrite previous value when set property with the same name', function(){
+        chartlet.property('foo', 1);
+        expect(chartlet.property('foo')()).to.equal(1);
+        chartlet.property('foo', 100);
+        expect(chartlet.property('foo')()).to.equal(100);
+      });
+    });
+  });
+
+  describe('#on(eventName, listener)', function(){
+    it('event "enterDone" should be triggered after chartlet.enter() is completed.', function(done){
+      chartlet.on('enterDone', function(){ return (sel: d3.Selection<any>) => {done();} });
+      chartlet.enter();
+    });
+    it('event "updateDone" should be triggered after chartlet.update() is completed.', function(done){
+      chartlet.on('updateDone', function(){ return (sel: d3.Selection<any>) => {done();} });
+      chartlet.update();
+    });
+    it('event "exitDone" should be triggered after chartlet.exit() is completed.', function(done){
+      chartlet.on('exitDone', function(){ return (sel: d3.Selection<any>) => {done();} });
+      chartlet.exit();
+    });
+  });
+
+  describe('#inheritPropertyFrom(parentChartlet, parentPropertyName, childPropertyName)', function(){
+    it('it should cause a child to inherit a parent property', function() {
+      var parent = ParentChartlet(function(parent: d3kit.Chartlet, child: d3kit.Chartlet) {
+          child.inheritPropertyFrom(parent, 'foo', 'bar');
+        })
+        .property('foo', function(d:number) {return 2 * d;});
+
+      (<any>parent).runTest(function(child: d3kit.Chartlet) {
+        expect(child.getPropertyValue('bar', 4, 0)).to.be.equal(8);
+      });
+    });
+
+    it('it should default to the parent property name', function() {
+      var parent = ParentChartlet(
+        function(parent: d3kit.Chartlet, child: d3kit.Chartlet) {
+          child.inheritPropertyFrom(parent, 'foo');
+        })
+        .property('foo', function(d:number) {return 2 * d;});
+
+      (<any>parent).runTest(function(child: d3kit.Chartlet) {
+        expect(child.getPropertyValue('foo', 4, 0)).to.be.equal(8);
+      });
+    });
+  });
+
+  describe('#inheritProperties(parentChartlet, parentPropertyNames, childPropertyNames)', function(){
+    it('it should cause a child to inherit many parent properties', function() {
+      var parent = ParentChartlet(
+        function(parent: d3kit.Chartlet, child: d3kit.Chartlet) {
+          child.inheritPropertiesFrom(parent, ['foo', 'bar', 'baz'], ['foo-x', 'bar-x', 'baz-x']);
+        })
+        .property('foo', function(d:number) {return 2 * d;})
+        .property('bar', function(d:number) {return 3 * d;})
+        .property('baz', function(d:number) {return 4 * d;});
+
+      (<any>parent).runTest(function(child: d3kit.Chartlet) {
+        expect(child.getPropertyValue('foo-x', 1, 0)).to.be.equal(2);
+        expect(child.getPropertyValue('bar-x', 1, 0)).to.be.equal(3);
+        expect(child.getPropertyValue('baz-x', 1, 0)).to.be.equal(4);
+      });
+    });
+
+    it('it should default to the parent property names', function() {
+      var parent = ParentChartlet(
+        function(parent: d3kit.Chartlet, child: d3kit.Chartlet) {
+          child.inheritPropertiesFrom(parent, ['foo', 'bar', 'baz']);
+        })
+        .property('foo', function(d:number) {return 2 * d;})
+        .property('bar', function(d:number) {return 3 * d;})
+        .property('baz', function(d:number) {return 4 * d;});
+
+      (<any>parent).runTest(function(child: d3kit.Chartlet) {
+        expect(child.getPropertyValue('foo', 1, 0)).to.be.equal(2);
+        expect(child.getPropertyValue('bar', 1, 0)).to.be.equal(3);
+        expect(child.getPropertyValue('baz', 1, 0)).to.be.equal(4);
+      });
+    });
+  });
+
+  describe('#publishEventsTo(foreignDispatcher)', function(){
+    it('should map events to a foreignDispatcher', function(done) {
+
+      var parent = new d3kit.Chartlet(callback, callback, callback, ['foo']);
+      parent.getDispatcher().on('foo', function(value:number) {
+        expect(value).to.be.equal(99);
+        done();
+      });
+
+      var child = new d3kit.Chartlet(callback, callback, callback, ['foo'])
+        .publishEventsTo(parent.getDispatcher());
+
+      (<any>child.getDispatcher()).foo(99);
+    });
+  });
+});
+
+describe('#createChart', function(){
+  var Chart = d3kit.factory.createChart({}, ['test'], function(skeleton: d3kit.Skeleton){
+    return skeleton;
+  });
+
+  it('should return a function to create a chart', function(){
+    expect(Chart).to.be.a('Function');
+  });
+
+  // // Don't think it's possible to define these in a d.ts file; skipping
+  // it('results should have function getCustomEvents()', function(){
+  //   expect(Chart.getCustomEvents).to.exist;
+  //   expect(Chart.getCustomEvents()).to.deep.equal(['test']);
+  // });
+});
+
+describe('d3kit.helper', function(){
+
+  describe('#dasherize(str)', function(){
+    it('should convert input to dash-case', function(){
+      expect(d3kit.helper.dasherize('camelCase')).to.equal('camel-case');
+    });
+  });
+
+  describe('#deepExtend(target, src1, src2, ...)', function(){
+    it('should copy fields from sources into target', function(){
+      expect(d3kit.helper.deepExtend({}, {
+        a: 1,
+        b: 2
+      },{
+        b: 3,
+        c: 4
+      })).to.deep.equal({
+        a: 1,
+        b: 3,
+        c: 4
+      });
+
+      expect(d3kit.helper.deepExtend({}, {
+        a: 1,
+        b: 2
+      },{
+        b: 3,
+        c: 4
+      }, null)).to.deep.equal({
+        a: 1,
+        b: 3,
+        c: 4
+      });
+    });
+
+    it('should copy arrays and functions correctly from sources into target', function(){
+      var fn1 = function(d:number){return d + 1;};
+      var fn2 = function(d:number){return d + 2;};
+      expect(d3kit.helper.deepExtend({}, {
+        a: fn1,
+        b: [1,2]
+      },{
+        b: [3,4],
+        c: fn2
+      })).to.deep.equal({
+        a: fn1,
+        b: [3,4],
+        c: fn2
+      });
+    });
+
+    it('should perform "deep" copy', function(){
+      var fn1 = function(d:number){return d + 1;};
+      var fn2 = function(d:number){return d + 2;};
+      expect(d3kit.helper.deepExtend({}, {
+        a: { d: fn1 },
+        b: [1,2],
+        c: { f: 3 },
+        h: { i: [1,2,3], j: [3,4,5] }
+      },{
+        a: { e: 2 },
+        b: [3,4],
+        c: { f: 4, g: fn2 },
+        h: { i: [2,3,4], k: [3,4,5], l: {m: 2} }
+      })).to.deep.equal({
+        a: { d: fn1, e: 2 },
+        b: [3,4],
+        c: { f: 4, g: fn2 },
+        h: { i: [2,3,4], j: [3,4,5], k: [3,4,5], l: {m: 2} }
+      });
+    });
+  });
+
+  describe('#extend(target, src1, src2, ...)', function(){
+    it('should copy fields from sources into target', function(){
+      expect(d3kit.helper.extend({}, {
+        a: 1,
+        b: 2
+      },{
+        b: 3,
+        c: 4
+      })).to.deep.equal({
+        a: 1,
+        b: 3,
+        c: 4
+      });
+
+      expect(d3kit.helper.extend({}, {
+        a: 1,
+        b: 2
+      },{
+        b: 3,
+        c: 4
+      }, null)).to.deep.equal({
+        a: 1,
+        b: 3,
+        c: 4
+      });
+    });
+
+    it('should copy arrays and functions correctly from sources into target', function(){
+      var fn1 = function(d:number){return d + 1;};
+      var fn2 = function(d:number){return d + 2;};
+      expect(d3kit.helper.extend({}, {
+        a: fn1,
+        b: [1,2]
+      },{
+        b: [3,4],
+        c: fn2
+      })).to.deep.equal({
+        a: fn1,
+        b: [3,4],
+        c: fn2
+      });
+    });
+
+    it('should NOT perform "deep" copy', function(){
+      var fn1 = function(d:number){return d + 1;};
+      var fn2 = function(d:number){return d + 2;};
+      expect(d3kit.helper.extend({}, {
+        a: { d: fn1 },
+        b: [1,2],
+        c: { f: 3 },
+        h: { i: [1,2,3], j: [3,4,5] }
+      },{
+        a: { e: 2 },
+        b: [3,4],
+        c: { f: 4, g: fn2 },
+        h: { i: [2,3,4], k: [3,4,5], l: {m: 2} }
+      })).to.deep.equal({
+        a: { e: 2 },
+        b: [3,4],
+        c: { f: 4, g: fn2 },
+        h: { i: [2,3,4], k: [3,4,5], l: {m: 2} }
+      });
+    });
+  });
+
+  describe('#isFunction(function)', function(){
+    it('should return true if the value is a function', function(){
+      var fn1 = function(d:number){return d + 1;};
+      function fn2(d:number){return d + 2;}
+
+      expect(d3kit.helper.isFunction(fn1)).to.be.true;
+      expect(d3kit.helper.isFunction(fn2)).to.be.true;
+    });
+    it('should return false if the value is not a function', function(){
+      expect(d3kit.helper.isFunction(0)).to.be.false;
+      expect(d3kit.helper.isFunction(1)).to.be.false;
+      expect(d3kit.helper.isFunction(true)).to.be.false;
+      expect(d3kit.helper.isFunction('what')).to.be.false;
+      expect(d3kit.helper.isFunction(null)).to.be.false;
+      expect(d3kit.helper.isFunction(undefined)).to.be.false;
+    });
+  });
+
+  describe('#isNumber(value)', function(){
+    it('should return true for number', function(){
+      expect(d3kit.helper.isNumber(1)).to.be.true;
+      expect(d3kit.helper.isNumber(0)).to.be.true;
+      expect(d3kit.helper.isNumber(-1)).to.be.true;
+    });
+    it('should return false for string even if it is a number', function(){
+      expect(d3kit.helper.isNumber('')).to.be.false;
+      expect(d3kit.helper.isNumber('1')).to.be.false;
+      expect(d3kit.helper.isNumber('0')).to.be.false;
+      expect(d3kit.helper.isNumber('what')).to.be.false;
+    });
+    it('should return false for null and undefined', function(){
+      expect(d3kit.helper.isNumber(null)).to.be.false;
+      expect(d3kit.helper.isNumber(undefined)).to.be.false;
+    });
+  });
+});
+
diff --git a/d3kit/d3kit.d.ts b/d3kit/d3kit.d.ts
new file mode 100644
index 0000000000..4e53472b7b
--- /dev/null
+++ b/d3kit/d3kit.d.ts
@@ -0,0 +1,155 @@
+// Type definitions for d3Kit v1.1.0
+// Project: https://www.npmjs.com/package/d3kit
+// Definitions by: Morgan Benton <https://github.com/morphatic/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../d3/d3.d.ts" />
+
+declare namespace d3kit {
+
+    export interface ChartMargin {
+        top?: number;
+        right?: number;
+        bottom?: number;
+        left?: number;
+    }
+
+    export interface ChartOptions {
+        margin?: ChartMargin;
+        offset?: [number,number];
+        initialWidth?: number;
+        initialHeight?: number;
+        [name: string]: any;
+    }
+
+    export interface ChartMixin {
+        [name: string]: any;
+    }
+
+    export class Skeleton {
+
+        constructor(selector: string|Element, options?: ChartOptions, customEvents?: Array<string>);
+        
+        // Getters
+        getCustomEventNames(): Array<string>;
+        getDispatcher(): any; // should be d3.Dispatch but this throws error for user-created events
+        getInnerWidth(): number;
+        getInnerHeight(): number;
+        getLayerOrganizer(): LayerOrganizer;
+        getRootG(): d3.Selection<any>;
+        getSvg(): d3.Selection<any>;
+
+        // Getter/Setters
+        data(): any;
+        data(data?: any, doNotDispatch?: boolean): Skeleton;
+        options(): any; // wish this could be ChartOptions
+        options(options: ChartOptions, doNotDispatch?: boolean): Skeleton;
+        margin(): ChartMargin;
+        margin(margin: ChartMargin, doNotDispatch?: boolean): Skeleton;
+        offset(): [number, number];
+        offset(offset: Array<number>, doNotDispatch?: boolean): Skeleton;
+        width(): number;
+        width(value: number|string, doNotDispatch?: boolean): Skeleton;
+        height(): number;
+        height(value: number|string, doNotDispatch?: boolean): Skeleton;
+        dimension(): [number, number];
+        dimension(dimension: [number|string, number|string], doNotDispatch?: boolean): Skeleton;
+        autoResize(mode?: string|boolean): string|boolean|void;
+        autoResizeDetection(method?:string): string|void;
+        autoResizeToAspectRatio(ratio?: number|boolean): number|boolean|void;
+
+        // Other functions
+        on(eventName: string, listener: (...args: Array<any>) => void): void;
+        hasData(): boolean;
+        hasNonZeroArea(): boolean;
+        mixin(fn: ChartMixin): void;
+        resizeToFitContainer(mode: string|boolean, doNotDispatch?: boolean): void;
+        resizeToAspectRatio(ratio: number, doNotDispatch?: boolean): void;
+    }
+
+    interface ChartletPropertyCallback {
+        (datum?: any, datum_index?: number): any;
+    }
+
+    export interface ChartletEventFunction {
+        (sel?: d3.Selection<any>, done?: string): (sel: d3.Selection<any>) => void;
+    }
+
+    export class Chartlet {
+
+        constructor(
+            enterFunction?:   ChartletEventFunction, 
+            updateFunction?:  ChartletEventFunction, 
+            exitFunction?:    ChartletEventFunction, 
+            customEventName?: Array<string>);
+
+        // Getter functions
+        getDispatcher(): d3.Dispatch;
+        getCustomEventNames(): Array<string>;
+        getPropertyValue(name: string, datum: any, datum_index: number): any;
+
+        // Getter/Setter functions
+        property(name: string): ChartletPropertyCallback;
+        property(name: string, value: any): Chartlet;
+
+        // Enter/Update/Exit functions
+        enter( sel?: d3.Selection<any>, done?: string): (sel: d3.Selection<any>) => void;
+        update(sel?: d3.Selection<any>, done?: string): (sel: d3.Selection<any>) => void;
+        exit(  sel?: d3.Selection<any>, done?: string): (sel: d3.Selection<any>) => void;
+
+        // Inheritance functions
+        inheritPropertyFrom(parent_chartlet: Chartlet, parent_property_name: string, child_property_name?: string): void;
+        inheritPropertiesFrom(parent_chartlet: Chartlet, parent_property_names: Array<string>, child_property_names?: Array<string>): void;
+        publishEventsTo(dispatcher: d3.Dispatch): Chartlet;
+
+        // Events
+        on(eventName: string, handlerFunction: ChartletEventFunction): void;
+    }
+
+    interface LayerConfig {
+        name?: string,
+        names?: Array<string>,
+        sublayers?: LayerConfig
+    }
+
+    export class LayerOrganizer {
+
+        constructor(container: d3.Selection<any>, tag?: string);
+
+        create(config: string|Array<string>|LayerConfig|Array<LayerConfig>): d3.Selection<any>|Array<d3.Selection<any>>;
+        get(name: string): d3.Selection<any>;
+        has(name: string): boolean;
+    }
+
+    export namespace factory {
+        export function createChart(
+            defaultOptions: ChartOptions, 
+            customEvents: Array<string>, 
+            constructor: (skeleton: Skeleton) => void
+        ): (selector: string|Element, options?: ChartOptions, customEvents?: Array<string>) => Skeleton;
+    }
+
+    export namespace helper {
+        export function debounce(fn: (...args: Array<any>) => void, wait: number, immediate: boolean): (...args: Array<any>) => void;
+        export function extend(target: Object, ...args: Object[]): Object;
+        export function deepExtend(target: Object, ...args: Object[]): Object;
+        export function bindMouseEventsToDispatcher(selection: d3.Selection<any>, dispatch: d3.Dispatch, prefix: string): void;
+        export function removeAllChildren(selection: d3.Selection<any>, noTransition: boolean): d3.Selection<any>;
+        export function on(element: Element, type: string, listener: (...args: Array<any>) => void): void;
+        export function off(element: Element, type: string, listener: (...args: Array<any>) => void): void;
+        export function trim(str: string, characters: string): string;
+        export function dasherize(str: string): string;
+        export function $(s: Element|string): Element;
+        export function $$(s: Array<Node>|NodeList): Array<Element>;
+        export function isArray(value: any): boolean;
+        export function isNumber(value: any): boolean;
+        export function isObject(value: any): boolean;
+        export function isElement(o: any): boolean;
+        export function isFunction(functionToCheck: any): boolean;
+    }
+
+}
+
+declare module 'd3kit' {
+    export = d3kit;
+}
\ No newline at end of file

From 5a3d3f6fbdca6de33271dae7e4b4a56b0fe9ffe0 Mon Sep 17 00:00:00 2001
From: Andy Shu Xin <andy@shux.in>
Date: Sun, 19 Jun 2016 11:00:06 +0800
Subject: [PATCH 151/278] RN: Fix typo and flukes (#9665)

* RN: add props definition for WebView

* RN: Add platform-specific props to WebView

* RN: Add getWebViewHandle method

* RN: add source props to WebView

* RN: fix type of decelerationRate

* RN: Update Picker.Item props

* RN: Update props name

* RN: Clarify mode range

* RN: Add definition for DrawerLayoutAndroid

* RN: Update Image

* RN: Update ListView

* RN: Update MapView to 0.25

* RN: Add Modal

* RN: Update ScrollView

* RN: Add SegmentedControlIOS

* RN: Add Slider

* RN: Update SliderIOS

* RN: Define Status Bar

* RN: export StatusBar

* RN: Define Switch

* RN: Update Text

* RN: Update TextInput

* RN: Add ToolbarAndroid

* RN: Update TouchableOpacity

* RN: Update TouchableWithoutFeedback

* RN: Update View

* RN: Update ViewPagerAndroid

* RN: Fix mistakes

* RN: Unify indentation

* Add 2 components; fix some minor problems

* fix: follow the convention

* RN: Update ActionSheetIOS

* RN: Add Alert api

* RN: Fix reference

* RN: Update AlertIOS

* RN: add typing for type parameter

* RN: Update AppRegistry

* RN: Update AppState and AppStateIOS

* RN: Add BackAndroid

* RN: Update Camera Roll

* RN: Add Clipboard

* RN: Add DatePickerAndroid

* RN: Update Dimensions

* RN: Update InteractionManager

* RN: Add methods to DrawerLayoutAndroid

* RN: Export DatePickerAndroid

* RN: Add IntentAndroid

* RN: Add Linking

* RN: Add LinkingIOS

* RN: Add NetInfo

* RN: Update PixelRatio

* RN: Update PushNotificationIOS

* RN: Update StyleSheet

* RN: Add TimePickerAndroid

* RN: Update ToastAndroid

* RN: Add Vibration

* RN: Set stricter definition for flexbox props

* RN: Define ShadowPropTypesIOSStatic

* RN: Fix indentation

* RN: Add Geolocation

* RN: Export Geolocation

* RN: Move Geolocation to proper position

* RN: Define fetch

* RN: Fix tabs

* RN: Define schedulers

* RN: Major fixes from @PublicParadise

* RN: Update version

* RN: Add documentation as comments

* RN: Add more comments

* fix: typo

* add some missing callbacks

* RN: Export switch

* add missing commentes

* Fix(Switch): add style property

* RN: Update Navigation Experimental

* RN: Define SwipableListView

* RN: Add necessary marks

* RN: Improve unclear typing

* RN: Enable pagingEnabled for ScrollView

* RN: Enable returnKeyType for both platforms

* RN: Add returnKeyLabel to Android

* RN: Add a prop

* RN: Add scrollEnabled prop in 0.27

* RN: Add new prop from 0.27

* RN: Fix typo

* RN: Remove redundant export

* RN: Fix typo

* RN: Add missing definitions

* RN: Fix missing type declarations

* Annotate params
---
 react-native/react-native-tests.tsx | 19 +++++++++++++++----
 react-native/react-native.d.ts      | 29 +++++++++++++++++++++++------
 2 files changed, 38 insertions(+), 10 deletions(-)

diff --git a/react-native/react-native-tests.tsx b/react-native/react-native-tests.tsx
index 6079637ce6..d33918dbd6 100644
--- a/react-native/react-native-tests.tsx
+++ b/react-native/react-native-tests.tsx
@@ -51,7 +51,13 @@ function testDimensions() {
 BackAndroid.addEventListener("hardwareBackPress", () => {
 });
 
-var styles = StyleSheet.create(
+interface LocalStyles {
+    container: React.ViewStyle;
+    welcome: React.TextStyle;
+    instructions: React.TextStyle;
+}
+
+var styles = StyleSheet.create<LocalStyles>(
     {
         container:    {
             flex:            1,
@@ -74,13 +80,18 @@ var styles = StyleSheet.create(
 
 
 class Welcome extends React.Component<any,any> {
-
+  
+    refs: {
+      [key: string]: any
+      rootView: View
+    }
+  
     testNativeMethods() {
-      this.setNativeProps({});
+      // this.setNativeProps({});
 
       const { rootView } = this.refs;
 
-      rootView.measure((x, y, width, height) => {
+      rootView.measure((x: number, y: number, width: number, height: number) => {
       });
     }
 
diff --git a/react-native/react-native.d.ts b/react-native/react-native.d.ts
index d0bbf5aea8..8be6ac8d56 100644
--- a/react-native/react-native.d.ts
+++ b/react-native/react-native.d.ts
@@ -5522,7 +5522,7 @@ declare namespace  __React {
     }
     
     export interface NavigationHeaderProps {
-        renderTitleComponent?(props: Object): JSX.element
+        renderTitleComponent?(props: Object): JSX.Element
     }
     
     export interface NavigationHeaderStatic extends React.ComponentClass<NavigationHeaderProps> {
@@ -5535,7 +5535,7 @@ declare namespace  __React {
         style?: ViewStyle
         navigationState?: any
         onNavigate(action: Object): boolean
-        renderScene?(props): JSX.Element
+        renderScene?(props: any /* undocumented on 0.27 */): JSX.Element
     }
     
     export interface NavigationCardStackStatic extends React.ComponentClass<NavigationCardStackProps> {
@@ -5547,6 +5547,26 @@ declare namespace  __React {
         Header: NavigationHeaderStatic;
         Reducer: NavigationReducerStatic;
     }
+    
+    export interface NavigationContainerProps {
+        tabs: NavigationTab[];
+        index: number;
+    }
+
+    export interface NavigationContainerStatic extends React.ComponentClass<NavigationContainerProps> {
+        create(inClass: any): any;
+    }
+
+    export interface NavigationRootContainerProps extends React.Props<NavigationRootContainerStatic> {
+        renderNavigation: NavigationRenderer;
+        reducer: NavigationReducerStatic;
+        persistenceKey?: string;
+    }
+
+    export interface NavigationRootContainerStatic extends React.ComponentClass<NavigationRootContainerProps> {
+        getBackAction(): NavigationAction;
+        handleNavigation( action: NavigationAction ): boolean;
+    }
 
     //////////////////////////////////////////////////////////////////////////
     //
@@ -5618,7 +5638,7 @@ declare namespace  __React {
     export type StyleSheet = StyleSheetStatic
     
     export var SwipeableListView: SwipeableListViewStatic
-    export type SwipeableListView = SwipeableListViewStatci
+    export type SwipeableListView = SwipeableListViewStatic
 
     export var Switch: SwitchStatic
     export type Switch = SwitchStatic
@@ -5741,9 +5761,6 @@ declare namespace  __React {
 
     export type NavigationReducer = NavigationReducerStatic;
     export var NavigationReducer: NavigationReducerStatic;
-    
-    export type SwipeableListView = SwipeableListViewStatic;
-    export var SwipeableListView: SwipeableListViewStatic;
 
     export type Easing = EasingStatic;
     export var Easing: EasingStatic;

From 119e968fa27b58f6a194887083442a1767b1f46f Mon Sep 17 00:00:00 2001
From: Peter Safranek <pe8ter@users.noreply.github.com>
Date: Sat, 18 Jun 2016 20:01:20 -0700
Subject: [PATCH 152/278] Add parameter types for assert(). (#9681)

---
 koa/koa-tests.ts | 1 +
 koa/koa.d.ts     | 2 +-
 2 files changed, 2 insertions(+), 1 deletion(-)

diff --git a/koa/koa-tests.ts b/koa/koa-tests.ts
index e984364973..71814fe4fc 100644
--- a/koa/koa-tests.ts
+++ b/koa/koa-tests.ts
@@ -9,6 +9,7 @@ app.use((ctx, next) => {
     const end: any = new Date();
     const ms = end - start;
     console.log(`${ctx.method} ${ctx.url} - ${ms}ms`);
+    ctx.assert(true, 404, 'Yep!');
   });
 });
 
diff --git a/koa/koa.d.ts b/koa/koa.d.ts
index 922b243511..b005067b1f 100644
--- a/koa/koa.d.ts
+++ b/koa/koa.d.ts
@@ -38,7 +38,7 @@ declare module "koa" {
         toJSON(): any;
         inspect(): any;
         throw(code?: any, message?: any): void;
-        assert(): void;
+        assert(test: any, status: number, message: string): void;
     }
 
     export interface Request {

From 0e64f9361e1764d8c56b16c2aaba5bf4d9fbad20 Mon Sep 17 00:00:00 2001
From: Peter Safranek <pe8ter@users.noreply.github.com>
Date: Sat, 18 Jun 2016 20:02:05 -0700
Subject: [PATCH 153/278] Add typings for base64-js. (#9682)

* Add typings for base-64.js.

* Fix bad file names.
---
 base64-js/base64-js-tests.ts |  6 ++++++
 base64-js/base64-js.d.ts     | 10 ++++++++++
 2 files changed, 16 insertions(+)
 create mode 100644 base64-js/base64-js-tests.ts
 create mode 100644 base64-js/base64-js.d.ts

diff --git a/base64-js/base64-js-tests.ts b/base64-js/base64-js-tests.ts
new file mode 100644
index 0000000000..6852ddb626
--- /dev/null
+++ b/base64-js/base64-js-tests.ts
@@ -0,0 +1,6 @@
+/// <reference path="base64-js.d.ts" />
+
+import * as base64js from 'base64-js';
+
+const bytes: Uint8Array = base64js.toByteArray('shemp');
+const decoded: string = base64js.fromByteArray(new Uint8Array(0));
diff --git a/base64-js/base64-js.d.ts b/base64-js/base64-js.d.ts
new file mode 100644
index 0000000000..cc7d2165c8
--- /dev/null
+++ b/base64-js/base64-js.d.ts
@@ -0,0 +1,10 @@
+// Type definitions for base64-js v1.1.2
+// Project: https://github.com/beatgammit/base64-js
+// Definitions by: Peter Safranek <https://github.com/pe8ter>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module 'base64-js' {
+
+    export function toByteArray(encoded: string): Uint8Array;
+    export function fromByteArray(bytes: Uint8Array): string;
+}

From 50b9b6c6d571cab9fb0154d2f3456d9a77f55ac8 Mon Sep 17 00:00:00 2001
From: Linda_pp <rhysd@users.noreply.github.com>
Date: Sun, 19 Jun 2016 12:19:33 +0900
Subject: [PATCH 154/278] react-addons-perf: Update APIs to version 15.1.0
 (#9662)

* react-addons-perf: Update APIs to version 15.1.0

https://facebook.github.io/react/docs/perf.html

* Add deprecation comment to printDOM()

* Add more exported APIs

https://github.com/facebook/react/blob/d101f68bce34a62613a3e86981266111e8950267/src/renderers/shared/ReactPerf.js#L432
---
 react/react-addons-perf.d.ts | 17 ++++++++++++-----
 react/react-global-tests.ts  |  6 ++++++
 react/react-tests.ts         | 17 +++++++++++++++++
 3 files changed, 35 insertions(+), 5 deletions(-)

diff --git a/react/react-addons-perf.d.ts b/react/react-addons-perf.d.ts
index 6a40a2c402..3fe17e0133 100644
--- a/react/react-addons-perf.d.ts
+++ b/react/react-addons-perf.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for React v0.14 (react-addons-perf)
+// Type definitions for React v15.1.0 (react-addons-perf)
 // Project: http://facebook.github.io/react/
 // Definitions by: Asana <https://asana.com>, AssureSign <http://www.assuresign.com>, Microsoft <https://microsoft.com>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -31,11 +31,18 @@ declare namespace __React {
         namespace Perf {
             export function start(): void;
             export function stop(): void;
-            export function printInclusive(measurements: Measurements[]): void;
-            export function printExclusive(measurements: Measurements[]): void;
-            export function printWasted(measurements: Measurements[]): void;
-            export function printDOM(measurements: Measurements[]): void;
+            export function printInclusive(measurements?: Measurements[]): void;
+            export function printExclusive(measurements?: Measurements[]): void;
+            export function printWasted(measurements?: Measurements[]): void;
+            export function printOperations(measurements?: Measurements[]): void;
             export function getLastMeasurements(): Measurements[];
+            export function getExclusive(measurements?: Measurements[]): any;
+            export function getInclusive(measurements?: Measurements[]): any;
+            export function getWasted(measurements?: Measurements[]): any;
+            export function getOperations(measurements?: Measurements[]): any;
+
+            // Renamed to printOperations().  Please use it instead.
+            export function printDOM(measurements?: Measurements[]): void;
         }
     }
 }
diff --git a/react/react-global-tests.ts b/react/react-global-tests.ts
index 1ed7f8484e..8fce3ede9c 100644
--- a/react/react-global-tests.ts
+++ b/react/react-global-tests.ts
@@ -404,7 +404,13 @@ var measurements = React.addons.Perf.getLastMeasurements();
 React.addons.Perf.printInclusive(measurements);
 React.addons.Perf.printExclusive(measurements);
 React.addons.Perf.printWasted(measurements);
+React.addons.Perf.printOperations(measurements);
 React.addons.Perf.printDOM(measurements);
+React.addons.Perf.printInclusive();
+React.addons.Perf.printExclusive();
+React.addons.Perf.printWasted();
+React.addons.Perf.printOperations();
+React.addons.Perf.printDOM();
 
 //
 // PureRenderMixin addon
diff --git a/react/react-tests.ts b/react/react-tests.ts
index 5976fb23bd..b914923e4b 100644
--- a/react/react-tests.ts
+++ b/react/react-tests.ts
@@ -534,7 +534,24 @@ var measurements = Perf.getLastMeasurements();
 Perf.printInclusive(measurements);
 Perf.printExclusive(measurements);
 Perf.printWasted(measurements);
+Perf.printOperations(measurements);
+Perf.printInclusive();
+Perf.printExclusive();
+Perf.printWasted();
+Perf.printOperations();
+
+console.log(Perf.getExclusive());
+console.log(Perf.getInclusive());
+console.log(Perf.getWasted());
+console.log(Perf.getOperations());
+console.log(Perf.getExclusive(measurements));
+console.log(Perf.getInclusive(measurements));
+console.log(Perf.getWasted(measurements));
+console.log(Perf.getOperations(measurements));
+
+// Renamed to printOperations().  Please use it instead.
 Perf.printDOM(measurements);
+Perf.printDOM();
 
 //
 // PureRenderMixin addon

From eb1ebbda02484a2129db90da3cdc524578de1382 Mon Sep 17 00:00:00 2001
From: vario <variotries@gmail.com>
Date: Sun, 19 Jun 2016 12:20:39 +0900
Subject: [PATCH 155/278] Update variable type (#9684)

---
 systemjs/systemjs.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/systemjs/systemjs.d.ts b/systemjs/systemjs.d.ts
index a04ee7a90d..3a71669041 100644
--- a/systemjs/systemjs.d.ts
+++ b/systemjs/systemjs.d.ts
@@ -119,7 +119,7 @@ declare namespace SystemJSLoader {
          * The default extension to add to modules requested within the package. Takes preference over defaultJSExtensions.
          * Can be set to defaultExtension: false to optionally opt-out of extension-adding when defaultJSExtensions is enabled.
          */
-        defaultExtension?: boolean;
+        defaultExtension?: boolean | string;
 
         /**
          * Local and relative map configurations scoped to the package. Apply for subpaths as well.

From 2ae9de3df3accfde704dab2d1cd7bb0e91fa4d55 Mon Sep 17 00:00:00 2001
From: Craig Citro <craig@craigcitro.com>
Date: Sat, 18 Jun 2016 22:21:39 -0500
Subject: [PATCH 156/278] Add .d.ts for weighted (#9687)

---
 weighted/weighted-tests.ts | 30 ++++++++++++++++++++++++++++++
 weighted/weighted.d.ts     | 13 +++++++++++++
 2 files changed, 43 insertions(+)
 create mode 100644 weighted/weighted-tests.ts
 create mode 100644 weighted/weighted.d.ts

diff --git a/weighted/weighted-tests.ts b/weighted/weighted-tests.ts
new file mode 100644
index 0000000000..8b8b828f0a
--- /dev/null
+++ b/weighted/weighted-tests.ts
@@ -0,0 +1,30 @@
+/// <reference path="./weighted.d.ts" />
+import * as weighted from 'weighted';
+
+function testSet() {
+    var options = ['Wake Up', 'Snooze Alarm'];
+    var weights = [0.25, 0.75];
+
+    console.log('Decision:', weighted.select(options, weights));
+}
+
+function testObj() {
+    var options = {
+        'Wake Up': 0.25,
+        'Snooze Alarm': 0.75
+    };
+
+    console.log('Decision:', weighted.select(options));
+}
+
+function testOverrideRand() {
+    var options = ['Wake Up', 'Snooze Alarm'];
+	var weights = [0.25, 0.75];
+
+    function rand() {
+        return 4; // chosen by fair dice roll.
+                  // guaranteed to be random.  
+    }
+
+    console.log('Decision:', weighted.select(options, weights, rand));
+}
diff --git a/weighted/weighted.d.ts b/weighted/weighted.d.ts
new file mode 100644
index 0000000000..3f479ef0c1
--- /dev/null
+++ b/weighted/weighted.d.ts
@@ -0,0 +1,13 @@
+// Type definitions for weighted
+// Project: https://github.com/Schoonology/weighted
+// Definitions by: Craig Citro <https://github.com/ccitro>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module 'weighted' {
+    export interface RandomFunc {
+        (): Number;
+    }  
+
+    export function select<T> (set: T[], weights: Number[], rand?: RandomFunc): T;
+    export function select<T> (obj: Object, rand?: RandomFunc): T;
+}
\ No newline at end of file

From 279acdc785609096b2f0984aef90b40319c1ac89 Mon Sep 17 00:00:00 2001
From: Craig Citro <craig@craigcitro.com>
Date: Sat, 18 Jun 2016 22:21:54 -0500
Subject: [PATCH 157/278] Add d.ts for striptags (#9688)

---
 striptags/striptags-tests.ts | 13 +++++++++++++
 striptags/striptags.d.ts     |  8 ++++++++
 2 files changed, 21 insertions(+)
 create mode 100644 striptags/striptags-tests.ts
 create mode 100644 striptags/striptags.d.ts

diff --git a/striptags/striptags-tests.ts b/striptags/striptags-tests.ts
new file mode 100644
index 0000000000..e7517cf05d
--- /dev/null
+++ b/striptags/striptags-tests.ts
@@ -0,0 +1,13 @@
+/// <reference path="./striptags.d.ts" />
+import striptags from 'striptags';
+
+    function testStriptags() {
+    var html =
+        '<a href="https://example.com">' +
+            'lorem ipsum <strong>dolor</strong> <em>sit</em> amet' +
+        '</a>';
+
+    striptags(html);
+    striptags(html, '<a><strong>');
+    striptags(html, ['a']);
+}
\ No newline at end of file
diff --git a/striptags/striptags.d.ts b/striptags/striptags.d.ts
new file mode 100644
index 0000000000..dfbf79adc1
--- /dev/null
+++ b/striptags/striptags.d.ts
@@ -0,0 +1,8 @@
+// Type definitions for striptags
+// Project: https://github.com/ericnorris/striptags
+// Definitions by: Craig Citro <https://github.com/ccitro>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module 'striptags' {
+    export default function strip (html: string, allowedTags?: string | string[]): string;
+}

From 00e58d84f38773742e2a4d72ee7153c0ed407828 Mon Sep 17 00:00:00 2001
From: Phil Scott <phil.scott@gmail.com>
Date: Sat, 18 Jun 2016 23:22:10 -0400
Subject: [PATCH 158/278] d3 - Adds function type to d3.layout.partition<T>
 (#9668)

interface Partition<T> was missing it's function type.
---
 d3/d3.d.ts | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/d3/d3.d.ts b/d3/d3.d.ts
index 880e379a92..6d4b43c0dc 100644
--- a/d3/d3.d.ts
+++ b/d3/d3.d.ts
@@ -3064,6 +3064,8 @@ declare namespace d3 {
         }
 
         export interface Partition<T extends partition.Node> {
+            (root: T): T[];
+
             nodes(root: T): T[];
 
             links(nodes: T[]): partition.Link<T>[];

From 7ad54fcef19ebaa0025e2dbb64e4715f03da9825 Mon Sep 17 00:00:00 2001
From: Alexander Sychev <shurik.shurik.1993@yandex.ru>
Date: Sun, 19 Jun 2016 06:22:37 +0300
Subject: [PATCH 159/278] Missed an existing knex schema method (#9689)

See: http://knexjs.org/#Schema-createTableIfNotExists
---
 knex/knex.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index d59b749e95..98338db49d 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -302,6 +302,7 @@ declare module "knex" {
 
     interface SchemaBuilder extends Promise<any> {
       createTable(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
+      createTableIfNotExists(tableName: string, callback: (tableBuilder: CreateTableBuilder) => any): SchemaBuilder;
       renameTable(oldTableName: string, newTableName: string): Promise<void>;
       dropTable(tableName: string): SchemaBuilder;
       hasTable(tableName: string): Promise<boolean>;

From 17d06b6644dfd4b38cba2ce8aca72590e02047d8 Mon Sep 17 00:00:00 2001
From: Jon Jaques <jon@jonjaques.com>
Date: Sat, 18 Jun 2016 22:25:21 -0500
Subject: [PATCH 160/278] Add htmlAttributes property to HelmetProps per 3.x
 (#9686)

* Add htmlAttributes property to HelmetProps per 3.0

* Make htmlAttributes optional
---
 react-helmet/react-helmet.d.ts | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/react-helmet/react-helmet.d.ts b/react-helmet/react-helmet.d.ts
index b5b69411ee..2ea19ae469 100644
--- a/react-helmet/react-helmet.d.ts
+++ b/react-helmet/react-helmet.d.ts
@@ -9,21 +9,23 @@ declare namespace ReactHelmet {
     import React = __React;
     
     interface HelmetProps {
-        title?: string;
-        titleTemplate?: string;
         base?: any;
+        htmlAttributes?: any;
         link?: Array<any>;
         meta?: Array<any>;
         script?: Array<any>;
+        title?: string;
+        titleTemplate?: string;
         onChangeClientState?: (newState: any) => void;
     }
 
     interface HelmetData {
-        title: HelmetDatum;
         base: HelmetDatum;
+        htmlAttributes: HelmetDatum;
         link: HelmetDatum;
         meta: HelmetDatum;
         script: HelmetDatum;
+        title: HelmetDatum;
     }
     
     interface HelmetDatum {

From b1daff0be8fa53f645365303d8e0145d055370e9 Mon Sep 17 00:00:00 2001
From: Daniel <daniel@wants.email>
Date: Sat, 18 Jun 2016 22:28:55 -0500
Subject: [PATCH 161/278] Add mocha's `specify` function (#9691)

---
 mocha/mocha-tests.ts | 15 +++++++++++++++
 mocha/mocha.d.ts     |  1 +
 2 files changed, 16 insertions(+)

diff --git a/mocha/mocha-tests.ts b/mocha/mocha-tests.ts
index d0108263ec..c6185aa32b 100644
--- a/mocha/mocha-tests.ts
+++ b/mocha/mocha-tests.ts
@@ -66,6 +66,21 @@ function test_test() {
     });
 }
 
+function test_specify() {
+
+    specify('does something', () => { });
+
+    specify('does something', (done) => { done(); });
+
+    specify.only('does something', () => { });
+
+    specify.skip('does something', () => { });
+
+    specify('does something', function () {
+        this.timeout(2000);
+    });
+}
+
 function test_before() {
     before(() => { });
 
diff --git a/mocha/mocha.d.ts b/mocha/mocha.d.ts
index 56c6cdba82..eb167c83c9 100644
--- a/mocha/mocha.d.ts
+++ b/mocha/mocha.d.ts
@@ -44,6 +44,7 @@ declare var it: Mocha.ITestDefinition;
 declare var xit: Mocha.ITestDefinition;
 // alias for `it`
 declare var test: Mocha.ITestDefinition;
+declare var specify: Mocha.ITestDefinition;
 
 declare function before(action: () => void): void;
 

From 6ea0b792a03620f38a01a6ad047956788dbca539 Mon Sep 17 00:00:00 2001
From: Abhishek Garg <abhig0589@gmail.com>
Date: Sun, 19 Jun 2016 08:59:54 +0530
Subject: [PATCH 162/278] Added missing method (#8947)

* Added missing method

Added method refresh to IGridCoreApi

* Revert "Merge pull request #1 from AbhishekGarg/ui-grid-definition-update"

This reverts commit 7a98bbf0ab000d712dff496294ffeb32845c82c8, reversing
changes made to 2712dd1e88d5a3f940592bc5d7102c2ab4eb39a7.

* Added missing method

Added method refresh to IGridCoreApi

* Added missing argument

Added argument row to function rowIdentity in IGridOptions
---
 ui-grid/ui-grid.d.ts | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/ui-grid/ui-grid.d.ts b/ui-grid/ui-grid.d.ts
index 695be8f908..a598bc9846 100644
--- a/ui-grid/ui-grid.d.ts
+++ b/ui-grid/ui-grid.d.ts
@@ -926,6 +926,12 @@ declare namespace uiGrid {
          *        us which refreshes to fire.
          */
         notifyDataChange(type: string): void;
+        /**
+         * Refresh the rendered grid on screen.
+         *
+         * @param {boolean} [rowsAltered] Optional flag for refreshing when the number of rows has changed.
+         */
+        refresh(rowsAltered?: boolean): ng.IPromise<any>;
         /**
          * Refresh the rendered rows on screen?  Note: not functional at present
          * @returns {ng.IPromise<any>} promise that is resolved when render completes?

From 8ef38fbc561940342ea2073d74931f761be05891 Mon Sep 17 00:00:00 2001
From: TANAKA Koichi <mugeso@mugeso.com>
Date: Sun, 19 Jun 2016 12:32:02 +0900
Subject: [PATCH 163/278] Add definition for split2 (#9692)

npm: https://www.npmjs.com/package/split2
project: https://github.com/mcollina/split2
---
 split2/split2-tests.ts | 31 +++++++++++++++++++++++++++++++
 split2/split2.d.ts     | 34 ++++++++++++++++++++++++++++++++++
 2 files changed, 65 insertions(+)
 create mode 100644 split2/split2-tests.ts
 create mode 100644 split2/split2.d.ts

diff --git a/split2/split2-tests.ts b/split2/split2-tests.ts
new file mode 100644
index 0000000000..2e09612c3b
--- /dev/null
+++ b/split2/split2-tests.ts
@@ -0,0 +1,31 @@
+/// <reference path="./split2.d.ts" />
+/// <reference path="../node/node.d.ts" />
+import * as split from 'split2';
+import * as fs from 'fs';
+import { Transform, TransformOptions } from 'stream';
+
+let stream: Transform;
+let options: split.Options = {};
+let matcherString = '\t';
+let matcherRegex = /\r?\n/;
+
+stream = split();
+stream = split(JSON.parse);
+stream = split(options);
+stream = split(JSON.parse, options);
+stream = split(matcherString);
+stream = split(matcherString, JSON.parse);
+stream = split(matcherString, options);
+stream = split(matcherString, JSON.parse, options);
+stream = split(matcherRegex);
+stream = split(matcherRegex, JSON.parse);
+stream = split(matcherRegex, options);
+stream = split(matcherRegex, JSON.parse, options);
+
+options = {
+  maxLength: 1000,
+  objectMode: true,
+  highWaterMark: 16,
+  encoding: 'utf8'
+};
+
diff --git a/split2/split2.d.ts b/split2/split2.d.ts
new file mode 100644
index 0000000000..4ba12ae478
--- /dev/null
+++ b/split2/split2.d.ts
@@ -0,0 +1,34 @@
+// Type definitions for split2 2.1.0
+// Project: https://github.com/mcollina/split2
+// Definitions by: TANAKA Koichi <https://github.com/mugeso/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+declare module "split2" {
+    import { Transform, TransformOptions } from 'stream';
+
+    type Matcher = string|RegExp;
+    type Mapper = split.Mapper;
+    type Options = split.Options;
+
+    function split(): Transform;
+    function split(matcher: Matcher): Transform;
+    function split(mapper: Mapper): Transform;
+    function split(options: Options): Transform;
+    function split(matcher: Matcher, mapper: Mapper): Transform;
+    function split(matcher: Matcher, options: Options): Transform;
+    function split(mapper: Mapper, options: Options): Transform;
+    function split(matcher: Matcher, mapper: Mapper, options: Options): Transform;
+
+    namespace split {
+        export interface Mapper {
+            (line: string): any;
+        }
+
+        export interface Options extends TransformOptions {
+           maxLength?: number;
+        }
+    }
+
+    export = split;
+}

From ed73479d5db8d138b16f2275b5dcac03027f716b Mon Sep 17 00:00:00 2001
From: Timofey Kachalov <sanex3339@users.noreply.github.com>
Date: Sun, 19 Jun 2016 06:35:40 +0300
Subject: [PATCH 164/278] Javascript obfuscator update (#9694)

* JavaScriptObfuscator new options

JavaScriptObfuscator new options

* JavaScriptObfuscator new options

JavaScriptObfuscator new options

* JavaScriptObfuscator new options

JavaScriptObfuscator new options
---
 .../javascript-obfuscator-tests.ts              | 17 ++++++++++-------
 .../javascript-obfuscator.d.ts                  |  3 +++
 2 files changed, 13 insertions(+), 7 deletions(-)

diff --git a/javascript-obfuscator/javascript-obfuscator-tests.ts b/javascript-obfuscator/javascript-obfuscator-tests.ts
index 74d6363ffb..1c0753c3bf 100644
--- a/javascript-obfuscator/javascript-obfuscator-tests.ts
+++ b/javascript-obfuscator/javascript-obfuscator-tests.ts
@@ -5,11 +5,14 @@ import { JavaScriptObfuscator } from 'javascript-obfuscator';
 let sourceCode1: string = JavaScriptObfuscator.obfuscate('var foo = 1;');
 let sourceCode2: string = JavaScriptObfuscator.obfuscate('var foo = 1;', {
   compact: true,
-  debugProtection: false,
-  debugProtectionInterval: false,
-  disableConsoleOutput: true,
-  encodeUnicodeLiterals: true,
-  rotateUnicodeArray: true,
-  unicodeArray: true,
-  wrapUnicodeArrayCalls: true
+    debugProtection: false,
+    debugProtectionInterval: false,
+    disableConsoleOutput: true,
+    encodeUnicodeLiterals: false,
+    reservedNames: ['^foo$'],
+    rotateUnicodeArray: true,
+    selfDefending: true,
+    unicodeArray: true,
+    unicodeArrayThreshold: 0.8,
+    wrapUnicodeArrayCalls: true
 });
diff --git a/javascript-obfuscator/javascript-obfuscator.d.ts b/javascript-obfuscator/javascript-obfuscator.d.ts
index 7b7a8438c5..17a91c4925 100644
--- a/javascript-obfuscator/javascript-obfuscator.d.ts
+++ b/javascript-obfuscator/javascript-obfuscator.d.ts
@@ -10,8 +10,11 @@ declare module 'javascript-obfuscator' {
     debugProtectionInterval?: boolean;
     disableConsoleOutput?: boolean;
     encodeUnicodeLiterals?: boolean;
+    reservedNames?: string[];
     rotateUnicodeArray?: boolean;
+    selfDefending?: boolean;
     unicodeArray?: boolean;
+    unicodeArrayThreshold?: number;
     wrapUnicodeArrayCalls?: boolean;
     [id: string]: any;
   }

From 68187beb94cf85c2763e258849ea63ddcbf9ad03 Mon Sep 17 00:00:00 2001
From: Viktor Zozuliak <zozulyakviktor@gmail.com>
Date: Sun, 19 Jun 2016 05:36:07 +0200
Subject: [PATCH 165/278] lodash: Add _.reduce for LoDashExplicitObjectWrapper
 (#9129)

---
 lodash/lodash.d.ts | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

diff --git a/lodash/lodash.d.ts b/lodash/lodash.d.ts
index 115cc4a1e6..f1772191cd 100644
--- a/lodash/lodash.d.ts
+++ b/lodash/lodash.d.ts
@@ -8547,6 +8547,21 @@ declare module _ {
             callback: MemoIterator<TValue, TResult>): TResult;
     }
 
+    interface LoDashExplicitObjectWrapper<T> {
+        /**
+        * @see _.reduce
+        **/
+        reduce<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>,
+            accumulator: TResult): LoDashExplicitObjectWrapper<TResult>;
+
+        /**
+        * @see _.reduce
+        **/
+        reduce<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>): LoDashExplicitObjectWrapper<TResult>;
+    }
+
     //_.reduceRight
     interface LoDashStatic {
         /**

From 49164be32a8d6089a7fff0e29057e23a811da4c9 Mon Sep 17 00:00:00 2001
From: Viktor Zozuliak <zozulyakviktor@gmail.com>
Date: Sun, 19 Jun 2016 05:36:23 +0200
Subject: [PATCH 166/278] lodash-3.10: Add _.reduce for
 LoDashExplicitObjectWrapper (#9128)

---
 lodash/lodash-3.10.d.ts | 47 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)

diff --git a/lodash/lodash-3.10.d.ts b/lodash/lodash-3.10.d.ts
index b92de15c89..3948215468 100644
--- a/lodash/lodash-3.10.d.ts
+++ b/lodash/lodash-3.10.d.ts
@@ -7732,6 +7732,53 @@ declare module _ {
             thisArg?: any): TResult;
     }
 
+    interface LoDashExplicitObjectWrapper<T> {
+        /**
+        * @see _.reduce
+        **/
+        reduce<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>,
+            accumulator: TResult,
+            thisArg?: any): LoDashExplicitObjectWrapper<TResult>;
+
+        /**
+        * @see _.reduce
+        **/
+        reduce<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>,
+            thisArg?: any): LoDashExplicitObjectWrapper<TResult>;
+
+        /**
+        * @see _.reduce
+        **/
+        inject<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>,
+            accumulator: TResult,
+            thisArg?: any): LoDashExplicitObjectWrapper<TResult>;
+
+        /**
+        * @see _.reduce
+        **/
+        inject<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>,
+            thisArg?: any): LoDashExplicitObjectWrapper<TResult>;
+
+        /**
+        * @see _.reduce
+        **/
+        foldl<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>,
+            accumulator: TResult,
+            thisArg?: any): LoDashExplicitObjectWrapper<TResult>;
+
+        /**
+        * @see _.reduce
+        **/
+        foldl<TValue, TResult>(
+            callback: MemoIterator<TValue, TResult>,
+            thisArg?: any): LoDashExplicitObjectWrapper<TResult>;
+    }
+
     //_.reduceRight
     interface LoDashStatic {
         /**

From 27896d899dabccaa34fd392420ce95558ce61db7 Mon Sep 17 00:00:00 2001
From: Gevik Babakhani <gevik@blendjs.com>
Date: Sun, 19 Jun 2016 05:36:36 +0200
Subject: [PATCH 167/278] Updated to match the command signature as of 4.7.1
 (#9693)

---
 yargs/yargs-tests.ts | 53 ++++++++++++++++++++++++++------------------
 yargs/yargs.d.ts     | 16 ++++++++-----
 2 files changed, 42 insertions(+), 27 deletions(-)

diff --git a/yargs/yargs-tests.ts b/yargs/yargs-tests.ts
index a049af8cb3..14509d2072 100644
--- a/yargs/yargs-tests.ts
+++ b/yargs/yargs-tests.ts
@@ -67,14 +67,14 @@ function default_singles() {
 		.default('x', 10)
 		.default('y', 10)
 		.argv
-	;
+		;
 	console.log(argv.x + argv.y);
 }
 function default_hash() {
 	var argv = yargs
 		.default({ x: 10, y: 10 })
 		.argv
-	;
+		;
 	console.log(argv.x + argv.y);
 }
 
@@ -83,7 +83,7 @@ function boolean_single() {
 	var argv = yargs
 		.boolean('v')
 		.argv
-	;
+		;
 	console.dir(argv.v);
 	console.dir(argv._);
 }
@@ -91,7 +91,7 @@ function boolean_double() {
 	var argv = yargs
 		.boolean(['x', 'y', 'z'])
 		.argv
-	;
+		;
 	console.dir([argv.x, argv.y, argv.z]);
 	console.dir(argv._);
 }
@@ -105,7 +105,7 @@ function line_count() {
 		.alias('f', 'file')
 		.describe('f', 'Load a file')
 		.argv
-	;
+		;
 }
 
 // Below are tests for individual methods.
@@ -131,13 +131,13 @@ function Argv$options() {
 			nargs: 3
 		})
 		.argv
-	;
+		;
 
 	var argv2 = yargs
 		.alias('f', 'file')
 		.default('f', '/etc/passwd')
 		.argv
-	;
+		;
 }
 
 function Argv$global() {
@@ -168,17 +168,17 @@ function Argv$array() {
 function Argv$nargs() {
 	var argv = yargs
 		.nargs('foo', 12)
-		.nargs({'bing': 3, 'bang': 2, 'buzz': 4})
+		.nargs({ 'bing': 3, 'bang': 2, 'buzz': 4 })
 }
 
 function Argv$choices() {
 	// example from documentation
 	var argv = yargs
-	  .alias('i', 'ingredient')
-	  .describe('i', 'choose your sandwich ingredients')
-	  .choices('i', ['peanut-butter', 'jelly', 'banana', 'pickles'])
-	  .help('help')
-	  .argv
+		.alias('i', 'ingredient')
+		.describe('i', 'choose your sandwich ingredients')
+		.choices('i', ['peanut-butter', 'jelly', 'banana', 'pickles'])
+		.help('help')
+		.argv
 }
 
 function command() {
@@ -190,8 +190,19 @@ function command() {
 				alias: 'force',
 				description: 'yar, it usually be a bad idea'
 			})
-			.help('help')
-			.argv;
+				.help('help')
+				.argv;
+		})
+		.command("build", "arghh, build it mate", {
+			tag: {
+				default: true,
+				demand: true,
+				description: "Tag the build, mate!"
+			},
+			publish: {
+				default: false,
+				description:"Should i publish?"
+			}
 		})
 		.help('help')
 		.argv;
@@ -214,7 +225,7 @@ function completion_sync() {
 function completion_async() {
 	var argv = yargs
 		.completion('completion', (current, argv, done) => {
-			setTimeout(function() {
+			setTimeout(function () {
 				done([
 					'apple',
 					'banana'
@@ -257,16 +268,16 @@ function Argv$version() {
 		.version('1.0.0', '--version', 'description');
 
 	var argv4 = yargs
-		.version( function() { return '1.0.0'; }, '--version', 'description');
+		.version(function () { return '1.0.0'; }, '--version', 'description');
 }
 
 function Argv$locale() {
 	var argv = yargs
 		.usage('./$0 - follow ye instructions true')
 		.option('option', {
-		alias: 'o',
-		describe: "'tis a mighty fine option",
-		demand: true
+			alias: 'o',
+			describe: "'tis a mighty fine option",
+			demand: true
 		})
 		.command('run', "Arrr, ya best be knowin' what yer doin'")
 		.example('$0 run foo', "shiver me timbers, here's an example for ye")
@@ -298,7 +309,7 @@ function Argv$reset() {
 			.argv
 
 		console.log('hello!');
-	} else if (command === 'world'){
+	} else if (command === 'world') {
 		ya.reset()
 			.usage('$0 world')
 			.help('h')
diff --git a/yargs/yargs.d.ts b/yargs/yargs.d.ts
index 4e6ef109ec..7dc1ef2319 100644
--- a/yargs/yargs.d.ts
+++ b/yargs/yargs.d.ts
@@ -21,7 +21,7 @@ declare module "yargs" {
 			alias(shortName: string, longName: string): Argv;
 			alias(aliases: { [shortName: string]: string }): Argv;
 			alias(aliases: { [shortName: string]: string[] }): Argv;
-			
+
 			array(key: string): Argv;
 			array(keys: string[]): Argv;
 
@@ -64,7 +64,11 @@ declare module "yargs" {
 			usage(options?: { [key: string]: Options }): Argv;
 
 			command(command: string, description: string): Argv;
-			command(command: string, description: string, fn: (args: Argv) => void): Argv;
+			command(command: string, description: string, handler: (args: Argv) => void): Argv;
+			command(command: string, description: string, builder: (args: Argv) => Options): Argv;
+			command(command: string, description: string, builder: { [optionName: string]: Options }): Argv;
+			command(command: string, description: string, builder: { [optionName: string]: Options }, handler: (args: Argv) => void): Argv;
+			command(command: string, description: string, builder: (args: Argv) => Options, handler: (args: Argv) => void): Argv;
 
 			completion(cmd: string, fn?: SyncCompletionFunction): Argv;
 			completion(cmd: string, description?: string, fn?: SyncCompletionFunction): Argv;
@@ -93,7 +97,7 @@ declare module "yargs" {
 
 			help(): string;
 			help(option: string, description?: string): Argv;
-			
+
 			env(prefix?: string): Argv;
 			env(enable: boolean): Argv;
 
@@ -108,13 +112,13 @@ declare module "yargs" {
 			showHelp(func?: (message: string) => any): Argv;
 
 			exitProcess(enabled:boolean): Argv;
-			
+
 			global(key: string): Argv;
 			global(keys: string[]): Argv;
-			
+
 			group(key: string, groupName: string): Argv;
 			group(keys: string[], groupName: string): Argv;
-			
+
 			nargs(key: string, count: number): Argv;
 			nargs(nargs: { [key: string]: number }): Argv;
 

From 13bf10021b53fd1465373db618099ce17b8e85fc Mon Sep 17 00:00:00 2001
From: Artur Eshenbrener <strate@yandex.ru>
Date: Sun, 19 Jun 2016 06:38:47 +0300
Subject: [PATCH 168/278] redux-logger: add `diff` and `diffPredicate` options.
 (#9697)

---
 redux-logger/redux-logger-tests.ts | 4 +++-
 redux-logger/redux-logger.d.ts     | 2 ++
 2 files changed, 5 insertions(+), 1 deletion(-)

diff --git a/redux-logger/redux-logger-tests.ts b/redux-logger/redux-logger-tests.ts
index d93aa7e7da..8341c3eaa6 100644
--- a/redux-logger/redux-logger-tests.ts
+++ b/redux-logger/redux-logger-tests.ts
@@ -13,7 +13,9 @@ let loggerSimpleOpts = createLogger({
   predicate: (getState, action) => true,
   stateTransformer: (state) => state,
   actionTransformer: (action) => action,
-  errorTransformer: (error) => error
+  errorTransformer: (error) => error,
+  diff: true,
+  diffPredicate: (getState, action) => true,
 });
 
 let loggerCollapsedBool = createLogger({
diff --git a/redux-logger/redux-logger.d.ts b/redux-logger/redux-logger.d.ts
index f97ff95447..53f7718de1 100644
--- a/redux-logger/redux-logger.d.ts
+++ b/redux-logger/redux-logger.d.ts
@@ -40,6 +40,8 @@ declare module 'redux-logger' {
     stateTransformer?: (state: any) => any;
     actionTransformer?: (action: any) => any;
     errorTransformer?: (error: any) => any;
+    diff?: boolean;
+    diffPredicate?: LoggerPredicate;
   }
 
   // Trickery to get TypeScript to accept that our anonymous, non-default export is a function.

From ab66857cff995a58524c5f450db63e41ba3ecf9d Mon Sep 17 00:00:00 2001
From: psnider <psnider@users.noreply.github.com>
Date: Sat, 18 Jun 2016 20:41:51 -0700
Subject: [PATCH 169/278] Seneca (#9700)

* Added Error to support stack

* initial seneca.d.ts
---
 seneca/seneca-tests.ts | 131 +++++++++++++++++++++++
 seneca/seneca.d.ts     | 231 +++++++++++++++++++++++++++++++++++++++++
 2 files changed, 362 insertions(+)
 create mode 100644 seneca/seneca-tests.ts
 create mode 100644 seneca/seneca.d.ts

diff --git a/seneca/seneca-tests.ts b/seneca/seneca-tests.ts
new file mode 100644
index 0000000000..9bc411525f
--- /dev/null
+++ b/seneca/seneca-tests.ts
@@ -0,0 +1,131 @@
+/// <reference path='../node/node.d.ts' />
+/// <reference path='seneca.d.ts' />
+
+/*
+* This file contains all of the example code that was on http://senecajs.org as of Mon June 16, 2016.
+*/
+
+import SENECA = require('seneca')
+var seneca = SENECA()
+
+seneca.add({ cmd: 'salestax' }, function (args, callback) {
+  var rate  = 0.23
+  var total = args.net * (1 + rate)
+  callback(null, { total: total })
+})
+
+seneca.act({ cmd: 'salestax', net: 100 }, function (err, result) {
+  console.log(result.total)
+})
+
+
+
+seneca.add({ cmd: 'config' }, function (args, callback) {
+  var config: any = {     // any added here due to following config[] access
+    rate: 0.23
+  }
+  var value = config[args.prop]
+  callback(null, { value: value })
+})
+
+seneca.add({ cmd: 'salestax' }, function (args, callback) {
+  seneca.act({ cmd: 'config', prop: 'rate' }, function (err, result) {
+    var rate  = parseFloat(result.value)
+    var total = args.net * (1 + rate)
+    callback(null, { total: total })
+  })
+})
+
+seneca.act({ cmd: 'salestax', net: 100 }, function (err, result) {
+  console.log(result.total)
+})
+
+
+
+
+seneca.act('cmd:salestax,net:100', function (err, result) {
+  console.log(result.total)
+})
+
+
+
+
+seneca.act('cmd:salestax', { net: 100 }, function (err, result) {
+  console.log(result.total)
+})
+
+
+
+seneca.add({ cmd: 'config' }, function (args, callback) {
+    var config: any = {     // any added here due to following config[] access
+    rate: 0.23
+  }
+  var value = config[args.prop]
+  callback(null, { value: value })
+})
+
+seneca.listen()
+
+
+
+seneca.add({ cmd: 'salestax' }, function (args, callback) {
+  seneca.act({cmd: 'config', prop: 'rate' }, function (err, result) {
+    var rate  = parseFloat(result.value)
+    var total = args.net * (1 + rate)
+    callback(null, { total: total })
+  })
+})
+
+seneca.client()
+
+seneca.act('cmd:salestax,net:100', function (err, result) {
+  console.log(result.total)
+})
+
+
+
+// fixed rate
+seneca.add({ cmd: 'salestax' }, function (args, callback) {
+  var rate  = 0.23
+  var total = args.net * (1 + rate)
+  callback(null, { total: total })
+})
+
+
+// local rates
+seneca.add({ cmd: 'salestax', country: 'US' }, function (args, callback) {
+  var state: any = {     // any added here due to following state[] access
+    'NY': 0.04,
+    'CA': 0.0625
+    // ...
+  }
+  var rate = state[args.state]
+  var total = args.net * (1 + rate)
+  callback(null, { total: total })
+})
+
+
+// categories
+seneca.add({ cmd: 'salestax', country: 'IE' }, function (args, callback) {
+  var category: any = {     // any added here due to following category[] access
+    'top': 0.23,
+    'reduced': 0.135
+    // ...
+  }
+  var rate = category[args.category]
+  var total = args.net * (1 + rate)
+  callback(null, { total: total })
+})
+
+
+seneca.act('cmd:salestax,net:100,country:DE', function (err, result) {
+  console.log('DE: ' + result.total)
+})
+
+seneca.act('cmd:salestax,net:100,country:US,state:NY', function (err, result) {
+  console.log('US,NY: ' + result.total)
+})
+
+seneca.act('cmd:salestax,net:100,country:IE,category:reduced', function (err, result) {
+  console.log('IE: ' + result.total)
+})
diff --git a/seneca/seneca.d.ts b/seneca/seneca.d.ts
new file mode 100644
index 0000000000..08fd71859d
--- /dev/null
+++ b/seneca/seneca.d.ts
@@ -0,0 +1,231 @@
+// Type definitions for seneca v2.1.0
+// Project: https://www.npmjs.com/package/seneca
+// Definitions by: Peter Snider <https://github.com/psnider/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped/seneca
+
+
+declare module "seneca" {
+
+    type UnknownType = any;
+
+
+    // function s(options?: Options): Seneca;
+
+
+    // what does seneca do about logging?
+    function log(): void;
+
+
+    // module s {
+
+        interface Options {
+            [plugin_name: string]: any;
+            tag?: string;
+            // Standard length of identifiers for actions.
+            idlen?: number;
+            // Standard timeout for actions.
+            timeout?: number;   // milliseconds
+            // Register (true) default plugins. Set false to not register when
+            // using custom versions.
+            default_plugins?: {
+                basic?:       boolean;
+                'mem-store'?: boolean;
+                transport?:   boolean;
+                web?:         boolean;
+            };
+            // Settings for network REPL.
+            repl?: {
+                port?: number;
+                host?: string;
+            };
+            // Debug settings.
+            debug?: {
+                // Throw (some) errors from seneca.act.
+                fragile?:    boolean;
+                // Fatal errors ... aren't fatal. Not for production!
+                undead?:     boolean;
+                // Print debug info to console
+                print?: {
+                    // Print options. Best used via --seneca.print.options.
+                    options?: boolean;
+                };
+                // Trace action caller and place in args.caller$.
+                act_caller?: boolean;
+                // Shorten all identifiers to 2 characters.
+                short_logs?: boolean;
+                // Record and log callpoints (calling code locations).
+                callpoint?: boolean;
+            };
+            // Enforce strict behaviours. Relax when backwards compatibility needed.
+            strict?: {
+                // Action result must be a plain object.
+                result?: boolean;
+                // Delegate fixedargs override action args.
+                fixedargs?: boolean;
+                // Adding a pattern overrides existing pattern only if matches exactly.
+                add?: boolean;
+            };
+            // Action cache. Makes inbound messages idempotent.
+            actcache?: {
+                active?: boolean;
+                size?:   number;
+            };
+            // Action executor tracing. See gate-executor module.
+            trace?: {
+                act?: boolean;
+                stack?: boolean;
+                unknown?: string;
+            },
+            // Action statistics settings. See rolling-stats module.
+            stats?: {
+                size?: number;
+                interval?: number;
+                running?: boolean;
+            };
+            // Wait time for plugins to close gracefully.
+            deathdelay?: number;
+            // Default seneca-admin settings.
+            // TODO: move to seneca-admin!
+            admin?: {
+                local?: boolean;
+                prefix?: string;
+            };
+            // Plugin settings
+            plugin?: any;
+            // Internal settings.
+            internal?: {
+                // Close instance on these signals, if true.
+                close_signals?: {
+                    SIGHUP?: boolean;
+                    SIGTERM?: boolean;
+                    SIGINT?: boolean;
+                    SIGBREAK?: boolean;
+                };
+                actrouter?: UnknownType;
+                clientrouter?: UnknownType;
+                subrouter?: UnknownType;
+            };
+            // Log status at periodic intervals.
+            status?: {
+                interval?: number;
+                // By default, does not run.
+                running?: boolean;
+            },
+            // zig module settings for seneca.start() chaining.
+            zig?: any;
+            log?: {
+                short?: boolean;
+            };
+            errhandler?: GlobalErrorHandler;
+        }
+
+        interface MinimalPattern {
+            //role?: string;
+            //cmd?: string;
+        }
+
+        interface Optioner {
+          set: (input: string | Options) => Options;
+          get: () => Options;
+        }
+
+        type ExecutorWorker = (callback: any) => void;
+        type ExecutorCallback = (err: Error, result: any) => void;
+        interface Executor {
+            id: string;
+            desc: string;
+            fn: ExecutorWorker;
+            cb: ExecutorCallback;
+            gate: boolean;
+            ungate: boolean;
+            execute: UnknownType;
+        }
+
+        interface PluginOptions {
+        }
+        type PluginModule = (options: any) => void;
+
+        interface ClientOptions {
+        }
+
+        interface ListenOptions {
+        }
+
+        interface EntityDataWithQuery {
+            [entityKey: string]: any;
+            id?: string;
+            sort$?: any;
+        }
+
+
+
+        type Pattern = string | MinimalPattern;
+        type GlobalErrorHandler = (error: Error) => void;
+        type AddCallback = (msg: any, respond: (error: Error, msg: any) => void) => void;
+        type ActCallback = (error: Error, result: any) => void;
+        type CloseCallback = (optional: any, done: (error: Error) => void) => void;
+        type DatabaseID = string;
+        type EntitySaveCallback = (error: Error, result: any) => void;
+        type EntityLoadCallback = (error: Error, result: any) => void;
+        type EntityRemoveCallback = (error: Error) => void;
+        type EntityListCallback = (error: Error, result: any[]) => void;
+
+
+        interface Seneca {
+            version: string;
+
+            (options?: Options): Seneca;
+            options(options: Options): void;
+
+            error(handler: GlobalErrorHandler): void;
+            on(eventName: string, callback: (error: Error) => void): any;
+            close(callback: CloseCallback): void;
+            use(module: PluginModule, options?: PluginOptions): this;
+            use(name: string, options?: PluginOptions): this;
+            client(options?: ClientOptions): this;
+            listen(options?: ListenOptions): this;
+
+            ready(callback: (error: Error) => void): void;
+
+            add(pattern: Pattern, action: AddCallback): this;
+            add(pattern: Pattern, paramspec: any, action: AddCallback): this;
+            act(pattern: Pattern, respond: ActCallback): void;
+            act(pattern: Pattern, msg: any, respond: ActCallback): void;
+            make(entity_canon: string, properties?: any): Entity;
+            make(base: string, entity_canon: string, properties?: any): Entity;
+            make(zone: string, base: string, entity_canon: string, properties?: any): Entity;
+
+            // @param name reference to plugin provided object
+            export(name: string): void;
+
+            pin(pattern: Pattern): void;
+        }
+
+
+        // NOTE: senecas documented use of:
+        //    var product = seneca.make('product')
+        //    product.name = 'Apple'
+        // causes this error: error TS2339: Property 'name' does not exist on type 'Entity'.
+        // Change such references to: product['name']
+        interface Entity {
+            (canon: any, seneca: any): void;
+            [fieldname: string]: any;
+            // there appear to be many more variants of make$(), but its unclear that they are intended for the public API
+            make$(): Entity;
+            make$(name: string): Entity;
+            make$(base: string, name: string): Entity;
+            make$(zone: string, base: string, name: string): Entity;
+
+            save$(callback: EntitySaveCallback): void;
+            save$(props: EntityDataWithQuery, callback: EntitySaveCallback): void;
+            load$(id: DatabaseID | EntityDataWithQuery, callback: EntityLoadCallback): void;
+            remove$(id: DatabaseID | EntityDataWithQuery, callback: EntityRemoveCallback): void;
+            list$(query: EntityDataWithQuery, callback: EntityListCallback): void;
+        }
+
+    // }
+
+    var sen: Seneca
+    export = sen;
+
+}

From b50ccc2baf58b675507b58a5e8c26706db4fc606 Mon Sep 17 00:00:00 2001
From: Will <paradox41@users.noreply.github.com>
Date: Sat, 18 Jun 2016 23:42:22 -0400
Subject: [PATCH 170/278] fix typo in Chartist (#9701)

Signed-off-by: Will Soto <will.soto9@gmail.com>
---
 chartist/chartist.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/chartist/chartist.d.ts b/chartist/chartist.d.ts
index 6c679dc1d8..0e92364812 100644
--- a/chartist/chartist.d.ts
+++ b/chartist/chartist.d.ts
@@ -105,7 +105,7 @@ declare namespace Chartist {
     plugins?: Array<any>; // all of these plugins seem to be functions with options, but keeping type any for now
 
     update(data: Object, options?: T, override?: boolean): void;
-    detatch(): void;
+    detach(): void;
 
     /**
      * Use this function to register event handlers. The handler callbacks are synchronous and will run in the main thread rather than the event loop.

From b8c3b83eadf2261c2519dda50df569777f9fcb9d Mon Sep 17 00:00:00 2001
From: Hagai <hagai26@users.noreply.github.com>
Date: Sun, 19 Jun 2016 06:42:34 +0300
Subject: [PATCH 171/278] Leaflet markercluster update (#9672)

* maxClusterRadius can be a function

* Add chunk parameters
Add zoomToShowLayer function

* typescript class should have a 'constructor' function not 'initialize' function

* forgot newline

* fix the tests
---
 .../leaflet-markercluster.d.ts                | 25 ++++++++++++++++---
 1 file changed, 21 insertions(+), 4 deletions(-)

diff --git a/leaflet-markercluster/leaflet-markercluster.d.ts b/leaflet-markercluster/leaflet-markercluster.d.ts
index c9a3140fda..7d8757be03 100644
--- a/leaflet-markercluster/leaflet-markercluster.d.ts
+++ b/leaflet-markercluster/leaflet-markercluster.d.ts
@@ -51,9 +51,10 @@ declare namespace L {
 
       /*
       * The maximum radius that a cluster will cover from the central marker (in pixels). Default 80.
-      * Decreasing will make more, smaller clusters.
+      * Decreasing will make more, smaller clusters. You can also use a function that accepts 
+      * the current map zoom and returns the maximum cluster radius in pixels
       */
-      maxClusterRadius?: number;
+      maxClusterRadius?: number | ((zoom: number) => number);
 
       /*
       * Options to pass when creating the L.Polygon(points, options) to show the bounds of a cluster.
@@ -82,11 +83,21 @@ declare namespace L {
       * Function used to create the cluster icon
       */
       iconCreateFunction?: any;
+
+      /*
+      * Boolean to split the addLayers processing in to small intervals so that the page does not freeze.
+      */
+      chunkedLoading?: boolean;
+
+      /*
+      * Time delay (in ms) between consecutive periods of processing for addLayers. Default to 50ms.
+      */
+      chunkDelay?: number;
     }
 
     export class MarkerClusterGroup extends FeatureGroup<ILayer> {
-      initialize(): void;
-      initialize(options: MarkerClusterGroupOptions): void;
+      constructor();
+      constructor(options: MarkerClusterGroupOptions);
 
       /*
       * Bulk methods for adding and removing markers and should be favoured over the
@@ -121,5 +132,11 @@ declare namespace L {
       * Returns the array of total markers contained within that cluster.
       */
       getAllChildMarkers(): Marker[];
+
+      /*
+      * Zooms to show the given marker (spiderfying if required), 
+      * calls the callback when the marker is visible on the map.
+      */	  
+      zoomToShowLayer(layer: any, callback: () => void): void;
     }
 }

From 29708b6a46a61274d2d402d336ef60c697085b64 Mon Sep 17 00:00:00 2001
From: psnider <psnider@users.noreply.github.com>
Date: Sat, 18 Jun 2016 20:43:23 -0700
Subject: [PATCH 172/278] Geojson (#9702)

* Added Error to support stack

* initial seneca.d.ts

* Changed type of Position to be compatible with other packages

such as turf
---
 geojson/geojson-tests.ts | 7 ++++++-
 geojson/geojson.d.ts     | 5 +----
 2 files changed, 7 insertions(+), 5 deletions(-)

diff --git a/geojson/geojson-tests.ts b/geojson/geojson-tests.ts
index ce38b654b2..75cf6ffd54 100644
--- a/geojson/geojson-tests.ts
+++ b/geojson/geojson-tests.ts
@@ -72,6 +72,11 @@ var point: GeoJSON.Point = {
 	coordinates: [100.0, 0.0]
 };
 
+
+// This type is commonly used in the turf package
+var pointCoordinates: number[] = point.coordinates
+
+
 var lineString: GeoJSON.LineString = {
 	type: "LineString",
 	coordinates: [ [100.0, 0.0], [101.0, 1.0] ]
@@ -126,4 +131,4 @@ var geometryCollection: GeoJSON.GeometryCollection = {
             coordinates: [ [101.0, 0.0], [102.0, 1.0] ]
         }
     ]
-}
\ No newline at end of file
+}
diff --git a/geojson/geojson.d.ts b/geojson/geojson.d.ts
index 4b4c2b56cf..38715a9a27 100644
--- a/geojson/geojson.d.ts
+++ b/geojson/geojson.d.ts
@@ -18,10 +18,7 @@ declare namespace GeoJSON {
     /***
     * http://geojson.org/geojson-spec.html#positions
     */
-    export interface Position
-    {
-        [index: number]: number;
-    }
+    export type Position = number[]
 
     /***
     * http://geojson.org/geojson-spec.html#geometry-objects

From c2bb7dd9b74e75e8683714974a2c61b86ef865fa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Gr=C3=A9goire=20Castre?= <gcastre@users.noreply.github.com>
Date: Sun, 19 Jun 2016 05:47:16 +0200
Subject: [PATCH 173/278] Rewrite the globalize.d.ts adding all the missing
 function and their comments (#6266)

---
 globalize/globalize.d.ts | 336 +++++++++++++++++++++++++++++++++++++--
 1 file changed, 319 insertions(+), 17 deletions(-)

diff --git a/globalize/globalize.d.ts b/globalize/globalize.d.ts
index 8eeec964eb..d3bf7997d5 100644
--- a/globalize/globalize.d.ts
+++ b/globalize/globalize.d.ts
@@ -1,28 +1,330 @@
-// Type definitions for Globalize
+// Type definitions for Globalize
 // Project: https://github.com/jquery/globalize
-// Definitions by: Aram Taieb <https://github.com/afromogli/>
-// Definitions: https://github.com/afromogli/DefinitelyTyped
+// Definitions by: Grégoire Castre <https://github.com/gcastre/>, Aram Taieb <https://github.com/afromogli/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+// Note: You'll need the cldr.js definition file to use the globalize (https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/cldr.js)
 
-interface NumberFormatterOptions {
-   minimumIntegerDigits?: number;
-   minimumFractionDigits?: number;
-   maximumFractionDigits?: number;
-   minimumSignificantDigits?: number;
-   maximumSignificantDigits?: number;
-   round?: string;
-   useGrouping?: boolean;
+/// <reference path="../cldr.js/cldr.js.d.ts" />
+
+interface DateFormatterOptions {
+	/**
+	 * String value indicating a skeleton (see description above), eg. { skeleton: "GyMMMd" }.
+	 * Skeleton provides a more flexible formatting mechanism than the predefined list full, long, medium, or short represented by date, time, or datetime.
+	 * Instead, they are an open-ended list of patterns containing only date field information, and in a canonical order.
+	 */
+	skeleton?: string;
+	/**
+	 * One of the following String values: full, long, medium, or short, eg. { date: "full" }.
+	 */
+	date?: "full" | "long" | "medium" | "short";
+	/**
+	 * One of the following String values: full, long, medium, or short, eg. { time: "full" }.
+	 */
+	time?: "full" | "long" | "medium" | "short";
+	/**
+	 * One of the following String values: full, long, medium, or short, eg. { datetime: "full" }
+	 */
+	datetime?: "full" | "long" | "medium" | "short";
+	/**
+	 * String value indicating a machine raw pattern (anything in the "Sym." column) eg. { raw: "dd/mm" }.
+	 * Note this is NOT recommended for i18n in general. Use skeleton instead.
+	 */
+	raw?: string;
 }
 
-interface Cldr {
-   /* TODO: add typings */
+interface CommonNumberFormatterOptions {
+	/**
+	 * Non-negative integer Number value indicating the minimum integer digits to be used. Numbers will be padded with leading zeroes if necessary.
+	 */
+	minimumIntegerDigits?: number;
+	/**
+	 * Non-negative integer Number values indicating the minimum and maximum fraction digits to be used.
+	 * Numbers will be rounded or padded with trailing zeroes if necessary.
+	 * Either one or both of these properties must be present.
+	 * If they are, they will override minimum and maximum fraction digits derived from the CLDR patterns.
+	 */
+	minimumFractionDigits?: number;
+	/**
+	 * Non-negative integer Number values indicating the minimum and maximum fraction digits to be used.
+	 * Numbers will be rounded or padded with trailing zeroes if necessary.
+	 * Either one or both of these properties must be present.
+	 * If they are, they will override minimum and maximum fraction digits derived from the CLDR patterns.
+	 */
+	maximumFractionDigits?: number;
+	/**
+	 * Positive integer Number values indicating the minimum and maximum fraction digits to be shown.
+	 * Either none or both of these properties are present
+	 * If they are, they override minimum and maximum integer and fraction digits.
+	 * The formatter uses however many integer and fraction digits are required to display the specified number of significant digits.
+	 */
+	minimumSignificantDigits?: number;
+	/**
+	 * Positive integer Number values indicating the minimum and maximum fraction digits to be shown.
+	 * Either none or both of these properties are present.
+	 * If they are, they override minimum and maximum integer and fraction digits.
+	 * The formatter uses however many integer and fraction digits are required to display the specified number of significant digits.
+	 */
+	maximumSignificantDigits?: number;
+	/**
+	 * String with rounding method ceil, floor, round (default), or truncate.
+	 */
+	round?: "ceil" | "floor" | "round" | "truncate";
+	/**
+	 * Boolean (default is true) value indicating whether a grouping separator should be used.
+	 */
+	useGrouping?: boolean;
+}
+
+interface NumberFormatterOptions extends CommonNumberFormatterOptions {
+	/**
+	 * decimal (default), or percent
+	 */
+	style?: "decimal" | "percent";
+}
+
+interface CurrencyFormatterOptions extends CommonNumberFormatterOptions {
+	/**
+	 * symbol (default), accounting, code or name.
+	 */
+	style?: "symbol" | "accounting" | "code" | "name";
+}
+
+interface NumberParserOptions {
+	/**
+	 * decimal (default), or percent.
+	 */
+	style?: "decimal" | "percent";
+}
+
+interface PluralGeneratorOptions {
+	/**
+	 * cardinal (default), or ordinal.
+	 */
+	type?: "cardinal" | "ordinal";
+}
+
+interface RelativeTimeFormatterOptions {
+	/**
+	 * eg. "short" or "narrow". Or falsy for default long form
+	 */
+	form?: "short" | "narrow";
+}
+
+interface UnitFormatterOptions {
+	/**
+	 * form: [String] eg. "long", "short" or "narrow".
+	 */
+	form?: "long" | "short" | "narrow";
+
+	/**
+	 * numberFormatter: [Function] a number formatter function. Defaults to Globalize .numberFormatter() for the current locale using the default options.
+	 */
+	numberFormatter?: NumberFormatterOptions;
 }
 
 interface GlobalizeStatic {
-   load(jsonData: any): void;
-   locale(locale: string): Cldr;
 
-   numberFormatter(options?: NumberFormatterOptions): (value: number) => string;
-   formatNumber(value:number, options?: NumberFormatterOptions): string;
+	cldr: cldr.CldrStatic;
+
+	/**
+	 * Globalize.load( json, ... )
+	 * @param {Object} [JSON]
+	 * Load resolved or unresolved cldr data.
+	 * Somewhat equivalent to previous Globalize.addCultureInfo(...).
+	 */
+	load(json: Object): void;
+
+	/**
+	 * Globalize.locale()
+	 * Return the default Cldr instance.
+	 */
+	locale(): cldr.CldrStatic;
+
+	/**
+	 * Globalize.locale( [locale] )
+	 * @param {string} locale
+	 * Set default Cldr instance
+	 * Return the default Cldr instance.
+	 */
+
+	locale(locale: string): cldr.CldrStatic;
+	/**
+	 * Globalize.locale( cldr )
+	 * @param {Cldr} cldr [Cldr instance]
+	 * Set default Cldr instance
+	 * Return the default Cldr instance.
+	 */
+	locale(cldr: cldr.CldrStatic): cldr.CldrStatic;
+
+	/**
+	 * .dateFormatter( options )
+	 * @param {DateFormatterOptions} options see date/expand_pattern for more info.
+	 * @returns {Function} Return a function that formats a date according to the given `options` and the default/instance locale.
+	 */
+	dateFormatter(options?: DateFormatterOptions): (value: Date) => string;
+
+	//Return a function that parses a string representing a date into a JavaScript Date object according to the given options. The default parsing assumes numeric year, month, and day (i.e., { skeleton: "yMd" }).
+	dateParser(options?: DateFormatterOptions): (value: string) => Date;
+
+	//Alias for .dateFormatter( [options] )( value ).
+	formatDate(value: Date, options?: DateFormatterOptions): string;
+	/**
+	 * Alias for .dateParser( [options] )( value ).
+	 * @param {string} value The object whose module id you wish to determine.
+	 * @param {DateFormatterOptions} options The object whose module id you wish to determine.
+	 * @returns {Date} Return the value as a Date.
+	 */
+	parseDate(value: string, options?: DateFormatterOptions): Date;
+
+	/**
+	 * Load messages data.
+	 * @param {Object} json JSON object of messages data. Keys can use any character, except /, { and }. Values (i.e., the message content itself) can contain any character.
+	 * @returns {void}
+	 */
+	loadMessages(json: Object): void;
+	/**
+	 * Return a function that formats a message (using ICU message format pattern) given its path and a set of variables into a user-readable string. It supports pluralization and gender inflections.
+	 * @param path String or Array containing the path of the message content, eg. "greetings/bye", or [ "greetings", "bye" ].
+	 * @returns {Function} Return A function that formats a message (using ICU message format pattern) given its path and a set of variables into a user-readable string. It supports pluralization and gender inflections.
+	 */
+	messageFormatter(path: string | string[]): (variables?: string | string[] | Object) => string;
+
+	/**
+	 * Formats a message (using ICU message format pattern) given its path and a set of variables into a user-readable string
+	 * @param path String or Array containing the path of the message content, eg. "greetings/bye", or [ "greetings", "bye" ].
+	 * @param variables Variables can be Objects, where each property can be referenced by name inside a message; or Arrays, where each entry of the Array can be used inside a message, using numeric indices. When passing one or more arguments of other types, they're converted to an Array and used as such.
+	 * @returns {string} Return a user-readable string.
+	 */
+	formatMessage(path: string | string[], variables?: string | string[] | Object): string
+
+	/**
+	 * Return a function that formats a number according to the given options or locale's defaults.
+	 * @param {NumberFormatterOptions} options A JSON object including none or any of the following options.
+	 * style Optional String decimal (default), or percent.
+	 * minimumIntegerDigits Optional Non-negative integer Number value indicating the minimum integer digits to be used. Numbers will be padded with leading zeroes if necessary.
+	 * minimumFractionDigits and maximumFractionDigits Optional Non-negative integer Number values indicating the minimum and maximum fraction digits to be used. Numbers will be rounded or padded with trailing zeroes if necessary. Either one or both of these properties must be present. If they are, they will override minimum and maximum fraction digits derived from the CLDR patterns.
+	 * minimumSignificantDigits and maximumSignificantDigits Optional Positive integer Number values indicating the minimum and maximum fraction digits to be shown. Either none or both of these properties are present. If they are, they override minimum and maximum integer and fraction digits. The formatter uses however many integer and fraction digits are required to display the specified number of significant digits.
+	 * round Optional String with rounding method ceil, floor, round (default), or truncate.
+	 * useGrouping Optional Boolean (default is true) value indicating whether a grouping separator should be used.
+	 * @returns {Function} Return a function that formats a number according to the given options.
+	 */
+	numberFormatter(options?: NumberFormatterOptions): (value: number) => string;
+
+	/**
+	 * Return a function that parses a string representing a number according to the given options or locale's defaults.
+	 * @param {NumberParserOptions} options A JSON object including none or any of the following options.
+	 * style Optional String decimal (default), or percent.
+	 * @returns {Function} Return a function that parses a String representing a number according to the given options. If value is invalid, NaN is returned.
+	 */
+	numberParser(options?: NumberParserOptions): (value: string) => number
+
+	/**
+	 * Return a number formatted according to the given options or locale's defaults.
+	 * @param {number} value The number to format
+	 * @param {NumberFormatterOptions} options A JSON object including none or any of the following options.
+	 * style Optional String decimal (default), or percent.
+	 * minimumIntegerDigits Optional Non-negative integer Number value indicating the minimum integer digits to be used. Numbers will be padded with leading zeroes if necessary.
+	 * minimumFractionDigits and maximumFractionDigits Optional Non-negative integer Number values indicating the minimum and maximum fraction digits to be used. Numbers will be rounded or padded with trailing zeroes if necessary. Either one or both of these properties must be present. If they are, they will override minimum and maximum fraction digits derived from the CLDR patterns.
+	 * minimumSignificantDigits and maximumSignificantDigits Optional Positive integer Number values indicating the minimum and maximum fraction digits to be shown. Either none or both of these properties are present. If they are, they override minimum and maximum integer and fraction digits. The formatter uses however many integer and fraction digits are required to display the specified number of significant digits.
+	 * round Optional String with rounding method ceil, floor, round (default), or truncate.
+	 * useGrouping Optional Boolean (default is true) value indicating whether a grouping separator should be used.
+	 * @returns {string} Return the number formatted
+	 */
+	formatNumber(value: number, options?: NumberFormatterOptions): string;
+
+	/**
+	 * A function that parses a string representing a number according to the given options or locale's defaults.
+	 * @param {string} value The number as string to parse
+	 * @param {NumberParserOptions} options A JSON object including none or any of the following options.
+	 * style Optional String decimal (default), or percent.
+	 * @returns {number} Return a number according to the given options. If value is invalid, NaN is returned.
+	 */
+	parseNumber(value: string, options?: NumberParserOptions): number;
+
+	/**
+	 * Return a function that formats a currency according to the given options or locale's defaults.
+	 * The returned function is invoked with one argument: the Number value to be formatted.
+	 * @param {string} currency 3-letter currency code as defined by ISO 4217, eg. USD.
+	 * @param {CurrencyFormatterOptions} options A JSON object including none or any of the following options.
+	 * @returns {Function} Return a function that formats a currency
+	 */
+	currencyFormatter(currency: string, options?: CurrencyFormatterOptions): (value: number) => string;
+
+	/**
+	 * Return a currency formatted according to the given options or locale's defaults.
+	 * @param {number} value The value to format.
+	 * @param {string} currency 3-letter currency code as defined by ISO 4217, eg. USD.
+	 * @param {CurrencyFormatterOptions} options A JSON object including none or any of the following options.
+	 * @returns {string} Return a string formatted in the currency according to the value and the options
+	 */
+	formatCurrency(value: number, currency: string, options?: CurrencyFormatterOptions): string;
+
+	/**
+	 * Return a function that returns the value's corresponding plural group: zero, one, two, few, many, or other.
+	 * The returned function is invoked with one argument: the Number value for which to return the plural group.
+	 * @param {PluralGeneratorOptions} options A JSON object including none or any of the following options.
+	 * type Optional String cardinal (default), or ordinal.
+	 * @returns {Function} Return a function that returns the value's corresponding plural group: zero, one, two, few, many, or other.
+	 */
+	pluralGenerator(options?: PluralGeneratorOptions): (value: number) => string;
+
+	/**
+	 * Returns the value's corresponding plural group: zero, one, two, few, many, or other.
+	 * @param {number} value A Number for which to return the plural group.
+	 * @param {PluralGeneratorOptions} options A JSON object including none or any of the following options.
+	 * type Optional String cardinal (default), or ordinal.
+	 * @returns {string} Returns the value's corresponding plural group: zero, one, two, few, many, or other.
+	 */
+	plural(value: number, options?: PluralGeneratorOptions): string;
+
+	/**
+	 * Returns a function that formats a relative time according to the given unit, options, and the default/instance locale.
+	 * The returned function is invoked with one argument: the number value to be formatted.
+	 * @param unit String value indicating the unit to be formatted. eg. "day", "week", "month", etc.
+	 * @param options form: [String] eg. "short" or "narrow". Or falsy for default long form.
+	 * @returns {Function} Returns a function that formats a relative time according to the given unit.
+	 */
+	relativeTimeFormatter(unit: string, options?: RelativeTimeFormatterOptions): (value: number) => string;
+
+	/**
+	 * Return a relative time according to the given unit
+	 * @param {number} value The number to be formatted.
+	 * @param {string} unit String value indicating the unit to be formatted. eg. "day", "week", "month", etc.
+	 * @param options form: [String] eg. "short" or "narrow". Or falsy for default long form.
+	 * @returns {string} Return a relative time according to the given unit.
+	 */
+	formatRelativeTime(value: number, unit: string, options?: RelativeTimeFormatterOptions): string;
+
+	/**
+	 * Returns a function that formats a unit according to the given unit, options, and the default/instance locale.
+	 * The returned function is invoked with one argument: the number value to be formatted.
+	 * @param unit String value indicating the unit to be formatted. eg. "day", "week", "month", etc. Could also be a compound unit, eg. "mile-per-hour" or "mile/hour"
+	 * @param options form: [String] eg. "long", "short" or "narrow".
+	 * @returns {Function} Returns a function that formats a unit according to the given unit, options, and the default/instance locale.
+	 */
+	unitFormatter(unit: string, options?: UnitFormatterOptions): (value: number) => string;
+
+	/**
+	 * Alias for .unitFormatter( unit, options )( value ).
+	 * @param {number} value The number to be formatted.
+	 * @param {string} unit String value indicating the unit to be formatted. eg. "day", "week", "month", etc. Could also be a compound unit, eg. "mile-per-hour" or "mile/hour"
+	 * @param {UnitFormatterOptions} options form: [String] eg. "long", "short" or "narrow".
+	 * @returns {string} Returns the unit formatted.
+	 */
+	formatUnit(value: number, unit: string, options?: UnitFormatterOptions): string
+
+	/**
+	 * Create a Globalize instance.
+	 * @param {string} Locale string of the instance.
+	 * @returns {Globalize} A Globalize instance
+	 */
+	new (locale: string): GlobalizeStatic;
+	/**
+	 * Create a Globalize instance.
+	 * @param cldr Cldr instance of the instance.
+	 * @returns {Globalize} A Globalize instance
+	 */
+	new (cldr: cldr.CldrStatic): GlobalizeStatic;
 }
 
 declare var Globalize: GlobalizeStatic;

From 06a49b2445d2e1c7fdd52ef3f426ac6528d9b760 Mon Sep 17 00:00:00 2001
From: Milan Burda <milan.burda@gmail.com>
Date: Sun, 19 Jun 2016 05:48:13 +0200
Subject: [PATCH 174/278] Update to Electron 1.2.3 (#9685)

---
 github-electron/github-electron-main-tests.ts | 35 ++++++++-
 github-electron/github-electron.d.ts          | 73 +++++++++++++++++--
 2 files changed, 97 insertions(+), 11 deletions(-)

diff --git a/github-electron/github-electron-main-tests.ts b/github-electron/github-electron-main-tests.ts
index c1a1fbfaf0..9a75f9699e 100644
--- a/github-electron/github-electron-main-tests.ts
+++ b/github-electron/github-electron-main-tests.ts
@@ -322,6 +322,11 @@ app.on('login', function(event, webContents, request, authInfo, callback) {
 	callback('username', 'secret');
 });
 
+var win = new BrowserWindow({show: false})
+win.once('ready-to-show', () => {
+	win.show();
+});
+
 app.relaunch({args: process.argv.slice(1).concat(['--relaunch'])});
 app.exit(0);
 
@@ -354,6 +359,8 @@ win.show();
 var toolbarRect = document.getElementById('toolbar').getBoundingClientRect();
 win.setSheetOffset(toolbarRect.height);
 
+var installed = BrowserWindow.getDevToolsExtensions().hasOwnProperty('devtron');
+
 // content-tracing
 // https://github.com/atom/electron/blob/master/docs/api/content-tracing.md
 
@@ -728,6 +735,8 @@ var image = clipboard.readImage();
 var appIcon3 = new Tray(image);
 var appIcon4 = new Tray('/Users/somebody/images/icon.png');
 
+let image2 = nativeImage.createFromPath('/Users/somebody/images/icon.png');
+
 // process
 // https://github.com/electron/electron/blob/master/docs/api/process.md
 
@@ -828,15 +837,23 @@ session.defaultSession.on('will-download', (event, item, webContents) => {
 	console.log(item.getFilename());
 	console.log(item.getTotalBytes());
 
-	item.on('updated', function() {
-		console.log('Received bytes: ' + item.getReceivedBytes());
+	item.on('updated', (event, state) => {
+		if (state === 'interrupted') {
+			console.log('Download is interrupted but can be resumed');
+		} else if (state === 'progressing') {
+			if (item.isPaused()) {
+				console.log('Download is paused');
+			} else {
+				console.log(`Received bytes: ${item.getReceivedBytes()}`);
+			}
+		}
 	});
 
 	item.on('done', function(e, state) {
 		if (state == "completed") {
 			console.log("Download successfully");
 		} else {
-			console.log("Download is cancelled or interrupted that can't be resumed");
+			console.log(`Download failed: ${state}`)
 		}
 	});
 });
@@ -884,3 +901,15 @@ session.defaultSession.webRequest.onBeforeSendHeaders(filter, function(details,
 	details.requestHeaders['User-Agent'] = "MyAgent";
 	callback({cancel: false, requestHeaders: details.requestHeaders});
 });
+
+app.on('ready', function () {
+	const protocol = session.defaultSession.protocol
+	protocol.registerFileProtocol('atom', function (request, callback) {
+		var url = request.url.substr(7);
+		callback({path: path.normalize(__dirname + '/' + url)});
+	}, function (error) {
+		if (error) {
+			console.error('Failed to register protocol');
+		}
+	})
+});
diff --git a/github-electron/github-electron.d.ts b/github-electron/github-electron.d.ts
index 00730cb680..f7dd206708 100644
--- a/github-electron/github-electron.d.ts
+++ b/github-electron/github-electron.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for Electron v1.2.2
+// Type definitions for Electron v1.2.3
 // Project: http://electron.atom.io/
 // Definitions by: jedmao <https://github.com/jedmao/>, rhysd <https://rhysd.github.io>, Milan Burda <https://github.com/miniak/>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -115,6 +115,10 @@ declare namespace Electron {
 		 * Emitted when a new browserWindow is created.
 		 */
 		on(event: 'browser-window-created', listener: (event: Event, browserWindow: BrowserWindow) => void): this;
+		/**
+		 * Emitted when a new webContents is created.
+		 */
+		on(event: 'web-contents-created', listener: (event: Event, webContents: WebContents) => void): this;
 		/**
 		 * Emitted when failed to verify the certificate for url, to trust the certificate
 		 * you should prevent the default behavior with event.preventDefault() and call callback(true).
@@ -344,7 +348,7 @@ declare namespace Electron {
 		dock: Dock;
 	}
 
-	type AppPathName = 'home'|'appData'|'userData'|'temp'|'exe'|'module'|'desktop'|'documents'|'downloads'|'music'|'pictures'|'videos';
+	type AppPathName = 'home'|'appData'|'userData'|'temp'|'exe'|'module'|'desktop'|'documents'|'downloads'|'music'|'pictures'|'videos'|'pepperFlashSystemPlugin';
 
 	interface ImportCertificateOptions {
 		/**
@@ -498,9 +502,8 @@ declare namespace Electron {
 		on(event: string, listener: Function): this;
 		/**
 		 * Set the url and initialize the auto updater.
-		 * The url cannot be changed once it is set.
 		 */
-		setFeedURL(url: string): void;
+		setFeedURL(url: string, requestHeaders?: Headers): void;
 		/**
 		 * Ask the server whether there is an update, you have to call setFeedURL
 		 * before using this API
@@ -559,6 +562,10 @@ declare namespace Electron {
 		 * Emitted when the window is hidden.
 		 */
 		on(event: 'hide', listener: Function): this;
+		/**
+		 * Emitted when the web page has been rendered and window can be displayed without visual flash.
+		 */
+		on(event: 'ready-to-show', listener: Function): this;
 		/**
 		 * Emitted when window is maximized.
 		 */
@@ -650,6 +657,10 @@ declare namespace Electron {
 		 * @param name The name of the devtools extension to remove.
 		 */
 		static removeDevToolsExtension(name: string): void;
+		/**
+		 * @returns devtools extensions.
+		 */
+		static getDevToolsExtensions(): DevToolsExtensions;
 		/**
 		 * The WebContents object this window owns, all web page related events and
 		 * operations would be done via it.
@@ -996,7 +1007,7 @@ declare namespace Electron {
 		 */
 		setThumbarButtons(buttons: ThumbarButton[]): boolean;
 		/**
-		 * Shows pop-up dictionary that searches the selected word on the page.
+		 * Same as webContents.showDefinitionForSelection().
 		 * Note: This API is available only on OS X.
 		 */
 		showDefinitionForSelection(): void;
@@ -1042,6 +1053,11 @@ declare namespace Electron {
 		 * but if this window has focus, it will still receive keyboard events.
 		 */
 		setIgnoreMouseEvents(ignore: boolean): void;
+		/**
+		 * Changes whether the window can be focused.
+		 * Note: This API is available only on Windows.
+		 */
+		setFocusable(focusable: boolean): void;
 	}
 
 	type SwipeDirection = 'up' | 'right' | 'down' | 'left';
@@ -1055,6 +1071,13 @@ declare namespace Electron {
 		flags?: ThumbarButtonFlags[];
 	}
 
+	interface DevToolsExtensions {
+		[name: string]: {
+			name: string;
+			value: string;
+		}
+	}
+
 	interface WebPreferences {
 		/**
 		 * Whether node integration is enabled.
@@ -1290,6 +1313,14 @@ declare namespace Electron {
 		 * Default: true.
 		 */
 		closable?: boolean;
+		/**
+		 * Whether the window can be focused.
+		 * On Windows setting focusable: false also implies setting skipTaskbar: true.
+		 * On Linux setting focusable: false makes the window stop interacting with wm,
+		 * so the window will always stay on top in all workspaces.
+		 * Default: true.
+		 */
+		focusable?: boolean;
 		/**
 		 * Whether the window should always stay on top of other windows.
 		 * Default: false.
@@ -1832,9 +1863,9 @@ declare namespace Electron {
 	 */
 	interface DownloadItem extends NodeJS.EventEmitter {
 		/**
-		 * Emits when the downloadItem gets updated.
+		 * Emitted when the download has been updated and is not done.
 		 */
-		on(event: 'updated', listener: Function): this;
+		on(event: 'updated', listener: (event: Event, state: 'progressing' | 'interrupted') => void): this;
 		/**
 		 * Emits when the download is in a terminal state. This includes a completed download,
 		 * a cancelled download (via downloadItem.cancel()), and interrupted download that can’t be resumed.
@@ -1852,10 +1883,18 @@ declare namespace Electron {
 		 * Pauses the download.
 		 */
 		pause(): void;
+		/**
+		 * @returns Whether the download is paused.
+		 */
+		isPaused(): boolean;
 		/**
 		 * Resumes the download that has been paused.
 		 */
 		resume(): void;
+		/**
+		 * @returns Whether the download can resume.
+		 */
+		canResume(): boolean;
 		/**
 		 * Cancels the download operation.
 		 */
@@ -1891,6 +1930,10 @@ declare namespace Electron {
 		 * @returns The Content-Disposition field from the response header.
 		 */
 		getContentDisposition(): string;
+		/**
+		 * @returns The current state.
+		 */
+		getState(): 'progressing' | 'completed' | 'cancelled' | 'interrupted';
 	}
 
 	// https://github.com/electron/electron/blob/master/docs/api/global-shortcut.md
@@ -2042,7 +2085,7 @@ declare namespace Electron {
 
 	type MenuItemType = 'normal' | 'separator' | 'submenu' | 'checkbox' | 'radio';
 	type MenuItemRole = 'undo' | 'redo' | 'cut' | 'copy' | 'paste' | 'pasteandmatchstyle' | 'selectall' | 'delete' | 'minimize' | 'close';
-	type MenuItemRoleMac = 'about' | 'hide' | 'hideothers' | 'unhide' | 'front' | 'window' | 'help' | 'services';
+	type MenuItemRoleMac = 'about' | 'hide' | 'hideothers' | 'unhide' | 'front' | 'zoom' | 'window' | 'help' | 'services';
 
 	interface MenuItemOptions {
 		/**
@@ -2635,6 +2678,10 @@ declare namespace Electron {
 		 * The webRequest API set allows to intercept and modify contents of a request at various stages of its lifetime.
 		 */
 		webRequest: WebRequest;
+		/**
+		 * @returns An instance of protocol module for this session.
+		 */
+		protocol: Protocol;
 	}
 
 	type Permission = 'media' | 'geolocation' | 'notifications' | 'midiSysex' | 'pointerLock' | 'fullscreen' | 'openExternal';
@@ -3643,6 +3690,11 @@ declare namespace Electron {
 		 * @returns If the process of saving page has been initiated successfully.
 		 */
 		savePage(fullPath: string, saveType: 'HTMLOnly' | 'HTMLComplete' | 'MHTML', callback?: (eror: Error) => void): boolean;
+		/**
+		 * Shows pop-up dictionary that searches the selected word on the page.
+		 * Note: This API is available only on OS X.
+		 */
+		showDefinitionForSelection(): void;
 		/**
 		 * @returns The unique ID of this WebContents.
 		 */
@@ -4428,6 +4480,11 @@ declare namespace Electron {
 		 * See webContents.sendInputEvent for detailed description of event object.
 		 */
 		sendInputEvent(event: SendInputEvent): void
+		/**
+		 * Shows pop-up dictionary that searches the selected word on the page.
+		 * Note: This API is available only on OS X.
+		 */
+		showDefinitionForSelection(): void;
 		/**
 		 * @returns The WebContents associated with this webview.
 		 */

From 45f506f0b91174a505c551c081265638c01177c9 Mon Sep 17 00:00:00 2001
From: psnider <psnider@users.noreply.github.com>
Date: Sat, 18 Jun 2016 21:15:29 -0700
Subject: [PATCH 175/278] Component emitter (#9708)

* Added Error to support stack

* initial seneca.d.ts

* Changed type of Position to be compatible with other packages

such as turf

* initial component-emitter.d.ts
---
 component-emitter/component-emitter-tests.ts | 52 ++++++++++++++++++++
 component-emitter/component-emitter.d.ts     | 19 +++++++
 2 files changed, 71 insertions(+)
 create mode 100644 component-emitter/component-emitter-tests.ts
 create mode 100644 component-emitter/component-emitter.d.ts

diff --git a/component-emitter/component-emitter-tests.ts b/component-emitter/component-emitter-tests.ts
new file mode 100644
index 0000000000..e6c6a5b1ab
--- /dev/null
+++ b/component-emitter/component-emitter-tests.ts
@@ -0,0 +1,52 @@
+/// <reference path='../node/node.d.ts' />   // only for require
+/// <reference path='component-emitter.d.ts' />
+// These are all of the examples from https://www.npmjs.com/package/component-emitter as of June 18, 2016
+
+
+// These are all of the examples from https://www.npmjs.com/package/component-emitter as of June 18, 2016
+
+var Emitter = require('component-emitter');
+var emitter = new Emitter;
+emitter.emit('something');
+
+
+
+
+var user = { name: 'tobi' };
+Emitter(user);
+
+(<Emitter>user).emit('im a user');
+
+
+
+// this example modified from the one on https://www.npmjs.com/package/component-emitter
+var User = Object.create({
+    someUserFunction: () => {console.log('someUserFunction called!')}
+})
+var another_user = Emitter(User);
+another_user.someUserFunction()
+another_user.on('hi', () => {console.log('Hi called')})
+another_user.emit('hi')
+
+
+// Additional sample code for this test
+function handleSomeRecurringEvent(event_data: any) {
+    console.log('handle some-recurring-event')
+}
+emitter.on('some-recurring-event', handleSomeRecurringEvent)
+
+
+emitter.once('some-single-shot-event', (event_data: any) => {console.log('handle some-single-shot-event')})
+
+
+emitter.off()
+emitter.off('some-recurring-event')
+emitter.off('some-recurring-event', handleSomeRecurringEvent)
+
+var event_data = {some: 'data'}
+emitter.emit('some-recurring-event')
+emitter.emit('some-recurring-event', event_data)
+
+emitter.listeners('some-recurring-event')
+
+emitter.hasListeners('some-recurring-event')
diff --git a/component-emitter/component-emitter.d.ts b/component-emitter/component-emitter.d.ts
new file mode 100644
index 0000000000..28ce4f4bc9
--- /dev/null
+++ b/component-emitter/component-emitter.d.ts
@@ -0,0 +1,19 @@
+// Type definitions for component-emitter v1.2.1
+// Project: https://www.npmjs.com/package/component-emitter
+// Definitions by: Peter Snider <https://github.com/psnider/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped/emitter-component
+
+
+interface Emitter {
+    (obj?: Object): Emitter;
+    on(event: string, listener: Function): Emitter;
+    once(event: string, listener: Function): Emitter;
+    off(event?: string, listener?: Function): Emitter;
+    emit(event: string, ...args: any[]): boolean;
+    listeners(event: string): Function[];
+    hasListeners(event: string): boolean;
+}
+
+declare module 'component-emitter' {
+    var Emitter: Emitter;
+}

From 25e96113abe923d867b1ad7093680c7f484d4339 Mon Sep 17 00:00:00 2001
From: Ben Weitzman <benweitzman@gmail.com>
Date: Sun, 19 Jun 2016 00:16:22 -0400
Subject: [PATCH 176/278] better type for negate (#9634)

Negate is a function that takes a function that returns a boolean and returns a function that returns a boolean. The current typing has negate taking a function and itself returning a boolean, which is incorrect.
---
 underscore/underscore.d.ts | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/underscore/underscore.d.ts b/underscore/underscore.d.ts
index 1986786629..fb7ff79437 100644
--- a/underscore/underscore.d.ts
+++ b/underscore/underscore.d.ts
@@ -3511,10 +3511,10 @@ interface UnderscoreStatic {
 
 	/**
 	* Returns a negated version of the pass-in predicate.
-	* @param Function predicate
-	* @return boolean
+	* @param (...args: any[]) => boolean predicate
+	* @return (...args: any[]) => boolean
 	**/
-	negate(predicate: Function): boolean;
+	negate(predicate: (...args: any[]) => boolean): (...args: any[]) => boolean;
 
 	/**
 	* Returns the composition of a list of functions, where each function consumes the return value of the

From 30bc34f9fc9e8587ae76081d30f94a5c3e16b28a Mon Sep 17 00:00:00 2001
From: Fidan Hakaj <fdnhkj@users.noreply.github.com>
Date: Sun, 19 Jun 2016 06:17:38 +0200
Subject: [PATCH 177/278] Added intl-tel-input.d.ts (#9709)

---
 intl-tel-input/intl-tel-input-tests.ts |  69 +++++++
 intl-tel-input/intl-tel-input.d.ts     | 252 +++++++++++++++++++++++++
 2 files changed, 321 insertions(+)
 create mode 100644 intl-tel-input/intl-tel-input-tests.ts
 create mode 100644 intl-tel-input/intl-tel-input.d.ts

diff --git a/intl-tel-input/intl-tel-input-tests.ts b/intl-tel-input/intl-tel-input-tests.ts
new file mode 100644
index 0000000000..739fcc854b
--- /dev/null
+++ b/intl-tel-input/intl-tel-input-tests.ts
@@ -0,0 +1,69 @@
+/// <reference path="../jquery/jquery.d.ts" />
+/// <reference path="intl-tel-input.d.ts" />
+
+$('#phone').intlTelInput();
+
+$('#phone').intlTelInput({
+  customPlaceholder: function(selectedCountryPlaceholder, selectedCountryData) {
+    return 'e.g. ' + selectedCountryPlaceholder;
+  }
+});
+
+$('#phone').intlTelInput({
+  geoIpLookup: function(callback) {
+    $.get('http://ipinfo.io', function() {}, 'jsonp').always(function(resp) {
+      let countryCode = (resp && resp.country) ? <string> resp.country : '';
+      callback(countryCode);
+    });
+  }
+});
+
+$('#phone').intlTelInput('destroy');
+
+let extension = $('#phone').intlTelInput('getExtension');
+
+let intlNumber = $('#phone').intlTelInput('getNumber');
+let ntlNumber = $('#phone').intlTelInput('getNumber', intlTelInputUtils.numberFormat.NATIONAL);
+
+let numberType = $('#phone').intlTelInput('getNumberType');
+if (numberType === intlTelInputUtils.numberType.MOBILE) {}
+
+let countryData = $('#phone').intlTelInput('getSelectedCountryData');
+
+let error = $('#phone').intlTelInput('getValidationError');
+if (error === intlTelInputUtils.validationError.TOO_SHORT) {}
+
+let isValid = $('#phone').intlTelInput('isValidNumber');
+
+$('#phone').intlTelInput('setCountry', 'gb');
+
+$('#phone').intlTelInput('setNumber', '+447733123456');
+
+let countryData3 = $.intlTelInput.getCountryData();
+
+$.intlTelInput.loadUtils('build/js/utils.js');
+
+$('#phone').intlTelInput({
+  utilsScript: '../../build/js/utils.js'
+});
+
+$('#phone').intlTelInput({
+  initialCountry: 'auto',
+  geoIpLookup: function(callback) {
+    $.get('http://ipinfo.io', function() {}, 'jsonp').always(function(resp) {
+      let countryCode = (resp && resp.country) ? resp.country : '';
+      callback(countryCode);
+    });
+  },
+  utilsScript: '../../build/js/utils.js'
+});
+
+$('#phone').intlTelInput({
+  nationalMode: true,
+  utilsScript: '../../build/js/utils.js'
+});
+
+$('#phone').intlTelInput({
+  onlyCountries: ['al'],
+  utilsScript: '../../build/js/utils.js'
+});
diff --git a/intl-tel-input/intl-tel-input.d.ts b/intl-tel-input/intl-tel-input.d.ts
new file mode 100644
index 0000000000..7779f34bd4
--- /dev/null
+++ b/intl-tel-input/intl-tel-input.d.ts
@@ -0,0 +1,252 @@
+// Type definitions for intl-tel-input
+// Project: https://github.com/jackocnr/intl-tel-input
+// Definitions by: Fidan Hakaj <https://github.com/fdnhkj/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../jquery/jquery.d.ts" />
+
+declare namespace IntlTelInput {
+
+  interface Options {
+    /**
+     * Whether or not to allow the dropdown. If disabled, there is no dropdown
+     * arrow, and the selected flag is not clickable. Also we display the
+     * selected flag on the right instead because it is just a marker of state.
+     */
+    allowDropdown?: boolean;
+    /**
+     * If there is just a dial code in the input: remove it on blur or submit,
+     * and re-add it on focus. This is to prevent just a dial code getting
+     * submitted with the form. Requires nationalMode to be set to false.
+     */
+    autoHideDialCode?: boolean;
+    /**
+     * Set the input's placeholder to an example number for the selected country.
+     * You can specify the number type using the numberType option.
+     * If there is already a placeholder attribute set on the input then that
+     * will take precedence. Requires the utilsScript option.
+     */
+    autoPlaceholder?: boolean;
+    /**
+     * Change the placeholder generated by autoPlaceholder. Must return a string.
+     */
+    customPlaceholder?: (selectedCountryPlaceholder: string, selectedCountryData: CountryData) => string;
+    /**
+     * Specify the container for the country dropdown (use a jQuery selector
+     * e.g. "body"). This is useful when the input is within a scrolling element,
+     * or an element with overflow: hidden. Wherever you put the dropdown it
+     * will automatically close on the window scroll event to prevent positioning
+     * issues. If you want it to close when a different element is scrolled
+     * (such as the input's parent), simply listen for the that scroll event,
+     * and trigger $(window).scroll() e.g.
+     */
+    dropdownContainer?: string;
+    /**
+     * Don't display the countries you specify.
+     */
+    excludeCountries?: Array<string>;
+    /**
+     * Format the input value during initialisation.
+     */
+    formatOnInit?: boolean;
+    /**
+     * When setting initialCountry to "auto", you must use this option to
+     * specify a custom function that looks up the user's location. Also note
+     * that when instantiating the plugin, we now return a deferred object, so
+     * you can use .done(callback) to know when initialisation requests like
+     * this have completed.
+     * Note that the callback must still be called in the event of an error.
+     */
+    geoIpLookup?: (callback: (countryCode: string) => void) => void;
+    /**
+     * Set the initial country selection by specifying it's country code.
+     * You can also set it to "auto", which will lookup the user's country based
+     * on their IP address (requires the geoIpLookup option).
+     * Note that the "auto" option will not update the country selection if the
+     * input already contains a number. If you leave initialCountry blank,
+     * it will default to the first country in the list.
+     */
+    initialCountry?: string;
+    /**
+     * Allow users to enter national numbers (and not have to think about
+     * international dial codes). Formatting, validation and placeholders still
+     * work. Then you can use getNumber to extract a full international number.
+     * This option now defaults to true, and it is recommended that you leave it
+     * that way as it provides a better experience for the user.
+     */
+    nationalMode?: boolean;
+    /**
+     * Specify one of the keys from the global enum intlTelInputUtils.numberType
+     *  e.g. "FIXED_LINE" to tell the plugin you're expecting that type of number.
+     * Currently this is only used to set the placeholder to the right type of number.
+     */
+    numberType?: string;
+    /**
+     * Display only the countries you specify.
+     */
+    onlyCountries?: Array<string>;
+    /**
+     * Specify the countries to appear at the top of the list.
+     */
+    preferredCountries?: Array<string>;
+    /**
+     * Display the country dial code next to the selected flag so it's not part
+     * of the typed number. Note that this will disable nationalMode because
+     * technically we are dealing with international numbers, but with the
+     * dial code separated.
+     */
+    separateDialCode?: boolean;
+    /**
+     * Enable formatting/validation etc. by specifying the path to the included
+     * utils.js script, which is fetched only when the page has finished loading
+     * (on window.load) to prevent blocking. When instantiating the plugin,
+     * we return a deferred object, so you can use .done(callback) to know when
+     * initialisation requests like this have finished. Note that if you're
+     * lazy loading the plugin script itself (intlTelInput.js) this will not
+     * work and you will need to use the loadUtils method instead.
+     */
+    utilsScript?: string;
+  }
+
+  interface CountryData {
+    name: string;
+    iso2: string;
+    dialCode: string;
+  }
+
+  interface Static {
+    /**
+     * Get all of the plugin's country data.
+     * Note that any modifications must be done before initialising the plugin.
+     */
+    getCountryData: () => Array<CountryData>;
+    /**
+     * Note: this is only needed if you're lazy loading the plugin script itself (intlTelInput.js).
+     * If not then just use the utilsScript option. Load the utils.js script
+     * (included in the lib directory) to enable formatting/validation etc.
+     * @param path path to the utils.js script.
+     */
+    loadUtils: (path: string) => void;
+  }
+}
+
+declare namespace intlTelInputUtils {
+
+    const enum numberFormat {
+      E164 = 0,
+      INTERNATIONAL = 1,
+      NATIONAL = 2,
+      RFC3966 = 3
+    }
+
+    const enum numberType {
+      FIXED_LINE = 0,
+      MOBILE = 1,
+      FIXED_LINE_OR_MOBILE = 2,
+      TOLL_FREE = 3,
+      PREMIUM_RATE = 4,
+      SHARED_COST = 5,
+      VOIP = 6,
+      PERSONAL_NUMBER = 7,
+      PAGER = 8,
+      UAN = 9,
+      VOICEMAIL = 10,
+      UNKNOWN = -1
+    }
+
+    const enum validationError {
+      IS_POSSIBLE = 0,
+      INVALID_COUNTRY_CODE = 1,
+      TOO_SHORT = 2,
+      TOO_LONG = 3,
+      NOT_A_NUMBER = 4
+    }
+}
+
+interface JQueryStatic {
+  intlTelInput: IntlTelInput.Static;
+}
+
+interface JQuery {
+  /**
+   * Remove the plugin from the input, and unbind any event listeners.
+   */
+  intlTelInput(method: 'destroy'): void;
+  /**
+   * Get the extension from the current number.
+   * Requires the utilsScript option.
+   * e.g. if the input value was "(702) 555-5555 ext. 1234", this would
+   * return "1234".
+   */
+  intlTelInput(method: 'getExtension'): string;
+  /**
+   * Get the current number in the given format (defaults to E.164 standard).
+   * The different formats are available in the enum
+   * intlTelInputUtils.numberFormat - taken from here.
+   * Requires the utilsScript option.
+   * Note that even if nationalMode is enabled, this can still return a full
+   * international number.
+   */
+  intlTelInput(method: 'getNumber'): string;
+  /**
+   * Get the type (fixed-line/mobile/toll-free etc) of the current number.
+   * Requires the utilsScript option.
+   * Returns an integer, which you can match against the various options in the
+   * global enum intlTelInputUtils.numberType.
+   * Note that in the US there's no way to differentiate between fixed-line and
+   * mobile numbers, so instead it will return FIXED_LINE_OR_MOBILE.
+   */
+  intlTelInput(method: 'getNumberType'): intlTelInputUtils.numberType;
+  /**
+   * Get the country data for the currently selected flag.
+   */
+  intlTelInput(method: 'getSelectedCountryData'): IntlTelInput.CountryData;
+  /**
+   * Get more information about a validation error.
+   * Requires the utilsScript option.
+   * Returns an integer, which you can match against the various options in the
+   * global enum intlTelInputUtils.validationError
+   */
+  intlTelInput(method: 'getValidationError'): intlTelInputUtils.validationError;
+  /**
+   * Validate the current number. Expects an internationally formatted number
+   * (unless nationalMode is enabled). If validation fails, you can use
+   * getValidationError to get more information.
+   * Requires the utilsScript option.
+   * Also see getNumberType if you want to make sure the user enters a certain
+   * type of number e.g. a mobile number.
+   */
+  intlTelInput(method: 'isValidNumber'): boolean;
+  intlTelInput(method: string): void;
+  /**
+   * Change the country selection (e.g. when the user is entering their address).
+   * @param countryCode country code of the country to be set.
+   */
+  intlTelInput(method: 'setCountry', countryCode: string): void;
+  /**
+   * Insert a number, and update the selected flag accordingly.
+   * Note that by default, if nationalMode is enabled it will try to use
+   * national formatting.
+   * @param aNumber number to be set.
+   */
+  intlTelInput(method: 'setNumber', aNumber: string): void;
+  intlTelInput(method: string, value: string): void;
+
+  /**
+   * Get the current number in the given format (defaults to E.164 standard).
+   * The different formats are available in the enum
+   * intlTelInputUtils.numberFormat - taken from here.
+   * Requires the utilsScript option.
+   * Note that even if nationalMode is enabled, this can still return a full
+   * international number.
+   * @param numberFormat the format in which the number will be returned.
+   */
+  intlTelInput(method: 'getNumber', numberFormat: intlTelInputUtils.numberFormat): string;
+  intlTelInput(method: string, numberFormat: intlTelInputUtils.numberFormat): string;
+
+  /**
+   * initialise the plugin with optional options.
+   * @param options options that can be provided during initialization.
+   */
+  intlTelInput(options?: IntlTelInput.Options): JQueryDeferred<any>;
+}

From e45bb5393c4c32c6fbe90703b45148c22d5bf08b Mon Sep 17 00:00:00 2001
From: Alex Bettadapur <alexbettadapur@gmail.com>
Date: Sat, 18 Jun 2016 21:17:51 -0700
Subject: [PATCH 178/278] Adding logging interface to adal.d.ts (#9640)

* Added logging interfaces to the adal typings

* Added test cases

* Updating test case
---
 adal-angular/adal-tests.ts |  8 ++++++++
 adal-angular/adal.d.ts     | 15 ++++++++++++++-
 2 files changed, 22 insertions(+), 1 deletion(-)

diff --git a/adal-angular/adal-tests.ts b/adal-angular/adal-tests.ts
index 598134d0a0..3b9e46c961 100644
--- a/adal-angular/adal-tests.ts
+++ b/adal-angular/adal-tests.ts
@@ -12,4 +12,12 @@ var config : adal.Config = {
 
 var auth = new AuthenticationContext(config);
 
+Logging.log = (message: string) => {
+    console.log(message);
+}
+
+Logging.level = 4;
+
+auth.info("Logging message");
+
 var userName: string = auth.getCachedUser().userName;
\ No newline at end of file
diff --git a/adal-angular/adal.d.ts b/adal-angular/adal.d.ts
index c5a64efd0b..76b86e7150 100644
--- a/adal-angular/adal.d.ts
+++ b/adal-angular/adal.d.ts
@@ -4,9 +4,10 @@
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare var AuthenticationContext: adal.AuthenticationContextStatic;
+declare var Logging: adal.Logging;
 
 declare module 'adal' {
-    export = AuthenticationContext;
+    export = { AuthenticationContext, Logging };
 }
 
 declare namespace adal {
@@ -36,6 +37,18 @@ declare namespace adal {
         stateResponse: string,
         requestType: string
     }
+    
+    interface Logging {
+        log: (message: string) => void;
+        level: LoggingLevel;
+    }
+    
+    enum LoggingLevel {
+        ERROR = 0,
+        WARNING = 1, 
+        INFO = 2,
+        VERBOSE = 3
+    }
 
     interface AuthenticationContextStatic {
         new (config: Config): AuthenticationContext;

From e325b363f5ee9c72ebde49f1e783ae725f64b7e2 Mon Sep 17 00:00:00 2001
From: Jeongho Nam <samchon@samchon.org>
Date: Sun, 19 Jun 2016 13:18:04 +0900
Subject: [PATCH 179/278] TypeScript-STL v1.0.0-rc.1 (#9706)

---
 typescript-stl/typescript-stl.d.ts | 13423 +++++++++++++++------------
 1 file changed, 7356 insertions(+), 6067 deletions(-)

diff --git a/typescript-stl/typescript-stl.d.ts b/typescript-stl/typescript-stl.d.ts
index 1286a62084..0ef62635e8 100644
--- a/typescript-stl/typescript-stl.d.ts
+++ b/typescript-stl/typescript-stl.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for TypeScript-STL v0.9.9
+// Type definitions for TypeScript-STL v1.0.0-rc.1
 // Project: https://github.com/samchon/stl
 // Definitions by: Jeongho Nam <http://samchon.org>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -19,7 +19,143 @@
 // ------------------------------------------------------------------------------------
 
 /**
- * STL (Standard Template Library) Containers for TypeScript.
+ * <h1> TypeScript-STL </h1>
+ * <p> <a href="https://nodei.co/npm/typescript-stl">
+ *	<img src="https://nodei.co/npm/typescript-stl.png?downloads=true&downloadRank=true&stars=true"> </a> </p>
+ *
+ * <p> GitHub Repository: https://github.com/samchon/stl </p>
+ *
+ *
+ * <h2> Introduction </h2>
+ * <p> STL (Standard Template Library) Containers and Algorithms for TypeScript. </p>
+ *
+ * <p> TypeScript-STL is a TypeScript's <b>Standard Template Library</b> who is migrated from C++ STL. Most of classes
+ * and functions of STL have implemented. Just enjoy it. </p>
+ *
+ * <p> <img src="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png"
+ *			alt="Abstract Containers"
+ *			style="max-width: 100%" /> </p>
+ *
+ * <h4> Containers </h4>
+ * <ul>
+ *	<li> Linear Containers </li>
+ *	<ul>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.vector.html">Vector</a> </li>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.list.html">List</a> </li>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.deque.html">Deque</a> </li>
+ *		<li> Miscellaneous </li>
+ *		<ul>
+ *			<li> <a href="http://samchon.github.io/stl/api/classes/std.queue.html">Queue</a> </li>
+ *			<li> <a href="http://samchon.github.io/stl/api/classes/std.stack.html">Stack</a> </li>
+ *			<li> <a href="http://samchon.github.io/stl/api/classes/std.priorityqueue.html">PriorityQueue</a> </li>
+ *		</ul>
+ *	</ul>
+ *	<li> <a href="http://samchon.github.io/stl/api/classes/std.base.tree.rbtree.html">Tree-structured Containers</a> </li>
+ *	<ul>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treeset.html">TreeSet</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treemultiset.html">TreeMultiSet</a>
+ *		</li>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treemap.html">TreeMap</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.treemultimap.html">TreeMultiMap</a>
+ *		</li>
+ *	</ul>
+ *	<li> <a href="http://samchon.github.io/stl/api/classes/std.base.hash.hashbuckets.html">Hashed Containers</a> </li>
+ *	<ul>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.hashset.html">HashSet</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.hashmultiset.html">TreeMultiset</a>
+ *		</li>
+ *		<li>
+ *			<a href="http://samchon.github.io/stl/api/classes/std.hashmap.html">HashMap</a>,
+ *			<a href="http://samchon.github.io/stl/api/classes/std.HashMultiMap.html">HashMultiMap</a>
+ *		</li>
+ *	</ul>
+ * </ul>
+ *
+ * <h4> Global Functions </h4>
+ * <ul>
+ *	<li> <a href="http://www.cplusplus.com/reference/algorithm">&lt;algorithm&gt;</a> </li>
+ *	<li> <a href="http://www.cplusplus.com/reference/exception">&lt;exceptional&gt;</a> </li>
+ *	<li> <a href="http://www.cplusplus.com/reference/functional">&lt;functional&gt;</a> </li>
+ *	<ul>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.bind.html">std.bind</a> </li>
+ *	</ul>
+ *	<li> &lt;utility&gt; </li>
+ *	<ul>
+ *		<li> <a href="http://samchon.github.io/stl/api/classes/std.pair.html">std.Pair</a> </li>
+ *	</ul>
+ * </ul>
+ *
+ *
+ * <h2> References </h2>
+ * <p> You can learn and explore about TypeScript-STL more deeply with such below: </p>
+ * <ul>
+ *	<li> <a href="https://github.com/samchon/stl">GitHub Repository</a> </li>
+ *	<li> <a href="https://github.com/samchon/stl/wiki">Guidebook (wiki)</a> </li>
+ *	<li> <a href="http://samchon.github.io/stl/api">API Documents</a> </li>
+ *	<li> <a href="https://samchon.github.io/stl/design/class_diagram.pdf">Class Diagram</a> </li>
+ * </ul>
+ *
+ *
+ * <h2> Installation </h2>
+ * <h4> Node </h4>
+ * <code> npm install -g typescript-stl </code>
+ *
+ * <h5> TypeScript </h5>
+ * <code>
+ * // SOMEWHERE PLACE NODE AND STL HEADERS EXIST
+ * /// <reference path="node.d.ts" />
+ * /// <reference path="typescript-stl.d.ts" />
+ *
+ * global["std"] = require("typescript-stl");
+ * let list: std.List<string> = new std.List<string>();
+ * </code>
+ *
+ * <h5> Pure JavaScript </h5>
+ * <code>
+ * var std = require("typescript-stl");
+ * var list = new std.List();
+ * </code>
+ *
+ * <h4> Browser </h4>
+ * <h5> In HTML Document </h5>
+ *
+ * <h5> TypeScript, reference difinitions (header) </h5>
+ * <code>
+ * /// <reference path="typescript-stl.d.ts" />
+ * </code>
+ *
+ *
+ * <h2> Index of Guidance, Wiki </h2>
+ * <ul>
+ *	<li> <a href="https://github.com/samchon/stl/wiki/Home"><b>Outline</b></a> </li>
+ *	<ul>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Home#introduction">Introduction</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Home#references">References</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Home#installation">Installation</a> </li>
+ *	</ul>
+ *	<li> <a href="https://github.com/samchon/stl/wiki/Differences"><b>Differences between C++</b></a> </li>
+ *	<ul>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#naming-convention">Naming Convention</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#operator-overriding">Operator Overring</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#iterator">Iterator</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#tree-container">Tree Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#hash-container">Hash Container</a> </li>
+ *	</ul>
+ *	<li> <a href="https://github.com/samchon/stl/wiki/Tutorial"><b>Tutorial</b></a> </li>
+ *	<ul>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#linear-container">Linear Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#tree-container">Tree Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#hash-container">Hash Container</a> </li>
+ *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous">Miscellaneous</a> </li>
+ *		<ul>
+ *			<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous#algorithm">Algorithm</a> </li>
+ *			<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous#functional">Functional</a> </li>
+ *		</ul>
+ *	</ul>
+ * </ul>
  *
  * @author Jeongho Nam <http://samchon.org>
  */
@@ -39,6 +175,2739 @@ declare namespace std.base {
  */
 declare namespace std.example {
 }
+declare namespace std {
+    /**
+     * <p> Apply function to range. </p>
+     *
+     * <p> Applies function <i>fn</i> to each of the elements in the range [<i>first</i>, <i>last</i>). </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param fn Unary function that accepts an element in the range as argument. This can either be a function p
+     *			 ointer or a move constructible function object. Its return value, if any, is ignored.
+     *
+     * @return Returns <i>fn</i>.
+     */
+    function for_each<T, InputIterator extends Iterator<T>, Func extends (val: T) => any>(first: InputIterator, last: InputIterator, fn: Func): Func;
+    /**
+     * <p> Test condition on all elements in range. </p>
+     *
+     * <p> Returns <code>true</code> if <i>pred</i> returns <code>true</code> for all the elements in the range
+     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
+     * </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
+     *			   checked by this function. The function shall not modify its argument.
+     *
+     * @return <code>true</code> if pred returns true for all the elements in the range or if the range is
+     *		   {@link IContainer.empty empty}, and <code>false</code> otherwise.
+     */
+    function all_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
+    /**
+     * <p> Test if any element in range fulfills condition. </p>
+     *
+     * <p> Returns <code>true</code> if <i>pred</i> returns true for any of the elements in the range
+     * [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. </p>
+     *
+     * <p> If [<i>first</i>, <i>last</i>) is an {@link IContainer.empty empty} range, the function returns
+     * <code>false</code>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
+     *			   checked by this function. The function shall not modify its argument.
+     *
+     * @return <code>true</code> if <i>pred</i> returns <code>true</code> for any of the elements in the range
+     *		   [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. If [<i>first</i>, <i>last</i>) is an
+     *		   {@link IContainer.empty empty} range, the function returns <code>false</code>.
+     */
+    function any_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
+    /**
+     * <p> Test if no elements fulfill condition. </p>
+     *
+     * <p> Returns <code>true</code> if <i>pred</i> returns false for all the elements in the range
+     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
+     * </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
+     *			   checked by this function. The function shall not modify its argument.
+     *
+     * @return <code>true</code> if <i>pred</i> returns <code>false</code> for all the elements in the range
+     *		   [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code>
+     *		   otherwise.
+     */
+    function none_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
+    /**
+     * <p> Test whether the elements in two ranges are equal. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
+     */
+    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>): boolean;
+    /**
+     * <p> Test whether the elements in two ranges are equal. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *			   the elements are considered to match in the context of this function.
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
+     */
+    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>, pred: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Test whether range is permutation of another. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
+     * order. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
+     */
+    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): boolean;
+    /**
+     * <p> Test whether range is permutation of another. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
+     * order. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *			   the elements are considered to match in the context of this function.
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
+     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
+     */
+    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, pred: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Lexicographical less-than comparison. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically less</i>
+     * than the range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
+     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
+     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
+     * elements is the result of the lexicographical comparison. </p>
+     *
+     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically less</i>
+     * than the longer one. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence.
+     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
+     *				[<i>first2</i>, <i>last2</i>).
+     *
+     * @return <code>true</code> if the first range compares <i>lexicographically less</i> than than the second.
+     *		   <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
+     */
+    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): boolean;
+    /**
+     * <p> Lexicographical comparison. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically
+     * relationship</i> than the range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
+     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
+     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
+     * elements is the result of the lexicographical comparison. </p>
+     *
+     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically
+     * relationship</i> than the longer one. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence.
+     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a
+     *		  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *		  considered to go before the second in the specific <i>strict weak ordering</i> it defines.
+     *
+     * @return <code>true</code> if the first range compares <i>lexicographically relationship</i> than than the
+     *		   second. <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
+     */
+    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Find value in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) that compares equal to
+     * <i>val</i>. If no such element is found, the function returns <i>last</i>. </p>
+     *
+     * <p> The function uses {@link equal_to equal_to} to compare the individual elements to <i>val</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value to search for in the range.
+     *
+     * @return An {@link Iterator} to the first element in the range that compares equal to <i>val</i>. If no elements
+     *		   match, the function returns <i>last</i>.
+     */
+    function find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
+    /**
+     * <p> Find element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
+     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
+     *			   the context of this function. The function shall not modify its argument.
+     *
+     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> does not return
+     *		   <code>false</code>. If <i>pred</i> is <code>false</code> for all elements, the function returns
+     *		   <i>last</i>.
+     */
+    function find_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
+    /**
+     * <p> Find element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
+     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
+     *			   the context of this function. The function shall not modify its argument.
+     *
+     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> returns <code>false</code>.
+     *		   If <i>pred</i> is <code>true</code> for all elements, the function returns <i>last</i>.
+     */
+    function find_if_not<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
+    /**
+     * <p> Find last subsequence in range. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
+     * occurrences are found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
+     * {@link search}. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
+     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *			   whether the elements are considered to match in the context of this function.
+     *
+     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
+     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
+     */
+    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
+    /**
+     * <p> Find last subsequence in range. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
+     * occurrences are found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
+     * {@link search}. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
+     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *			   whether the elements are considered to match in the context of this function.
+     *
+     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
+     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
+     */
+    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
+    /**
+     * <p> Find element from set in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
+     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
+     *
+     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
+     * [<i>first2</i>, <i>last2</i>) using {@link equal_to}, until a pair matches. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     *
+     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
+     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
+     */
+    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
+    /**
+     * <p> Find element from set in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
+     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
+     *
+     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
+     * [<i>first2</i>, <i>last2</i>) using <i>pred</i>, until a pair matches. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
+     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
+     *				is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
+     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *			   whether the elements are considered to match in the context of this function.
+     *
+     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
+     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
+     */
+    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
+    /**
+     * <p> Find equal adjacent elements in range. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
+     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
+     *
+     * <p> Two elements match if they compare equal using {@link equal_to}. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
+     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
+     */
+    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
+    /**
+     * <p> Find equal adjacent elements in range. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
+     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
+     *
+     * <p> Two elements match if they compare equal using <i>pred</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is considered a match in the
+     *			   context of this function. The function shall not modify its argument.
+     *
+     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
+     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
+     */
+    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T, y: T) => boolean): InputIterator;
+    /**
+     * <p> Search range for subsequence. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
+     * found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
+     * {@link find_end}. </p>
+     *
+     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
+     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
+     *				used is [<i>first2</i>, <i>last2</i>).
+     *
+     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in <i>first1</i>
+     *		   and <i>last1</i>. If the sequence is not found, the function returns <i>last1</i>. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
+     */
+    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2): ForwardIterator1;
+    /**
+     * <p> Search range for subsequence. </p>
+     *
+     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
+     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
+     * found. </p>
+     *
+     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
+     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
+     * [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
+     * {@link find_end}. </p>
+     *
+     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
+     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
+     *				used is [<i>first2</i>, <i>last2</i>).
+     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to bool. The returned value indicates whether the elements are
+     *			   considered to match in the context of this function. The function shall not modify any of its
+     *			   arguments.
+     *
+     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in
+     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns last1. Otherwise
+     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
+     */
+    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2, pred: (x: T, y: T) => boolean): ForwardIterator1;
+    /**
+     * <p> Search range for elements. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
+     * <i>val</i>. </p>
+     *
+     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
+     * </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param count Minimum number of successive elements to match.
+     * @param val Individual value to be compared, or to be used as argument for {@link equal_to}.
+     *
+     * @return An iterator to the first element of the sequence. If no such sequence is found, the function returns
+     *		   <i>last</i>.
+     */
+    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T): ForwardIterator;
+    /**
+     * <p> Search range for elements. </p>
+     *
+     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
+     * <i>val</i>. </p>
+     *
+     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
+     * </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param count Minimum number of successive elements to match.
+     * @param val Individual value to be compared, or to be used as argument for <i>pred</i>.
+     * @param pred Binary function that accepts two arguments (one element from the sequence as first, and <i>val</i> as
+     *			   second), and returns a value convertible to <code>bool</code>. The value returned indicates whether the
+     *			   element is considered a match in the context of this function. The function shall not modify any of its
+     *			   arguments.
+     *
+     * @return An {@link Iterator} to the first element of the sequence. If no such sequence is found, the function
+     *		   returns <i>last</i>.
+     */
+    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T, pred: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return first position where two ranges differ. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
+     *
+     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
+     * does not match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     *
+     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
+     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
+     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
+     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
+     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
+     */
+    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): Pair<Iterator1, Iterator2>;
+    /**
+     * <p> Return first position where two ranges differ. </p>
+     *
+     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
+     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
+     *
+     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
+     * does not match. </p>
+     *
+     * @param first1 An {@link Iterator} to the initial position of the first sequence.
+     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
+     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
+     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
+     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *			   the elements are considered to match in the context of this function.
+     *
+     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
+     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
+     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
+     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
+     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
+     */
+    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, compare: (x: T, y: T) => boolean): Pair<Iterator1, Iterator2>;
+    /**
+     * <p> Count appearances of value in range. </p>
+     *
+     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>. </p>
+     *
+     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value to match.
+     *
+     * @return The number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>.
+     */
+    function count<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): number;
+    /**
+     * <p> Return number of elements in range satisfying condition. </p>
+     *
+     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) for which pred is <code>true</code>.
+     * </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether the element is counted by this function.
+     *			   The function shall not modify its argument. This can either be a function pointer or a function
+     *			   object.
+     */
+    function count_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): number;
+}
+declare namespace std {
+    /**
+     * <p> Copy range of elements. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) into the range beginning at <i>result</i>. </p>
+     *
+     * <p> The function returns an iterator to the end of the destination range (which points to the element following the
+     * last element copied). </p>
+     *
+     * <p> The ranges shall not overlap in such a way that result points to an element in the range
+     * [<i>first</i>, <i>last</i>). For such cases, see {@link copy_backward}. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
+     *				 point to any element in the range [<i>first</i>, <i>last</i>).
+     *
+     * @return An iterator to the end of the destination range where elements have been copied.
+     */
+    function copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Copy elements. </p>
+     *
+     * <p> Copies the first <i>n</i> elements from the range beginning at <i>first</i> into the range beginning at
+     * <i>result</i>. </p>
+     *
+     * <p> The function returns an iterator to the end of the destination range (which points to one past the last element
+     * copied). </p>
+     *
+     * <p> If <i>n</i> is negative, the function does nothing. </p>
+     *
+     * <p> If the ranges overlap, some of the elements in the range pointed by result may have undefined but valid values.
+     * </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence of at least <i>n</i> elements to
+     *				be copied. <i>InputIterator</i> shall point to a type assignable to the elements pointed by
+     *				<i>OutputIterator</i>.
+     * @param n Number of elements to copy. If this value is negative, the function does nothing.
+     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence of at least
+     *				 <i>n</i> elements. This shall not point to any element in the range [<i>first</i>, last].
+     *
+     * @return An iterator to the end of the destination range where elements have been copied.
+     */
+    function copy_n<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, n: number, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Copy certain elements of range. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which pred returns <code>true</code> to the
+     * range beginning at <i>result</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
+     *				 point to any element in the range [<i>first</i>, <i>last</i>).
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be copied (if
+     *			   <code>true</code>, it is copied). The function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the destination range where elements have been copied.
+     */
+    function copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T) => boolean): OutputIterator;
+    /**
+     * <p> Copy range of elements backward. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) starting from the end into the range terminating
+     * at <i>result</i>. </p>
+     *
+     * <p> The function returns an iterator to the first element in the destination range. </p>
+     *
+     * <p> The resulting range has the elements in the exact same order as [<i>first</i>, <i>last</i>). To reverse their
+     * order, see {@link reverse_copy}. </p>
+     *
+     * <p> The function begins by copying <code>*(last-1)</code> into <code>*(result-1)</code>, and then follows backward
+     * by the elements preceding these, until <i>first</i> is reached (and including it). </p>
+     *
+     * <p> The ranges shall not overlap in such a way that <i>result</i> (which is the <i>past-the-end element</i> in the
+     * destination range) points to an element in the range (first,last]. For such cases, see {@link copy}. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Bidirectional iterator} to the initial position in the destination sequence. This
+     *				 shall not point to any element in the range [<i>first</i>, <i>last</i>).
+     *
+     * @return An iterator to the first element of the destination sequence where elements have been copied.
+     */
+    function copy_backward<T, BidirectionalIterator1 extends Iterator<T>, BidirectionalIterator2 extends Iterator<T>>(first: BidirectionalIterator1, last: BidirectionalIterator1, result: BidirectionalIterator2): BidirectionalIterator2;
+    /**
+     * <p> Fill range with value. </p>
+     *
+     * <p> Assigns val to all the elements in the range [<i>first</i>, <i>last</i>). </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence of elements that support being
+     *				assigned a value of type <i>T</i>.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence of elements that support being
+     *				assigned a value of type <i>T</i>.. The range filled is [<i>first</i>, <i>last</i>), which contains
+     *				all the elements between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i>
+     *				but not the element pointed by <i>last</i>.
+     * @param val Value to assign to the elements in the filled range.
+     */
+    function fill<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): void;
+    /**
+     * <p> Fill sequence with value. </p>
+     *
+     * <p> Assigns <i>val</i> to the first <i>n</i> elements of the sequence pointed by <i>first</i>. </p>
+     *
+     * @param first {@link Iterator Output iterator} to the initial position in a sequence of elements that support being
+     *				assigned a value of type <i>T</i>.
+     * @param n Number of elements to fill. If negative, the function does nothing.
+     * @param val Value to be used to fill the range.
+     *
+     * @return An iterator pointing to the element that follows the last element filled.
+     */
+    function fill_n<T, OutputIterator extends Iterator<T>>(first: OutputIterator, n: number, val: T): OutputIterator;
+    /**
+     * <p> Transform range. </p>
+     *
+     * <p> Applies <i>op</i> to each of the elements in the range [<i>first</i>, <i>last</i>) and stores the value returned
+     * by each operation in the range that begins at <i>result</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be transformed.
+     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be transformed. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
+     *				 stored. The range includes as many elements as [<i>first</i>, <i>last</i>).
+     * @param op Unary function that accepts one element of the type pointed to by <i>InputIterator</i> as argument, and
+     *			 returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
+     */
+    function transform<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, op: (val: T) => T): OutputIterator;
+    /**
+     * <p> Transform range. </p>
+     *
+     * <p> Calls <i>binary_op</i> using each of the elements in the range [<i>first1</i>, <i>last1</i>) as first argument,
+     * and the respective argument in the range that begins at <i>first2</i> as second argument. The value returned by
+     * each call is stored in the range that begins at <i>result</i>. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second range. The range includes as
+     *				 many elements as [<i>first1</i>, <i>last1</i>).
+     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
+     *				 stored. The range includes as many elements as [<i>first1</i>, <i>last1</i>).
+     * @param binary_op Binary function that accepts two elements as argument (one of each of the two sequences), and
+     *					returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
+     */
+    function transform<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, result: OutputIterator, binary_op: (x: T, y: T) => T): OutputIterator;
+    /**
+     * <p> Generate values for range with function. </p>
+     *
+     * <p> Assigns the value returned by successive calls to gen to the elements in the range [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range affected is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
+     *			  those pointed by the iterators.
+     */
+    function generate<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, gen: () => T): void;
+    /**
+     * <p> Generate values for sequence with function. </p>
+     *
+     * <p> Assigns the value returned by successive calls to <i>gen</i> to the first <i>n</i> elements of the sequence
+     * pointed by <i>first</i>. </p>
+     *
+     * @param first {@link Iterator Output iterator} to the initial position in a sequence of at least <i>n</i> elements
+     *				that support being assigned a value of the type returned by <i>gen</i>.
+     * @param n Number of values to generate. If negative, the function does nothing.
+     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
+     *			  those pointed by the iterators.
+     *
+     * @return An iterator pointing to the element that follows the last element whose value has been generated.
+     */
+    function generate_n<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, n: number, gen: () => T): ForwardIterator;
+    /**
+     * <p> Remove consecutive duplicates in range. </p>
+     *
+     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
+     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
+     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
+     * the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
+     * iterator and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
+     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
+     */
+    function unique<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
+    /**
+     * <p> Remove consecutive duplicates in range. </p>
+     *
+     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
+     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
+     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
+     * the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
+     * iterator and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible
+     *			   to <code>bool</code>. The value returned indicates whether both arguments are considered equivalent
+     *			  (if <code>true</code>, they are equivalent and one of them is removed). The function shall not modify
+     *			  any of its arguments.
+     *
+     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
+     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
+     */
+    function unique<t, InputIterator extends Iterator<t>>(first: InputIterator, last: InputIterator, pred: (left: t, right: t) => boolean): InputIterator;
+    /**
+     * <p> Copy range removing duplicates. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * consecutive duplicates (elements that compare equal to the element preceding). </p>
+     *
+     * <p> Only the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>) is copied. </p>
+     *
+     * <p> The comparison between elements is performed by applying {@lnk equal_to}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
+     *				 The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     *
+     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
+     */
+    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Copy range removing duplicates. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * consecutive duplicates (elements that compare equal to the element preceding). </p>
+     *
+     * <p> Only the first element from every consecutive group of equivalent elements in the range
+     * [<i>first</i>, <i>last</i>) is copied. </p>
+     *
+     * <p> The comparison between elements is performed by applying <i>pred</i>. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
+     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
+     *				 The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether both arguments are considered equivalent (if
+     *			   <code>true</code>, they are equivalent and one of them is removed). The function shall not modify any
+     *			   of its arguments.
+     *
+     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
+     */
+    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Remove value from range. </p>
+     *
+     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements that compare equal to
+     * <i>val</i> removed, and returns an iterator to the new last of that range. </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot alter
+     * the size of an array or a container): The removal is done by replacing the elements that compare equal to
+     * <i>val</i> by the next element that does not, and signaling the new size of the shortened range by returning an
+     * iterator to the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned iterator
+     * and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value to be removed.
+     */
+    function remove<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
+    /**
+     * <p> Remove elements from range. </p>
+     *
+     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements for which pred returns
+     * <code>true</code> removed, and returns an iterator to the new last of that range. </p>
+     *
+     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
+     * alter the size of an array or a container): The removal is done by replacing the elements for which pred returns
+     * <code>true</code> by the next element for which it does not, and signaling the new size of the shortened range
+     * by returning an iterator to the element that should be considered its new past-the-last element. </p>
+     *
+     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
+     * iterator and last are left in a valid but unspecified state. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be removed (if
+     *			   <code>true</code>, it is removed). The function shall not modify its argument.
+     */
+    function remove_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (left: T) => boolean): InputIterator;
+    /**
+     * <p> Copy range removing value. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * those elements that compare equal to <i>val</i>. </p>
+     *
+     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches in the sequence,
+     * which are "removed". </p>
+     *
+     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param val Value to be removed.
+     *
+     * @return An iterator pointing to the end of the copied range, which includes all the elements in
+     *		   [<i>first</i>, <i>last</i>) except those that compare equal to <i>val</i>.
+     */
+    function remove_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, val: T): OutputIterator;
+    /**
+     * <p> Copy range removing values. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
+     * those elements for which <i>pred</i> returns <code>true</code>. </p>
+     *
+     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches, which are
+     * "removed". </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
+     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
+     *
+     * @return An iterator pointing to the end of the copied range, which includes all the elements in
+     *		   [<i>first</i>, <i>last</i>) except those for which <i>pred</i> returns <code>true</code>.
+     */
+    function remove_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean): OutputIterator;
+    /**
+     * <p> Replace value in range. </p>
+     *
+     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) that compare equal to
+     * <i>old_val</i>. </p>
+     *
+     * <p> The function uses {@link equal_to} to compare the individual elements to old_val. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param old_val Value to be replaced.
+     * @param new_val Replacement value.
+     */
+    function replace<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, old_val: T, new_val: T): void;
+    /**
+     * <p> Replace value in range. </p>
+     *
+     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) for which pred returns
+     * <code>true</code>. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be replaced (if
+     *			   <code>true</code>, it is replaced). The function shall not modify its argument.
+     * @param new_val Value to assign to replaced elements.
+     */
+    function replace_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean, new_val: T): void;
+    /**
+     * <p> Copy range replacing value. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
+     * the appearances of <i>old_value</i> by <i>new_value</i>. </p>
+     *
+     * <p> The function uses {@link std.equal_to} to compare the individual elements to <i>old_value</i>. </p>
+     *
+     * <p> The ranges shall not overlap in such a way that result points to an element in the range
+     * [<i>first</i>, <i>last</i>). </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param old_val Value to be replaced.
+     * @param new_val Replacement value.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function replace_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, old_val: T, new_val: T): OutputIterator;
+    /**
+     * <p> Copy range replacing value. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
+     * those for which <i>pred</i> returns <code>true</code> by <i>new_value</i>. </p>
+     *
+     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
+     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
+     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
+     * @param new_val Value to assign to replaced values.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function replace_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean, new_val: T): OutputIterator;
+    /**
+     * <p> Exchange values of objects pointed to by two iterators. </p>
+     *
+     * <p> Swaps the elements pointed to by <i>x</i> and <i>y</i>. </p>
+     *
+     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
+     *
+     * @param x {@link Iterator Forward iterator} to the objects to swap.
+     * @param y {@link Iterator Forward iterator} to the objects to swap.
+     */
+    function iter_swap<T>(x: Iterator<T>, y: Iterator<T>): void;
+    /**
+     * <p> Exchange values of two ranges. </p>
+     *
+     * <p> Exchanges the values of each of the elements in the range [<i>first1</i>, <i>last1</i>) with those of their
+     * respective elements in the range beginning at <i>first2</i>. </p>
+     *
+     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
+     *
+     * @param first1 {@link Iterator Forward iterator} to the initial position of the first sequence.
+     * @param last1 {@link Iterator Forward iterator} to the final position of the first sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
+     *				pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Forward iterator} to the initial position of the second range. The range includes as
+     *				 many elements as [<i>first1</i>, <i>last1</i>). The two ranges shall not overlap.
+     *
+     * @return An iterator to the last element swapped in the second sequence.
+     */
+    function swap_ranges<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2): ForwardIterator2;
+    /**
+     * <p> Reverse range. </p>
+     *
+     * <p> Reverses the order of the elements in the range [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The function calls {@link iter_swap} to swap the elements to their new locations. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     */
+    function reverse<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): void;
+    /**
+     * <p> Copy range reversed. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but in
+     * reverse order. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
+     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     *
+     * @return An output iterator pointing to the end of the copied range, which contains the same elements in reverse
+     *		   order.
+     */
+    function reverse_copy<T, BidirectionalIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Rotate left the elements in range. </p>
+     *
+     * <p> Rotates the order of the elements in the range [<i>first</i>, <i>last</i>), in such a way that the element
+     * pointed by middle becomes the new first element. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param middle An {@link Iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is
+     *				 moved to the first position in the range.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator pointing to the element that now contains the value previously pointed by <i>first</i>.
+     */
+    function rotate<T, InputIterator extends Iterator<T>>(first: InputIterator, middle: InputIterator, last: InputIterator): InputIterator;
+    /**
+     * <p> Copy range rotated left. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but
+     * rotating the order of the elements in such a way that the element pointed by <i>middle</i> becomes the first
+     * element in the resulting range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the range to be copy-rotated.
+     * @param middle Forward iterator pointing to the element within the range [<i>first</i>, <i>last</i>) that is copied as the first element in the resulting range.
+     * @param last {@link Iterator Forward iterator} to the final positions of the range to be copy-rotated. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   Notice that in this function, these are not consecutive parameters, but the first and <b>third</b> ones.
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
+     *				 stored. The pointed type shall support being assigned the value of an element in the range
+     *				 [<i>first</i>, <i>last</i>).
+     *
+     * @return An output iterator pointing to the end of the copied range.
+     */
+    function rotate_copy<T, ForwardIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: ForwardIterator, middle: ForwardIterator, last: ForwardIterator, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Randomly rearrange elements in range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly. </p>
+     *
+     * <p> The function swaps the value of each element with that of some other randomly picked element. When provided,
+     * the function gen determines which element is picked in every case. Otherwise, the function uses some unspecified
+     * source of randomness. </p>
+     *
+     * <p> To specify a uniform random generator, see {@link shuffle}. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     */
+    function random_shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Randomly rearrange elements in range using generator. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly, using <i>g</i> as uniform random
+     * number generator. </p>
+     *
+     * <p> The function swaps the value of each element with that of some other randomly picked element. The function
+     * determines the element picked by calling <i>g()</i>. </p>
+     *
+     * <p> To shuffle the elements of the range without such a generator, see {@link random_shuffle} instead. </p>
+     *
+     * <h5> Note </h5>
+     * <p> Using random generator engine is not implemented yet. </p>
+     *
+     * @param first An {@link Iterator} to the initial position in a sequence.
+     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
+     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			  <i>first</i> but not the element pointed by <i>last</i>.
+     */
+    function shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
+}
+declare namespace std {
+    /**
+     * <p> Sort elements in range. </p>
+     *
+     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into ascending order. The elements are compared
+     * using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			  {@link Iterator.swap swap} is properly defined.
+     */
+    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Sort elements in range. </p>
+     *
+     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into specific order. The elements are compared
+     * using <i>compare</i>. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			  {@link Iterator.swap swap} is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *		  convertible to <code>boolean</code>. The value returned indicates whether the element passed as first
+     *		  argument is considered to go before the second in the specific strict weak ordering it defines. The
+     *		  function shall not modify any of its arguments. This can either be a function pointer or a function
+     *		  object.
+     */
+    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (left: T, right: T) => boolean): void;
+    /**
+     * <p> Partially sort elements in range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
+     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
+     * elements are left without any specific order. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
+     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>.
+     */
+    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Partially sort elements in range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
+     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
+     * elements are left without any specific order. </p>
+     *
+     * <p> The elements are compared using <i>comp</i>. </p>
+     *
+     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
+     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
+     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
+     *			  <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it
+     *				  defines. The function shall not modify any of its arguments.
+     */
+    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Copy and partially sort range. </p>
+     *
+     * <p> Copies the smallest  elements in the range [<i>first</i>, <i>last</i>) to
+     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
+     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
+     * elements in [<i>first</i>, <i>last</i>)). </p>
+     *
+     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
+     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
+     *			   <i>RandomAccessIterator</i>.
+     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
+     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
+     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
+     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
+     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
+     *				  defines. The function shall not modify any of its arguments.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator): RandomAccessIterator;
+    /**
+     * <p> Copy and partially sort range. </p>
+     *
+     * <p> Copies the smallest (or largest) elements in the range [<i>first</i>, <i>last</i>) to
+     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
+     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
+     * elements in [<i>first</i>, <i>last</i>)). </p>
+     *
+     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
+     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
+     *			   <i>RandomAccessIterator</i>.
+     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
+     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
+     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
+     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
+     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
+     *				  defines. The function shall not modify any of its arguments.
+     *
+     * @return An iterator pointing to the element that follows the last element written in the result sequence.
+     */
+    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator, compare: (x: T, y: T) => boolean): RandomAccessIterator;
+    /**
+     * <p> Check whether range is sorted. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
+     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
+     *		   the function always returns <code>true</code>.
+     */
+    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): boolean;
+    /**
+     * <p> Check whether range is sorted. </p>
+     *
+     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered to go before the second in the specific strict weak ordering it defines. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
+     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
+     *		   the function always returns <code>true</code>.
+     */
+    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Find first unsorted element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
+     * ascending order. </p>
+     *
+     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
+     *
+     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using {@link equal_to}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered to go before the second in the specific strict weak ordering it defines. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
+     *		   all elements are sorted or if the range contains less than two elements.
+     */
+    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
+    /**
+     * <p> Find first unsorted element in range. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
+     * ascending order. </p>
+     *
+     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
+     *
+     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered to go before the second in the specific strict weak ordering it defines. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
+     *		   all elements are sorted or if the range contains less than two elements.
+     */
+    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
+}
+declare namespace std {
+    /**
+     * <p> Make heap from range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) in such a way that they form a heap. </p>
+     *
+     * <p> A heap is a way to organize the elements of a range that allows for fast retrieval of the element with the
+     * highest value at any moment (with {@link pop_heap}), even repeatedly, while allowing for fast insertion of new
+     * elements (with {@link push_heap}). </p>
+     *
+     * <p> The element with the highest value is always pointed by first. The order of the other elements depends on the
+     * particular implementation, but it is consistent throughout all heap-related functions of this header. </p>
+     *
+     * <p> The elements are compared using {@link less}: The element with the highest value is an element for which this
+     * would return false when compared to every other element in the range. </p>
+     *
+     * <p> The standard container adaptor {@link PriorityQueue} calls {@link make_heap}, {@link push_heap} and
+     * {@link pop_heap} automatically to maintain heap properties for a container. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be
+     *				transformed into a heap.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be transformed
+     *			   into a heap. The range used is [<i>first</i>, <i>last</i>), which contains all the elements between
+     *			   <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed
+     *			   by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     */
+    function make_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Make heap from range. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) in such a way that they form a heap. </p>
+     *
+     * <p> A heap is a way to organize the elements of a range that allows for fast retrieval of the element with the
+     * highest value at any moment (with {@link pop_heap}), even repeatedly, while allowing for fast insertion of new
+     * elements (with {@link push_heap}). </p>
+     *
+     * <p> The element with the highest value is always pointed by first. The order of the other elements depends on the
+     * particular implementation, but it is consistent throughout all heap-related functions of this header. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>: The element with the highest value is an element for which this
+     * would return false when compared to every other element in the range. </p>
+     *
+     * <p> The standard container adaptor {@link PriorityQueue} calls {@link make_heap}, {@link push_heap} and
+     * {@link pop_heap} automatically to maintain heap properties for a container. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be
+     *				transformed into a heap.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be transformed
+     *			   into a heap. The range used is [<i>first</i>, <i>last</i>), which contains all the elements between
+     *			   <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed
+     *			   by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function make_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Push element into heap range. </p>
+     *
+     * <p> Given a heap in the range [<i>first</i>, <i>last</i> - 1), this function extends the range considered a heap to
+     * [<i>first</i>, <i>last</i>) by placing the value in (<i>last</i> - 1) into its corresponding location within it.
+     * </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the new heap range, including
+     *				the pushed element.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the new heap range, including
+     *			   the pushed element.  The range used is [<i>first</i>, <i>last</i>), which contains all the elements
+     *			   between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element
+     *			   pointed by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     */
+    function push_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Push element into heap range. </p>
+     *
+     * <p> Given a heap in the range [<i>first</i>, <i>last</i> - 1), this function extends the range considered a heap to
+     * [<i>first</i>, <i>last</i>) by placing the value in (<i>last</i> - 1) into its corresponding location within it.
+     * </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the new heap range, including
+     *				the pushed element.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the new heap range, including
+     *			   the pushed element.  The range used is [<i>first</i>, <i>last</i>), which contains all the elements
+     *			   between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i> but not the element
+     *			   pointed by <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
+     *			   {@link Iterator.swap swap} is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function push_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Pop element from heap range. </p>
+     *
+     * <p> Rearranges the elements in the heap range [<i>first</i>, <i>last</i>) in such a way that the part considered a
+     * heap is shortened by one: The element with the highest value is moved to (<i>last</i> - 1). </p>
+     *
+     * <p> While the element with the highest value is moved from first to (<i>last</i> - 1) (which now is out of the
+     * heap), the other elements are reorganized in such a way that the range [<i>first</i>, <i>last</i> - 1) preserves
+     * the properties of a heap. </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the heap to be shrank by one.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the heap to be shrank by one.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     */
+    function pop_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Pop element from heap range. </p>
+     *
+     * <p> Rearranges the elements in the heap range [<i>first</i>, <i>last</i>) in such a way that the part considered a
+     * heap is shortened by one: The element with the highest value is moved to (<i>last</i> - 1). </p>
+     *
+     * <p> While the element with the highest value is moved from first to (<i>last</i> - 1) (which now is out of the
+     * heap), the other elements are reorganized in such a way that the range [<i>first</i>, <i>last</i> - 1) preserves
+     * the properties of a heap. </p>
+     *
+     * <p> A range can be organized into a heap by calling {@link make_heap}. After that, its heap properties are
+     * preserved if elements are added and removed from it using {@link push_heap} and {@link pop_heap}, respectively.
+     * </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the heap to be shrank by one.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the heap to be shrank by one.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function pop_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Test if range is heap. </p>
+     *
+     * <p> Returns true if the range [<i>first</i>, <i>last</i>) forms a heap, as if constructed with {@link make_heap}.
+     * </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is a heap (as if constructed with
+     *		   {@link make_heap}), <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less
+     *		   than two elements, the function always returns <code>true</code>.
+     */
+    function is_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): boolean;
+    /**
+     * <p> Test if range is heap. </p>
+     *
+     * <p> Returns true if the range [<i>first</i>, <i>last</i>) forms a heap, as if constructed with {@link make_heap}.
+     * </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     *
+     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is a heap (as if constructed with
+     *		   {@link make_heap}), <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less
+     *		   than two elements, the function always returns <code>true</code>.
+     */
+    function is_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Find first element not in heap order. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which is not in a valid
+     * position if the range is considered a heap (as if constructed with {@link make_heap}). </p>
+     *
+     * <p> The range between first and the iterator returned is a heap. </p>
+     *
+     * <p> If the entire range is a valid heap, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     */
+    function is_heap_until<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): RandomAccessIterator;
+    /**
+     * <p> Find first element not in heap order. </p>
+     *
+     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which is not in a valid
+     * position if the range is considered a heap (as if constructed with {@link make_heap}). </p>
+     *
+     * <p> The range between first and the iterator returned is a heap. </p>
+     *
+     * <p> If the entire range is a valid heap, the function returns <i>last</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function is_heap_until<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): RandomAccessIterator;
+    /**
+     * <p> Sort elements of heap. </p>
+     *
+     * <p> Sorts the elements in the heap range [<i>first</i>, <i>last</i>) into ascending order. </p>
+     *
+     * <p> The elements are compared using {@link less}, which shall be the same as used to construct the heap. </p>
+     *
+     * <p> The range loses its properties as a heap. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     */
+    function sort_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator): void;
+    /**
+     * <p> Sort elements of heap. </p>
+     *
+     * <p> Sorts the elements in the heap range [<i>first</i>, <i>last</i>) into ascending order. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>, which shall be the same as used to construct the heap. </p>
+     *
+     * <p> The range loses its properties as a heap. </p>
+     *
+     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
+     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
+     *			   The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *			   {@link IArrayIterator RandomAccessIterator} shall point to a type for which {@link Iterator.swap swap}
+     *			   is properly defined.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
+     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
+     *				  first argument is considered to go before the second in the specific strict weak ordering it defines.
+     *				  The function shall not modify any of its arguments. This can either be a function pointer or a
+     *				  function object.
+     */
+    function sort_heap<T, RandomAccessIterator extends base.IArrayIterator<T>>(fisrt: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
+}
+declare namespace std {
+    /**
+     * <p> Return iterator to lower bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
+     * compare less than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
+     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
+     * <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
+     * to <i>val</i>, and not only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
+    /**
+     * <p> Return iterator to lower bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
+     * compare less than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
+     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
+     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
+     * to <i>val</i>, and not only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
+     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
+     *				  returned indicates whether the first argument is considered to go before the second. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return iterator to upper bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
+     * greater than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
+     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
+     * <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
+     * <i>val</i>, only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
+    /**
+     * <p> Return iterator to upper bound. </p>
+     *
+     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
+     * greater than <i>val</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
+     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
+     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
+     * <i>val</i>, only greater. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
+     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
+     *				  returned indicates whether the first argument is considered to go before the second. The function
+     *				  shall not modify any of its arguments.
+     *
+     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
+     *		   <i>val</i>, the function returns <i>last</i>.
+     */
+    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
+     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
+     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
+     */
+    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): Pair<ForwardIterator, ForwardIterator>;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
+     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *				  the first argument is considered to go before the second. The function shall not modify any of its
+     *				  arguments.
+     *
+     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
+     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
+     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
+     */
+    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
+     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
+     *
+     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
+     */
+    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): boolean;
+    /**
+     * <p> Get subrange of equal elements. </p>
+     *
+     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
+     * values equivalent to <i>val</i>. </p>
+     *
+     * <p> The elements are compared using {<i>compare</i>}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
+     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
+     *
+     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
+     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
+     * greater than all the elements in the range. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
+     *				{@link is_partitioned partitioned}) sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
+     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
+     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
+     *			   <i>first</i> but not the element pointed by <i>last</i>.
+     * @param val Value of the lower bound to search for in the range.
+     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
+     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
+     *				  the first argument is considered to go before the second. The function shall not modify any of its
+     *				  arguments.
+     *
+     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
+     */
+    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): boolean;
+}
+declare namespace std {
+    /**
+     * <p> Test whether range is partitioned. </p>
+     *
+     * <p> Returns <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i>
+     * returns <code>true</code> precede those for which it returns <code>false</code>. </p>
+     *
+     * <p> If the range is {@link IContainer.empty empty}, the function returns <code>true</code>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the sequence.
+     * @param last {@link Iterator Input iterator} to the final position of the sequence. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
+     *			   <code>true</code>, the element is expected before all the elements for which it returns
+     *			   <code>false</code>). The function shall not modify its argument.
+     *
+     * @return <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns
+     *		   <code>true</code> precede those for which it returns <code>false</code>. Otherwise it returns
+     *		   <code>false</code>. If the range is {@link IContainer.empty empty}, the function returns <code>true</code>.
+     */
+    function is_partitioned<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T) => boolean): boolean;
+    /**
+     * <p> Partition range in two. </p>
+     *
+     * <p> Rearranges the elements from the range [<i>first</i>, <i>last</i>), in such a way that all the elements for
+     * which <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>. The iterator
+     * returned points to the first element of the second group. </p>
+     *
+     * <p> The relative ordering within each group is not necessarily the same as before the call. See
+     * {@link stable_partition} for a function with a similar behavior but with stable ordering within each group. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the sequence to partition.
+     * @param last {@link Iterator Forward iterator} to the final position of the sequence to partition. The range used is
+     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
+     *			   <code>true</code>, the element is expected before all the elements for which it returns
+     *			   <code>false</code>). The function shall not modify its argument.
+     *
+     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
+     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
+     */
+    function partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
+    /**
+     * <p> Partition range in two - stable ordering. </p>
+     *
+     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that all the elements for which
+     * <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>, and, unlike
+     * function {@link partition}, the relative order of elements within each group is preserved. </p>
+     *
+     * <p> This is generally implemented using an internal temporary buffer. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position of the sequence to partition.
+     * @param last {@link Iterator Bidirectional iterator} to the final position of the sequence to partition. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
+     *			   <code>true</code>, the element is expected before all the elements for which it returns
+     *			   <code>false</code>). The function shall not modify its argument.
+     *
+     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
+     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
+     */
+    function stable_partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
+    /**
+     * <p> Partition range into two. </p>
+     *
+     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns <code>true</code>
+     * into the range pointed by <i>result_true</i>, and those for which it does not into the range pointed by
+     * <i>result_false</i>. </p>
+     *
+     * @param first {@link Iterator Input iterator} to the initial position of the range to be copy-partitioned.
+     * @param last {@link Iterator Input iterator} to the final position of the range to be copy-partitioned. The range
+     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
+     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param result_true {@link Iterator Output iterator} to the initial position of the range where the elements for
+     *					  which <i>pred</i> returns <code>true</code> are stored.
+     * @param result_false {@link Iterator Output iterator} to the initial position of the range where the elements for
+     *					   which <i>pred</i> returns <code>false</code> are stored.
+     * @param pred Unary function that accepts an element pointed by <i>InputIterator</i> as argument, and returns a value
+     *			   convertible to <code>bool</code>. The value returned indicates on which result range the element is
+     *			   copied. The function shall not modify its argument.
+     *
+     * @return A {@link Pair} of iterators with the end of the generated sequences pointed by <i>result_true</i> and
+     *		   <i>result_false</i>, respectivelly. Its member {@link Pair.first first} points to the element that follows
+     *		   the last element copied to the sequence of elements for which <i>pred</i> returned <code>true</code>. Its
+     *		   member {@link Pair.second second} points to the element that follows the last element copied to the sequence
+     *		   of elements for which <i>pred</i> returned <code>false</code>.
+     */
+    function partition_copy<T, InputIterator extends Iterator<T>, OutputIterator1 extends Iterator<T>, OutputIterator2 extends Iterator<T>>(first: InputIterator, last: InputIterator, result_true: OutputIterator1, result_false: OutputIterator2, pred: (val: T) => T): Pair<OutputIterator1, OutputIterator2>;
+    /**
+     * <p> Get partition point. </p>
+     *
+     * <p> Returns an iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which
+     * <i>pred</i> is not <code>true</code>, indicating its partition point. </p>
+     *
+     * <p> The elements in the range shall already {@link is_partitioned be partitioned}, as if {@link partition} had been
+     * called with the same arguments. </p>
+     *
+     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
+     * range, which is specially efficient for {@link Iteartor random-access iterators}. </p>
+     *
+     * @param first {@link Iterator Forward iterator} to the initial position of the partitioned sequence.
+     * @param last {@link Iterator Forward iterator} to the final position of the partitioned sequence. The range checked
+     *		  is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> an <i>last</i>,
+     *		  including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
+     *			   <code>bool</code>. The value returned indicates whether the element goes before the partition point (if
+     *			   <code>true</code>, it goes before; if <code>false</code> goes at or after it). The function shall not
+     *			   modify its argument.
+     *
+     * @return An iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which <i>pred</i>
+     *		   is not <code>true</code>, or <i>last</i> if it is not <code>true</code> for any element.
+     */
+    function partition_point<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, pred: (x: T) => boolean): ForwardIterator;
+}
+declare namespace std {
+    /**
+     * <p> Merge sorted ranges. </p>
+     *
+     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
+     * a new range beginning at <i>result</i> with all its elements sorted. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
+     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
+     *				 range is stored. Its size is equal to the sum of both ranges above.
+     *
+     * @return An iterator pointing to the past-the-end element in the resulting sequence.
+     */
+    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Merge sorted ranges. </p>
+     *
+     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
+     * a new range beginning at <i>result</i> with all its elements sorted. </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
+     * this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
+     *				 range is stored. Its size is equal to the sum of both ranges above.
+     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator pointing to the past-the-end element in the resulting sequence.
+     */
+    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Merge consecutive sorted ranges. </p>
+     *
+     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
+     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
+     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
+     *
+     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
+     * range preceding those equivalent in the second. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
+     *				This is also the initial position where the resulting merged range is stored.
+     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
+     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
+     *				 sequence.
+     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
+     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
+     *			   stored.
+     */
+    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator): void;
+    /**
+     * <p> Merge consecutive sorted ranges. </p>
+     *
+     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
+     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. The elements in both ranges shall already be ordered according
+     * to this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
+     *
+     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
+     * range preceding those equivalent in the second. </p>
+     *
+     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
+     *				This is also the initial position where the resulting merged range is stored.
+     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
+     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
+     *				 sequence.
+     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
+     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
+     *			   stored.
+     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
+     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     */
+    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator, compare: (x: T, y: T) => boolean): void;
+    /**
+     * <p> Test whether sorted range includes another sorted range. </p>
+     *
+     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
+     * sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be ordered according to this same criterion ({@link less}). </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
+     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
+     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
+     *				<i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
+     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
+     *
+     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
+     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
+     *		   range, the function returns <code>true</code>.
+     */
+    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2): boolean;
+    /**
+     * <p> Test whether sorted range includes another sorted range. </p>
+     *
+     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
+     * sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the range shall already be ordered according to this same criterion (<i>compare</i>). </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
+     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
+     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
+     *				<i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
+     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
+     * @param compare Binary function that accepts two elements as arguments (one from each of the two sequences, in the
+     *				  same order), and returns a value convertible to <code>bool</code>. The value returned indicates
+     *				  whether the element passed as first argument is considered to go before the second in the specific
+     *				  <i>strict weak ordering</i> it defines. The function shall not modify any of its arguments.
+     *
+     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
+     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
+     *		   range, the function returns <code>true</code>.
+     */
+    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, compare: (x: T, y: T) => boolean): boolean;
+    /**
+     * <p> Union of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
+     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
+     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
+     * range. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Union of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
+     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
+     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
+     * range. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Intersection of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
+     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
+     * copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Intersection of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
+     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
+     * copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
+     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
+     * second one. The elements copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
+     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
+     *
+     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
+     * </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
+     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
+     *
+     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
+     * second one. The elements copied by the function come always from the first range, in the same order. </p>
+     *
+     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
+     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
+     *
+     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
+     * </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+    /**
+     * <p> Symmetric difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
+     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
+     * </p>
+     *
+     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
+     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
+     * existent order before the call. The existing order is also preserved for the copied elements. </p>
+     *
+     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link std.less}). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
+    /**
+     * <p> Symmetric difference of two sorted ranges. </p>
+     *
+     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
+     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
+     * </p>
+     *
+     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
+     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
+     * existent order before the call. The existing order is also preserved for the copied elements. </p>
+     *
+     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
+     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
+     *
+     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
+     * resulting range is also sorted according to this. </p>
+     *
+     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
+     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
+     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
+     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
+     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
+     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
+     *				[<i>first2</i>, <i>last2</i>).
+     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
+     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
+     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
+     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
+     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
+     *				  function shall not modify any of its arguments.
+     *
+     * @return An iterator to the end of the constructed range.
+     */
+    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
+}
+declare namespace std {
+    /**
+     * <p> Return the smallest. </p>
+     *
+     * <p> Returns the smallest of all the elements in the <i>args</i>. </p>
+     *
+     * @param args Values to compare.
+     *
+     * @return The lesser of the values passed as arguments.
+     */
+    function min<T>(...args: T[]): T;
+    /**
+     * <p> Return the largest. </p>
+     *
+     * <p> Returns the largest of all the elements in the <i>args</i>. </p>
+     *
+     * @param args Values to compare.
+     *
+     * @return The largest of the values passed as arguments.
+     */
+    function max<T>(...args: T[]): T;
+    /**
+     * <p> Return smallest and largest elements. </p>
+     *
+     * <p> Returns a {@link Pair} with the smallest of all the elements in the <i>args</i> as first element (the first of
+     * them, if there are more than one), and the largest as second (the last of them, if there are more than one). </p>
+     *
+     * @param args Values to compare.
+     *
+     * @return The lesser and greatest of the values passed as arguments.
+     */
+    function minmax<T>(...args: T[]): Pair<T, T>;
+    /**
+     * <p> Return smallest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either {@link less}; An element is the smallest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
+     */
+    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
+    /**
+     * <p> Return smallest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either <i>compare</i>; An element is the smallest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
+     */
+    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return largest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either {@link greater}; An element is the largest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     *
+     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
+     */
+    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
+    /**
+     * <p> Return largest element in range. </p>
+     *
+     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
+     * </p>
+     *
+     * <p> The comparisons are performed using either <i>compare</i>; An element is the largest if no other element
+     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
+     * of such elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
+     */
+    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
+    /**
+     * <p> Return smallest and largest elements in range. </p>
+     *
+     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
+     *
+     * <p> The comparisons are performed using either {@link less} and {@link greater}. </p>
+     *
+     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
+     * elements. </p>
+     *
+     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
+     * elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
+     */
+    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): Pair<ForwardIterator, ForwardIterator>;
+    /**
+     * <p> Return smallest and largest elements in range. </p>
+     *
+     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
+     *
+     * <p> The comparisons are performed using either <i>compare</i>. </p>
+     *
+     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
+     * elements. </p>
+     *
+     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
+     * elements. </p>
+     *
+     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
+     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
+     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
+     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
+     *				  considered less than the second. The function shall not modify any of its arguments.
+     *
+     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
+     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
+     */
+    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
+}
+declare namespace std.base {
+    /**
+     * <p> An abstract container. </p>
+     *
+     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     * 	<dt> Sequence </dt>
+     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
+     *		 accessed by their position in this sequence. </dd>
+     *
+     * 	<dt> Doubly-linked list </dt>
+     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing
+     *		 constant time insert and erase operations before or after a specific element (even of entire ranges),
+     *		 but no direct random access. </dd>
+     * </dl>
+     *
+     * @param <T> Type of elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    abstract class Container<T> implements IContainer<T> {
+        /**
+         * <p> Default Constructor. </p>
+         *
+         * <p> Constructs an empty container, with no elements. </p>
+         */
+        constructor();
+        /**
+         * <p> Initializer list Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
+         *
+         * @param array An array containing elements to be copied and contained.
+         */
+        constructor(array: Array<T>);
+        /**
+         * <p> Copy Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
+         *
+         * @param container Another container object of the same type (with the same class template
+         *					arguments <i>T</i>), whose contents are either copied or acquired.
+         */
+        constructor(container: IContainer<T>);
+        /**
+         * <p> Range Constructor. </p>
+         *
+         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
+         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @inheritdoc
+         */
+        abstract assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        abstract begin(): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract end(): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract rbegin(): base.IReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract rend(): base.IReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract size(): number;
+        /**
+         * @inheritdoc
+         */
+        empty(): boolean;
+        /**
+         * @inheritdoc
+         */
+        abstract push<U extends T>(...items: U[]): number;
+        /**
+         * @inheritdoc
+         */
+        abstract insert(position: Iterator<T>, val: T): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract erase(position: Iterator<T>): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        abstract erase<U extends T>(begin: Iterator<U>, end: Iterator<U>): Iterator<T>;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: IContainer<T>): void;
+    }
+}
 declare namespace std {
     /**
      * <p> Bi-directional iterator. </p>
@@ -118,6 +2987,8 @@ declare namespace std {
         value: T;
         abstract swap(obj: Iterator<T>): void;
     }
+}
+declare namespace std {
     /**
      * <p> This class reverses the direction in which a bidirectional or random-access iterator iterates through a range.
      * </p>
@@ -334,625 +3205,6 @@ declare namespace std {
      */
     function end<Key, T>(container: base.MapContainer<Key, T>): MapIterator<Key, T>;
 }
-declare namespace std {
-    /**
-     * <p> Vector, the dynamic array. </p>
-     *
-     * <p> {@link Vector}s are sequence containers representing arrays that can change in size. </p>
-     *
-     * <p> Just like arrays, {@link Vector}s use contiguous storage locations for their elements, which means that
-     * their elements can also be accessed using offsets on regular pointers to its elements, and just as efficiently
-     * as in arrays. But unlike arrays, their size can change dynamically, with their storage being handled
-     * automatically by the  </p>
-     *
-     * <p> Internally, {@link Vector}s use a dynamically allocated array to store their elements. This array may need
-     * to be reallocated in order to grow in size when new elements are inserted, which implies allocating a new
-     * array and moving all elements to it. This is a relatively expensive task in terms of processing time, and
-     * thus, {@link Vector}s do not reallocate each time an element is added to the  </p>
-     *
-     * <p> Instead, {@link Vector} containers may allocate some extra storage to accommodate for possible growth, and
-     * thus the container may have an actual {@link capacity} greater than the storage strictly needed to contain its
-     * elements (i.e., its {@link size}). Libraries can implement different strategies for growth to balance between
-     * memory usage and reallocations, but in any case, reallocations should only happen at logarithmically growing
-     * intervals of {@link size} so that the insertion of individual elements at the end of the {@link Vector} can be
-     * provided with amortized constant time complexity (see {@link push_back push_back()}). </p>
-     *
-     * <p> Therefore, compared to arrays, {@link Vector}s consume more memory in exchange for the ability to manage
-     * storage and grow dynamically in an efficient way. </p>
-     *
-     * <p> Compared to the other dynamic sequence containers ({@link Deque}s, {@link List}s), {@link Vector Vectors}
-     * are very efficient accessing its elements (just like arrays) and relatively efficient adding or removing
-     * elements from its end. For operations that involve inserting or removing elements at positions other than the
-     * end, they perform worse than the others, and have less consistent iterators and references than {@link List}s.
-     * </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Sequence </dt>
-     *	<dd>
-     *		Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
-     *		accessed by their position in this sequence.
-     *	</dd>
-     *
-     *	<dt> Dynamic array </dt>
-     *	<dd>
-     *		Allows direct access to any element in the sequence, even through pointer arithmetics, and provides
-     *		relatively fast addition/removal of elements at the end of the sequence.
-     *	</dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @reference http://www.cplusplus.com/reference/vector/vector
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class Vector<T> extends Array<T> implements base.IArrayContainer<T> {
-        /**
-         * Type definition of {@link Vector}'s {@link VectorIterator iterator}.
-         */
-        static iterator: typeof VectorIterator;
-        /**
-         * <p> Default Constructor. </p>
-         *
-         * <p> Constructs an empty container, with no elements. </p>
-         */
-        constructor();
-        /**
-         * @inheritdoc
-         */
-        constructor(array: Array<T>);
-        /**
-         * <p> Initializer list Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
-         *
-         * @param array An array containing elements to be copied and contained.
-         */
-        constructor(n: number);
-        /**
-         * <p> Fill Constructor. </p>
-         *
-         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
-         *
-         * @param n Initial container size (i.e., the number of elements in the container at construction).
-         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
-         *			  initialized to a copy of this value.
-         */
-        constructor(n: number, val: T);
-        /**
-         * <p> Copy Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
-         *
-         * @param container Another container object of the same type (with the same class template
-         *					arguments <i>T</i>), whose contents are either copied or acquired.
-         */
-        constructor(container: base.IContainer<T>);
-        /**
-         * <p> Range Constructor. </p>
-         *
-         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
-         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * @inheritdoc
-         */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        assign(n: number, val: T): void;
-        /**
-         * @inheritdoc
-         */
-        reserve(size: number): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        begin(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        end(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rbegin(): VectorReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rend(): VectorReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        size(): number;
-        /**
-         * @inheritdoc
-         */
-        capacity(): number;
-        /**
-         * @inheritdoc
-         */
-        empty(): boolean;
-        /**
-         * @inheritdoc
-         */
-        at(index: number): T;
-        /**
-         * @inheritdoc
-         */
-        set(index: number, val: T): T;
-        /**
-         * @inheritdoc
-         */
-        front(): T;
-        /**
-         * @inheritdoc
-         */
-        back(): T;
-        /**
-         * @inheritdoc
-         */
-        push_back(val: T): void;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
-         * <i>position</i>, effectively increasing the container size by one. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Position in the {@link Vector} where the new element is inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param val Value to be copied to the inserted element.
-         *
-         * @return An iterator that points to the newly inserted element.
-         */
-        insert(position: VectorIterator<T>, val: T): VectorIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
-         * @param val Value to be copied (or moved) to the inserted elements.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
-         * iterators. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorIterator<T>, begin: InputIterator, end: InputIterator): VectorIterator<T>;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
-         * <i>position</i>, effectively increasing the container size by one. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Position in the {@link Vector} where the new element is inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param val Value to be copied to the inserted element.
-         *
-         * @return An iterator that points to the newly inserted element.
-         */
-        insert(position: VectorReverseIterator<T>, val: T): VectorReverseIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
-         * @param val Value to be copied (or moved) to the inserted elements.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: VectorReverseIterator<T>, n: number, val: T): VectorReverseIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
-         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
-         * iterators. </p>
-         *
-         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
-         * {@link size} surpasses the current {@link capacity}. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
-         * positions other than the {@link end end()} causes the container to relocate all the elements that were
-         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
-         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
-         *
-         * @param position Position in the {@link Vector} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a
-         *				   {@link VectorIterator random access iterator} type that points to elements.
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorReverseIterator<T>, begin: InputIterator, end: InputIterator): VectorReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        private insert_by_val(position, val);
-        /**
-         * @hidden
-         */
-        protected insert_by_repeating_val(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<InputIterator extends Iterator<T>>(position: VectorIterator<T>, first: InputIterator, last: InputIterator): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        pop_back(): void;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(position: VectorIterator<T>): VectorIterator<T>;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(position: VectorReverseIterator<T>): VectorReverseIterator<T>;
-        /**
-         * <p> Erase element. </p>
-         *
-         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
-         * position other than the {@link end end()} causes the container to relocate all the elements after the
-         * segment erased to their new positions. This is generally an inefficient operation compared to the one
-         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the new location of the element that followed the last element erased by
-         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(first: VectorReverseIterator<T>, last: VectorReverseIterator<T>): VectorReverseIterator<T>;
-        /**
-         * @hiddde
-         */
-        protected erase_by_range(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.IContainer<T>): void;
-    }
-    /**
-     * <p> An iterator of Vector. </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class VectorIterator<T> extends Iterator<T> implements base.IArrayIterator<T> {
-        /**
-         * Sequence number of iterator in the source {@link Vector}.
-         */
-        private index_;
-        /**
-         * <p> Construct from the source {@link Vector container}. </p>
-         *
-         * <h4> Note </h4>
-         * <p> Do not create the iterator directly, by yourself. </p>
-         * <p> Use {@link Vector.begin begin()}, {@link Vector.end end()} in {@link Vector container} instead. </p>
-         *
-         * @param source The source {@link Vector container} to reference.
-         * @param index Sequence number of the element in the source {@link Vector}.
-         */
-        constructor(source: Vector<T>, index: number);
-        /**
-         * @hidden
-         */
-        private vector;
-        /**
-         * @inheritdoc
-         */
-        /**
-         * Set value.
-         */
-        value: T;
-        /**
-         * Get index.
-         */
-        index: number;
-        /**
-         * @inheritdoc
-         */
-        prev(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        next(): VectorIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        advance(n: number): VectorIterator<T>;
-        /**
-         * <p> Whether an iterator is equal with the iterator. </p>
-         *
-         * <p> Compare two iterators and returns whether they are equal or not. </p>
-         *
-         * <h4> Note </h4>
-         * <p> Iterator's equal_to() only compare souce container and index number. </p>
-         *
-         * <p> Although elements in a pair, key and value are equal_to, if the source map or
-         * index number is different, then the {@link equal_to equal_to()} will return false. If you want to
-         * compare the elements of a pair, compare them directly by yourself. </p>
-         *
-         * @param obj An iterator to compare
-         * @return Indicates whether equal or not.
-         */
-        equal_to<U extends T>(obj: VectorIterator<U>): boolean;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: VectorIterator<T>): void;
-    }
-    /**
-     * <p> A reverse-iterator of Vector. </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class VectorReverseIterator<T> extends ReverseIterator<T, VectorIterator<T>, VectorReverseIterator<T>> implements base.IArrayIterator<T> {
-        constructor(base: VectorIterator<T>);
-        /**
-         * @inheritdoc
-         */
-        protected create_neighbor(): VectorReverseIterator<T>;
-        /**
-         * Set value.
-         */
-        value: T;
-        /**
-         * Get index.
-         */
-        index: number;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> An abstract container. </p>
-     *
-     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     * 	<dt> Sequence </dt>
-     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
-     *		 accessed by their position in this sequence. </dd>
-     *
-     * 	<dt> Doubly-linked list </dt>
-     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing
-     *		 constant time insert and erase operations before or after a specific element (even of entire ranges),
-     *		 but no direct random access. </dd>
-     * </dl>
-     *
-     * @param <T> Type of elements.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    abstract class Container<T> implements IContainer<T> {
-        /**
-         * <p> Default Constructor. </p>
-         *
-         * <p> Constructs an empty container, with no elements. </p>
-         */
-        constructor();
-        /**
-         * <p> Initializer list Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
-         *
-         * @param array An array containing elements to be copied and contained.
-         */
-        constructor(array: Array<T>);
-        /**
-         * <p> Copy Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
-         *
-         * @param container Another container object of the same type (with the same class template
-         *					arguments <i>T</i>), whose contents are either copied or acquired.
-         */
-        constructor(container: IContainer<T>);
-        /**
-         * <p> Range Constructor. </p>
-         *
-         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
-         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * @inheritdoc
-         */
-        abstract assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        abstract begin(): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract end(): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract rbegin(): base.IReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract rend(): base.IReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract size(): number;
-        /**
-         * @inheritdoc
-         */
-        empty(): boolean;
-        /**
-         * @inheritdoc
-         */
-        abstract push<U extends T>(...items: U[]): number;
-        /**
-         * @inheritdoc
-         */
-        abstract insert(position: Iterator<T>, val: T): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract erase(position: Iterator<T>): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        abstract erase<U extends T>(begin: Iterator<U>, end: Iterator<U>): Iterator<T>;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: IContainer<T>): void;
-    }
-}
 declare namespace std {
     /**
      * <p> Double ended queue. </p>
@@ -1266,6 +3518,8 @@ declare namespace std {
          */
         private swap_deque(obj);
     }
+}
+declare namespace std {
     /**
      * <p> An iterator of {@link Deque}. </p>
      *
@@ -1334,6 +3588,8 @@ declare namespace std {
          */
         swap(obj: DequeIterator<T>): void;
     }
+}
+declare namespace std {
     /**
      * <p> A reverse-iterator of Deque. </p>
      *
@@ -1361,1824 +3617,820 @@ declare namespace std {
 }
 declare namespace std {
     /**
-     * <p> Doubly linked list. </p>
+     * <p> Function handling termination on exception </p>
      *
-     * <p> {@link List}s are sequence containers that allow constant time insert and erase operations anywhere within the
-     * sequence, and iteration in both directions. </p>
+     * <p> Calls the current terminate handler. </p>
      *
-     * <p> List containers are implemented as doubly-linked lists; Doubly linked lists can store each of the elements they
-     * contain in different and unrelated storage locations. The ordering is kept internally by the association to each
-     * element of a link to the element preceding it and a link to the element following it. </p>
+     * <p> By default, the terminate handler calls abort. But this behavior can be redefined by calling
+     * {@link set_terminate}. </p>
      *
-     * <p> They are very similar to forward_list: The main difference being that forward_list objects are single-linked
-     * lists, and thus they can only be iterated forwards, in exchange for being somewhat smaller and more efficient. </p>
+     * <p> This function is automatically called when no <code>catch</code> handler can be found for a thrown exception,
+     * or for some other exceptional circumstance that makes impossible to continue the exception handling process. </p>
      *
-     * <p> Compared to other base standard sequence containers (array, vector and deque), lists perform generally better
-     * in inserting, extracting and moving elements in any position within the container for which an iterator has already
-     * been obtained, and therefore also in algorithms that make intensive use of these, like sorting algorithms. </p>
+     * <p> This function is provided so that the terminate handler can be explicitly called by a program that needs to
+     * abnormally terminate, and works even if {@link set_terminate} has not been used to set a custom terminate handler
+     * (calling abort in this case). </p>
+     */
+    function terminate(): void;
+    /**
+     * <p> Set <i>terminate handler</i> function. </p>
      *
-     * <p> The main drawback of lists and forward_lists compared to these other sequence containers is that they lack
-     * direct access to the elements by their position; For example, to access the sixth element in a list, one has to
-     * iterate from a known position (like the beginning or the end) to that position, which takes linear time in the
-     * distance between these. They also consume some extra memory to keep the linking information associated to each
-     * element (which may be an important factor for large lists of small-sized elements). </p>
+     * <p> A <i>terminate handler</i> function is a function automatically called when the exception handling process has
+     * to be abandoned for some reason. This happens when no catch handler can be found for a thrown exception, or for
+     * some other exceptional circumstance that makes impossible to continue the exception handling process. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> Before this function is called by the program for the first time, the default behavior is to call abort. </p>
      *
-     * <h3> Container properties </h3>
-     * <dl>
-     * 	<dt> Sequence </dt>
-     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are accessed by
-     *		 their position in this sequence. </dd>
+     * <p> A program may explicitly call the current terminate handler function by calling {@link terminate}. </p>
      *
-     * 	<dt> Doubly-linked list </dt>
-     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing constant time
-     *		 insert and erase operations before or after a specific element (even of entire ranges), but no direct random
-     *		 access. </dd>
-     * </dl>
+     * @param f Function that takes no parameters and returns no value (<i>void</i>).
+     */
+    function set_terminate(f: () => void): void;
+    /**
+     * <p> Get <i>terminate handler</i> function. </p>
      *
-     * @param <T> Type of the elements.
+     * <p> The <i>terminate handler</i> function is automatically called when no <code>catch</code> handler can be found
+     * for a thrown exception, or for some other exceptional circumstance that makes impossible to continue the exception
+     * handling process. </p>
      *
-     * @reference http://www.cplusplus.com/reference/list/list/
+     * <p> If no such function has been set by a previous call to {@link set_terminate}, the function returns a
+     * <i>null-pointer</i>. </p>
+     *
+     * @return If {@link set_terminate} has previously been called by the program, the function returns the current
+     *		   <i>terminate handler</i> function. Otherwise, it returns a <i>null-pointer</i>.
+     */
+    function get_terminate(): () => void;
+    /**
+     * <p> Standard exception class. </p>
+     *
+     * <p> Base class for standard exceptions. </p>
+     *
+     * <p> All objects thrown by components of the standard library are derived from this class.
+     * Therefore, all standard exceptions can be caught by catching this type by reference. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/exception/exception
      * @author Jeongho Nam <http://samchon.org>
      */
-    class List<T> extends base.Container<T> implements base.IDequeContainer<T> {
+    class Exception extends Error {
         /**
-         * An iterator of beginning.
+         * A message representing specification about the Exception.
          */
-        protected begin_: ListIterator<T>;
+        private description;
         /**
-         * An iterator of end.
-         */
-        protected end_: ListIterator<T>;
-        /**
-         * Number of elements in the {@link List}.
-         */
-        protected size_: number;
-        /**
-         * <p> Default Constructor. </p>
-         *
-         * <p> Constructs an empty container, with no elements. </p>
+         * Default Constructor.
          */
         constructor();
         /**
-         * <p> Initializer list Constructor. </p>
+         * <p> Construct from a message. </p>
          *
-         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
-         *
-         * @param array An array containing elements to be copied and contained.
+         * @param message A message representing specification about the Exception.
          */
-        constructor(items: Array<T>);
+        constructor(message: string);
         /**
-         * <p> Fill Constructor. </p>
+         * <p> Get string identifying exception. </p>
+         * <p> Returns a string that may be used to identify the exception. </p>
          *
-         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
-         *
-         * @param n Initial container size (i.e., the number of elements in the container at construction).
-         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
-         *			  initialized to a copy of this value.
+         * <p> The particular representation pointed by the returned value is implementation-defined.
+         * As a virtual function, derived classes may redefine this function so that specify value are
+         * returned. </p>
          */
-        constructor(size: number, val: T);
-        /**
-         * <p> Copy Constructor. </p>
-         *
-         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
-         *
-         * @param container Another container object of the same type (with the same class template
-         *					arguments <i>T</i>), whose contents are either copied or acquired.
-         */
-        constructor(container: base.IContainer<T>);
-        /**
-         * <p> Range Constructor. </p>
-         *
-         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
-         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
+        what(): string;
         /**
          * @inheritdoc
          */
-        assign(n: number, val: T): void;
+        message: string;
         /**
          * @inheritdoc
          */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        begin(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        end(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rbegin(): ListReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rend(): ListReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        size(): number;
-        /**
-         * @inheritdoc
-         */
-        front(): T;
-        /**
-         * @inheritdoc
-         */
-        back(): T;
-        /**
-         * @inheritdoc
-         */
-        push<U extends T>(...items: U[]): number;
-        /**
-         * @inheritdoc
-         */
-        push_front(val: T): void;
-        /**
-         * @inheritdoc
-         */
-        push_back(val: T): void;
-        /**
-         * @inheritdoc
-         */
-        pop_front(): void;
-        /**
-         * @inheritdoc
-         */
-        pop_back(): void;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new element is inserted.
-         *				   {@link iterator}> is a member type, defined as a
-         *				   {@link ListIterator bidirectional iterator} type that points to elements.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the newly inserted element; <i>val</i>.
-         */
-        insert(position: ListIterator<T>, val: T): ListIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param size Number of elements to insert.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param begin An iterator specifying range of the begining element.
-         * @param end An iterator specifying range of the ending element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new element is inserted.
-         *				   {@link iterator}> is a member type, defined as a
-         *				   {@link ListReverseIterator bidirectional iterator} type that points to elements.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the newly inserted element; <i>val</i>.
-         */
-        insert(position: ListReverseIterator<T>, val: T): ListReverseIterator<T>;
-        /**
-         * <p> Insert elements by repeated filling. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param size Number of elements to insert.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: ListReverseIterator<T>, size: number, val: T): ListReverseIterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
-         * inserted. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
-         * inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
-         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
-         *				   elements.
-         * @param begin An iterator specifying range of the begining element.
-         * @param end An iterator specifying range of the ending element.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: ListReverseIterator<T>, begin: InputIterator, end: InputIterator): ListReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        private insert_by_val(position, val);
-        /**
-         * @hidden
-         */
-        protected insert_by_repeating_val(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
-        /**
-         * <p> Erase an element. </p>
-         *
-         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link List}.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
-         */
-        erase(position: ListIterator<T>): ListIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         *
-         * <p> Removes from the {@link List} container a range of elements. </p>
-         *
-         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
-         */
-        erase(begin: ListIterator<T>, end: ListIterator<T>): ListIterator<T>;
-        /**
-         * <p> Erase an element. </p>
-         *
-         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the {@link List}.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
-         */
-        erase(position: ListReverseIterator<T>): ListReverseIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         *
-         * <p> Removes from the {@link List} container a range of elements. </p>
-         *
-         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
-         *
-         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
-         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function call.
-         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
-         */
-        erase(begin: ListReverseIterator<T>, end: ListReverseIterator<T>): ListReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        protected erase_by_range(first: ListIterator<T>, last: ListIterator<T>): ListIterator<T>;
-        /**
-         * <p> Remove duplicate values. </p>
-         *
-         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
-         *
-         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
-         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
-         */
-        unique(): void;
-        /**
-         * <p> Remove duplicate values. </p>
-         *
-         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
-         *
-         * <p> The argument <i>binary_pred</i> is a specific comparison function that determine the <u>uniqueness</u>
-         * of an element. In fact, any behavior can be implemented (and not only an equality comparison), but notice
-         * that the function will call <code>binary_pred(it.value, it.prev().value)</code> for all pairs of elements
-         * (where <code>it</code> is an iterator to an element, starting from the second) and remove <code>it</code>
-         * from the {@link List} if the predicate returns <code>true</code>.
-         *
-         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
-         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
-         *
-         * @param binary_pred Binary predicate that, taking two values of the same type than those contained in the
-         *					  {@link List}, returns <code>true</code> to remove the element passed as first argument
-         *					  from the container, and <code>false</code> otherwise. This shall be a function pointer
-         *					  or a function object.
-         */
-        unique(binary_pred: (left: T, right: T) => boolean): void;
-        /**
-         * <p> Remove elements with specific value. </p>
-         *
-         * <p> Removes from the container all the elements that compare equal to <i>val</i>. This calls the
-         * destructor of these objects and reduces the container {@link size} by the number of elements removed. </p>
-         *
-         * <p> Unlike member function {@link List.erase}, which erases elements by their position (using an
-         * iterator), this function ({@link List.remove}) removes elements by their value. </p>
-         *
-         * <p> A similar function, {@link List.remove_if}, exists, which allows for a condition other than an
-         * equality comparison to determine whether an element is removed. </p>
-         *
-         * @param val Value of the elements to be removed.
-         */
-        remove(val: T): void;
-        /**
-         * <p> Remove elements fulfilling condition. </p>
-         *
-         * <p> Removes from the container all the elements for which <i>pred</i> returns <code>true</code>. This
-         * calls the destructor of these objects and reduces the container {@link size} by the number of elements
-         * removed. </p>
-         *
-         * <p> The function calls <code>pred(it.value)</code> for each element (where <code>it</code> is an iterator
-         * to that element). Any of the elements in the list for which this returns <code>true</code>, are removed
-         * from the  </p>
-         *
-         * @param pred Unary predicate that, taking a value of the same type as those contained in the forward_list
-         *			   object, returns <code>true</code> for those values to be removed from the container, and
-         *			   <code>false</code> for those remaining. This can either be a function pointer or a function
-         *			   object.
-         */
-        remove_if(pred: (val: T) => boolean): void;
-        /**
-         * <p> Merge sorted {@link List Lists}. </p>
-         *
-         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
-         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
-         * </p>
-         *
-         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
-         * them into their ordered position within container (which expands in {@link size} by the number of elements
-         * transferred). The operation is performed without constructing nor destroying any element: they are
-         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
-         * move-construction or not. </p>
-         *
-         * <p> This function requires that the {@link List} containers have their elements already ordered by value
-         * ({@link less}) before the call. For an alternative on unordered {@link List Lists}, see
-         * {@link List.splice}. </p>
-         *
-         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
-         * value according to the strict weak ordering defined by {@link less}. The resulting order of equivalent
-         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
-         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
-         *
-         * The function does nothing if <code>this == obj</code>.
-         *
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
-         *			  passed.
-         */
-        merge<U extends T>(obj: List<U>): void;
-        /**
-         * <p> Merge sorted {@link List Lists}. </p>
-         *
-         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
-         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
-         * </p>
-         *
-         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
-         * them into their ordered position within container (which expands in {@link size} by the number of elements
-         * transferred). The operation is performed without constructing nor destroying any element: they are
-         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
-         * move-construction or not. </p>
-         *
-         * <p> The argument <i>compare</i> is a specific predicate to perform the comparison operation between
-         * elements. This comparison shall produce a strict weak ordering of the elements (i.e., a consistent
-         * transitive comparison, without considering its reflexiveness).
-         *
-         * <p> This function requires that the {@link List} containers have their elements already ordered by
-         * <i>compare</i> before the call. For an alternative on unordered {@link List Lists}, see
-         * {@link List.splice}. </p>
-         *
-         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
-         * value according to the strict weak ordering defined by <i>compare</i>. The resulting order of equivalent
-         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
-         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
-         *
-         * The function does nothing if <code>this == obj</code>.
-         *
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
-         *			  passed.
-         * @param compare Binary predicate that, taking two values of the same type than those contained in the
-         *				  {@link list}, returns <code>true</code> if the first argument is considered to go before
-         *				  the second in the strict weak ordering it defines, and <code>false</code> otherwise.
-         *				  This shall be a function pointer or a function object.
-         */
-        merge<U extends T>(obj: List<U>, compare: (left: T, right: T) => boolean): void;
-        /**
-         * <p> Transfer elements from {@link List} to {@link List}. </p>
-         *
-         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
-         *
-         * <p> This effectively inserts all elements into the container and removes them from <i>obj</i>, altering
-         * the sizes of both containers. The operation does not involve the construction or destruction of any
-         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
-         * value_type supports move-construction or not. </p>
-         *
-         * <p> This first version (1) transfers all the elements of <i>obj</i> into the  </p>
-         *
-         * @param position Position within the container where the elements of <i>obj</i> are inserted.
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         */
-        splice<U extends T>(position: ListIterator<T>, obj: List<U>): void;
-        /**
-         * <p> Transfer an element from {@link List} to {@link List}. </p>
-         *
-         * <p> Transfers an element from <i>obj</i>, which is pointed by an {@link ListIterator iterator} <i>it</i>,
-         * into the container, inserting the element at specified <i>position</i>. </p>
-         *
-         * <p> This effectively inserts an element into the container and removes it from <i>obj</i>, altering the
-         * sizes of both containers. The operation does not involve the construction or destruction of any element.
-         * They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type
-         * supports move-construction or not. </p>
-         *
-         * <p> This second version (2) transfers only the element pointed by <i>it</i> from <i>obj</i> into the
-         *  </p>
-         *
-         * @param position Position within the container where the element of <i>obj</i> is inserted.
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
-         *			  being spliced.
-         * @param it {@link ListIterator Iterator} to an element in <i>obj</i>. Only this single element is
-         *			 transferred.
-         */
-        splice<U extends T>(position: ListIterator<T>, obj: List<U>, it: ListIterator<U>): void;
-        /**
-         * <p> Transfer elements from {@link List} to {@link List}. </p>
-         *
-         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
-         *
-         * <p> This effectively inserts those elements into the container and removes them from <i>obj</i>, altering
-         * the sizes of both containers. The operation does not involve the construction or destruction of any
-         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
-         * value_type supports move-construction or not. </p>
-         *
-         * <p> This third version (3) transfers the range [<i>begin</i>, <i>end</i>) from <i>obj</i> into the
-         *  </p>
-         *
-         * @param position Position within the container where the elements of <i>obj</i> are inserted.
-         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
-         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
-         *			  being spliced.
-         * @param begin {@link ListIterator An Iterator} specifying initial position of a range of elements in
-         *				<i>obj</i>. Transfers the elements in the range [<b><i>begin</i></b>, <i>end</i>) to
-         *				<i>position</i>.
-         * @param end {@link ListIterator An Iterator} specifying final position of a range of elements in
-         *			  <i>obj</i>. Transfers the elements in the range [<i>begin</i>, <b><i>end</i></b>) to
-         *			  <i>position</i>. Notice that the range includes all the elements between <i>begin<i/> and
-         *			  <i>end</i>, including the element pointed by <i>begin</i> but not the one pointed by <i>end</i>.
-         */
-        splice<U extends T>(position: ListIterator<T>, obj: List<U>, begin: ListIterator<U>, end: ListIterator<U>): void;
-        /**
-         * <p> Sort elements in  </p>
-         *
-         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
-         *
-         * <p> The sorting is performed by applying an algorithm that uses {@link less}. This comparison shall
-         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
-         * considering its reflexiveness). </p>
-         *
-         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
-         * order they had before the call. </p>
-         *
-         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
-         * Elements are moved within the  </p>
-         */
-        sort(): void;
-        /**
-         * <p> Sort elements in  </p>
-         *
-         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
-         *
-         * <p> The sorting is performed by applying an algorithm that uses <i>compare</i>. This comparison shall
-         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
-         * considering its reflexiveness). </p>
-         *
-         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
-         * order they had before the call. </p>
-         *
-         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
-         * Elements are moved within the  </p>
-         *
-         * @param compare Binary predicate that, taking two values of the same type of those contained in the
-         *				  {@link List}, returns <code>true</code> if the first argument goes before the second
-         *				  argument in the strict weak ordering it defines, and <code>false</code> otherwise. This
-         *				  shall be a function pointer or a function object.
-         */
-        sort(compare: (left: T, right: T) => boolean): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.IContainer<T>): void;
-        /**
-         * @hidden
-         */
-        private swap_list(obj);
+        name: string;
     }
     /**
-     * <p> An iterator, node of a List. </p>
+     * <p> Logic error exception. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> This class defines the type of objects thrown as exceptions to report errors in the internal
+     * logical of the program, such as violation of logical preconditions or class invariants. </p>
      *
+     * <p> These errors are presumably detectable before the program executes. </p>
+     *
+     * <p> It is used as a base class for several logical error exceptions. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/logic_error
      * @author Jeongho Nam <http://samchon.org>
      */
-    class ListIterator<T> extends Iterator<T> {
-        private prev_;
-        private next_;
-        private value_;
+    class LogicError extends Exception {
         /**
-         * <p> Construct from the source {@link List container}. </p>
+         * <p> Construct from a message. </p>
          *
-         * <h4> Note </h4>
-         * <p> Do not create the iterator directly, by yourself. </p>
-         * <p> Use {@link List.begin begin()}, {@link List.end end()} in {@link List container} instead. </p>
-         *
-         * @param source The source {@link List container} to reference.
-         * @param prev A refenrece of previous node ({@link ListIterator iterator}).
-         * @param next A refenrece of next node ({@link ListIterator iterator}).
-         * @param value Value to be stored in the node (iterator).
+         * @param message A message representing specification about the Exception.
          */
-        constructor(source: List<T>, prev: ListIterator<T>, next: ListIterator<T>, value: T);
-        /**
-         * @inheritdoc
-         */
-        set_prev(it: ListIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_next(next: ListIterator<T>): void;
-        private list();
-        /**
-         * @inheritdoc
-         */
-        prev(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        next(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        advance(step: number): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        value: T;
-        /**
-         * @inheritdoc
-         */
-        equal_to(obj: ListIterator<T>): boolean;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: ListIterator<T>): void;
+        constructor(message: string);
     }
     /**
-     * <p> A reverse-iterator of List. </p>
+     * <p> Domain error exception. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> This class defines the type of objects thrown as exceptions to report domain errors. </p>
      *
-     * @param <T> Type of the elements.
+     * <p> Generally, the domain of a mathematical function is the subset of values that it is defined for.
+     * For example, the square root function is only defined for non-negative numbers. Thus, a negative number
+     * for such a function would qualify as a domain error. </p>
      *
+     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
+     * exception to be thrown by programs. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/domain_error
      * @author Jeongho Nam <http://samchon.org>
      */
-    class ListReverseIterator<T> extends ReverseIterator<T, ListIterator<T>, ListReverseIterator<T>> {
-        constructor(base: ListIterator<T>);
+    class DomainError extends LogicError {
         /**
-         * @inheritdoc
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
          */
-        protected create_neighbor(): ListReverseIterator<T>;
+        constructor(message: string);
+    }
+    /**
+     * <p> Invalid argument exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report an invalid argument. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
+     * also throw exceptions of this type to signal invalid arguments. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/invalid_argument
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class InvalidArgument extends LogicError {
         /**
-         * @inheritdoc
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
          */
-        value: T;
+        constructor(message: string);
+    }
+    /**
+     * <p> Length error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report a length error. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
+     * such as vector and string also throw exceptions of this type to signal errors resizing. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/length_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class LengthError extends LogicError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Out-of-range exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report an out-of-range error. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
+     * such as vector, deque, string and bitset also throw exceptions of this type to signal arguments
+     * out of range. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/out_of_range
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class OutOfRange extends LogicError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Runtime error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report errors that can only be
+     * detected during runtime. </p>
+     *
+     * <p> It is used as a base class for several runtime error exceptions. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/runtime_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class RuntimeError extends Exception {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Overflow error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to arithmetic overflow errors. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
+     * also throw exceptions of this type to signal range errors. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/outflow_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class OverflowError extends RuntimeError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Underflow error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to arithmetic underflow errors. </p>
+     *
+     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
+     * exception to be thrown by programs. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/underflow_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class UnderflowError extends RuntimeError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
+    }
+    /**
+     * <p> Range error exception. </p>
+     *
+     * <p> This class defines the type of objects thrown as exceptions to report range errors in internal
+     * computations. </p>
+     *
+     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
+     * also throw exceptions of this type to signal range errors. </p>
+     *
+     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     *
+     * @reference http://www.cplusplus.com/reference/stdexcept/range_error
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class RangeError extends RuntimeError {
+        /**
+         * <p> Construct from a message. </p>
+         *
+         * @param message A message representing specification about the Exception.
+         */
+        constructor(message: string);
     }
 }
 declare namespace std {
     /**
-     * <p> FIFO queue. </p>
+     * <p> Function object class for equality comparison. </p>
      *
-     * <p> {@link Queue}s are a type of container adaptor, specifically designed to operate in a FIFO context
-     * (first-in first-out), where elements are inserted into one end of the container and extracted from the other.
-     * </p>
+     * <p> Binary function object class whose call returns whether its two arguments compare <i>equal</i> (as returned by
+     * operator ==). </p>
      *
-     * <p> {@link Queue}s are implemented as containers adaptors, which are classes that use an encapsulated object of
-     * a specific container class as its underlying container, providing a specific set of member functions to access
-     * its elements. Elements are pushed into the {@link IDeque.back back()} of the specific container and popped from
-     * its {@link IDeque.front front()}. </p>
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
+     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
      *
-     * <p> {@link container_ The underlying container} may be one of the standard container class template or some
-     * other specifically designed container class. This underlying container shall support at least the following
-     * operations: </p>
+     * @param x First element to compare.
+     * @param y Second element to compare.
      *
-     * <ul>
-     *	<li> empty </li>
-     *	<li> size </li>
-     *	<li> front </li>
-     *	<li> back </li>
-     *	<li> push_back </li>
-     *	<li> pop_front </li>
-     * </ul>
+     * @return Whether the arguments are equal.
+     */
+    function equal_to<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function object class for non-equality comparison. </p>
      *
-     * <p> The standard container classes {@link Deque} and {@link List} fulfill these requirements.
-     * By default, if no container class is specified for a particular {@link Queue} class instantiation, the standard
-     * container {@link List} is used. </p>
+     * <p> Binary function object class whose call returns whether its two arguments compare <i>not equal</i> (as returned
+     * by operator operator!=). </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
+     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
      *
-     * @param <T> Type of elements.
+     * @param x First element to compare.
+     * @param y Second element to compare.
      *
-     * @reference http://www.cplusplus.com/reference/queue/queue
+     * @return Whether the arguments are not equal.
+     */
+    function not_equal_to<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function for less-than inequality comparison. </p>
+     *
+     * <p> Binary function returns whether the its first argument compares less than the second. </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
+     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
+     * This member function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()}</code>,
+     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
+     *
+     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
+     *			  <i>operator<()</i> or method {@link IComparable.less less}.
+     *
+     * @param x First element, the standard of comparison.
+     * @param y Second element compare with the first.
+     *
+     * @return Whether the first parameter is less than the second.
+     */
+    function less<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function object class for less-than-or-equal-to comparison. </p>
+     *
+     * <p> Binary function object class whose call returns whether the its first argument compares {@link less less than} or
+     * {@link equal_to equal to} the second (as returned by operator <=). </p>
+     *
+     * <p> Generically, <i>function objects</i> are instances of a class with member function {@link IComparable.less less}
+     * and {@link IComparable.equal_to equal_to} defined. This member function allows the object to be used with the same
+     * syntax as a function call. </p>
+     *
+     * @param x First element, the standard of comparison.
+     * @param y Second element compare with the first.
+     *
+     * @return Whether the <i>x</i> is {@link less less than} or {@link equal_to equal to} the <i>y</i>.
+     */
+    function less_equal<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function for greater-than inequality comparison. </p>
+     *
+     * <p> Binary function returns whether the its first argument compares greater than the second. </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function {@link less} and
+     * {@link equal_to equal_to()} defined. If an object doesn't have those methods, then its own uid will be used
+     * to compare insteadly. This member function allows the object to be used with the same syntax as a function
+     * call. </p>
+     *
+     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()},
+     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
+     *
+     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
+     *			  <i>operator>()</i> or method {@link IComparable.greater greater}.
+     *
+     * @return Whether the <i>x</i> is greater than the <i>y</i>.
+     */
+    function greater<T>(x: T, y: T): boolean;
+    /**
+     * <p> Function object class for greater-than-or-equal-to comparison. </p>
+     *
+     * <p> Binary function object class whose call returns whether the its first argument compares
+     * {@link greater greater than} or {@link equal_to equal to} the second (as returned by operator >=). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
+     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
+     * This member function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x First element, the standard of comparison.
+     * @param y Second element compare with the first.
+     *
+     * @return Whether the <i>x</i> is {@link greater greater than} or {@link equal_to equal to} the <i>y</i>.
+     */
+    function greater_equal<T>(x: T, y: T): boolean;
+    /**
+     * <p> Logical AND function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of the <i>logical "and"</i> operation between its two
+     * arguments (as returned by operator &&). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
+     * function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of logical AND operation.
+     */
+    function logical_and<T>(x: T, y: T): boolean;
+    /**
+     * <p> Logical OR function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of the <i>logical "or"</i> operation between its two
+     * arguments (as returned by operator ||). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
+     * function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of logical OR operation.
+     */
+    function logical_or<T>(x: T, y: T): boolean;
+    /**
+     * <p> Logical NOT function object class. </p>
+     *
+     * <p> Unary function object class whose call returns the result of the <i>logical "not"</i> operation on its argument
+     * (as returned by operator !). </p>
+     *
+     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
+     * function allows the object to be used with the same syntax as a function call. </p>
+     *
+     * @param x Target element.
+     *
+     * @return Result of logical NOT operation.
+     */
+    function logical_not<T>(x: T): boolean;
+    /**
+     * <p> Bitwise AND function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
+     * its two arguments (as returned by operator &). </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of bitwise AND operation.
+     */
+    function bit_and(x: number, y: number): number;
+    /**
+     * <p> Bitwise OR function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
+     * its two arguments (as returned by operator &). </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of bitwise OR operation.
+     */
+    function bit_or(x: number, y: number): number;
+    /**
+     * <p> Bitwise XOR function object class. </p>
+     *
+     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "exclusive or"</i>
+     * operation between its two arguments (as returned by operator ^). </p>
+     *
+     * @param x First element.
+     * @param y Second element.
+     *
+     * @return Result of bitwise XOR operation.
+     */
+    function bit_xor(x: number, y: number): number;
+    /**
+     * <p> Comparable instance. </p>
+     *
+     * <p> {@link IComparable} is a common interface for objects who can compare each other. </p>
+     *
+     * @reference https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html
      * @author Jeongho Nam <http://samchon.org>
      */
-    class Queue<T> {
-        /**
-         * The <i>underlying object</i> for implementing the <i>FIFO</i>
-         */
-        private container_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: Queue<T>);
-        /**
-         * <p> Return size. </p>
-         * <p> Returns the number of elements in the {@link Queue}. </p>
-         *
-         * <p> This member function effectively calls member {@link IDeque.size size()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return The number of elements in the {@link container_ underlying container}.
-         */
-        size(): number;
-        /**
-         * <p> Test whether container is empty. </p>
-         * <p> returns whether the {@link Queue} is empty: i.e. whether its <i>size</i> is zero. </p>
-         *
-         * <p> This member function efeectively calls member {@link IDeque.empty empty()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return <code>true</code> if the {@link container_ underlying container}'s size is 0,
-         *		   <code>false</code> otherwise. </p>
-         */
-        empty(): boolean;
-        /**
-         * <p> Access next element. </p>
-         * <p> Returns a value of the next element in the {@link Queue}. </p>
-         *
-         * <p> The next element is the "oldest" element in the {@link Queue} and the same element that is popped out
-         * from the queue when {@link pop Queue.pop()} is called. </p>
-         *
-         * <p> This member function effectively calls member {@link IDeque.front front()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A value of the next element in the {@link Queue}.
-         */
-        front(): T;
-        /**
-         * <p> Access last element. </p>
-         *
-         * <p> Returns a vaue of the last element in the queue. This is the "newest" element in the queue (i.e. the
-         * last element pushed into the queue). </p>
-         *
-         * <p> This member function effectively calls the member function {@link IDeque.back back()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A value of the last element in the {@link Queue}.
-         */
-        back(): T;
-        /**
-         * <p> Insert element. </p>
-         *
-         * <p> Inserts a new element at the end of the {@link Queue}, after its current last element.
-         * The content of this new element is initialized to <i>val</i>. </p>
-         *
-         * <p> This member function effectively calls the member function {@link IDeque.push_back push_back()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @param val Value to which the inserted element is initialized.
-         */
-        push(val: T): void;
-        /**
-         * <p> Remove next element. </p>
-         *
-         * <p> Removes the next element in the {@link Queue}, effectively reducing its size by one. </p>
-         *
-         * <p> The element removed is the "oldest" element in the {@link Queue} whose value can be retrieved by calling
-         * member {@link front Queue.front()} </p>.
-         *
-         * <p> This member function effectively calls the member function {@link IDeque.pop_front pop_front()} of the
-         * {@link container_ underlying container} object. </p>
-         */
-        pop(): void;
-        /**
-         * <p> Swap contents. </p>
-         *
-         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
-         *
-         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
-         * the {@link container_ underlying containers}. </p>
-         *
-         * @param obj Another {@link Queue} container adaptor of the same type (i.e., instantiated with the same
-         *			  template parameter, <b>T</b>). Sizes may differ. </p>
-         */
-        swap(obj: Queue<T>): void;
-    }
-    /**
-     * <p> Priority queue. </p>
-     *
-     * <p> {@link PriorityQueue Priority queues} are a type of container adaptors, specifically designed such that its
-     * first element is always the greatest of the elements it contains, according to some <i>strict weak ordering</i>
-     * criterion. </p>
-     *
-     * <p> This context is similar to a <i>heap</i>, where elements can be inserted at any moment, and only the
-     * <i>max heap</i> element can be retrieved (the one at the top in the {@link PriorityQueue priority queue}). </p>
-     *
-     * <p> {@link PriorityQueue Priority queues} are implemented as <i>container adaptors</i>, which are classes that
-     * use an encapsulated object of a specific container class as its {@link container_ underlying container},
-     * providing a specific set of member functions to access its elements. Elements are popped from the <i>"back"</i>
-     * of the specific container, which is known as the <i>top</i> of the {@link PriorityQueue Priority queue}. </p>
-     *
-     * <p> The {@link container_ underlying container} may be any of the standard container class templates or some
-     * other specifically designed container class. The container shall be accessible through
-     * {@link IArrayIterator random access iterators} and support the following operations: </p>
-     *
-     * <ul>
-     *	<li> empty() </li>
-     *	<li> size() </li>
-     *	<li> front() </li>
-     *	<li> push_back() </li>
-     *	<li> pop_back() </li>
-     * </ul>
-     *
-     * <p> The standard container classes {@link Vector} and {@link Deque} fulfill these requirements. By default, if
-     * no container class is specified for a particular {@link PriorityQueue} class instantiation, the standard
-     * container {@link Vector} is used. </p>
-     *
-     * <p> Support of {@link IArrayIterator random access iterators} is required to keep a heap structure internally
-     * at all times. This is done automatically by the container adaptor by automatically calling the algorithm
-     * functions <i>make_heap</i>, <i>push_heap</i> and <i>pop_heap</i> when needed. </p>
-     *
-     * @param <T> Type of the elements.
-     *
-     * @reference http://www.cplusplus.com/reference/queue/priority_queue/
-     * @author Jeongho Nam
-     */
-    class PriorityQueue<T> {
-        /**
-         * <p> The <i>underlying container</i> for implementing the <i>priority queue</i>. </p>
-         *
-         * <p> Following standard definition from the C++ committee, the <i>underlying container</i> should be one of
-         * {@link Vector} or {@link Deque}, however, I've adopted {@link TreeMultiSet} instead of them. Of course,
-         * there are proper reasons for adapting the {@link TreeMultiSet} even violating standard advice. </p>
-         *
-         * <p> <i>Underlying container</i> of {@link PriorityQueue} must keep a condition; the highest (or lowest)
-         * element must be placed on the terminal node for fast retrieval and deletion. To keep the condition with
-         * {@link Vector} or {@link Deque}, lots of times will only be spent for re-arranging elements. It calls
-         * rearrangement functions like <i>make_heap</i>, <i>push_heap</i> and <i>pop_head</i> for rearrangement. </p>
-         *
-         * <p> However, the {@link TreeMultiSet} container always keeps arrangment automatically without additional
-         * operations and it even meets full criteria of {@link PriorityQueue}. Those are the reason why I've adopted
-         * {@link TreeMultiSet} as the <i>underlying container</i> of {@link PriorityQueue}. </p>
-         */
-        private container_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
-         *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: T, right: T) => boolean);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<T>);
-        /**
-         * Contruct from elements with compare.
-         *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: base.Container<T>);
-        /**
-         * Copy Constructor with compare.
-         *
-         * @param container A container to be copied.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.Container<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Range Constructor.
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * Range Constructor with compare.
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_container(container: base.IContainer<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_range(begin: Iterator<T>, end: Iterator<T>): void;
-        /**
-         * <p> Return size. </p>
-         *
-         * <p> Returns the number of elements in the {@link PriorityQueue}. </p>
-         *
-         * <p> This member function effectively calls member {@link IArray.size size} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return The number of elements in the underlying
-         */
-        size(): number;
-        /**
-         * <p> Test whether container is empty. </p>
-         *
-         * <p> Returns whether the {@link PriorityQueue} is empty: i.e. whether its {@link size} is zero. </p>
-         *
-         * <p> This member function effectively calls member {@link IARray.empty empty} of the
-         * {@link container_ underlying container} object. </p>
-         */
-        empty(): boolean;
-        /**
-         * <p> Access top element. </p>
-         *
-         * <p> Returns a constant reference to the top element in the {@link PriorityQueue}. </p>
-         *
-         * <p> The top element is the element that compares higher in the {@link PriorityQueue}, and the next that is
-         * removed from the container when {@link PriorityQueue.pop} is called. </p>
-         *
-         * <p> This member function effectively calls member {@link IArray.front front} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A reference to the top element in the {@link PriorityQueue}.
-         */
-        top(): T;
-        /**
-         * <p> Insert element. </p>
-         *
-         * <p> Inserts a new element in the {@link PriorityQueue}. The content of this new element is initialized to
-         * <i>val</i>.
-         *
-         * <p> This member function effectively calls the member function {@link IArray.push_back push_back} of the
-         * {@link container_ underlying container} object, and then reorders it to its location in the heap by calling
-         * the <i>push_heap</i> algorithm on the range that includes all the elements of the  </p>
-         *
-         * @param val Value to which the inserted element is initialized.
-         */
-        push(val: T): void;
-        /**
-         * <p> Remove top element. </p>
-         *
-         * <p> Removes the element on top of the {@link PriorityQueue}, effectively reducing its {@link size} by one.
-         * The element removed is the one with the highest (or lowest) value. </p>
-         *
-         * <p> The value of this element can be retrieved before being popped by calling member
-         * {@link PriorityQueue.top}. </p>
-         *
-         * <p> This member function effectively calls the <i>pop_heap</i> algorithm to keep the heap property of
-         * {@link PriorityQueue PriorityQueues} and then calls the member function {@link IArray.pop_back pop_back} of
-         * the {@link container_ underlying container} object to remove the element. </p>
-         */
-        pop(): void;
-        /**
-         * <p> Swap contents. </p>
-         *
-         * <p> Exchanges the contents of the container adaptor by those of <i>obj</i>, swapping both the
-         * {@link container_ underlying container} value and their comparison function using the corresponding
-         * {@link std.swap swap} non-member functions (unqualified). </p>
-         *
-         * <p> This member function has a <i>noexcept</i> specifier that matches the combined <i>noexcept</i> of the
-         * {@link IArray.swap swap} operations on the {@link container_ underlying container} and the comparison
-         * functions. </p>
-         *
-         * @param obj {@link PriorityQueue} container adaptor of the same type (i.e., instantiated with the same
-         *			  template parameters, <b>T</b>). Sizes may differ.
-         */
-        swap(obj: PriorityQueue<T>): void;
-    }
-}
-declare namespace std {
-    /**
-     * <p> LIFO stack. </p>
-     *
-     * <p> {@link Stack}s are a type of container adaptor, specifically designed to operate in a LIFO context
-     * (last-in first-out), where elements are inserted and extracted only from one end of the  </p>
-     *
-     * <p> {@link Stack}s are implemented as containers adaptors, which are classes that use an encapsulated object of
-     * a specific container class as its <i>underlying container</i>, providing a specific set of member functions to
-     * access its elements. Elements are pushed/popped from the {@link ILinearContainer.back back()} of the
-     * {@link ILinearContainer specific container}, which is known as the top of the {@link Stack}. </p>
-     *
-     * <p> {@link container_ The underlying container} may be any of the standard container class templates or some
-     * other specifically designed container class. The container shall support the following operations: </p>
-     *
-     * <ul>
-     *	<li> empty </li>
-     *	<li> size </li>
-     *	<li> front </li>
-     *	<li> back </li>
-     *	<li> push_back </li>
-     *	<li> pop_back </li>
-     * </ul>
-     *
-     * <p> The standard container classes {@link Vector}, {@link Deque} and {@link List} fulfill these requirements.
-     * By default, if no container class is specified for a particular {@link Stack} class instantiation, the standard
-     * container {@link List} is used. </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @param <T> Type of elements.
-     *
-     * @reference http://www.cplusplus.com/reference/stack/stack
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class Stack<T> {
-        /**
-         * The <i>underlying object</i> for implementing the <i>LIFO</i>
-         */
-        private container_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Copy Constructor.
-         */
-        constructor(stack: Stack<T>);
-        /**
-         * <p> Return size. </p>
-         *
-         * <p> Returns the number of elements in the {@link Stack}. </p>
-         *
-         * <p> This member function effectively calls member {@link ILinearContainer.size size()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return The number of elements in the {@link container_ underlying container}.
-         */
-        size(): number;
-        /**
-         * <p> Test whether container is empty. </p>
-         *
-         * <p> returns whether the {@link Stack} is empty: i.e. whether its <i>size</i> is zero. </p>
-         *
-         * <p> This member function effectively calls member {@link ILinearContainer.empty empty()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return <code>true</code> if the <i>underlying container</i>'s size is 0,
-         *		   <code>false</code> otherwise. </p>
-         */
-        empty(): boolean;
-        /**
-         * <p> Access next element. </p>
-         *
-         * <p> Returns a value of the top element in the {@link Stack} </p>.
-         *
-         * <p> Since {@link Stack}s are last-in first-out containers, the top element is the last element inserted into
-         * the {@link Stack}. </p>
-         *
-         * <p> This member function effectively calls member {@link ILinearContainer.back back()} of the
-         * {@link container_ underlying container} object. </p>
-         *
-         * @return A value of the top element in the {@link Stack}.
-         */
-        top(): T;
-        /**
-         * <p> Insert element. </p>
-         *
-         * <p> Inserts a new element at the top of the {@link Stack}, above its current top element. </p>
-         *
-         * <p> This member function effectively calls the member function
-         * {@link ILinearContainer.push_back push_back()} of the {@link container_ underlying container} object. </p>
-         *
-         * @param val Value to which the inserted element is initialized.
-         */
-        push(val: T): void;
-        /**
-         * <p> Remove top element. </p>
-         *
-         * <p> Removes the element on top of the {@link Stack}, effectively reducing its size by one. </p>
-         *
-         * <p> The element removed is the latest element inserted into the {@link Stack}, whose value can be retrieved
-         * by calling member {@link top Stack.top()} </p>.
-         *
-         * <p> This member function effectively calls the member function {@link ILinearContainer.pop_back pop_back()}
-         * of the {@link container_ underlying container} object. </p>
-         */
-        pop(): void;
-        /**
-         * <p> Swap contents. </p>
-         *
-         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
-         *
-         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
-         * the {@link container_ underlying containers}. </p>
-         *
-         * @param obj Another {@link Stack} container adaptor of the same type (i.e., instantiated with the same
-         *			  template parameter, <b>T</b>). Sizes may differ. </p>
-         */
-        swap(obj: Stack<T>): void;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> An abstract set. </p>
-     *
-     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
-     * individual elements based on their value. </p>
-     *
-     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
-     *
-     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
-     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
-     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    abstract class SetContainer<T> extends Container<T> {
-        /**
-         * Type definition of {@link SetContainer}'s {@link SetIterator iterator}.
-         */
-        static iterator: typeof SetIterator;
-        /**
-         * <p> {@link List} storing elements. </p>
-         *
-         * <p> Storing elements and keeping those sequence of the {@link SetContainer} are implemented by
-         * {@link data_ this list container}. Implementing index-table is also related with {@link data_ this list}
-         * by storing {@link ListIterator iterators} ({@link SetIterator} references {@link ListIterator}) who are
-         * created from {@link data_ here}. </p>
-         */
-        protected data_: List<T>;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from elements.
-         */
-        constructor(items: Array<T>);
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: IContainer<T>);
-        /**
-         * Construct from range iterators.
-         */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
-        /**
-         * @hidden
-         */
-        protected init(): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_container(container: IContainer<T>): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_range<InputIterator extends Iterator<T>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: Iterator<U>, end: Iterator<U>): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * <p> Get iterator to element. </p>
-         *
-         * <p> Searches the container for an element with <i>key</i> as value and returns an iterator to it if found,
-         * otherwise it returns an iterator to {@link end end()} (the element past the end of the container). </p>
-         *
-         * <p> Another member function, {@link count count()}, can be used to just check whether a particular element
-         * exists. </p>
-         *
-         * @param key Key to be searched for.
-         *
-         * @return An iterator to the element, if the specified value is found, or {@link end end()} if it is not
-         *		   found in the
-         */
-        abstract find(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        begin(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        end(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rbegin(): SetReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        rend(): SetReverseIterator<T>;
-        /**
-         * <p> Whether have the item or not. </p>
-         *
-         * <p> Indicates whether a set has an item having the specified identifier. </p>
-         *
-         * @param key Key value of the element whose mapped value is accessed.
-         *
-         * @return Whether the set has an item having the specified identifier.
-         */
-        has(val: T): boolean;
-        /**
-         * <p> Count elements with a specific key. </p>
-         *
-         * <p> Searches the container for elements with a value of k and returns the number of elements found. </p>
-         *
-         * @param key Value of the elements to be counted.
-         *
-         * @return The number of elements in the container with a <i>key</i>.
-         */
-        abstract count(val: T): number;
-        /**
-         * @inheritdoc
-         */
-        size(): number;
-        /**
-         * @inheritdoc
-         */
-        push<U extends T>(...args: U[]): number;
-        /**
-         * <p> Insert an element with hint. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
-         * number of elements inserted. </p>
-         *
-         * @param hint Hint for the position where the element can be inserted.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator pointing to either the newly inserted element or to the element that already had its
-         *		   same value in the {@link SetContainer}.
-         */
-        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * <p> Insert an element with hint. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
-         * number of elements inserted. </p>
-         *
-         * @param hint Hint for the position where the element can be inserted.
-         * @param val Value to be inserted as an element.
-         *
-         * @return An iterator pointing to either the newly inserted element or to the element that already had its
-         *		   same value in the {@link SetContainer}.
-         */
-        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
-        /**
-         * <p> Insert elements with a range of a  </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
-         * number of elements inserted. </p>
-         *
-         * @param begin An iterator specifying range of the begining element.
-         * @param end An iterator specifying range of the ending element.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @hidden
-         */
-        protected abstract insert_by_val(val: T): any;
-        /**
-         * @hidden
-         */
-        protected abstract insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected abstract insert_by_range<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * <p> Erase an element. </p>
-         * <p> Removes from the set container the elements whose value is <i>key</i>. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * @param key Value of the elements to be erased.
-         *
-         * @return Number of elements erased.
-         */
-        erase(val: T): number;
-        /**
-         * @inheritdoc
-         */
-        erase(it: SetIterator<T>): SetIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         * <p> Removes from the set container a range of elements.. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         */
-        erase(begin: SetIterator<T>, end: SetIterator<T>): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        erase(it: SetReverseIterator<T>): SetReverseIterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         * <p> Removes from the set container a range of elements.. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         */
-        erase(begin: SetReverseIterator<T>, end: SetReverseIterator<T>): SetReverseIterator<T>;
-        /**
-         * @hidden
-         */
-        private erase_by_iterator(first, last?);
-        /**
-         * @hidden
-         */
-        private erase_by_val(val);
-        /**
-         * @hidden
-         */
-        private erase_by_range(begin, end);
-        /**
-         * <p> Abstract method handling insertions for indexing. </p>
-         *
-         * <p> This method, {@link handle_insert} is designed to register the <i>first to last</i> to somewhere storing
-         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
-         *
-         * <p> When {@link insert} is called, new elements will be inserted into the {@link data_ list container} and new
-         * {@link SetIterator iterators} <i>first to last</i>, pointing the inserted elements, will be created and the
-         * newly created iterators <i>first to last</i> will be shifted into this method {@link handle_insert} after the
-         * insertions. </p>
-         *
-         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
-         * will be registered into the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
-         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first</i> to <i>last</i> will be
-         * registered into the {@link HashSet.hash_buckets_ hash bucket}. </p>
-         *
-         * @param first An {@link SetIterator} to the initial position in a sequence.
-         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
-         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-         */
-        protected abstract handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * <p> Abstract method handling deletions for indexing. </p>
-         *
-         * <p> This method, {@link handle_insert} is designed to unregister the <i>first to last</i> to somewhere storing
-         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
-         *
-         * <p> When {@link erase} is called with <i>first to last</i>, {@link SetIterator iterators} positioning somewhere
-         * place to be deleted, is memorized and shifted to this method {@link handle_erase} after the deletion process is
-         * terminated. </p>
-         *
-         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
-         * will be unregistered from the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
-         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first to last</i> will be
-         * unregistered from the {@link HashSet.hash_buckets_ hash bucket}. </p>
-         *
-         * @param first An {@link SetIterator} to the initial position in a sequence.
-         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
-         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-         */
-        protected abstract handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
-    }
-}
-declare namespace std {
-    /**
-     * <p> An iterator of a Set. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class SetIterator<T> extends Iterator<T> implements IComparable<SetIterator<T>> {
-        private list_iterator_;
-        /**
-         * <p> Construct from source and index number. </p>
-         *
-         * <h4> Note </h4>
-         * <p> Do not create iterator directly. </p>
-         * <p> Use begin(), find() or end() in Map instead. </p>
-         *
-         * @param map The source Set to reference.
-         * @param index Sequence number of the element in the source Set.
-         */
-        constructor(source: base.SetContainer<T>, it: ListIterator<T>);
-        /**
-         * @inheritdoc
-         */
-        prev(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        next(): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        advance(size: number): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        private set;
-        get_list_iterator(): ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        value: T;
-        /**
-         * @inheritdoc
-         */
-        equal_to<U extends T>(obj: SetIterator<U>): boolean;
-        /**
-         * @inheritdoc
-         */
-        less<U extends T>(obj: SetIterator<U>): boolean;
-        /**
-         * @inheritdoc
+    interface IComparable<T> extends Object {
+        /**
+         * <p> Indicates whether some other object is &quot;equal to&quot; this one. </p>
+         *
+         * <p> The {@link equal_to} method implements an equivalence relation on non-null object references: </p>
+         *
+         * <ul>
+         *	<li>
+         *		It is <b>reflexive</b>: for any non-null reference value <code>x</code>, <code>x.equal_to(x)</code>
+         *		should return <code>true</code>.
+         *	</li>
+         *	<li>
+         *		It is <b>symmetric</b>: for any non-null reference values <code>x</code> and <code>y</code>,
+         *		<code>x.equal_to(y)</code> should return <code>true</code> if and only if <code>y.equal_to(x)</code>
+         *		returns <code>true</code>. </li>
+         *	<li>
+         *		It is <b>transitive</b>: for any non-null reference values <code>x</code>, <code>y</code>, and
+         *		<code>z</code>, if <code>x.equal_to(y)</code> returns <code>true</code> and <code>y.equal_to(z)</code>
+         *		returns <code>true</code>, then <code>x.equal_to(z)</code> should return <code>true</code>.
+         *	</li>
+         *	<li>
+         *		It is <b>consistent</b>: for any non-null reference values <code>x</code> and <code>y</code>, multiple
+         *		invocations of <code>x.equal_to(y)</code> consistently return <code>true</code> or consistently return
+         *		<code>false</code>, provided no information used in equal_to comparisons on the objects is modified.
+         *	</li>
+         *	<li>
+         *		For any non-null reference value <code>x</code>, <code>x.equal_to(null)</code> should return
+         *		<code>false</code>.
+         *	</li>
+         * </ul>
+         *
+         * <p> The {@link equal_to} method for interface {@link IComparable} implements the most discriminating possible
+         * equivalence relation on objects; that is, for any non-null reference values <code>x</code> and
+         * <code>y</code>, this method returns <code>true</code> if and only if <code>x</code> and <code>y</code>
+         * refer to the same object (<code>x == y</code> has the value <code>true</code>). </p>
+         *
+         * <p> Note that it is generally necessary to override the {@link hash_code} method whenever this method is
+         * overridden, so as to maintain the general contract for the {@link hash_code} method, which states that
+         * equal objects must have equal hash codes. </p>
+         *
+         * <ul>
+         *	<li> {@link IComparable.equal_to} is called by {@link std.equal_to}. </li>
+         * </ul>
+         *
+         * @param obj the reference object with which to compare.
+         *
+         * @return <code>true</code> if this object is the same as the obj argument; <code>false</code> otherwise.
+         */
+        equal_to(obj: T): boolean;
+        /**
+         * <p> Less-than inequality comparison. </p>
+         *
+         * <p> Binary method returns whether the the instance compares less than the <i>obj</i>. </p>
+         *
+         * <ul>
+         *	<li>
+         *		{@link IComparable.less} is called by {@link std.less}. Also, this method can be used on standard
+         *		algorithms such as {@link sort sort()}</code>, {@link merge merge()} or
+         *		{@link TreeMap.lower_bound lower_bound()}.
+         *	</li>
+         * </ul>
+         *
+         * @param obj the reference object with which to compare.
+         *
+         * @return Whether the first parameter is less than the second.
+         */
+        less(obj: T): boolean;
+        /**
+         * <p> Issue a hash code. </p>
+         *
+         * <p> Returns a hash code value for the object. This method is supported for the benefit of hash tables such
+         * as those provided by hash containers; {@link HashSet}, {@link HashMap}, {@link MultiHashSet} and
+         * {@link MultiHashMap}. </p>
+         *
+         * <p> As much as is reasonably practical, the {@link hash_code} method defined by interface
+         * {@link IComparable} does return distinct integers for distinct objects. (This is typically implemented by
+         * converting the internal address of the object into an integer, but this implementation technique is not
+         * required by the JavaScript programming language.) </p>
+         *
+         * <ul>
+         *	<li>
+         *		{@link IComparable.hash_code} is called by {@link std.hash_code}. If you want to keep basically
+         *		provided hash function, then returns {@link std.Hash.code}; <code>return std.Hash.code(this);</code>
+         *	</li>
+         * </ul>
+         *
+         * @return An hash code who represents the object.
          */
         hash(): number;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: SetIterator<T>): void;
     }
     /**
-     * <p> A reverse-iterator of Set. </p>
+     * <p> Default hash function for number. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> Unary function that defines the default hash function used by the standard library. </p>
      *
-     * @param <T> Type of the elements.
+     * <p> The functional call returns a hash value of its argument: A hash value is a value that depends solely on
+     * its argument, returning always the same value for the same argument (for a given execution of a program). The
+     * value returned shall have a small likelihood of being the same as the one returned for a different argument.
+     * </p>
      *
-     * @author Jeongho Nam <http://samchon.org>
+     * @param val Value to be hashed.
+     *
+     * @return Returns a hash value for its argument, as a value of type number. The number is an unsigned integer.
      */
-    class SetReverseIterator<T> extends ReverseIterator<T, SetIterator<T>, SetReverseIterator<T>> {
-        constructor(base: SetIterator<T>);
-        /**
-         * @inheritdoc
-         */
-        protected create_neighbor(): SetReverseIterator<T>;
-    }
-}
-declare namespace std.base {
+    function hash(val: number): number;
     /**
-     * <p> An abstract set. </p>
+     * <p> Default hash function for string. </p>
      *
-     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
-     * individual elements based on their value. </p>
+     * <p> Unary function that defines the default hash function used by the standard library. </p>
      *
-     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to uniquely
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be modified
-     * once in the container - they can be inserted and removed, though. </p>
+     * <p> The functional call returns a hash value of its argument: A hash value is a value that depends solely on
+     * its argument, returning always the same value for the same argument (for a given execution of a program). The
+     * value returned shall have a small likelihood of being the same as the one returned for a different argument.
+     * </p>
      *
-     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
-     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
-     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     * @param str A string to be hashed.
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Unique keys </dt>
-     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
-     *
-     * @author Jeongho Nam <http://samchon.org>
+     * @return Returns a hash value for its argument, as a value of type number. The number is an unsigned integer.
      */
-    abstract class UniqueSet<T> extends SetContainer<T> {
-        /**
-         * @inheritdoc
-         */
-        count(key: T): number;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
-         * the number of element inserted (zero or one). </p>
-         *
-         * <p> Because elements in a {@link UniqueSet UniqueSets} are unique, the insertion operation checks whether
-         * each inserted element is equivalent to an element already in the container, and if so, the element is not
-         * inserted, returning an iterator to this existing element (if the function returns a value). </p>
-         *
-         * <p> For a similar container allowing for duplicate elements, see {@link MultiSet}. </p>
-         *
-         * @param key Value to be inserted as an element.
-         *
-         * @return A {@link Pair}, with its member {@link Pair.first} set to an iterator pointing to either the newly
-         *		   inserted element or to the equivalent element already in the {@link UniqueSet}. The
-         *		   {@link Pair.second} element in the {@link Pair} is set to true if a new element was inserted or
-         *		   false if an equivalent element already existed.
-         */
-        insert(val: T): Pair<SetIterator<T>, boolean>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: UniqueSet<T>): void;
-    }
-}
-declare namespace std.base {
+    function hash(str: string): number;
     /**
-     * <p> An abstract set. </p>
+     * <p> Default hash function for Object. </p>
      *
-     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
-     * individual elements based on their value. </p>
+     * <p> Unary function that defines the default hash function used by the standard library. </p>
      *
-     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
+     * <p> The functional call returns a hash value of its argument: A hash value is a value that depends solely on
+     * its argument, returning always the same value for the same argument (for a given execution of a program). The
+     * value returned shall have a small likelihood of being the same as the one returned for a different argument.
+     * </p>
      *
-     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
-     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
-     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     * <p> The default {@link hash} function of Object returns a value returned from {@link hash hash(number)} with
+     * an <b>unique id</b> of each Object. If you want to specify {@link hash} function of a specific class, then
+     * define a member function <code>public hash(): number</code> in the class. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * @param obj Object to be hashed.
      *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Multiple equivalent keys </dt>
-     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
-     *
-     * @author Jeongho Nam <http://samchon.org>
+     * @return Returns a hash value for its argument, as a value of type number. The number is an unsigned integer.
      */
-    abstract class MultiSet<T> extends SetContainer<T> {
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
-         * the number of elements inserted. </p>
-         *
-         * @param key Value to be inserted as an element.
-         *
-         * @return An iterator to the newly inserted element.
-         */
-        insert(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: MultiSet<T>): void;
-    }
+    function hash(obj: Object): number;
+    /**
+     * <p> Exchange contents of {@link IContainers containers}. </p>
+     *
+     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must have
+     * same type of elements (same template parameters), although sizes may differ. </p>
+     *
+     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i> before
+     * the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references and
+     * pointers remain valid for the swapped objects. </p>
+     *
+     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
+     * ownership over their assets to the other container (i.e., the containers exchange references to their data, without
+     * actually performing any element copy or movement): It behaves as if <i>left</i>.
+     * {@link IContainer.swap swap}(<i>right</i>) was called. </p>
+     *
+     * @param left A {@link IContainer container} to swap its contents.
+     * @param right A {@link IContainer container} to swap its contents.
+     */
+    function swap<T>(left: base.IContainer<T>, right: base.IContainer<T>): void;
+    /**
+     * <p> Exchange contents of queues. </p>
+     *
+     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
+     *
+     * @param left A {@link Queue} container of the same type. Size may differ.
+     * @param right A {@link Queue} container of the same type. Size may differ.
+     */
+    function swap<T>(left: Queue<T>, right: Queue<T>): void;
+    /**
+     * <p> Exchange contents of {@link PriorityQueue PriorityQueues}. </p>
+     *
+     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
+     *
+     * @param left A {@link PriorityQueue} container of the same type. Size may differ.
+     * @param right A {@link PriorityQueue} container of the same type. Size may differ.
+     */
+    function swap<T>(left: PriorityQueue<T>, right: PriorityQueue<T>): void;
+    /**
+     * <p> Exchange contents of {@link Stack Stacks}. </p>
+     *
+     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
+     *
+     * @param left A {@link Stack} container of the same type. Size may differ.
+     * @param right A {@link Stack} container of the same type. Size may differ.
+     */
+    function swap<T>(left: Stack<T>, right: Stack<T>): void;
+    /**
+     * <p> Exchanges the contents of two {@link UniqueMap unique maps}. </p>
+     *
+     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
+     * be of the same type (same template parameters), although sizes may differ. </p>
+     *
+     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
+     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
+     * and pointers remain valid for the swapped objects. </p>
+     *
+     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
+     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
+     * without actually performing any element copy or movement): It behaves as if
+     * <i>left</i>.{@link UniqueMap.swap swap}(<i>right</i>) was called. </p>
+     *
+     * @param left An {@link UniqueMap unique map} to swap its conents.
+     * @param right An {@link UniqueMap unique map} to swap its conents.
+     */
+    function swap<Key, T>(left: base.UniqueMap<Key, T>, right: base.UniqueMap<Key, T>): void;
+    /**
+     * <p> Exchanges the contents of two {@link MultiMap multi maps}. </p>
+     *
+     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
+     * be of the same type (same template parameters), although sizes may differ. </p>
+     *
+     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
+     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
+     * and pointers remain valid for the swapped objects. </p>
+     *
+     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
+     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
+     * without actually performing any element copy or movement): It behaves as if
+     * <i>left</i>.{@link MultiMap.swap swap}(<i>right</i>) was called. </p>
+     *
+     * @param left A {@link MultiMap multi map} to swap its conents.
+     * @param right A {@link MultiMap multi map} to swap its conents.
+     */
+    function swap<Key, T>(left: base.MultiMap<Key, T>, right: base.MultiMap<Key, T>): void;
 }
 declare namespace std {
     /**
-     * <p> Hashed, unordered set. </p>
+     * <p> Bind function arguments. </p>
      *
-     * <p> {@link HashSet}s are containers that store unique elements in no particular order, and which
-     * allow for fast retrieval of individual elements based on their value. </p>
+     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
      *
-     * <p> In an {@link HashSet}, the value of an element is at the same time its <i>key</i>, that
-     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link HashSet} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
+     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
+     * <ul>
+     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
+     *	<li>
+     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
+     *		call (the one whose order number is specified by the placeholder).
+     *	</li>
+     * </ul>
      *
-     * <p> Internally, the elements in the {@link HashSet} are not sorted in any particular order, but
-     * organized into buckets depending on their hash values to allow for fast access to individual elements
-     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
+     * <p> Calling the returned object returns the same type as fn. </p>
      *
-     * <p> {@link HashSet} containers are faster than {@link TreeSet} containers to access individual
-     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
-     * subset of their elements. </p>
+     * @param fn A function object, pointer to function or pointer to member.
+     * @param args List of arguments to bind: either values, or {@link placeholders}.
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Hashed </dt>
-     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
-     *		 by their <i>key</i>. </dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Unique keys </dt>
-     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements.
-     *			  Each element in an {@link HashSet} is also uniquely identified by this value.
-     *
-     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
-     * @author Jeongho Nam <http://samchon.org>
+     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
+     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
+     *		   is a member.
      */
-    class HashSet<T> extends base.UniqueSet<T> {
-        private hash_buckets_;
-        /**
-         * @hidden
-         */
-        protected init(): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_val(val: T): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.UniqueSet<T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_set(obj);
+    function bind<Ret>(fn: (...args: any[]) => Ret, ...args: any[]): (...args: any[]) => Ret;
+    /**
+     * <p> Bind function arguments. </p>
+     *
+     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
+     *
+     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
+     * <ul>
+     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
+     *	<li>
+     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
+     *		call (the one whose order number is specified by the placeholder).
+     *	</li>
+     * </ul>
+     *
+     * <p> Calling the returned object returns the same type as fn. </p>
+     *
+     * @param fn A function object, pointer to function or pointer to member.
+     * @param thisArg This argument, owner object of the member method <i>fn</i>.
+     * @param args List of arguments to bind: either values, or {@link placeholders}.
+     *
+     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
+     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
+     *		   is a member.
+     */
+    function bind<Ret, T>(fn: (...args: any[]) => Ret, thisArg: T, ...args: any[]): (...args: any[]) => Ret;
+}
+/**
+ * <p> Bind argument placeholders. </p>
+ *
+ * <p> This namespace declares an unspecified number of objects: <i>_1</i>, <i>_2</i>, <i>_3</i>, ...</i>, which are
+ * used to specify placeholders in calls to function {@link std.bind}. </p>
+ *
+ * <p> When the function object returned by bind is called, an argument with placeholder {@link _1} is replaced by the
+ * first argument in the call, {@link _2} is replaced by the second argument in the call, and so on... For example: </p>
+ *
+ * <code>
+ * let vec: Vector<number> = new Vector<number>();
+ *
+ * let bind = std.bind(Vector.insert, _1, vec.end(), _2, _3);
+ * bind.apply(vec, 5, 1); // vec.insert(vec.end(), 5, 1);
+ * // [1, 1, 1, 1, 1]
+ * </code>
+ *
+ * <p> When a call to {@link bind} is used as a subexpression in another call to <i>bind</i>, the {@link placeholders}
+ * are relative to the outermost {@link bind} expression. </p>
+ *
+ * @reference http://www.cplusplus.com/reference/functional/placeholders/
+ * @author Jeongho Nam <http://samchon.org>
+ */
+declare namespace std.placeholders {
+    /**
+     * @hidden
+     */
+    class PlaceHolder {
+        private index_;
+        constructor(index: number);
+        index: number;
     }
     /**
-     * <p> Hashed, unordered Multiset. </p>
-     *
-     * <p> {@link HashMultiSet HashMultiSets} are containers that store elements in no particular order, allowing fast
-     * retrieval of individual elements based on their value, much like {@link HashSet} containers,
-     * but allowing different elements to have equivalent values. </p>
-     *
-     * <p> In an {@link HashMultiSet}, the value of an element is at the same time its <i>key</i>, used to
-     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link HashMultiSet} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
-     *
-     * <p> Internally, the elements in the {@link HashMultiSet} are not sorted in any particular, but
-     * organized into <i>buckets</i> depending on their hash values to allow for fast access to individual
-     * elements directly by their <i>values</i> (with a constant average time complexity on average). </p>
-     *
-     * <p> Elements with equivalent values are grouped together in the same bucket and in such a way that an
-     * iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Hashed </dt>
-     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
-     *		 by their <i>key</i>. </dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     *
-     *	<dt> Multiple equivalent keys </dt>
-     *	<dd> The container can hold multiple elements with equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements.
-     *		   Each element in an {@link UnorderedMultiSet} is also identified by this value..
-     *
-     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_multiset
-     * @author Jeongho Nam <http://samchon.org>
+     * Replaced by the first argument in the function call.
      */
-    class HashMultiSet<T> extends base.MultiSet<T> {
-        private hash_buckets_;
-        /**
-         * @hidden
-         */
-        protected init(): void;
-        /**
-         * @hidden
-         */
-        protected construct_from_array(items: Array<T>): void;
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        count(val: T): number;
-        /**
-         * @hidden
-         */
-        protected insert_by_val(val: T): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.MultiSet<T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_set(obj);
-    }
+    const _1: PlaceHolder;
+    /**
+     * Replaced by the second argument in the function call.
+     */
+    const _2: PlaceHolder;
+    /**
+     * Replaced by the third argument in the function call.
+     */
+    const _3: PlaceHolder;
+    const _4: PlaceHolder;
+    const _5: PlaceHolder;
+    const _6: PlaceHolder;
+    const _7: PlaceHolder;
+    const _8: PlaceHolder;
+    const _9: PlaceHolder;
+    const _10: PlaceHolder;
+    const _11: PlaceHolder;
+    const _12: PlaceHolder;
+    const _13: PlaceHolder;
+    const _14: PlaceHolder;
+    const _15: PlaceHolder;
+    const _16: PlaceHolder;
+    const _17: PlaceHolder;
+    const _18: PlaceHolder;
+    const _19: PlaceHolder;
+    const _20: PlaceHolder;
 }
 declare namespace std.base {
     /**
@@ -3950,6 +5202,246 @@ declare namespace std.base {
         swap(obj: MultiMap<Key, T>): void;
     }
 }
+declare namespace std.base {
+    /**
+     * <p> Common interface for hash map. </p>
+     *
+     * <p> {@link IHashMap}s are associative containers that store elements formed by the combination of
+     * a <i>key value</i> and a <i>mapped value</i>. </p>
+     *
+     * <p> In an {@link IHashMap}, the <i>key value</i> is generally used to uniquely identify the
+     * element, while the <i>mapped value</i> is an object with the content associated to this <i>key</i>.
+     * Types of <i>key</i> and <i>mapped value</i> may differ. </p>
+     *
+     * <p> Internally, the elements in the {@link IHashMap} are not sorted in any particular order with
+     * respect to either their <i>key</i> or <i>mapped values</i>, but organized into <i>buckets</i> depending on
+     * their hash values to allow for fast access to individual elements directly by their <i>key values</i>
+     * (with a constant average time complexity on average). </p>
+     *
+     * <p> Elements with equivalent <i>keys</i> are grouped together in the same bucket and in such a way that
+     * an iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the key values.
+     *				Each element in an {@link IHashMap} is identified by a key value.
+     * @param <T> Type of the mapped value.
+     *			  Each element in an {@link IHashMap} is used to store some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_map
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IHashMap<Key, T> {
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the {@link IHashMap}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * container, until invalidated. </p>
+         *
+         * @return An iterator to the first element in the container.
+         */
+        begin(): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashMap}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the first element in the bucket.
+         */
+        begin(index: number): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @return An iterator to the element past the end of the container.
+         */
+        end(): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the element past the end of the bucket.
+         */
+        end(index: number): MapIterator<Key, T>;
+        rbegin(): MapReverseIterator<Key, T>;
+        rbegin(index: number): MapReverseIterator<Key, T>;
+        rend(): MapReverseIterator<Key, T>;
+        rend(index: number): MapReverseIterator<Key, T>;
+        /**
+         * <p> Return number of buckets. </p>
+         *
+         * <p> Returns the number of buckets in the {@link IHashMap} container. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their key. </p>
+         *
+         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
+         * table (and thus the probability of collision). The container automatically increases the number of buckets to
+         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
+         * time the number of buckets needs to be increased. </p>
+         *
+         * @return The current amount of buckets.
+         */
+        bucket_count(): number;
+        /**
+         * <p> Return bucket size. </p>
+         *
+         * <p> Returns the number of elements in bucket <i>n</i>. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
+         * value of their key. </p>
+         *
+         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
+         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
+         * (which is the average bucket size) below its {@link max_load_factor}. </p>
+         *
+         * @param n Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return The number of elements in bucket <i>n</i>.
+         */
+        bucket_size(n: number): number;
+        /**
+         * <p> Get maximum load factor. </p>
+         *
+         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @return The current load factor.
+         */
+        max_load_factor(): number;
+        /**
+         * <p> Set maximum load factor. </p>
+         *
+         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @param z The new maximum load factor.
+         */
+        max_load_factor(z: number): void;
+        /**
+         * <p> Locate element's bucket. </p>
+         *
+         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
+         *
+         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
+         * {@link begin} and {@link end}. </p>
+         *
+         * @param key Key whose bucket is to be located.
+         */
+        bucket(key: Key): number;
+        /**
+         * <p> Request a capacity change. </p>
+         *
+         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
+         * least <i>n</i> elements. </p>
+         *
+         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
+         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
+         *
+         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
+         *
+         * @param n The number of elements requested as minimum capacity.
+         */
+        reserve(n: number): void;
+        /**
+         * <p> Set number of buckets. </p>
+         *
+         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
+         *
+         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
+         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
+         * greater than <i>n</i>. </p>
+         *
+         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
+         * function may have no effect on the {@link bucket_count bucket count} and may not force a
+         * {@link HashBuckets.rehash rehash}. </p>
+         *
+         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
+         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
+         * of iteration of elements within the container. </p>
+         *
+         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
+         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
+         *
+         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
+         * {@link reserve}, that expects the number of elements in the container as argument. </p>
+         *
+         * @param n The minimum number of buckets for the container hash table.
+         */
+        rehash(n: number): void;
+    }
+}
 declare namespace std {
     /**
      * <p> Hashed, unordered map. </p>
@@ -3998,7 +5490,7 @@ declare namespace std {
      * @reference http://www.cplusplus.com/reference/unordered_map/unordered_map
      * @author Jeongho Nam <http://samchon.org>
      */
-    class HashMap<Key, T> extends base.UniqueMap<Key, T> {
+    class HashMap<Key, T> extends base.UniqueMap<Key, T> implements base.IHashMap<Key, T> {
         private hash_buckets_;
         /**
          * @hidden
@@ -4016,6 +5508,66 @@ declare namespace std {
          * @inheritdoc
          */
         find(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        begin(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        begin(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(index: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
         /**
          * @hidden
          */
@@ -4045,6 +5597,8 @@ declare namespace std {
          */
         private swap_hash_map(obj);
     }
+}
+declare namespace std {
     /**
      * <p> Hashed, unordered Multimap. </p>
      *
@@ -4117,6 +5671,66 @@ declare namespace std {
          * @inheritdoc
          */
         count(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        begin(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        begin(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): MapReverseIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(n: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
         /**
          * @hidden
          */
@@ -4147,25 +5761,20 @@ declare namespace std {
         private swap_hash_multimap(obj);
     }
 }
-declare namespace std {
+declare namespace std.base {
     /**
-     * <p> Tree-structured set, <code>std::set</code> of STL. </p>
+     * <p> An abstract set. </p>
      *
-     * <p> {@link TreeSet}s are containers that store unique elements following a specific order. </p>
+     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
+     * individual elements based on their value. </p>
      *
-     * <p> In a {@link TreeSet}, the value of an element also identifies it (the value is itself the
-     * <i>key</i>, of type <i>T</i>), and each value must be unique. The value of the elements in a
-     * {@link TreeSet} cannot be modified once in the container (the elements are always const), but they
-     * can be inserted or removed from the  </p>
+     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
      *
-     * <p> Internally, the elements in a {@link TreeSet} are always sorted following a specific strict weak
-     * ordering criterion indicated by its internal comparison method (of {@link less}). </p>
-     *
-     * <p> {@link TreeSet} containers are generally slower than {@link HashSet} containers to access
-     * individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on their
-     * order. </p>
-     *
-     * <p> {@link TreeSet}s are typically implemented as binary search trees. </p>
+     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
+     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
+     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
      * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
      *
@@ -4177,10 +5786,371 @@ declare namespace std {
      *		position in the container.
      *	</dd>
      *
-     *	<dt> Ordered </dt>
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    abstract class SetContainer<T> extends Container<T> {
+        /**
+         * Type definition of {@link SetContainer}'s {@link SetIterator iterator}.
+         */
+        static iterator: typeof SetIterator;
+        /**
+         * <p> {@link List} storing elements. </p>
+         *
+         * <p> Storing elements and keeping those sequence of the {@link SetContainer} are implemented by
+         * {@link data_ this list container}. Implementing index-table is also related with {@link data_ this list}
+         * by storing {@link ListIterator iterators} ({@link SetIterator} references {@link ListIterator}) who are
+         * created from {@link data_ here}. </p>
+         */
+        protected data_: List<T>;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from elements.
+         */
+        constructor(items: Array<T>);
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: IContainer<T>);
+        /**
+         * Construct from range iterators.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @hidden
+         */
+        protected init(): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_array(items: Array<T>): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_container(container: IContainer<T>): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_range<InputIterator extends Iterator<T>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: Iterator<U>, end: Iterator<U>): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * <p> Get iterator to element. </p>
+         *
+         * <p> Searches the container for an element with <i>key</i> as value and returns an iterator to it if found,
+         * otherwise it returns an iterator to {@link end end()} (the element past the end of the container). </p>
+         *
+         * <p> Another member function, {@link count count()}, can be used to just check whether a particular element
+         * exists. </p>
+         *
+         * @param key Key to be searched for.
+         *
+         * @return An iterator to the element, if the specified value is found, or {@link end end()} if it is not
+         *		   found in the
+         */
+        abstract find(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        begin(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): SetReverseIterator<T>;
+        /**
+         * <p> Whether have the item or not. </p>
+         *
+         * <p> Indicates whether a set has an item having the specified identifier. </p>
+         *
+         * @param key Key value of the element whose mapped value is accessed.
+         *
+         * @return Whether the set has an item having the specified identifier.
+         */
+        has(val: T): boolean;
+        /**
+         * <p> Count elements with a specific key. </p>
+         *
+         * <p> Searches the container for elements with a value of k and returns the number of elements found. </p>
+         *
+         * @param key Value of the elements to be counted.
+         *
+         * @return The number of elements in the container with a <i>key</i>.
+         */
+        abstract count(val: T): number;
+        /**
+         * @inheritdoc
+         */
+        size(): number;
+        /**
+         * @inheritdoc
+         */
+        push<U extends T>(...args: U[]): number;
+        /**
+         * <p> Insert an element with hint. </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
+         * number of elements inserted. </p>
+         *
+         * @param hint Hint for the position where the element can be inserted.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator pointing to either the newly inserted element or to the element that already had its
+         *		   same value in the {@link SetContainer}.
+         */
+        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * <p> Insert an element with hint. </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
+         * number of elements inserted. </p>
+         *
+         * @param hint Hint for the position where the element can be inserted.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator pointing to either the newly inserted element or to the element that already had its
+         *		   same value in the {@link SetContainer}.
+         */
+        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
+        /**
+         * <p> Insert elements with a range of a  </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container size by the
+         * number of elements inserted. </p>
+         *
+         * @param begin An iterator specifying range of the begining element.
+         * @param end An iterator specifying range of the ending element.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @hidden
+         */
+        protected abstract insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
+        protected abstract insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected abstract insert_by_range<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * <p> Erase an element. </p>
+         * <p> Removes from the set container the elements whose value is <i>key</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * @param key Value of the elements to be erased.
+         *
+         * @return Number of elements erased.
+         */
+        erase(val: T): number;
+        /**
+         * @inheritdoc
+         */
+        erase(it: SetIterator<T>): SetIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         * <p> Removes from the set container a range of elements.. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         */
+        erase(begin: SetIterator<T>, end: SetIterator<T>): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        erase(it: SetReverseIterator<T>): SetReverseIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         * <p> Removes from the set container a range of elements.. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         */
+        erase(begin: SetReverseIterator<T>, end: SetReverseIterator<T>): SetReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        private erase_by_iterator(first, last?);
+        /**
+         * @hidden
+         */
+        private erase_by_val(val);
+        /**
+         * @hidden
+         */
+        private erase_by_range(begin, end);
+        /**
+         * <p> Abstract method handling insertions for indexing. </p>
+         *
+         * <p> This method, {@link handle_insert} is designed to register the <i>first to last</i> to somewhere storing
+         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
+         *
+         * <p> When {@link insert} is called, new elements will be inserted into the {@link data_ list container} and new
+         * {@link SetIterator iterators} <i>first to last</i>, pointing the inserted elements, will be created and the
+         * newly created iterators <i>first to last</i> will be shifted into this method {@link handle_insert} after the
+         * insertions. </p>
+         *
+         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
+         * will be registered into the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
+         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first</i> to <i>last</i> will be
+         * registered into the {@link HashSet.hash_buckets_ hash bucket}. </p>
+         *
+         * @param first An {@link SetIterator} to the initial position in a sequence.
+         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
+         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+         */
+        protected abstract handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * <p> Abstract method handling deletions for indexing. </p>
+         *
+         * <p> This method, {@link handle_insert} is designed to unregister the <i>first to last</i> to somewhere storing
+         * those {@link SetIterator iterators} for indexing, fast accessment and retrievalance. </p>
+         *
+         * <p> When {@link erase} is called with <i>first to last</i>, {@link SetIterator iterators} positioning somewhere
+         * place to be deleted, is memorized and shifted to this method {@link handle_erase} after the deletion process is
+         * terminated. </p>
+         *
+         * <p> If the derived one is {@link RBTree tree-based} like {@link TreeSet}, the {@link SetIterator iterators}
+         * will be unregistered from the {@link TreeSet.tree_ tree} as a {@link XTreeNode tree node item}. Else if the
+         * derived one is {@link HashBuckets hash-based} like {@link HashSet}, the <i>first to last</i> will be
+         * unregistered from the {@link HashSet.hash_buckets_ hash bucket}. </p>
+         *
+         * @param first An {@link SetIterator} to the initial position in a sequence.
+         * @param last An {@link SetIterator} to the final position in a sequence. The range used is
+         *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
+         *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
+         */
+        protected abstract handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> An iterator of a Set. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class SetIterator<T> extends Iterator<T> implements IComparable<SetIterator<T>> {
+        private list_iterator_;
+        /**
+         * <p> Construct from source and index number. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Do not create iterator directly. </p>
+         * <p> Use begin(), find() or end() in Map instead. </p>
+         *
+         * @param map The source Set to reference.
+         * @param index Sequence number of the element in the source Set.
+         */
+        constructor(source: base.SetContainer<T>, it: ListIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        prev(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        next(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        advance(size: number): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        private set;
+        get_list_iterator(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        value: T;
+        /**
+         * @inheritdoc
+         */
+        equal_to<U extends T>(obj: SetIterator<U>): boolean;
+        /**
+         * @inheritdoc
+         */
+        less<U extends T>(obj: SetIterator<U>): boolean;
+        /**
+         * @inheritdoc
+         */
+        hash(): number;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: SetIterator<T>): void;
+    }
+    /**
+     * <p> A reverse-iterator of Set. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class SetReverseIterator<T> extends ReverseIterator<T, SetIterator<T>, SetReverseIterator<T>> {
+        constructor(base: SetIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        protected create_neighbor(): SetReverseIterator<T>;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> An abstract set. </p>
+     *
+     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
+     * individual elements based on their value. </p>
+     *
+     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to uniquely
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be modified
+     * once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
+     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
+     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
      *	<dd>
-     *		The elements in the container follow a strict order at all times. All inserted elements are
-     *		given a position in this order.
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
      *	</dd>
      *
      *	<dt> Set </dt>
@@ -4190,66 +6160,412 @@ declare namespace std {
      *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
      * </dl>
      *
-     * @param <T> Type of the elements.
-     *			  Each element in an {@link TreeSet} is also uniquely identified by this value.
+     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
      *
-     * @reference http://www.cplusplus.com/reference/set/set
      * @author Jeongho Nam <http://samchon.org>
      */
-    class TreeSet<T> extends base.UniqueSet<T> {
+    abstract class UniqueSet<T> extends SetContainer<T> {
         /**
-         * <i>RB-Tree+</i> object for implemeting the {@link TreeSet}.
+         * @inheritdoc
          */
-        private tree_;
+        count(key: T): number;
         /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
+         * <p> Insert an element. </p>
          *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: T, right: T) => boolean);
-        /**
-         * Contruct from elements.
+         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
+         * the number of element inserted (zero or one). </p>
          *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<T>);
-        /**
-         * Contruct from elements with compare.
+         * <p> Because elements in a {@link UniqueSet UniqueSets} are unique, the insertion operation checks whether
+         * each inserted element is equivalent to an element already in the container, and if so, the element is not
+         * inserted, returning an iterator to this existing element (if the function returns a value). </p>
          *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Copy Constructor.
-         */
-        constructor(container: base.IContainer<T>);
-        /**
-         * Copy Constructor with compare.
+         * <p> For a similar container allowing for duplicate elements, see {@link MultiSet}. </p>
          *
-         * @param container A container to be copied.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.IContainer<T>, compare: (left: T, right: T) => boolean);
-        /**
-         * Range Constructor.
+         * @param key Value to be inserted as an element.
          *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
+         * @return A {@link Pair}, with its member {@link Pair.first} set to an iterator pointing to either the newly
+         *		   inserted element or to the equivalent element already in the {@link UniqueSet}. The
+         *		   {@link Pair.second} element in the {@link Pair} is set to true if a new element was inserted or
+         *		   false if an equivalent element already existed.
          */
-        constructor(begin: Iterator<T>, end: Iterator<T>);
+        insert(val: T): Pair<SetIterator<T>, boolean>;
         /**
-         * Range Constructor with compare.
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
+         * @inheritdoc
          */
-        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: UniqueSet<T>): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> An abstract set. </p>
+     *
+     * <p> {@link SetContainer SetContainers} are containers that store elements allowing fast retrieval of
+     * individual elements based on their value. </p>
+     *
+     * <p> In an {@link SetContainer}, the value of an element is at the same time its <i>key</i>, used to
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link SetContainer} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> {@link SetContainer} stores elements, keeps sequence and enables indexing by inserting elements into a
+     * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
+     * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Multiple equivalent keys </dt>
+     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link SetContainer} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    abstract class MultiSet<T> extends SetContainer<T> {
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> Extends the container by inserting new elements, effectively increasing the container {@link size} by
+         * the number of elements inserted. </p>
+         *
+         * @param key Value to be inserted as an element.
+         *
+         * @return An iterator to the newly inserted element.
+         */
+        insert(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert(hint: SetReverseIterator<T>, val: T): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: MultiSet<T>): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> A common interface for hash set. </p>
+     *
+     * <p> {@link IHashSet}s are containers that store unique elements in no particular order, and which
+     * allow for fast retrieval of individual elements based on their value. </p>
+     *
+     * <p> In an {@link IHashSet}, the value of an element is at the same time its <i>key</i>, that
+     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link IHashSet} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> Internally, the elements in the {@link IHashSet} are not sorted in any particular order, but
+     * organized into buckets depending on their hash values to allow for fast access to individual elements
+     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
+     *
+     * <p> {@link IHashSet} containers are faster than {@link TreeSet} containers to access individual
+     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
+     * subset of their elements. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *			  Each element in an {@link IHashSet} is also uniquely identified by this value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IHashSet<T> {
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the {@link IHashSet}. </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * container, until invalidated. </p>
+         *
+         * @return An iterator to the first element in the container.
+         */
+        begin(): SetIterator<T>;
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashSet}. </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the first element in the bucket.
+         */
+        begin(index: number): SetIterator<T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @return An iterator to the element past the end of the container.
+         */
+        end(): SetIterator<T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the element past the end of the bucket.
+         */
+        end(index: number): SetIterator<T>;
+        rbegin(): SetReverseIterator<T>;
+        rbegin(index: number): SetReverseIterator<T>;
+        rend(): SetReverseIterator<T>;
+        rend(index: number): SetReverseIterator<T>;
+        /**
+         * <p> Return number of buckets. </p>
+         *
+         * <p> Returns the number of buckets in the {@link IHashSet} container. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their key. </p>
+         *
+         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
+         * table (and thus the probability of collision). The container automatically increases the number of buckets to
+         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
+         * time the number of buckets needs to be increased. </p>
+         *
+         * @return The current amount of buckets.
+         */
+        bucket_count(): number;
+        /**
+         * <p> Return bucket size. </p>
+         *
+         * <p> Returns the number of elements in bucket <i>n</i>. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
+         * value of their key. </p>
+         *
+         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
+         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
+         * (which is the average bucket size) below its {@link max_load_factor}. </p>
+         *
+         * @param n Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return The number of elements in bucket <i>n</i>.
+         */
+        bucket_size(n: number): number;
+        /**
+         * <p> Get maximum load factor. </p>
+         *
+         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @return The current load factor.
+         */
+        max_load_factor(): number;
+        /**
+         * <p> Set maximum load factor. </p>
+         *
+         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @param z The new maximum load factor.
+         */
+        max_load_factor(z: number): void;
+        /**
+         * <p> Locate element's bucket. </p>
+         *
+         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
+         *
+         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
+         * {@link begin} and {@link end}. </p>
+         *
+         * @param key Key whose bucket is to be located.
+         */
+        bucket(key: T): number;
+        /**
+         * <p> Request a capacity change. </p>
+         *
+         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
+         * least <i>n</i> elements. </p>
+         *
+         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
+         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
+         *
+         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
+         *
+         * @param n The number of elements requested as minimum capacity.
+         */
+        reserve(n: number): void;
+        /**
+         * <p> Set number of buckets. </p>
+         *
+         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
+         *
+         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
+         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
+         * greater than <i>n</i>. </p>
+         *
+         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
+         * function may have no effect on the {@link bucket_count bucket count} and may not force a
+         * {@link HashBuckets.rehash rehash}. </p>
+         *
+         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
+         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
+         * of iteration of elements within the container. </p>
+         *
+         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
+         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
+         *
+         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
+         * {@link reserve}, that expects the number of elements in the container as argument. </p>
+         *
+         * @param n The minimum number of buckets for the container hash table.
+         */
+        rehash(n: number): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> Hashed, unordered set. </p>
+     *
+     * <p> {@link HashSet}s are containers that store unique elements in no particular order, and which
+     * allow for fast retrieval of individual elements based on their value. </p>
+     *
+     * <p> In an {@link HashSet}, the value of an element is at the same time its <i>key</i>, that
+     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link HashSet} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> Internally, the elements in the {@link HashSet} are not sorted in any particular order, but
+     * organized into buckets depending on their hash values to allow for fast access to individual elements
+     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
+     *
+     * <p> {@link HashSet} containers are faster than {@link TreeSet} containers to access individual
+     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
+     * subset of their elements. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Unique keys </dt>
+     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *			  Each element in an {@link HashSet} is also uniquely identified by this value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class HashSet<T> extends base.UniqueSet<T> {
+        private hash_buckets_;
+        /**
+         * @hidden
+         */
+        protected init(): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_array(items: Array<T>): void;
         /**
          * @inheritdoc
          */
@@ -4257,78 +6573,74 @@ declare namespace std {
         /**
          * @inheritdoc
          */
-        find(val: T): SetIterator<T>;
+        find(key: T): SetIterator<T>;
         /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is not considered to go
-         * before <i>val</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(element, val) would return false. </p>
-         *
-         * <p> If the {@link Set} class is instantiated with the default comparison type ({@link less}), the
-         * function returns an iterator to the first element that is not less than <i>val</i>. </p>
-         *
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound},
-         * except in the case that the {@link Set} contains an element equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns
-         * an iterator pointing to the next element. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is not considered to go before
-         *		   <i>val</i>, or {@link Set.end} if all elements are considered to go before <i>val</i>.
+         * @inheritdoc
          */
-        lower_bound(val: T): SetIterator<T>;
+        begin(): SetIterator<T>;
         /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is not considered to go
-         * after <i>val</i>. </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(element, val) would return true. </p>
-         *
-         * <p> If the {@link Set} class is instantiated with the default comparison type ({@link less}), the
-         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the {@link Set} contains an element equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns
-         * an iterator pointing to the next element. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is not considered to go before
-         *		   <i>val</i>, or {@link Set.end} if all elements are considered to go after <i>val</i>.
+         * @inheritdoc
          */
-        upper_bound(val: T): SetIterator<T>;
+        begin(index: number): SetIterator<T>;
         /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Because all elements in a {@link Set} container are unique, the range returned will contain a
-         * single element at most. </p>
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that is considered to go after <i>val</i> according to the container's
-         * internal comparison object (key_comp). </p>
-         *
-         * <p> Two elements of a {@link Set} are considered equivalent if the container's comparison object
-         * returns false reflexively (i.e., no matter the order in which the elements are passed as arguments).
-         * </p>
-         *
-         * @param val Value to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
+         * @inheritdoc
          */
-        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        end(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(n: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: T): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
         /**
          * @hidden
          */
         protected insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
         protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
         /**
          * @hidden
@@ -4351,60 +6663,1029 @@ declare namespace std {
          */
         private swap_tree_set(obj);
     }
+}
+declare namespace std {
     /**
-     * <p> Tree-structured multiple-key set. </p>
+     * <p> Hashed, unordered Multiset. </p>
      *
-     * <p> {@link TreeMultiSet TreeMultiSets} are containers that store elements following a specific order, and
-     * where multiple elements can have equivalent values. </p>
+     * <p> {@link HashMultiSet HashMultiSets} are containers that store elements in no particular order, allowing fast
+     * retrieval of individual elements based on their value, much like {@link HashSet} containers,
+     * but allowing different elements to have equivalent values. </p>
      *
-     * <p> In a {@link TreeMultiSet}, the value of an element also identifies it (the value is itself
-     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link TreeMultiSet} cannot
-     * be modified once in the container (the elements are always const), but they can be inserted or removed
-     * from the  </p>
+     * <p> In an {@link HashMultiSet}, the value of an element is at the same time its <i>key</i>, used to
+     * identify it. <i>Keys</i> are immutable, therefore, the elements in an {@link HashMultiSet} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
      *
-     * <p> Internally, the elements in a {@link TreeMultiSet TreeMultiSets} are always sorted following a strict
-     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
+     * <p> Internally, the elements in the {@link HashMultiSet} are not sorted in any particular, but
+     * organized into <i>buckets</i> depending on their hash values to allow for fast access to individual
+     * elements directly by their <i>values</i> (with a constant average time complexity on average). </p>
      *
-     * <p> {@link TreeMultiSet} containers are generally slower than {@link HashMultiSet} containers
-     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
-     * their order. </p>
-     *
-     * <p> {@link TreeMultiSet TreeMultiSets} are typically implemented as binary search trees. </p>
+     * <p> Elements with equivalent values are grouped together in the same bucket and in such a way that an
+     * iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
      *
      * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
      *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
      *
-     *	<dt> Ordered </dt>
-     *	<dd>
-     *		The elements in the container follow a strict order at all times. All inserted elements are
-     *		given a position in this order.
-     *	</dd>
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
      *
      *	<dt> Set </dt>
      *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
      *
      *	<dt> Multiple equivalent keys </dt>
-     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     *	<dd> The container can hold multiple elements with equivalent <i>keys</i>. </dd>
      * </dl>
      *
-     * @param <T> Type of the elements. Each element in a {@link TreeMultiSet} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
+     * @param <T> Type of the elements.
+     *		   Each element in an {@link UnorderedMultiSet} is also identified by this value..
      *
-     * @reference http://www.cplusplus.com/reference/set/multiset
+     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_multiset
      * @author Jeongho Nam <http://samchon.org>
      */
-    class TreeMultiSet<T> extends base.MultiSet<T> {
+    class HashMultiSet<T> extends base.MultiSet<T> {
+        private hash_buckets_;
         /**
-         * <i>RB-Tree+</i> object for implemeting the {@link TreeMultiSet}.
+         * @hidden
          */
-        private tree_;
+        protected init(): void;
+        /**
+         * @hidden
+         */
+        protected construct_from_array(items: Array<T>): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(key: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        count(key: T): number;
+        /**
+         * @inheritdoc
+         */
+        begin(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        begin(index: number): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(index: number): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(index: number): SetReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        bucket_count(): number;
+        /**
+         * @inheritdoc
+         */
+        bucket_size(n: number): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(): number;
+        /**
+         * @inheritdoc
+         */
+        max_load_factor(z: number): void;
+        /**
+         * @inheritdoc
+         */
+        bucket(key: T): number;
+        /**
+         * @inheritdoc
+         */
+        reserve(n: number): void;
+        /**
+         * @inheritdoc
+         */
+        rehash(n: number): void;
+        /**
+         * @hidden
+         */
+        protected insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.MultiSet<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_set(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Doubly linked list. </p>
+     *
+     * <p> {@link List}s are sequence containers that allow constant time insert and erase operations anywhere within the
+     * sequence, and iteration in both directions. </p>
+     *
+     * <p> List containers are implemented as doubly-linked lists; Doubly linked lists can store each of the elements they
+     * contain in different and unrelated storage locations. The ordering is kept internally by the association to each
+     * element of a link to the element preceding it and a link to the element following it. </p>
+     *
+     * <p> They are very similar to forward_list: The main difference being that forward_list objects are single-linked
+     * lists, and thus they can only be iterated forwards, in exchange for being somewhat smaller and more efficient. </p>
+     *
+     * <p> Compared to other base standard sequence containers (array, vector and deque), lists perform generally better
+     * in inserting, extracting and moving elements in any position within the container for which an iterator has already
+     * been obtained, and therefore also in algorithms that make intensive use of these, like sorting algorithms. </p>
+     *
+     * <p> The main drawback of lists and forward_lists compared to these other sequence containers is that they lack
+     * direct access to the elements by their position; For example, to access the sixth element in a list, one has to
+     * iterate from a known position (like the beginning or the end) to that position, which takes linear time in the
+     * distance between these. They also consume some extra memory to keep the linking information associated to each
+     * element (which may be an important factor for large lists of small-sized elements). </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     * 	<dt> Sequence </dt>
+     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are accessed by
+     *		 their position in this sequence. </dd>
+     *
+     * 	<dt> Doubly-linked list </dt>
+     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing constant time
+     *		 insert and erase operations before or after a specific element (even of entire ranges), but no direct random
+     *		 access. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @reference http://www.cplusplus.com/reference/list/list/
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class List<T> extends base.Container<T> implements base.IDequeContainer<T> {
+        /**
+         * An iterator of beginning.
+         */
+        protected begin_: ListIterator<T>;
+        /**
+         * An iterator of end.
+         */
+        protected end_: ListIterator<T>;
+        /**
+         * Number of elements in the {@link List}.
+         */
+        protected size_: number;
+        /**
+         * <p> Default Constructor. </p>
+         *
+         * <p> Constructs an empty container, with no elements. </p>
+         */
+        constructor();
+        /**
+         * <p> Initializer list Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
+         *
+         * @param array An array containing elements to be copied and contained.
+         */
+        constructor(items: Array<T>);
+        /**
+         * <p> Fill Constructor. </p>
+         *
+         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
+         *
+         * @param n Initial container size (i.e., the number of elements in the container at construction).
+         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
+         *			  initialized to a copy of this value.
+         */
+        constructor(size: number, val: T);
+        /**
+         * <p> Copy Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
+         *
+         * @param container Another container object of the same type (with the same class template
+         *					arguments <i>T</i>), whose contents are either copied or acquired.
+         */
+        constructor(container: base.IContainer<T>);
+        /**
+         * <p> Range Constructor. </p>
+         *
+         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
+         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @inheritdoc
+         */
+        assign(n: number, val: T): void;
+        /**
+         * @inheritdoc
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        begin(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): ListReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): ListReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        size(): number;
+        /**
+         * @inheritdoc
+         */
+        front(): T;
+        /**
+         * @inheritdoc
+         */
+        back(): T;
+        /**
+         * @inheritdoc
+         */
+        push<U extends T>(...items: U[]): number;
+        /**
+         * @inheritdoc
+         */
+        push_front(val: T): void;
+        /**
+         * @inheritdoc
+         */
+        push_back(val: T): void;
+        /**
+         * @inheritdoc
+         */
+        pop_front(): void;
+        /**
+         * @inheritdoc
+         */
+        pop_back(): void;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new element is inserted.
+         *				   {@link iterator}> is a member type, defined as a
+         *				   {@link ListIterator bidirectional iterator} type that points to elements.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the newly inserted element; <i>val</i>.
+         */
+        insert(position: ListIterator<T>, val: T): ListIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param size Number of elements to insert.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param begin An iterator specifying range of the begining element.
+         * @param end An iterator specifying range of the ending element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new element is inserted.
+         *				   {@link iterator}> is a member type, defined as a
+         *				   {@link ListReverseIterator bidirectional iterator} type that points to elements.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the newly inserted element; <i>val</i>.
+         */
+        insert(position: ListReverseIterator<T>, val: T): ListReverseIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param size Number of elements to insert.
+         * @param val Value to be inserted as an element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: ListReverseIterator<T>, size: number, val: T): ListReverseIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link List.size List size} by the amount of elements
+         * inserted. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+         * inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Position in the container where the new elements are inserted. The {@link iterator} is a
+         *				   member type, defined as a {@link ListReverseIterator bidirectional iterator} type that points to
+         *				   elements.
+         * @param begin An iterator specifying range of the begining element.
+         * @param end An iterator specifying range of the ending element.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: ListReverseIterator<T>, begin: InputIterator, end: InputIterator): ListReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        private insert_by_val(position, val);
+        /**
+         * @hidden
+         */
+        protected insert_by_repeating_val(position: ListIterator<T>, size: number, val: T): ListIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(position: ListIterator<T>, begin: InputIterator, end: InputIterator): ListIterator<T>;
+        /**
+         * <p> Erase an element. </p>
+         *
+         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link List}.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
+         */
+        erase(position: ListIterator<T>): ListIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         *
+         * <p> Removes from the {@link List} container a range of elements. </p>
+         *
+         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link end end()} if the operation erased the last element in the sequence.
+         */
+        erase(begin: ListIterator<T>, end: ListIterator<T>): ListIterator<T>;
+        /**
+         * <p> Erase an element. </p>
+         *
+         * <p> Removes from the {@link List} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link List}.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
+         */
+        erase(position: ListReverseIterator<T>): ListReverseIterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         *
+         * <p> Removes from the {@link List} container a range of elements. </p>
+         *
+         * <p> This effectively reduces the container {@link size} by the number of elements removed. </p>
+         *
+         * <p> Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+         * efficient inserting and removing elements in any position, even in the middle of the sequence. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function call.
+         *		   This is the {@link rend rend()} if the operation erased the last element in the sequence.
+         */
+        erase(begin: ListReverseIterator<T>, end: ListReverseIterator<T>): ListReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        protected erase_by_range(first: ListIterator<T>, last: ListIterator<T>): ListIterator<T>;
+        /**
+         * <p> Remove duplicate values. </p>
+         *
+         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
+         *
+         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
+         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
+         */
+        unique(): void;
+        /**
+         * <p> Remove duplicate values. </p>
+         *
+         * <p> Removes all but the first element from every consecutive group of equal elements in the  </p>
+         *
+         * <p> The argument <i>binary_pred</i> is a specific comparison function that determine the <u>uniqueness</u>
+         * of an element. In fact, any behavior can be implemented (and not only an equality comparison), but notice
+         * that the function will call <code>binary_pred(it.value, it.prev().value)</code> for all pairs of elements
+         * (where <code>it</code> is an iterator to an element, starting from the second) and remove <code>it</code>
+         * from the {@link List} if the predicate returns <code>true</code>.
+         *
+         * <p> Notice that an element is only removed from the {@link List} container if it compares equal to the
+         * element immediately preceding it. Thus, this function is especially useful for sorted lists. </p>
+         *
+         * @param binary_pred Binary predicate that, taking two values of the same type than those contained in the
+         *					  {@link List}, returns <code>true</code> to remove the element passed as first argument
+         *					  from the container, and <code>false</code> otherwise. This shall be a function pointer
+         *					  or a function object.
+         */
+        unique(binary_pred: (left: T, right: T) => boolean): void;
+        /**
+         * <p> Remove elements with specific value. </p>
+         *
+         * <p> Removes from the container all the elements that compare equal to <i>val</i>. This calls the
+         * destructor of these objects and reduces the container {@link size} by the number of elements removed. </p>
+         *
+         * <p> Unlike member function {@link List.erase}, which erases elements by their position (using an
+         * iterator), this function ({@link List.remove}) removes elements by their value. </p>
+         *
+         * <p> A similar function, {@link List.remove_if}, exists, which allows for a condition other than an
+         * equality comparison to determine whether an element is removed. </p>
+         *
+         * @param val Value of the elements to be removed.
+         */
+        remove(val: T): void;
+        /**
+         * <p> Remove elements fulfilling condition. </p>
+         *
+         * <p> Removes from the container all the elements for which <i>pred</i> returns <code>true</code>. This
+         * calls the destructor of these objects and reduces the container {@link size} by the number of elements
+         * removed. </p>
+         *
+         * <p> The function calls <code>pred(it.value)</code> for each element (where <code>it</code> is an iterator
+         * to that element). Any of the elements in the list for which this returns <code>true</code>, are removed
+         * from the  </p>
+         *
+         * @param pred Unary predicate that, taking a value of the same type as those contained in the forward_list
+         *			   object, returns <code>true</code> for those values to be removed from the container, and
+         *			   <code>false</code> for those remaining. This can either be a function pointer or a function
+         *			   object.
+         */
+        remove_if(pred: (val: T) => boolean): void;
+        /**
+         * <p> Merge sorted {@link List Lists}. </p>
+         *
+         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
+         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
+         * </p>
+         *
+         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
+         * them into their ordered position within container (which expands in {@link size} by the number of elements
+         * transferred). The operation is performed without constructing nor destroying any element: they are
+         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
+         * move-construction or not. </p>
+         *
+         * <p> This function requires that the {@link List} containers have their elements already ordered by value
+         * ({@link less}) before the call. For an alternative on unordered {@link List Lists}, see
+         * {@link List.splice}. </p>
+         *
+         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
+         * value according to the strict weak ordering defined by {@link less}. The resulting order of equivalent
+         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
+         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
+         *
+         * The function does nothing if <code>this == obj</code>.
+         *
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
+         *			  passed.
+         */
+        merge<U extends T>(obj: List<U>): void;
+        /**
+         * <p> Merge sorted {@link List Lists}. </p>
+         *
+         * <p> Merges <i>obj</i> into the {@link List} by transferring all of its elements at their respective
+         * ordered positions into the container (<font color='red'>both containers shall already be ordered</font>).
+         * </p>
+         *
+         * <p> This effectively removes all the elements in <i>obj</i> (which becomes {@link empty}), and inserts
+         * them into their ordered position within container (which expands in {@link size} by the number of elements
+         * transferred). The operation is performed without constructing nor destroying any element: they are
+         * transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type supports
+         * move-construction or not. </p>
+         *
+         * <p> The argument <i>compare</i> is a specific predicate to perform the comparison operation between
+         * elements. This comparison shall produce a strict weak ordering of the elements (i.e., a consistent
+         * transitive comparison, without considering its reflexiveness).
+         *
+         * <p> This function requires that the {@link List} containers have their elements already ordered by
+         * <i>compare</i> before the call. For an alternative on unordered {@link List Lists}, see
+         * {@link List.splice}. </p>
+         *
+         * <p> Assuming such ordering, each element of <i>obj</i> is inserted at the position that corresponds to its
+         * value according to the strict weak ordering defined by <i>compare</i>. The resulting order of equivalent
+         * elements is stable (i.e., equivalent elements preserve the relative order they had before the call, and
+         * existing elements precede those equivalent inserted from <i>obj</i>). </p>
+         *
+         * The function does nothing if <code>this == obj</code>.
+         *
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         * 			  Note that this function modifies <i>obj</i> no matter whether an lvalue or rvalue reference is
+         *			  passed.
+         * @param compare Binary predicate that, taking two values of the same type than those contained in the
+         *				  {@link list}, returns <code>true</code> if the first argument is considered to go before
+         *				  the second in the strict weak ordering it defines, and <code>false</code> otherwise.
+         *				  This shall be a function pointer or a function object.
+         */
+        merge<U extends T>(obj: List<U>, compare: (left: T, right: T) => boolean): void;
+        /**
+         * <p> Transfer elements from {@link List} to {@link List}. </p>
+         *
+         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
+         *
+         * <p> This effectively inserts all elements into the container and removes them from <i>obj</i>, altering
+         * the sizes of both containers. The operation does not involve the construction or destruction of any
+         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
+         * value_type supports move-construction or not. </p>
+         *
+         * <p> This first version (1) transfers all the elements of <i>obj</i> into the  </p>
+         *
+         * @param position Position within the container where the elements of <i>obj</i> are inserted.
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         */
+        splice<U extends T>(position: ListIterator<T>, obj: List<U>): void;
+        /**
+         * <p> Transfer an element from {@link List} to {@link List}. </p>
+         *
+         * <p> Transfers an element from <i>obj</i>, which is pointed by an {@link ListIterator iterator} <i>it</i>,
+         * into the container, inserting the element at specified <i>position</i>. </p>
+         *
+         * <p> This effectively inserts an element into the container and removes it from <i>obj</i>, altering the
+         * sizes of both containers. The operation does not involve the construction or destruction of any element.
+         * They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the value_type
+         * supports move-construction or not. </p>
+         *
+         * <p> This second version (2) transfers only the element pointed by <i>it</i> from <i>obj</i> into the
+         *  </p>
+         *
+         * @param position Position within the container where the element of <i>obj</i> is inserted.
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
+         *			  being spliced.
+         * @param it {@link ListIterator Iterator} to an element in <i>obj</i>. Only this single element is
+         *			 transferred.
+         */
+        splice<U extends T>(position: ListIterator<T>, obj: List<U>, it: ListIterator<U>): void;
+        /**
+         * <p> Transfer elements from {@link List} to {@link List}. </p>
+         *
+         * <p> Transfers elements from <i>obj</i> into the container, inserting them at <i>position</i>. </p>
+         *
+         * <p> This effectively inserts those elements into the container and removes them from <i>obj</i>, altering
+         * the sizes of both containers. The operation does not involve the construction or destruction of any
+         * element. They are transferred, no matter whether <i>obj</i> is an lvalue or an rvalue, or whether the
+         * value_type supports move-construction or not. </p>
+         *
+         * <p> This third version (3) transfers the range [<i>begin</i>, <i>end</i>) from <i>obj</i> into the
+         *  </p>
+         *
+         * @param position Position within the container where the elements of <i>obj</i> are inserted.
+         * @param obj A {@link List} object of the same type (i.e., with the same template parameters, <b>T</b>).
+         *			  This parameter may be <code>this</code> if <i>position</i> points to an element not actually
+         *			  being spliced.
+         * @param begin {@link ListIterator An Iterator} specifying initial position of a range of elements in
+         *				<i>obj</i>. Transfers the elements in the range [<b><i>begin</i></b>, <i>end</i>) to
+         *				<i>position</i>.
+         * @param end {@link ListIterator An Iterator} specifying final position of a range of elements in
+         *			  <i>obj</i>. Transfers the elements in the range [<i>begin</i>, <b><i>end</i></b>) to
+         *			  <i>position</i>. Notice that the range includes all the elements between <i>begin<i/> and
+         *			  <i>end</i>, including the element pointed by <i>begin</i> but not the one pointed by <i>end</i>.
+         */
+        splice<U extends T>(position: ListIterator<T>, obj: List<U>, begin: ListIterator<U>, end: ListIterator<U>): void;
+        /**
+         * <p> Sort elements in  </p>
+         *
+         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
+         *
+         * <p> The sorting is performed by applying an algorithm that uses {@link less}. This comparison shall
+         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
+         * considering its reflexiveness). </p>
+         *
+         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
+         * order they had before the call. </p>
+         *
+         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
+         * Elements are moved within the  </p>
+         */
+        sort(): void;
+        /**
+         * <p> Sort elements in  </p>
+         *
+         * <p> Sorts the elements in the {@link List}, altering their position within the  </p>
+         *
+         * <p> The sorting is performed by applying an algorithm that uses <i>compare</i>. This comparison shall
+         * produce a strict weak ordering of the elements (i.e., a consistent transitive comparison, without
+         * considering its reflexiveness). </p>
+         *
+         * <p> The resulting order of equivalent elements is stable: i.e., equivalent elements preserve the relative
+         * order they had before the call. </p>
+         *
+         * <p> The entire operation does not involve the construction, destruction or copy of any element object.
+         * Elements are moved within the  </p>
+         *
+         * @param compare Binary predicate that, taking two values of the same type of those contained in the
+         *				  {@link List}, returns <code>true</code> if the first argument goes before the second
+         *				  argument in the strict weak ordering it defines, and <code>false</code> otherwise. This
+         *				  shall be a function pointer or a function object.
+         */
+        sort(compare: (left: T, right: T) => boolean): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.IContainer<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_list(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> An iterator, node of a List. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class ListIterator<T> extends Iterator<T> {
+        private prev_;
+        private next_;
+        private value_;
+        /**
+         * <p> Construct from the source {@link List container}. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Do not create the iterator directly, by yourself. </p>
+         * <p> Use {@link List.begin begin()}, {@link List.end end()} in {@link List container} instead. </p>
+         *
+         * @param source The source {@link List container} to reference.
+         * @param prev A refenrece of previous node ({@link ListIterator iterator}).
+         * @param next A refenrece of next node ({@link ListIterator iterator}).
+         * @param value Value to be stored in the node (iterator).
+         */
+        constructor(source: List<T>, prev: ListIterator<T>, next: ListIterator<T>, value: T);
+        /**
+         * @inheritdoc
+         */
+        set_prev(it: ListIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        set_next(next: ListIterator<T>): void;
+        private list();
+        /**
+         * @inheritdoc
+         */
+        prev(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        next(): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        advance(step: number): ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        value: T;
+        /**
+         * @inheritdoc
+         */
+        equal_to(obj: ListIterator<T>): boolean;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: ListIterator<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> A reverse-iterator of List. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class ListReverseIterator<T> extends ReverseIterator<T, ListIterator<T>, ListReverseIterator<T>> {
+        constructor(base: ListIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        protected create_neighbor(): ListReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        value: T;
+    }
+}
+declare namespace std {
+    /**
+     * <p> FIFO queue. </p>
+     *
+     * <p> {@link Queue}s are a type of container adaptor, specifically designed to operate in a FIFO context
+     * (first-in first-out), where elements are inserted into one end of the container and extracted from the other.
+     * </p>
+     *
+     * <p> {@link Queue}s are implemented as containers adaptors, which are classes that use an encapsulated object of
+     * a specific container class as its underlying container, providing a specific set of member functions to access
+     * its elements. Elements are pushed into the {@link IDeque.back back()} of the specific container and popped from
+     * its {@link IDeque.front front()}. </p>
+     *
+     * <p> {@link container_ The underlying container} may be one of the standard container class template or some
+     * other specifically designed container class. This underlying container shall support at least the following
+     * operations: </p>
+     *
+     * <ul>
+     *	<li> empty </li>
+     *	<li> size </li>
+     *	<li> front </li>
+     *	<li> back </li>
+     *	<li> push_back </li>
+     *	<li> pop_front </li>
+     * </ul>
+     *
+     * <p> The standard container classes {@link Deque} and {@link List} fulfill these requirements.
+     * By default, if no container class is specified for a particular {@link Queue} class instantiation, the standard
+     * container {@link List} is used. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of elements.
+     *
+     * @reference http://www.cplusplus.com/reference/queue/queue
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class Queue<T> {
+        /**
+         * The <i>underlying object</i> for implementing the <i>FIFO</i>
+         */
+        private container_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: Queue<T>);
+        /**
+         * <p> Return size. </p>
+         * <p> Returns the number of elements in the {@link Queue}. </p>
+         *
+         * <p> This member function effectively calls member {@link IDeque.size size()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return The number of elements in the {@link container_ underlying container}.
+         */
+        size(): number;
+        /**
+         * <p> Test whether container is empty. </p>
+         * <p> returns whether the {@link Queue} is empty: i.e. whether its <i>size</i> is zero. </p>
+         *
+         * <p> This member function efeectively calls member {@link IDeque.empty empty()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return <code>true</code> if the {@link container_ underlying container}'s size is 0,
+         *		   <code>false</code> otherwise. </p>
+         */
+        empty(): boolean;
+        /**
+         * <p> Access next element. </p>
+         * <p> Returns a value of the next element in the {@link Queue}. </p>
+         *
+         * <p> The next element is the "oldest" element in the {@link Queue} and the same element that is popped out
+         * from the queue when {@link pop Queue.pop()} is called. </p>
+         *
+         * <p> This member function effectively calls member {@link IDeque.front front()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A value of the next element in the {@link Queue}.
+         */
+        front(): T;
+        /**
+         * <p> Access last element. </p>
+         *
+         * <p> Returns a vaue of the last element in the queue. This is the "newest" element in the queue (i.e. the
+         * last element pushed into the queue). </p>
+         *
+         * <p> This member function effectively calls the member function {@link IDeque.back back()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A value of the last element in the {@link Queue}.
+         */
+        back(): T;
+        /**
+         * <p> Insert element. </p>
+         *
+         * <p> Inserts a new element at the end of the {@link Queue}, after its current last element.
+         * The content of this new element is initialized to <i>val</i>. </p>
+         *
+         * <p> This member function effectively calls the member function {@link IDeque.push_back push_back()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @param val Value to which the inserted element is initialized.
+         */
+        push(val: T): void;
+        /**
+         * <p> Remove next element. </p>
+         *
+         * <p> Removes the next element in the {@link Queue}, effectively reducing its size by one. </p>
+         *
+         * <p> The element removed is the "oldest" element in the {@link Queue} whose value can be retrieved by calling
+         * member {@link front Queue.front()} </p>.
+         *
+         * <p> This member function effectively calls the member function {@link IDeque.pop_front pop_front()} of the
+         * {@link container_ underlying container} object. </p>
+         */
+        pop(): void;
+        /**
+         * <p> Swap contents. </p>
+         *
+         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
+         *
+         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
+         * the {@link container_ underlying containers}. </p>
+         *
+         * @param obj Another {@link Queue} container adaptor of the same type (i.e., instantiated with the same
+         *			  template parameter, <b>T</b>). Sizes may differ. </p>
+         */
+        swap(obj: Queue<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> Priority queue. </p>
+     *
+     * <p> {@link PriorityQueue Priority queues} are a type of container adaptors, specifically designed such that its
+     * first element is always the greatest of the elements it contains, according to some <i>strict weak ordering</i>
+     * criterion. </p>
+     *
+     * <p> This context is similar to a <i>heap</i>, where elements can be inserted at any moment, and only the
+     * <i>max heap</i> element can be retrieved (the one at the top in the {@link PriorityQueue priority queue}). </p>
+     *
+     * <p> {@link PriorityQueue Priority queues} are implemented as <i>container adaptors</i>, which are classes that
+     * use an encapsulated object of a specific container class as its {@link container_ underlying container},
+     * providing a specific set of member functions to access its elements. Elements are popped from the <i>"back"</i>
+     * of the specific container, which is known as the <i>top</i> of the {@link PriorityQueue Priority queue}. </p>
+     *
+     * <p> The {@link container_ underlying container} may be any of the standard container class templates or some
+     * other specifically designed container class. The container shall be accessible through
+     * {@link IArrayIterator random access iterators} and support the following operations: </p>
+     *
+     * <ul>
+     *	<li> empty() </li>
+     *	<li> size() </li>
+     *	<li> front() </li>
+     *	<li> push_back() </li>
+     *	<li> pop_back() </li>
+     * </ul>
+     *
+     * <p> The standard container classes {@link Vector} and {@link Deque} fulfill these requirements. By default, if
+     * no container class is specified for a particular {@link PriorityQueue} class instantiation, the standard
+     * container {@link Vector} is used. </p>
+     *
+     * <p> Support of {@link IArrayIterator random access iterators} is required to keep a heap structure internally
+     * at all times. This is done automatically by the container adaptor by automatically calling the algorithm
+     * functions <i>make_heap</i>, <i>push_heap</i> and <i>pop_heap</i> when needed. </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @reference http://www.cplusplus.com/reference/queue/priority_queue/
+     * @author Jeongho Nam
+     */
+    class PriorityQueue<T> {
+        /**
+         * <p> The <i>underlying container</i> for implementing the <i>priority queue</i>. </p>
+         *
+         * <p> Following standard definition from the C++ committee, the <i>underlying container</i> should be one of
+         * {@link Vector} or {@link Deque}, however, I've adopted {@link TreeMultiSet} instead of them. Of course,
+         * there are proper reasons for adapting the {@link TreeMultiSet} even violating standard advice. </p>
+         *
+         * <p> <i>Underlying container</i> of {@link PriorityQueue} must keep a condition; the highest (or lowest)
+         * element must be placed on the terminal node for fast retrieval and deletion. To keep the condition with
+         * {@link Vector} or {@link Deque}, lots of times will only be spent for re-arranging elements. It calls
+         * rearrangement functions like <i>make_heap</i>, <i>push_heap</i> and <i>pop_head</i> for rearrangement. </p>
+         *
+         * <p> However, the {@link TreeMultiSet} container always keeps arrangment automatically without additional
+         * operations and it even meets full criteria of {@link PriorityQueue}. Those are the reason why I've adopted
+         * {@link TreeMultiSet} as the <i>underlying container</i> of {@link PriorityQueue}. </p>
+         */
+        private container_;
         /**
          * Default Constructor.
          */
@@ -4447,7 +7728,7 @@ declare namespace std {
          */
         constructor(begin: Iterator<T>, end: Iterator<T>);
         /**
-         * Construct from range and compare.
+         * Range Constructor with compare.
          *
          * @param begin Input interator of the initial position in a sequence.
          * @param end Input interator of the final position in a sequence.
@@ -4455,3621 +7736,215 @@ declare namespace std {
          */
         constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
         /**
-         * @inheritdoc
+         * @hidden
          */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(val: T): SetIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        count(val: T): number;
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is not considered to
-         * go before <i>val</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(element,val) would return false. </p>
-         *
-         * <p> If the {@link TreeMultiSet} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element that is not less than <i>val</i>. </p>
-
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link TreeMultiSet} contains elements equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is not considered to go before
-         *		   <i>val</i>, or {@link TreeMultiSet.end} if all elements are considered to go before <i>val</i>.
-         */
-        lower_bound(val: T): SetIterator<T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is considered to go after
-         * <i>val</i>. </p>
-
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(val,element) would return true. </p>
-
-         * <p> If the {@code TreeMultiSet} class is instantiated with the default comparison type (less), the
-         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the {@TreeMultiSet} contains elements equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is considered to go after
-         *		   <i>val</i>, or {@link TreeMultiSet.end} if no elements are considered to go after <i>val</i>.
-         */
-        upper_bound(val: T): SetIterator<T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container that are equivalent
-         * to <i>val</i>. </p>
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that is considered to go after val according to the container's
-         * internal comparison object (key_comp). </p>
-         *
-         * <p> Two elements of a multiset are considered equivalent if the container's comparison object returns
-         * false reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
-         *
-         * @param key Value to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        protected construct_from_array(items: Array<T>): void;
         /**
          * @hidden
          */
-        protected insert_by_val(val: T): any;
+        protected construct_from_container(container: base.IContainer<T>): void;
         /**
          * @hidden
          */
-        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        protected construct_from_range(begin: Iterator<T>, end: Iterator<T>): void;
         /**
-         * @hidden
+         * <p> Return size. </p>
+         *
+         * <p> Returns the number of elements in the {@link PriorityQueue}. </p>
+         *
+         * <p> This member function effectively calls member {@link IArray.size size} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return The number of elements in the underlying
          */
-        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        size(): number;
         /**
-         * @inheritdoc
+         * <p> Test whether container is empty. </p>
+         *
+         * <p> Returns whether the {@link PriorityQueue} is empty: i.e. whether its {@link size} is zero. </p>
+         *
+         * <p> This member function effectively calls member {@link IARray.empty empty} of the
+         * {@link container_ underlying container} object. </p>
          */
-        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        empty(): boolean;
         /**
-         * @inheritdoc
+         * <p> Access top element. </p>
+         *
+         * <p> Returns a constant reference to the top element in the {@link PriorityQueue}. </p>
+         *
+         * <p> The top element is the element that compares higher in the {@link PriorityQueue}, and the next that is
+         * removed from the container when {@link PriorityQueue.pop} is called. </p>
+         *
+         * <p> This member function effectively calls member {@link IArray.front front} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A reference to the top element in the {@link PriorityQueue}.
          */
-        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        top(): T;
         /**
-         * @inheritdoc
+         * <p> Insert element. </p>
+         *
+         * <p> Inserts a new element in the {@link PriorityQueue}. The content of this new element is initialized to
+         * <i>val</i>.
+         *
+         * <p> This member function effectively calls the member function {@link IArray.push_back push_back} of the
+         * {@link container_ underlying container} object, and then reorders it to its location in the heap by calling
+         * the <i>push_heap</i> algorithm on the range that includes all the elements of the  </p>
+         *
+         * @param val Value to which the inserted element is initialized.
          */
-        swap(obj: base.MultiSet<T>): void;
+        push(val: T): void;
         /**
-         * @hidden
+         * <p> Remove top element. </p>
+         *
+         * <p> Removes the element on top of the {@link PriorityQueue}, effectively reducing its {@link size} by one.
+         * The element removed is the one with the highest (or lowest) value. </p>
+         *
+         * <p> The value of this element can be retrieved before being popped by calling member
+         * {@link PriorityQueue.top}. </p>
+         *
+         * <p> This member function effectively calls the <i>pop_heap</i> algorithm to keep the heap property of
+         * {@link PriorityQueue PriorityQueues} and then calls the member function {@link IArray.pop_back pop_back} of
+         * the {@link container_ underlying container} object to remove the element. </p>
          */
-        private swap_tree_set(obj);
+        pop(): void;
+        /**
+         * <p> Swap contents. </p>
+         *
+         * <p> Exchanges the contents of the container adaptor by those of <i>obj</i>, swapping both the
+         * {@link container_ underlying container} value and their comparison function using the corresponding
+         * {@link std.swap swap} non-member functions (unqualified). </p>
+         *
+         * <p> This member function has a <i>noexcept</i> specifier that matches the combined <i>noexcept</i> of the
+         * {@link IArray.swap swap} operations on the {@link container_ underlying container} and the comparison
+         * functions. </p>
+         *
+         * @param obj {@link PriorityQueue} container adaptor of the same type (i.e., instantiated with the same
+         *			  template parameters, <b>T</b>). Sizes may differ.
+         */
+        swap(obj: PriorityQueue<T>): void;
     }
 }
 declare namespace std {
     /**
-     * <p> Tree-structured map, <code>std::map</code> of STL. </p>
+     * <p> LIFO stack. </p>
      *
-     * <p> {@link TreeMap TreeMaps} are associative containers that store elements formed by a combination of a
-     * <i>key value</i> (<i>Key</i>) and a <i>mapped value</i> (<i>T</i>), following order. </p>
+     * <p> {@link Stack}s are a type of container adaptor, specifically designed to operate in a LIFO context
+     * (last-in first-out), where elements are inserted and extracted only from one end of the  </p>
      *
-     * <p> In a {@link TreeMap}, the <i>key values</i> are generally used to sort and uniquely identify the elements,
-     * while the <i>mapped values</i> store the content associated to this key. The types of <i>key</i> and
-     * <i>mapped value</i> may differ, and are grouped together in member type <i>value_type</i>, which is a {@link Pair}
-     * type combining both: </p>
+     * <p> {@link Stack}s are implemented as containers adaptors, which are classes that use an encapsulated object of
+     * a specific container class as its <i>underlying container</i>, providing a specific set of member functions to
+     * access its elements. Elements are pushed/popped from the {@link ILinearContainer.back back()} of the
+     * {@link ILinearContainer specific container}, which is known as the top of the {@link Stack}. </p>
      *
-     * <p> <code>typedef Pair<Key, T> value_type;</code> </p>
+     * <p> {@link container_ The underlying container} may be any of the standard container class templates or some
+     * other specifically designed container class. The container shall support the following operations: </p>
      *
-     * <p> Internally, the elements in a {@link TreeMap} are always sorted by its <i>key</i> following a
-     * <i>strict weak ordering</i> criterion indicated by its internal comparison method {@link less}.
-     *
-     * <p> {@link TreeMap} containers are generally slower than {@link HashMap HashMap} containers to access individual
-     * elements by their <i>key</i>, but they allow the direct iteration on subsets based on their order. </p>
-     *
-     * <p> {@link TreeMap}s are typically implemented as binary search trees. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Ordered </dt>
-     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
-     *		 given a position in this order. </dd>
-     *
-     *	<dt> Map </dt>
-     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
-     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
-     *
-     *	<dt> Unique keys </dt>
-     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
-     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
-     *
-     * @reference http://www.cplusplus.com/reference/map/map
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeMap<Key, T> extends base.UniqueMap<Key, T> {
-        /**
-         * <i>RB-Tree+</i> object for implemeting the {@link TreeMap}.
-         */
-        private tree_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
-         *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<Pair<Key, T>>);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         */
-        constructor(array: Array<[Key, T]>);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         */
-        constructor(container: base.MapContainer<Key, T>);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
-         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
-         *
-         * <p> If the {@link TreeMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link TreeMap} contains an element with a key equivalent to <i>k</i>: In this
-         * case, {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound}
-         * returns an iterator pointing to the next element. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is not considered to go before
-         *		   <i>k</i>, or {@link TreeMap.end} if all keys are considered to go before <i>k</i>.
-         */
-        lower_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
-         * go after <i>k</i> </p>.
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
-         *
-         * <p> If the {@link TreeMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the map contains an element with a key equivalent to <i>k</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns an
-         * iterator pointing to the next element. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is considered to go after
-         *		   <i>k</i>, or {@link TreeMap.end} if no keys are considered to go after <i>k</i>.
-         */
-        upper_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
-         * equivalent to <i>k</i> </p>.
-         *
-         * <p> Because the elements in a {@link TreeMap} container have unique keys, the range returned will
-         * contain a single element at most. </p>
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that has a key considered to go after <i>k</i> according to the container's internal
-         * comparison object (key_comp). </p>
-         *
-         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
-         * (i.e., no matter the order in which the keys are passed as arguments). </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
-        /**
-         * @hidden
-         */
-        protected insert_by_pair(pair: Pair<Key, T>): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.UniqueMap<Key, T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_map(obj);
-    }
-    /**
-     * <p> Tree-structured multiple-key map. </p>
-     *
-     * <p> {@link TreeMultiMap TreeMultiMaps} are associative containers that store elements formed by a combination of
-     * a <i>key value</i> and a <i>mapped value</i>, following a specific order, and where multiple elements can
-     * have equivalent keys. </p>
-     *
-     * <p> In a {@link TreeMultiMap}, the <i>key values</i> are generally used to sort and uniquely identify
-     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
-     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
-     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
-     *
-     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
-     *
-     * <p> Internally, the elements in a {@link TreeMultiMap}are always sorted by its key following a
-     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
-     *
-     * <p> {@link TreeMultiMap}containers are generally slower than {@link HashMap} containers
-     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
-     * on their order. </p>
-     *
-     * <p> {@link TreeMultiMap TreeMultiMaps} are typically implemented as binary search trees. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Ordered </dt>
-     *	<dd>
-     *		The elements in the container follow a strict order at all times. All inserted elements are
-     *		given a position in this order.
-     *	</dd>
-     *
-     *	<dt> Map </dt>
-     *	<dd>
-     *		Each element associates a <i>key</i> to a <i>mapped value</i>:
-     *		<i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>.
-     *	</dd>
-     *
-     *	<dt> Multiple equivalent keys </dt>
-     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
-     * </dl>
-     *
-     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
-     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
-     *
-     * @reference http://www.cplusplus.com/reference/map/multimap
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeMultiMap<Key, T> extends base.MultiMap<Key, T> {
-        private tree_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * Construct from compare.
-         *
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         */
-        constructor(array: Array<Pair<Key, T>>);
-        /**
-         * Contruct from elements.
-         *
-         * @param array Elements to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         */
-        constructor(array: Array<[Key, T]>);
-        /**
-         * Contruct from tuples.
-         *
-         * @param array Tuples to be contained.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         */
-        constructor(container: base.MapContainer<Key, T>);
-        /**
-         * Copy Constructor.
-         *
-         * @param container Another map to copy.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
-        /**
-         * Range Constructor.
-         *
-         * @param begin nput interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         * @param compare A binary predicate determines order of elements.
-         */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
-        /**
-         * @inheritdoc
-         */
-        clear(): void;
-        /**
-         * @inheritdoc
-         */
-        find(key: Key): MapIterator<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        count(key: Key): number;
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
-         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
-         *
-         * <p> If the {@link TreeMultiMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link TreeMultiMap} contains an element with keys equivalent to <i>k</i>:
-         * In this case, {@link lower_bound} returns an iterator pointing to the first of such elements,
-         * whereas {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is not considered to go before
-         *		   <i>k</i>, or {@link TreeMultiMap.end} if all keys are considered to go before <i>k</i>.
-         */
-        lower_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
-         * go after <i>k</i> </p>.
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
-         *
-         * <p> If the {@link TreeMultiMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the {@link TreeMultiMap} contains an element with keys equivalent to <i>k</i>:
-         * In this case {@link lower_bound} returns an iterator pointing to first of such element, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is considered to go after
-         *		   <i>k</i>, or {@link TreeMultiMap.end} if no keys are considered to go after <i>k</i>.
-         */
-        upper_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
-         * equivalent to <i>k</i> </p>.
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that has a key considered to go after <i>k</i> according to the container's internal
-         * comparison object (key_comp). </p>
-         *
-         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
-         * (i.e., no matter the order in which the keys are passed as arguments). </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
-        /**
-         * @hidden
-         */
-        protected insert_by_pair(pair: Pair<Key, T>): any;
-        /**
-         * @hidden
-         */
-        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        swap(obj: base.MultiMap<Key, T>): void;
-        /**
-         * @hidden
-         */
-        private swap_tree_multimap(obj);
-    }
-}
-declare namespace std {
-    /**
-     * <p> Apply function to range. </p>
-     *
-     * <p> Applies function <i>fn</i> to each of the elements in the range [<i>first</i>, <i>last</i>). </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param fn Unary function that accepts an element in the range as argument. This can either be a function p
-     *			 ointer or a move constructible function object. Its return value, if any, is ignored.
-     *
-     * @return Returns <i>fn</i>.
-     */
-    function for_each<T, InputIterator extends Iterator<T>, Func extends (val: T) => any>(first: InputIterator, last: InputIterator, fn: Func): Func;
-    /**
-     * <p> Test condition on all elements in range. </p>
-     *
-     * <p> Returns <code>true</code> if <i>pred</i> returns <code>true</code> for all the elements in the range
-     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
-     * </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
-     *			   checked by this function. The function shall not modify its argument.
-     *
-     * @return <code>true</code> if pred returns true for all the elements in the range or if the range is
-     *		   {@link IContainer.empty empty}, and <code>false</code> otherwise.
-     */
-    function all_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
-    /**
-     * <p> Test if any element in range fulfills condition. </p>
-     *
-     * <p> Returns <code>true</code> if <i>pred</i> returns true for any of the elements in the range
-     * [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. </p>
-     *
-     * <p> If [<i>first</i>, <i>last</i>) is an {@link IContainer.empty empty} range, the function returns
-     * <code>false</code>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
-     *			   checked by this function. The function shall not modify its argument.
-     *
-     * @return <code>true</code> if <i>pred</i> returns <code>true</code> for any of the elements in the range
-     *		   [<i>first</i>, <i>last</i>), and <code>false</code> otherwise. If [<i>first</i>, <i>last</i>) is an
-     *		   {@link IContainer.empty empty} range, the function returns <code>false</code>.
-     */
-    function any_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
-    /**
-     * <p> Test if no elements fulfill condition. </p>
-     *
-     * <p> Returns <code>true</code> if <i>pred</i> returns false for all the elements in the range
-     * [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code> otherwise.
-     * </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>boolean</code>. The value returned indicates whether the element fulfills the condition
-     *			   checked by this function. The function shall not modify its argument.
-     *
-     * @return <code>true</code> if <i>pred</i> returns <code>false</code> for all the elements in the range
-     *		   [<i>first</i>, <i>last</i>) or if the range is {@link IContainer.empty empty}, and <code>false</code>
-     *		   otherwise.
-     */
-    function none_of<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): boolean;
-    /**
-     * <p> Test whether the elements in two ranges are equal. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
-     */
-    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>): boolean;
-    /**
-     * <p> Test whether the elements in two ranges are equal. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *			   the elements are considered to match in the context of this function.
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i>, and <code>false</code> otherwise.
-     */
-    function equal<T, Iterator1 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator<T>, pred: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Test whether range is permutation of another. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
-     * order. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
-     */
-    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): boolean;
-    /**
-     * <p> Test whether range is permutation of another. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns <code>true</code> if all of the elements in both ranges match, even in a different
-     * order. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *			   the elements are considered to match in the context of this function.
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first1</i>, <i>last1</i>) compare equal to those
-     *		   of the range starting at <i>first2</i> in any order, and <code>false</code> otherwise.
-     */
-    function is_permutation<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, pred: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Lexicographical less-than comparison. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically less</i>
-     * than the range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
-     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
-     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
-     * elements is the result of the lexicographical comparison. </p>
-     *
-     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically less</i>
-     * than the longer one. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence.
-     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
-     *				[<i>first2</i>, <i>last2</i>).
-     *
-     * @return <code>true</code> if the first range compares <i>lexicographically less</i> than than the second.
-     *		   <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
-     */
-    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): boolean;
-    /**
-     * <p> Lexicographical comparison. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first1</i>, <i>last1</i>) compares <i>lexicographically
-     * relationship</i> than the range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> A <i>lexicographical comparison</i> is the kind of comparison generally used to sort words alphabetically in
-     * dictionaries; It involves comparing sequentially the elements that have the same position in both ranges against
-     * each other until one element is not equivalent to the other. The result of comparing these first non-matching
-     * elements is the result of the lexicographical comparison. </p>
-     *
-     * <p> If both sequences compare equal until one of them ends, the shorter sequence is <i>lexicographically
-     * relationship</i> than the longer one. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence.
-     * @param last2 An {@link Iterator} to the final position of the second sequence. The ranged used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a
-     *		  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *		  considered to go before the second in the specific <i>strict weak ordering</i> it defines.
-     *
-     * @return <code>true</code> if the first range compares <i>lexicographically relationship</i> than than the
-     *		   second. <code>false</code> otherwise (including when all the elements of both ranges are equivalent).
-     */
-    function lexicographical_compare<T, T1 extends T, T2 extends T, Iterator1 extends Iterator<T1>, Iterator2 extends Iterator<T2>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Find value in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) that compares equal to
-     * <i>val</i>. If no such element is found, the function returns <i>last</i>. </p>
-     *
-     * <p> The function uses {@link equal_to equal_to} to compare the individual elements to <i>val</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value to search for in the range.
-     *
-     * @return An {@link Iterator} to the first element in the range that compares equal to <i>val</i>. If no elements
-     *		   match, the function returns <i>last</i>.
-     */
-    function find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
-    /**
-     * <p> Find element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
-     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
-     *			   the context of this function. The function shall not modify its argument.
-     *
-     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> does not return
-     *		   <code>false</code>. If <i>pred</i> is <code>false</code> for all elements, the function returns
-     *		   <i>last</i>.
-     */
-    function find_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
-    /**
-     * <p> Find element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) for which pred returns
-     * <code>true</code>. If no such element is found, the function returns <i>last</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether the element is considered a match in
-     *			   the context of this function. The function shall not modify its argument.
-     *
-     * @return An {@link Iterator} to the first element in the range for which <i>pred</i> returns <code>false</code>.
-     *		   If <i>pred</i> is <code>true</code> for all elements, the function returns <i>last</i>.
-     */
-    function find_if_not<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): InputIterator;
-    /**
-     * <p> Find last subsequence in range. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
-     * occurrences are found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
-     * {@link search}. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
-     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *			   whether the elements are considered to match in the context of this function.
-     *
-     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
-     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
-     */
-    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
-    /**
-     * <p> Find last subsequence in range. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the last occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an {@link Iterator} to its first element, or <i>last1,/i> if no
-     * occurrences are found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is <code>true</code> for all the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the last of such occurrences. For an algorithm that returns the first instead, see
-     * {@link search}. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
-     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *			   whether the elements are considered to match in the context of this function.
-     *
-     * @return An {@link Iterator} to the first element of the last occurrence of [<i>first2</i>, <i>last2</i>) in
-     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns ,i>last1</i>. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>last1</i>.
-     */
-    function find_end<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
-    /**
-     * <p> Find element from set in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
-     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
-     *
-     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
-     * [<i>first2</i>, <i>last2</i>) using {@link equal_to}, until a pair matches. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     *
-     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
-     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
-     */
-    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2): Iterator1;
-    /**
-     * <p> Find element from set in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first1</i>, <i>last1</i>) that matches any of the
-     * elements in [<i>first2</i>, <i>last2</i>). If no such element is found, the function returns <i>last1</i>. </p>
-     *
-     * <p> The elements in [<i>first1</i>, <i>last1</i>) are sequentially compared to each of the values in
-     * [<i>first2</i>, <i>last2</i>) using <i>pred</i>, until a pair matches. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the element values to be searched for.
-     * @param last2 An {@link Iterator} to the final position of the element values to be searched for. The range used
-     *				is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the
-     *			   same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *			   whether the elements are considered to match in the context of this function.
-     *
-     * @return An {@link Iterator} to the first element in [<i>first1</i>, <i>last1</i>) that is part of
-     *		   [<i>first2</i>, <i>last2</i>). If no matches are found, the function returns <i>last1</i>.
-     */
-    function find_first_of<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, last2: Iterator2, pred: (x: T, y: T) => boolean): Iterator1;
-    /**
-     * <p> Find equal adjacent elements in range. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
-     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
-     *
-     * <p> Two elements match if they compare equal using {@link equal_to}. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
-     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
-     */
-    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
-    /**
-     * <p> Find equal adjacent elements in range. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for the first occurrence of two consecutive elements that match,
-     * and returns an {@link Iterator} to the first of these two elements, or <i>last</i> if no such pair is found. </p>
-     *
-     * <p> Two elements match if they compare equal using <i>pred</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is considered a match in the
-     *			   context of this function. The function shall not modify its argument.
-     *
-     * @return An {@link Iterator} to the first element of the first pair of matching consecutive elements in the range
-     *		   [<i>first</i>, <i>last</i>). If no such pair is found, the function returns <i>last</i>.
-     */
-    function adjacent_find<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T, y: T) => boolean): InputIterator;
-    /**
-     * <p> Search range for subsequence. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
-     * found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using {@link equal_to}: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
-     * {@link find_end}. </p>
-     *
-     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
-     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
-     *				used is [<i>first2</i>, <i>last2</i>).
-     *
-     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in <i>first1</i>
-     *		   and <i>last1</i>. If the sequence is not found, the function returns <i>last1</i>. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
-     */
-    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2): ForwardIterator1;
-    /**
-     * <p> Search range for subsequence. </p>
-     *
-     * <p> Searches the range [<i>first1</i>, <i>last1</i>) for the first occurrence of the sequence defined by
-     * [<i>first2</i>, <i>last2</i>), and returns an iterator to its first element, or <i>last1</i> if no occurrences are
-     * found. </p>
-     *
-     * <p> The elements in both ranges are compared sequentially using <i>pred</i>: A subsequence of
-     * [<i>first1</i>, <i>last1</i>) is considered a match only when this is true for <b>all</b> the elements of
-     * [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> This function returns the first of such occurrences. For an algorithm that returns the last instead, see
-     * {@link find_end}. </p>
-     *
-     * @param first1 {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last1 {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Forward iterator} to the initial position of the sequence to be searched for.
-     * @param last2 {@link Iterator Forward iterator} to the final position of the sequence to be searched for. The range
-     *				used is [<i>first2</i>, <i>last2</i>).
-     * @param pred Binary function that accepts two elements as arguments (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to bool. The returned value indicates whether the elements are
-     *			   considered to match in the context of this function. The function shall not modify any of its
-     *			   arguments.
-     *
-     * @return An iterator to the first element of the first occurrence of [<i>first2</i>, <i>last2</i>) in
-     *		   [<i>first1</i>, <i>last1</i>). If the sequence is not found, the function returns last1. Otherwise
-     *		   [<i>first2</i>, <i>last2</i>) is an empty range, the function returns <i>first1</i>.
-     */
-    function search<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2, last2: ForwardIterator2, pred: (x: T, y: T) => boolean): ForwardIterator1;
-    /**
-     * <p> Search range for elements. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
-     * <i>val</i>. </p>
-     *
-     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
-     * </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param count Minimum number of successive elements to match.
-     * @param val Individual value to be compared, or to be used as argument for {@link equal_to}.
-     *
-     * @return An iterator to the first element of the sequence. If no such sequence is found, the function returns
-     *		   <i>last</i>.
-     */
-    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T): ForwardIterator;
-    /**
-     * <p> Search range for elements. </p>
-     *
-     * <p> Searches the range [<i>first</i>, <i>last</i>) for a sequence of <i>count</i> elements, each comparing equal to
-     * <i>val</i>. </p>
-     *
-     * <p> The function returns an iterator to the first of such elements, or <i>last</i> if no such sequence is found.
-     * </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the searched sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the searched sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param count Minimum number of successive elements to match.
-     * @param val Individual value to be compared, or to be used as argument for <i>pred</i>.
-     * @param pred Binary function that accepts two arguments (one element from the sequence as first, and <i>val</i> as
-     *			   second), and returns a value convertible to <code>bool</code>. The value returned indicates whether the
-     *			   element is considered a match in the context of this function. The function shall not modify any of its
-     *			   arguments.
-     *
-     * @return An {@link Iterator} to the first element of the sequence. If no such sequence is found, the function
-     *		   returns <i>last</i>.
-     */
-    function search_n<T, ForwardIterator extends base.IArrayIterator<T>>(first: ForwardIterator, last: ForwardIterator, count: number, val: T, pred: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return first position where two ranges differ. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
-     *
-     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
-     * does not match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     *
-     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
-     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
-     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
-     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
-     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
-     */
-    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2): Pair<Iterator1, Iterator2>;
-    /**
-     * <p> Return first position where two ranges differ. </p>
-     *
-     * <p> Compares the elements in the range [<i>first1</i>, <i>last1</i>) with those in the range beginning at
-     * <i>first2</i>, and returns the first element of both sequences that does not match. </p>
-     *
-     * <p> The function returns a {@link Pair} of {@link iterators Iterator} to the first element in each range that
-     * does not match. </p>
-     *
-     * @param first1 An {@link Iterator} to the initial position of the first sequence.
-     * @param last1 An {@link Iterator} to the final position in a sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 An {@link Iterator} to the initial position of the second sequence. The comparison includes up to
-     *				 as many elements of this sequence as those in the range [<i>first1</i>, <i>last1</i>).
-     * @param pred Binary function that accepts two elements as argument (one of each of the two sequences, in the same
-     *			   order), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *			   the elements are considered to match in the context of this function.
-     *
-     * @return A {@link Pair}, where its members {@link Pair.first first} and {@link Pair.second second} point to the
-     *		   first element in both sequences that did not compare equal to each other. If the elements compared in
-     *		   both sequences have all matched, the function returns a {@link Pair} with {@link Pair.first first} set
-     *		   to <i>last1</i> and {@link Pair.second second} set to the element in that same relative position in the
-     *		   second sequence. If none matched, it returns {@link make_pair}(<i>first1</i>, <i>first2</i>).
-     */
-    function mismatch<T, Iterator1 extends Iterator<T>, Iterator2 extends Iterator<T>>(first1: Iterator1, last1: Iterator1, first2: Iterator2, compare: (x: T, y: T) => boolean): Pair<Iterator1, Iterator2>;
-    /**
-     * <p> Count appearances of value in range. </p>
-     *
-     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>. </p>
-     *
-     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value to match.
-     *
-     * @return The number of elements in the range [<i>first</i>, <i>last</i>) that compare equal to <i>val</i>.
-     */
-    function count<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): number;
-    /**
-     * <p> Return number of elements in range satisfying condition. </p>
-     *
-     * <p> Returns the number of elements in the range [<i>first</i>, <i>last</i>) for which pred is <code>true</code>.
-     * </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether the element is counted by this function.
-     *			   The function shall not modify its argument. This can either be a function pointer or a function
-     *			   object.
-     */
-    function count_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean): number;
-    /**
-     * <p> Copy range of elements. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) into the range beginning at <i>result</i>. </p>
-     *
-     * <p> The function returns an iterator to the end of the destination range (which points to the element following the
-     * last element copied). </p>
-     *
-     * <p> The ranges shall not overlap in such a way that result points to an element in the range
-     * [<i>first</i>, <i>last</i>). For such cases, see {@link copy_backward}. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
-     *				 point to any element in the range [<i>first</i>, <i>last</i>).
-     *
-     * @return An iterator to the end of the destination range where elements have been copied.
-     */
-    function copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Copy elements. </p>
-     *
-     * <p> Copies the first <i>n</i> elements from the range beginning at <i>first</i> into the range beginning at
-     * <i>result</i>. </p>
-     *
-     * <p> The function returns an iterator to the end of the destination range (which points to one past the last element
-     * copied). </p>
-     *
-     * <p> If <i>n</i> is negative, the function does nothing. </p>
-     *
-     * <p> If the ranges overlap, some of the elements in the range pointed by result may have undefined but valid values.
-     * </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence of at least <i>n</i> elements to
-     *				be copied. <i>InputIterator</i> shall point to a type assignable to the elements pointed by
-     *				<i>OutputIterator</i>.
-     * @param n Number of elements to copy. If this value is negative, the function does nothing.
-     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence of at least
-     *				 <i>n</i> elements. This shall not point to any element in the range [<i>first</i>, last].
-     *
-     * @return An iterator to the end of the destination range where elements have been copied.
-     */
-    function copy_n<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, n: number, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Copy certain elements of range. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which pred returns <code>true</code> to the
-     * range beginning at <i>result</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be copied. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position in the destination sequence. This shall not
-     *				 point to any element in the range [<i>first</i>, <i>last</i>).
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be copied (if
-     *			   <code>true</code>, it is copied). The function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the destination range where elements have been copied.
-     */
-    function copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T) => boolean): OutputIterator;
-    /**
-     * <p> Copy range of elements backward. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) starting from the end into the range terminating
-     * at <i>result</i>. </p>
-     *
-     * <p> The function returns an iterator to the first element in the destination range. </p>
-     *
-     * <p> The resulting range has the elements in the exact same order as [<i>first</i>, <i>last</i>). To reverse their
-     * order, see {@link reverse_copy}. </p>
-     *
-     * <p> The function begins by copying <code>*(last-1)</code> into <code>*(result-1)</code>, and then follows backward
-     * by the elements preceding these, until <i>first</i> is reached (and including it). </p>
-     *
-     * <p> The ranges shall not overlap in such a way that <i>result</i> (which is the <i>past-the-end element</i> in the
-     * destination range) points to an element in the range (first,last]. For such cases, see {@link copy}. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Bidirectional iterator} to the initial position in the destination sequence. This
-     *				 shall not point to any element in the range [<i>first</i>, <i>last</i>).
-     *
-     * @return An iterator to the first element of the destination sequence where elements have been copied.
-     */
-    function copy_backward<T, BidirectionalIterator1 extends Iterator<T>, BidirectionalIterator2 extends Iterator<T>>(first: BidirectionalIterator1, last: BidirectionalIterator1, result: BidirectionalIterator2): BidirectionalIterator2;
-    /**
-     * <p> Fill range with value. </p>
-     *
-     * <p> Assigns val to all the elements in the range [<i>first</i>, <i>last</i>). </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence of elements that support being
-     *				assigned a value of type <i>T</i>.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence of elements that support being
-     *				assigned a value of type <i>T</i>.. The range filled is [<i>first</i>, <i>last</i>), which contains
-     *				all the elements between <i>first</i> and <i>last</i>, including the element pointed by <i>first</i>
-     *				but not the element pointed by <i>last</i>.
-     * @param val Value to assign to the elements in the filled range.
-     */
-    function fill<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): void;
-    /**
-     * <p> Fill sequence with value. </p>
-     *
-     * <p> Assigns <i>val</i> to the first <i>n</i> elements of the sequence pointed by <i>first</i>. </p>
-     *
-     * @param first {@link Iterator Output iterator} to the initial position in a sequence of elements that support being
-     *				assigned a value of type <i>T</i>.
-     * @param n Number of elements to fill. If negative, the function does nothing.
-     * @param val Value to be used to fill the range.
-     *
-     * @return An iterator pointing to the element that follows the last element filled.
-     */
-    function fill_n<T, OutputIterator extends Iterator<T>>(first: OutputIterator, n: number, val: T): OutputIterator;
-    /**
-     * <p> Transform range. </p>
-     *
-     * <p> Applies <i>op</i> to each of the elements in the range [<i>first</i>, <i>last</i>) and stores the value returned
-     * by each operation in the range that begins at <i>result</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position in a sequence to be transformed.
-     * @param last {@link Iterator Input iterator} to the initial position in a sequence to be transformed. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
-     *				 stored. The range includes as many elements as [<i>first</i>, <i>last</i>).
-     * @param op Unary function that accepts one element of the type pointed to by <i>InputIterator</i> as argument, and
-     *			 returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
-     */
-    function transform<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, op: (val: T) => T): OutputIterator;
-    /**
-     * <p> Transform range. </p>
-     *
-     * <p> Calls <i>binary_op</i> using each of the elements in the range [<i>first1</i>, <i>last1</i>) as first argument,
-     * and the respective argument in the range that begins at <i>first2</i> as second argument. The value returned by
-     * each call is stored in the range that begins at <i>result</i>. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second range. The range includes as
-     *				 many elements as [<i>first1</i>, <i>last1</i>).
-     * @param result {@link Iterator Output} iterator to the initial position of the range where the operation results are
-     *				 stored. The range includes as many elements as [<i>first1</i>, <i>last1</i>).
-     * @param binary_op Binary function that accepts two elements as argument (one of each of the two sequences), and
-     *					returns some result value convertible to the type pointed to by <i>OutputIterator</i>.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the <i>result</i> sequence.
-     */
-    function transform<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, result: OutputIterator, binary_op: (x: T, y: T) => T): OutputIterator;
-    /**
-     * <p> Generate values for range with function. </p>
-     *
-     * <p> Assigns the value returned by successive calls to gen to the elements in the range [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range affected is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
-     *			  those pointed by the iterators.
-     */
-    function generate<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, gen: () => T): void;
-    /**
-     * <p> Generate values for sequence with function. </p>
-     *
-     * <p> Assigns the value returned by successive calls to <i>gen</i> to the first <i>n</i> elements of the sequence
-     * pointed by <i>first</i>. </p>
-     *
-     * @param first {@link Iterator Output iterator} to the initial position in a sequence of at least <i>n</i> elements
-     *				that support being assigned a value of the type returned by <i>gen</i>.
-     * @param n Number of values to generate. If negative, the function does nothing.
-     * @param gen Generator function that is called with no arguments and returns some value of a type convertible to
-     *			  those pointed by the iterators.
-     *
-     * @return An iterator pointing to the element that follows the last element whose value has been generated.
-     */
-    function generate_n<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, n: number, gen: () => T): ForwardIterator;
-    /**
-     * <p> Remove consecutive duplicates in range. </p>
-     *
-     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
-     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
-     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
-     * the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
-     * iterator and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
-     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
-     */
-    function unique<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): InputIterator;
-    /**
-     * <p> Remove consecutive duplicates in range. </p>
-     *
-     * <p> Removes all but the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
-     * alter the size of an array or a container): The removal is done by replacing the duplicate elements by the next
-     * element that is not a duplicate, and signaling the new size of the shortened range by returning an iterator to
-     * the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
-     * iterator and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible
-     *			   to <code>bool</code>. The value returned indicates whether both arguments are considered equivalent
-     *			  (if <code>true</code>, they are equivalent and one of them is removed). The function shall not modify
-     *			  any of its arguments.
-     *
-     * @return An iterator to the element that follows the last element not removed. The range between <i>first</i> and
-     *		   this iterator includes all the elements in the sequence that were not considered duplicates.
-     */
-    function unique<t, InputIterator extends Iterator<t>>(first: InputIterator, last: InputIterator, pred: (left: t, right: t) => boolean): InputIterator;
-    /**
-     * <p> Copy range removing duplicates. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * consecutive duplicates (elements that compare equal to the element preceding). </p>
-     *
-     * <p> Only the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>) is copied. </p>
-     *
-     * <p> The comparison between elements is performed by applying {@lnk equal_to}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
-     *				 The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     *
-     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
-     */
-    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Copy range removing duplicates. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * consecutive duplicates (elements that compare equal to the element preceding). </p>
-     *
-     * <p> Only the first element from every consecutive group of equivalent elements in the range
-     * [<i>first</i>, <i>last</i>) is copied. </p>
-     *
-     * <p> The comparison between elements is performed by applying <i>pred</i>. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position in a sequence.
-     * @param last {@link Iterator Forward iterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result Output iterator to the initial position of the range where the resulting range of values is stored.
-     *				 The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param pred Binary function that accepts two elements in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether both arguments are considered equivalent (if
-     *			   <code>true</code>, they are equivalent and one of them is removed). The function shall not modify any
-     *			   of its arguments.
-     *
-     * @return An iterator pointing to the end of the copied range, which contains no consecutive duplicates.
-     */
-    function unique_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Remove value from range. </p>
-     *
-     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements that compare equal to
-     * <i>val</i> removed, and returns an iterator to the new last of that range. </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot alter
-     * the size of an array or a container): The removal is done by replacing the elements that compare equal to
-     * <i>val</i> by the next element that does not, and signaling the new size of the shortened range by returning an
-     * iterator to the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned iterator
-     * and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value to be removed.
-     */
-    function remove<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, val: T): InputIterator;
-    /**
-     * <p> Remove elements from range. </p>
-     *
-     * <p> Transforms the range [<i>first</i>, <i>last</i>) into a range with all the elements for which pred returns
-     * <code>true</code> removed, and returns an iterator to the new last of that range. </p>
-     *
-     * <p> The function cannot alter the properties of the object containing the range of elements (i.e., it cannot
-     * alter the size of an array or a container): The removal is done by replacing the elements for which pred returns
-     * <code>true</code> by the next element for which it does not, and signaling the new size of the shortened range
-     * by returning an iterator to the element that should be considered its new past-the-last element. </p>
-     *
-     * <p> The relative order of the elements not removed is preserved, while the elements between the returned
-     * iterator and last are left in a valid but unspecified state. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be removed (if
-     *			   <code>true</code>, it is removed). The function shall not modify its argument.
-     */
-    function remove_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (left: T) => boolean): InputIterator;
-    /**
-     * <p> Copy range removing value. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * those elements that compare equal to <i>val</i>. </p>
-     *
-     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches in the sequence,
-     * which are "removed". </p>
-     *
-     * <p> The function uses {@link equal_to} to compare the individual elements to <i>val</i>. </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param val Value to be removed.
-     *
-     * @return An iterator pointing to the end of the copied range, which includes all the elements in
-     *		   [<i>first</i>, <i>last</i>) except those that compare equal to <i>val</i>.
-     */
-    function remove_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, val: T): OutputIterator;
-    /**
-     * <p> Copy range removing values. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, except
-     * those elements for which <i>pred</i> returns <code>true</code>. </p>
-     *
-     * <p> The resulting range is shorter than [<i>first</i>, <i>last</i>) by as many elements as matches, which are
-     * "removed". </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
-     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
-     *
-     * @return An iterator pointing to the end of the copied range, which includes all the elements in
-     *		   [<i>first</i>, <i>last</i>) except those for which <i>pred</i> returns <code>true</code>.
-     */
-    function remove_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean): OutputIterator;
-    /**
-     * <p> Replace value in range. </p>
-     *
-     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) that compare equal to
-     * <i>old_val</i>. </p>
-     *
-     * <p> The function uses {@link equal_to} to compare the individual elements to old_val. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param old_val Value to be replaced.
-     * @param new_val Replacement value.
-     */
-    function replace<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, old_val: T, new_val: T): void;
-    /**
-     * <p> Replace value in range. </p>
-     *
-     * <p> Assigns <i>new_val</i> to all the elements in the range [<i>first</i>, <i>last</i>) for which pred returns
-     * <code>true</code>. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be replaced (if
-     *			   <code>true</code>, it is replaced). The function shall not modify its argument.
-     * @param new_val Value to assign to replaced elements.
-     */
-    function replace_if<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (val: T) => boolean, new_val: T): void;
-    /**
-     * <p> Copy range replacing value. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
-     * the appearances of <i>old_value</i> by <i>new_value</i>. </p>
-     *
-     * <p> The function uses {@link std.equal_to} to compare the individual elements to <i>old_value</i>. </p>
-     *
-     * <p> The ranges shall not overlap in such a way that result points to an element in the range
-     * [<i>first</i>, <i>last</i>). </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param old_val Value to be replaced.
-     * @param new_val Replacement value.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function replace_copy<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, old_val: T, new_val: T): OutputIterator;
-    /**
-     * <p> Copy range replacing value. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, replacing
-     * those for which <i>pred</i> returns <code>true</code> by <i>new_value</i>. </p>
-     *
-     * @param first {@link Iterator InputIterator} to the initial position in a sequence.
-     * @param last {@link Iterator InputIterator} to the final position in a sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element is to be removed from the copy (if
-     *			   <code>true</code>, it is not copied). The function shall not modify its argument.
-     * @param new_val Value to assign to replaced values.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function replace_copy_if<T, InputIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result: OutputIterator, pred: (val: T) => boolean, new_val: T): OutputIterator;
-    /**
-     * <p> Exchange values of objects pointed to by two iterators. </p>
-     *
-     * <p> Swaps the elements pointed to by <i>x</i> and <i>y</i>. </p>
-     *
-     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
-     *
-     * @param x {@link Iterator Forward iterator} to the objects to swap.
-     * @param y {@link Iterator Forward iterator} to the objects to swap.
-     */
-    function iter_swap<T>(x: Iterator<T>, y: Iterator<T>): void;
-    /**
-     * <p> Exchange values of two ranges. </p>
-     *
-     * <p> Exchanges the values of each of the elements in the range [<i>first1</i>, <i>last1</i>) with those of their
-     * respective elements in the range beginning at <i>first2</i>. </p>
-     *
-     * <p> The function calls {@link Iterator.swap} to exchange the elements. </p>
-     *
-     * @param first1 {@link Iterator Forward iterator} to the initial position of the first sequence.
-     * @param last1 {@link Iterator Forward iterator} to the final position of the first sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), including the element pointed by <i>first1</i>, but not the element
-     *				pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Forward iterator} to the initial position of the second range. The range includes as
-     *				 many elements as [<i>first1</i>, <i>last1</i>). The two ranges shall not overlap.
-     *
-     * @return An iterator to the last element swapped in the second sequence.
-     */
-    function swap_ranges<T, ForwardIterator1 extends Iterator<T>, ForwardIterator2 extends Iterator<T>>(first1: ForwardIterator1, last1: ForwardIterator1, first2: ForwardIterator2): ForwardIterator2;
-    /**
-     * <p> Reverse range. </p>
-     *
-     * <p> Reverses the order of the elements in the range [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The function calls {@link iter_swap} to swap the elements to their new locations. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     */
-    function reverse<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator): void;
-    /**
-     * <p> Copy range reversed. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but in
-     * reverse order. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied.
-     * @param last {@link Iterator Bidirectional iterator} to the initial position in a sequence to be copied. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     *
-     * @return An output iterator pointing to the end of the copied range, which contains the same elements in reverse
-     *		   order.
-     */
-    function reverse_copy<T, BidirectionalIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Rotate left the elements in range. </p>
-     *
-     * <p> Rotates the order of the elements in the range [<i>first</i>, <i>last</i>), in such a way that the element
-     * pointed by middle becomes the new first element. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param middle An {@link Iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is
-     *				 moved to the first position in the range.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator pointing to the element that now contains the value previously pointed by <i>first</i>.
-     */
-    function rotate<T, InputIterator extends Iterator<T>>(first: InputIterator, middle: InputIterator, last: InputIterator): InputIterator;
-    /**
-     * <p> Copy range rotated left. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) to the range beginning at <i>result</i>, but
-     * rotating the order of the elements in such a way that the element pointed by <i>middle</i> becomes the first
-     * element in the resulting range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the range to be copy-rotated.
-     * @param middle Forward iterator pointing to the element within the range [<i>first</i>, <i>last</i>) that is copied as the first element in the resulting range.
-     * @param last {@link Iterator Forward iterator} to the final positions of the range to be copy-rotated. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *			   Notice that in this function, these are not consecutive parameters, but the first and <b>third</b> ones.
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the reserved range is
-     *				 stored. The pointed type shall support being assigned the value of an element in the range
-     *				 [<i>first</i>, <i>last</i>).
-     *
-     * @return An output iterator pointing to the end of the copied range.
-     */
-    function rotate_copy<T, ForwardIterator extends Iterator<T>, OutputIterator extends Iterator<T>>(first: ForwardIterator, middle: ForwardIterator, last: ForwardIterator, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Randomly rearrange elements in range. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly. </p>
-     *
-     * <p> The function swaps the value of each element with that of some other randomly picked element. When provided,
-     * the function gen determines which element is picked in every case. Otherwise, the function uses some unspecified
-     * source of randomness. </p>
-     *
-     * <p> To specify a uniform random generator, see {@link shuffle}. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     */
-    function random_shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Randomly rearrange elements in range using generator. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>) randomly, using <i>g</i> as uniform random
-     * number generator. </p>
-     *
-     * <p> The function swaps the value of each element with that of some other randomly picked element. The function
-     * determines the element picked by calling <i>g()</i>. </p>
-     *
-     * <p> To shuffle the elements of the range without such a generator, see {@link random_shuffle} instead. </p>
-     *
-     * <h5> Note </h5>
-     * <p> Using random generator engine is not implemented yet. </p>
-     *
-     * @param first An {@link Iterator} to the initial position in a sequence.
-     * @param last An {@link Iterator} to the final position in a sequence. The range used is [<i>first</i>, <i>last</i>),
-     *			  which contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			  <i>first</i> but not the element pointed by <i>last</i>.
-     */
-    function shuffle<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Sort elements in range. </p>
-     *
-     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into ascending order. The elements are compared
-     * using {@link less}. </p>
-     *
-     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
-     *				The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *				and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *				<i>first</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *				{@link Iterator.swap swap} is properly defined.
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *			  {@link Iterator.swap swap} is properly defined.
-     */
-    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Sort elements in range. </p>
-     *
-     * <p> Sorts the elements in the range [<i>first</i>, <i>last</i>) into specific order. The elements are compared
-     * using <i>compare</i>. </p>
-     *
-     * @param first {@link IArrayIterator Random-access iterator} to the initial position of the sequence to be sorted.
-     *				The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *				and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *				<i>first</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *				{@link Iterator.swap swap} is properly defined.
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>. {@link IArrayIterator RandomAccessIterator} shall point to a type for which
-     *			  {@link Iterator.swap swap} is properly defined.
-     *
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
-     *		  convertible to <code>boolean</code>. The value returned indicates whether the element passed as first
-     *		  argument is considered to go before the second in the specific strict weak ordering it defines. The
-     *		  function shall not modify any of its arguments. This can either be a function pointer or a function
-     *		  object.
-     */
-    function sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, last: RandomAccessIterator, compare: (left: T, right: T) => boolean): void;
-    /**
-     * <p> Partially sort elements in range. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
-     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
-     * elements are left without any specific order. </p>
-     *
-     * <p> The elements are compared using {@link less}. </p>
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
-     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>.
-     */
-    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator): void;
-    /**
-     * <p> Partially sort elements in range. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that the elements before
-     * <i>middle</i> are the smallest elements in the entire range and are sorted in ascending order, while the remaining
-     * elements are left without any specific order. </p>
-     *
-     * <p> The elements are compared using <i>comp</i>. </p>
-     *
-     * @param last {@link IArrayIterator Random-access iterator} to the first position of the sequence to be sorted.
-     * @param middle {@link IArrayIterator Random-access iterator} pointing to the element within the range [<i>first</i>, <i>last</i>) that is used as the upper boundary of the elements that are fully sorted.
-     * @param last {@link IArrayIterator Random-access iterator} to the final position of the sequence to be sorted.
-     *			  The range used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i>
-     *			  and <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by
-     *			  <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value
-     *				  convertible to <code>boolean</code>. The value returned indicates whether the element passed as
-     *				  first argument is considered to go before the second in the specific strict weak ordering it
-     *				  defines. The function shall not modify any of its arguments.
-     */
-    function partial_sort<T, RandomAccessIterator extends base.IArrayIterator<T>>(first: RandomAccessIterator, middle: RandomAccessIterator, last: RandomAccessIterator, compare: (x: T, y: T) => boolean): void;
-    /**
-     * <p> Copy and partially sort range. </p>
-     *
-     * <p> Copies the smallest  elements in the range [<i>first</i>, <i>last</i>) to
-     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
-     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
-     * elements in [<i>first</i>, <i>last</i>)). </p>
-     *
-     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
-     *
-     * <p> The elements are compared using {@link less}. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
-     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
-     *			   <i>RandomAccessIterator</i>.
-     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
-     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
-     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
-     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
-     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
-     *				  defines. The function shall not modify any of its arguments.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator): RandomAccessIterator;
-    /**
-     * <p> Copy and partially sort range. </p>
-     *
-     * <p> Copies the smallest (or largest) elements in the range [<i>first</i>, <i>last</i>) to
-     * [<i>result_first</i>, <i>result_last</i>), sorting the elements copied. The number of elements copied is the same
-     * as the {@link distance} between <i>result_first</i> and <i>result_last</i> (unless this is more than the amount of
-     * elements in [<i>first</i>, <i>last</i>)). </p>
-     *
-     * <p> The range [<i>first</i>, <i>last</i>) is not modified. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the sequence to copy from.
-     * @param last {@link Iterator Input iterator} to the final position of the sequence to copy from. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *			   <i>InputIterator</i> shall point to a type assignable to the elements pointed by
-     *			   <i>RandomAccessIterator</i>.
-     * @param result_first {@link Iterator Random-access iterator} to the initial position of the destination sequence.
-     * @param result_last {@link Iterator Random-access iterator} to the final position of the destination sequence.
-     *					  The range used is [<i>result_first</i>, <i>result_last</i>).
-     * @param compare Binary function that accepts two elements in the result range as arguments, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the element passed as first
-     *				  argument is considered to go before the second in the specific <i>strict weak ordering</i> it
-     *				  defines. The function shall not modify any of its arguments.
-     *
-     * @return An iterator pointing to the element that follows the last element written in the result sequence.
-     */
-    function partial_sort_copy<T, InputIterator extends Iterator<T>, RandomAccessIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, result_first: RandomAccessIterator, result_last: RandomAccessIterator, compare: (x: T, y: T) => boolean): RandomAccessIterator;
-    /**
-     * <p> Check whether range is sorted. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
-     *
-     * <p> The elements are compared using {@link less}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
-     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
-     *		   the function always returns <code>true</code>.
-     */
-    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): boolean;
-    /**
-     * <p> Check whether range is sorted. </p>
-     *
-     * <p> Returns <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered to go before the second in the specific strict weak ordering it defines. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return <code>true</code> if the range [<i>first</i>, <i>last</i>) is sorted into ascending order,
-     *		   <code>false</code> otherwise. If the range [<i>first</i>, <i>last</i>) contains less than two elements,
-     *		   the function always returns <code>true</code>.
-     */
-    function is_sorted<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Find first unsorted element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
-     * ascending order. </p>
-     *
-     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
-     *
-     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
-     *
-     * <p> The elements are compared using {@link equal_to}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered to go before the second in the specific strict weak ordering it defines. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
-     *		   all elements are sorted or if the range contains less than two elements.
-     */
-    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
-    /**
-     * <p> Find first unsorted element in range. </p>
-     *
-     * <p> Returns an iterator to the first element in the range [<i>first</i>, <i>last</i>) which does not follow an
-     * ascending order. </p>
-     *
-     * <p> The range between <i>first</i> and the iterator returned {@link is_sorted is sorted}. </p>
-     *
-     * <p> If the entire range is sorted, the function returns <i>last</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence. The range checked is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered to go before the second in the specific strict weak ordering it defines. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the first element in the range which does not follow an ascending order, or <i>last</i> if
-     *		   all elements are sorted or if the range contains less than two elements.
-     */
-    function is_sorted_until<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return iterator to lower bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
-     * compare less than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
-     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
-     * <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
-     * to <i>val</i>, and not only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
-    /**
-     * <p> Return iterator to lower bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which does not
-     * compare less than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
-     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
-     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link upper_bound}, the value pointed by the iterator returned by this function may also be equivalent
-     * to <i>val</i>, and not only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
-     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
-     *				  returned indicates whether the first argument is considered to go before the second. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the lower bound of <i>val</i> in the range. If all the element in the range compare less than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function lower_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return iterator to upper bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
-     * greater than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in the range shall already be {@link is_sorted sorted}
-     * according to this same criterion ({@link less}), or at least {@link is_partitioned partitioned} with respect to
-     * <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
-     * <i>val</i>, only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): ForwardIterator;
-    /**
-     * <p> Return iterator to upper bound. </p>
-     *
-     * <p> Returns an iterator pointing to the first element in the range [<i>first</i>, <i>last</i>) which compares
-     * greater than <i>val</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. The elements in the range shall already be
-     * {@link is_sorted sorted} according to this same criterion (<i>compare</i>), or at least
-     * {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> Unlike {@link lower_bound}, the value pointed by the iterator returned by this function cannot be equivalent to
-     * <i>val</i>, only greater. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments (the first of the type pointed by <i>ForwardIterator</i>,
-     *				  and the second, always <i>val</i>), and returns a value convertible to <code>bool</code>. The value
-     *				  returned indicates whether the first argument is considered to go before the second. The function
-     *				  shall not modify any of its arguments.
-     *
-     * @return An iterator to the upper bound of <i>val</i> in the range. If no element in the range comparse greater than
-     *		   <i>val</i>, the function returns <i>last</i>.
-     */
-    function upper_bound<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
-     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
-     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
-     */
-    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): Pair<ForwardIterator, ForwardIterator>;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>ax/i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
-     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *				  the first argument is considered to go before the second. The function shall not modify any of its
-     *				  arguments.
-     *
-     * @return A {@link Pair} object, whose member {@link Pair.first} is an iterator to the lower bound of the subrange of
-     *		   equivalent values, and {@link Pair.second} its upper bound. The values are the same as those that would be
-     *		   returned by functions {@link lower_bound} and {@link upper_bound} respectively.
-     */
-    function equal_range<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * ({@link less}), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range. <i>T</i> shall be a type supporting being compared
-     *			  with elements of the range [<i>first</i>, <i>last</i>) as the left-hand side operand of {@link less}.
-     *
-     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
-     */
-    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T): boolean;
-    /**
-     * <p> Get subrange of equal elements. </p>
-     *
-     * <p> Returns the bounds of the subrange that includes all the elements of the range [<i>first</i>, <i>last</i>) with
-     * values equivalent to <i>val</i>. </p>
-     *
-     * <p> The elements are compared using {<i>compare</i>}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be {@link is_sorted sorted} according to this same criterion
-     * (<i>compare</i>), or at least {@link is_partitioned partitioned} with respect to <i>val</i>. </p>
-     *
-     * <p> If <i>val</i> is not equivalent to any value in the range, the subrange returned has a length of zero, with both
-     * iterators pointing to the nearest value greater than <i>val</i>, if any, or to <i>last</i>, if <i>val</i> compares
-     * greater than all the elements in the range. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of a {@link is_sorted sorted} (or properly
-     *				{@link is_partitioned partitioned}) sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of a {@link is_sorted sorted} (or properly
-     *			   {@link is_partitioned partitioned}) sequence. The range used is [<i>first</i>, <i>last</i>), which
-     *			   contains all the elements between <i>first</i> and <i>last</i>, including the element pointed by
-     *			   <i>first</i> but not the element pointed by <i>last</i>.
-     * @param val Value of the lower bound to search for in the range.
-     * @param compare Binary function that accepts two arguments of the type pointed by <i>ForwardIterator</i> (and of type
-     *				  <i>T</i>), and returns a value convertible to <code>bool</code>. The value returned indicates whether
-     *				  the first argument is considered to go before the second. The function shall not modify any of its
-     *				  arguments.
-     *
-     * @return <code>true</code> if an element equivalent to <i>val</i> is found, and <code>false</code> otherwise.
-     */
-    function binary_search<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, val: T, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Test whether range is partitioned. </p>
-     *
-     * <p> Returns <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i>
-     * returns <code>true</code> precede those for which it returns <code>false</code>. </p>
-     *
-     * <p> If the range is {@link IContainer.empty empty}, the function returns <code>true</code>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the sequence.
-     * @param last {@link Iterator Input iterator} to the final position of the sequence. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
-     *			   <code>true</code>, the element is expected before all the elements for which it returns
-     *			   <code>false</code>). The function shall not modify its argument.
-     *
-     * @return <code>true</code> if all the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns
-     *		   <code>true</code> precede those for which it returns <code>false</code>. Otherwise it returns
-     *		   <code>false</code>. If the range is {@link IContainer.empty empty}, the function returns <code>true</code>.
-     */
-    function is_partitioned<T, InputIterator extends Iterator<T>>(first: InputIterator, last: InputIterator, pred: (x: T) => boolean): boolean;
-    /**
-     * <p> Partition range in two. </p>
-     *
-     * <p> Rearranges the elements from the range [<i>first</i>, <i>last</i>), in such a way that all the elements for
-     * which <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>. The iterator
-     * returned points to the first element of the second group. </p>
-     *
-     * <p> The relative ordering within each group is not necessarily the same as before the call. See
-     * {@link stable_partition} for a function with a similar behavior but with stable ordering within each group. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the sequence to partition.
-     * @param last {@link Iterator Forward iterator} to the final position of the sequence to partition. The range used is
-     *			   [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
-     *			   <code>true</code>, the element is expected before all the elements for which it returns
-     *			   <code>false</code>). The function shall not modify its argument.
-     *
-     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
-     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
-     */
-    function partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
-    /**
-     * <p> Partition range in two - stable ordering. </p>
-     *
-     * <p> Rearranges the elements in the range [<i>first</i>, <i>last</i>), in such a way that all the elements for which
-     * <i>pred</i> returns <code>true</code> precede all those for which it returns <code>false</code>, and, unlike
-     * function {@link partition}, the relative order of elements within each group is preserved. </p>
-     *
-     * <p> This is generally implemented using an internal temporary buffer. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position of the sequence to partition.
-     * @param last {@link Iterator Bidirectional iterator} to the final position of the sequence to partition. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element belongs to the first group (if
-     *			   <code>true</code>, the element is expected before all the elements for which it returns
-     *			   <code>false</code>). The function shall not modify its argument.
-     *
-     * @return An iterator that points to the first element of the second group of elements (those for which <i>pred</i>
-     *		   returns <code>false</code>), or <i>last</i> if this group is {@link IContainer.empty empty}.
-     */
-    function stable_partition<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, last: BidirectionalIterator, pred: (x: T) => boolean): BidirectionalIterator;
-    /**
-     * <p> Partition range into two. </p>
-     *
-     * <p> Copies the elements in the range [<i>first</i>, <i>last</i>) for which <i>pred</i> returns <code>true</code>
-     * into the range pointed by <i>result_true</i>, and those for which it does not into the range pointed by
-     * <i>result_false</i>. </p>
-     *
-     * @param first {@link Iterator Input iterator} to the initial position of the range to be copy-partitioned.
-     * @param last {@link Iterator Input iterator} to the final position of the range to be copy-partitioned. The range
-     *			   used is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and
-     *			   <i>last</i>, including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param result_true {@link Iterator Output iterator} to the initial position of the range where the elements for
-     *					  which <i>pred</i> returns <code>true</code> are stored.
-     * @param result_false {@link Iterator Output iterator} to the initial position of the range where the elements for
-     *					   which <i>pred</i> returns <code>false</code> are stored.
-     * @param pred Unary function that accepts an element pointed by <i>InputIterator</i> as argument, and returns a value
-     *			   convertible to <code>bool</code>. The value returned indicates on which result range the element is
-     *			   copied. The function shall not modify its argument.
-     *
-     * @return A {@link Pair} of iterators with the end of the generated sequences pointed by <i>result_true</i> and
-     *		   <i>result_false</i>, respectivelly. Its member {@link Pair.first first} points to the element that follows
-     *		   the last element copied to the sequence of elements for which <i>pred</i> returned <code>true</code>. Its
-     *		   member {@link Pair.second second} points to the element that follows the last element copied to the sequence
-     *		   of elements for which <i>pred</i> returned <code>false</code>.
-     */
-    function partition_copy<T, InputIterator extends Iterator<T>, OutputIterator1 extends Iterator<T>, OutputIterator2 extends Iterator<T>>(first: InputIterator, last: InputIterator, result_true: OutputIterator1, result_false: OutputIterator2, pred: (val: T) => T): Pair<OutputIterator1, OutputIterator2>;
-    /**
-     * <p> Get partition point. </p>
-     *
-     * <p> Returns an iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which
-     * <i>pred</i> is not <code>true</code>, indicating its partition point. </p>
-     *
-     * <p> The elements in the range shall already {@link is_partitioned be partitioned}, as if {@link partition} had been
-     * called with the same arguments. </p>
-     *
-     * <p> The function optimizes the number of comparisons performed by comparing non-consecutive elements of the sorted
-     * range, which is specially efficient for {@link Iteartor random-access iterators}. </p>
-     *
-     * @param first {@link Iterator Forward iterator} to the initial position of the partitioned sequence.
-     * @param last {@link Iterator Forward iterator} to the final position of the partitioned sequence. The range checked
-     *		  is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> an <i>last</i>,
-     *		  including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param pred Unary function that accepts an element in the range as argument, and returns a value convertible to
-     *			   <code>bool</code>. The value returned indicates whether the element goes before the partition point (if
-     *			   <code>true</code>, it goes before; if <code>false</code> goes at or after it). The function shall not
-     *			   modify its argument.
-     *
-     * @return An iterator to the first element in the partitioned range [<i>first</i>, <i>last</i>) for which <i>pred</i>
-     *		   is not <code>true</code>, or <i>last</i> if it is not <code>true</code> for any element.
-     */
-    function partition_point<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, pred: (x: T) => boolean): ForwardIterator;
-    /**
-     * <p> Merge sorted ranges. </p>
-     *
-     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
-     * a new range beginning at <i>result</i> with all its elements sorted. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
-     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
-     *				 range is stored. Its size is equal to the sum of both ranges above.
-     *
-     * @return An iterator pointing to the past-the-end element in the resulting sequence.
-     */
-    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Merge sorted ranges. </p>
-     *
-     * <p> Combines the elements in the sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>), into
-     * a new range beginning at <i>result</i> with all its elements sorted. </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
-     * this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting combined
-     *				 range is stored. Its size is equal to the sum of both ranges above.
-     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator pointing to the past-the-end element in the resulting sequence.
-     */
-    function merge<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Merge consecutive sorted ranges. </p>
-     *
-     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
-     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The elements are compared using {@link less}. The elements in both ranges shall already be ordered according to
-     * this same criterion ({@link less}). The resulting range is also sorted according to this. </p>
-     *
-     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
-     * range preceding those equivalent in the second. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
-     *				This is also the initial position where the resulting merged range is stored.
-     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
-     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
-     *				 sequence.
-     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
-     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
-     *			   stored.
-     */
-    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator): void;
-    /**
-     * <p> Merge consecutive sorted ranges. </p>
-     *
-     * <p> Merges two consecutive sorted ranges: [<i>first</i>, <i>middle</i>) and [<i>middle</i>, <i>last</i>), putting
-     * the result into the combined sorted range [<i>first</i>, <i>last</i>). </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. The elements in both ranges shall already be ordered according
-     * to this same criterion (<i>compare</i>). The resulting range is also sorted according to this. </p>
-     *
-     * <p> The function preserves the relative order of elements with equivalent values, with the elements in the first
-     * range preceding those equivalent in the second. </p>
-     *
-     * @param first {@link Iterator Bidirectional iterator} to the initial position in the first sorted sequence to merge.
-     *				This is also the initial position where the resulting merged range is stored.
-     * @param middle {@link Iterator Bidirectional iterator} to the initial position of the second sorted sequence, which
-     *				 because both sequences must be consecutive, matches the <i>past-the-end</i> position of the first
-     *				 sequence.
-     * @param last {@link Iterator Bidirectional iterator} to the <i>past-the-end</i> position of the second sorted
-     *			   sequence. This is also the <i>past-the-end</i> position of the range where the resulting merged range is
-     *			   stored.
-     * @param compare Binary function that accepts two arguments of the types pointed by the iterators, and returns a value
-     *				  convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     */
-    function inplace_merge<T, BidirectionalIterator extends Iterator<T>>(first: BidirectionalIterator, middle: BidirectionalIterator, last: BidirectionalIterator, compare: (x: T, y: T) => boolean): void;
-    /**
-     * <p> Test whether sorted range includes another sorted range. </p>
-     *
-     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
-     * sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be ordered according to this same criterion ({@link less}). </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
-     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
-     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
-     *				<i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
-     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
-     *
-     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
-     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
-     *		   range, the function returns <code>true</code>.
-     */
-    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2): boolean;
-    /**
-     * <p> Test whether sorted range includes another sorted range. </p>
-     *
-     * <p> Returns <code>true</code> if the sorted range [<i>first1</i>, <i>last1</i>) contains all the elements in the
-     * sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the range shall already be ordered according to this same criterion (<i>compare</i>). </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence (which is tested on
-     *				whether it contains the second sequence). The range used is [<i>first1</i>, <i>last1</i>), which
-     *				contains all the elements between <i>first1</i> and <i>last1</i>, including the element pointed by
-     *				<i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. (which is tested
-     *				on whether it is contained in the first sequence). The range used is [<i>first2</i>, <i>last2</i>).
-     * @param compare Binary function that accepts two elements as arguments (one from each of the two sequences, in the
-     *				  same order), and returns a value convertible to <code>bool</code>. The value returned indicates
-     *				  whether the element passed as first argument is considered to go before the second in the specific
-     *				  <i>strict weak ordering</i> it defines. The function shall not modify any of its arguments.
-     *
-     * @return <code>true</code> if every element in the range [<i>first2</i>, <i>last2</i>) is contained in the range
-     *		   [<i>first1</i>, <i>last1</i>), <code>false</code> otherwise. If [<i>first2</i>, <i>last2</i>) is an empty
-     *		   range, the function returns <code>true</code>.
-     */
-    function includes<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, compare: (x: T, y: T) => boolean): boolean;
-    /**
-     * <p> Union of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
-     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
-     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
-     * range. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Union of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set union</i> of the
-     * two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>union</i> of two sets is formed by the elements that are present in either one of the sets, or in both.
-     * Elements from the second range that have an equivalent element in the first range are not copied to the resulting
-     * range. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_union<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Intersection of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
-     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
-     * copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Intersection of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set intersection</i> of
-     * the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>intersection</i> of two sets is formed only by the elements that are present in both sets. The elements
-     * copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_intersection<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
-     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
-     * second one. The elements copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
-     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
-     *
-     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
-     * </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by <i>result</i> with the <i>set difference</i> of
-     * the sorted range [<i>first1</i>, <i>last1</i>) with respect to the sorted range [<i>first2</i>, <i>last2</i>). </p>
-     *
-     * <p> The <i>difference</i> of two sets is formed by the elements that are present in the first set, but not in the
-     * second one. The elements copied by the function come always from the first range, in the same order. </p>
-     *
-     * <p> For containers supporting multiple occurrences of a value, the <i>difference</i> includes as many occurrences of
-     * a given value as in the first range, minus the amount of matching elements in the second, preserving order. </p>
-     *
-     * <p> Notice that this is a directional operation - for a symmetrical equivalent, see {@link set_symmetric_difference}.
-     * </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the first range.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Symmetric difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
-     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
-     * </p>
-     *
-     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
-     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
-     * existent order before the call. The existing order is also preserved for the copied elements. </p>
-     *
-     * <p> The elements are compared using {@link less}. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!std.less(x, y) && !std.less(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion ({@link std.less}). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator): OutputIterator;
-    /**
-     * <p> Symmetric difference of two sorted ranges. </p>
-     *
-     * <p> Constructs a sorted range beginning in the location pointed by0 <i>result</i> with the set
-     * <i>symmetric difference</i> of the two sorted ranges [<i>first1</i>, <i>last1</i>) and [<i>first2</i>, <i>last2</i>).
-     * </p>
-     *
-     * <p> The <i>symmetric difference</i> of two sets is formed by the elements that are present in one of the sets, but
-     * not in the other. Among the equivalent elements in each range, those discarded are those that appear before in the
-     * existent order before the call. The existing order is also preserved for the copied elements. </p>
-     *
-     * <p> The elements are compared using <i>compare</i>. Two elements, <i>x</i> and <i>y</i> are considered equivalent
-     * <code>if (!compare(x, y) && !compare(y, x))</code>. </p>
-     *
-     * <p> The elements in the ranges shall already be ordered according to this same criterion (<i>compare</i>). The
-     * resulting range is also sorted according to this. </p>
-     *
-     * @param first1 {@link Iterator Input iterator} to the initial position of the first sorted sequence.
-     * @param last1 {@link Iterator Input iterator} to the final position of the first sorted sequence. The range used is
-     *				[<i>first1</i>, <i>last1</i>), which contains all the elements between <i>first1</i> and <i>last1</i>,
-     *				including the element pointed by <i>first1</i> but not the element pointed by <i>last1</i>.
-     * @param first2 {@link Iterator Input iterator} to the initial position of the second sorted sequence.
-     * @param last2 {@link Iterator Input iterator} to the final position of the second sorted sequence. The range used is
-     *				[<i>first2</i>, <i>last2</i>).
-     * @param result {@link Iterator Output iterator} to the initial position of the range where the resulting sequence is
-     *				 stored. The pointed type shall support being assigned the value of an element from the other ranges.
-     * @param compare Binary function that accepts two arguments of the types pointed by the input iterators, and returns a
-     *				  value convertible to <code>bool</code>. The value returned indicates whether the first argument is
-     *				  considered to go before the second in the specific <i>strict weak ordering</i> it defines. The
-     *				  function shall not modify any of its arguments.
-     *
-     * @return An iterator to the end of the constructed range.
-     */
-    function set_symmetric_difference<T, InputIterator1 extends Iterator<T>, InputIterator2 extends Iterator<T>, OutputIterator extends Iterator<T>>(first1: InputIterator1, last1: InputIterator1, first2: InputIterator2, last2: InputIterator2, result: OutputIterator, compare: (x: T, y: T) => boolean): OutputIterator;
-    /**
-     * <p> Return the smallest. </p>
-     *
-     * <p> Returns the smallest of all the elements in the <i>args</i>. </p>
-     *
-     * @param args Values to compare.
-     *
-     * @return The lesser of the values passed as arguments.
-     */
-    function min<T>(...args: T[]): T;
-    /**
-     * <p> Return the largest. </p>
-     *
-     * <p> Returns the largest of all the elements in the <i>args</i>. </p>
-     *
-     * @param args Values to compare.
-     *
-     * @return The largest of the values passed as arguments.
-     */
-    function max<T>(...args: T[]): T;
-    /**
-     * <p> Return smallest and largest elements. </p>
-     *
-     * <p> Returns a {@link Pair} with the smallest of all the elements in the <i>args</i> as first element (the first of
-     * them, if there are more than one), and the largest as second (the last of them, if there are more than one). </p>
-     *
-     * @param args Values to compare.
-     *
-     * @return The lesser and greatest of the values passed as arguments.
-     */
-    function minmax<T>(...args: T[]): Pair<T, T>;
-    /**
-     * <p> Return smallest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either {@link less}; An element is the smallest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
-     */
-    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
-    /**
-     * <p> Return smallest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the smallest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either <i>compare</i>; An element is the smallest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return An iterator to smallest value in the range, or <i>last</i> if the range is empty.
-     */
-    function min_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return largest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either {@link greater}; An element is the largest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     *
-     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
-     */
-    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): ForwardIterator;
-    /**
-     * <p> Return largest element in range. </p>
-     *
-     * <p> Returns an iterator pointing to the element with the largest value in the range  [<i>first</i>, <i>last</i>).
-     * </p>
-     *
-     * <p> The comparisons are performed using either <i>compare</i>; An element is the largest if no other element
-     * compares less than it. If more than one element fulfills this condition, the iterator returned points to the first
-     * of such elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return An iterator to largest value in the range, or <i>last</i> if the range is empty.
-     */
-    function max_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): ForwardIterator;
-    /**
-     * <p> Return smallest and largest elements in range. </p>
-     *
-     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
-     *
-     * <p> The comparisons are performed using either {@link less} and {@link greater}. </p>
-     *
-     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
-     * elements. </p>
-     *
-     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
-     * elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
-     */
-    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator): Pair<ForwardIterator, ForwardIterator>;
-    /**
-     * <p> Return smallest and largest elements in range. </p>
-     *
-     * <p> Returns a {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     * [<i>first</i>, <i>last</i>) as first element, and the largest as second. </p>
-     *
-     * <p> The comparisons are performed using either <i>compare</i>. </p>
-     *
-     * <p> If more than one equivalent element has the smallest value, the first iterator points to the first of such
-     * elements. </p>
-     *
-     * <p> If more than one equivalent element has the largest value, the second iterator points to the last of such
-     * elements. </p>
-     *
-     * @param first {@link Iteartor Input iterator} to the initial final position of the sequence to compare.
-     * @param last {@link Iteartor Input iterator} to the final final position of the sequence to compare. The range used
-     *			   is [<i>first</i>, <i>last</i>), which contains all the elements between <i>first</i> and <i>last</i>,
-     *			   including the element pointed by <i>first</i> but not the element pointed by <i>last</i>.
-     * @param compare Binary function that accepts two elements in the range as arguments, and returns a value convertible
-     *				  to <code>bool</code>. The value returned indicates whether the element passed as first argument is
-     *				  considered less than the second. The function shall not modify any of its arguments.
-     *
-     * @return A {@link Pair} with an iterator pointing to the element with the smallest value in the range
-     *		   [<i>first</i>, <i>last</i>) as first element, and the largest as second.
-     */
-    function minmax_element<T, ForwardIterator extends Iterator<T>>(first: ForwardIterator, last: ForwardIterator, compare: (x: T, y: T) => boolean): Pair<ForwardIterator, ForwardIterator>;
-}
-declare namespace std {
-    /**
-     * <p> Function object class for equality comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether its two arguments compare <i>equal</i> (as returned by
-     * operator ==). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
-     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element to compare.
-     * @param y Second element to compare.
-     *
-     * @return Whether the arguments are equal.
-     */
-    function equal_to<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function object class for non-equality comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether its two arguments compare <i>not equal</i> (as returned
-     * by operator operator!=). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.equal_to equal_to}
-     * defined. This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element to compare.
-     * @param y Second element to compare.
-     *
-     * @return Whether the arguments are not equal.
-     */
-    function not_equal_to<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function for less-than inequality comparison. </p>
-     *
-     * <p> Binary function returns whether the its first argument compares less than the second. </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
-     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
-     * This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()}</code>,
-     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
-     *
-     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
-     *			  <i>operator<()</i> or method {@link IComparable.less less}.
-     *
-     * @param x First element, the standard of comparison.
-     * @param y Second element compare with the first.
-     *
-     * @return Whether the first parameter is less than the second.
-     */
-    function less<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function object class for less-than-or-equal-to comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether the its first argument compares {@link less less than} or
-     * {@link equal_to equal to} the second (as returned by operator <=). </p>
-     *
-     * <p> Generically, <i>function objects</i> are instances of a class with member function {@link IComparable.less less}
-     * and {@link IComparable.equal_to equal_to} defined. This member function allows the object to be used with the same
-     * syntax as a function call. </p>
-     *
-     * @param x First element, the standard of comparison.
-     * @param y Second element compare with the first.
-     *
-     * @return Whether the <i>x</i> is {@link less less than} or {@link equal_to equal to} the <i>y</i>.
-     */
-    function less_equal<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function for greater-than inequality comparison. </p>
-     *
-     * <p> Binary function returns whether the its first argument compares greater than the second. </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link less} and
-     * {@link equal_to equal_to()} defined. If an object doesn't have those methods, then its own uid will be used
-     * to compare insteadly. This member function allows the object to be used with the same syntax as a function
-     * call. </p>
-     *
-     * <p> Objects of this class can be used on standard algorithms such as {@link sort sort()},
-     * {@link merge merge()} or {@link TreeMap.lower_bound lower_bound()}. </p>
-     *
-     * @param <T> Type of arguments to compare by the function call. The type shall supporrt the operation
-     *			  <i>operator>()</i> or method {@link IComparable.greater greater}.
-     *
-     * @return Whether the <i>x</i> is greater than the <i>y</i>.
-     */
-    function greater<T>(x: T, y: T): boolean;
-    /**
-     * <p> Function object class for greater-than-or-equal-to comparison. </p>
-     *
-     * <p> Binary function object class whose call returns whether the its first argument compares
-     * {@link greater greater than} or {@link equal_to equal to} the second (as returned by operator >=). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function {@link IComparable.less less}
-     * defined. If an object doesn't have the method, then its own uid will be used to compare insteadly.
-     * This member function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element, the standard of comparison.
-     * @param y Second element compare with the first.
-     *
-     * @return Whether the <i>x</i> is {@link greater greater than} or {@link equal_to equal to} the <i>y</i>.
-     */
-    function greater_equal<T>(x: T, y: T): boolean;
-    /**
-     * <p> Logical AND function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of the <i>logical "and"</i> operation between its two
-     * arguments (as returned by operator &&). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
-     * function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of logical AND operation.
-     */
-    function logical_and<T>(x: T, y: T): boolean;
-    /**
-     * <p> Logical OR function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of the <i>logical "or"</i> operation between its two
-     * arguments (as returned by operator ||). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
-     * function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of logical OR operation.
-     */
-    function logical_or<T>(x: T, y: T): boolean;
-    /**
-     * <p> Logical NOT function object class. </p>
-     *
-     * <p> Unary function object class whose call returns the result of the <i>logical "not"</i> operation on its argument
-     * (as returned by operator !). </p>
-     *
-     * <p> Generically, function objects are instances of a class with member function operator() defined. This member
-     * function allows the object to be used with the same syntax as a function call. </p>
-     *
-     * @param x Target element.
-     *
-     * @return Result of logical NOT operation.
-     */
-    function logical_not<T>(x: T): boolean;
-    /**
-     * <p> Bitwise AND function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
-     * its two arguments (as returned by operator &). </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of bitwise AND operation.
-     */
-    function bit_and(x: number, y: number): number;
-    /**
-     * <p> Bitwise OR function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "and"</i> operation between
-     * its two arguments (as returned by operator &). </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of bitwise OR operation.
-     */
-    function bit_or(x: number, y: number): number;
-    /**
-     * <p> Bitwise XOR function object class. </p>
-     *
-     * <p> Binary function object class whose call returns the result of applying the <i>bitwise "exclusive or"</i>
-     * operation between its two arguments (as returned by operator ^). </p>
-     *
-     * @param x First element.
-     * @param y Second element.
-     *
-     * @return Result of bitwise XOR operation.
-     */
-    function bit_xor(x: number, y: number): number;
-    /**
-     * <p> Comparable instance. </p>
-     *
-     * <p> {@link IComparable} is a common interface for objects who can compare each other. </p>
-     *
-     * @reference https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IComparable<T> extends Object {
-        /**
-         * <p> Indicates whether some other object is &quot;equal to&quot; this one. </p>
-         *
-         * <p> The {@link equal_to} method implements an equivalence relation on non-null object references: </p>
-         *
-         * <ul>
-         *	<li>
-         *		It is <b>reflexive</b>: for any non-null reference value <code>x</code>, <code>x.equal_to(x)</code>
-         *		should return <code>true</code>.
-         *	</li>
-         *	<li>
-         *		It is <b>symmetric</b>: for any non-null reference values <code>x</code> and <code>y</code>,
-         *		<code>x.equal_to(y)</code> should return <code>true</code> if and only if <code>y.equal_to(x)</code>
-         *		returns <code>true</code>. </li>
-         *	<li>
-         *		It is <b>transitive</b>: for any non-null reference values <code>x</code>, <code>y</code>, and
-         *		<code>z</code>, if <code>x.equal_to(y)</code> returns <code>true</code> and <code>y.equal_to(z)</code>
-         *		returns <code>true</code>, then <code>x.equal_to(z)</code> should return <code>true</code>.
-         *	</li>
-         *	<li>
-         *		It is <b>consistent</b>: for any non-null reference values <code>x</code> and <code>y</code>, multiple
-         *		invocations of <code>x.equal_to(y)</code> consistently return <code>true</code> or consistently return
-         *		<code>false</code>, provided no information used in equal_to comparisons on the objects is modified.
-         *	</li>
-         *	<li>
-         *		For any non-null reference value <code>x</code>, <code>x.equal_to(null)</code> should return
-         *		<code>false</code>.
-         *	</li>
-         * </ul>
-         *
-         * <p> The {@link equal_to} method for interface {@link IComparable} implements the most discriminating possible
-         * equivalence relation on objects; that is, for any non-null reference values <code>x</code> and
-         * <code>y</code>, this method returns <code>true</code> if and only if <code>x</code> and <code>y</code>
-         * refer to the same object (<code>x == y</code> has the value <code>true</code>). </p>
-         *
-         * <p> Note that it is generally necessary to override the {@link hash_code} method whenever this method is
-         * overridden, so as to maintain the general contract for the {@link hash_code} method, which states that
-         * equal objects must have equal hash codes. </p>
-         *
-         * <ul>
-         *	<li> {@link IComparable.equal_to} is called by {@link std.equal_to}. </li>
-         * </ul>
-         *
-         * @param obj the reference object with which to compare.
-         *
-         * @return <code>true</code> if this object is the same as the obj argument; <code>false</code> otherwise.
-         */
-        equal_to(obj: T): boolean;
-        /**
-         * <p> Less-than inequality comparison. </p>
-         *
-         * <p> Binary method returns whether the the instance compares less than the <i>obj</i>. </p>
-         *
-         * <ul>
-         *	<li>
-         *		{@link IComparable.less} is called by {@link std.less}. Also, this method can be used on standard
-         *		algorithms such as {@link sort sort()}</code>, {@link merge merge()} or
-         *		{@link TreeMap.lower_bound lower_bound()}.
-         *	</li>
-         * </ul>
-         *
-         * @param obj the reference object with which to compare.
-         *
-         * @return Whether the first parameter is less than the second.
-         */
-        less(obj: T): boolean;
-        /**
-         * <p> Issue a hash code. </p>
-         *
-         * <p> Returns a hash code value for the object. This method is supported for the benefit of hash tables such
-         * as those provided by hash containers; {@link HashSet}, {@link HashMap}, {@link MultiHashSet} and
-         * {@link MultiHashMap}. </p>
-         *
-         * <p> As much as is reasonably practical, the {@link hash_code} method defined by interface
-         * {@link IComparable} does return distinct integers for distinct objects. (This is typically implemented by
-         * converting the internal address of the object into an integer, but this implementation technique is not
-         * required by the JavaScript programming language.) </p>
-         *
-         * <ul>
-         *	<li>
-         *		{@link IComparable.hash_code} is called by {@link std.hash_code}. If you want to keep basically
-         *		provided hash function, then returns {@link std.Hash.code}; <code>return std.Hash.code(this);</code>
-         *	</li>
-         * </ul>
-         *
-         * @return An hash code who represents the object.
-         */
-        hash(): number;
-    }
-    /**
-     * Default hash function.
-     *
-     * @param obj
-     */
-    function hash(obj: any): number;
-    /**
-     * <p> Exchange contents of {@link IContainers containers}. </p>
-     *
-     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must have
-     * same type of elements (same template parameters), although sizes may differ. </p>
-     *
-     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i> before
-     * the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references and
-     * pointers remain valid for the swapped objects. </p>
-     *
-     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
-     * ownership over their assets to the other container (i.e., the containers exchange references to their data, without
-     * actually performing any element copy or movement): It behaves as if <i>left</i>.
-     * {@link IContainer.swap swap}(<i>right</i>) was called. </p>
-     *
-     * @param left A {@link IContainer container} to swap its contents.
-     * @param right A {@link IContainer container} to swap its contents.
-     */
-    function swap<T>(left: base.IContainer<T>, right: base.IContainer<T>): void;
-    /**
-     * <p> Exchange contents of queues. </p>
-     *
-     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
-     *
-     * @param left A {@link Queue} container of the same type. Size may differ.
-     * @param right A {@link Queue} container of the same type. Size may differ.
-     */
-    function swap<T>(left: Queue<T>, right: Queue<T>): void;
-    /**
-     * <p> Exchange contents of {@link PriorityQueue PriorityQueues}. </p>
-     *
-     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
-     *
-     * @param left A {@link PriorityQueue} container of the same type. Size may differ.
-     * @param right A {@link PriorityQueue} container of the same type. Size may differ.
-     */
-    function swap<T>(left: PriorityQueue<T>, right: PriorityQueue<T>): void;
-    /**
-     * <p> Exchange contents of {@link Stack Stacks}. </p>
-     *
-     * <p> Exchanges the contents of <i>left</i> and <i>right</i>. </p>
-     *
-     * @param left A {@link Stack} container of the same type. Size may differ.
-     * @param right A {@link Stack} container of the same type. Size may differ.
-     */
-    function swap<T>(left: Stack<T>, right: Stack<T>): void;
-    /**
-     * <p> Exchanges the contents of two {@link UniqueMap unique maps}. </p>
-     *
-     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
-     * be of the same type (same template parameters), although sizes may differ. </p>
-     *
-     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
-     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
-     * and pointers remain valid for the swapped objects. </p>
-     *
-     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
-     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
-     * without actually performing any element copy or movement): It behaves as if
-     * <i>left</i>.{@link UniqueMap.swap swap}(<i>right</i>) was called. </p>
-     *
-     * @param left An {@link UniqueMap unique map} to swap its conents.
-     * @param right An {@link UniqueMap unique map} to swap its conents.
-     */
-    function swap<Key, T>(left: base.UniqueMap<Key, T>, right: base.UniqueMap<Key, T>): void;
-    /**
-     * <p> Exchanges the contents of two {@link MultiMap multi maps}. </p>
-     *
-     * <p> The contents of container <i>left</i> are exchanged with those of <i>right</i>. Both container objects must
-     * be of the same type (same template parameters), although sizes may differ. </p>
-     *
-     * <p> After the call to this member function, the elements in <i>left</i> are those which were in <i>right</i>
-     * before the call, and the elements of <i>right</i> are those which were in <i>left</i>. All iterators, references
-     * and pointers remain valid for the swapped objects. </p>
-     *
-     * <p> This is an overload of the generic algorithm swap that improves its performance by mutually transferring
-     * ownership over their assets to the other container (i.e., the containers exchange references to their data,
-     * without actually performing any element copy or movement): It behaves as if
-     * <i>left</i>.{@link MultiMap.swap swap}(<i>right</i>) was called. </p>
-     *
-     * @param left A {@link MultiMap multi map} to swap its conents.
-     * @param right A {@link MultiMap multi map} to swap its conents.
-     */
-    function swap<Key, T>(left: base.MultiMap<Key, T>, right: base.MultiMap<Key, T>): void;
-    /**
-     * <p> Bind function arguments. </p>
-     *
-     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
-     *
-     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
      * <ul>
-     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
-     *	<li>
-     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
-     *		call (the one whose order number is specified by the placeholder).
-     *	</li>
+     *	<li> empty </li>
+     *	<li> size </li>
+     *	<li> front </li>
+     *	<li> back </li>
+     *	<li> push_back </li>
+     *	<li> pop_back </li>
      * </ul>
      *
-     * <p> Calling the returned object returns the same type as fn. </p>
+     * <p> The standard container classes {@link Vector}, {@link Deque} and {@link List} fulfill these requirements.
+     * By default, if no container class is specified for a particular {@link Stack} class instantiation, the standard
+     * container {@link List} is used. </p>
      *
-     * @param fn A function object, pointer to function or pointer to member.
-     * @param args List of arguments to bind: either values, or {@link placeholders}.
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
      *
-     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
-     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
-     *		   is a member.
-     */
-    function bind<Ret>(fn: (...args: any[]) => Ret, ...args: any[]): (...args: any[]) => Ret;
-    /**
-     * <p> Bind function arguments. </p>
+     * @param <T> Type of elements.
      *
-     * <p> Returns a function object based on <i>fn</i>, but with its arguments bound to <i>args</i>. </p>
-     *
-     * <p> Each argument may either be bound to a value or be a {@link placeholders placeholder}: </p>
-     * <ul>
-     *	<li> If bound to a value, calling the returned function object will always use that value as argument. </li>
-     *	<li>
-     *		If a {@link placeholders placeholder}, calling the returned function object forwards an argument passed to the
-     *		call (the one whose order number is specified by the placeholder).
-     *	</li>
-     * </ul>
-     *
-     * <p> Calling the returned object returns the same type as fn. </p>
-     *
-     * @param fn A function object, pointer to function or pointer to member.
-     * @param thisArg This argument, owner object of the member method <i>fn</i>.
-     * @param args List of arguments to bind: either values, or {@link placeholders}.
-     *
-     * @return A function object that, when called, calls <i>fn</i> with its arguments bound to <i>args</i>. If <i>fn</i> is
-     *		   a pointer to member, the first argument expected by the returned function is an object of the class <i>fn</i>
-     *		   is a member.
-     */
-    function bind<Ret, T>(fn: (...args: any[]) => Ret, thisArg: T, ...args: any[]): (...args: any[]) => Ret;
-    /**
-     * <p> Bind argument placeholders. </p>
-     *
-     * <p> This namespace declares an unspecified number of objects: <i>_1</i>, <i>_2</i>, <i>_3</i>, ...</i>, which are
-     * used to specify placeholders in calls to function {@link std.bind}. </p>
-     *
-     * <p> When the function object returned by bind is called, an argument with placeholder {@link _1} is replaced by the
-     * first argument in the call, {@link _2} is replaced by the second argument in the call, and so on... For example: </p>
-     *
-     * <code>
-    let vec: Vector<number> = new Vector<number>();
-
-    let bind = std.bind(Vector.insert, _1, vec.end(), _2, _3);
-    bind.apply(vec, 5, 1); // vec.insert(vec.end(), 5, 1);
-        // [1, 1, 1, 1, 1]
-     * </code>
-     *
-     * <p> When a call to {@link bind} is used as a subexpression in another call to <i>bind</i>, the {@link placeholders}
-     * are relative to the outermost {@link bind} expression. </p>
-     *
-     * @reference http://www.cplusplus.com/reference/functional/placeholders/
+     * @reference http://www.cplusplus.com/reference/stack/stack
      * @author Jeongho Nam <http://samchon.org>
      */
-    namespace placeholders {
+    class Stack<T> {
         /**
-         * @hidden
+         * The <i>underlying object</i> for implementing the <i>LIFO</i>
          */
-        class PlaceHolder {
-            private index_;
-            constructor(index: number);
-            index: number;
-        }
-        /**
-         * Replaced by the first argument in the function call.
-         */
-        const _1: PlaceHolder;
-        /**
-         * Replaced by the second argument in the function call.
-         */
-        const _2: PlaceHolder;
-        /**
-         * Replaced by the third argument in the function call.
-         */
-        const _3: PlaceHolder;
-        const _4: PlaceHolder;
-        const _5: PlaceHolder;
-        const _6: PlaceHolder;
-        const _7: PlaceHolder;
-        const _8: PlaceHolder;
-        const _9: PlaceHolder;
-        const _10: PlaceHolder;
-        const _11: PlaceHolder;
-        const _12: PlaceHolder;
-        const _13: PlaceHolder;
-        const _14: PlaceHolder;
-        const _15: PlaceHolder;
-        const _16: PlaceHolder;
-        const _17: PlaceHolder;
-        const _18: PlaceHolder;
-        const _19: PlaceHolder;
-        const _20: PlaceHolder;
-    }
-}
-declare namespace std {
-    /**
-     * <p> Standard exception class. </p>
-     *
-     * <p> Base class for standard exceptions. </p>
-     *
-     * <p> All objects thrown by components of the standard library are derived from this class.
-     * Therefore, all standard exceptions can be caught by catching this type by reference. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/exception/exception
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class Exception {
-        /**
-         * A message representing specification about the Exception.
-         */
-        protected message: string;
+        private container_;
         /**
          * Default Constructor.
          */
         constructor();
         /**
-         * <p> Construct from a message. </p>
-         *
-         * @param message A message representing specification about the Exception.
+         * Copy Constructor.
          */
-        constructor(what: string);
+        constructor(stack: Stack<T>);
         /**
-         * <p> Get string identifying exception. </p>
-         * <p> Returns a string that may be used to identify the exception. </p>
+         * <p> Return size. </p>
          *
-         * <p> The particular representation pointed by the returned value is implementation-defined.
-         * As a virtual function, derived classes may redefine this function so that specify value are
-         * returned. </p>
+         * <p> Returns the number of elements in the {@link Stack}. </p>
+         *
+         * <p> This member function effectively calls member {@link ILinearContainer.size size()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return The number of elements in the {@link container_ underlying container}.
          */
-        what(): string;
-    }
-    /**
-     * <p> Logic error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report errors in the internal
-     * logical of the program, such as violation of logical preconditions or class invariants. </p>
-     *
-     * <p> These errors are presumably detectable before the program executes. </p>
-     *
-     * <p> It is used as a base class for several logical error exceptions. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/logic_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class LogicError extends Exception {
+        size(): number;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Test whether container is empty. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> returns whether the {@link Stack} is empty: i.e. whether its <i>size</i> is zero. </p>
+         *
+         * <p> This member function effectively calls member {@link ILinearContainer.empty empty()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return <code>true</code> if the <i>underlying container</i>'s size is 0,
+         *		   <code>false</code> otherwise. </p>
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Domain error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report domain errors. </p>
-     *
-     * <p> Generally, the domain of a mathematical function is the subset of values that it is defined for.
-     * For example, the square root function is only defined for non-negative numbers. Thus, a negative number
-     * for such a function would qualify as a domain error. </p>
-     *
-     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
-     * exception to be thrown by programs. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/domain_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class DomainError extends LogicError {
+        empty(): boolean;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Access next element. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> Returns a value of the top element in the {@link Stack} </p>.
+         *
+         * <p> Since {@link Stack}s are last-in first-out containers, the top element is the last element inserted into
+         * the {@link Stack}. </p>
+         *
+         * <p> This member function effectively calls member {@link ILinearContainer.back back()} of the
+         * {@link container_ underlying container} object. </p>
+         *
+         * @return A value of the top element in the {@link Stack}.
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Invalid argument exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report an invalid argument. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
-     * also throw exceptions of this type to signal invalid arguments. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/invalid_argument
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class InvalidArgument extends LogicError {
+        top(): T;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Insert element. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> Inserts a new element at the top of the {@link Stack}, above its current top element. </p>
+         *
+         * <p> This member function effectively calls the member function
+         * {@link ILinearContainer.push_back push_back()} of the {@link container_ underlying container} object. </p>
+         *
+         * @param val Value to which the inserted element is initialized.
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Length error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report a length error. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
-     * such as vector and string also throw exceptions of this type to signal errors resizing. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/length_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class LengthError extends LogicError {
+        push(val: T): void;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Remove top element. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * <p> Removes the element on top of the {@link Stack}, effectively reducing its size by one. </p>
+         *
+         * <p> The element removed is the latest element inserted into the {@link Stack}, whose value can be retrieved
+         * by calling member {@link top Stack.top()} </p>.
+         *
+         * <p> This member function effectively calls the member function {@link ILinearContainer.pop_back pop_back()}
+         * of the {@link container_ underlying container} object. </p>
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Out-of-range exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report an out-of-range error. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
-     * such as vector, deque, string and bitset also throw exceptions of this type to signal arguments
-     * out of range. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/out_of_range
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class OutOfRange extends LogicError {
+        pop(): void;
         /**
-         * <p> Construct from a message. </p>
+         * <p> Swap contents. </p>
          *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
-    }
-    /**
-     * <p> Runtime error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report errors that can only be
-     * detected during runtime. </p>
-     *
-     * <p> It is used as a base class for several runtime error exceptions. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/runtime_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class RuntimeError extends Exception {
-        /**
-         * <p> Construct from a message. </p>
+         * <p> Exchanges the contents of the container adaptor (<i>this</i>) by those of <i>obj</i>. </p>
          *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
-    }
-    /**
-     * <p> Overflow error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to arithmetic overflow errors. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
-     * also throw exceptions of this type to signal range errors. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/outflow_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class OverflowError extends RuntimeError {
-        /**
-         * <p> Construct from a message. </p>
+         * <p> This member function calls the non-member function {@link IContainer.swap swap} (unqualified) to swap
+         * the {@link container_ underlying containers}. </p>
          *
-         * @param message A message representing specification about the Exception.
+         * @param obj Another {@link Stack} container adaptor of the same type (i.e., instantiated with the same
+         *			  template parameter, <b>T</b>). Sizes may differ. </p>
          */
-        constructor(what: string);
-    }
-    /**
-     * <p> Underflow error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to arithmetic underflow errors. </p>
-     *
-     * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
-     * exception to be thrown by programs. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/underflow_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class UnderflowError extends RuntimeError {
-        /**
-         * <p> Construct from a message. </p>
-         *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
-    }
-    /**
-     * <p> Range error exception. </p>
-     *
-     * <p> This class defines the type of objects thrown as exceptions to report range errors in internal
-     * computations. </p>
-     *
-     * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
-     * also throw exceptions of this type to signal range errors. </p>
-     *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/stdexcept/range_error
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class RangeError extends RuntimeError {
-        /**
-         * <p> Construct from a message. </p>
-         *
-         * @param message A message representing specification about the Exception.
-         */
-        constructor(what: string);
+        swap(obj: Stack<T>): void;
     }
 }
 declare namespace std.base {
@@ -8246,6 +8121,8 @@ declare namespace std {
          */
         code(): ErrorCode;
     }
+}
+declare namespace std {
     /**
      * <p> Error category. </p>
      *
@@ -8367,6 +8244,8 @@ declare namespace std {
          */
         equivalent(code: ErrorCode, val_cond: number): boolean;
     }
+}
+declare namespace std {
     /**
      * <p> Error condition. </p>
      *
@@ -8402,6 +8281,8 @@ declare namespace std {
          */
         constructor(val: number, category: ErrorCategory);
     }
+}
+declare namespace std {
     /**
      * <p> Error code. </p>
      *
@@ -8433,7 +8314,896 @@ declare namespace std {
         constructor(val: number, category: ErrorCategory);
     }
 }
+declare namespace std.base {
+    /**
+     * <p> Common interface for tree-structured map. </p>
+     *
+     * <p> {@link ITreeMap ITreeMaps} are associative containers that store elements formed by a combination of
+     * a <i>key value</i> and a <i>mapped value</i>, following a specific order. </p>
+     *
+     * <p> In a {@link ITreeMap}, the <i>key values</i> are generally used to sort and uniquely identify
+     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
+     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
+     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
+     *
+     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
+     *
+     * <p> Internally, the elements in a {@link ITreeMap}are always sorted by its key following a
+     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
+     *
+     * <p> {@link ITreeMap}containers are generally slower than {@link IHashMap} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
+     * on their order. </p>
+     *
+     * <p> {@link ITreeMap TreeMultiMaps} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
+     *		 given a position in this order. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
+     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/map
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface ITreeMap<Key, T> {
+        /**
+         * <p> Return iterator to lower bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
+         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
+         *
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeMap} contains an element with a key equivalent to <i>k</i>: In this
+         * case, {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound}
+         * returns an iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is not considered to go before
+         *		   <i>k</i>, or {@link ITreeMap.end} if all keys are considered to go before <i>k</i>.
+         */
+        lower_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to upper bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
+         * go after <i>k</i> </p>.
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
+         *
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the map contains an element with a key equivalent to <i>k</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns an
+         * iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is considered to go after
+         *		   <i>k</i>, or {@link TreeMap.end end} if no keys are considered to go after <i>k</i>.
+         */
+        upper_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * <p> Get range of equal elements. </p>
+         *
+         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
+         * equivalent to <i>k</i> </p>.
+         *
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that has a key considered to go after <i>k</i> according to the container's internal
+         * comparison object (key_comp). </p>
+         *
+         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
+         * (i.e., no matter the order in which the keys are passed as arguments). </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
+         */
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
+    }
+}
 declare namespace std {
+    /**
+     * <p> Tree-structured map, <code>std::map</code> of STL. </p>
+     *
+     * <p> {@link TreeMap TreeMaps} are associative containers that store elements formed by a combination of a
+     * <i>key value</i> (<i>Key</i>) and a <i>mapped value</i> (<i>T</i>), following order. </p>
+     *
+     * <p> In a {@link TreeMap}, the <i>key values</i> are generally used to sort and uniquely identify the elements,
+     * while the <i>mapped values</i> store the content associated to this key. The types of <i>key</i> and
+     * <i>mapped value</i> may differ, and are grouped together in member type <i>value_type</i>, which is a {@link Pair}
+     * type combining both: </p>
+     *
+     * <p> <code>typedef Pair<Key, T> value_type;</code> </p>
+     *
+     * <p> Internally, the elements in a {@link TreeMap} are always sorted by its <i>key</i> following a
+     * <i>strict weak ordering</i> criterion indicated by its internal comparison method {@link less}.
+     *
+     * <p> {@link TreeMap} containers are generally slower than {@link HashMap HashMap} containers to access individual
+     * elements by their <i>key</i>, but they allow the direct iteration on subsets based on their order. </p>
+     *
+     * <p> {@link TreeMap}s are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
+     *		 given a position in this order. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
+     *
+     *	<dt> Unique keys </dt>
+     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
+     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/map/map
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMap<Key, T> extends base.UniqueMap<Key, T> implements base.ITreeMap<Key, T> {
+        /**
+         * <i>RB-Tree+</i> object for implemeting the {@link TreeMap}.
+         */
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<Pair<Key, T>>);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         */
+        constructor(array: Array<[Key, T]>);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         */
+        constructor(container: base.MapContainer<Key, T>);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_pair(pair: Pair<Key, T>): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.UniqueMap<Key, T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_map(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Tree-structured multiple-key map. </p>
+     *
+     * <p> {@link TreeMultiMap TreeMultiMaps} are associative containers that store elements formed by a combination of
+     * a <i>key value</i> and a <i>mapped value</i>, following a specific order, and where multiple elements can
+     * have equivalent keys. </p>
+     *
+     * <p> In a {@link TreeMultiMap}, the <i>key values</i> are generally used to sort and uniquely identify
+     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
+     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
+     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
+     *
+     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
+     *
+     * <p> Internally, the elements in a {@link TreeMultiMap}are always sorted by its key following a
+     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
+     *
+     * <p> {@link TreeMultiMap}containers are generally slower than {@link HashMap} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
+     * on their order. </p>
+     *
+     * <p> {@link TreeMultiMap TreeMultiMaps} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd>
+     *		Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		<i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>.
+     *	</dd>
+     *
+     *	<dt> Multiple equivalent keys </dt>
+     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
+     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/map/multimap
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMultiMap<Key, T> extends base.MultiMap<Key, T> implements base.ITreeMap<Key, T> {
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<Pair<Key, T>>);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         */
+        constructor(array: Array<[Key, T]>);
+        /**
+         * Contruct from tuples.
+         *
+         * @param array Tuples to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         */
+        constructor(container: base.MapContainer<Key, T>);
+        /**
+         * Copy Constructor.
+         *
+         * @param container Another map to copy.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>);
+        /**
+         * Range Constructor.
+         *
+         * @param begin nput interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        count(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_pair(pair: Pair<Key, T>): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: MapIterator<Key, T>, pair: Pair<Key, T>): MapIterator<Key, T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<L extends Key, U extends T, InputIterator extends Iterator<Pair<L, U>>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: MapIterator<Key, T>, last: MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.MultiMap<Key, T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_multimap(obj);
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> A common interface for tree-structured set. </p>
+     *
+     * <p> {@link ITreeSet TreeMultiSets} are containers that store elements following a specific order. </p>
+     *
+     * <p> In a {@link ITreeSet}, the value of an element also identifies it (the value is itself
+     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link ITreeSet} cannot
+     * be modified once in the container (the elements are always const), but they can be inserted or removed
+     * from the  </p>
+     *
+     * <p> Internally, the elements in a {@link ITreeSet TreeMultiSets} are always sorted following a strict
+     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
+     *
+     * <p> {@link ITreeSet} containers are generally slower than {@link IHashSet} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
+     * their order. </p>
+     *
+     * <p> {@link ITreeSet TreeMultiSets} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link ITreeSet} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @reference http://www.cplusplus.com/reference/set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface ITreeSet<T> {
+        /**
+         * <p> Return iterator to lower bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is not considered to
+         * go before <i>val</i> (i.e., either it is equivalent or goes after). </p>
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(element,val) would return false. </p>
+         *
+         * <p> If the {@link ITreeSet} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element that is not less than <i>val</i>. </p>
+
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is not considered to go before
+         *		   <i>val</i>, or {@link ITreeSet.end} if all elements are considered to go before <i>val</i>.
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Return iterator to upper bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is considered to go after
+         * <i>val</i>. </p>
+
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(val,element) would return true. </p>
+
+         * <p> If the {@code ITreeSet} class is instantiated with the default comparison type (less), the
+         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the {@ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is considered to go after
+         *		   <i>val</i>, or {@link TreeSet.end end} if no elements are considered to go after <i>val</i>.
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Get range of equal elements. </p>
+         *
+         * <p> Returns the bounds of a range that includes all the elements in the container that are equivalent
+         * to <i>val</i>. </p>
+         *
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that is considered to go after val according to the container's
+         * internal comparison object (key_comp). </p>
+         *
+         * <p> Two elements of a multiset are considered equivalent if the container's comparison object returns
+         * false reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * @param key Value to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+    }
+}
+declare namespace std {
+    /**
+     * <p> Tree-structured set, <code>std::set</code> of STL. </p>
+     *
+     * <p> {@link TreeSet}s are containers that store unique elements following a specific order. </p>
+     *
+     * <p> In a {@link TreeSet}, the value of an element also identifies it (the value is itself the
+     * <i>key</i>, of type <i>T</i>), and each value must be unique. The value of the elements in a
+     * {@link TreeSet} cannot be modified once in the container (the elements are always const), but they
+     * can be inserted or removed from the  </p>
+     *
+     * <p> Internally, the elements in a {@link TreeSet} are always sorted following a specific strict weak
+     * ordering criterion indicated by its internal comparison method (of {@link less}). </p>
+     *
+     * <p> {@link TreeSet} containers are generally slower than {@link HashSet} containers to access
+     * individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on their
+     * order. </p>
+     *
+     * <p> {@link TreeSet}s are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Unique keys </dt>
+     *	<dd> No two elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *			  Each element in an {@link TreeSet} is also uniquely identified by this value.
+     *
+     * @reference http://www.cplusplus.com/reference/set/set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeSet<T> extends base.UniqueSet<T> implements base.ITreeSet<T> {
+        /**
+         * <i>RB-Tree+</i> object for implemeting the {@link TreeSet}.
+         */
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: T, right: T) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<T>);
+        /**
+         * Contruct from elements with compare.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: base.IContainer<T>);
+        /**
+         * Copy Constructor with compare.
+         *
+         * @param container A container to be copied.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.IContainer<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * Range Constructor with compare.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_val(val: T): any;
+        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.UniqueSet<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_set(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Tree-structured multiple-key set. </p>
+     *
+     * <p> {@link TreeMultiSet TreeMultiSets} are containers that store elements following a specific order, and
+     * where multiple elements can have equivalent values. </p>
+     *
+     * <p> In a {@link TreeMultiSet}, the value of an element also identifies it (the value is itself
+     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link TreeMultiSet} cannot
+     * be modified once in the container (the elements are always const), but they can be inserted or removed
+     * from the  </p>
+     *
+     * <p> Internally, the elements in a {@link TreeMultiSet TreeMultiSets} are always sorted following a strict
+     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
+     *
+     * <p> {@link TreeMultiSet} containers are generally slower than {@link HashMultiSet} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
+     * their order. </p>
+     *
+     * <p> {@link TreeMultiSet TreeMultiSets} are typically implemented as binary search trees. </p>
+     *
+     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     *
+     *	<dt> Multiple equivalent keys </dt>
+     *	<dd> Multiple elements in the container can have equivalent <i>keys</i>. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link TreeMultiSet} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @reference http://www.cplusplus.com/reference/set/multiset
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMultiSet<T> extends base.MultiSet<T> implements base.ITreeSet<T> {
+        /**
+         * <i>RB-Tree+</i> object for implemeting the {@link TreeMultiSet}.
+         */
+        private tree_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * Construct from compare.
+         *
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(compare: (left: T, right: T) => boolean);
+        /**
+         * Contruct from elements.
+         *
+         * @param array Elements to be contained.
+         */
+        constructor(array: Array<T>);
+        /**
+         * Contruct from elements with compare.
+         *
+         * @param array Elements to be contained.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Copy Constructor.
+         */
+        constructor(container: base.Container<T>);
+        /**
+         * Copy Constructor with compare.
+         *
+         * @param container A container to be copied.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(container: base.Container<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * Range Constructor.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * Construct from range and compare.
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         * @param compare A binary predicate determines order of elements.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        find(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        count(val: T): number;
+        /**
+         * @inheritdoc
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        /**
+         * @hidden
+         */
+        protected insert_by_val(val: T): any;
+        /**
+         * @hidden
+         */
+        protected insert_by_hint(hint: SetIterator<T>, val: T): SetIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends Iterator<U>>(first: InputIterator, last: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: SetIterator<T>, last: SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.MultiSet<T>): void;
+        /**
+         * @hidden
+         */
+        private swap_tree_set(obj);
+    }
+}
+declare namespace std {
+    /**
+     * <p> Running on Node. </p>
+     *
+     * <p> Test whether the JavaScript is running on Node. </p>
+     *
+     * @references http://stackoverflow.com/questions/17575790/environment-detection-node-js-or-browser
+     */
+    function is_node(): boolean;
     /**
      * <p> Pair of values. </p>
      *
@@ -8496,8 +9266,518 @@ declare namespace std {
      */
     function make_pair<T1, T2>(x: T1, y: T2): Pair<T1, T2>;
 }
-declare namespace std.example {
-    function test_all(): void;
+declare namespace std {
+    /**
+     * <p> Vector, the dynamic array. </p>
+     *
+     * <p> {@link Vector}s are sequence containers representing arrays that can change in size. </p>
+     *
+     * <p> Just like arrays, {@link Vector}s use contiguous storage locations for their elements, which means that
+     * their elements can also be accessed using offsets on regular pointers to its elements, and just as efficiently
+     * as in arrays. But unlike arrays, their size can change dynamically, with their storage being handled
+     * automatically by the  </p>
+     *
+     * <p> Internally, {@link Vector}s use a dynamically allocated array to store their elements. This array may need
+     * to be reallocated in order to grow in size when new elements are inserted, which implies allocating a new
+     * array and moving all elements to it. This is a relatively expensive task in terms of processing time, and
+     * thus, {@link Vector}s do not reallocate each time an element is added to the  </p>
+     *
+     * <p> Instead, {@link Vector} containers may allocate some extra storage to accommodate for possible growth, and
+     * thus the container may have an actual {@link capacity} greater than the storage strictly needed to contain its
+     * elements (i.e., its {@link size}). Libraries can implement different strategies for growth to balance between
+     * memory usage and reallocations, but in any case, reallocations should only happen at logarithmically growing
+     * intervals of {@link size} so that the insertion of individual elements at the end of the {@link Vector} can be
+     * provided with amortized constant time complexity (see {@link push_back push_back()}). </p>
+     *
+     * <p> Therefore, compared to arrays, {@link Vector}s consume more memory in exchange for the ability to manage
+     * storage and grow dynamically in an efficient way. </p>
+     *
+     * <p> Compared to the other dynamic sequence containers ({@link Deque}s, {@link List}s), {@link Vector Vectors}
+     * are very efficient accessing its elements (just like arrays) and relatively efficient adding or removing
+     * elements from its end. For operations that involve inserting or removing elements at positions other than the
+     * end, they perform worse than the others, and have less consistent iterators and references than {@link List}s.
+     * </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Sequence </dt>
+     *	<dd>
+     *		Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
+     *		accessed by their position in this sequence.
+     *	</dd>
+     *
+     *	<dt> Dynamic array </dt>
+     *	<dd>
+     *		Allows direct access to any element in the sequence, even through pointer arithmetics, and provides
+     *		relatively fast addition/removal of elements at the end of the sequence.
+     *	</dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @reference http://www.cplusplus.com/reference/vector/vector
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class Vector<T> extends Array<T> implements base.IArrayContainer<T> {
+        /**
+         * Type definition of {@link Vector}'s {@link VectorIterator iterator}.
+         */
+        static iterator: typeof VectorIterator;
+        /**
+         * <p> Default Constructor. </p>
+         *
+         * <p> Constructs an empty container, with no elements. </p>
+         */
+        constructor();
+        /**
+         * @inheritdoc
+         */
+        constructor(array: Array<T>);
+        /**
+         * <p> Initializer list Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>array</i>, in the same order. </p>
+         *
+         * @param array An array containing elements to be copied and contained.
+         */
+        constructor(n: number);
+        /**
+         * <p> Fill Constructor. </p>
+         *
+         * <p> Constructs a container with <i>n</i> elements. Each element is a copy of <i>val</i> (if provided). </p>
+         *
+         * @param n Initial container size (i.e., the number of elements in the container at construction).
+         * @param val Value to fill the container with. Each of the <i>n</i> elements in the container is
+         *			  initialized to a copy of this value.
+         */
+        constructor(n: number, val: T);
+        /**
+         * <p> Copy Constructor. </p>
+         *
+         * <p> Constructs a container with a copy of each of the elements in <i>container</i>, in the same order. </p>
+         *
+         * @param container Another container object of the same type (with the same class template
+         *					arguments <i>T</i>), whose contents are either copied or acquired.
+         */
+        constructor(container: base.IContainer<T>);
+        /**
+         * <p> Range Constructor. </p>
+         *
+         * <p> Constructs a container with as many elements as the range (<i>begin</i>, <i>end<i>), with each
+         * element emplace-constructed from its corresponding element in that range, in the same order. </p>
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        constructor(begin: Iterator<T>, end: Iterator<T>);
+        /**
+         * @inheritdoc
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * @inheritdoc
+         */
+        assign(n: number, val: T): void;
+        /**
+         * @inheritdoc
+         */
+        reserve(size: number): void;
+        /**
+         * @inheritdoc
+         */
+        clear(): void;
+        /**
+         * @inheritdoc
+         */
+        begin(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        end(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rbegin(): VectorReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        rend(): VectorReverseIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        size(): number;
+        /**
+         * @inheritdoc
+         */
+        capacity(): number;
+        /**
+         * @inheritdoc
+         */
+        empty(): boolean;
+        /**
+         * @inheritdoc
+         */
+        at(index: number): T;
+        /**
+         * @inheritdoc
+         */
+        set(index: number, val: T): T;
+        /**
+         * @inheritdoc
+         */
+        front(): T;
+        /**
+         * @inheritdoc
+         */
+        back(): T;
+        /**
+         * @inheritdoc
+         */
+        push_back(val: T): void;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
+         * <i>position</i>, effectively increasing the container size by one. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Position in the {@link Vector} where the new element is inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param val Value to be copied to the inserted element.
+         *
+         * @return An iterator that points to the newly inserted element.
+         */
+        insert(position: VectorIterator<T>, val: T): VectorIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
+         * @param val Value to be copied (or moved) to the inserted elements.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
+         * iterators. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorIterator<T>, begin: InputIterator, end: InputIterator): VectorIterator<T>;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new element before the element at the specified
+         * <i>position</i>, effectively increasing the container size by one. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting element in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to its new position. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Position in the {@link Vector} where the new element is inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param val Value to be copied to the inserted element.
+         *
+         * @return An iterator that points to the newly inserted element.
+         */
+        insert(position: VectorReverseIterator<T>, val: T): VectorReverseIterator<T>;
+        /**
+         * <p> Insert elements by repeated filling. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
+         * @param val Value to be copied (or moved) to the inserted elements.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: VectorReverseIterator<T>, n: number, val: T): VectorReverseIterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The {@link Vector} is extended by inserting new elements before the element at the specified
+         * <i>position</i>, effectively increasing the container size by the number of elements inserted by range
+         * iterators. </p>
+         *
+         * <p> This causes an automatic reallocation of the allocated storage space if -and only if- the new
+         * {@link size} surpasses the current {@link capacity}. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, inserting elements in
+         * positions other than the {@link end end()} causes the container to relocate all the elements that were
+         * after <i>position</i> to their new positions. This is generally an inefficient operation compared to the
+         * one performed for the same operation by other kinds of sequence containers (such as {@link List}).
+         *
+         * @param position Position in the {@link Vector} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a
+         *				   {@link VectorIterator random access iterator} type that points to elements.
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: VectorReverseIterator<T>, begin: InputIterator, end: InputIterator): VectorReverseIterator<T>;
+        /**
+         * @hidden
+         */
+        private insert_by_val(position, val);
+        /**
+         * @hidden
+         */
+        protected insert_by_repeating_val(position: VectorIterator<T>, n: number, val: T): VectorIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<InputIterator extends Iterator<T>>(position: VectorIterator<T>, first: InputIterator, last: InputIterator): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        pop_back(): void;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(position: VectorIterator<T>): VectorIterator<T>;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the {@link Vector} either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing an element in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the {@link Vector}.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link rend rend()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(position: VectorReverseIterator<T>): VectorReverseIterator<T>;
+        /**
+         * <p> Erase element. </p>
+         *
+         * <p> Removes from the <ode>Vector</code> either a single element; <i>position</i>. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * <p> Because {@link Vector}s use an <code>Array</code> as their underlying storage, erasing elements in
+         * position other than the {@link end end()} causes the container to relocate all the elements after the
+         * segment erased to their new positions. This is generally an inefficient operation compared to the one
+         * performed for the same operation by other kinds of sequence containers (such as {@link List}). </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the new location of the element that followed the last element erased by
+         *		   the function call. This is the {@link end end()} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(first: VectorReverseIterator<T>, last: VectorReverseIterator<T>): VectorReverseIterator<T>;
+        /**
+         * @hiddde
+         */
+        protected erase_by_range(first: VectorIterator<T>, last: VectorIterator<T>): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: base.IContainer<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> An iterator of Vector. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class VectorIterator<T> extends Iterator<T> implements base.IArrayIterator<T> {
+        /**
+         * Sequence number of iterator in the source {@link Vector}.
+         */
+        private index_;
+        /**
+         * <p> Construct from the source {@link Vector container}. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Do not create the iterator directly, by yourself. </p>
+         * <p> Use {@link Vector.begin begin()}, {@link Vector.end end()} in {@link Vector container} instead. </p>
+         *
+         * @param source The source {@link Vector container} to reference.
+         * @param index Sequence number of the element in the source {@link Vector}.
+         */
+        constructor(source: Vector<T>, index: number);
+        /**
+         * @hidden
+         */
+        private vector;
+        /**
+         * @inheritdoc
+         */
+        /**
+         * Set value.
+         */
+        value: T;
+        /**
+         * Get index.
+         */
+        index: number;
+        /**
+         * @inheritdoc
+         */
+        prev(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        next(): VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        advance(n: number): VectorIterator<T>;
+        /**
+         * <p> Whether an iterator is equal with the iterator. </p>
+         *
+         * <p> Compare two iterators and returns whether they are equal or not. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Iterator's equal_to() only compare souce container and index number. </p>
+         *
+         * <p> Although elements in a pair, key and value are equal_to, if the source map or
+         * index number is different, then the {@link equal_to equal_to()} will return false. If you want to
+         * compare the elements of a pair, compare them directly by yourself. </p>
+         *
+         * @param obj An iterator to compare
+         * @return Indicates whether equal or not.
+         */
+        equal_to<U extends T>(obj: VectorIterator<U>): boolean;
+        /**
+         * @inheritdoc
+         */
+        swap(obj: VectorIterator<T>): void;
+    }
+}
+declare namespace std {
+    /**
+     * <p> A reverse-iterator of Vector. </p>
+     *
+     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class VectorReverseIterator<T> extends ReverseIterator<T, VectorIterator<T>, VectorReverseIterator<T>> implements base.IArrayIterator<T> {
+        constructor(base: VectorIterator<T>);
+        /**
+         * @inheritdoc
+         */
+        protected create_neighbor(): VectorReverseIterator<T>;
+        /**
+         * Set value.
+         */
+        value: T;
+        /**
+         * Get index.
+         */
+        index: number;
+    }
 }
 declare namespace std.base {
     /**
@@ -9189,18 +10469,17 @@ declare namespace std.base {
     }
 }
 declare namespace std.base {
-    const MIN_SIZE: number;
-    const RATIO: number;
-    const MAX_RATIO: number;
-    function code(par: any): number;
-}
-declare namespace std.base {
+    enum Hash {
+        MIN_SIZE = 10,
+        RATIO = 1,
+        MAX_RATIO = 2,
+    }
     /**
      * <p> Hask buckets. </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
-    abstract class HashBuckets<T> {
+    class HashBuckets<T> {
         private buckets_;
         private item_size_;
         /**
@@ -9208,14 +10487,21 @@ declare namespace std.base {
          */
         constructor();
         /**
-         * Reserve the bucket size.
+         * <p> Reconstruction of hash table. </p>
          *
-         * @param size Number of bucket size to reserve.
+         * <p> All the elements in the hash buckets are rearranged according to their hash value into the new set of
+         * buckets. This may alter the order of iteration of elements within the container. </p>
+         *
+         * <p> Notice that {@link rehash rehashes} are automatically performed whenever its number of elements is going
+         * to greater than its own {@link capacity}. </p>
+         *
+         * @param size Number of bucket size to rehash.
          */
-        reserve(size: number): void;
+        rehash(size: number): void;
         clear(): void;
         size(): number;
         item_size(): number;
+        capacity(): number;
         at(index: number): Vector<T>;
         hash_index(val: T): number;
         insert(val: T): void;
@@ -9830,6 +11116,9 @@ declare namespace std.base {
         uncle: XTreeNode<T>;
     }
 }
+declare namespace std.example {
+    function test_all(): void;
+}
 declare namespace std.example {
     function test_bind(): void;
 }

From a8ba1c1754ac3619686d39382ea78e56058c466f Mon Sep 17 00:00:00 2001
From: delphinus <delphinus@remora.cx>
Date: Sun, 19 Jun 2016 13:19:37 +0900
Subject: [PATCH 180/278] Rename jquery.imagemapster => imagemapster

---
 .../imagemapster-tests.ts                     | 16 ++++-----
 .../imagemapster.d.ts                         | 36 +++++++++----------
 2 files changed, 26 insertions(+), 26 deletions(-)
 rename jquery.imagemapster/jquery.imagemapster-tests.ts => imagemapster/imagemapster-tests.ts (82%)
 rename jquery.imagemapster/jquery.imagemapster.d.ts => imagemapster/imagemapster.d.ts (96%)

diff --git a/jquery.imagemapster/jquery.imagemapster-tests.ts b/imagemapster/imagemapster-tests.ts
similarity index 82%
rename from jquery.imagemapster/jquery.imagemapster-tests.ts
rename to imagemapster/imagemapster-tests.ts
index c02047849c..7f9ec9d761 100644
--- a/jquery.imagemapster/jquery.imagemapster-tests.ts
+++ b/imagemapster/imagemapster-tests.ts
@@ -1,41 +1,41 @@
-///<reference path="./jquery.imagemapster.d.ts" />
+///<reference path="./imagemapster.d.ts" />
 ///<reference path="../jquery/jquery.d.ts" />
 
-const areaOptions: JQueryImageMapster.AreaRenderingOptions = {
+const areaOptions: ImageMapster.AreaRenderingOptions = {
     key:         "foo",
     includeKeys: "foo",
     isMask:      true,
     toolTip:     "tooltip",
 };
 
-const onClickData: JQueryImageMapster.OnClickData = {
+const onClickData: ImageMapster.OnClickData = {
     listTarget: $(),
     key:        "foo",
     e:          $.Event("click"),
     selected:   true,
 }
 
-const onMouseData: JQueryImageMapster.OnMouseData = {
+const onMouseData: ImageMapster.OnMouseData = {
     key:      "foo",
     selected: true,
     e:        $.Event("click"),
     options:  areaOptions,
 };
 
-const onGetListData: JQueryImageMapster.OnGetListData = {
+const onGetListData: ImageMapster.OnGetListData = {
     key:     "foo",
     value:   "foo",
     area:    [{}],
     options: areaOptions,
 };
 
-const onStateChangeData: JQueryImageMapster.OnStateChangeData = {
+const onStateChangeData: ImageMapster.OnStateChangeData = {
     key:      "foo",
     state:    "highlight",
     selected: true,
 };
 
-const onShowToolTipData: JQueryImageMapster.OnShowToolTipData = {
+const onShowToolTipData: ImageMapster.OnShowToolTipData = {
     toolTip: $(),
     key: "foo",
     selected: true,
@@ -44,7 +44,7 @@ const onShowToolTipData: JQueryImageMapster.OnShowToolTipData = {
 
 const bool = true;
 
-const options: JQueryImageMapster.Options = {
+const options: ImageMapster.Options = {
     mapKey:                "foo",
     mapValue:              "foo",
     clickNavigate:         true,
diff --git a/jquery.imagemapster/jquery.imagemapster.d.ts b/imagemapster/imagemapster.d.ts
similarity index 96%
rename from jquery.imagemapster/jquery.imagemapster.d.ts
rename to imagemapster/imagemapster.d.ts
index 3602f4eed3..ad9eed3066 100644
--- a/jquery.imagemapster/jquery.imagemapster.d.ts
+++ b/imagemapster/imagemapster.d.ts
@@ -1,11 +1,11 @@
-// Type definitions for jquery.imagemapster 1.2.10
+// Type definitions for imagemapster 1.2.10
 // Project: http://www.outsharked.com/imagemapster/
 // Definitions by: delphinus <https://github.com/delphinus35/>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 ///<reference path="../jquery/jquery.d.ts" />
 
-declare namespace JQueryImageMapster {
+declare namespace ImageMapster {
 
     type Select = "select";
     type Deselect = "deselect";
@@ -758,7 +758,7 @@ interface JQuery {
      * configuration is complete if needed to perform other setup activities on
      * the page.
      */
-    mapster(options?: JQueryImageMapster.Options): JQuery;
+    mapster(options?: ImageMapster.Options): JQuery;
 
     /**
      * select: Cause an area to become selected. This is similar to a user
@@ -767,7 +767,7 @@ interface JQuery {
      * Programatically select elements from the image map. The programmatic
      * selection/deselection methods will not honor the staticState property.
      */
-    mapster(method: JQueryImageMapster.Select): void;
+    mapster(method: ImageMapster.Select): void;
 
     /**
      * deselect: Cause an area to become deselected
@@ -775,7 +775,7 @@ interface JQuery {
      * The opposite of select, this causes an area to become deselected. If it
      * was not previously selected, nothing changes.
      */
-    mapster(method: JQueryImageMapster.Deselect): void;
+    mapster(method: ImageMapster.Deselect): void;
 
     /**
      * set: select or deselect an area
@@ -793,8 +793,8 @@ interface JQuery {
      * parameter. When present, these will supercede the default and
      * area-specific rendering options.
      */
-    mapster(method: JQueryImageMapster.Set, selected: boolean, options: JQueryImageMapster.RenderingOptions): JQuery;
-    mapster(method: JQueryImageMapster.Set, options: JQueryImageMapster.RenderingOptions): JQuery;
+    mapster(method: ImageMapster.Set, selected: boolean, options: ImageMapster.RenderingOptions): JQuery;
+    mapster(method: ImageMapster.Set, options: ImageMapster.RenderingOptions): JQuery;
 
     /**
      * get: get keys for all selected areas
@@ -803,7 +803,7 @@ interface JQuery {
      * keys representing the areas currently selected. If specified, returns
      * true or false indicating whether the area specified is selected.
      */
-    mapster(method: JQueryImageMapster.Get, key?: string): string | boolean;
+    mapster(method: ImageMapster.Get, key?: string): string | boolean;
 
     /**
      * highlight: highlight, clear, or return highlight state
@@ -819,7 +819,7 @@ interface JQuery {
      * that would normally cause a highlight to be removed occurs (e.g. moving
      * the mouse into any area), or it is removed programatically.
      */
-    mapster(method: JQueryImageMapster.Highlight, flag?: string | boolean): void;
+    mapster(method: ImageMapster.Highlight, flag?: string | boolean): void;
 
     /**
      * unbind: unbind ImageMapster from an image
@@ -854,7 +854,7 @@ interface JQuery {
      * and styles applied during configuration, which will be left intact when
      * using "preserveState."
      */
-    mapster(method: JQueryImageMapster.Unbind, preserveState?: boolean): JQuery;
+    mapster(method: ImageMapster.Unbind, preserveState?: boolean): JQuery;
 
     /**
      * snapshot: take a "snapshot" of the current selection state, and reset
@@ -875,7 +875,7 @@ interface JQuery {
      * place at the time of the snapshot essentially become part of the image
      * and are not affected by future operations.
      */
-    mapster(method: JQueryImageMapster.Snapshot): JQuery;
+    mapster(method: ImageMapster.Snapshot): JQuery;
 
     /**
      * rebind: rebind ImageMapster with new options
@@ -892,7 +892,7 @@ interface JQuery {
      * them to any existing data. When using set_options the new options only
      * apply to future actions.
      */
-    mapster(method: JQueryImageMapster.Rebind, options: JQueryImageMapster.Options): JQuery;
+    mapster(method: ImageMapster.Rebind, options: ImageMapster.Options): JQuery;
 
     /**
      * resize: change the size of the image and map
@@ -915,7 +915,7 @@ interface JQuery {
      * however, so in IE<9 the selections will be erased, then redrawn when the
      * animation is complete.
      */
-    mapster(method: JQueryImageMapster.Resize, width: number, height: number, duration?: number): JQuery;
+    mapster(method: ImageMapster.Resize, width: number, height: number, duration?: number): JQuery;
 
     /**
      * keys: get the primary mapKey (or comma-separated list of keys) for an
@@ -947,8 +947,8 @@ interface JQuery {
      * access to a complete list of primary keys in any group, or all keys
      * which contain a given primary key.
      */
-    mapster(method: JQueryImageMapster.Keys, key: string, all?: boolean): string | string[];
-    mapster(method: JQueryImageMapster.Keys, all: boolean): string | string[];
+    mapster(method: ImageMapster.Keys, key: string, all?: boolean): string | string[];
+    mapster(method: ImageMapster.Keys, all: boolean): string | string[];
 
     /**
      * set_options: set active options
@@ -960,7 +960,7 @@ interface JQuery {
      * options, but only update the state. This may affect future actions, but
      * it will not change any existing state information.
      */
-    mapster(method: JQueryImageMapster.SetOptions, options?: JQueryImageMapster.Options): JQuery;
+    mapster(method: ImageMapster.SetOptions, options?: ImageMapster.Options): JQuery;
 
     /**
      * get_options: get active options
@@ -976,7 +976,7 @@ interface JQuery {
      * including those that are inherited, as well as any specifically assigned
      * to the area.
      */
-    mapster(method: JQueryImageMapster.GetOptions, key?: string, effective?: boolean): JQueryImageMapster.Options | JQueryImageMapster.AreaRenderingOptions;
+    mapster(method: ImageMapster.GetOptions, key?: string, effective?: boolean): ImageMapster.Options | ImageMapster.AreaRenderingOptions;
 
     /**
      * tooltip: show/hide tooltips from code
@@ -992,5 +992,5 @@ interface JQuery {
      * closing event, but add a "close" button to your contianer that will
      * cause the tooltip to close when clicked.
      */
-    mapster(method: JQueryImageMapster.Tooltip, key?: string): JQuery;
+    mapster(method: ImageMapster.Tooltip, key?: string): JQuery;
 }

From 050c5fcdc4e9ec6b63e6f119801adae8a114a9ca Mon Sep 17 00:00:00 2001
From: Dan Marshall <danmar@microsoft.com>
Date: Sat, 18 Jun 2016 22:23:05 -0700
Subject: [PATCH 181/278] Added definitions for opentype.js

---
 opentype/opentype-tests.ts |  66 ++++++++++
 opentype/opentype.d.ts     | 249 +++++++++++++++++++++++++++++++++++++
 2 files changed, 315 insertions(+)
 create mode 100644 opentype/opentype-tests.ts
 create mode 100644 opentype/opentype.d.ts

diff --git a/opentype/opentype-tests.ts b/opentype/opentype-tests.ts
new file mode 100644
index 0000000000..696ed2de51
--- /dev/null
+++ b/opentype/opentype-tests.ts
@@ -0,0 +1,66 @@
+/// <reference path="./opentype.d.ts" />
+
+var x = 0;
+var y = 0;
+var fontSize = 72;
+var options;
+var ctx: CanvasRenderingContext2D;
+
+opentype.load('fonts/Roboto-Black.ttf', function(err, font) {
+    if (err) {
+         alert('Font could not be loaded: ' + err);
+    } else {
+        var path = font.getPath('Hello, World!', 0, 150, 72);
+        // If you just want to draw the text you can also use font.draw(ctx, text, x, y, fontSize).
+        path.draw(ctx);
+    }
+});
+
+var myBuffer;
+var font = opentype.parse(myBuffer);
+font = opentype.loadSync('fonts/Roboto-Black.ttf');
+
+var notdefGlyph = new opentype.Glyph({
+    name: '.notdef',
+    unicode: 0,
+    advanceWidth: 650,
+    path: new opentype.Path()
+});
+
+var aPath = new opentype.Path();
+aPath.moveTo(100, 0);
+aPath.lineTo(100, 700);
+// more drawing instructions...
+var aGlyph = new opentype.Glyph({
+    name: 'A',
+    unicode: 65,
+    advanceWidth: 650,
+    path: aPath
+});
+
+var glyphs = [notdefGlyph, aGlyph];
+var font = new opentype.Font({
+    familyName: 'OpenTypeSans',
+    styleName: 'Medium',
+    unitsPerEm: 1000,
+    ascender: 800,
+    descender: -200,
+    glyphs: glyphs});
+font.download();
+
+font.getPath('text', x, y, fontSize, options);
+font.draw(ctx, 'text', x, y, fontSize, options);
+font.drawPoints(ctx, 'text', x, y, fontSize, options);
+font.drawMetrics(ctx, 'text', x, y, fontSize, options);
+font.stringToGlyphs('string');
+font.charToGlyph('c');
+font.getKerningValue(notdefGlyph, aGlyph);
+
+aGlyph.getPath(x, y, fontSize);
+aGlyph.draw(ctx, x, y, fontSize);
+aGlyph.drawPoints(ctx, x, y, fontSize);
+aGlyph.drawMetrics(ctx, x, y, fontSize);
+
+aPath.draw(ctx);
+aPath.toPathData(7);
+aPath.toSVG(7);
diff --git a/opentype/opentype.d.ts b/opentype/opentype.d.ts
new file mode 100644
index 0000000000..ff09104dfd
--- /dev/null
+++ b/opentype/opentype.d.ts
@@ -0,0 +1,249 @@
+// Type definitions for opentype.js
+// Project: https://github.com/nodebox/opentype.js
+// Definitions by: Dan Marshall <https://github.com/danmarshall>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+// Type definitions for opentype.js
+// Project: https://github.com/nodebox/opentype.js
+// Definitions by: Dan Marshall <https://github.com/danmarshall>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare namespace opentypejs {
+
+    interface Contour extends Array<Point> {
+    }
+
+    class Encoding {
+        charset: string;
+        charToGlyphIndex(c: string): number;
+        font: Font;
+    }
+
+    interface Field {
+        name: string;
+        type: string;
+        value: any;
+    }
+
+    class Font {
+        private nametoGlyphIndex;
+        private supported;
+        constructor(options: FontOptions);
+        ascender: number;
+        cffEncoding: Encoding;
+        charToGlyph(c: string): Glyph;
+        charToGlyphIndex(s: string): number;
+        descender: number;
+        download(): void;
+        draw(ctx: CanvasRenderingContext2D, text: string, x: number, y: number, fontSize: number, options?: RenderOptions): void;
+        drawMetrics(ctx: CanvasRenderingContext2D, text: string, x: number, y: number, fontSize: number, options?: RenderOptions): void;
+        drawPoints(ctx: CanvasRenderingContext2D, text: string, x: number, y: number, fontSize: number, options?: RenderOptions): void;
+        encoding: Encoding;
+        forEachGlyph(text: string, x: number, y: number, fontSize: number, options: RenderOptions, callback: { (glyph: Glyph, x: number, y: number, fontSize: number, options?: RenderOptions): void; }): void;
+        getEnglishName(name: string): string;
+        getGposKerningValue: { (leftGlyph: Glyph | number, rightGlyph: Glyph | number): number; };
+        getKerningValue(leftGlyph: Glyph | number, rightGlyph: Glyph | number): number;
+        getPath(text: string, x: number, y: number, fontSize: number, options?: RenderOptions): Path;
+        getPaths(text: string, x: number, y: number, fontSize: number, options?: RenderOptions): Path[];
+        glyphs: GlyphSet;
+        glyphIndexToName(gid: number): string;
+        glyphNames: GlyphNames;
+        hasChar(c: string): boolean;
+        kerningPairs: KerningPairs;
+        names: FontNames;
+        nameToGlyph(name: string): Glyph;
+        nameToGlyphIndex(name: string): number;
+        numberOfHMetrics: number;
+        numGlyphs: number;
+        outlinesFormat: string;
+        stringToGlyphs(s: string): Glyph[];
+        tables: { [tableName: string]: Table; };
+        toArrayBuffer(): ArrayBuffer;
+        toBuffer(): ArrayBuffer;
+        toTables(): Table;
+        unitsPerEm: number;
+        validate(): void;
+    }
+
+    interface FontNames {
+        copyright: LocalizedName;
+        description: LocalizedName;
+        designer: LocalizedName;
+        designerURL: LocalizedName;
+        fontFamily: LocalizedName;
+        fontSubfamily: LocalizedName;
+        fullName: LocalizedName;
+        license: LocalizedName;
+        licenseURL: LocalizedName;
+        manufacturer: LocalizedName;
+        manufacturerURL: LocalizedName;
+        postScriptName: LocalizedName;
+        trademark: LocalizedName;
+        version: LocalizedName;
+    }
+
+    interface FontOptions {
+        copyright?: string;
+        ascender?: number;
+        descender?: number;
+        description?: string;
+        designer?: string;
+        designerURL?: string;
+        empty?: boolean;
+        familyName?: string;
+        fullName?: string;
+        glyphs?: Glyph[] | GlyphSet;
+        license?: string;
+        licenseURL?: string;
+        manufacturer?: string;
+        manufacturerURL?: string;
+        postScriptName?: string;
+        styleName?: string;
+        unitsPerEm?: number;
+        trademark?: string;
+        version?: string;
+    }
+
+    class Glyph {
+        private index;
+        private xMin;
+        private xMax;
+        private yMin;
+        private yMax;
+        private points;
+        constructor(options: GlyphOptions);
+        addUnicode(unicode: number): void;
+        advanceWidth: number;
+        bindConstructorValues(options: GlyphOptions): void;
+        draw(ctx: CanvasRenderingContext2D, x: number, y: number, fontSize: number): void;
+        drawMetrics(ctx: CanvasRenderingContext2D, x: number, y: number, fontSize: number): void;
+        drawPoints(ctx: CanvasRenderingContext2D, x: number, y: number, fontSize: number): void;
+        getContours(): Contour[];
+        getMetrics(): Metrics;
+        getPath(x: number, y: number, fontSize: number): Path;
+        name: string;
+        path: Path | { (): Path; };
+        unicode: number;
+        unicodes: number[];
+    }
+
+    interface GlyphOptions {
+        advanceWidth?: number;
+        index?: number;
+        font?: Font;
+        name?: string;
+        path?: Path;
+        unicode?: number;
+        unicodes?: number[];
+        xMax?: number;
+        xMin?: number;
+        yMax?: number;
+        yMin?: number;
+    }
+
+    class GlyphNames {
+        private names;
+        constructor(post: Post);
+        glyphIndexToName(gid: number): string;
+        nameToGlyphIndex(name: string): number;
+    }
+
+    class GlyphSet {
+        private font;
+        private glyphs;
+        constructor(font: Font, glyphs: Glyph[] | { (): Glyph; }[]);
+        get(index: number): Glyph;
+        length: number;
+        push(index: number, loader: { (): Glyph; }): void;
+    }
+
+    interface KerningPairs {
+        [pair: string]: number;
+    }
+
+    function load(url: string, callback: { (error: any, font?: Font): void; }): void;
+
+    function loadSync(url: string): Font;
+
+    interface LocalizedName {
+        [lang: string]: string;
+    }
+
+    interface Metrics {
+        leftSideBearing: number;
+        rightSideBearing?: number;
+        xMax: number;
+        xMin: number;
+        yMax: number;
+        yMin: number;
+    }
+
+    function parse(buffer: any): Font;
+
+    class Path {
+        private fill;
+        private stroke;
+        private strokeWidth;
+        constructor();
+        bezierCurveTo(x1: number, y1: number, x2: number, y2: number, x: number, y: number): void;
+        close: () => void;
+        closePath(): void;
+        commands: PathCommand[];
+        curveTo: (x1: number, y1: number, x2: number, y2: number, x: number, y: number) => void;
+        draw(ctx: CanvasRenderingContext2D): void;
+        extend(pathOrCommands: Path | PathCommand[]): void;
+        lineTo(x: number, y: number): void;
+        moveTo(x: number, y: number): void;
+        quadraticCurveTo(x1: number, y1: number, x: number, y: number): void;
+        quadTo: (x1: number, y1: number, x: number, y: number) => void;
+        toPathData(decimalPlaces: number): string;
+        toSVG(decimalPlaces: number): string;
+        unitsPerEm: number;
+    }
+
+    interface PathCommand {
+        type: string;
+        x?: number;
+        y?: number;
+        x1?: number;
+        y1?: number;
+        x2?: number;
+        y2?: number;
+    }
+
+    interface Point {
+        lastPointOfContour?: boolean;
+    }
+
+    interface Post {
+        glyphNameIndex?: number[];
+        isFixedPitch: number;
+        italicAngle: number;
+        maxMemType1: number;
+        minMemType1: number;
+        maxMemType42: number;
+        minMemType42: number;
+        names?: string[];
+        numberOfGlyphs?: number;
+        offset?: number[];
+        underlinePosition: number;
+        underlineThickness: number;
+        version: number;
+    }
+
+    interface RenderOptions {
+        kerning: boolean;
+    }
+
+    interface Table {
+        [propName: string]: any;
+        encode(): number[];
+        fields: Field[];
+        sizeOf(): number;
+        tables: Table[];
+        tableName: string;
+    }
+
+}
+
+declare var opentype: typeof opentypejs;

From a29af1859902375b3048d859c5c5fb397e55f133 Mon Sep 17 00:00:00 2001
From: Dan Marshall <danmar@microsoft.com>
Date: Sat, 18 Jun 2016 22:26:03 -0700
Subject: [PATCH 182/278] removed non-type options var

---
 opentype/opentype-tests.ts | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git a/opentype/opentype-tests.ts b/opentype/opentype-tests.ts
index 696ed2de51..d70e4f56fb 100644
--- a/opentype/opentype-tests.ts
+++ b/opentype/opentype-tests.ts
@@ -3,7 +3,6 @@
 var x = 0;
 var y = 0;
 var fontSize = 72;
-var options;
 var ctx: CanvasRenderingContext2D;
 
 opentype.load('fonts/Roboto-Black.ttf', function(err, font) {
@@ -48,10 +47,10 @@ var font = new opentype.Font({
     glyphs: glyphs});
 font.download();
 
-font.getPath('text', x, y, fontSize, options);
-font.draw(ctx, 'text', x, y, fontSize, options);
-font.drawPoints(ctx, 'text', x, y, fontSize, options);
-font.drawMetrics(ctx, 'text', x, y, fontSize, options);
+font.getPath('text', x, y, fontSize);
+font.draw(ctx, 'text', x, y, fontSize);
+font.drawPoints(ctx, 'text', x, y, fontSize);
+font.drawMetrics(ctx, 'text', x, y, fontSize);
 font.stringToGlyphs('string');
 font.charToGlyph('c');
 font.getKerningValue(notdefGlyph, aGlyph);

From 864bb0cb15f85b1f6d1c1c1c915edb032a6bc1b3 Mon Sep 17 00:00:00 2001
From: Dan Marshall <danmar@microsoft.com>
Date: Sat, 18 Jun 2016 22:27:57 -0700
Subject: [PATCH 183/278] cast MyBuffer

---
 opentype/opentype-tests.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/opentype/opentype-tests.ts b/opentype/opentype-tests.ts
index d70e4f56fb..758b09283c 100644
--- a/opentype/opentype-tests.ts
+++ b/opentype/opentype-tests.ts
@@ -15,7 +15,7 @@ opentype.load('fonts/Roboto-Black.ttf', function(err, font) {
     }
 });
 
-var myBuffer;
+var myBuffer: ArrayBuffer;
 var font = opentype.parse(myBuffer);
 font = opentype.loadSync('fonts/Roboto-Black.ttf');
 

From 1cc8217be0ce9abd5b97b0588d1d83b760f1319c Mon Sep 17 00:00:00 2001
From: tarurar <tarutin_andrew@mail.ru>
Date: Sun, 19 Jun 2016 10:46:43 +0400
Subject: [PATCH 184/278] Add files via upload

added destroy method to ReadStream interface
---
 node/node.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/node/node.d.ts b/node/node.d.ts
index bffb007c4b..8fbed6bc51 100644
--- a/node/node.d.ts
+++ b/node/node.d.ts
@@ -1399,6 +1399,7 @@ declare module "fs" {
 
     export interface ReadStream extends stream.Readable {
         close(): void;
+        destroy(): void;
     }
     export interface WriteStream extends stream.Writable {
         close(): void;

From 2abd80bc0108d398826aba6fcc2a1dad8ed22184 Mon Sep 17 00:00:00 2001
From: Vasyl Zuzyak <ZuBB@users.noreply.github.com>
Date: Sun, 19 Jun 2016 11:15:44 +0300
Subject: [PATCH 185/278] update signature to `translations` method of
 translateProvider

accordingly to angular-translate source (https://github.com/angular-translate/angular-translate/blob/master/src/service/translate.js#L235-L252) `translations()` method returns translation table when no params or only key was passed.
---
 angular-translate/angular-translate.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/angular-translate/angular-translate.d.ts b/angular-translate/angular-translate.d.ts
index 045f2f5994..51946281ce 100644
--- a/angular-translate/angular-translate.d.ts
+++ b/angular-translate/angular-translate.d.ts
@@ -72,7 +72,7 @@ declare namespace angular.translate {
     }
 
     interface ITranslateProvider extends angular.IServiceProvider {
-        translations(): ITranslationTable;
+        translations(key?: string): ITranslationTable;
         translations(key: string, translationTable: ITranslationTable): ITranslateProvider;
         cloakClassName(): string;
         cloakClassName(name: string): ITranslateProvider;

From b59c8be91791f0175dd0f3417e5182963b935198 Mon Sep 17 00:00:00 2001
From: Peter Snider <snider.peter@gmail.com>
Date: Sun, 19 Jun 2016 08:28:37 -0700
Subject: [PATCH 186/278] added pino

---
 pino/pino-tests.ts | 31 +++++++++++++++++++++++
 pino/pino.d.ts     | 62 ++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 93 insertions(+)
 create mode 100644 pino/pino-tests.ts
 create mode 100644 pino/pino.d.ts

diff --git a/pino/pino-tests.ts b/pino/pino-tests.ts
new file mode 100644
index 0000000000..9a2c423222
--- /dev/null
+++ b/pino/pino-tests.ts
@@ -0,0 +1,31 @@
+/// <reference path="../node/node.d.ts"/>   // only for require()
+/// <reference path="pino.d.ts"/>
+// This contains all of the code from the docs on https://www.npmjs.com/package/pino
+
+import PINO = require('pino')
+var pino = PINO()
+var info = pino.info
+var error = pino.error
+
+info('hello world')
+error('this is at error level')
+info('the answer is %d', 42)
+info({ obj: 42 }, 'hello world')
+info({ obj: 42, b: 2 }, 'hello world')
+info({ obj: { aa: 'bbb' } }, 'another')
+setImmediate(info, 'after setImmediate')
+error(new Error('an error'))
+
+
+var instance = PINO({
+  name: 'myapp',
+  safe: true,
+  serializers: {
+    req: pino.stdSerializers.req,
+    res: pino.stdSerializers.res
+  }
+})
+
+
+var logger = instance
+logger.child({ a: 'property' }).info('hello child!')
diff --git a/pino/pino.d.ts b/pino/pino.d.ts
new file mode 100644
index 0000000000..3816ce0f17
--- /dev/null
+++ b/pino/pino.d.ts
@@ -0,0 +1,62 @@
+// Type definitions for pino v1.0.1
+// Project: https://github.com/mcollina/pino.git
+// Definitions by: Peter Snider <https://github.com/psnider>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts"/>   // only for require()
+
+declare module 'pino' {
+
+    import stream = require('stream')
+
+    interface Serializers {
+        req(req: Object): Object
+        res(res: Object): Object
+    }
+
+
+    interface LoggerOptions {
+        name?: string
+        enabled?: boolean
+        safe?: boolean
+        serializers?: Serializers
+    }
+
+
+    interface Pino {
+        (): Logger
+        (options: LoggerOptions): Logger
+        (stream: stream.Writable): Logger
+        (options: LoggerOptions, stream: stream.Writable): Logger
+    }
+
+
+
+    interface Logger {
+        child(bindings: Object): this
+        level: string   // 'fatal' | 'error' | 'warn' | 'info' | 'debug' | 'trace'
+        fatal(msg: string, ...args : any[]): void
+        fatal(obj: Object, msg: string, ...args : any[]): void
+        fatal(obj: Object): void
+        error(msg: string, ...args : any[]): void
+        error(obj: Object, msg: string, ...args : any[]): void
+        error(obj: Object): void
+        warn(msg: string, ...args : any[]): void
+        warn(obj: Object, msg: string, ...args : any[]): void
+        warn(obj: Object): void
+        info(msg: string, ...args : any[]): void
+        info(obj: Object, msg: string, ...args : any[]): void
+        info(obj: Object): void
+        debug(msg: string, ...args : any[]): void
+        debug(obj: Object, msg: string, ...args : any[]): void
+        debug(obj: Object): void
+        trace(msg: string, ...args : any[]): void
+        trace(obj: Object, msg: string, ...args : any[]): void
+        trace(obj: Object): void
+        stdSerializers: Serializers
+    }
+
+    var p: Pino
+    export = p
+
+}

From c9e0db4021bcb2ed4cc7f12dc7d11a7803c70a50 Mon Sep 17 00:00:00 2001
From: Horiuchi_H <horiuchi.g@gmail.com>
Date: Mon, 20 Jun 2016 12:35:55 +0900
Subject: [PATCH 187/278] feat: add `saml2-js` type definition files

---
 saml2-js/saml2-js-tests.ts | 122 +++++++++++++++++++++++++++++++++++++
 saml2-js/saml2-js.d.ts     |  74 ++++++++++++++++++++++
 2 files changed, 196 insertions(+)
 create mode 100644 saml2-js/saml2-js-tests.ts
 create mode 100644 saml2-js/saml2-js.d.ts

diff --git a/saml2-js/saml2-js-tests.ts b/saml2-js/saml2-js-tests.ts
new file mode 100644
index 0000000000..6820be0b59
--- /dev/null
+++ b/saml2-js/saml2-js-tests.ts
@@ -0,0 +1,122 @@
+/// <reference path="saml2-js.d.ts" />
+/// <reference path="../node/node.d.ts" />
+/// <reference path="../express/express.d.ts" />
+
+import * as fs from 'fs';
+import * as express from 'express';
+import * as saml2 from 'saml2-js';
+
+
+// Example
+{
+    const sp_options = {
+        entity_id: "https://sp.example.com/metadata.xml",
+        private_key: fs.readFileSync("key-file.pem").toString(),
+        certificate: fs.readFileSync("cert-file.crt").toString(),
+        assert_endpoint: "https://sp.example.com/assert",
+        force_authn: true,
+        auth_context: { comparison: "exact", class_refs: ["urn:oasis:names:tc:SAML:1.0:am:password"] },
+        nameid_format: "urn:oasis:names:tc:SAML:2.0:nameid-format:transient",
+        sign_get_request: false,
+        allow_unencrypted_assertion: true
+    };
+
+    // Call service provider constructor with options
+    const sp = new saml2.ServiceProvider(sp_options);
+
+    // Example use of service provider.
+    // Call metadata to get XML metatadata used in configuration.
+    const metadata = sp.create_metadata();
+
+    // Initialize options object
+    const idp_options = {
+        sso_login_url: "https://idp.example.com/login",
+        sso_logout_url: "https://idp.example.com/logout",
+        certificates: [fs.readFileSync("cert-file1.crt").toString(), fs.readFileSync("cert-file2.crt").toString()],
+        force_authn: true,
+        sign_get_request: false,
+        allow_unencrypted_assertion: false
+    };
+
+    // Call identity provider constructor with options
+    const idp = new saml2.IdentityProvider(idp_options);
+
+    // Example usage of identity provider.
+    // Pass identity provider into a service provider function with options and a callback.
+    sp.post_assert(idp, {}, (error: any, response: any) => {});
+}
+
+
+// Example: Express implementation
+{
+    const app = express();
+
+    // Create service provider
+    const sp_options = {
+      entity_id: "https://sp.example.com/metadata.xml",
+      private_key: fs.readFileSync("key-file.pem").toString(),
+      certificate: fs.readFileSync("cert-file.crt").toString(),
+      assert_endpoint: "https://sp.example.com/assert"
+    };
+    const sp = new saml2.ServiceProvider(sp_options);
+
+    // Create identity provider
+    const idp_options = {
+      sso_login_url: "https://idp.example.com/login",
+      sso_logout_url: "https://idp.example.com/logout",
+      certificates: [fs.readFileSync("cert-file1.crt").toString(), fs.readFileSync("cert-file2.crt").toString()]
+    };
+    const idp = new saml2.IdentityProvider(idp_options);
+
+    // ------ Define express endpoints ------
+
+    // Endpoint to retrieve metadata
+    app.get("/metadata.xml", function(req, res) {
+      res.type('application/xml');
+      res.send(sp.create_metadata());
+    });
+
+    // Starting point for login
+    app.get("/login", function(req, res) {
+      sp.create_login_request_url(idp, {}, function(err, login_url, request_id) {
+        if (err != null)
+          return res.send(500);
+        res.redirect(login_url);
+      });
+    });
+
+    // Assert endpoint for when login completes
+    app.post("/assert", function(req, res) {
+      const options = {request_body: req.body};
+      sp.post_assert(idp, options, function(err, saml_response) {
+        if (err != null)
+          return res.send(500);
+
+        // Save name_id and session_index for logout
+        // Note:  In practice these should be saved in the user session, not globally.
+        let name_id = saml_response.user.name_id;
+        let session_index = saml_response.user.session_index;
+
+        res.send("Hello #{saml_response.user.name_id}!");
+      });
+    });
+
+    // Starting point for logout
+    app.get("/logout", function(req, res) {
+      let name_id = '';
+      let session_index = '';
+      const options = {
+        name_id: name_id,
+        session_index: session_index
+      };
+
+      sp.create_logout_request_url(idp, options, function(err, logout_url) {
+        if (err != null)
+          return res.send(500);
+        res.redirect(logout_url);
+      });
+    });
+
+    app.listen(3000);
+}
+
diff --git a/saml2-js/saml2-js.d.ts b/saml2-js/saml2-js.d.ts
new file mode 100644
index 0000000000..296cd6eb26
--- /dev/null
+++ b/saml2-js/saml2-js.d.ts
@@ -0,0 +1,74 @@
+// Type definitions for SAML2-js 1.6.0
+// Project: https://github.com/Clever/saml2
+// Definitions by: horiuchi <https://github.com/horiuchi/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module "saml2-js" {
+
+    export class IdentityProvider {
+        constructor(options: IdentityProviderOptions);
+    }
+    export interface IdentityProviderOptions {
+        sso_login_url: string;
+        sso_logout_url: string;
+        certificates: string[];
+        force_authn?: boolean;
+        sign_get_request?: boolean;
+        allow_unencrypted_assertion?: boolean;
+    }
+
+
+    export class ServiceProvider {
+        constructor(options: ServiceProviderOptions);
+
+        create_login_request_url(IdP: IdentityProvider, options: CreateLoginRequestUrlOptions, cb: (error: any, login_url: string, request_id: string) => void): void;
+        redirect_assert(IdP: IdentityProvider, options: GetAssertOptions, cb: (error: any, response: any) => void): void;
+        post_assert(IdP: IdentityProvider, options: GetAssertOptions, cb: (error: any, response: any) => void): void;
+        create_logout_request_url(IdP: IdentityProvider, options: CreateLogoutRequestUrlOptions, cb: (error: any, request_url: string) => void): void;
+        create_logout_response_url(IdP: IdentityProvider, options: CreateLogoutResponseUrlOptions, cb: (error: any, response_url: string) => void): void;
+        create_metadata(): string;
+    }
+    export interface ServiceProviderOptions {
+        entity_id: string;
+        private_key: string;
+        certificate: string;
+        assert_endpoint: string;
+        alt_private_keys?: string[];
+        alt_certs?: string[];
+        force_authn?: boolean;
+        auth_context?: AuthnContextClassRef;
+        nameid_format?: string;
+        sign_get_request?: boolean;
+        allow_unencrypted_assertion?: boolean;
+    }
+    export interface CreateLoginRequestUrlOptions {
+        relay_state?: string;
+        auth_context?: AuthnContextClassRef;
+        nameid_format?: string;
+        force_authn?: boolean;
+        sign_get_request?: boolean;
+    }
+    export interface GetAssertOptions {
+        request_body?: any;
+        allow_unencrypted_assertion?: boolean;
+    }
+    export interface CreateLogoutRequestUrlOptions {
+        name_id?: string;
+        session_index?: string;
+        allow_unencrypted_assertion?: boolean;
+        sign_get_request?: boolean;
+        relay_state?: string;
+    }
+    export interface CreateLogoutResponseUrlOptions {
+        in_response_to?: string;
+        sign_get_request?: boolean;
+        relay_state?: string;
+    }
+
+
+    export interface AuthnContextClassRef {
+        comparison: string;
+        class_refs: string[];
+    }
+
+}

From 6ff9f7aa2e7029a7f4b61461dc9dff53a024b429 Mon Sep 17 00:00:00 2001
From: Yonezawa-T2 <Yonezawa-T2@mail.dnp.co.jp>
Date: Mon, 20 Jun 2016 13:24:58 +0900
Subject: [PATCH 188/278] Updates kii-cloud-sdk v2.4.4 -> v2.4.6.

- Added EU site.
- Added `Kii.authenticateAsThing`
- Added `Kii.authenticateAsThingWithToken`
- Added `KiiUser#setLocale`
- Added `KiiUser#getLocale`
- Added `KiiThing#getOnlineStatusModifiedAt`
- Added `KiiThing#isOnline`
- Added `KiiThingContext`
---
 kii-cloud-sdk/kii-cloud-sdk-tests.ts |  29 +++
 kii-cloud-sdk/kii-cloud-sdk.d.ts     | 294 ++++++++++++++++++++++++++-
 2 files changed, 318 insertions(+), 5 deletions(-)

diff --git a/kii-cloud-sdk/kii-cloud-sdk-tests.ts b/kii-cloud-sdk/kii-cloud-sdk-tests.ts
index a7118d78d3..6ca7d611db 100644
--- a/kii-cloud-sdk/kii-cloud-sdk-tests.ts
+++ b/kii-cloud-sdk/kii-cloud-sdk-tests.ts
@@ -26,6 +26,9 @@ function main() {
             endpoint.installationID;
         });
 
+    user.setLocale("en");
+    var locale: string = user.getLocale();
+
     var anotherUser: KiiUser = KiiUserBuilder
         .builderWithIdentifier("id", "password")
         .setEmailAddress("mail@example.org")
@@ -67,4 +70,30 @@ function main() {
                           removeMembersArray: KiiUser[]) {
         }
     });
+
+    Kii.authenticateAsThing("thing id", "password", {
+        success: function (thingAuthContext: KiiThingContext) {
+            thingAuthContext.bucketWithName("");
+        },
+        failure: function (error) {
+        }
+    })
+        .then(function (thingAuthContext: KiiThingContext) {
+        });
+
+    Kii.authenticateAsThingWithToken("thing id", "token", {
+        success: function (thingAuthContext: KiiThingContext) {
+            thingAuthContext.bucketWithName("");
+        },
+        failure: function (error) {
+        }
+    })
+        .then(function (thingAuthContext: KiiThingContext) {
+        });
+
+    KiiThing.loadWithVendorThingID("thing ID")
+        .then(function (thing) {
+            var isOnline: boolean = thing.isOnline();
+            var onlineStatusModifiedAt: Date = thing.getOnlineStatusModifiedAt();
+        });
 }
diff --git a/kii-cloud-sdk/kii-cloud-sdk.d.ts b/kii-cloud-sdk/kii-cloud-sdk.d.ts
index 550aa736fa..26decd07a0 100644
--- a/kii-cloud-sdk/kii-cloud-sdk.d.ts
+++ b/kii-cloud-sdk/kii-cloud-sdk.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for Kii Cloud SDK v2.4.4
+// Type definitions for Kii Cloud SDK v2.4.6
 // Project: http://en.kii.com/
 // Definitions by: Kii Consortium <http://jp.kii.com/consortium/>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -17,7 +17,8 @@ declare namespace KiiCloud {
         JP,
         CN,
         SG,
-        CN3
+        CN3,
+        EU
     }
 
     export enum KiiAnalyticsSite {
@@ -25,7 +26,8 @@ declare namespace KiiCloud {
         JP,
         CN,
         SG,
-        CN3
+        CN3,
+        EU
     }
 
     enum KiiSocialNetworkName {
@@ -512,6 +514,104 @@ declare namespace KiiCloud {
          *     );
          */
         static listTopics(callbacks?: { success(topicList: KiiTopic[], nextPaginationKey: string): any; failure(anErrorString: string): any; }, paginationKey?: string): Promise<[KiiTopic[], string]>;
+
+        /**
+         * Authenticate as Thing.
+         * <br><br>
+         * <b>This api is intended to be used in a Thing device, where the user
+         * credentials or app admin context is not configured. This Thing must be
+         * already registered in Kii Cloud.
+         * </b>
+         *
+         * @param vendorThingID vendorThingID of a registered Thing.
+         * @param password password for the registered Thing.
+         * @param callbacks The callback methods called when authentication succeeded/failed.
+         *
+         * @return return promise object.
+         *     <ul>
+         *       <li>fulfill callback function: function(thingAuthContext). thingAuthContext is a KiiThingContext instance.</li>
+         *       <li>reject callback function: function(error). error is an Error instance.
+         *         <ul>
+         *           <li>error.message</li>
+         *         </ul>
+         *       </li>
+         *     </ul>
+         *
+         * @example
+         *     // example to use callbacks directly
+         *     Kii.authenticateAsThing("vendor thing id", "password of this thing", {
+         *         success: function(thingAuthContext) {
+         *             // thingAuthContext : KiiThingContext instance
+         *             // Operate entities with thingAuthContext.
+         *         },
+         *         failure: function(error) {
+         *             // Authentication failed.
+         *         }
+         *     );
+         *
+         *     // example to use Promise
+         *     Kii.authenticateAsThing("vendor thing id", "password of this thing").then(
+         *         function(thingAuthContext) {　// fulfill callback function
+         *             // thingAuthContext : KiiThingContext instance
+         *             // Operate entities with thingAuthContext.
+         *
+         *         },
+         *         function(error) { // reject callback function
+         *             // Authentication failed.
+         *             var errorString = error.message;
+         *         }
+         *     );
+         */
+        static authenticateAsThing(vendorThingID: string, password: string, callbacks?: { success(thingAuthContext: KiiThingContext): any; failure(error: Error): any; }): Promise<KiiThingContext>;
+
+        /**
+         * Create a KiiThingContext reference
+         * <br><br>
+         * <b>This api is intended to be used in a Thing device, where the user
+         * credentials or app admin context is not configured. This Thing must be
+         * already registered in Kii Cloud.
+         * </b>
+         *
+         * @param thingID thingID of a registered Thing.
+         * @param token token for the registered Thing.
+         * @param callbacks The callback methods called when creation succeeded/failed.
+         *
+         * @return return promise object.
+         *     <ul>
+         *       <li>fulfill callback function: function(thingContext). thingContext is a KiiThingContext instance.</li>
+         *       <li>reject callback function: function(error). error is an Error instance.
+         *         <ul>
+         *           <li>error.message</li>
+         *         </ul>
+         *       </li>
+         *     </ul>
+         *
+         * @example
+         *     // example to use callbacks directly
+         *     Kii.authenticateAsThingWithToken("thing_id", "thing_token", {
+         *         success: function(thingContext) {
+         *             // thingContext : KiiThingContext instance
+         *             // Operate entities with thingContext.
+         *         },
+         *         failure: function(error) {
+         *             // Creation failed.
+         *         }
+         *     );
+         *
+         *     // example to use Promise
+         *     Kii.authenticateAsThingWithToken("thing_id", "thing_token").then(
+         *         function(thingContext) {　// fulfill callback function
+         *             // thingContext : KiiThingContext instance
+         *             // Operate entities with thingContext.
+         *
+         *         },
+         *         function(error) { // reject callback function
+         *             // Creation failed.
+         *             var errorString = error.message;
+         *         }
+         *     );
+         */
+        static authenticateAsThingWithToken(thingID: string, token: string, callbacks?: { success(thingContext: KiiThingContext): any; failure(error: Error): any; }): Promise<KiiThingContext>;
     }
 
     /**
@@ -3744,7 +3844,7 @@ declare namespace KiiCloud {
          *         <li>response.username is username to use for connecting to the MQTT broker.</li>
          *         <li>response.password is assword to use for connecting to the MQTT broker.</li>
          *         <li>response.mqttTopic is topic to subscribe in the MQTT broker.</li>
-         *         <li>response.host is URL of the MQTT broker host to connect.</li>
+         *         <li>response.host is hostname of the MQTT broker.</li>
          *         <li>response.X-MQTT-TTL is the amount of time in seconds that specifies how long the mqttTopic will be valid, after that the client needs to request new MQTT endpoint info.</li>
          *         <li>response.portTCP is port to connect using plain TCP.</li>
          *         <li>response.portSSL is port to connect using SSL/TLS.</li>
@@ -4986,6 +5086,20 @@ declare namespace KiiCloud {
          */
         getDisabled(): boolean;
 
+        /**
+         * Get online status of the thing.
+         *
+         * @return true if the thing is online, false otherwise. The return value will be null initially until the thing is connected for the first time.
+         */
+        isOnline(): boolean;
+
+        /**
+         * Get online status modified date of the thing.
+         *
+         * @return online status modified time of this thing. The date will be null initially until the thing is connected for the first time.
+         */
+        getOnlineStatusModifiedAt(): Date;
+
         /**
          * Register thing in KiiCloud.<br>
          * This API doesnt require users login Anonymous user can register thing.
@@ -5794,6 +5908,156 @@ declare namespace KiiCloud {
         pushSubscription(): KiiPushSubscription;
     }
 
+    /**
+     * represents a KiiThingContext object
+     */
+    export class KiiThingContext {
+        /**
+         * Creates a reference to a bucket in App scope operated by thing.
+         *
+         * @param bucketName The name of the bucket the app should create/access
+         *
+         * @return A working KiiBucket object
+         *
+         * @example
+         *         Kii.authenticateAsThing("vendorThingID", "password", {
+         *             success: function(thingAuthContext) {
+         *                 var bucket = thingAuthContext.bucketWithName("myAppBucket");
+         *             },
+         *             failure: function(errorString, errorCode) {
+         *                 // auth failed.
+         *             }
+         *         });
+         */
+        bucketWithName(bucketName: string): KiiBucket;
+
+        /**
+         * Creates a reference to a encrypted bucket in App scope operated by thing.
+         *     <br><br>The bucket will be created/accessed within this app's scope
+         *
+         * @param bucketName The name of the bucket the app should create/access
+         *
+         * @return A working KiiBucket object
+         *
+         * @example
+         *         Kii.authenticateAsThing("vendorThingID", "password", {
+         *             success: function(thingAuthContext) {
+         *                 var bucket = thingAuthContext.encryptedBucketWithName("myAppBucket");
+         *             },
+         *             failure: function(errorString, errorCode) {
+         *                 // auth failed.
+         *             }
+         *         });
+         */
+        encryptedBucketWithName(bucketName: string): KiiBucket;
+
+        /**
+         * Creates a reference to an object operated by thing using object`s URI.
+         *
+         * @param object URI.
+         *
+         * @return A working KiiObject instance
+         *
+         * @throws If the URI is null, empty or does not have correct format.
+         */
+        objectWithURI(object: string): KiiObject;
+
+        /**
+         * Creates a reference to a topic in App scope operated by thing.
+         * <br><br>The Topic will be created/accessed within this app's scope
+         *
+         * @param topicName name of the topic. Must be a not empty string.
+         *
+         * @return topic instance.
+         */
+        topicWithName(topicName: string): KiiTopic;
+
+        /**
+         * Gets a list of topics in app scope
+         *
+         * @param callbacks An object with callback methods defined
+         * @param paginationKey You can specify the pagination key with the nextPaginationKey passed by callbacks.success. If empty string or no string object is provided, this API regards no paginationKey specified.
+         *
+         * @return return promise object.
+         *     <ul>
+         *       <li>fulfill callback function: function(params). params is Array instance.
+         *         <ul>
+         *           <li>params[0] is array of KiiTopic instances.</li>
+         *           <li>params[1] is string of nextPaginationKey.</li>
+         *         </ul>
+         *       </li>
+         *       <li>reject callback function: function(error). error is an Error instance.
+         *         <ul>
+         *           <li>error.target is a KiiAppAdminContext instance which this method was called on.</li>
+         *           <li>error.message</li>
+         *         </ul>
+         *       </li>
+         *     </ul>
+         *
+         * @example
+         *     // example to use callbacks directly
+         *     // Assume you already have thingAuthContext instance.
+         *     thingAuthContext.listTopics({
+         *         success: function(topicList, nextPaginationKey) {
+         *             // do something with the result
+         *             for(var i=0; i&lt;topicList.length; i++){
+         *                 var topic = topicList[i];
+         *             }
+         *             if (nextPaginationKey != null) {
+         *                 thingAuthContext.listTopics({
+         *                     success: function(topicList, nextPaginationKey) {...},
+         *                     failure: function(anErrorString) {...}
+         *                 }, nextPaginationKey);
+         *             }
+         *         },
+         *         failure: function(anErrorString) {
+         *             // do something with the error response
+         *         }
+         *     });
+         *
+         *     // example to use Promise
+         *     // Assume you already have thingAuthContext instance.
+         *     thingAuthContext.listTopics().then(
+         *         function(params) {
+         *             var topicList = params[0];
+         *             var nextPaginationKey = params[1];
+         *             // do something with the result
+         *             for(var i=0; i&lt;topicList.length; i++){
+         *                 var topic = topicList[i];
+         *             }
+         *             if (nextPaginationKey != null) {
+         *                 thingAuthContext.listTopics(null, nextPaginationKey).then(
+         *                     function(params) {...},
+         *                     function(error) {...}
+         *                 );
+         *             }
+         *         },
+         *         function(error) {
+         *             // do something with the error response
+         *         }
+         *     );
+         */
+        listTopics(callbacks?: { success(topicList: KiiTopic[], nextPaginationKey: string): any; failure(anErrorString: string): any; }, paginationKey?: string): Promise<[KiiTopic[], string]>;
+
+        /**
+         * Gets authenticated KiiThing instance.
+         * <br>Returned thing instance only have thingID, vendorThingID and accessToken.
+         * (vendorThingID is not included when you used
+         * {@link Kii.authenticateAsThingWithToken()} to obtain KiiThingContext.)
+         * <br>Please execute {@link KiiThing#refresh()} to obtain other properties.
+         *
+         * @return return authenticated KiiThing instance.
+         */
+        getAuthenticatedThing(): KiiThing;
+
+        /**
+         * Instantiate push installation for this thing.
+         *
+         * @return push installation object.
+         */
+        pushInstallation(): KiiPushInstallation;
+    }
+
     /**
      * Represents a Topic object.
      */
@@ -6106,6 +6370,25 @@ declare namespace KiiCloud {
          */
         setCountry(value: string): void;
 
+        /**
+         * Get the locale associated with this user
+         *
+         * @return
+         */
+        getLocale(): string;
+
+        /**
+         * Set the locale associated with this user
+         * The locale argument must be BCP 47 language tag.
+         * Examples:
+         * "en": English
+         * "de-AT": German as used in Austria.
+         * "zh-Hans-CN": Chinese written in simplified characters as used in China.
+         *
+         * @param value The locale to set.
+         */
+        setLocale(value: string): void;
+
         /**
          * Get the server's creation date of this user
          *
@@ -6196,7 +6479,7 @@ declare namespace KiiCloud {
         /**
          * Sets a key/value pair to a KiiUser
          *
-         * <br><br>If the key already exists, its value will be written over. If the object is of invalid type, it will return false and a KiiError will be thrown (quietly). Accepted types are any JSON-encodable objects.
+         * <br><br>If the key already exists, its value will be written over. If key is empty or starting with '_', it will do nothing. Accepted types are any JSON-encodable objects.
          *
          * @param key The key to set. The key must not be a system key (created, metadata, modified, type, uuid) or begin with an underscore (_)
          * @param value The value to be set. Object must be of a JSON-encodable type (Ex: dictionary, array, string, number, etc)
@@ -7826,6 +8109,7 @@ import KiiServerCodeEntry = KiiCloud.KiiServerCodeEntry;
 import KiiServerCodeExecResult = KiiCloud.KiiServerCodeExecResult;
 import KiiSocialConnect = KiiCloud.KiiSocialConnect;
 import KiiThing = KiiCloud.KiiThing;
+import KiiThingContext = KiiCloud.KiiThingContext;
 import KiiTopic = KiiCloud.KiiTopic;
 import KiiUser = KiiCloud.KiiUser;
 import KiiUserBuilder = KiiCloud.KiiUserBuilder;

From adc859915a997212505120153ad93849b7de0b11 Mon Sep 17 00:00:00 2001
From: dencap <d.cappellin@asem.it>
Date: Mon, 20 Jun 2016 11:44:58 +0200
Subject: [PATCH 189/278] Added mouse event contextmenu

---
 jquery/jquery.d.ts | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)

diff --git a/jquery/jquery.d.ts b/jquery/jquery.d.ts
index 6478529dad..40ebf2ee6c 100644
--- a/jquery/jquery.d.ts
+++ b/jquery/jquery.d.ts
@@ -1987,6 +1987,24 @@ interface JQuery {
      */
     click(eventData?: any, handler?: (eventObject: JQueryEventObject) => any): JQuery;
 
+    /**
+     * Trigger the "contextmenu" event on an element.
+     */
+    contextmenu(): JQuery;
+    /**
+     * Bind an event handler to the "contextmenu" JavaScript event.
+     *
+     * @param handler A function to execute when the event is triggered.
+     */
+    contextmenu(handler: (eventObject: JQueryMouseEventObject) => any): JQuery;
+    /**
+     * Bind an event handler to the "contextmenu" JavaScript event.
+     *
+     * @param eventData An object containing data that will be passed to the event handler.
+     * @param handler A function to execute when the event is triggered.
+     */
+    contextmenu(eventData: Object, handler: (eventObject: JQueryMouseEventObject) => any): JQuery;
+
     /**
      * Trigger the "dblclick" event on an element.
      */

From ff880ddac3afb6a23a053fb43fb99a1ee9cb1545 Mon Sep 17 00:00:00 2001
From: eorsaaq <hongshan.zhu@ericsson.com>
Date: Mon, 20 Jun 2016 17:41:08 +0800
Subject: [PATCH 190/278] add two interface:ClientSSLSecurity and setEndpoint

---
 soap/soap-tests.ts |  3 +++
 soap/soap.d.ts     | 10 ++++++++--
 2 files changed, 11 insertions(+), 2 deletions(-)

diff --git a/soap/soap-tests.ts b/soap/soap-tests.ts
index 8010d7285e..100bacf2f5 100644
--- a/soap/soap-tests.ts
+++ b/soap/soap-tests.ts
@@ -11,7 +11,10 @@ const wsdlOptions = { name: 'value' };
 soap.createClient(url, wsdlOptions, function(err: any, client: soap.Client) {
     let securityOptions = { 'hasTimeStamp': false };
     client.setSecurity(new soap.WSSecurity('user', 'password', securityOptions));
+    let defaults = {'rejectUnauthorized': false};
+    client.setSecurity(new soap.ClientSSLSecurity('/path/to/key', '/path/to/cert', '/path/to/ca',defaults));
     client.addSoapHeader({});
+    client.setEndpoint('http://localhost');
     client['create']({ name: 'value' }, function(err, result) {
         // result is an object
     });
diff --git a/soap/soap.d.ts b/soap/soap.d.ts
index fa26cbf04c..ce501e9e7a 100644
--- a/soap/soap.d.ts
+++ b/soap/soap.d.ts
@@ -8,13 +8,19 @@
 declare module 'soap' {
     import * as events from 'events';
 
-    class WSSecurity {
+    class Security {
+    }
+    class WSSecurity extends Security {
         constructor(username: string, password: string, options: any);
     }
+    class ClientSSLSecurity extends Security {
+        constructor(key: string, cert: string, ca: string, defaults: any);
+    }
     interface Client extends events.EventEmitter {
-        setSecurity(s: WSSecurity): void;
+        setSecurity(s: Security): void;
         [method: string]: (args: any, fn: (err: any, result: any) => void, options?: any, extraHeaders?: any) => void;
         addSoapHeader(headJSON: any): void;
+        setEndpoint(endpoint: string): void;
     }
     function createClient(wsdlPath: string, options: any, fn: (err: any, client: Client) => void): void;
 

From 65436e469fb5b7823b30ec630256714eb7041cc2 Mon Sep 17 00:00:00 2001
From: Simon <simon@foodit.com>
Date: Mon, 20 Jun 2016 12:12:43 +0100
Subject: [PATCH 191/278] IRaygunOptions parameter type change

By looking at the https://github.com/MindscapeHQ/raygun4js/blob/c7d8880045214ab6d403d5cc613c207f696a3cdd/src/raygun.js#L507-529 it looks like the `excludedHostnames` and `excludedUserAgents` can be an array of strings as well.
---
 raygun4js/raygun4js.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/raygun4js/raygun4js.d.ts b/raygun4js/raygun4js.d.ts
index c1a294bb31..c5647f804a 100644
--- a/raygun4js/raygun4js.d.ts
+++ b/raygun4js/raygun4js.d.ts
@@ -62,8 +62,8 @@ declare namespace raygun {
         ignoreAjaxAbort?: boolean;
         ignoreAjaxError?: boolean;
         disableAnonymousUserTracking?: boolean;
-        excludedHostnames?: boolean;
-        excludedUserAgents?: boolean;
+        excludedHostnames?: boolean | string[];
+        excludedUserAgents?: boolean | string[];
         wrapAsynchronousCallbacks?: boolean;
         debugMode?: boolean;
         ignore3rdPartyErrors?: boolean;

From 4ccbc961929b2951fca461509b30850b0ea8d3dc Mon Sep 17 00:00:00 2001
From: k7sleeper <k7sleeper@gmail.com>
Date: Mon, 20 Jun 2016 14:11:15 +0200
Subject: [PATCH 192/278] Added JSDoc

---
 z-schema/z-schema.d.ts | 23 ++++++++++++++++++++++-
 1 file changed, 22 insertions(+), 1 deletion(-)

diff --git a/z-schema/z-schema.d.ts b/z-schema/z-schema.d.ts
index 317a92247c..763d86a4db 100644
--- a/z-schema/z-schema.d.ts
+++ b/z-schema/z-schema.d.ts
@@ -37,9 +37,30 @@ declare namespace ZSchema {
     }
 
     export class Validator {
-        public static registerFormat(name: string, validator: (value: any) => boolean): void;
+    
+        /**
+         * Register a custom format.
+         *
+         * @param name - format name of the custom format
+         * @param validatorFunction - custom format validator function.
+         *   Returns true if value matches the custom format.
+         */
+        public static registerFormat(formatName: string, validatorFunction: (value: any) => boolean): void;
+
+        /**
+         * Unregister a format.
+         *
+         * @param name - format name of the custom format
+         */
         public static unregisterFormat(name: string): void;
+        
+        /**
+         * Get the list of all registered formats.
+         *
+         * @returns {string[]} the list of all registered format names.
+         */
         public static getRegisteredFormats(): string[];
+        
         public static getDefaultOptions(): Options;
     
         constructor(options: Options);

From a8d678c00660f81ce162669670779f0679b779f1 Mon Sep 17 00:00:00 2001
From: vatara <vatara420@gmail.com>
Date: Mon, 20 Jun 2016 10:17:11 -0400
Subject: [PATCH 193/278] Fixed name of CKEditor config option
 'filebrowserUploadUrl' from 'filebrowserUploadUr'

---
 ckeditor/ckeditor.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/ckeditor/ckeditor.d.ts b/ckeditor/ckeditor.d.ts
index bba377090f..9d8728338f 100644
--- a/ckeditor/ckeditor.d.ts
+++ b/ckeditor/ckeditor.d.ts
@@ -641,7 +641,7 @@ declare namespace CKEDITOR {
         filebrowserImageBrowseLinkUrl?: string;
         filebrowserImageBrowseUrl?: string;
         filebrowserImageUploadUrl?: string;
-        filebrowserUploadUr?: string;
+        filebrowserUploadUrl?: string;
         filebrowserWindowFeatures?: string;
         filebrowserWindowHeight?: number | string;
         filebrowserWindowWidth?: number | string;

From a11943b74002217b9e01c8f42b7dfca647869227 Mon Sep 17 00:00:00 2001
From: Jan Molak <jan.molak@smartcodeltd.co.uk>
Date: Mon, 20 Jun 2016 15:55:37 +0100
Subject: [PATCH 194/278] Brought the HookScenario up to date with Cucumber.js

Added methods missing from the HookScenario interface, as per [cucumber scenario.js](https://github.com/cucumber/cucumber-js/blob/1b9426897894a8df9f36252616e2020d4fc61269/lib/cucumber/api/scenario.js#L32) and corrected the `attach` method signature, since it can take a Stream, a Buffer and a string, not just string.
---
 cucumber/cucumber.d.ts | 16 ++++++++++++++--
 1 file changed, 14 insertions(+), 2 deletions(-)

diff --git a/cucumber/cucumber.d.ts b/cucumber/cucumber.d.ts
index d0e742d9c2..6c4273e4e0 100644
--- a/cucumber/cucumber.d.ts
+++ b/cucumber/cucumber.d.ts
@@ -29,8 +29,20 @@ declare namespace cucumber {
 	}
 
 	interface HookScenario{
-		attach(text: string, mimeType?: string, callback?: (err?:any) => void): void;
-		isFailed() : boolean;
+		getKeyword():string;
+		getName():string;
+		getDescription():string;
+		getUri():string;
+		getLine():number;
+		getTags():string[];
+		getException():Error;
+		getAttachments():any[];
+		attach(data:any, mimeType?:string, callback?:(err?:any) => void):void;
+		isSuccessful():boolean;
+		isFailed():boolean;
+		isPending():boolean;
+		isUndefined():boolean;
+		isSkipped():boolean;
 	}
 
 	interface HookCode {

From 1c5ce5244f36e9a03d01e5f82f9b8c3f36e41025 Mon Sep 17 00:00:00 2001
From: Daryl LaBar <d3labar@hotmail.com>
Date: Mon, 20 Jun 2016 11:17:21 -0400
Subject: [PATCH 195/278] Added Name to list of Authors via Dave Barry's
 request: https://twitter.com/crmentropy/status/744399133671206912

---
 xrm/xrm.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/xrm/xrm.d.ts b/xrm/xrm.d.ts
index 14f1cf204b..474d232f7c 100644
--- a/xrm/xrm.d.ts
+++ b/xrm/xrm.d.ts
@@ -1,6 +1,6 @@
 // Type definitions for Microsoft Dynamics xRM API v7.1
 // Project: http://www.microsoft.com/en-us/download/details.aspx?id=44567
-// Definitions by: David Berry <https://github.com/6ix4our/>, Matt Ngan <https://github.com/mattngan/>, Markus Mauch <https://github.com/markusmauch/>
+// Definitions by: David Berry <https://github.com/6ix4our/>, Matt Ngan <https://github.com/mattngan/>, Markus Mauch <https://github.com/markusmauch/>, Daryl LaBar <https://github.com/daryllabar>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
 declare var Xrm: Xrm.XrmStatic;

From 93c443f2c1a06c47e7369739a950bb24416a6f9a Mon Sep 17 00:00:00 2001
From: ephoton <i@ephoton.me>
Date: Tue, 21 Jun 2016 00:46:37 +0800
Subject: [PATCH 196/278] Export type RouteProps

---
 react-router/react-router.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/react-router/react-router.d.ts b/react-router/react-router.d.ts
index 615f0bb355..ad1648dfa5 100644
--- a/react-router/react-router.d.ts
+++ b/react-router/react-router.d.ts
@@ -484,6 +484,7 @@ declare module "react-router" {
     export type RouterState = ReactRouter.RouterState
     export type HistoryBase = ReactRouter.HistoryBase
     export type RouterOnContext = ReactRouter.RouterOnContext
+    export type RouteProps = ReactRouter.RouteProps
 
     export {
         Router,

From 1664574941c28fedad49fcd1adf74ab1b1f4c724 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Rasmus=20Eeg=20M=C3=B8ller?= <rasmuseeg@outlook.com>
Date: Mon, 20 Jun 2016 19:30:30 +0200
Subject: [PATCH 197/278] Missing dialogData

As mentioned here:
https://www.proworks.com/blog/archive/how-to-pass-data-to-the-umbraco-7-dialogservice-on-open/

And shown in the core here:
https://github.com/umbraco/Umbraco-CMS/blob/dev-v7/src/Umbraco.Web.UI.Client/src/common/services/dialog.service.js#L92
---
 umbraco/umbraco-services.d.ts | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/umbraco/umbraco-services.d.ts b/umbraco/umbraco-services.d.ts
index 10710492ab..90585243f0 100644
--- a/umbraco/umbraco-services.d.ts
+++ b/umbraco/umbraco-services.d.ts
@@ -494,6 +494,11 @@ declare namespace umbraco.services {
         width?: number;
         /*strips the modal from any animation and wrappers, used when you want to inject a dialog into an existing container*/
         inline?: boolean;
+        
+        /** 
+         * It will set this value as a property on the dialog controller's scope as $scope.dialogData
+         */
+	dialogData: any;
     }
 
     /**

From 074619ae7356868440751cbc2616141196b61b0a Mon Sep 17 00:00:00 2001
From: Cao Jiannan <frogcjn@163.com>
Date: Tue, 21 Jun 2016 02:21:42 +0800
Subject: [PATCH 198/278] Update for Model static members

Update for Model static members
Based on http://sequelize.readthedocs.io/en/latest/api/model/, and source code https://github.com/sequelize/sequelize/blob/master/lib/model.js
---
 sequelize/sequelize.d.ts | 247 +++++++++++++++++++++++++++++++++++----
 1 file changed, 225 insertions(+), 22 deletions(-)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index cc0ff0b4ff..733f31ddad 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -2595,6 +2595,8 @@ declare module "sequelize" {
              * Transaction to run query under
              */
             transaction? : Transaction;
+            
+            
 
         }
 
@@ -2683,6 +2685,11 @@ declare module "sequelize" {
              * Transaction to run the query in
              */
             transaction? : Transaction;
+            
+            /**
+             * Append RETURNING * to get back auto generated values (Postgres only)
+             */
+            returning? : boolean;
 
         }
 
@@ -2928,6 +2935,11 @@ declare module "sequelize" {
              * A function that gets executed while running the query to log the sql.
              */
             logging?: boolean | Function;
+            
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark?: boolean;
 
         }
 
@@ -2945,8 +2957,32 @@ declare module "sequelize" {
              * A function that gets executed while running the query to log the sql.
              */
             logging? : Function | boolean;
+            
+            
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark: boolean;
 
         }
+        /**
+         * GetTableName Options
+         */
+        interface GetTableNameOptions {
+
+            /**
+             * A function that gets executed while running the query to log the sql.
+             */
+            logging? : Function | boolean;
+            
+            
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark: boolean;
+
+        }
+        
 
         /**
          * AddScope Options for Model.addScope
@@ -3125,7 +3161,7 @@ declare module "sequelize" {
          *
          * A hash of options to describe the scope of the search
          */
-		interface FindOptions {
+	interface FindOptions {
 
             /**
              * A hash of attributes to describe your search. See above for examples.
@@ -3161,7 +3197,7 @@ declare module "sequelize" {
              * `order: [['name', 'DESC']]`. In this way the column will be escaped, but the direction will not.
              */
             order?: string | col | literal | Array<string | number | Model<any, any> | { model : Model<any, any>, as? : string}> | Array<string | col | literal | Array<string | number | Model<any, any> | { model : Model<any, any>, as? : string}>>;
-
+            
             /**
              * Limit the results
              */
@@ -3204,6 +3240,33 @@ declare module "sequelize" {
              * https://github.com/sequelize/sequelize/blob/master/docs/docs/models-usage.md#user-content-manipulating-the-dataset-with-limit-offset-order-and-group
              */
             group?: string | string[] | Object;
+            
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
+
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark? : boolean;
+
+        }
+        
+        /**
+         * Options for findById/findByPrimary, findOne/find
+         */
+	interface FindOneOptions {
+
+            /**
+             * Transaction to run query under
+             */
+            transaction? : Transaction;
+            
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
 
         }
 
@@ -3239,12 +3302,25 @@ declare module "sequelize" {
              */
             group? : Object;
 
+            /**
+             * Transaction to run query under
+             */
+            transaction? : Transaction;
+            
             /**
              * A function that gets executed while running the query to log the sql.
              */
             logging? : boolean | Function;
 
-            transaction?: Transaction;
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
+
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark? : boolean;
         }
 
         /**
@@ -3269,6 +3345,15 @@ declare module "sequelize" {
              */
             include? :  Array<Model<any, any> | IncludeOptions>;
 
+	    /**
+	     * If true, the updatedAt timestamp will not be updated.
+	     */
+            silent? : boolean;
+            
+            /**
+             * Append RETURNING * to get back auto generated values (Postgres only)
+             */
+            returning? : boolean;
         }
 
         /**
@@ -3295,10 +3380,16 @@ declare module "sequelize" {
              * A function that gets executed while running the query to log the sql.
              */
             logging? : boolean | Function;
+            
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
 
-            silent? : boolean;
-
-            returning? : boolean;
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark? : boolean;
         }
 
         /**
@@ -3326,6 +3417,26 @@ declare module "sequelize" {
              */
             logging? : boolean | Function;
 
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark? : boolean;
+        }
+        
+        /**
+         * Options for Model.findOrInitialize method
+         */
+        interface FindCreateFindOptions<TAttributes> {
+
+            /**
+             * A hash of search attributes.
+             */
+            where : string | WhereOptions;
+
+            /**
+             * Default values to use if building a new instance
+             */
+            defaults? : TAttributes;
         }
 
         /**
@@ -3343,15 +3454,15 @@ declare module "sequelize" {
              */
             fields? : string[];
 
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
             /**
              * Transaction to run query under
              */
             transaction? : Transaction;
+            
+            /**
+             * A function that gets executed while running the query to log the sql.
+             */
+            logging? : boolean | Function;
 
             /**
              * An optional parameter to specify the schema search_path (Postgres only)
@@ -3414,6 +3525,20 @@ declare module "sequelize" {
              */
             logging? : boolean | Function;
 
+            /**
+             * Append RETURNING * to get back auto generated values (Postgres only).
+             */
+            returning? : boolean;
+            
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
+            
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark? : boolean;
         }
 
         /**
@@ -3439,6 +3564,15 @@ declare module "sequelize" {
              */
             logging? : boolean | Function;
 
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
+
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark? : boolean;
         }
 
         /**
@@ -3515,7 +3649,12 @@ declare module "sequelize" {
              * Transaction to run query under
              */
             transaction? : Transaction;
-
+            
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark?: boolean;
+            
         }
 
         /**
@@ -3582,18 +3721,33 @@ declare module "sequelize" {
              * Transaction to run query under
              */
             transaction? : Transaction;
-
+            
+            
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark?: boolean;
+            
+           /**
+	     * If true, the updatedAt timestamp will not be updated.
+	     */
+            silent? : boolean;
         }
 
         /**
          * Options used for Model.aggregate
          */
-        interface AggregateOptions extends QueryOptions {
+        interface AggregateOptions {
 
             /**
              * A hash of search attributes.
              */
             where?: WhereOptions;
+            
+            /**
+             * A function that gets executed while running the query to log the sql.
+             */
+            logging? : boolean | Function;
 
             /**
              * The type of the result. If `field` is a field in this Model, the default will be the type of that field,
@@ -3605,7 +3759,23 @@ declare module "sequelize" {
              * Applies DISTINCT to the field being aggregated over
              */
             distinct? : boolean;
+            
+            /**
+             * The transaction that the query should be executed under
+             */
+            transaction?: Transaction;
 
+            /**
+             * When `true`, the first returned value of `aggregateFunction` is cast to `dataType` and returned.
+             * If additional attributes are specified, along with `group` clauses, set `plain` to `false` to return all values of all returned rows.
+             * Defaults to `true`
+             */
+            plain?: boolean;
+            
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark?: boolean;
         }
 
         /**
@@ -3661,7 +3831,7 @@ declare module "sequelize" {
              *     subscribers_1, subscribers_2)
              * @param options.logging=false A function that gets executed while running the query to log the sql.
              */
-            getTableName( options? : { logging : Function } ) : string | Object;
+            getTableName( options? : GetTableNameOptions ) : string | Object;
 
             /**
              * Add a new scope to the model. This is especially useful for adding scopes with includes, when the model you want to include is not available at the time this model is defined.
@@ -3793,15 +3963,15 @@ declare module "sequelize" {
              * Search for a single instance by its primary key. This applies LIMIT 1, so the listener will
              * always be called with a single instance.
              */
-            findById( identifier? : number | string, options? : FindOptions ) : Promise<TInstance>;
-            findByPrimary( identifier? : number | string, options? : FindOptions ) : Promise<TInstance>;
+            findById( identifier? : number | string, options? : FindOneOptions ) : Promise<TInstance>;
+            findByPrimary( identifier? : number | string, options? : FindOneOptions ) : Promise<TInstance>;
 
             /**
              * Search for a single instance. This applies LIMIT 1, so the listener will always be called with a single
              * instance.
              */
-            findOne( options? : FindOptions ) : Promise<TInstance>;
-            find( optionz? : FindOptions ) : Promise<TInstance>;
+            findOne( options? : FindOneOptions ) : Promise<TInstance>;
+            find( optionz? : FindOneOptions ) : Promise<TInstance>;
 
             /**
              * Run an aggregation method on the specified field
@@ -3908,6 +4078,12 @@ declare module "sequelize" {
              * will be created instead, and any unique constraint violation will be handled internally.
              */
             findOrCreate( options : FindOrInitializeOptions<TAttributes> ) : Promise<TInstance>;
+            
+            /**
+             * A more performant findOrCreate that will not work under a transaction (at least not in postgres)
+             * Will execute a find call, if empty then attempt to create, if unique constraint then attempt to find again
+             */
+            findCreateFind( options : FindCreateFindOptions<TAttributes> ) : Promise<TInstance>;
 
             /**
              * Insert or update a single row. An update will be executed if a row which matches the supplied values on
@@ -4532,6 +4708,12 @@ declare module "sequelize" {
              * replacements to replace `?` in your SQL.
              */
             replacements? : Object | string[];
+            
+            /**
+             * Either an object of named bind parameter in the format `$param` or an array of unnamed
+             * bind parameter to replace `$1`, `$2`, ... in your SQL.
+             */
+            bind?: Object | string[];
 
             /**
              * Force the query to use the write pool, regardless of the query type.
@@ -4554,9 +4736,30 @@ declare module "sequelize" {
              * A sequelize model used to build the returned model instances (used to be called callee)
              */
             model? : Model<any, any>;
-
+            
+            /**
+             * Set of flags that control when a query is automatically retried.
+             */
+            retry? : {match?: string[], max?: integer};
+            
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
+            
+            /**
+             * If false do not prepend the query with the search_path (Postgres only)
+             */
+	    supportsSearchPath : boolean;
+	    
+	    /**
+	     * Map returned fields to model's fields if `options.model` or `options.instance` is present.
+	     * Mapping will occur before building the model instance.
+	     */
+	    mapToModel : boolean;
+	    
             // TODO: force, cascade
-
+	    fieldMap? : { [key: string]: string; }
         }
 
         /**
@@ -6197,4 +6400,4 @@ declare module "sequelize" {
 
     export = sequelize;
 
-}
\ No newline at end of file
+}

From 35066584f8ed8fc9e9f3cdc5cfb2f79a75a7c4bd Mon Sep 17 00:00:00 2001
From: Dan Marshall <danmar@microsoft.com>
Date: Mon, 20 Jun 2016 11:45:30 -0700
Subject: [PATCH 199/278] removed duplicate header copy paste error

---
 opentype/opentype.d.ts | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/opentype/opentype.d.ts b/opentype/opentype.d.ts
index ff09104dfd..4e98b12ece 100644
--- a/opentype/opentype.d.ts
+++ b/opentype/opentype.d.ts
@@ -3,11 +3,6 @@
 // Definitions by: Dan Marshall <https://github.com/danmarshall>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-// Type definitions for opentype.js
-// Project: https://github.com/nodebox/opentype.js
-// Definitions by: Dan Marshall <https://github.com/danmarshall>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
-
 declare namespace opentypejs {
 
     interface Contour extends Array<Point> {

From 1dafe949f6aa2ba44cde014760bf71ff6169fadf Mon Sep 17 00:00:00 2001
From: Dan Marshall <danmar@microsoft.com>
Date: Mon, 20 Jun 2016 11:49:21 -0700
Subject: [PATCH 200/278] added module declaration

---
 opentype/opentype.d.ts | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/opentype/opentype.d.ts b/opentype/opentype.d.ts
index 4e98b12ece..fec42369a1 100644
--- a/opentype/opentype.d.ts
+++ b/opentype/opentype.d.ts
@@ -242,3 +242,7 @@ declare namespace opentypejs {
 }
 
 declare var opentype: typeof opentypejs;
+
+declare module "opentype.js" {
+    export = opentype;
+}

From 0d727a7f6389b971a146cee5ef5a68617a1e8ee7 Mon Sep 17 00:00:00 2001
From: Chris Robison <cdrobison@xactware.com>
Date: Mon, 20 Jun 2016 13:33:55 -0600
Subject: [PATCH 201/278] Exposing dropdown popup

---
 kendo-ui/kendo-ui.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/kendo-ui/kendo-ui.d.ts b/kendo-ui/kendo-ui.d.ts
index 29cb1527d6..934a8cd8b1 100644
--- a/kendo-ui/kendo-ui.d.ts
+++ b/kendo-ui/kendo-ui.d.ts
@@ -3335,6 +3335,7 @@ declare namespace kendo.ui {
         static fn: DropDownList;
 
         options: DropDownListOptions;
+        popup: kendo.ui.Popup;
 
         dataSource: kendo.data.DataSource;
         span: JQuery;

From 730d9bb40dba16b70f3f3e1fc06c2397e63b90d4 Mon Sep 17 00:00:00 2001
From: Mario Nebl <hello@herebecode.com>
Date: Mon, 20 Jun 2016 18:37:52 +0200
Subject: [PATCH 202/278] add resolve module

---
 resolve/resolve-tests.ts |  83 +++++++++++++++++++++++++++++++
 resolve/resolve.d.ts     | 102 +++++++++++++++++++++++++++++++++++++++
 2 files changed, 185 insertions(+)
 create mode 100644 resolve/resolve-tests.ts
 create mode 100644 resolve/resolve.d.ts

diff --git a/resolve/resolve-tests.ts b/resolve/resolve-tests.ts
new file mode 100644
index 0000000000..5922f3f0a8
--- /dev/null
+++ b/resolve/resolve-tests.ts
@@ -0,0 +1,83 @@
+/// <reference path="resolve.d.ts" />
+
+import * as fs from 'fs';
+import * as resolve from 'resolve';
+
+function test_basic_async() {
+  resolve('typescript', function(error, resolved) {
+    if (error) {
+      console.error(error.message);
+      return;
+    }
+    console.log(resolved);
+  });
+}
+
+function test_basic_sync() {
+  var resolved = resolve.sync('typescript');
+  console.log(resolved);
+}
+
+function test_options_async() {
+  resolve('typescript', {
+    basedir: process.cwd(),
+    package: {},
+    extensions: ['.js'],
+    packageFilter: function(pkg, pkgfile) {
+      return pkg;
+    },
+    pathFilter: function(pkg, path, relativePath) {
+      return path
+    },
+    paths: [process.cwd()],
+    moduleDirectory: 'node_modules',
+    readFile: fs.readFile,
+    isFile: function(file, cb) {
+      fs.stat(file, function(error, stat) {
+        if (error && error.code === 'ENOENT') {
+          return cb(null, false);
+        } else if (error) {
+          return cb(error);
+        } else {
+          return cb(null, stat.isFile());
+        }
+      });
+    }
+  }, function(error, resolved) {
+    if (error) {
+      console.error(error.message);
+      return;
+    }
+    console.log(resolved);
+  });
+}
+
+function test_options_sync() {
+  var resolved = resolve.sync('typescript', {
+    basedir: process.cwd(),
+    package: {},
+    extensions: ['.js'],
+    packageFilter: function(pkg, pkgfile) {
+      return pkg;
+    },
+    pathFilter: function(pkg, path, relativePath) {
+      return path
+    },
+    paths: [process.cwd()],
+    moduleDirectory: 'node_modules',
+    readFileSync: fs.readFileSync,
+    isFile: function(file) {
+      try {
+        return fs.statSync(file).isFile();
+      } catch (error) {
+        return false;
+      }
+    }
+  });
+  console.log(resolved);
+}
+
+function test_is_core() {
+  var fsIsCore = resolve.isCore('fs');
+  var typescriptIsCore = resolve.isCore('typescript');
+}
diff --git a/resolve/resolve.d.ts b/resolve/resolve.d.ts
new file mode 100644
index 0000000000..83082d7006
--- /dev/null
+++ b/resolve/resolve.d.ts
@@ -0,0 +1,102 @@
+// Type definitions for resolve
+// Project: https://github.com/substack/node-resolve
+// Definitions by: Mario Nebl <https://github.com/marionebl>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+
+declare module 'resolve' {
+  /**
+   * Callback invoked when resolving asynchronously
+   *
+   * @param error
+   * @param resolved Absolute path to resolved identifier
+   */
+  type resolveCallback = (err: Error, resolved?: string) => void;
+
+  /**
+   * Callback invoked when checking if a file exists
+   *
+   * @param error
+   * @param isFile If the given file exists
+   */
+  type isFileCallback = (err: Error, isFile?: boolean) => void;
+
+  /**
+   * Callback invoked when reading a file
+   *
+   * @param error
+   * @param isFile If the given file exists
+   */
+  type readFileCallback = (err: Error, file?: Buffer) => void;
+
+  /**
+   * Asynchronously resolve the module path string id into cb(err, res [, pkg]), where pkg (if defined) is the data from package.json
+   *
+   * @param id Identifier to resolve
+   * @param callback
+   */
+  function resolve(id: string, cb: resolveCallback): void;
+
+  /**
+   * Asynchronously resolve the module path string id into cb(err, res [, pkg]), where pkg (if defined) is the data from package.json
+   *
+   * @param id Identifier to resolve
+   * @param options Options to use for resolving, optional.
+   * @param callback
+   */
+  function resolve(id: string, opts: resolve.AsyncOpts, cb: resolveCallback): void;
+
+  /**
+   * Synchronously resolve the module path string id, returning the result and throwing an error when id can't be resolved.
+   *
+   * @param id Identifier to resolve
+   * @param options Options to use for resolving, optional.
+   */
+  function resolveSync(id: string, opts?: resolve.SyncOpts): string;
+
+  /**
+   * Return whether a package is in core
+   *
+   * @param id
+   */
+  function resolveIsCore(id: string): boolean;
+
+  namespace resolve {
+    interface Opts {
+      // directory to begin resolving from (defaults to __dirname)
+      basedir?: string;
+      // package.json data applicable to the module being loaded
+      package?: any;
+      // array of file extensions to search in order (defaults to ['.js'])
+      extensions?: string|string[];
+      // transform the parsed package.json contents before looking at the "main" field
+      packageFilter?: (pkg: any, pkgfile: string) => any;
+      // transform a path within a package
+      pathFilter?: (pkg: any, path: string, relativePath: string) => string;
+      // require.paths array to use if nothing is found on the normal node_modules recursive walk (probably don't use this)
+      paths?: string|string[];
+      // directory (or directories) in which to recursively look for modules. (default to 'node_modules')
+      moduleDirectory?: string|string[]
+    }
+    
+    export interface AsyncOpts extends Opts {
+      // how to read files asynchronously (defaults to fs.readFile)
+      readFile?: (file: string, cb: readFileCallback) => void;
+      // function to asynchronously test whether a file exists
+      isFile?: (file: string, cb: isFileCallback) => void;
+    }
+
+    export interface SyncOpts extends Opts {
+      // how to read files synchronously (defaults to fs.readFileSync)
+      readFileSync?: (file: string) => Buffer;
+      // function to synchronously test whether a file exists
+      isFile?: (file: string) => boolean;
+    }
+
+    export var sync: typeof resolveSync;
+    export var isCore: typeof resolveIsCore;
+  }
+  
+  export = resolve;
+}

From af71014144476cd8399d06e979acd9736e8be694 Mon Sep 17 00:00:00 2001
From: Eddie Antonio Santos <easantos@ualberta.ca>
Date: Mon, 20 Jun 2016 16:01:25 -0600
Subject: [PATCH 203/278] Fix bisectLeft function declaration

It should match the type signature of `bisectRight()`.
---
 d3/d3.d.ts | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/d3/d3.d.ts b/d3/d3.d.ts
index 6d4b43c0dc..b35d898522 100644
--- a/d3/d3.d.ts
+++ b/d3/d3.d.ts
@@ -1111,8 +1111,7 @@ declare namespace d3 {
     export function deviation(array: number[]): number;
     export function deviation<T>(array: T[], accessor: (datum: T, index: number) => number): number;
 
-    export function bisectLeft(array: number[], x: number, lo?: number, hi?: number): number;
-    export function bisectLeft(array: string[], x: string, lo?: number, hi?: number): number;
+    export function bisectLeft<T>(array: T[], x: T, lo?: number, hi?: number): number;
 
     export var bisect: typeof bisectRight;
 

From 60406f66b7bb838f8a1d0a0ce38a07300dc206f8 Mon Sep 17 00:00:00 2001
From: Matt Dwen <matt@group6.co.nz>
Date: Tue, 21 Jun 2016 10:36:16 +1200
Subject: [PATCH 204/278] HighchartsDataPoint radius percentages

The innerRadius and radius properties both allow percentage strings.
---
 highcharts/highcharts.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/highcharts/highcharts.d.ts b/highcharts/highcharts.d.ts
index c7584f4e0d..45f69a0bda 100644
--- a/highcharts/highcharts.d.ts
+++ b/highcharts/highcharts.d.ts
@@ -4954,7 +4954,7 @@ interface HighchartsDataPoint {
      * The inner radius of an individual point in a solid gauge. Can be given as a number (pixels) or percentage string.
      * @since 4.1.6
      */
-    innerRadius?: number;
+    innerRadius?: number|string;
     /**
      * When this property is true, the points acts as a summary column for the values added or substracted since the
      * last intermediate sum, or since the start of the series. The y value is ignored.
@@ -5005,7 +5005,7 @@ interface HighchartsDataPoint {
      * The outer radius of an individual point in a solid gauge. Can be given as a number (pixels) or percentage string.
      * @since 4.1.6
      */
-    radius?: number;
+    radius?: number|string;
     /**
      * Whether the data point is selected initially.
      * @default false

From da25c67fbe001816dea90c9fd510488076414817 Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Mon, 20 Jun 2016 22:53:38 +0000
Subject: [PATCH 205/278] Added browser-pack definition

---
 browser-pack/browser-pack-tests.ts | 33 ++++++++++++++++
 browser-pack/browser-pack.d.ts     | 63 ++++++++++++++++++++++++++++++
 2 files changed, 96 insertions(+)
 create mode 100644 browser-pack/browser-pack-tests.ts
 create mode 100644 browser-pack/browser-pack.d.ts

diff --git a/browser-pack/browser-pack-tests.ts b/browser-pack/browser-pack-tests.ts
new file mode 100644
index 0000000000..4cf20249e8
--- /dev/null
+++ b/browser-pack/browser-pack-tests.ts
@@ -0,0 +1,33 @@
+/// <reference path="browser-pack.d.ts" />
+
+import browserPack = require("browser-pack");
+
+module BrowserPackTest {
+
+    export function packIt(opts?: BrowserPack.Options) {
+        var packOpts: BrowserPack.Options = {
+            basedir: opts.basedir || "./",
+            externalRequireName: opts.externalRequireName || "require",
+            hasExports: opts.hasExports || false,
+            prelude: opts.prelude || undefined,
+            preludePath: opts.preludePath || undefined,
+            raw: opts.raw || false,
+            sourceMapPrefix: opts.sourceMapPrefix || '//#',
+            standalone: opts.standalone || undefined,
+            standaloneModule: opts.standaloneModule || undefined,
+        };
+
+        var res = browserPack(); // 'opts' are optional
+        var res2 = browserPack(packOpts);
+
+        // ensure return value is a stream
+        var res3 = res.pipe(res2);
+
+        res.on("error", function (err: any) {
+            console.error("browser-pack error: ", err);
+        });
+    }
+
+}
+
+export = BrowserPackTest;
\ No newline at end of file
diff --git a/browser-pack/browser-pack.d.ts b/browser-pack/browser-pack.d.ts
new file mode 100644
index 0000000000..bc06f014ed
--- /dev/null
+++ b/browser-pack/browser-pack.d.ts
@@ -0,0 +1,63 @@
+// Type definitions for browser-pack v6.0.1
+// Project: https://github.com/substack/browser-pack
+// Definitions by: TeamworkGuy2 <https://github.com/TeamworkGuy2>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+
+/** pack node-style source files from a json stream into a browser bundle
+ */
+declare module BrowserPack {
+
+    export interface Options {
+        /** Whether the bundle should include require= (or the opts.externalRequireName) so that
+         * require() is available outside the bundle
+         */
+        hasExports?: boolean;
+
+        /** A string to use in place of 'require' if opts.hasExports is specified, default is 'require'
+         */
+        externalRequireName?: string;
+
+        /** Specify a custom prelude, but know what you're doing first. See the prelude.js file in
+         * this repo for the default prelude. If you specify a custom prelude, you must also specify
+         * a valid opts.preludePath to the prelude source file for sourcemaps to work
+         */
+        prelude?: string;
+
+        /** prelude.js path if a custom opts.prelude is specified
+         */
+        preludePath?: string;
+
+        /** Used if opts.preludePath is undefined, this is used to resolve the prelude.js file location, default: 'process.cwd()'
+         */
+        basedir?: string;
+
+        /** if given, the writable end of the stream will expect objects to be written to
+         * it instead of expecting a stream of json text it will need to parse, default false
+         */
+        raw?: boolean;
+
+        /** External string name to use for UMD, if not provided, UMD declaration is not wrapped around output
+         */
+        standalone?: string;
+
+        /** Sets the internal module name to export for standalone
+         */
+        standaloneModule?: string;
+
+        /** If given and source maps are computed, the opts.sourceMapPrefix string will be used instead of default: '//#'
+         */
+        sourceMapPrefix?: string;
+    }
+
+}
+
+declare module "browser-pack" {
+    import stream = require("stream");
+
+    /** pack node-style source files from a json stream into a browser bundle
+     */
+    function browserPack(opts?: BrowserPack.Options): NodeJS.ReadWriteStream;
+    export = browserPack;
+}
\ No newline at end of file

From 3629661ac281f717087328226a9be23683c5daee Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Mon, 20 Jun 2016 23:12:04 +0000
Subject: [PATCH 206/278] remove unused import

---
 browser-pack/browser-pack.d.ts | 2 --
 1 file changed, 2 deletions(-)

diff --git a/browser-pack/browser-pack.d.ts b/browser-pack/browser-pack.d.ts
index bc06f014ed..52b96ce134 100644
--- a/browser-pack/browser-pack.d.ts
+++ b/browser-pack/browser-pack.d.ts
@@ -54,8 +54,6 @@ declare module BrowserPack {
 }
 
 declare module "browser-pack" {
-    import stream = require("stream");
-
     /** pack node-style source files from a json stream into a browser bundle
      */
     function browserPack(opts?: BrowserPack.Options): NodeJS.ReadWriteStream;

From 2148e9fdedb4a649afdd5ae357e34e72763cf497 Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Mon, 20 Jun 2016 23:20:30 +0000
Subject: [PATCH 207/278] Added exorcist definition

---
 exorcist/exorcist-tests.ts | 15 +++++++++++++++
 exorcist/exorcist.d.ts     | 21 +++++++++++++++++++++
 2 files changed, 36 insertions(+)
 create mode 100644 exorcist/exorcist-tests.ts
 create mode 100644 exorcist/exorcist.d.ts

diff --git a/exorcist/exorcist-tests.ts b/exorcist/exorcist-tests.ts
new file mode 100644
index 0000000000..26a1be0e07
--- /dev/null
+++ b/exorcist/exorcist-tests.ts
@@ -0,0 +1,15 @@
+/// <reference path="exorcist.d.ts" />
+
+import exorcist = require("exorcist");
+
+module ExorcistTest {
+
+    function pullSourceMaps(srcPath: string, projRoot: string) {
+        exorcist(srcPath, undefined, projRoot);
+        exorcist(srcPath, null, projRoot, null, true);
+        exorcist(srcPath, null, projRoot, "./");
+    }
+
+}
+
+export = ExorcistTest;
\ No newline at end of file
diff --git a/exorcist/exorcist.d.ts b/exorcist/exorcist.d.ts
new file mode 100644
index 0000000000..c9c576ac12
--- /dev/null
+++ b/exorcist/exorcist.d.ts
@@ -0,0 +1,21 @@
+// Type definitions for exorcist v3.7.x
+// Project: https://github.com/substack/watchify
+// Definitions by: TeamworkGuy2 <https://github.com/TeamworkGuy2>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../through/through.d.ts" />
+
+declare module 'exorcist' {
+    import through = require("through");
+
+    /** Externalizes the source map found inside a stream to an external .map file.
+     * Works with both JavaScript and CSS input streams
+     * @param file full path to the map file to which to write the extracted source map
+     * @param [url] full URL to the map file, set as sourceMappingURL in the streaming output (default: file)
+     * @param [root] root URL for loading relative source paths, set as sourceRoot in the source map (default: "")
+     * @param [base] base path for calculating relative source paths (default: use absolute paths)
+     * @param [errorOnMissing] when truthy, causes 'error' to be emitted instead of 'missing-map' if no map was found in the stream (default: falsey)
+     */
+    function exorcist(file: string, url?: string, root?: string, base?: string, errorOnMissing?: boolean): through.ThroughStream;
+    export = exorcist;
+}
\ No newline at end of file

From 26a66bf1ccef98ca42c433be84a6b2ba94a61c3d Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Mon, 20 Jun 2016 23:42:03 +0000
Subject: [PATCH 208/278] fixed definition version reference

---
 exorcist/exorcist.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/exorcist/exorcist.d.ts b/exorcist/exorcist.d.ts
index c9c576ac12..877a6c4061 100644
--- a/exorcist/exorcist.d.ts
+++ b/exorcist/exorcist.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for exorcist v3.7.x
+// Type definitions for exorcist v0.4.0
 // Project: https://github.com/substack/watchify
 // Definitions by: TeamworkGuy2 <https://github.com/TeamworkGuy2>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped

From 4c2ffae153ef7bc6e5c63b09466c5c22eac00eab Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Mon, 20 Jun 2016 23:56:39 +0000
Subject: [PATCH 209/278] project URL mistake

---
 exorcist/exorcist.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/exorcist/exorcist.d.ts b/exorcist/exorcist.d.ts
index 877a6c4061..89cc114f4b 100644
--- a/exorcist/exorcist.d.ts
+++ b/exorcist/exorcist.d.ts
@@ -1,5 +1,5 @@
 // Type definitions for exorcist v0.4.0
-// Project: https://github.com/substack/watchify
+// Project: https://github.com/substack/exorcist
 // Definitions by: TeamworkGuy2 <https://github.com/TeamworkGuy2>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 

From 896cef1e6a945526729118fd3230132c2a2da435 Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Mon, 20 Jun 2016 23:58:06 +0000
Subject: [PATCH 210/278] another project URL mistake

---
 exorcist/exorcist.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/exorcist/exorcist.d.ts b/exorcist/exorcist.d.ts
index 89cc114f4b..a60908915b 100644
--- a/exorcist/exorcist.d.ts
+++ b/exorcist/exorcist.d.ts
@@ -1,5 +1,5 @@
 // Type definitions for exorcist v0.4.0
-// Project: https://github.com/substack/exorcist
+// Project: https://github.com/thlorenz/exorcist
 // Definitions by: TeamworkGuy2 <https://github.com/TeamworkGuy2>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 

From 146cc62bf0ed533cd23e76538c47403046ecc530 Mon Sep 17 00:00:00 2001
From: remojansen <remo.jansen@wolksoftware.com>
Date: Tue, 21 Jun 2016 01:16:41 +0100
Subject: [PATCH 211/278] Added InversifyJS type definitions

---
 .../inversify-binding-decorators-tests.ts     | 159 +++++++
 .../inversify-binding-decorators.d.ts         |  55 +++
 .../inversify-express-utils-tests.ts          |  89 ++++
 .../inversify-express-utils.d.ts              |  49 ++
 .../inversify-logger-middleware-tests.ts      |  59 +++
 .../inversify-logger-middleware.d.ts          |  58 +++
 inversify/inversify-global-tests.ts           | 420 ++++++++++++++----
 inversify/inversify-tests.ts                  | 411 +++++++++++++----
 inversify/inversify.d.ts                      | 380 ++++++++++------
 9 files changed, 1386 insertions(+), 294 deletions(-)
 create mode 100644 inversify-binding-decorators/inversify-binding-decorators-tests.ts
 create mode 100644 inversify-binding-decorators/inversify-binding-decorators.d.ts
 create mode 100644 inversify-express-utils/inversify-express-utils-tests.ts
 create mode 100644 inversify-express-utils/inversify-express-utils.d.ts
 create mode 100644 inversify-logger-middleware/inversify-logger-middleware-tests.ts
 create mode 100644 inversify-logger-middleware/inversify-logger-middleware.d.ts

diff --git a/inversify-binding-decorators/inversify-binding-decorators-tests.ts b/inversify-binding-decorators/inversify-binding-decorators-tests.ts
new file mode 100644
index 0000000000..9b0dff520e
--- /dev/null
+++ b/inversify-binding-decorators/inversify-binding-decorators-tests.ts
@@ -0,0 +1,159 @@
+/// <reference path="./inversify-binding-decorators.d.ts" />
+
+import { inject, Kernel } from "inversify";
+import { autoProvide, makeProvideDecorator, makeFluentProvideDecorator } from "inversify-binding-decorators";
+
+module decorator {
+    let kernel = new Kernel();
+    let provide = makeProvideDecorator(kernel);
+
+    interface INinja {
+        fight(): string;
+        sneak(): string;
+    }
+
+    interface IKatana {
+        hit(): string;
+    }
+
+    interface IShuriken {
+        throw(): string;
+    }
+
+    let TYPE = {
+        IKatana: "IKatana",
+        INinja: "INinja",
+        IShuriken: "IShuriken"
+    };
+
+    @provide(TYPE.IKatana)
+    class Katana implements IKatana {
+        public hit() {
+            return "cut!";
+        }
+    }
+
+    @provide(TYPE.IShuriken)
+    class Shuriken implements IShuriken {
+        public throw() {
+            return "hit!";
+        }
+    }
+
+    @provide(TYPE.INinja)
+    class Ninja implements INinja {
+
+        private _katana: IKatana;
+        private _shuriken: IShuriken;
+
+        public constructor(
+            @inject("IKatana") katana: IKatana,
+            @inject("IShuriken") shuriken: IShuriken
+        ) {
+            this._katana = katana;
+            this._shuriken = shuriken;
+        }
+
+        public fight() { return this._katana.hit(); };
+        public sneak() { return this._shuriken.throw(); };
+
+    }
+
+    let ninja = kernel.get<INinja>(TYPE.INinja);
+    console.log(ninja);
+
+}
+
+module fluent_decorator {
+    let kernel = new Kernel();
+    let provide = makeFluentProvideDecorator(kernel);
+
+    let provideSingleton = function(identifier: string) {
+        return provide(identifier).inSingletonScope().done();
+    };
+
+    let provideTransient = function(identifier: string) {
+        return provide(identifier).done();
+    };
+
+    interface INinja {
+        fight(): string;
+        sneak(): string;
+    }
+
+    interface IKatana {
+        hit(): string;
+    }
+
+    interface IShuriken {
+        throw(): string;
+    }
+
+    let TYPE = {
+        IKatana: "IKatana",
+        INinja: "INinja",
+        IShuriken: "IShuriken"
+    };
+
+    @provideSingleton(TYPE.IKatana)
+    class Katana implements IKatana {
+        private _mark: any;
+        public constructor() {
+            this._mark = Math.random();
+        }
+        public hit() {
+            return "cut! " + this._mark;
+        }
+    }
+
+    @provideTransient(TYPE.IShuriken)
+    class Shuriken implements IShuriken {
+        private _mark: any;
+        public constructor() {
+            this._mark = Math.random();
+        }
+        public throw() {
+            return "hit! " + this._mark;
+        }
+    }
+
+    @provideTransient(TYPE.INinja)
+    class Ninja implements INinja {
+
+        private _katana: IKatana;
+        private _shuriken: IShuriken;
+
+        public constructor(
+            @inject("IKatana") katana: IKatana,
+            @inject("IShuriken") shuriken: IShuriken
+        ) {
+            this._katana = katana;
+            this._shuriken = shuriken;
+        }
+
+        public fight() { return this._katana.hit(); };
+        public sneak() { return this._shuriken.throw(); };
+
+    }
+
+    let ninja = kernel.get<INinja>(TYPE.INinja);
+    console.log(ninja);
+
+}
+
+module auto_provide {
+
+    let warriors = {
+        Ninja: class Ninja {},
+        Samurai: class Samurai {}
+    };
+
+    let weapons = {
+        Katana: class Katana {},
+        Shuriken: class Shuriken {},
+    };
+
+    let kernel = new Kernel();
+    autoProvide(kernel, warriors, weapons);
+
+}
diff --git a/inversify-binding-decorators/inversify-binding-decorators.d.ts b/inversify-binding-decorators/inversify-binding-decorators.d.ts
new file mode 100644
index 0000000000..623b6c32c7
--- /dev/null
+++ b/inversify-binding-decorators/inversify-binding-decorators.d.ts
@@ -0,0 +1,55 @@
+// Type definitions for inversify 1.0.0-beta.5
+// Project: https://github.com/inversify/inversify-binding-decorators
+// Definitions by: inversify <https://github.com/inversify/>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
+
+/// <reference path="../inversify/inversify.d.ts" />
+
+declare namespace inversifyBindingDecorators {
+
+    interface IProvideInSyntax<T> extends IProvideDoneSyntax<T> {
+        inSingletonScope(): IProvideWhenOnSyntax<T>;
+    }
+
+    interface IProvideDoneSyntax<T> {
+        done(): (target: any) => any;
+    }
+
+    interface IProvideOnSyntax<T> extends IProvideDoneSyntax<T> {
+        onActivation(fn: (context: inversify.interfaces.Context, injectable: T) => T): IProvideWhenSyntax<T>;
+    }
+
+    interface IProvideInWhenOnSyntax<T> extends IProvideInSyntax<T>, IProvideWhenSyntax<T>, IProvideOnSyntax<T> {}
+
+    interface IProvideWhenOnSyntax<T> extends IProvideWhenSyntax<T>, IProvideOnSyntax<T> {}
+
+    interface IProvideWhenSyntax<T> extends IProvideDoneSyntax<T> {
+        when(constraint: (request: inversify.interfaces.Request) => boolean): IProvideOnSyntax<T>;
+        whenTargetNamed(name: string): IProvideOnSyntax<T>;
+        whenTargetTagged(tag: string, value: any): IProvideOnSyntax<T>;
+        whenInjectedInto(parent: (Function|string)): IProvideOnSyntax<T>;
+        whenParentNamed(name: string): IProvideOnSyntax<T>;
+        whenParentTagged(tag: string, value: any): IProvideOnSyntax<T>;
+        whenAnyAncestorIs(ancestor: (Function|string)): IProvideOnSyntax<T>;
+        whenNoAncestorIs(ancestor: (Function|string)): IProvideOnSyntax<T>;
+        whenAnyAncestorNamed(name: string): IProvideOnSyntax<T>;
+        whenAnyAncestorTagged(tag: string, value: any): IProvideOnSyntax<T>;
+        whenNoAncestorNamed(name: string): IProvideOnSyntax<T>;
+        whenNoAncestorTagged(tag: string, value: any): IProvideOnSyntax<T>;
+        whenAnyAncestorMatches(constraint: (request: inversify.interfaces.Request) => boolean): IProvideOnSyntax<T>;
+        whenNoAncestorMatches(constraint: (request: inversify.interfaces.Request) => boolean): IProvideOnSyntax<T>;
+    }
+
+    export function autoProvide(kernel: inversify.interfaces.Kernel, ...modules: any[]): void;
+
+    export function makeProvideDecorator(kernel: inversify.interfaces.Kernel):
+        (serviceIdentifier: (string|Symbol|inversify.interfaces.Newable<any>)) => (target: any) => any;
+
+    export function makeFluentProvideDecorator(kernel: inversify.interfaces.Kernel):
+        (serviceIdentifier: (string|Symbol|inversify.interfaces.Newable<any>)) => IProvideInWhenOnSyntax<any>;
+
+}
+
+declare module "inversify-binding-decorators" {
+  export = inversifyBindingDecorators;
+}
diff --git a/inversify-express-utils/inversify-express-utils-tests.ts b/inversify-express-utils/inversify-express-utils-tests.ts
new file mode 100644
index 0000000000..1d421e397a
--- /dev/null
+++ b/inversify-express-utils/inversify-express-utils-tests.ts
@@ -0,0 +1,89 @@
+/// <reference path="./inversify-express-utils.d.ts" />
+
+import { InversifyExpressServer, Controller, Get, All, Delete, Head, Put, Patch, Post, Method } from "inversify-express-utils";
+import * as express from "express";
+import { Kernel } from "inversify";
+
+module server {
+    let kernel = new Kernel();
+    let server = new InversifyExpressServer(kernel);
+
+    server
+        .setConfig((app) => {
+            app.use((req: express.Request, res: express.Response, next: express.NextFunction) => {
+                console.log("hello world");
+                next();
+            });
+        })
+        .setErrorConfig((app) => {
+            app.use((err: any, req: express.Request, res: express.Response, next: express.NextFunction) => {
+                console.error(err.stack);
+                res.status(500).send("Something broke!");
+            });
+        })
+        .build()
+        .listen(3000, "localhost");
+}
+
+module decorators {
+
+    @Controller("/")
+    class TestController {
+
+        @Get("/")
+        public testGet() { return "GET"; }
+
+        @All("/")
+        public testAll() { return "ALL"; }
+
+        @Delete("/")
+        public testDelete() { return "DELETE"; }
+
+        @Head("/")
+        public testHead() { return "HEAD"; }
+
+        @Put("/")
+        public testPut() { return "PUT"; }
+
+        @Patch("/")
+        public testPatch() { return "PATCH"; }
+
+        @Post("/")
+        public testPost() { return "POST"; }
+
+        @Method("foo", "/")
+        public testMethod() { return "METHOD:FOO"; }
+    }
+
+    function m1(req: express.Request, res: express.Response, next: express.NextFunction) { next(); }
+    function m2(req: express.Request, res: express.Response, next: express.NextFunction) { next(); }
+    function m3(req: express.Request, res: express.Response, next: express.NextFunction) { next(); }
+
+    @Controller("/", m1, m2, m3)
+    class TestMiddlewareController {
+
+        @Get("/", m1, m2, m3)
+        public testGet() { return "GET"; }
+
+        @All("/", m1, m2, m3)
+        public testAll() { return "ALL"; }
+
+        @Delete("/", m1, m2, m3)
+        public testDelete() { return "DELETE"; }
+
+        @Head("/", m1, m2, m3)
+        public testHead() { return "HEAD"; }
+
+        @Put("/", m1, m2, m3)
+        public testPut() { return "PUT"; }
+
+        @Patch("/", m1, m2, m3)
+        public testPatch() { return "PATCH"; }
+
+        @Post("/", m1, m2, m3)
+        public testPost() { return "POST"; }
+
+        @Method("foo", "/", m1, m2, m3)
+        public testMethod() { return "METHOD:FOO"; }
+    }
+}
diff --git a/inversify-express-utils/inversify-express-utils.d.ts b/inversify-express-utils/inversify-express-utils.d.ts
new file mode 100644
index 0000000000..569f7cd549
--- /dev/null
+++ b/inversify-express-utils/inversify-express-utils.d.ts
@@ -0,0 +1,49 @@
+// Type definitions for inversify 1.0.0-alpha.4
+// Project: https://github.com/inversify/inversify-express-utils
+// Definitions by: inversify <https://github.com/inversify/>
+
+/// <reference path="../inversify/inversify.d.ts" />
+/// <reference path="../express/express.d.ts" />
+
+declare module "inversify-express-utils" {
+
+    import * as express from "express";
+    import * as inversify from "inversify";
+
+    interface IInversifyExpressServerConstructor {
+        new(kernel: inversify.interfaces.Kernel): IInversifyExpressServer;
+    }
+
+    interface IInversifyExpressServer {
+        setConfig(fn: IConfigFunction): IInversifyExpressServer;
+        setErrorConfig(fn: IConfigFunction): IInversifyExpressServer;
+        build(): express.Application;
+    }
+
+    interface IConfigFunction {
+        (app: express.Application): void;
+    }
+
+    interface IHandlerDecoratorFactory {
+        (path: string, ...middleware: express.RequestHandler[]): IHandlerDecorator;
+    }
+
+    interface IHandlerDecorator {
+        (target: any, key: string, value: any): void;
+    }
+
+    export interface IController {}
+
+    export var InversifyExpressServer: IInversifyExpressServerConstructor;
+
+    export var Controller: (path: string, ...middleware: express.RequestHandler[]) => (target: any) => void;
+
+    export var All: IHandlerDecoratorFactory;
+    export var Get: IHandlerDecoratorFactory;
+    export var Post: IHandlerDecoratorFactory;
+    export var Put: IHandlerDecoratorFactory;
+    export var Patch: IHandlerDecoratorFactory;
+    export var Head: IHandlerDecoratorFactory;
+    export var Delete: IHandlerDecoratorFactory;
+    export var Method: (method: string, path: string, ...middleware: express.RequestHandler[]) => IHandlerDecorator;
+}
diff --git a/inversify-logger-middleware/inversify-logger-middleware-tests.ts b/inversify-logger-middleware/inversify-logger-middleware-tests.ts
new file mode 100644
index 0000000000..c9c7d5c8a8
--- /dev/null
+++ b/inversify-logger-middleware/inversify-logger-middleware-tests.ts
@@ -0,0 +1,59 @@
+/// <reference path="./inversify-logger-middleware.d.ts" />
+
+declare var kernel: inversify.interfaces.Kernel;
+
+import { makeLoggerMiddleware, textSerializer } from "inversify-logger-middleware";
+
+interface ILoggerOutput<T> {
+    entry: T;
+}
+
+let makeStringRenderer = function (loggerOutput: ILoggerOutput<string>) {
+    return function (entry: inversifyLoggerMiddleware.ILogEntry) {
+        loggerOutput.entry = textSerializer(entry);
+    };
+};
+
+let makeObjRenderer = function (loggerOutput: ILoggerOutput<any>) {
+    return function (entry: inversifyLoggerMiddleware.ILogEntry) {
+        loggerOutput.entry = entry;
+    };
+};
+
+let options: inversifyLoggerMiddleware.ILoggerSettings = {
+    request: {
+        bindings: {
+            activated: true,
+            cache: true,
+            constraint: true,
+            dynamicValue: true,
+            factory: true,
+            implementationType: true,
+            onActivation: true,
+            provider: true,
+            scope: true,
+            serviceIdentifier: true,
+            type: true
+        },
+        serviceIdentifier: true,
+        target: {
+            metadata: true,
+            name: true,
+            serviceIdentifier: true
+        }
+    },
+    time: true
+};
+
+let logger = makeLoggerMiddleware();
+kernel.applyMiddleware(logger);
+
+let loggerOutput1: ILoggerOutput<string> = { entry: null };
+let stringRenderer1 = makeStringRenderer(loggerOutput1);
+let logger1 = makeLoggerMiddleware(options, stringRenderer1);
+kernel.applyMiddleware(logger1);
+
+let loggerOutput2: ILoggerOutput<inversifyLoggerMiddleware.ILogEntry> = { entry: null };
+let objRenderer2 = makeObjRenderer(loggerOutput2);
+let logger2 = makeLoggerMiddleware(options, objRenderer2);
+kernel.applyMiddleware(logger2);
diff --git a/inversify-logger-middleware/inversify-logger-middleware.d.ts b/inversify-logger-middleware/inversify-logger-middleware.d.ts
new file mode 100644
index 0000000000..87ce5c1c0f
--- /dev/null
+++ b/inversify-logger-middleware/inversify-logger-middleware.d.ts
@@ -0,0 +1,58 @@
+// Type definitions for inversify 1.0.0-beta.6
+// Project: https://github.com/inversify/inversify-logger-middleware
+// Definitions by: inversify <https://github.com/inversify/>
+
+/// <reference path="../inversify/inversify.d.ts"/>
+
+declare namespace inversifyLoggerMiddleware {
+
+    export interface ILoggerSettings {
+        request?: IRequestLoggerSettings;
+        time?: boolean;
+    }
+
+    export interface IRequestLoggerSettings {
+        serviceIdentifier?: boolean;
+        bindings?: IBindingLoggerSettings;
+        target?: ITargetLoggerSettings;
+    }
+
+    export interface IBindingLoggerSettings {
+        activated?: boolean;
+        serviceIdentifier?: boolean;
+        implementationType?: boolean;
+        factory?: boolean;
+        provider?: boolean;
+        constraint?: boolean;
+        onActivation?: boolean;
+        cache?: boolean;
+        dynamicValue?: boolean;
+        scope?: boolean;
+        type?: boolean;
+    }
+
+    export interface ITargetLoggerSettings {
+        serviceIdentifier?: boolean;
+        name?: boolean;
+        metadata?: boolean;
+    }
+
+    export interface ILogEntry {
+        error: boolean;
+        exception: any;
+        multiInject: boolean;
+        results: any[];
+        rootRequest: inversify.interfaces.Request;
+        serviceIdentifier: any;
+        target: any;
+        time: string;
+    }
+
+    export function makeLoggerMiddleware(settings?: ILoggerSettings, renderer?: (out: ILogEntry) => void): inversify.interfaces.Middleware;
+    export function textSerializer(entry: ILogEntry): string;
+
+}
+
+declare module "inversify-logger-middleware" {
+  export = inversifyLoggerMiddleware;
+}
diff --git a/inversify/inversify-global-tests.ts b/inversify/inversify-global-tests.ts
index c39b231b91..e2ead555d4 100644
--- a/inversify/inversify-global-tests.ts
+++ b/inversify/inversify-global-tests.ts
@@ -1,39 +1,65 @@
-/// <reference path="inversify.d.ts" />
+/// <reference path="./inversify.d.ts" />
+/// <reference path="../harmony-proxy/harmony-proxy.d.ts" />
 
-namespace global_module_test {
+let injectable = inversify.injectable;
+let inject = inversify.inject;
+let tagged = inversify.tagged;
+let named = inversify.named;
+let Kernel = inversify.Kernel;
+let KernelModule = inversify.KernelModule;
+let targetName = inversify.targetName;
+let multiInject = inversify.multiInject;
+let traverseAncerstors = inversify.traverseAncerstors;
+let taggedConstraint = inversify.taggedConstraint;
+let namedConstraint = inversify.namedConstraint;
+let typeConstraint = inversify.typeConstraint;
+let makePropertyMultiInjectDecorator = inversify.makePropertyMultiInjectDecorator;
+let makePropertyInjectTaggedDecorator = inversify.makePropertyInjectTaggedDecorator;
+let makePropertyInjectNamedDecorator = inversify.makePropertyInjectNamedDecorator;
+let makePropertyInjectDecorator = inversify.makePropertyInjectDecorator;
 
-    interface INinja {
+module external_module_test {
+
+    interface Warrior {
         fight(): string;
         sneak(): string;
     }
 
-    interface IKatana {
+    interface Weapon {
         hit(): string;
     }
 
-    interface IShuriken {
+    interface ThrowableWeapon extends Weapon {
         throw(): string;
     }
 
-    class Katana implements IKatana {
+    @injectable()
+    class Katana implements Weapon {
         public hit() {
             return "cut!";
         }
     }
 
-    class Shuriken implements IShuriken {
+    @injectable()
+    class Shuriken implements ThrowableWeapon {
         public throw() {
             return "hit!";
         }
+        public hit() {
+            return "hit!";
+        }
     }
 
-    @inversify.inject("IKatana", "IShuriken")
-    class Ninja implements INinja {
+    @injectable()
+    class Ninja implements Warrior {
 
-        private _katana: IKatana;
-        private _shuriken: IShuriken;
+        private _katana: Weapon;
+        private _shuriken: ThrowableWeapon;
 
-        public constructor(katana: IKatana, shuriken: IShuriken) {
+        public constructor(
+            @inject("Weapon") katana: Weapon,
+            @inject("ThrowableWeapon") shuriken: ThrowableWeapon
+        ) {
             this._katana = katana;
             this._shuriken = shuriken;
         }
@@ -43,62 +69,73 @@ namespace global_module_test {
 
     }
 
-    let kernel = new inversify.Kernel();
-    kernel.bind<INinja>("INinja").to(Ninja);
-    kernel.bind<IKatana>("IKatana").to(Katana);
-    kernel.bind<IShuriken>("IShuriken").to(Shuriken).inSingletonScope();
+    let kernel: inversify.interfaces.Kernel = new Kernel();
+    kernel.bind<Warrior>("Warrior").to(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Katana);
+    kernel.bind<ThrowableWeapon>("ThrowableWeapon").to(Shuriken).inSingletonScope();
 
-    let ninja = kernel.get<INinja>("INinja");
+    let ninja = kernel.get<Warrior>("Warrior");
     console.log(ninja);
 
     // Unbind
-    kernel.unbind("INinja");
+    kernel.unbind("Warrior");
     kernel.unbindAll();
 
     // Kernel modules
-    let module: inversify.IKernelModule = (k: inversify.IKernel) => {
-        k.bind<INinja>("INinja").to(Ninja);
-        k.bind<IKatana>("IKatana").to(Katana).inTransientScope();
-        k.bind<IShuriken>("IShuriken").to(Shuriken).inSingletonScope();
-    };
+    let warriors: inversify.interfaces.KernelModule = new KernelModule((bind: inversify.interfaces.Bind) => {
+        bind<Warrior>("Warrior").to(Ninja);
+    });
 
-    let options: inversify.IKernelOptions = {
-        middleware: [],
-        modules: [module]
-    };
+    let weapons: inversify.interfaces.KernelModule = new KernelModule((bind: inversify.interfaces.Bind) => {
+        bind<Weapon>("Weapon").to(Katana);
+        bind<ThrowableWeapon>("ThrowableWeapon").to(Shuriken);
+    });
 
-    kernel = new inversify.Kernel(options);
-    let ninja2 = kernel.get<INinja>("INinja");
+    kernel = new Kernel();
+    kernel.load(warriors, weapons);
+    let ninja2 = kernel.get<Warrior>("Warrior");
     console.log(ninja2);
 
+    // middleware
+    function logger(planAndResolve: inversify.interfaces.PlanAndResolve<any>): inversify.interfaces.PlanAndResolve<any> {
+        return (args: inversify.interfaces.PlanAndResolveArgs) => {
+            let start = new Date().getTime();
+            let result = planAndResolve(args);
+            let end = new Date().getTime();
+            console.log(end - start);
+            return result;
+        };
+    }
+
+    kernel.applyMiddleware(logger, logger);
+
     // binding types
-    kernel.bind<IKatana>("IKatana").to(Katana);
-    kernel.bind<IKatana>("IKatana").toValue(new Katana());
+    kernel.bind<Weapon>("Weapon").to(Katana);
+    kernel.bind<Weapon>("Weapon").toConstantValue(new Katana());
+    kernel.bind<Weapon>("Weapon").toDynamicValue(() => { return new Katana(); });
 
-    kernel.bind<inversify.INewable<IKatana>>("IKatana").toConstructor<IKatana>(Katana);
+    kernel.bind<inversify.interfaces.Newable<Weapon>>("Weapon").toConstructor<Weapon>(Katana);
 
-    kernel.bind<inversify.IFactory<IKatana>>("IKatana").toFactory<IKatana>((context) => {
+    kernel.bind<inversify.interfaces.Factory<Weapon>>("Weapon").toFactory<Weapon>((context) => {
         return () => {
-            return kernel.get<IKatana>("IKatana");
+            return kernel.get<Weapon>("Weapon");
         };
     });
 
-    kernel.bind<inversify.IFactory<IKatana>>("IKatana").toAutoFactory<IKatana>();
+    kernel.bind<inversify.interfaces.Factory<Weapon>>("Weapon").toAutoFactory<Weapon>("Weapon");
 
-    kernel.bind<inversify.IProvider<IKatana>>("IKatana").toProvider<IKatana>((context) => {
+    kernel.bind<inversify.interfaces.Provider<Weapon>>("Weapon").toProvider<Weapon>((context) => {
         return () => {
-            return new Promise<IKatana>((resolve) => {
-                let katana = kernel.get<IKatana>("IKatana");
+            return new Promise<Weapon>((resolve) => {
+                let katana = kernel.get<Weapon>("Weapon");
                 resolve(katana);
             });
         };
     });
 
-    kernel.bind<IKatana>("IKatana").to(Katana).proxy((katanaToBeInjected: IKatana) => {
-        // BLOCK http://stackoverflow.com/questions/35906938/how-to-enable-harmony-proxies-in-gulp-mocha
-        /*
+    kernel.bind<Weapon>("Weapon").to(Katana).onActivation((context: inversify.interfaces.Context, katanaToBeInjected: Weapon) => {
         let handler = {
-            apply: function(target, thisArgument, argumentsList) {
+            apply: function(target: any, thisArgument: any, argumentsList: any[]) {
                 console.log(`Starting: ${performance.now()}`);
                 let result = target.apply(thisArgument, argumentsList);
                 console.log(`Finished: ${performance.now()}`);
@@ -106,88 +143,301 @@ namespace global_module_test {
             }
         };
         return new Proxy(katanaToBeInjected, handler);
-        */
-        return katanaToBeInjected;
     });
 
-    interface IWeapon {}
-    interface ISamurai {
-        katana: IWeapon;
-        shuriken: IWeapon;
-    }
-
-    @inversify.inject("IWeapon", "IWeapon")
-    class Samurai implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai implements Warrior {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            @inversify.tagged("canThrow", false) katana: IWeapon,
-            @inversify.tagged("canThrow", true) shuriken: IWeapon
+            @inject("Weapon") @tagged("canThrow", false) katana: Weapon,
+            @inject("ThrowableWeapon") @tagged("canThrow", true) shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
     kernel.bind<Samurai>("Samurai").to(Samurai);
-    kernel.bind<IWeapon>("IWeapon").to(Katana).whenTargetTagged("canThrow", false);
-    kernel.bind<IWeapon>("IWeapon").to(Shuriken).whenTargetTagged("canThrow", true);
+    kernel.bind<Weapon>("IWeapon").to(Katana).whenTargetTagged("canThrow", false);
+    kernel.bind<ThrowableWeapon>("ThrowableWeapon").to(Shuriken).whenTargetTagged("canThrow", true);
 
-    let throwable = inversify.tagged("canThrow", true);
-    let notThrowable = inversify.tagged("canThrow", false);
+    let throwable = tagged("canThrow", true);
+    let notThrowable = tagged("canThrow", false);
 
-    @inversify.inject("IWeapon", "IWeapon")
-    class Samurai2 implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai2 implements Samurai {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            @throwable("canThrow", false) katana: IWeapon,
-            @notThrowable("canThrow", true) shuriken: IWeapon
+            @inject("Weapon") @throwable katana: Weapon,
+            @inject("ThrowableWeapon") @notThrowable shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
-    @inversify.inject("IWeapon", "IWeapon")
-    class Samurai3 implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai3 implements Samurai {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            @inversify.named("strong") katana: IWeapon,
-            @inversify.named("weak") shuriken: IWeapon
+            @inject("Weapon") @named("strong") katana: Weapon,
+            @inject("ThrowableWeapon") @named("weak") shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
-    kernel.bind<ISamurai>("ISamurai").to(Samurai3);
-    kernel.bind<IWeapon>("IWeapon").to(Katana).whenTargetNamed("strong");
-    kernel.bind<IWeapon>("IWeapon").to(Shuriken).whenTargetNamed("weak");
+    kernel.bind<Warrior>("Warrior").to(Samurai3);
+    kernel.bind<Weapon>("Weapon").to(Katana).whenTargetNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenTargetNamed("weak");
 
-    @inversify.inject("IWeapon", "IWeapon")
-    @inversify.paramNames("katana", "shuriken")
-    class Samurai4 implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai4 implements Samurai {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            katana: IWeapon,
-            shuriken: IWeapon
+            @inject("Weapon") @targetName("katana") katana: Weapon,
+            @inject("ThrowableWeapon") @targetName("shuriken") shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
-    kernel.bind<ISamurai>("ISamurai").to(Samurai4);
+    kernel.bind<Warrior>("Warrior").to(Samurai4);
 
-    kernel.bind<IWeapon>("IWeapon").to(Katana).when((request: inversify.IRequest) => {
+    kernel.bind<Weapon>("Weapon").to(Katana).when((request: inversify.interfaces.Request) => {
         return request.target.name.equals("katana");
     });
 
-    kernel.bind<IWeapon>("IWeapon").to(Shuriken).when((request: inversify.IRequest) => {
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when((request: inversify.interfaces.Request) => {
         return request.target.name.equals("shuriken");
     });
 
+    // custom constraints
+    let whenParentNamedCanThrowConstraint = (request: inversify.interfaces.Request) => {
+        return namedConstraint("canThrow")(request.parentRequest);
+    };
+
+    let whenAnyAncestorIsConstraint = (request: inversify.interfaces.Request) => {
+        return traverseAncerstors(request, typeConstraint(Ninja));
+    };
+
+    let whenAnyAncestorTaggedConstraint = (request: inversify.interfaces.Request) => {
+        return traverseAncerstors(request, taggedConstraint("canThrow")(true));
+    };
+
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when(whenParentNamedCanThrowConstraint);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when(whenAnyAncestorIsConstraint);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when(whenAnyAncestorTaggedConstraint);
+
+    // Constraint helpers
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenInjectedInto(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenInjectedInto("INinja");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenParentNamed("chinese");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenParentTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenTargetNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenTargetTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorIs(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorIs("INinja");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorMatches(whenParentNamedCanThrowConstraint);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorIs(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorIs("INinja");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorMatches(whenParentNamedCanThrowConstraint);
+
+    // multi-injection
+    @injectable()
+    class Samurai5 implements Warrior {
+        public katana: Weapon;
+        public shuriken: Weapon;
+        public constructor(
+            @multiInject("Weapon") wpns: Weapon[]
+        ) {
+            this.katana = wpns[0];
+            this.shuriken = wpns[1];
+        }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.hit(); };
+    }
+
+    // symbols
+    let SYMBOLS = {
+        ThrowableWeapon: Symbol("ThrowableWeapon"),
+        Warrior: Symbol("Warrior"),
+        Weapon: Symbol("Weapon"),
+    };
+
+    @injectable()
+    class Ninja1 implements Warrior {
+
+        private _katana: Weapon;
+        private _shuriken: ThrowableWeapon;
+
+        public constructor(
+            @inject(SYMBOLS.Weapon) katana: Weapon,
+            @inject(SYMBOLS.ThrowableWeapon) shuriken: ThrowableWeapon
+        ) {
+            this._katana = katana;
+            this._shuriken = shuriken;
+        }
+
+        public fight() { return this._katana.hit(); };
+        public sneak() { return this._shuriken.throw(); };
+
+    }
+
+    let kernel3 = new Kernel();
+    kernel3.bind<Warrior>(SYMBOLS.Warrior).to(Ninja);
+    kernel3.bind<Weapon>(SYMBOLS.Weapon).to(Katana);
+    kernel3.bind<ThrowableWeapon>(SYMBOLS.ThrowableWeapon).to(Shuriken).inSingletonScope();
+
+    let ninja4 = kernel3.get<Warrior>("Warrior");
+    console.log(ninja4);
+
+    // classes
+
+    @injectable()
+    class Ninja2 implements Warrior {
+
+        private _katana: Katana;
+        private _shuriken: Shuriken;
+
+        public constructor(
+            katana: Katana,
+            shuriken: Shuriken
+        ) {
+            this._katana = katana;
+            this._shuriken = shuriken;
+        }
+
+        public fight() { return this._katana.hit(); };
+        public sneak() { return this._shuriken.throw(); };
+
+    }
+
+    let kernel4 = new Kernel();
+    kernel4.bind<Ninja>(Ninja).to(Ninja);
+    kernel4.bind<Katana>(Katana).to(Katana);
+    kernel4.bind<Shuriken>(Shuriken).to(Shuriken).inSingletonScope();
+
+    let ninja5 = kernel4.get<Ninja>(Ninja);
+    console.log(ninja5);
+
+}
+
+module property_injection {
+
+    let kernel = new Kernel();
+
+    let TYPES = { Weapon: "Weapon" };
+
+    interface Weapon {
+        durability: number;
+        use(): void;
+    }
+
+    @injectable()
+    class Sword implements Weapon {
+        public durability: number;
+        public constructor() {
+            this.durability = 100;
+        }
+        public use() {
+            this.durability = this.durability - 10;
+        }
+    }
+
+    @injectable()
+    class WarHammer implements Weapon {
+        public durability: number;
+        public constructor() {
+            this.durability = 100;
+        }
+        public use() {
+            this.durability = this.durability - 10;
+        }
+    }
+
+    let propertyMultiInject = makePropertyMultiInjectDecorator(kernel);
+
+    class Warrior1 {
+        @propertyMultiInject(TYPES.Weapon)
+        public weapons: Weapon[];
+    }
+
+    let propertyInject = makePropertyInjectDecorator(kernel);
+
+    interface Service {
+        count: number;
+        increment(): void;
+    }
+
+    @injectable()
+    class SomeService implements Service {
+        public count: number;
+        public constructor() {
+            this.count = 0;
+        }
+        public increment() {
+            this.count = this.count + 1;
+        }
+    }
+
+    class SomeWebComponent {
+        @propertyInject("Service")
+        private _service: Service;
+        public doSomething() {
+            let count =  this._service.count;
+            this._service.increment();
+            return count;
+        }
+    }
+
+    let propertyInjectNammed = makePropertyInjectNamedDecorator(kernel);
+
+    class Warrior2 {
+
+        @propertyInjectNammed(TYPES.Weapon, "not-throwwable")
+        @named("not-throwwable")
+        public primaryWeapon: Weapon;
+
+        @propertyInjectNammed(TYPES.Weapon, "throwwable")
+        @named("throwwable")
+        public secondaryWeapon: Weapon;
+
+    }
+
+    let propertyInjectTagged = makePropertyInjectTaggedDecorator(kernel);
+
+    class Warrior3 {
+
+        @propertyInjectTagged(TYPES.Weapon, "throwwable", false)
+        @tagged("throwwable", false)
+        public primaryWeapon: Weapon;
+
+        @propertyInjectTagged(TYPES.Weapon, "throwwable", true)
+        @tagged("throwwable", true)
+        public secondaryWeapon: Weapon;
+
+    }
+
+    kernel.snapshot();
+    kernel.restore();
+
 }
diff --git a/inversify/inversify-tests.ts b/inversify/inversify-tests.ts
index 23af8db21f..9b5de8fa0e 100644
--- a/inversify/inversify-tests.ts
+++ b/inversify/inversify-tests.ts
@@ -1,46 +1,62 @@
-/// <reference path="inversify.d.ts" />
+/// <reference path="./inversify.d.ts" />
+/// <reference path="../harmony-proxy/harmony-proxy.d.ts" />
 
 import {
     Kernel,
-    inject, tagged, named, paramNames,
-    IKernel, IKernelOptions, INewable,
-    IKernelModule, IFactory, IProvider, IRequest
+    injectable, tagged, named, targetName,
+    inject, multiInject, traverseAncerstors,
+    taggedConstraint, namedConstraint, typeConstraint,
+    makePropertyMultiInjectDecorator,
+    makePropertyInjectTaggedDecorator,
+    makePropertyInjectNamedDecorator,
+    makePropertyInjectDecorator,
+    KernelModule, interfaces
 } from "inversify";
 
-namespace external_module_test {
+import * as Proxy from "harmony-proxy";
 
-    interface INinja {
+module external_module_test {
+
+    interface Warrior {
         fight(): string;
         sneak(): string;
     }
 
-    interface IKatana {
+    interface Weapon {
         hit(): string;
     }
 
-    interface IShuriken {
+    interface ThrowableWeapon extends Weapon {
         throw(): string;
     }
 
-    class Katana implements IKatana {
+    @injectable()
+    class Katana implements Weapon {
         public hit() {
             return "cut!";
         }
     }
 
-    class Shuriken implements IShuriken {
+    @injectable()
+    class Shuriken implements ThrowableWeapon {
         public throw() {
             return "hit!";
         }
+        public hit() {
+            return "hit!";
+        }
     }
 
-    @inject("IKatana", "IShuriken")
-    class Ninja implements INinja {
+    @injectable()
+    class Ninja implements Warrior {
 
-        private _katana: IKatana;
-        private _shuriken: IShuriken;
+        private _katana: Weapon;
+        private _shuriken: ThrowableWeapon;
 
-        public constructor(katana: IKatana, shuriken: IShuriken) {
+        public constructor(
+            @inject("Weapon") katana: Weapon,
+            @inject("ThrowableWeapon") shuriken: ThrowableWeapon
+        ) {
             this._katana = katana;
             this._shuriken = shuriken;
         }
@@ -50,62 +66,73 @@ namespace external_module_test {
 
     }
 
-    let kernel = new Kernel();
-    kernel.bind<INinja>("INinja").to(Ninja);
-    kernel.bind<IKatana>("IKatana").to(Katana);
-    kernel.bind<IShuriken>("IShuriken").to(Shuriken).inSingletonScope();
+    let kernel: interfaces.Kernel = new Kernel();
+    kernel.bind<Warrior>("Warrior").to(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Katana);
+    kernel.bind<ThrowableWeapon>("ThrowableWeapon").to(Shuriken).inSingletonScope();
 
-    let ninja = kernel.get<INinja>("INinja");
+    let ninja = kernel.get<Warrior>("Warrior");
     console.log(ninja);
 
     // Unbind
-    kernel.unbind("INinja");
+    kernel.unbind("Warrior");
     kernel.unbindAll();
 
     // Kernel modules
-    let module: IKernelModule = (k: IKernel) => {
-        k.bind<INinja>("INinja").to(Ninja);
-        k.bind<IKatana>("IKatana").to(Katana).inTransientScope();
-        k.bind<IShuriken>("IShuriken").to(Shuriken).inSingletonScope();
-    };
+    let warriors: interfaces.KernelModule = new KernelModule((bind: interfaces.Bind) => {
+        bind<Warrior>("Warrior").to(Ninja);
+    });
 
-    let options: IKernelOptions = {
-        middleware: [],
-        modules: [module]
-    };
+    let weapons: interfaces.KernelModule = new KernelModule((bind: interfaces.Bind) => {
+        bind<Weapon>("Weapon").to(Katana);
+        bind<ThrowableWeapon>("ThrowableWeapon").to(Shuriken);
+    });
 
-    kernel = new Kernel(options);
-    let ninja2 = kernel.get<INinja>("INinja");
+    kernel = new Kernel();
+    kernel.load(warriors, weapons);
+    let ninja2 = kernel.get<Warrior>("Warrior");
     console.log(ninja2);
 
+    // middleware
+    function logger(planAndResolve: interfaces.PlanAndResolve<any>): interfaces.PlanAndResolve<any> {
+        return (args: interfaces.PlanAndResolveArgs) => {
+            let start = new Date().getTime();
+            let result = planAndResolve(args);
+            let end = new Date().getTime();
+            console.log(end - start);
+            return result;
+        };
+    }
+
+    kernel.applyMiddleware(logger, logger);
+
     // binding types
-    kernel.bind<IKatana>("IKatana").to(Katana);
-    kernel.bind<IKatana>("IKatana").toValue(new Katana());
+    kernel.bind<Weapon>("Weapon").to(Katana);
+    kernel.bind<Weapon>("Weapon").toConstantValue(new Katana());
+    kernel.bind<Weapon>("Weapon").toDynamicValue(() => { return new Katana(); });
 
-    kernel.bind<INewable<IKatana>>("IKatana").toConstructor<IKatana>(Katana);
+    kernel.bind<interfaces.Newable<Weapon>>("Weapon").toConstructor<Weapon>(Katana);
 
-    kernel.bind<IFactory<IKatana>>("IKatana").toFactory<IKatana>((context) => {
+    kernel.bind<interfaces.Factory<Weapon>>("Weapon").toFactory<Weapon>((context) => {
         return () => {
-            return kernel.get<IKatana>("IKatana");
+            return kernel.get<Weapon>("Weapon");
         };
     });
 
-    kernel.bind<IFactory<IKatana>>("IKatana").toAutoFactory<IKatana>();
+    kernel.bind<interfaces.Factory<Weapon>>("Weapon").toAutoFactory<Weapon>("Weapon");
 
-    kernel.bind<IProvider<IKatana>>("IKatana").toProvider<IKatana>((context) => {
+    kernel.bind<interfaces.Provider<Weapon>>("Weapon").toProvider<Weapon>((context) => {
         return () => {
-            return new Promise<IKatana>((resolve) => {
-                let katana = kernel.get<IKatana>("IKatana");
+            return new Promise<Weapon>((resolve) => {
+                let katana = kernel.get<Weapon>("Weapon");
                 resolve(katana);
             });
         };
     });
 
-    kernel.bind<IKatana>("IKatana").to(Katana).proxy((katanaToBeInjected: IKatana) => {
-        // BLOCK http://stackoverflow.com/questions/35906938/how-to-enable-harmony-proxies-in-gulp-mocha
-        /*
+    kernel.bind<Weapon>("Weapon").to(Katana).onActivation((context: interfaces.Context, katanaToBeInjected: Weapon) => {
         let handler = {
-            apply: function(target, thisArgument, argumentsList) {
+            apply: function(target: any, thisArgument: any, argumentsList: any[]) {
                 console.log(`Starting: ${performance.now()}`);
                 let result = target.apply(thisArgument, argumentsList);
                 console.log(`Finished: ${performance.now()}`);
@@ -113,88 +140,302 @@ namespace external_module_test {
             }
         };
         return new Proxy(katanaToBeInjected, handler);
-        */
-        return katanaToBeInjected;
     });
 
-    interface IWeapon {}
-    interface ISamurai {
-        katana: IWeapon;
-        shuriken: IWeapon;
-    }
 
-    @inject("IWeapon", "IWeapon")
-    class Samurai implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai implements Warrior {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            @tagged("canThrow", false) katana: IWeapon,
-            @tagged("canThrow", true) shuriken: IWeapon
+            @inject("Weapon") @tagged("canThrow", false) katana: Weapon,
+            @inject("ThrowableWeapon") @tagged("canThrow", true) shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
     kernel.bind<Samurai>("Samurai").to(Samurai);
-    kernel.bind<IWeapon>("IWeapon").to(Katana).whenTargetTagged("canThrow", false);
-    kernel.bind<IWeapon>("IWeapon").to(Shuriken).whenTargetTagged("canThrow", true);
+    kernel.bind<Weapon>("IWeapon").to(Katana).whenTargetTagged("canThrow", false);
+    kernel.bind<ThrowableWeapon>("ThrowableWeapon").to(Shuriken).whenTargetTagged("canThrow", true);
 
     let throwable = tagged("canThrow", true);
     let notThrowable = tagged("canThrow", false);
 
-    @inject("IWeapon", "IWeapon")
-    class Samurai2 implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai2 implements Samurai {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            @throwable("canThrow", false) katana: IWeapon,
-            @notThrowable("canThrow", true) shuriken: IWeapon
+            @inject("Weapon") @throwable katana: Weapon,
+            @inject("ThrowableWeapon") @notThrowable shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
-    @inject("IWeapon", "IWeapon")
-    class Samurai3 implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai3 implements Samurai {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            @named("strong") katana: IWeapon,
-            @named("weak") shuriken: IWeapon
+            @inject("Weapon") @named("strong") katana: Weapon,
+            @inject("ThrowableWeapon") @named("weak") shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
-    kernel.bind<ISamurai>("ISamurai").to(Samurai3);
-    kernel.bind<IWeapon>("IWeapon").to(Katana).whenTargetNamed("strong");
-    kernel.bind<IWeapon>("IWeapon").to(Shuriken).whenTargetNamed("weak");
+    kernel.bind<Warrior>("Warrior").to(Samurai3);
+    kernel.bind<Weapon>("Weapon").to(Katana).whenTargetNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenTargetNamed("weak");
 
-    @inject("IWeapon", "IWeapon")
-    @paramNames("katana", "shuriken")
-    class Samurai4 implements ISamurai {
-        public katana: IWeapon;
-        public shuriken: IWeapon;
+    @injectable()
+    class Samurai4 implements Samurai {
+        public katana: Weapon;
+        public shuriken: ThrowableWeapon;
         public constructor(
-            katana: IWeapon,
-            shuriken: IWeapon
+            @inject("Weapon") @targetName("katana") katana: Weapon,
+            @inject("ThrowableWeapon") @targetName("shuriken") shuriken: ThrowableWeapon
         ) {
             this.katana = katana;
             this.shuriken = shuriken;
         }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.throw(); };
     }
 
-    kernel.bind<ISamurai>("ISamurai").to(Samurai4);
+    kernel.bind<Warrior>("Warrior").to(Samurai4);
 
-    kernel.bind<IWeapon>("IWeapon").to(Katana).when((request: IRequest) => {
+    kernel.bind<Weapon>("Weapon").to(Katana).when((request: interfaces.Request) => {
         return request.target.name.equals("katana");
     });
 
-    kernel.bind<IWeapon>("IWeapon").to(Shuriken).when((request: IRequest) => {
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when((request: interfaces.Request) => {
         return request.target.name.equals("shuriken");
     });
 
+    // custom constraints
+    let whenParentNamedCanThrowConstraint = (request: interfaces.Request) => {
+        return namedConstraint("canThrow")(request.parentRequest);
+    };
+
+    let whenAnyAncestorIsConstraint = (request: interfaces.Request) => {
+        return traverseAncerstors(request, typeConstraint(Ninja));
+    };
+
+    let whenAnyAncestorTaggedConstraint = (request: interfaces.Request) => {
+        return traverseAncerstors(request, taggedConstraint("canThrow")(true));
+    };
+
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when(whenParentNamedCanThrowConstraint);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when(whenAnyAncestorIsConstraint);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).when(whenAnyAncestorTaggedConstraint);
+
+    // Constraint helpers
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenInjectedInto(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenInjectedInto("INinja");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenParentNamed("chinese");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenParentTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenTargetNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenTargetTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorIs(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorIs("INinja");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenAnyAncestorMatches(whenParentNamedCanThrowConstraint);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorIs(Ninja);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorIs("INinja");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorNamed("strong");
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorTagged("canThrow", true);
+    kernel.bind<Weapon>("Weapon").to(Shuriken).whenNoAncestorMatches(whenParentNamedCanThrowConstraint);
+
+    // multi-injection
+    @injectable()
+    class Samurai5 implements Warrior {
+        public katana: Weapon;
+        public shuriken: Weapon;
+        public constructor(
+            @multiInject("Weapon") wpns: Weapon[]
+        ) {
+            this.katana = wpns[0];
+            this.shuriken = wpns[1];
+        }
+        public fight() { return this.katana.hit(); };
+        public sneak() { return this.shuriken.hit(); };
+    }
+
+    // symbols
+    let SYMBOLS = {
+        ThrowableWeapon: Symbol("ThrowableWeapon"),
+        Warrior: Symbol("Warrior"),
+        Weapon: Symbol("Weapon"),
+    };
+
+    @injectable()
+    class Ninja1 implements Warrior {
+
+        private _katana: Weapon;
+        private _shuriken: ThrowableWeapon;
+
+        public constructor(
+            @inject(SYMBOLS.Weapon) katana: Weapon,
+            @inject(SYMBOLS.ThrowableWeapon) shuriken: ThrowableWeapon
+        ) {
+            this._katana = katana;
+            this._shuriken = shuriken;
+        }
+
+        public fight() { return this._katana.hit(); };
+        public sneak() { return this._shuriken.throw(); };
+
+    }
+
+    let kernel3 = new Kernel();
+    kernel3.bind<Warrior>(SYMBOLS.Warrior).to(Ninja);
+    kernel3.bind<Weapon>(SYMBOLS.Weapon).to(Katana);
+    kernel3.bind<ThrowableWeapon>(SYMBOLS.ThrowableWeapon).to(Shuriken).inSingletonScope();
+
+    let ninja4 = kernel3.get<Warrior>("Warrior");
+    console.log(ninja4);
+
+    // classes
+
+    @injectable()
+    class Ninja2 implements Warrior {
+
+        private _katana: Katana;
+        private _shuriken: Shuriken;
+
+        public constructor(
+            katana: Katana,
+            shuriken: Shuriken
+        ) {
+            this._katana = katana;
+            this._shuriken = shuriken;
+        }
+
+        public fight() { return this._katana.hit(); };
+        public sneak() { return this._shuriken.throw(); };
+
+    }
+
+    let kernel4 = new Kernel();
+    kernel4.bind<Ninja>(Ninja).to(Ninja);
+    kernel4.bind<Katana>(Katana).to(Katana);
+    kernel4.bind<Shuriken>(Shuriken).to(Shuriken).inSingletonScope();
+
+    let ninja5 = kernel4.get<Ninja>(Ninja);
+    console.log(ninja5);
+
+}
+
+module property_injection {
+
+    let kernel = new Kernel();
+
+    let TYPES = { Weapon: "Weapon" };
+
+    interface Weapon {
+        durability: number;
+        use(): void;
+    }
+
+    @injectable()
+    class Sword implements Weapon {
+        public durability: number;
+        public constructor() {
+            this.durability = 100;
+        }
+        public use() {
+            this.durability = this.durability - 10;
+        }
+    }
+
+    @injectable()
+    class WarHammer implements Weapon {
+        public durability: number;
+        public constructor() {
+            this.durability = 100;
+        }
+        public use() {
+            this.durability = this.durability - 10;
+        }
+    }
+
+    let propertyMultiInject = makePropertyMultiInjectDecorator(kernel);
+
+    class Warrior1 {
+        @propertyMultiInject(TYPES.Weapon)
+        public weapons: Weapon[];
+    }
+
+    let propertyInject = makePropertyInjectDecorator(kernel);
+
+    interface Service {
+        count: number;
+        increment(): void;
+    }
+
+    @injectable()
+    class SomeService implements Service {
+        public count: number;
+        public constructor() {
+            this.count = 0;
+        }
+        public increment() {
+            this.count = this.count + 1;
+        }
+    }
+
+    class SomeWebComponent {
+        @propertyInject("Service")
+        private _service: Service;
+        public doSomething() {
+            let count =  this._service.count;
+            this._service.increment();
+            return count;
+        }
+    }
+
+    let propertyInjectNammed = makePropertyInjectNamedDecorator(kernel);
+
+    class Warrior2 {
+
+        @propertyInjectNammed(TYPES.Weapon, "not-throwwable")
+        @named("not-throwwable")
+        public primaryWeapon: Weapon;
+
+        @propertyInjectNammed(TYPES.Weapon, "throwwable")
+        @named("throwwable")
+        public secondaryWeapon: Weapon;
+
+    }
+
+    let propertyInjectTagged = makePropertyInjectTaggedDecorator(kernel);
+
+    class Warrior3 {
+
+        @propertyInjectTagged(TYPES.Weapon, "throwwable", false)
+        @tagged("throwwable", false)
+        public primaryWeapon: Weapon;
+
+        @propertyInjectTagged(TYPES.Weapon, "throwwable", true)
+        @tagged("throwwable", true)
+        public secondaryWeapon: Weapon;
+
+    }
+
+    kernel.snapshot();
+    kernel.restore();
+
 }
diff --git a/inversify/inversify.d.ts b/inversify/inversify.d.ts
index 79cd4e3dec..36e34a01a9 100644
--- a/inversify/inversify.d.ts
+++ b/inversify/inversify.d.ts
@@ -1,141 +1,273 @@
-// Type definitions for inversify 2.0.0-alpha.3
+// Type definitions for inversify 2.0.0-beta.9
 // Project: https://github.com/inversify/InversifyJS
 // Definitions by: inversify <https://github.com/inversify>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
 
 /// <reference path="../bluebird/bluebird.d.ts" />
 
+interface Symbol {
+    toString(): string;
+    valueOf(): Object;
+}
+
+interface SymbolConstructor {
+    (description?: string|number): Symbol;
+}
+
+declare var Symbol: SymbolConstructor;
+
 declare namespace inversify {
 
-    interface IKernelConstructor {
-        new(options?: IKernelOptions): IKernel;
+    namespace interfaces {
+
+        export interface KernelConstructor {
+            new(): Kernel;
+        }
+
+        export interface KernelModuleConstructor {
+            new(registry: (bind: Bind) => void): KernelModule;
+        }
+
+        export interface Newable<T> {
+            new(...args: any[]): T;
+        }
+
+        export type ServiceIdentifier<T> = (string|Symbol|Newable<T>);
+
+        export interface Binding<T> extends Clonable<Binding<T>> {
+            guid: string;
+            moduleId: string;
+            activated: boolean;
+            serviceIdentifier: ServiceIdentifier<T>;
+            implementationType: Newable<T>;
+            factory: FactoryCreator<any>;
+            provider: ProviderCreator<any>;
+            constraint: (request: Request) => boolean;
+            onActivation: (context: Context, injectable: T) => T;
+            cache: T;
+            dynamicValue: () => T;
+            scope: number; // BindingScope
+            type: number; // BindingType
+        }
+
+        export interface Factory<T> extends Function {
+            (...args: any[]): (((...args: any[]) => T)|T);
+        }
+
+        export interface FactoryCreator<T> extends Function {
+            (context: Context): Factory<T>;
+        }
+
+        export interface Provider<T> extends Function {
+            (): Promise<T>;
+        }
+
+        export interface ProviderCreator<T> extends Function {
+            (context: Context): Provider<T>;
+        }
+
+        export interface PlanAndResolve<T> {
+            (args: PlanAndResolveArgs): T[];
+        }
+
+        export interface PlanAndResolveArgs {
+            multiInject: boolean;
+            serviceIdentifier: (string|Symbol|Newable<any>);
+            target: Target;
+            contextInterceptor: (contexts: Context) => Context;
+        }
+
+        export interface Middleware extends Function {
+            (next: PlanAndResolve<any>): PlanAndResolve<any>;
+        }
+
+        export interface Context {
+            guid: string;
+            kernel: Kernel;
+            plan: Plan;
+            addPlan(plan: Plan): void;
+        }
+
+        export interface ReflectResult {
+            [key: string]: Metadata[];
+        }
+
+        export interface Metadata {
+            key: string;
+            value: any;
+        }
+
+        export interface Plan {
+            parentContext: Context;
+            rootRequest: Request;
+        }
+
+        export interface Planner {
+            createContext(kernel: Kernel): Context;
+            createPlan(parentContext: Context, binding: Binding<any>, target: Target): Plan;
+            getBindings<T>(kernel: Kernel, serviceIdentifier: ServiceIdentifier<T>): Binding<T>[];
+            getActiveBindings(parentRequest: Request, target: Target): Binding<any>[];
+        }
+
+        export interface QueryableString {
+            startsWith(searchString: string): boolean;
+            endsWith(searchString: string): boolean;
+            contains(searchString: string): boolean;
+            equals(compareString: string): boolean;
+            value(): string;
+        }
+
+        export interface Request {
+            guid: string;
+            serviceIdentifier: (string|Symbol|Newable<any>);
+            parentContext: Context;
+            parentRequest: Request;
+            childRequests: Request[];
+            target: Target;
+            bindings: Binding<any>[];
+            addChildRequest(
+                serviceIdentifier: (string|Symbol|Newable<any>),
+                bindings: (Binding<any>|Binding<any>[]),
+                target: Target
+            ): Request;
+        }
+
+        export interface Target {
+            guid: string;
+            serviceIdentifier: (string|Symbol|Newable<any>);
+            name: QueryableString;
+            metadata: Array<Metadata>;
+            hasTag(key: string): boolean;
+            isArray(): boolean;
+            matchesArray(name: string|Symbol|any): boolean;
+            isNamed(): boolean;
+            isTagged(): boolean;
+            matchesNamedTag(name: string): boolean;
+            matchesTag(key: string): (value: any) => boolean;
+        }
+
+        export interface Resolver {
+            resolve<T>(context: Context): T;
+        }
+
+        export interface Kernel {
+            guid: string;
+            bind<T>(serviceIdentifier: ServiceIdentifier<T>): BindingToSyntax<T>;
+            unbind(serviceIdentifier: ServiceIdentifier<any>): void;
+            unbindAll(): void;
+            isBound(serviceIdentifier: ServiceIdentifier<any>): boolean;
+            get<T>(serviceIdentifier: ServiceIdentifier<T>): T;
+            getNamed<T>(serviceIdentifier: ServiceIdentifier<T>, named: string): T;
+            getTagged<T>(serviceIdentifier: ServiceIdentifier<T>, key: string, value: any): T;
+            getAll<T>(serviceIdentifier: ServiceIdentifier<T>): T[];
+            load(...modules: KernelModule[]): void;
+            unload(...modules: KernelModule[]): void;
+            applyMiddleware(...middleware: Middleware[]): void;
+            getServiceIdentifierAsString(serviceIdentifier: ServiceIdentifier<any>): string;
+            snapshot(): void;
+            restore(): void;
+        }
+
+        export interface Bind extends Function {
+            <T>(serviceIdentifier: ServiceIdentifier<T>): BindingToSyntax<T>;
+        }
+
+        export interface KernelModule {
+            guid: string;
+            registry: (bind: Bind) => void;
+        }
+
+        export interface KernelSnapshot {
+            bindings: Lookup<Binding<any>>;
+            middleware: PlanAndResolve<any>;
+        }
+
+        export interface Clonable<T> {
+            clone(): T;
+        }
+
+        export interface Lookup<T> extends Clonable<Lookup<T>> {
+            add(serviceIdentifier: (string|Symbol|any), value: T): void;
+            get(serviceIdentifier: (string|Symbol|any)): Array<T>;
+            remove(serviceIdentifier: (string|Symbol|any)): void;
+            removeByModuleId(moduleId: string): void;
+            hasKey(serviceIdentifier: (string|Symbol|any)): boolean;
+        }
+
+        export interface KeyValuePair<T> {
+            serviceIdentifier: (string|Symbol|any);
+            value: Array<T>;
+        }
+
+        export interface BindingInSyntax<T> {
+            inSingletonScope(): BindingWhenOnSyntax<T>;
+        }
+
+        export interface BindingInWhenOnSyntax<T> extends BindingInSyntax<T>, BindingWhenOnSyntax<T> {}
+
+        export interface BindingOnSyntax<T> {
+            onActivation(fn: (context: Context, injectable: T) => T): BindingWhenSyntax<T>;
+        }
+
+        export interface BindingToSyntax<T> {
+            to(constructor: { new(...args: any[]): T; }): BindingInWhenOnSyntax<T>;
+            toConstantValue(value: T): BindingWhenOnSyntax<T>;
+            toDynamicValue(func: () => T): BindingWhenOnSyntax<T>;
+            toConstructor<T2>(constructor: Newable<T2>): BindingWhenOnSyntax<T>;
+            toFactory<T2>(factory: FactoryCreator<T2>): BindingWhenOnSyntax<T>;
+            toFunction(func: T): BindingWhenOnSyntax<T>;
+            toAutoFactory<T2>(serviceIdentifier: (string|Symbol|Newable<T2>)): BindingWhenOnSyntax<T>;
+            toProvider<T2>(provider: ProviderCreator<T2>): BindingWhenOnSyntax<T>;
+        }
+
+        export interface BindingWhenOnSyntax<T> extends BindingWhenSyntax<T>, BindingOnSyntax<T> {}
+
+        export interface BindingWhenSyntax<T> {
+            when(constraint: (request: Request) => boolean): BindingOnSyntax<T>;
+            whenTargetNamed(name: string): BindingOnSyntax<T>;
+            whenTargetTagged(tag: string, value: any): BindingOnSyntax<T>;
+            whenInjectedInto(parent: (Function|string)): BindingOnSyntax<T>;
+            whenParentNamed(name: string): BindingOnSyntax<T>;
+            whenParentTagged(tag: string, value: any): BindingOnSyntax<T>;
+            whenAnyAncestorIs(ancestor: (Function|string)): BindingOnSyntax<T>;
+            whenNoAncestorIs(ancestor: (Function|string)): BindingOnSyntax<T>;
+            whenAnyAncestorNamed(name: string): BindingOnSyntax<T>;
+            whenAnyAncestorTagged(tag: string, value: any): BindingOnSyntax<T>;
+            whenNoAncestorNamed(name: string): BindingOnSyntax<T>;
+            whenNoAncestorTagged(tag: string, value: any): BindingOnSyntax<T>;
+            whenAnyAncestorMatches(constraint: (request: Request) => boolean): BindingOnSyntax<T>;
+            whenNoAncestorMatches(constraint: (request: Request) => boolean): BindingOnSyntax<T>;
+        }
+
     }
 
-    export interface IKernel {
-        bind<T>(runtimeIdentifier: string): IBindingToSyntax<T>;
-        unbind(runtimeIdentifier: string): void;
-        unbindAll(): void;
-        get<T>(runtimeIdentifier: string): T;
-        getAll<T>(runtimeIdentifier: string): T[];
-    }
+    export var Kernel: interfaces.KernelConstructor;
+    export var KernelModule: interfaces.KernelModuleConstructor;
+    export var decorate: (decorator: (ClassDecorator|ParameterDecorator), target: any, parameterIndex?: number) => void;
+    export function injectable(): (typeConstructor: any) => void;
+    export function tagged(metadataKey: string, metadataValue: any): (target: any, targetKey: string, index?: number) => any;
+    export function named(name: string): (target: any, targetKey: string, index?: number) => any;
+    export function targetName(name: string): (target: any, targetKey: string, index: number) => any;
+    export function inject(serviceIdentifier: (string|Symbol|any)): (target: any, targetKey: string, index?: number) => any;
+    export function multiInject(serviceIdentifier: (string|Symbol|any)): (target: any, targetKey: string, index?: number) => any;
 
-    export interface IKernelOptions {
-        middleware?: IMiddleware[];
-        modules?: IKernelModule[];
-    }
+    export function makePropertyInjectDecorator(kernel: interfaces.Kernel):
+        (serviceIdentifier: (string|Symbol|interfaces.Newable<any>)) => (proto: any, key: string) => void;
 
-    interface IMiddleware extends Function {
-        (...args: any[]): any;
-    }
+    export function makePropertyInjectNamedDecorator(kernel: interfaces.Kernel):
+        (serviceIdentifier: (string|Symbol|interfaces.Newable<any>), named: string) => (proto: any, key: string) => void;
 
-    export interface IKernelModule extends Function {
-        (kernel: IKernel): void;
-    }
+    export function makePropertyInjectTaggedDecorator(kernel: interfaces.Kernel):
+        (serviceIdentifier: (string|Symbol|interfaces.Newable<any>), key: string, value: any) => (proto: any, propertyName: string) => void;
 
-    interface IBindingToSyntax<T> {
-        to(constructor: { new(...args: any[]): T; }): IBindingInWhenProxySyntax<T>;
-        toValue(value: T): IBindingInWhenProxySyntax<T>;
-        toConstructor<T2>(constructor: INewable<T2>): IBindingInWhenProxySyntax<T>;
-        toFactory<T2>(factory: IFactoryCreator<T2>): IBindingInWhenProxySyntax<T>;
-        toAutoFactory<T2>(): IBindingInWhenProxySyntax<T>;
-        toProvider<T2>(provider: IProviderCreator<T2>): IBindingInWhenProxySyntax<T>;
-    }
+    export function makePropertyMultiInjectDecorator(kernel: interfaces.Kernel):
+        (serviceIdentifier: (string|Symbol|interfaces.Newable<any>)) => (proto: any, key: string) => void;
 
-    interface IBindingInWhenProxySyntax<T> {
-        inTransientScope(): IBindingInWhenProxySyntax<T>;
-        inSingletonScope(): IBindingInWhenProxySyntax<T>;
-        when(constraint: (request: IRequest) => boolean): IBindingInWhenProxySyntax<T>;
-        whenTargetNamed(name: string): IBindingInWhenProxySyntax<T>;
-        whenTargetTagged(tag: string, value: any): IBindingInWhenProxySyntax<T>;
-        proxy(fn: (injectable: T) => T): IBindingInWhenProxySyntax<T>;
-    }
-
-    export interface IFactory<T> extends Function {
-        (): T;
-    }
-
-    interface IFactoryCreator<T> extends Function {
-        (context: IContext): IFactory<T>;
-    }
-
-    export interface INewable<T> {
-        new(...args: any[]): T;
-    }
-
-    export interface IProvider<T> extends Function {
-        (): Promise<T>;
-    }
-
-    interface IProviderCreator<T> extends Function {
-        (context: IContext): IProvider<T>;
-    }
-
-    export interface IContext {
-        kernel: IKernel;
-        plan: IPlan;
-        addPlan(plan: IPlan): void;
-    }
-
-    export interface IPlan {
-        parentContext: IContext;
-        rootRequest: IRequest;
-    }
-
-    export interface IRequest {
-        service: string;
-        parentContext: IContext;
-        parentRequest: IRequest;
-        childRequests: IRequest[];
-        target: ITarget;
-        bindings: IBinding<any>[];
-        addChildRequest(
-            service: string,
-            bindings: (IBinding<any>|IBinding<any>[]),
-            target: ITarget): IRequest;
-    }
-
-    export interface IBinding<T> {
-        runtimeIdentifier: string;
-        implementationType: INewable<T>;
-        factory: IFactoryCreator<any>;
-        provider: IProviderCreator<any>;
-        constraint: (request: IRequest) => boolean;
-        proxyMaker: (injectable: T) => T;
-        cache: T;
-        scope: number; // BindingScope
-        type: number; // BindingType
-    }
-
-    export interface ITarget {
-        service: IQueryableString;
-        name: IQueryableString;
-        metadata: Array<IMetadata>;
-        isArray(): boolean;
-        isNamed(): boolean;
-        isTagged(): boolean;
-        matchesName(name: string): boolean;
-        matchesTag(name: IMetadata): boolean;
-    }
-
-    export interface IQueryableString {
-        startsWith(searchString: string): boolean;
-        endsWith(searchString: string): boolean;
-        contains(searchString: string): boolean;
-        equals(compareString: string): boolean;
-        value(): string;
-    }
-
-    export interface IMetadata {
-        key: string;
-        value: any;
-    }
-
-    export var Kernel: IKernelConstructor;
-    export var decorate: any;
-    export function inject(...typeIdentifiers: string[]): (typeConstructor: any) => void;
-    export var tagged: any;
-    export var named: any;
-    export var paramNames: any;
+    // constraint helpers
+    export var traverseAncerstors: (request: interfaces.Request, constraint: (request: interfaces.Request) => boolean) => boolean;
+    export var taggedConstraint: (tag: string) => (value: any) => (request: interfaces.Request) => boolean;
+    export var namedConstraint: (value: any) => (request: interfaces.Request) => boolean;
+    export var typeConstraint: (type: (Function|string)) => (request: interfaces.Request) => boolean;
 }
 
 declare module "inversify" {

From 9523296b7637472cf3b7d3acded63aba911d40d1 Mon Sep 17 00:00:00 2001
From: remojansen <remo.jansen@wolksoftware.com>
Date: Tue, 21 Jun 2016 01:23:20 +0100
Subject: [PATCH 212/278] Added missing // Definitions

---
 inversify-express-utils/inversify-express-utils.d.ts         | 1 +
 inversify-logger-middleware/inversify-logger-middleware.d.ts | 1 +
 2 files changed, 2 insertions(+)

diff --git a/inversify-express-utils/inversify-express-utils.d.ts b/inversify-express-utils/inversify-express-utils.d.ts
index 569f7cd549..aa9a20d23c 100644
--- a/inversify-express-utils/inversify-express-utils.d.ts
+++ b/inversify-express-utils/inversify-express-utils.d.ts
@@ -1,6 +1,7 @@
 // Type definitions for inversify 1.0.0-alpha.4
 // Project: https://github.com/inversify/inversify-express-utils
 // Definitions by: inversify <https://github.com/inversify/>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
 
 /// <reference path="../inversify/inversify.d.ts" />
 /// <reference path="../express/express.d.ts" />
diff --git a/inversify-logger-middleware/inversify-logger-middleware.d.ts b/inversify-logger-middleware/inversify-logger-middleware.d.ts
index 87ce5c1c0f..3aa4ccca18 100644
--- a/inversify-logger-middleware/inversify-logger-middleware.d.ts
+++ b/inversify-logger-middleware/inversify-logger-middleware.d.ts
@@ -1,6 +1,7 @@
 // Type definitions for inversify 1.0.0-beta.6
 // Project: https://github.com/inversify/inversify-logger-middleware
 // Definitions by: inversify <https://github.com/inversify/>
+// Definitions: https://github.com/borisyankov/DefinitelyTyped
 
 /// <reference path="../inversify/inversify.d.ts"/>
 

From 8118fe6ed5b58856810c2dd4572dbd430e7c8305 Mon Sep 17 00:00:00 2001
From: spacejack <spacejack@gmail.com>
Date: Mon, 20 Jun 2016 20:59:55 -0400
Subject: [PATCH 213/278] Use jsdoc to mark deprecated Matrix methods,
 corrected MeshLambertMaterial.emissive type, added MeshPhysicalMaterial.

---
 threejs/three.d.ts | 115 +++++++++++++++++++++++++++++++--------------
 1 file changed, 80 insertions(+), 35 deletions(-)

diff --git a/threejs/three.d.ts b/threejs/three.d.ts
index 2e70ee9910..c7a36b3234 100644
--- a/threejs/three.d.ts
+++ b/threejs/three.d.ts
@@ -1277,7 +1277,7 @@ declare namespace THREE {
      */
     export class InstancedBufferAttribute extends BufferAttribute {
         constructor(data: ArrayLike<number>, itemSize: number, meshPerAttribute?: number);
-        
+
         meshPerAttribute: number;
 
         clone(): InstancedBufferAttribute;
@@ -1292,7 +1292,7 @@ declare namespace THREE {
 
         groups: {start:number, count:number, instances:number}[];
         maxInstancedCount: number;
-        
+
         addGroup(start: number, count: number, instances: number): void;
         clone(): InstancedBufferGeometry;
         copy(source: InstancedBufferGeometry): InstancedBufferGeometry;
@@ -1326,7 +1326,7 @@ declare namespace THREE {
      */
     export class InstancedInterleavedBuffer extends InterleavedBuffer {
         constructor(array: ArrayLike<number>, stride: number, meshPerAttribute?: number);
-        
+
         meshPerAttribute: number;
 
         clone(): InstancedInterleavedBuffer;
@@ -1672,7 +1672,7 @@ declare namespace THREE {
         params: RaycasterParameters;
         precision: number;
         linePrecision: number;
-        
+
         set(origin: Vector3, direction: Vector3): void;
         setFromCamera(coords: { x: number; y: number;}, camera: Camera ): void;
         intersectObject(object: Object3D, recursive?: boolean): Intersection[];
@@ -2445,7 +2445,7 @@ declare namespace THREE {
         constructor(parameters?: MeshLambertMaterialParameters);
 
         color: Color;
-        emissive: number|string;
+        emissive: Color;
         emissiveIntensity: number;
         emissiveMap: Texture;
         map: Texture;
@@ -2553,6 +2553,25 @@ declare namespace THREE {
         copy(source: MeshStandardMaterial): MeshStandardMaterial;
     }
 
+    export interface MeshPhysicalMaterialParameters extends MeshStandardMaterialParameters {
+        reflectivity?: number;
+        clearCoat?: number;
+        clearCoatRoughness?: number;
+    }
+
+    export class MeshPhysicalMaterial extends MeshStandardMaterial {
+        constructor(parameters?: MeshPhysicalMaterialParameters);
+
+        defines: any;
+        reflectivity: number;
+        clearCoat: number;
+        clearCoatRoughness: number;
+
+        setValues(parameters: MeshPhysicalMaterialParameters): void;
+        clone(): MeshPhysicalMaterial;
+        copy(source: MeshPhysicalMaterial): MeshPhysicalMaterial;
+    }
+
     export interface MeshNormalMaterialParameters extends MaterialParameters {
         /** Render geometry as wireframe. Default is false (i.e. render as smooth shaded). */
         wireframe?: boolean;
@@ -2839,7 +2858,7 @@ declare namespace THREE {
         applyMatrix4(matrix: Matrix4): Box3;
         translate(offset: Vector3): Box3;
         equals(box: Box3): boolean;
-        
+
         empty(): any; // deprecated, use isEmpty()
         isIntersectionBox(b: any): any; // deprecated, use intersectsBox()
         isIntersectionSphere(s: any): any; // deprecated, use intersectsSphere()
@@ -3126,7 +3145,7 @@ declare namespace THREE {
 
     export class Euler {
         constructor(x?: number, y?: number, z?: number, order?: string);
-        
+
         x: number;
         y: number;
         z: number;
@@ -3316,13 +3335,21 @@ declare namespace THREE {
         clone(): Matrix3;
         copy(m: Matrix3): Matrix3;
         setFromMatix4(m: Matrix4): Matrix3;
-        multiplyVector3Array(a: any): any; // deprecated, use applyToVector3Array()
+
+        /**
+         * @deprecated Use applyToVector3Array()
+         */
+        multiplyVector3Array(a: any): any;
         applyToVector3Array(array: number[], offset?: number, length?: number): number[];
         applyToBuffer(buffer: BufferAttribute, offset?: number, length?: number): BufferAttribute;
         multiplyScalar(s: number): Matrix3;
         determinant(): number;
         getInverse(matrix: Matrix3, throwOnDegenerate?: boolean): Matrix3;
-        getInverse(matrix: Matrix4, throwOnDegenerate?: boolean): Matrix3; // deprecated
+
+        /**
+         * @deprecated No longer takes a Matrix4 argument.
+         */
+        getInverse(matrix: Matrix4, throwOnDegenerate?: boolean): Matrix3;
 
         /**
          * Transposes this matrix in place.
@@ -3338,7 +3365,10 @@ declare namespace THREE {
         fromArray(array: number[]): Matrix3;
         toArray(): number[];
 
-        multiplyVector3(vector: Vector3): any; // deprecated, use vector.applyMatrix3( matrix )
+        /**
+         * @deprecated Use vector.applyMatrix3( matrix )
+         */
+        multiplyVector3(vector: Vector3): any;
     }
 
     /**
@@ -3438,7 +3468,7 @@ declare namespace THREE {
          * Sets the position component for this matrix from vector v.
          */
         setPosition(v: Vector3): Matrix4;
-        
+
 
         /**
          * Sets this matrix to the inverse of matrix m.
@@ -3521,11 +3551,26 @@ declare namespace THREE {
         fromArray(array: number[]): Matrix4;
         toArray(): number[];
 
-        getPosition(): any; // deprecated, use Vector3.setFromMatrixPosition( matrix )
-        multiplyVector3(v: any): any; // deprecated, use vector.applyMatrix4( matrix ) or vector.applyProjection( matrix )
-        multiplyVector4(v: any): any; // deprecated, use vector.applyMatrix4( matrix )
-        rotateAxis(v: any): void; // deprecated, use Vector3.transformDirection( matrix )
-        crossVector(v: any): void; // deprecated, use vector.applyMatrix( matrix )
+        /**
+         * @deprecated Use Vector3.setFromMatrixPosition( matrix )
+         */
+        getPosition(): any;
+        /**
+         * @deprecated Use Vector3.applyMatrix4( matrix ) or Vector3.applyProjection( matrix )
+         */
+        multiplyVector3(v: any): any;
+        /**
+         * @deprecated Use Vector3.applyMatrix4( matrix )
+         */
+        multiplyVector4(v: any): any;
+        /**
+         * @deprecated Use Vector3.transformDirection( matrix )
+         */
+        rotateAxis(v: any): void;
+        /**
+         * @deprecated Use Vector3.applyMatrix( matrix )
+         */
+        crossVector(v: any): void;
     }
 
     export class Plane {
@@ -3669,7 +3714,7 @@ declare namespace THREE {
          * Adapted from http://www.euclideanspace.com/maths/algebra/realNormedAlgebra/quaternions/slerp/.
          */
         static slerp(qa: Quaternion, qb: Quaternion, qm: Quaternion, t: number): Quaternion;
-        
+
         static slerpFlat(dst: number[], dstOffset: number, src0: number[], srcOffset: number, src1: number[], stcOffset1: number, t: number): Quaternion;
     }
 
@@ -3699,7 +3744,7 @@ declare namespace THREE {
         intersectTriangle(a: Vector3, b: Vector3, c: Vector3, backfaceCulling: boolean, optionalTarget?: Vector3): Vector3;
         applyMatrix4(matrix4: Matrix4): Ray;
         equals(ray: Ray): boolean;
-        
+
         isIntersectionSphere(s: any): any; // deprecated, use intersectsSphere()
         isIntersectionPlane(p: any): any; // deprecated, use intersectsPlane()
         isIntersectionBox(b: any): any; // deprecated, use intersectsBox()
@@ -4293,7 +4338,7 @@ declare namespace THREE {
          * Sets all values of this vector.
          */
         setScalar(scalar: number): Vector4;
-        
+
         /**
          * Sets X component of this vector.
          */
@@ -4446,7 +4491,7 @@ declare namespace THREE {
 
         interpolate_(i1: number, t0: number, t: number, t1: number): any;
     }
-    
+
     export class DiscreteInterpolant extends Interpolant {
         constructor(parameterPositions: any, samplesValues: any, sampleSize: number, resultBuffer?: any);
 
@@ -4847,7 +4892,7 @@ declare namespace THREE {
         getPrecision(): string;
         getPixelRatio(): number;
         setPixelRatio(value: number): void;
-        
+
         getSize(): { width: number; height: number; };
 
         /**
@@ -4881,12 +4926,12 @@ declare namespace THREE {
         setClearColor(color: Color, alpha?: number): void;
         setClearColor(color: string, alpha?: number): void;
         setClearColor(color: number, alpha?: number): void;
-        
+
         /**
          * Returns a float with the current clear alpha. Ranges from 0 to 1.
          */
         getClearAlpha(): number;
-        
+
         setClearAlpha(alpha: number): void;
 
         /**
@@ -5252,7 +5297,7 @@ declare namespace THREE {
         export function clone(uniforms_src: any): any;
     }
 
-    export class Uniform { 
+    export class Uniform {
         constructor(type: string, value: string);
 
         type: string;
@@ -5311,7 +5356,7 @@ declare namespace THREE {
 
     export class WebGLLights {
         constructor(gl: WebGLRenderingContext, properties: any, info: any);
-        
+
         get(light: any): any;
     }
 
@@ -5323,7 +5368,7 @@ declare namespace THREE {
         render(start: any, count: number): void;
         renderInstances(geometry: any, start: any, count: number): void;
     }
-    
+
     export class WebGLObjects {
         constructor(gl: WebGLRenderingContext, properties: any, info: any);
 
@@ -5334,7 +5379,7 @@ declare namespace THREE {
 
     export class WebGLProgram {
         constructor(renderer: WebGLRenderer, code: string, material: ShaderMaterial, parameters: WebGLRendererParameters);
-        
+
         id: number;
         code: string;
         usedTimes: number;
@@ -5359,7 +5404,7 @@ declare namespace THREE {
         acquireProgram(material: ShaderMaterial, parameters: any, code: string): WebGLProgram;
         releaseProgram(program: WebGLProgram): void;
     }
-    
+
     export class WebGLProperties {
         constructor();
 
@@ -5383,7 +5428,7 @@ declare namespace THREE {
 
         render(scene: Scene, camera: Camera): void;
     }
-    
+
     export class WebGLState {
         constructor(gl: any, extensions: any, paramThreeToGL: Function);
 
@@ -5424,7 +5469,7 @@ declare namespace THREE {
     // Renderers / WebGL / Plugins /////////////////////////////////////////////////////////////////////
     export class LensFlarePlugin {
         constructor(renderer: WebGLRenderer, flares: any[]);
-        
+
         render(scene: Scene, camera: Camera, viewportWidth: number, viewportHeight: number): void;
     }
 
@@ -5435,7 +5480,7 @@ declare namespace THREE {
     }
 
     // Scenes /////////////////////////////////////////////////////////////////////
-    
+
     /**
      * Scenes allow you to set up what and where is to be rendered by three.js. This is where you place objects, lights and cameras.
      */
@@ -5924,7 +5969,7 @@ declare namespace THREE {
 
     export class ClosedSplineCurve3 extends CatmullRomCurve3 {} // deprecated, use CatmullRomCurve3
     export class SplineCurve3 extends CatmullRomCurve3 {} // will be deprecated, use CatmullRomCurve3
-        
+
     export class CubicBezierCurve extends Curve<Vector2> {
         constructor(v0: Vector2, v1: Vector2, v2: Vector2, v3: Vector2);
 
@@ -5944,7 +5989,7 @@ declare namespace THREE {
 
         getPoint(t: number): Vector3;
     }
-    
+
     export class EllipseCurve extends Curve<Vector2> {
         constructor(aX: number, aY: number, xRadius: number, yRadius: number, aStartAngle: number, aEndAngle: number, aClockwise: boolean, aRotation: number);
 
@@ -5976,7 +6021,7 @@ declare namespace THREE {
 
         getPoint(t: number): Vector3;
     }
-    
+
     export class QuadraticBezierCurve extends Curve<Vector2> {
         constructor( v0: Vector2, v1: Vector2, v2: Vector2 );
 
@@ -6000,7 +6045,7 @@ declare namespace THREE {
 
         points: Vector2[];
     }
-    
+
 
     // Extras / Geometries /////////////////////////////////////////////////////////////////////
     export class BoxBufferGeometry extends BufferGeometry {

From b1e672d9a631cb4d28b326560d03f1344f16a166 Mon Sep 17 00:00:00 2001
From: frogcjn <frogcjn@163.com>
Date: Tue, 21 Jun 2016 09:55:34 +0800
Subject: [PATCH 214/278] update Model static function options

---
 sequelize/sequelize.d.ts | 381 +++++++++------------------------------
 1 file changed, 85 insertions(+), 296 deletions(-)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index 733f31ddad..b9fe2664e3 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -2595,9 +2595,6 @@ declare module "sequelize" {
              * Transaction to run query under
              */
             transaction? : Transaction;
-            
-            
-
         }
 
         /**
@@ -2654,7 +2651,7 @@ declare module "sequelize" {
         /**
          * Options used for Instance.save method
          */
-        interface InstanceSaveOptions {
+        interface InstanceSaveOptions extends LoggingOptions, ReturningOptions {
 
             /**
              * An optional array of strings, representing database columns. If fields is provided, only those columns
@@ -2676,21 +2673,6 @@ declare module "sequelize" {
              */
             validate? : boolean;
 
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
-            /**
-             * Transaction to run the query in
-             */
-            transaction? : Transaction;
-            
-            /**
-             * Append RETURNING * to get back auto generated values (Postgres only)
-             */
-            returning? : boolean;
-
         }
 
         /**
@@ -2914,6 +2896,27 @@ declare module "sequelize" {
 
         }
 
+        interface LoggingOptions {
+            logging?: boolean | Function;
+
+            /**
+             * Print query execution time in milliseconds when logging SQL.
+             */
+            benchmark?: boolean;
+        }
+
+        interface SearchPathOptions {
+            /**
+             * Transaction to run query under
+             */
+            transaction? : Transaction;
+
+            /**
+             * An optional parameter to specify the schema search_path (Postgres only)
+             */
+            searchPath? : string;
+        }
+
         //
         //  Model
         // ~~~~~~~
@@ -2924,76 +2927,44 @@ declare module "sequelize" {
         /**
          * Options to pass to Model on drop
          */
-        interface DropOptions {
+        interface DropOptions extends LoggingOptions {
 
             /**
              * Also drop all objects depending on this table, such as views. Only works in postgres
              */
             cascade?: boolean;
 
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging?: boolean | Function;
-            
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark?: boolean;
-
         }
 
         /**
          * Schema Options provided for applying a schema to a model
          */
-        interface SchemaOptions {
+        interface SchemaOptions extends LoggingOptions {
 
             /**
              * The character(s) that separates the schema name from the table name
              */
             schemaDelimeter? : string;
 
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : Function | boolean;
-            
-            
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark: boolean;
-
         }
         /**
          * GetTableName Options
          */
-        interface GetTableNameOptions {
-
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : Function | boolean;
-            
-            
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark: boolean;
-
+        interface GetTableNameOptions extends LoggingOptions {
+            // no addition properties
         }
-        
+
 
         /**
          * AddScope Options for Model.addScope
          */
         interface AddScopeOptions {
-            
+
             /**
              * If a scope of the same name already exists, should it be overwritten?
              */
             override: boolean;
-            
+
         }
 
         /**
@@ -3161,7 +3132,7 @@ declare module "sequelize" {
          *
          * A hash of options to describe the scope of the search
          */
-	interface FindOptions {
+	interface FindOptions extends LoggingOptions, SearchPathOptions {
 
             /**
              * A hash of attributes to describe your search. See above for examples.
@@ -3197,7 +3168,7 @@ declare module "sequelize" {
              * `order: [['name', 'DESC']]`. In this way the column will be escaped, but the direction will not.
              */
             order?: string | col | literal | Array<string | number | Model<any, any> | { model : Model<any, any>, as? : string}> | Array<string | col | literal | Array<string | number | Model<any, any> | { model : Model<any, any>, as? : string}>>;
-            
+
             /**
              * Limit the results
              */
@@ -3208,11 +3179,6 @@ declare module "sequelize" {
              */
             offset?: number;
 
-            /**
-             * Transaction to run query under
-             */
-            transaction? : Transaction;
-
             /**
              * Lock the selected rows. Possible options are transaction.LOCK.UPDATE and transaction.LOCK.SHARE.
              * Postgres also supports transaction.LOCK.KEY_SHARE, transaction.LOCK.NO_KEY_UPDATE and specific model
@@ -3225,11 +3191,6 @@ declare module "sequelize" {
              */
             raw? : boolean;
 
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
             /**
              * having ?!?
              */
@@ -3240,40 +3201,27 @@ declare module "sequelize" {
              * https://github.com/sequelize/sequelize/blob/master/docs/docs/models-usage.md#user-content-manipulating-the-dataset-with-limit-offset-order-and-group
              */
             group?: string | string[] | Object;
-            
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
-
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark? : boolean;
 
         }
-        
+
         /**
-         * Options for findById/findByPrimary, findOne/find
+         * Options for findOne/find
          */
-	interface FindOneOptions {
-
-            /**
-             * Transaction to run query under
-             */
-            transaction? : Transaction;
-            
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
+	    interface FindOneOptions extends SearchPathOptions {
+            // no additional properties
+        }
 
+        /**
+         * Options for findById/findByPrimary,
+         */
+	    interface FindByIdOptions extends SearchPathOptions {
+            // no additional properties
         }
 
         /**
          * Options for Model.count method
          */
-        interface CountOptions {
+        interface CountOptions extends LoggingOptions, SearchPathOptions {
 
             /**
              * A hash of search attributes.
@@ -3301,32 +3249,12 @@ declare module "sequelize" {
              * TODO: Check?
              */
             group? : Object;
-
-            /**
-             * Transaction to run query under
-             */
-            transaction? : Transaction;
-            
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
-
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark? : boolean;
         }
 
         /**
          * Options for Model.build method
          */
-        interface BuildOptions {
+        interface BuildOptions extends ReturningOptions {
 
             /**
              * If set to true, values will ignore field and virtual setters.
@@ -3345,22 +3273,16 @@ declare module "sequelize" {
              */
             include? :  Array<Model<any, any> | IncludeOptions>;
 
-	    /**
-	     * If true, the updatedAt timestamp will not be updated.
-	     */
-            silent? : boolean;
-            
             /**
-             * Append RETURNING * to get back auto generated values (Postgres only)
+             * If true, the updatedAt timestamp will not be updated.
              */
-            returning? : boolean;
+            silent? : boolean;
         }
 
         /**
          * Options for Model.create method
          */
-        interface CreateOptions extends BuildOptions {
-
+        interface CreateOptions extends BuildOptions, InstanceSaveOptions {
             /**
              * If set, only columns matching those in fields will be saved
              */
@@ -3370,32 +3292,12 @@ declare module "sequelize" {
              * On Duplicate
              */
             onDuplicate? : string;
-
-            /**
-             * Transaction to run query under
-             */
-            transaction? : Transaction;
-
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-            
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
-
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark? : boolean;
         }
 
         /**
          * Options for Model.findOrInitialize method
          */
-        interface FindOrInitializeOptions<TAttributes> {
+        interface FindOrInitializeOptions<TAttributes> extends LoggingOptions {
 
             /**
              * A hash of search attributes.
@@ -3411,18 +3313,8 @@ declare module "sequelize" {
              * Transaction to run query under
              */
             transaction? : Transaction;
-
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark? : boolean;
         }
-        
+
         /**
          * Options for Model.findOrInitialize method
          */
@@ -3442,7 +3334,7 @@ declare module "sequelize" {
         /**
          * Options for Model.upsert method
          */
-        interface UpsertOptions {
+        interface UpsertOptions extends LoggingOptions, SearchPathOptions {
 
             /**
              * Run validations before the row is inserted
@@ -3453,32 +3345,12 @@ declare module "sequelize" {
              * The fields to insert / update. Defaults to all fields
              */
             fields? : string[];
-
-            /**
-             * Transaction to run query under
-             */
-            transaction? : Transaction;
-            
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
-
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark? : boolean;
         }
 
         /**
          * Options for Model.bulkCreate method
          */
-        interface BulkCreateOptions {
+        interface BulkCreateOptions extends LoggingOptions, SearchPathOptions, ReturningOptions {
 
             /**
              * Fields to insert (defaults to all fields)
@@ -3514,42 +3386,12 @@ declare module "sequelize" {
              * mariadb). By default, all fields are updated.
              */
             updateOnDuplicate? : string[];
-
-            /**
-             * Transaction to run query under
-             */
-            transaction? : Transaction;
-
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
-            /**
-             * Append RETURNING * to get back auto generated values (Postgres only).
-             */
-            returning? : boolean;
-            
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
-            
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark? : boolean;
         }
 
         /**
          * The options passed to Model.destroy in addition to truncate
          */
-        interface TruncateOptions {
-
-            /**
-             * Transaction to run query under
-             */
-            transaction? : Transaction;
+        interface TruncateOptions extends LoggingOptions, SearchPathOptions {
 
             /**
              * Only used in conjuction with TRUNCATE. Truncates  all tables that have foreign-key references to the
@@ -3558,21 +3400,6 @@ declare module "sequelize" {
              * Defaults to false;
              */
             cascade? : boolean;
-
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
-
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark? : boolean;
         }
 
         /**
@@ -3617,7 +3444,7 @@ declare module "sequelize" {
         /**
          * Options for Model.restore
          */
-        interface RestoreOptions {
+        interface RestoreOptions extends LoggingOptions {
 
             /**
              * Filter the restore
@@ -3640,27 +3467,17 @@ declare module "sequelize" {
              */
             limit? : number;
 
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
             /**
              * Transaction to run query under
              */
             transaction? : Transaction;
-            
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark?: boolean;
-            
+
         }
 
         /**
          * Options used for Model.update
          */
-        interface UpdateOptions {
+        interface UpdateOptions extends LoggingOptions, ReturningOptions {
 
             /**
              * Options to describe the scope of the search.
@@ -3702,52 +3519,31 @@ declare module "sequelize" {
              */
             individualHooks? : boolean;
 
-            /**
-             * Return the affected rows (only for postgres)
-             */
-            returning? : boolean;
-
             /**
              * How many rows to update (only for mysql and mariadb)
              */
             limit? : number;
 
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
-
             /**
              * Transaction to run query under
              */
             transaction? : Transaction;
-            
-            
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark?: boolean;
-            
+
            /**
-	     * If true, the updatedAt timestamp will not be updated.
-	     */
+	        * If true, the updatedAt timestamp will not be updated.
+	        */
             silent? : boolean;
         }
 
         /**
          * Options used for Model.aggregate
          */
-        interface AggregateOptions {
+        interface AggregateOptions extends LoggingOptions {
 
             /**
              * A hash of search attributes.
              */
             where?: WhereOptions;
-            
-            /**
-             * A function that gets executed while running the query to log the sql.
-             */
-            logging? : boolean | Function;
 
             /**
              * The type of the result. If `field` is a field in this Model, the default will be the type of that field,
@@ -3759,7 +3555,7 @@ declare module "sequelize" {
              * Applies DISTINCT to the field being aggregated over
              */
             distinct? : boolean;
-            
+
             /**
              * The transaction that the query should be executed under
              */
@@ -3771,11 +3567,6 @@ declare module "sequelize" {
              * Defaults to `true`
              */
             plain?: boolean;
-            
-            /**
-             * Print query execution time in milliseconds when logging SQL.
-             */
-            benchmark?: boolean;
         }
 
         /**
@@ -3963,15 +3754,15 @@ declare module "sequelize" {
              * Search for a single instance by its primary key. This applies LIMIT 1, so the listener will
              * always be called with a single instance.
              */
-            findById( identifier? : number | string, options? : FindOneOptions ) : Promise<TInstance>;
-            findByPrimary( identifier? : number | string, options? : FindOneOptions ) : Promise<TInstance>;
+            findById( identifier? : number | string, options? : FindByIdOptions ) : Promise<TInstance>;
+            findByPrimary( identifier? : number | string, options? : FindByIdOptions ) : Promise<TInstance>;
 
             /**
              * Search for a single instance. This applies LIMIT 1, so the listener will always be called with a single
              * instance.
              */
             findOne( options? : FindOneOptions ) : Promise<TInstance>;
-            find( optionz? : FindOneOptions ) : Promise<TInstance>;
+            find( options? : FindOneOptions ) : Promise<TInstance>;
 
             /**
              * Run an aggregation method on the specified field
@@ -4078,7 +3869,7 @@ declare module "sequelize" {
              * will be created instead, and any unique constraint violation will be handled internally.
              */
             findOrCreate( options : FindOrInitializeOptions<TAttributes> ) : Promise<TInstance>;
-            
+
             /**
              * A more performant findOrCreate that will not work under a transaction (at least not in postgres)
              * Will execute a find call, if empty then attempt to create, if unique constraint then attempt to find again
@@ -4669,7 +4460,7 @@ declare module "sequelize" {
          *
          * @see Options
          */
-        interface QueryOptions {
+        interface QueryOptions extends SearchPathOptions, ReturningOptions {
 
             /**
              * If true, sequelize will not try to format the results of the query, or build an instance of a model from
@@ -4677,10 +4468,6 @@ declare module "sequelize" {
              */
             raw?: boolean;
 
-            /**
-             * The transaction that the query should be executed under
-             */
-            transaction?: Transaction;
 
             /**
              * The type of query you are executing. The query type affects how results are formatted before they are
@@ -4708,7 +4495,7 @@ declare module "sequelize" {
              * replacements to replace `?` in your SQL.
              */
             replacements? : Object | string[];
-            
+
             /**
              * Either an object of named bind parameter in the format `$param` or an array of unnamed
              * bind parameter to replace `$1`, `$2`, ... in your SQL.
@@ -4725,7 +4512,7 @@ declare module "sequelize" {
             /**
              * A function that gets executed while running the query to log the sql.
              */
-            logging? : Function;
+            logging? : boolean | Function;
 
             /**
              * A sequelize instance used to build the return instance
@@ -4736,30 +4523,32 @@ declare module "sequelize" {
              * A sequelize model used to build the returned model instances (used to be called callee)
              */
             model? : Model<any, any>;
-            
+
             /**
              * Set of flags that control when a query is automatically retried.
              */
-            retry? : {match?: string[], max?: integer};
-            
-            /**
-             * An optional parameter to specify the schema search_path (Postgres only)
-             */
-            searchPath? : string;
-            
+            retry? : {match?: string[], max?: number};
+
             /**
              * If false do not prepend the query with the search_path (Postgres only)
              */
-	    supportsSearchPath : boolean;
-	    
-	    /**
-	     * Map returned fields to model's fields if `options.model` or `options.instance` is present.
-	     * Mapping will occur before building the model instance.
-	     */
-	    mapToModel : boolean;
-	    
+	        supportsSearchPath : boolean;
+
+            /**
+             * Map returned fields to model's fields if `options.model` or `options.instance` is present.
+             * Mapping will occur before building the model instance.
+             */
+            mapToModel : boolean;
+
             // TODO: force, cascade
-	    fieldMap? : { [key: string]: string; }
+            fieldMap? : { [key: string]: string; }
+        }
+
+        interface ReturningOptions {
+            /**
+             * Append RETURNING * to get back auto generated values (Postgres only)
+             */
+            returning? : boolean;
         }
 
         /**

From a4f740bb6ff44a38fed0fdd1ae1c1e7cf917a8d8 Mon Sep 17 00:00:00 2001
From: frogcjn <frogcjn@163.com>
Date: Tue, 21 Jun 2016 10:01:49 +0800
Subject: [PATCH 215/278] create small common interface

---
 sequelize/sequelize.d.ts | 84 +++++++++++-----------------------------
 1 file changed, 23 insertions(+), 61 deletions(-)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index b9fe2664e3..219a1944f8 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -2651,13 +2651,7 @@ declare module "sequelize" {
         /**
          * Options used for Instance.save method
          */
-        interface InstanceSaveOptions extends LoggingOptions, ReturningOptions {
-
-            /**
-             * An optional array of strings, representing database columns. If fields is provided, only those columns
-             * will be validated and saved.
-             */
-            fields? : string[];
+        interface InstanceSaveOptions extends FieldsOptions, LoggingOptions, ReturningOptions {
 
             /**
              * If true, the updatedAt timestamp will not be updated.
@@ -2666,13 +2660,6 @@ declare module "sequelize" {
              */
             silent? : boolean;
 
-            /**
-             * If false, validations won't be run.
-             *
-             * Defaults to true
-             */
-            validate? : boolean;
-
         }
 
         /**
@@ -2917,6 +2904,25 @@ declare module "sequelize" {
             searchPath? : string;
         }
 
+        interface ReturningOptions {
+            /**
+             * Append RETURNING * to get back auto generated values (Postgres only)
+             */
+            returning? : boolean;
+        }
+
+        interface FieldsOptions {
+            /**
+             * Run validations before the row is inserted
+             */
+            validate? : boolean;
+
+            /**
+             * The fields to insert / update. Defaults to all fields
+             */
+            fields? : string[];
+        }
+
         //
         //  Model
         // ~~~~~~~
@@ -3283,10 +3289,6 @@ declare module "sequelize" {
          * Options for Model.create method
          */
         interface CreateOptions extends BuildOptions, InstanceSaveOptions {
-            /**
-             * If set, only columns matching those in fields will be saved
-             */
-            fields? : string[];
 
             /**
              * On Duplicate
@@ -3334,34 +3336,14 @@ declare module "sequelize" {
         /**
          * Options for Model.upsert method
          */
-        interface UpsertOptions extends LoggingOptions, SearchPathOptions {
-
-            /**
-             * Run validations before the row is inserted
-             */
-            validate? : boolean;
-
-            /**
-             * The fields to insert / update. Defaults to all fields
-             */
-            fields? : string[];
+        interface UpsertOptions extends FieldsOptions, LoggingOptions, SearchPathOptions {
         }
 
         /**
          * Options for Model.bulkCreate method
          */
-        interface BulkCreateOptions extends LoggingOptions, SearchPathOptions, ReturningOptions {
 
-            /**
-             * Fields to insert (defaults to all fields)
-             */
-            fields? : string[];
-
-            /**
-             * Should each row be subject to validation before it is inserted. The whole insert will fail if one row
-             * fails validation
-             */
-            validate? : boolean;
+        interface BulkCreateOptions extends FieldsOptions, LoggingOptions, SearchPathOptions, ReturningOptions {
 
             /**
              * Run before / after bulk create hooks?
@@ -3477,26 +3459,13 @@ declare module "sequelize" {
         /**
          * Options used for Model.update
          */
-        interface UpdateOptions extends LoggingOptions, ReturningOptions {
+        interface UpdateOptions extends FieldsOptions, LoggingOptions, ReturningOptions {
 
             /**
              * Options to describe the scope of the search.
              */
             where: WhereOptions;
 
-            /**
-             * Fields to update (defaults to all fields)
-             */
-            fields? : string[];
-
-            /**
-             * Should each row be subject to validation before it is inserted. The whole insert will fail if one row
-             * fails validation.
-             *
-             * Defaults to true
-             */
-            validate? : boolean;
-
             /**
              * Run before / after bulk update hooks?
              *
@@ -4544,13 +4513,6 @@ declare module "sequelize" {
             fieldMap? : { [key: string]: string; }
         }
 
-        interface ReturningOptions {
-            /**
-             * Append RETURNING * to get back auto generated values (Postgres only)
-             */
-            returning? : boolean;
-        }
-
         /**
          * Model validations, allow you to specify format/content/inheritance validations for each attribute of the
          * model.

From 55322ce92ebdfaa483ea7ca992c19c49f768d523 Mon Sep 17 00:00:00 2001
From: frogcjn <frogcjn@163.com>
Date: Tue, 21 Jun 2016 10:07:14 +0800
Subject: [PATCH 216/278] remove silent from BuildOptions

---
 sequelize/sequelize.d.ts | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index 219a1944f8..222cf227d3 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -3278,11 +3278,6 @@ declare module "sequelize" {
              * TODO: See set
              */
             include? :  Array<Model<any, any> | IncludeOptions>;
-
-            /**
-             * If true, the updatedAt timestamp will not be updated.
-             */
-            silent? : boolean;
         }
 
         /**

From bb940aa5bbaec12a9b56e0b296800f4033e303c5 Mon Sep 17 00:00:00 2001
From: frogcjn <frogcjn@163.com>
Date: Tue, 21 Jun 2016 11:33:53 +0800
Subject: [PATCH 217/278] remove FindOne/FindById Options

---
 sequelize/sequelize.d.ts | 22 ++++------------------
 1 file changed, 4 insertions(+), 18 deletions(-)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index 222cf227d3..02615e2f1e 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -3210,20 +3210,6 @@ declare module "sequelize" {
 
         }
 
-        /**
-         * Options for findOne/find
-         */
-	    interface FindOneOptions extends SearchPathOptions {
-            // no additional properties
-        }
-
-        /**
-         * Options for findById/findByPrimary,
-         */
-	    interface FindByIdOptions extends SearchPathOptions {
-            // no additional properties
-        }
-
         /**
          * Options for Model.count method
          */
@@ -3718,15 +3704,15 @@ declare module "sequelize" {
              * Search for a single instance by its primary key. This applies LIMIT 1, so the listener will
              * always be called with a single instance.
              */
-            findById( identifier? : number | string, options? : FindByIdOptions ) : Promise<TInstance>;
-            findByPrimary( identifier? : number | string, options? : FindByIdOptions ) : Promise<TInstance>;
+            findById( identifier? : number | string, options? : FindOptions ) : Promise<TInstance>;
+            findByPrimary( identifier? : number | string, options? : FindOptions ) : Promise<TInstance>;
 
             /**
              * Search for a single instance. This applies LIMIT 1, so the listener will always be called with a single
              * instance.
              */
-            findOne( options? : FindOneOptions ) : Promise<TInstance>;
-            find( options? : FindOneOptions ) : Promise<TInstance>;
+            findOne( options? : FindOptions ) : Promise<TInstance>;
+            find( options? : FindOptions ) : Promise<TInstance>;
 
             /**
              * Run an aggregation method on the specified field

From 464602f984cbc01ea0bc5d0c2dc6b5feca4f8284 Mon Sep 17 00:00:00 2001
From: mayTree <nallwhy@gmail.com>
Date: Sun, 19 Jun 2016 13:39:23 +0900
Subject: [PATCH 218/278] Update definitions of findIndex/findLastIndex

---
 underscore/underscore-tests.ts |  4 ++++
 underscore/underscore.d.ts     | 27 ++++++---------------------
 2 files changed, 10 insertions(+), 21 deletions(-)

diff --git a/underscore/underscore-tests.ts b/underscore/underscore-tests.ts
index 79b5515a35..26718207d8 100644
--- a/underscore/underscore-tests.ts
+++ b/underscore/underscore-tests.ts
@@ -240,6 +240,10 @@ _.object([['moe', 30], ['larry', 40], ['curly', 50]]);
 _.indexOf([1, 2, 3], 2);
 _.lastIndexOf([1, 2, 3, 1, 2, 3], 2);
 _.sortedIndex([10, 20, 30, 40, 50], 35);
+_.findIndex([1, 2, 3, 1, 2, 3], num => num % 2 === 0);
+_.findIndex([{a: 'a'}, {a: 'b'}], {a: 'b'});
+_.findLastIndex([1, 2, 3, 1, 2, 3], num => num % 2 === 0);
+_.findLastIndex([{ a: 'a' }, { a: 'b' }], { a: 'b' });
 _.range(10);
 _.range(1, 11);
 _.range(0, 30, 5);
diff --git a/underscore/underscore.d.ts b/underscore/underscore.d.ts
index 1986786629..6ed84f6641 100644
--- a/underscore/underscore.d.ts
+++ b/underscore/underscore.d.ts
@@ -305,21 +305,6 @@ interface UnderscoreStatic {
 		object: _.List<T>|_.Dictionary<T>,
 		iterator: string): T;
 
-    /**
-	* Looks through each value in the list, returning the index of the first one that passes a truth
-	* test (iterator). The function returns as soon as it finds an acceptable element,
-	* and doesn't traverse the entire list.
-	* @param list Searches for a value in this list.
-	* @param iterator Search iterator function for each element in `list`.
-	* @param context `this` object in `iterator`, optional.
-	* @return The index of the first acceptable found element in `list`, if nothing is found -1 is returned.
-	**/
-    findIndex<T>(
-        list: _.List<T>,
-        iterator: _.ListIterator<T, boolean>,
-        context?: any): number;
-
-
 	/**
 	* Looks through each value in the list, returning an array of all the values that pass a truth
 	* test (iterator). Delegates to the native filter method, if it exists.
@@ -1014,7 +999,7 @@ interface UnderscoreStatic {
 	**/
 	findIndex<T>(
 		array: _.List<T>,
-		predicate: _.ListIterator<T, boolean>,
+		predicate: _.ListIterator<T, boolean> | {},
 		context?: any): number;
 
 	/**
@@ -1026,7 +1011,7 @@ interface UnderscoreStatic {
 	**/
 	findLastIndex<T>(
 		array: _.List<T>,
-		predicate: _.ListIterator<T, boolean>,
+		predicate: _.ListIterator<T, boolean> | {},
 		context?: any): number;
 
 	/**
@@ -4499,12 +4484,12 @@ interface Underscore<T> {
 	/**
 	* @see _.findIndex
 	**/
-	findIndex<T>(array: _.List<T>, predicate: _.ListIterator<T, boolean>, context?: any): number;
+	findIndex<T>(array: _.List<T>, predicate: _.ListIterator<T, boolean> | {}, context?: any): number;
 
 	/**
 	* @see _.findLastIndex
 	**/
-	findLastIndex<T>(array: _.List<T>, predicate: _.ListIterator<T, boolean>, context?: any): number;
+	findLastIndex<T>(array: _.List<T>, predicate: _.ListIterator<T, boolean> | {}, context?: any): number;
 
 	/**
 	* Wrapped type `any[]`.
@@ -5417,12 +5402,12 @@ interface _Chain<T> {
 	/**
 	* @see _.findIndex
 	**/
-	findIndex<T>(predicate: _.ListIterator<T, boolean>, context?: any): _Chain<T>;
+	findIndex<T>(predicate: _.ListIterator<T, boolean> | {}, context?: any): _ChainSingle<number>;
 
 	/**
 	* @see _.findLastIndex
 	**/
-	findLastIndex<T>(predicate: _.ListIterator<T, boolean>, context?: any): _Chain<T>;
+	findLastIndex<T>(predicate: _.ListIterator<T, boolean> | {}, context?: any): _ChainSingle<number>;
 
 	/**
 	* Wrapped type `any[]`.

From a969442874d475655313f7c4722d40cd056f9238 Mon Sep 17 00:00:00 2001
From: Jeongho Nam <samchon@samchon.org>
Date: Tue, 21 Jun 2016 15:29:04 +0900
Subject: [PATCH 219/278] TypeScript-STL and Samchon-Framework, right sentence

---
 .../samchon-collection-tests.ts               |    5 +-
 samchon-collection/samchon-collection.d.ts    |   22 +-
 samchon-framework/samchon-framework-tests.ts  |    5 +-
 samchon-framework/samchon-framework.d.ts      | 2978 +++++++++------
 samchon-library/samchon-library-tests.ts      |    5 +-
 samchon-library/samchon-library.d.ts          |   22 +-
 typescript-stl/typescript-stl-tests.ts        |    5 +-
 typescript-stl/typescript-stl.d.ts            | 3369 +++++++++--------
 8 files changed, 3679 insertions(+), 2732 deletions(-)

diff --git a/samchon-collection/samchon-collection-tests.ts b/samchon-collection/samchon-collection-tests.ts
index 028eb32caa..5744f11a7a 100644
--- a/samchon-collection/samchon-collection-tests.ts
+++ b/samchon-collection/samchon-collection-tests.ts
@@ -1,7 +1,4 @@
 /// <reference path="samchon-collection.d.ts" />
 
-declare var global: any;
-declare var require: (name: string) => any;
-
-collection = require("samchon-collection");
+import collection = require("samchon-collection");
 console.log(collection);
\ No newline at end of file
diff --git a/samchon-collection/samchon-collection.d.ts b/samchon-collection/samchon-collection.d.ts
index 3decceb20b..0bff8791f9 100644
--- a/samchon-collection/samchon-collection.d.ts
+++ b/samchon-collection/samchon-collection.d.ts
@@ -3,21 +3,11 @@
 // Definitions by: Jeongho Nam <http://samchon.org>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-// ------------------------------------------------------------------------------------
-// In Samchon Collection, merging multiple 'ts' files to a module is not possible yet.
-// Instead of using "import" instruction, use such trick: 
-//
-// <code>
-// declare var global: any;
-// declare var require: Function;
-//
-// collection = require("samchon-collection");
-// let cont: collection.ArrayCollection<string> = new collection.ArrayCollection<string>();
-// </code>
-//
-// Those declaration of global and require can be substituted by using "node.d.ts"
-// ------------------------------------------------------------------------------------
-
 /// <reference path="../samchon-framework/samchon-framework.d.ts" />
 
-declare var collection: typeof samchon.collection;
\ No newline at end of file
+declare module "samchon-collection"
+{
+	import collection = samchon.collection;
+	export = collection;
+}
+
diff --git a/samchon-framework/samchon-framework-tests.ts b/samchon-framework/samchon-framework-tests.ts
index 5820b158c3..88c2632a37 100644
--- a/samchon-framework/samchon-framework-tests.ts
+++ b/samchon-framework/samchon-framework-tests.ts
@@ -1,7 +1,4 @@
 /// <reference path="samchon-framework.d.ts" />
 
-declare var global: any;
-declare var require: any;
-
-global["samchon"] = require("samchon-framework");
+import samchon = require("samchon-framework");
 console.log(samchon);
\ No newline at end of file
diff --git a/samchon-framework/samchon-framework.d.ts b/samchon-framework/samchon-framework.d.ts
index 9dd52e9503..5a885d6cd1 100644
--- a/samchon-framework/samchon-framework.d.ts
+++ b/samchon-framework/samchon-framework.d.ts
@@ -1,25 +1,15 @@
-// Type definitions for Samchon Framework v1.1.0
+// Type definitions for Samchon Framework v1.2.0
 // Project: https://github.com/samchon/framework
 // Definitions by: Jeongho Nam <http://samchon.org>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-// ------------------------------------------------------------------------------------
-// In Samchon Framework, merging multiple 'ts' files to a module is not possible yet.
-// Instead of using "import" instruction, use such trick: 
-//
-// <code>
-// declare var global: any;
-// declare var require: Function;
-//
-// global["samchon"] = require("samchon-framework");
-// let invoke: samchon.protocol.Invoke = new samchon.protocol.Invoke("setValue", 3);
-// </code>
-//
-// Those declaration of global and require can be substituted by using "node.d.ts"
-// ------------------------------------------------------------------------------------
-
 /// <reference path="../typescript-stl/typescript-stl.d.ts" />
 
+declare module "samchon-framework"
+{
+        export = samchon;
+}
+
 /**
  * Samchon Framework, A SDN framework.
  *
@@ -39,6 +29,1015 @@ declare namespace samchon.protocol.master {
 }
 declare namespace samchon.protocol.slave {
 }
+declare namespace samchon.collection {
+    /**
+     * A {@link Vector} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class ArrayCollection<T> extends std.Vector<T> implements ICollection<T> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        push<U extends T>(...items: U[]): number;
+        /**
+         * @inheritdoc
+         */
+        push_back(val: T): void;
+        /**
+         * @hidden
+         */
+        protected insert_by_repeating_val(position: std.VectorIterator<T>, n: number, val: T): std.VectorIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends std.Iterator<U>>(position: std.VectorIterator<T>, begin: InputIterator, end: InputIterator): std.VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        pop_back(): void;
+        /**
+         * @hidden
+         */
+        protected erase_by_range(first: std.VectorIterator<T>, last: std.VectorIterator<T>): std.VectorIterator<T>;
+        /**
+         * @hidden
+         */
+        private notify_insert(first, last);
+        /**
+         * @hidden
+         */
+        private notify_erase(first, last);
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        unshift<U extends T>(...items: U[]): number;
+        /**
+         * @inheritdoc
+         */
+        pop(): T;
+        /**
+         * @inheritdoc
+         */
+        splice(start: number): T[];
+        /**
+         * @inheritdoc
+         */
+        splice(start: number, deleteCount: number, ...items: T[]): T[];
+    }
+}
+declare namespace samchon.library {
+    /**
+     * An event class.
+     *
+     * <ul>
+     *  <li> Comments from - https://developer.mozilla.org/en-US/docs/Web/API/Event/ </li>
+     * </ul>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class BasicEvent implements Event {
+        NONE: number;
+        CAPTURING_PHASE: number;
+        AT_TARGET: number;
+        BUBBLING_PHASE: number;
+        private type_;
+        private target_;
+        private currentTarget_;
+        protected trusted_: boolean;
+        protected bubbles_: boolean;
+        protected cancelable_: boolean;
+        protected defaultPrevented_: boolean;
+        protected cancelBubble_: boolean;
+        private timeStamp_;
+        constructor(type: string, bubbles?: boolean, cancelable?: boolean);
+        /**
+         * @inheritdoc
+         */
+        initEvent(type: string, bubbles: boolean, cancelable: boolean): void;
+        /**
+         * @inheritdoc
+         */
+        preventDefault(): void;
+        /**
+         * @inheritdoc
+         */
+        stopImmediatePropagation(): void;
+        /**
+         * @inheritdoc
+         */
+        stopPropagation(): void;
+        /**
+         * @inheritdoc
+         */
+        type: string;
+        /**
+         * @inheritdoc
+         */
+        target: IEventDispatcher;
+        /**
+         * @inheritdoc
+         */
+        currentTarget: IEventDispatcher;
+        /**
+         * @inheritdoc
+         */
+        isTrusted: boolean;
+        /**
+         * @inheritdoc
+         */
+        bubbles: boolean;
+        /**
+         * @inheritdoc
+         */
+        cancelable: boolean;
+        /**
+         * @inheritdoc
+         */
+        eventPhase: number;
+        /**
+         * @inheritdoc
+         */
+        defaultPrevented: boolean;
+        /**
+         * @inheritdoc
+         */
+        srcElement: Element;
+        /**
+         * @inheritdoc
+         */
+        cancelBubble: boolean;
+        /**
+         * @inheritdoc
+         */
+        timeStamp: number;
+        /**
+         * Don't know what it is.
+         */
+        returnValue: boolean;
+    }
+    class ProgressEvent extends library.BasicEvent {
+        static PROGRESS: string;
+        protected numerator_: number;
+        protected denominator_: number;
+        constructor(type: string, numerator: number, denominator: number);
+        numerator: number;
+        denominator: number;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * Type of function pointer for {@link CollectionEvent CollectionEvents}.
+     */
+    interface CollectionEventListener<T> extends EventListener {
+        (event: CollectionEvent<T>): void;
+    }
+    /**
+     *
+     */
+    class CollectionEvent<T> extends library.BasicEvent {
+        static INSERT: string;
+        static ERASE: string;
+        /**
+         *
+         */
+        private first_;
+        /**
+         *
+         */
+        private last_;
+        /**
+         *
+         *
+         * @param type
+         * @param first
+         * @param last
+         */
+        constructor(type: string, first: std.Iterator<T>, last: std.Iterator<T>);
+        /**
+         *
+         */
+        container: ICollection<T>;
+        /**
+         *
+         */
+        first: std.Iterator<T>;
+        /**
+         *
+         */
+        last: std.Iterator<T>;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * A {@link Deque} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class DequeCollection<T> extends std.Deque<T> implements ICollection<T> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        push<U extends T>(...items: U[]): number;
+        /**
+         * @inheritdoc
+         */
+        push_back(val: T): void;
+        /**
+         * @hidden
+         */
+        protected insert_by_repeating_val(position: std.DequeIterator<T>, n: number, val: T): std.DequeIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends std.Iterator<U>>(position: std.DequeIterator<T>, begin: InputIterator, end: InputIterator): std.DequeIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        pop_back(): void;
+        /**
+         * @hidden
+         */
+        protected erase_by_range(first: std.DequeIterator<T>, last: std.DequeIterator<T>): std.DequeIterator<T>;
+        /**
+         * @hidden
+         */
+        private notify_insert(first, last);
+        /**
+         * @hidden
+         */
+        private notify_erase(first, last);
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * A {@link HashMap} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class HashMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+    /**
+     * A {@link HashMultiMap} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class HashMultiMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * A {@link HashSet} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class HashSetCollection<T> extends std.TreeSet<T> implements ICollection<T> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+    class HashMultiSetCollection<T> extends std.TreeMultiSet<T> implements ICollection<T> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * An interface for {@link IContainer containers} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface ICollection<T> extends std.base.IContainer<T>, library.IEventDispatcher {
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * <p> Registers an event listener object with an EventDispatcher object so that the listener
+         * receives notification of an event. You can register event listeners on all nodes in the display
+         * list for a specific type of event, phase, and priority.
+         *
+         * <p> After you successfully register an event listener, you cannot change its priority through
+         * additional calls to addEventListener(). To change a listener's priority, you must first call
+         * removeEventListener(). Then you can register the listener again with the new priority level. </p>
+         *
+         * <p> Keep in mind that after the listener is registered, subsequent calls to addEventListener()
+         * with a different type or useCapture value result in the creation of a separate listener
+         * registration. For example, if you first register a listener with useCapture set to true,
+         * it listens only during the capture phase. If you call addEventListener() again using the same
+         * listener object, but with useCapture set to false, you have two separate listeners: one that
+         * listens during the capture phase and another that listens during the target and bubbling phases. </p>
+         *
+         * <p> You cannot register an event listener for only the target phase or the bubbling phase.
+         * Those phases are coupled during registration because bubbling applies only to the ancestors of
+         * the target node. </p>
+         *
+         * <p> If you no longer need an event listener, remove it by calling removeEventListener(), or
+         * memory problems could result. Event listeners are not automatically removed from memory because
+         * the garbage collector does not remove the listener as long as the dispatching object exists
+         * (unless the useWeakReference parameter is set to true). </p>
+         *
+         * <p> Copying an EventDispatcher instance does not copy the event listeners attached to it. (If
+         * your newly created node needs an event listener, you must attach the listener after creating
+         * the node.) However, if you move an EventDispatcher instance, the event listeners attached to
+         * it move along with it. </p>
+         *
+         * <p> If the event listener is being registered on a node while an event is also being processed
+         * on this node, the event listener is not triggered during the current phase but may be triggered
+         * during a later phase in the event flow, such as the bubbling phase. </p>
+         *
+         * <p> If an event listener is removed from a node while an event is being processed on the node,
+         * it is still triggered by the current actions. After it is removed, the event listener is never
+         * invoked again (unless it is registered again for future processing). </p>
+         *
+         * @param event The type of event; {@link CollectionEvent.INSERT} or {@link CollectionEvent.ERASE}.
+         * @param listener The listener function that processes the event.
+         *				 This function must accept an Event object as its only parameter and must return
+         *				 nothing.
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * <p> Registers an event listener object with an EventDispatcher object so that the listener
+         * receives notification of an event. You can register event listeners on all nodes in the display
+         * list for a specific type of event, phase, and priority.
+         *
+         * <p> After you successfully register an event listener, you cannot change its priority through
+         * additional calls to addEventListener(). To change a listener's priority, you must first call
+         * removeEventListener(). Then you can register the listener again with the new priority level. </p>
+         *
+         * <p> Keep in mind that after the listener is registered, subsequent calls to addEventListener()
+         * with a different type or useCapture value result in the creation of a separate listener
+         * registration. For example, if you first register a listener with useCapture set to true,
+         * it listens only during the capture phase. If you call addEventListener() again using the same
+         * listener object, but with useCapture set to false, you have two separate listeners: one that
+         * listens during the capture phase and another that listens during the target and bubbling phases. </p>
+         *
+         * <p> You cannot register an event listener for only the target phase or the bubbling phase.
+         * Those phases are coupled during registration because bubbling applies only to the ancestors of
+         * the target node. </p>
+         *
+         * <p> If you no longer need an event listener, remove it by calling removeEventListener(), or
+         * memory problems could result. Event listeners are not automatically removed from memory because
+         * the garbage collector does not remove the listener as long as the dispatching object exists
+         * (unless the useWeakReference parameter is set to true). </p>
+         *
+         * <p> Copying an EventDispatcher instance does not copy the event listeners attached to it. (If
+         * your newly created node needs an event listener, you must attach the listener after creating
+         * the node.) However, if you move an EventDispatcher instance, the event listeners attached to
+         * it move along with it. </p>
+         *
+         * <p> If the event listener is being registered on a node while an event is also being processed
+         * on this node, the event listener is not triggered during the current phase but may be triggered
+         * during a later phase in the event flow, such as the bubbling phase. </p>
+         *
+         * <p> If an event listener is removed from a node while an event is being processed on the node,
+         * it is still triggered by the current actions. After it is removed, the event listener is never
+         * invoked again (unless it is registered again for future processing). </p>
+         *
+         * @param event The type of event; {@link CollectionEvent.INSERT} or {@link CollectionEvent.ERASE}.
+         * @param listener The listener function that processes the event.
+         *				 This function must accept an Event object as its only parameter and must return
+         *				 nothing.
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * Removes a listener from the EventDispatcher object. If there is no matching listener registered
+         * with the EventDispatcher object, a call to this method has no effect.
+         *
+         * @param type The type of event; {@link CollectionEvent.INSERT} or {@link CollectionEvent.ERASE}.
+         * @param listener The listener object to remove.
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * Removes a listener from the EventDispatcher object. If there is no matching listener registered
+         * with the EventDispatcher object, a call to this method has no effect.
+         *
+         * @param type The type of event; {@link CollectionEvent.INSERT} or {@link CollectionEvent.ERASE}.
+         * @param listener The listener object to remove.
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * A {@link List} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class ListCollection<T> extends std.List<T> implements ICollection<T> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        push<U extends T>(...items: T[]): number;
+        /**
+         * @inheritdoc
+         */
+        push_front(val: T): void;
+        /**
+         * @inheritdoc
+         */
+        push_back(val: T): void;
+        /**
+         * @hidden
+         */
+        protected insert_by_repeating_val(position: std.ListIterator<T>, n: number, val: T): std.ListIterator<T>;
+        /**
+         * @hidden
+         */
+        protected insert_by_range<U extends T, InputIterator extends std.Iterator<U>>(position: std.ListIterator<T>, begin: InputIterator, end: InputIterator): std.ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        pop_front(): void;
+        /**
+         * @inheritdoc
+         */
+        pop_back(): void;
+        /**
+         * @hidden
+         */
+        protected erase_by_range(first: std.ListIterator<T>, last: std.ListIterator<T>): std.ListIterator<T>;
+        /**
+         * @hidden
+         */
+        private notify_insert(first, last);
+        /**
+         * @hidden
+         */
+        private notify_erase(first, last);
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * A {@link TreeMap} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+    /**
+     * A {@link TreeMultiMap} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMultiMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+}
+declare namespace samchon.collection {
+    /**
+     * A {@link TreeMap} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeSetCollection<T> extends std.TreeSet<T> implements ICollection<T> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+    /**
+     * A {@link TreeMultiSet} who can detect element I/O events.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class TreeMultiSetCollection<T> extends std.TreeMultiSet<T> implements ICollection<T> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
+        private event_dispatcher_;
+        /**
+         * @inheritdoc
+         */
+        protected handle_insert(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        protected handle_erase(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
+        /**
+         * @inheritdoc
+         */
+        hasEventListener(type: string): boolean;
+        /**
+         * @inheritdoc
+         */
+        dispatchEvent(event: Event): boolean;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+    }
+}
 declare namespace samchon.library {
     /**
      * <p> XML is a class representing a tree structued xml objects. </p>
@@ -151,16 +1150,16 @@ declare namespace samchon.library {
         /**
          * <p> Get value. </p>
          */
-        getValue(): any;
+        getValue(): string;
         /**
-         * <p> Test wheter a property exists or not. </p>
+         * <p> Test whether a property exists or not. </p>
          */
         hasProperty(key: string): boolean;
         /**
          * <p> Get property by its key. </p>
          */
-        getProperty(key: string): any;
-        getPropertyMap(): std.HashMap<string, any>;
+        getProperty(key: string): string;
+        getPropertyMap(): std.HashMap<string, string>;
         /**
          * <p> Set tag (identifier) of the XML. </p>
          */
@@ -193,11 +1192,11 @@ declare namespace samchon.library {
          *
          * @param val A value to set
          */
-        setValue(str: any): void;
+        setValue(str: string): void;
         /**
          * <p> Set a property with its key. </p>
          */
-        setProperty(key: string, value: any): void;
+        setProperty(key: string, value: string): void;
         /**
          * <p> Erase a property by its key. </p>
          *
@@ -375,10 +1374,6 @@ declare namespace samchon.library {
      * @author Jeongho Nam <http://samchon.org>
      */
     class XMLList extends std.Vector<XML> {
-        /**
-         * <p> Default Constructor. </p>
-         */
-        constructor();
         getTag(): string;
         /**
          * <p> Convert XMLList to string. </p>
@@ -395,47 +1390,27 @@ declare namespace samchon.library {
     }
 }
 declare namespace samchon.collection {
-    /**
-     * A {@link Vector} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class ArrayCollection<T> extends std.Vector<T> implements ICollection<T> {
-        private insert_handler_;
-        private erase_handler_;
+    class XMLListCollection extends library.XMLList implements ICollection<library.XML> {
+        /**
+         * A chain object taking responsibility of dispatching events.
+         */
         private event_dispatcher_;
         /**
          * @inheritdoc
          */
-        set_insert_handler(listener: CollectionHandler<T>): void;
+        push<U extends library.XML>(...items: U[]): number;
         /**
          * @inheritdoc
          */
-        set_erase_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        push<U extends T>(...items: U[]): number;
-        /**
-         * @inheritdoc
-         */
-        push_back(val: T): void;
+        push_back(val: library.XML): void;
         /**
          * @hidden
          */
-        protected insert_by_repeating_val(position: std.VectorIterator<T>, n: number, val: T): std.VectorIterator<T>;
+        protected insert_by_repeating_val(position: std.VectorIterator<library.XML>, n: number, val: library.XML): std.VectorIterator<library.XML>;
         /**
          * @hidden
          */
-        protected insert_by_range<U extends T, InputIterator extends std.Iterator<U>>(position: std.VectorIterator<T>, begin: InputIterator, end: InputIterator): std.VectorIterator<T>;
+        protected insert_by_range<U extends library.XML, InputIterator extends std.Iterator<U>>(position: std.VectorIterator<library.XML>, begin: InputIterator, end: InputIterator): std.VectorIterator<library.XML>;
         /**
          * @inheritdoc
          */
@@ -443,7 +1418,7 @@ declare namespace samchon.collection {
         /**
          * @hidden
          */
-        protected erase_by_range(first: std.VectorIterator<T>, last: std.VectorIterator<T>): std.VectorIterator<T>;
+        protected erase_by_range(first: std.VectorIterator<library.XML>, last: std.VectorIterator<library.XML>): std.VectorIterator<library.XML>;
         /**
          * @hidden
          */
@@ -471,11 +1446,11 @@ declare namespace samchon.collection {
         /**
          * @inheritdoc
          */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<library.XML>): void;
         /**
          * @inheritdoc
          */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<library.XML>, thisArg: Object): void;
         /**
          * @inheritdoc
          */
@@ -487,1020 +1462,34 @@ declare namespace samchon.collection {
         /**
          * @inheritdoc
          */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<library.XML>): void;
         /**
          * @inheritdoc
          */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
+        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<library.XML>, thisArg: Object): void;
         /**
          * @inheritdoc
          */
-        unshift<U extends T>(...items: U[]): number;
+        unshift<U extends library.XML>(...items: U[]): number;
         /**
          * @inheritdoc
          */
-        pop(): T;
+        pop(): library.XML;
         /**
          * @inheritdoc
          */
-        splice(start: number): T[];
+        splice(start: number): library.XML[];
         /**
          * @inheritdoc
          */
-        splice(start: number, deleteCount: number, ...items: T[]): T[];
+        splice(start: number, deleteCount: number, ...items: library.XML[]): library.XML[];
     }
 }
-declare namespace samchon.protocol {
-    /**
-     * <p> An entity, a standard data class. </p>
-     *
-     * <p> Entity is a class for standardization of expression method using on network I/O by XML. If
-     * Invoke is a standard message protocol of Samchon Framework which must be kept, Entity is a
-     * recommended semi-protocol of message for expressing a data class. Following the semi-protocol
-     * Entity is not imposed but encouraged. </p>
-     *
-     * <p> As we could get advantages from standardization of message for network I/O with Invoke,
-     * we can get additional advantage from standardizing expression method of data class with Entity.
-     * We do not need to know a part of network communication. Thus, with the Entity, we can only
-     * concentrate on entity's own logics and relationships between another entities. Entity does not
-     * need to how network communications are being done. </p>
-     *
-     * <p> I say repeatedly. Expression method of Entity is recommended, but not imposed. It's a semi
-     * protocol for network I/O but not a essential protocol must be kept. The expression method of
-     * Entity, using on network I/O, is expressed by XML string. </p>
-     *
-     * <p> If your own network system has a critical performance issue on communication data class,
-     * it would be better to using binary communication (with ByteArray).
-     * Don't worry about the problem! Invoke also provides methods for binary data (ByteArray). </p>
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    abstract class Entity implements IEntity {
-        /**
-         * <p> Default Constructor. </p>
-         */
-        constructor();
-        construct(xml: library.XML): void;
-        key(): any;
-        abstract TAG(): string;
-        toXML(): library.XML;
-    }
+declare namespace samchon.example {
+    function test_file_reference(): void;
 }
-declare namespace samchon.library {
-    /**
-     * An event class.
-     *
-     * <ul>
-     *  <li> Comments from - https://developer.mozilla.org/en-US/docs/Web/API/Event/ </li>
-     * </ul>
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class BasicEvent implements Event {
-        NONE: number;
-        CAPTURING_PHASE: number;
-        AT_TARGET: number;
-        BUBBLING_PHASE: number;
-        private type_;
-        private target_;
-        private currentTarget_;
-        protected trusted_: boolean;
-        protected bubbles_: boolean;
-        protected cancelable_: boolean;
-        protected defaultPrevented_: boolean;
-        protected cancelBubble_: boolean;
-        private timeStamp_;
-        constructor(type: string, bubbles?: boolean, cancelable?: boolean);
-        /**
-         * @inheritdoc
-         */
-        initEvent(type: string, bubbles: boolean, cancelable: boolean): void;
-        /**
-         * @inheritdoc
-         */
-        preventDefault(): void;
-        /**
-         * @inheritdoc
-         */
-        stopImmediatePropagation(): void;
-        /**
-         * @inheritdoc
-         */
-        stopPropagation(): void;
-        /**
-         * @inheritdoc
-         */
-        type: string;
-        /**
-         * @inheritdoc
-         */
-        target: IEventDispatcher;
-        /**
-         * @inheritdoc
-         */
-        currentTarget: IEventDispatcher;
-        /**
-         * @inheritdoc
-         */
-        isTrusted: boolean;
-        /**
-         * @inheritdoc
-         */
-        bubbles: boolean;
-        /**
-         * @inheritdoc
-         */
-        cancelable: boolean;
-        /**
-         * @inheritdoc
-         */
-        eventPhase: number;
-        /**
-         * @inheritdoc
-         */
-        defaultPrevented: boolean;
-        /**
-         * @inheritdoc
-         */
-        srcElement: Element;
-        /**
-         * @inheritdoc
-         */
-        cancelBubble: boolean;
-        /**
-         * @inheritdoc
-         */
-        timeStamp: number;
-        /**
-         * Don't know what it is.
-         */
-        returnValue: boolean;
-    }
-    class ProgressEvent extends BasicEvent {
-        static PROGRESS: string;
-        protected numerator_: number;
-        protected denominator_: number;
-        constructor(type: string, numerator: number, denominator: number);
-        numerator: number;
-        denominator: number;
-    }
-}
-declare namespace samchon.collection {
-    interface CollectionEventListener<T> extends EventListener {
-        (event: CollectionEvent<T>): void;
-    }
-    class CollectionEvent<T> extends library.BasicEvent {
-        static INSERT: string;
-        static ERASE: string;
-        private first_;
-        private last_;
-        constructor(type: string, first: std.Iterator<T>, last: std.Iterator<T>);
-        container: ICollection<T>;
-        first: std.Iterator<T>;
-        last: std.Iterator<T>;
-    }
-}
-declare namespace samchon.collection {
-    /**
-     * A {@link Deque} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class DequeCollection<T> extends std.Deque<T> implements ICollection<T> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        push<U extends T>(...items: U[]): number;
-        /**
-         * @inheritdoc
-         */
-        push_back(val: T): void;
-        /**
-         * @hidden
-         */
-        protected insert_by_repeating_val(position: std.DequeIterator<T>, n: number, val: T): std.DequeIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends std.Iterator<U>>(position: std.DequeIterator<T>, begin: InputIterator, end: InputIterator): std.DequeIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        pop_back(): void;
-        /**
-         * @hidden
-         */
-        protected erase_by_range(first: std.DequeIterator<T>, last: std.DequeIterator<T>): std.DequeIterator<T>;
-        /**
-         * @hidden
-         */
-        private notify_insert(first, last);
-        /**
-         * @hidden
-         */
-        private notify_erase(first, last);
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-}
-declare namespace samchon.collection {
-    /**
-     * A {@link HashMap} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class HashMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-    /**
-     * A {@link HashMultiMap} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class HashMultiMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-}
-declare namespace samchon.collection {
-    /**
-     * A {@link HashSet} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class HashSetCollection<T> extends std.TreeSet<T> implements ICollection<T> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-    class HashMultiSetCollection<T> extends std.TreeMultiSet<T> implements ICollection<T> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-}
-declare namespace samchon.collection {
-    interface CollectionHandler<T> {
-        (first: std.Iterator<T>, last: std.Iterator<T>): void;
-    }
-    interface MapCollectionHandler<Key, T> extends CollectionHandler<std.Pair<Key, T>> {
-        (first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-    }
-    /**
-     * An interface for {@link IContainer containers} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface ICollection<T> extends std.base.IContainer<T>, library.IEventDispatcher {
-        get_insert_handler(): CollectionHandler<T>;
-        get_erase_handler(): CollectionHandler<T>;
-        set_insert_handler(listener: CollectionHandler<T>): any;
-        set_erase_handler(listener: CollectionHandler<T>): any;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-}
-declare namespace samchon.collection {
-    /**
-     * A {@link List} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class ListCollection<T> extends std.List<T> implements ICollection<T> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        push<U extends T>(...items: T[]): number;
-        /**
-         * @inheritdoc
-         */
-        push_front(val: T): void;
-        /**
-         * @inheritdoc
-         */
-        push_back(val: T): void;
-        /**
-         * @hidden
-         */
-        protected insert_by_repeating_val(position: std.ListIterator<T>, n: number, val: T): std.ListIterator<T>;
-        /**
-         * @hidden
-         */
-        protected insert_by_range<U extends T, InputIterator extends std.Iterator<U>>(position: std.ListIterator<T>, begin: InputIterator, end: InputIterator): std.ListIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        pop_front(): void;
-        /**
-         * @inheritdoc
-         */
-        pop_back(): void;
-        /**
-         * @hidden
-         */
-        protected erase_by_range(first: std.ListIterator<T>, last: std.ListIterator<T>): std.ListIterator<T>;
-        /**
-         * @hidden
-         */
-        private notify_insert(first, last);
-        /**
-         * @hidden
-         */
-        private notify_erase(first, last);
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-}
-declare namespace samchon.collection {
-    /**
-     * A {@link TreeMap} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-    /**
-     * A {@link TreeMultiMap} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeMultiMapCollection<Key, T> extends std.HashMap<Key, T> implements ICollection<std.Pair<Key, T>> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): MapCollectionHandler<Key, T>;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: MapCollectionHandler<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.MapIterator<Key, T>, last: std.MapIterator<Key, T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-}
-declare namespace samchon.collection {
-    /**
-     * A {@link TreeMap} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeSetCollection<T> extends std.TreeSet<T> implements ICollection<T> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
-    /**
-     * A {@link TreeMultiSet} who can detect element I/O events.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class TreeMultiSetCollection<T> extends std.TreeMultiSet<T> implements ICollection<T> {
-        private insert_handler_;
-        private erase_handler_;
-        private event_dispatcher_;
-        /**
-         * @inheritdoc
-         */
-        set_insert_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        set_erase_handler(listener: CollectionHandler<T>): void;
-        /**
-         * @inheritdoc
-         */
-        get_insert_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        get_erase_handler(): CollectionHandler<T>;
-        /**
-         * @inheritdoc
-         */
-        protected handle_insert(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        protected handle_erase(first: std.SetIterator<T>, last: std.SetIterator<T>): void;
-        /**
-         * @inheritdoc
-         */
-        hasEventListener(type: string): boolean;
-        /**
-         * @inheritdoc
-         */
-        dispatchEvent(event: Event): boolean;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        addEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>): void;
-        /**
-         * @inheritdoc
-         */
-        removeEventListener(type: "insert" | "erase", listener: CollectionEventListener<T>, thisArg: Object): void;
-    }
+declare namespace samchon.example {
+    function test_web_client(): void;
 }
 declare namespace samchon.library {
     /**
@@ -1568,7 +1557,7 @@ declare namespace samchon.library {
         /**
          * <p> An array using for dividing each element index. </p>
          */
-        private dividerArray;
+        private divider_array;
         /**
          * <p> Construct from size of N and R. </p>
          *
@@ -1626,11 +1615,7 @@ declare namespace samchon.library {
      * class), you can instead implement the IEventDispatcher interface, create an EventDispatcher member,
      * and write simple hooks to route calls into the aggregated EventDispatcher. </p>
      *
-     * <ul>
-     *  <li> Made by AS3 - http://help.adobe.com/en_US/FlashPlatform/reference/actionscript/3/flash/events/IEventDispatcher.html
-     * </ul>
-     *
-     * @see EventDispatcher
+     * @reference http://help.adobe.com/en_US/FlashPlatform/reference/actionscript/3/flash/events/IEventDispatcher.html
      * @author Migrated by Jeongho Nam <http://samchon.org>
      */
     interface IEventDispatcher {
@@ -1656,7 +1641,51 @@ declare namespace samchon.library {
          *			  dispatched, its target property cannot be changed, so you must create a new copy
          *			  of the event for redispatching to work.
          */
-        dispatchEvent(event: BasicEvent): boolean;
+        dispatchEvent(event: library.BasicEvent): boolean;
+        /**
+         * <p> Registers an event listener object with an EventDispatcher object so that the listener
+         * receives notification of an event. You can register event listeners on all nodes in the display
+         * list for a specific type of event, phase, and priority.
+         *
+         * <p> After you successfully register an event listener, you cannot change its priority through
+         * additional calls to addEventListener(). To change a listener's priority, you must first call
+         * removeEventListener(). Then you can register the listener again with the new priority level. </p>
+         *
+         * <p> Keep in mind that after the listener is registered, subsequent calls to addEventListener()
+         * with a different type or useCapture value result in the creation of a separate listener
+         * registration. For example, if you first register a listener with useCapture set to true,
+         * it listens only during the capture phase. If you call addEventListener() again using the same
+         * listener object, but with useCapture set to false, you have two separate listeners: one that
+         * listens during the capture phase and another that listens during the target and bubbling phases. </p>
+         *
+         * <p> You cannot register an event listener for only the target phase or the bubbling phase.
+         * Those phases are coupled during registration because bubbling applies only to the ancestors of
+         * the target node. </p>
+         *
+         * <p> If you no longer need an event listener, remove it by calling removeEventListener(), or
+         * memory problems could result. Event listeners are not automatically removed from memory because
+         * the garbage collector does not remove the listener as long as the dispatching object exists
+         * (unless the useWeakReference parameter is set to true). </p>
+         *
+         * <p> Copying an EventDispatcher instance does not copy the event listeners attached to it. (If
+         * your newly created node needs an event listener, you must attach the listener after creating
+         * the node.) However, if you move an EventDispatcher instance, the event listeners attached to
+         * it move along with it. </p>
+         *
+         * <p> If the event listener is being registered on a node while an event is also being processed
+         * on this node, the event listener is not triggered during the current phase but may be triggered
+         * during a later phase in the event flow, such as the bubbling phase. </p>
+         *
+         * <p> If an event listener is removed from a node while an event is being processed on the node,
+         * it is still triggered by the current actions. After it is removed, the event listener is never
+         * invoked again (unless it is registered again for future processing). </p>
+         *
+         * @param event The type of event.
+         * @param listener The listener function that processes the event.
+         *				 This function must accept an Event object as its only parameter and must return
+         *				 nothing.
+         */
+        addEventListener(type: string, listener: EventListener): void;
         /**
          * <p> Registers an event listener object with an EventDispatcher object so that the listener
          * receives notification of an event. You can register event listeners on all nodes in the display
@@ -1701,6 +1730,14 @@ declare namespace samchon.library {
          *				 nothing.
          */
         addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * Removes a listener from the EventDispatcher object. If there is no matching listener registered
+         * with the EventDispatcher object, a call to this method has no effect.
+         *
+         * @param type The type of event.
+         * @param listener The listener object to remove.
+         */
+        removeEventListener(type: string, listener: EventListener): void;
         /**
          * Removes a listener from the EventDispatcher object. If there is no matching listener registered
          * with the EventDispatcher object, a call to this method has no effect.
@@ -1784,11 +1821,264 @@ declare namespace samchon.library {
         /**
          * @inheritdoc
          */
-        addEventListener(type: string, listener: EventListener, thisArg?: Object): void;
+        addEventListener(type: string, listener: EventListener): void;
         /**
          * @inheritdoc
          */
-        removeEventListener(type: string, listener: EventListener, thisArg?: Object): void;
+        addEventListener(type: string, listener: EventListener, thisArg: Object): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener): void;
+        /**
+         * @inheritdoc
+         */
+        removeEventListener(type: string, listener: EventListener, thisArg: Object): void;
+    }
+}
+declare namespace samchon.library {
+    /**
+     * <p> The {@link FileReference} class provides a means to load and save files in browser level. </p>
+     *
+     * <p> The {@link FileReference} class provides a means to {@link load} and {@link save} files in browser level. A
+     * browser-system dialog box prompts the user to select a file to {@link load} or a location for {@link svae}. Each
+     * {@link FileReference} object refers to a single file on the user's disk and has properties that contain
+     * information about the file's size, type, name, creation date, modification date, and creator type (Macintosh only).
+     * </p>
+     *
+     * <p> FileReference instances are created in the following ways: </p>
+     * <ul>
+     *	<li>
+     *		When you use the new operator with the {@link FileReference} constructor:
+     *		<code>var myFileReference = new FileReference();</code>
+     *	</li>
+     *	<li>
+     *		When you call the {@link FileReferenceList.browse} method, which creates an array of {@link FileReference}
+     *		objects.
+     *	</li>
+     * </ul>
+     *
+     * <p> During a load operation, all the properties of a {@link FileReference} object are populated by calls to the
+     * {@link FileReference.browse} or {@link FileReferenceList.browse} methods. During a save operation, the name
+     * property is populated when the select event is dispatched; all other properties are populated when the complete
+     * event is dispatched. </p>
+     *
+     * <p> The {@link browse browse()} method opens an browser-system dialog box that prompts the user to select a file
+     * for {@link load}. The {@link FileReference.browse} method lets the user select a single file; the
+     * {@link FileReferenceList.browse} method lets the user select multiple files. After a successful call to the
+     * {@link browse browse()} method, call the {@link FileReference.load} method to load one file at a time. The
+     * {@link FileReference.save} method prompts the user for a location to save the file and initiates downloading from
+     * a binary or string data. </p>
+     *
+     * <p> The {@link FileReference} and {@link FileReferenceList} classes do not let you set the default file location
+     * for the dialog box that the {@link browse} or {@link save} methods generate. The default location shown in the
+     * dialog box is the most recently browsed folder, if that location can be determined, or the desktop. The classes do
+     * not allow you to read from or write to the transferred file. They do not allow the browser that initiated the
+     * {@link load} or {@link save} to access the loaded or saved file or the file's location on the user's disk. </p>
+     *
+     * @references http://help.adobe.com/en_US/FlashPlatform/reference/actionscript/3/flash/net/FileReference.html
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class FileReference extends EventDispatcher {
+        /**
+         * @hidden
+         */
+        private file_;
+        /**
+         * @hidden
+         */
+        private data_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * <p> The data from the loaded file after a successful call to the {@link load load()} method. </p>
+         *
+         * <p> If the {@link FileReference} object was not populated (by a valid call to {@link FileReference.browse}),
+         * an {@link LogicError exception} will be thrown when you try to get the value of this property. </p>
+         *
+         * <p> All the properties of a {@link FileReference} object are populated by calling the {@link browse browse()}.
+         * </p>
+         */
+        data: any;
+        /**
+         * <p> The name of the file on the local disk. </p>
+         *
+         * <p> If the {@link FileReference} object was not populated (by a valid call to {@link FileReference.browse}),
+         * an {@link LogicError exception} will be thrown when you try to get the value of this property. </p>
+         *
+         * <p> All the properties of a {@link FileReference} object are populated by calling the {@link browse browse()}.
+         * </p>
+         */
+        name: string;
+        /**
+         * <p> The filename extension. </p>
+         *
+         * <p> A file's extension is the part of the name following (and not including) the final dot (&quot;.&quot;). If
+         * there is no dot in the filename, the extension is <code>null</code>. </p>
+         *
+         * <p> If the {@link FileReference} object was not populated (by a valid call to {@link FileReference.browse}),
+         * an {@link LogicError exception} will be thrown when you try to get the value of this property. </p>
+         *
+         * <p> All the properties of a {@link FileReference} object are populated by calling the {@link browse browse()}.
+         * </p>
+         */
+        extension: string;
+        /**
+         * <p> The file type, metadata of the {@link extension}. </p>
+         *
+         * <p> If the {@link FileReference} object was not populated (by a valid call to {@link FileReference.browse}),
+         * an {@link LogicError exception} will be thrown when you try to get the value of this property. </p>
+         *
+         * <p> All the properties of a {@link FileReference} object are populated by calling the {@link browse browse()}.
+         * </p>
+         */
+        type: string;
+        /**
+         * <p> The size of the file on the local disk in bytes. </p>
+         *
+         * <p> If the {@link FileReference} object was not populated (by a valid call to {@link FileReference.browse}),
+         * an {@link LogicError exception} will be thrown when you try to get the value of this property. </p>
+         *
+         * <p> All the properties of a {@link FileReference} object are populated by calling the {@link browse browse()}.
+         * </p>
+         */
+        size: number;
+        /**
+         * <p> The date that the file on the local disk was last modified. </p>
+         *
+         * <p> If the {@link FileReference} object was not populated (by a valid call to {@link FileReference.browse}),
+         * an {@link LogicError exception} will be thrown when you try to get the value of this property. </p>
+         *
+         * <p> All the properties of a {@link FileReference} object are populated by calling the {@link browse browse()}.
+         * </p>
+         */
+        modificationDate: Date;
+        /**
+         * <p> Displays a file-browsing dialog box that lets the user select a file to upload. The dialog box is native
+         * to the user's browser system. The user can select a file on the local computer or from other systems, for
+         * example, through a UNC path on Windows. </p>
+         *
+         * <p> When you call this method and the user successfully selects a file, the properties of this
+         * {@link FileReference} object are populated with the properties of that file. Each subsequent time that the
+         * {@link FileReference.browse} method is called, the {@link FileReference} object's properties are reset to
+         * the file that the user selects in the dialog box. Only one {@link browse browse()} can be performed at a time
+         * (because only one dialog box can be invoked at a time). </p>
+         *
+         * <p> Using the <i>typeFilter parameter</i>, you can determine which files the dialog box displays. </p>
+         *
+         * @param typeFilter An array of filter strings used to filter the files that are displayed in the dialog box.
+         *					 If you omit this parameter, all files are displayed.
+         */
+        browse(...typeFilter: string[]): void;
+        /**
+         * <p> Starts the load of a local file selected by a user. </p>
+         *
+         * <p> You must call the {@link FileReference.browse} or {@link FileReferenceList.browse} method before you call
+         * the {@link load load()} method. </p>
+         *
+         * <p> Listeners receive events to indicate the progress, success, or failure of the load. Although you can use
+         * the {@link FileReferenceList} object to let users select multiple files to load, you must {@link load} the
+         * {@link FileReferenceList files} one by one. To {@link load} the files one by one, iterate through the
+         * {@link FileReferenceList.fileList} array of {@link FileReference} objects. </p>
+         *
+         * <p> If the file finishes loading successfully, its contents are stored in the {@link data} property. </p>
+         */
+        load(): void;
+        /**
+         * <p> Save a file to local filesystem. </p>
+         *
+         * <p> {@link FileReference.save} implemented the save function by downloading a file from a hidden anchor tag.
+         * However, the plan, future's {@link FileReference} will follow such rule: </p>
+         *
+         * <p> Opens a dialog box that lets the user save a file to the local filesystem. </p>
+         *
+         * <p> The {@link save save()} method first opens an browser-system dialog box that asks the user to enter a
+         * filename and select a location on the local computer to save the file. When the user selects a location and
+         * confirms the save operation (for example, by clicking Save), the save process begins. Listeners receive events
+         * to indicate the progress, success, or failure of the save operation. To ascertain the status of the dialog box
+         * and the save operation after calling {@link save save()}, your code must listen for events such as cancel,
+         * open, progress, and complete. </p>
+         *
+         * <p> When the file is saved successfully, the properties of the {@link FileReference} object are populated with
+         * the properties of the local file. The complete event is dispatched if the save is successful. </p>
+         *
+         * <p> Only one {@link browse browse()} or {@link save()} session can be performed at a time (because only one
+         * dialog box can be invoked at a time). </p>
+         *
+         * @param data The data to be saved. The data can be in one of several formats, and will be treated appropriately.
+         * @param fileName File name to be saved.
+         */
+        save(data: string, fileName: string): void;
+    }
+    /**
+     * <p> The {@link FileReferenceList} class provides a means to let users select one or more files for
+     * {@link FileReference.load loading}. A {@link FileReferenceList} object represents a group of one or more local
+     * files on the user's disk as an array of {@link FileReference} objects. For detailed information and important
+     * considerations about {@link FileReference} objects and the FileReference class, which you use with
+     * {@link FileReferenceList}, see the {@link FileReference} class. </p>
+     *
+     * <p> To work with the {@link FileReferenceList} class: </p>
+     * <ul>
+     *	<li> Instantiate the class: <code>var myFileRef = new FileReferenceList();</code> </li>
+     *	<li>
+     *		Call the {@link FileReferenceList.browse} method, which opens a dialog box that lets the user select one or
+     *		more files for upload: <code>myFileRef.browse();</code>
+     *	</li>
+     *	<li>
+     *		After the {@link browse browse()} method is called successfully, the {@link fileList} property of the
+     *		{@link FileReferenceList} object is populated with an array of {@link FileReference} objects.
+     *	</li>
+     *	<li> Call {@link FileReference.load} on each element in the {@link fileList} array. </li>
+     * </ul>
+     *
+     * <p> The {@link FileReferenceList} class includes a {@link browse browse()} method and a {@link fileList} property
+     * for working with multiple files. </p>
+     *
+     * @reference http://help.adobe.com/en_US/FlashPlatform/reference/actionscript/3/flash/net/FileReferenceList.html
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class FileReferenceList extends EventDispatcher {
+        /**
+         * @hidden
+         */
+        file_list: std.Vector<FileReference>;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * <p> An array of {@link FileReference} objects. </p>
+         *
+         * <p> When the {@link FileReferenceList.browse} method is called and the user has selected one or more files
+         * from the dialog box that the {@link browse browse()} method opens, this property is populated with an array of
+         * {@link FileReference} objects, each of which represents the files the user selected. </p>
+         *
+         * <p> The {@link fileList} property is populated anew each time {@link browse browse()} is called on that
+         * {@link FileReferenceList} object. </p>
+         */
+        fileList: std.Vector<FileReference>;
+        /**
+         * <p> Displays a file-browsing dialog box that lets the user select one or more local files to upload. The
+         * dialog box is native to the user's browser system.  </p>
+         *
+         * <p> When you call this method and the user successfully selects files, the {@link fileList} property of this
+         * {@link FileReferenceList} object is populated with an array of {@link FileReference} objects, one for each
+         * file that the user selects. Each subsequent time that the {@link FileReferenceList.browse} method is called,
+         * the {@link FileReferenceList.fileList} property is reset to the file(s) that the user selects in the dialog
+         * box. </p>
+         *
+         * <p> Using the <i>typeFilter</i> parameter, you can determine which files the dialog box displays. </p>
+         *
+         * <p> Only one {@link FileReference.browse}, {@link FileReference.load}, or {@link FileReferenceList.browse}
+         * session can be performed at a time on a {@link FileReferenceList} object (because only one dialog box can be
+         * opened at a time). </p>
+         *
+         * @param typeFilter An array of filter strings used to filter the files that are displayed in the dialog box.
+         *					 If you omit this parameter, all files are displayed.
+         */
+        browse(...typeFilter: string[]): void;
     }
 }
 declare namespace samchon.library {
@@ -1923,13 +2213,140 @@ declare namespace samchon.library {
 }
 declare namespace samchon.protocol {
     /**
+     * <p> An interface of entity. </p>
+     *
+     * <p> Entity is a class for standardization of expression method using on network I/O by XML. If
+     * Invoke is a standard message protocol of Samchon Framework which must be kept, Entity is a
+     * recommended semi-protocol of message for expressing a data class. Following the semi-protocol
+     * Entity is not imposed but encouraged. </p>
+     *
+     * <p> As we could get advantages from standardization of message for network I/O with Invoke,
+     * we can get additional advantage from standardizing expression method of data class with Entity.
+     * We do not need to know a part of network communication. Thus, with the Entity, we can only
+     * concentrate on entity's own logics and relationships between another entities. Entity does not
+     * need to how network communications are being done. </p>
+     *
+     * <p> I say repeatedly. Expression method of Entity is recommended, but not imposed. It's a semi
+     * protocol for network I/O but not a essential protocol must be kept. The expression method of
+     * Entity, using on network I/O, is expressed by XML string. </p>
+     *
+     * <p> If your own network system has a critical performance issue on communication data class,
+     * it would be better to using binary communication (with ByteArray).
+     * Don't worry about the problem! Invoke also provides methods for binary data (ByteArray). </p>
+     *
      * @author Jeongho Nam <http://samchon.org>
      */
-    abstract class EntityArray<Ety extends IEntity> extends std.Vector<Ety> {
+    interface IEntity {
+        /**
+         * <p> Construct data of the Entity from a XML object. </p>
+         *
+         * <p> Overrides the construct() method and fetch data of member variables from the XML. </p>
+         *
+         * <p> By recommended guidance, data representing member variables are contained in properties
+         * of the put XML object. </p>
+         *
+         * @param xml An xml used to contruct data of entity.
+         */
+        construct(xml: library.XML): any;
+        /**
+         * <p> Get a key that can identify the Entity uniquely. </p>
+         *
+         * <p> If identifier of the Entity is not atomic value, returns a string or paired object
+         * that can represents the composite identifier. </p>
+         */
+        key(): any;
+        /**
+         * <p> A tag name when represented by XML. </p>
+         *
+         * <ul>
+         * 	<li> <TAG {...properties} /> </li>
+         * </ul>
+         */
+        TAG(): string;
+        /**
+         * <p> Get a XML object represents the Entity. </p>
+         *
+         * <p> A member variable (not object, but atomic value like number, string or date) is categorized
+         * as a property within the framework of entity side. Thus, when overriding a toXML() method and
+         * archiving member variables to an XML object to return, puts each variable to be a property
+         * belongs to only a XML object. </p>
+         *
+         * <p> Don't archive the member variable of atomic value to XML::value causing enormouse creation
+         * of XML objects to number of member variables. An Entity must be represented by only a XML
+         * instance (tag). </p>
+         *
+         * <h4> Standard Usage. </h4>
+         * <code>
+         *<memberList>
+         *	<member id='jhnam88' name='Jeongho Nam' birthdate='1988-03-11' />
+         *	<member id='master' name='Administartor' birthdate='2011-07-28' />
+         *</memberList>
+         * </code>
+         *
+         * <h4> Non-standard usage abusing value. </h4>
+         * <code>
+         *<member>
+         *	<id>jhnam88</id>
+         *	<name>Jeongho Nam</name>
+         *	<birthdate>1988-03-11</birthdate>
+         *</member>
+         *<member>
+         *	<id>master</id>
+         *	<name>Administartor</name>
+         *	<birthdate>2011-07-28</birthdate>
+         *</member>
+         * </code>
+         *
+         * @return An XML object representing the Entity.
+         */
+        toXML(): library.XML;
+    }
+    /**
+     * <p> An entity, a standard data class. </p>
+     *
+     * <p> Entity is a class for standardization of expression method using on network I/O by XML. If
+     * Invoke is a standard message protocol of Samchon Framework which must be kept, Entity is a
+     * recommended semi-protocol of message for expressing a data class. Following the semi-protocol
+     * Entity is not imposed but encouraged. </p>
+     *
+     * <p> As we could get advantages from standardization of message for network I/O with Invoke,
+     * we can get additional advantage from standardizing expression method of data class with Entity.
+     * We do not need to know a part of network communication. Thus, with the Entity, we can only
+     * concentrate on entity's own logics and relationships between another entities. Entity does not
+     * need to how network communications are being done. </p>
+     *
+     * <p> I say repeatedly. Expression method of Entity is recommended, but not imposed. It's a semi
+     * protocol for network I/O but not a essential protocol must be kept. The expression method of
+     * Entity, using on network I/O, is expressed by XML string. </p>
+     *
+     * <p> If your own network system has a critical performance issue on communication data class,
+     * it would be better to using binary communication (with ByteArray).
+     * Don't worry about the problem! Invoke also provides methods for binary data (ByteArray). </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    abstract class Entity implements IEntity {
         /**
          * Default Constructor.
          */
         constructor();
+        construct(xml: library.XML): void;
+        /**
+         * @inheritdoc
+         */
+        key(): any;
+        /**
+         * @inheritdoc
+         */
+        abstract TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        toXML(): library.XML;
+    }
+}
+declare namespace samchon.protocol {
+    interface IEntityGroup<T extends IEntity> extends IEntity, std.base.IContainer<T> {
         /**
          * <p> Construct data of the Entity from an XML object. </p>
          *
@@ -1940,8 +2357,6 @@ declare namespace samchon.protocol {
          * of XML objects representing children are done by abstract method of EntityArray::toXML(). </p>
          *
          * <p> Constructs only data of EntityArray's own. </p>
-         *
-         * @inheritdoc
          */
         construct(xml: library.XML): void;
         /**
@@ -1953,11 +2368,24 @@ declare namespace samchon.protocol {
          *
          * @return A new child Entity belongs to EntityArray.
          */
-        protected abstract createChild(xml: library.XML): Ety;
+        createChild(xml: library.XML): T;
         /**
-         * @inheritdoc
+         * <p> Get iterator to element. </p>
+         *
+         * <p> Searches the container for an element with a identifier equivalent to <i>key</i> and returns an
+         * iterator to it if found, otherwise it returns an iterator to {@link end end()}. </p>
+         *
+         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
+         * (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * <p> Another member functions, {@link has has()} and {@link count count()}, can be used to just check
+         * whether a particular <i>key</i> exists. </p>
+         *
+         * @param key Key to be searched for
+         * @return An iterator to the element, if an element with specified <i>key</i> is found, or
+         *		   {@link end end()} otherwise.
          */
-        key(): any;
+        find(key: any): std.Iterator<T>;
         /**
          * <p> Whether have the item or not. </p>
          *
@@ -1989,15 +2417,11 @@ declare namespace samchon.protocol {
          *
          * @return A reference object of the mapped value (_Ty)
          */
-        get(key: string): Ety;
-        /**
-         * @inheritdoc
-         */
-        abstract TAG(): string;
+        get(key: any): T;
         /**
          * <p> A tag name of children objects. </p>
          */
-        abstract CHILD_TAG(): string;
+        CHILD_TAG(): string;
         /**
          * <p> Get an XML object represents the EntityArray. </p>
          *
@@ -2009,7 +2433,282 @@ declare namespace samchon.protocol {
          * EntityArray::toXML(). </p>
          *
          * <p> Archives only data of EntityArray's own. </p>
-         *
+         */
+        toXML(): library.XML;
+    }
+    /**
+     * @inheritdoc
+     */
+    abstract class EntityArray<T extends IEntity> extends std.Vector<T> implements IEntityGroup<T> {
+        /**
+         * @inheritdoc
+         */
+        construct(xml: library.XML): void;
+        /**
+         * @inheritdoc
+         */
+        abstract createChild(xml: library.XML): T;
+        /**
+         * @inheritdoc
+         */
+        key(): any;
+        /**
+         * @inheritdoc
+         */
+        find(key: any): std.VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        has(key: any): boolean;
+        /**
+         * @inheritdoc
+         */
+        count(key: any): number;
+        /**
+         * @inheritdoc
+         */
+        get(key: any): T;
+        /**
+         * @inheritdoc
+         */
+        abstract TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        abstract CHILD_TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        toXML(): library.XML;
+    }
+    /**
+     * @inheritdoc
+     */
+    abstract class EntityList<T extends IEntity> extends std.List<T> implements IEntityGroup<T> {
+        /**
+         * @inheritdoc
+         */
+        construct(xml: library.XML): void;
+        /**
+         * @inheritdoc
+         */
+        abstract createChild(xml: library.XML): T;
+        /**
+         * @inheritdoc
+         */
+        key(): any;
+        /**
+         * @inheritdoc
+         */
+        find(key: any): std.ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        has(key: any): boolean;
+        /**
+         * @inheritdoc
+         */
+        count(key: any): number;
+        /**
+         * @inheritdoc
+         */
+        get(key: any): T;
+        /**
+         * @inheritdoc
+         */
+        abstract TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        abstract CHILD_TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        toXML(): library.XML;
+    }
+    /**
+     * @inheritdoc
+     */
+    abstract class EntityDeque<T extends IEntity> extends std.Deque<T> implements IEntityGroup<T> {
+        /**
+         * @inheritdoc
+         */
+        construct(xml: library.XML): void;
+        /**
+         * @inheritdoc
+         */
+        abstract createChild(xml: library.XML): T;
+        /**
+         * @inheritdoc
+         */
+        key(): any;
+        /**
+         * @inheritdoc
+         */
+        find(key: any): std.DequeIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        has(key: any): boolean;
+        /**
+         * @inheritdoc
+         */
+        count(key: any): number;
+        /**
+         * @inheritdoc
+         */
+        get(key: any): T;
+        /**
+         * @inheritdoc
+         */
+        abstract TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        abstract CHILD_TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        toXML(): library.XML;
+    }
+}
+declare namespace samchon.protocol {
+    /**
+     * @inheritdoc
+     */
+    interface IEntityCollection<T extends IEntity> extends IEntityGroup<T>, collection.ICollection<T> {
+    }
+    /**
+     * @inheritdoc
+     */
+    abstract class EntityArrayCollection<T extends IEntity> extends collection.ArrayCollection<T> implements IEntityCollection<T> {
+        /**
+         * @inheritdoc
+         */
+        construct(xml: library.XML): void;
+        /**
+         * @inheritdoc
+         */
+        abstract createChild(xml: library.XML): T;
+        /**
+         * @inheritdoc
+         */
+        key(): any;
+        /**
+         * @inheritdoc
+         */
+        find(key: any): std.VectorIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        has(key: any): boolean;
+        /**
+         * @inheritdoc
+         */
+        count(key: any): number;
+        /**
+         * @inheritdoc
+         */
+        get(key: any): T;
+        /**
+         * @inheritdoc
+         */
+        abstract TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        abstract CHILD_TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        toXML(): library.XML;
+    }
+    /**
+     * @inheritdoc
+     */
+    abstract class EntityListCollection<T extends IEntity> extends collection.ListCollection<T> implements IEntityCollection<T> {
+        /**
+         * @inheritdoc
+         */
+        construct(xml: library.XML): void;
+        /**
+         * @inheritdoc
+         */
+        abstract createChild(xml: library.XML): T;
+        /**
+         * @inheritdoc
+         */
+        key(): any;
+        /**
+         * @inheritdoc
+         */
+        find(key: any): std.ListIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        has(key: any): boolean;
+        /**
+         * @inheritdoc
+         */
+        count(key: any): number;
+        /**
+         * @inheritdoc
+         */
+        get(key: any): T;
+        /**
+         * @inheritdoc
+         */
+        abstract TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        abstract CHILD_TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        toXML(): library.XML;
+    }
+    /**
+     * @inheritdoc
+     */
+    abstract class EntityDequeCollection<T extends IEntity> extends collection.DequeCollection<T> implements IEntityCollection<T> {
+        /**
+         * @inheritdoc
+         */
+        construct(xml: library.XML): void;
+        /**
+         * @inheritdoc
+         */
+        abstract createChild(xml: library.XML): T;
+        /**
+         * @inheritdoc
+         */
+        key(): any;
+        /**
+         * @inheritdoc
+         */
+        find(key: any): std.DequeIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        has(key: any): boolean;
+        /**
+         * @inheritdoc
+         */
+        count(key: any): number;
+        /**
+         * @inheritdoc
+         */
+        get(key: any): T;
+        /**
+         * @inheritdoc
+         */
+        abstract TAG(): string;
+        /**
+         * @inheritdoc
+         */
+        abstract CHILD_TAG(): string;
+        /**
          * @inheritdoc
          */
         toXML(): library.XML;
@@ -2200,97 +2899,6 @@ declare namespace samchon.protocol {
         toXML(): library.XML;
     }
 }
-declare namespace samchon.protocol {
-    /**
-     * <p> An interface of entity. </p>
-     *
-     * <p> Entity is a class for standardization of expression method using on network I/O by XML. If
-     * Invoke is a standard message protocol of Samchon Framework which must be kept, Entity is a
-     * recommended semi-protocol of message for expressing a data class. Following the semi-protocol
-     * Entity is not imposed but encouraged. </p>
-     *
-     * <p> As we could get advantages from standardization of message for network I/O with Invoke,
-     * we can get additional advantage from standardizing expression method of data class with Entity.
-     * We do not need to know a part of network communication. Thus, with the Entity, we can only
-     * concentrate on entity's own logics and relationships between another entities. Entity does not
-     * need to how network communications are being done. </p>
-     *
-     * <p> I say repeatedly. Expression method of Entity is recommended, but not imposed. It's a semi
-     * protocol for network I/O but not a essential protocol must be kept. The expression method of
-     * Entity, using on network I/O, is expressed by XML string. </p>
-     *
-     * <p> If your own network system has a critical performance issue on communication data class,
-     * it would be better to using binary communication (with ByteArray).
-     * Don't worry about the problem! Invoke also provides methods for binary data (ByteArray). </p>
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IEntity {
-        /**
-         * <p> Construct data of the Entity from a XML object. </p>
-         *
-         * <p> Overrides the construct() method and fetch data of member variables from the XML. </p>
-         *
-         * <p> By recommended guidance, data representing member variables are contained in properties
-         * of the put XML object. </p>
-         *
-         * @param xml An xml used to contruct data of entity.
-         */
-        construct(xml: library.XML): any;
-        /**
-        * <p> Get a key that can identify the Entity uniquely. </p>
-        *
-        * <p> If identifier of the Entity is not atomic value, returns a string or paired object
-        * that can represents the composite identifier. </p>
-        */
-        key(): any;
-        /**
-         * <p> A tag name when represented by XML. </p>
-         *
-         * <ul>
-         * 	<li> &lt;TAG {...properties} /&gt; </li>
-         * </ul>
-         */
-        TAG(): string;
-        /**
-         * <p> Get a XML object represents the Entity. </p>
-         *
-         * <p> A member variable (not object, but atomic value like number, string or date) is categorized
-         * as a property within the framework of entity side. Thus, when overriding a toXML() method and
-         * archiving member variables to an XML object to return, puts each variable to be a property
-         * belongs to only a XML object. </p>
-         *
-         * <p> Don't archive the member variable of atomic value to XML::value causing enormouse creation
-         * of XML objects to number of member variables. An Entity must be represented by only a XML
-         * instance (tag). </p>
-         *
-         * <table>
-         *	<tr>
-         *		<th> Standard Usage </th>
-         *		<th> Non-standard usage abusing value </th>
-         *	</tr>
-         *	<tr>
-         *		<td>
-         *		  &lt;memberList&gt; <br>
-         *		  &lt;member id='jhnam88' name='Jeongho+Nam' birthdate='1988-03-11' /&gt; <br>
-    &lt;member id='master' name='Administartor' birthdate='2011-07-28' /&gt; <br>
-&lt;/memberList&gt;
-         *		</td>
-         *		<td>
-         *		  &lt;member&gt;
-         *		  &lt;id&gt;jhnam88&lt;/id&gt;
-         *		  &lt;name&gt;Jeongho+Nam&lt;name&gt;
-         *		  &lt;birthdate&gt;1988-03-11&lt;/birthdate&gt;
-         *		  &lt;/member&gt;
-         *		</td>
-         *	</tr>
-         * </table>
-         *
-         * @return An XML object representing the Entity.
-         */
-        toXML(): library.XML;
-    }
-}
 declare namespace samchon.protocol {
     /**
      * <p> An interface for Invoke message chain. </p>
@@ -2364,7 +2972,7 @@ declare namespace samchon.protocol {
         /**
          * @inheritdoc
          */
-        protected createChild(xml: library.XML): InvokeParameter;
+        createChild(xml: library.XML): InvokeParameter;
         /**
          * Get listener.
          */
@@ -2493,10 +3101,33 @@ declare namespace samchon.protocol {
          * <p> Value of the parameter. </p>
          */
         protected value: any;
+        /**
+         * Default Constructor.
+         */
         constructor();
+        /**
+         * Initialization Constructor without type specification.
+         *
+         * @param name
+         * @param val
+         */
         constructor(name: string, val: any);
+        /**
+         * Initialization Constructor.
+         *
+         * @param name
+         * @param type
+         * @param val
+         */
         constructor(name: string, type: string, val: any);
+        /**
+         * @inheritdoc
+         */
         construct(xml: library.XML): void;
+        setValue(value: any): void;
+        /**
+         * @inheritdoc
+         */
         key(): any;
         /**
          * Get name.
@@ -2510,7 +3141,13 @@ declare namespace samchon.protocol {
          * Get value.
          */
         getValue(): any;
+        /**
+         * @inheritdoc
+         */
         TAG(): string;
+        /**
+         * @inheritdoc
+         */
         toXML(): library.XML;
     }
 }
@@ -2546,10 +3183,7 @@ declare namespace samchon.protocol {
          * <p> A socket for network I/O. </p>
          */
         private socket;
-        /**
-         * <p> Unused string from a server. </p>
-         */
-        private str;
+        private binary_invoke;
         /**
          * <p> An open-event listener. </p>
          */
@@ -2581,7 +3215,7 @@ declare namespace samchon.protocol {
          * 		Local untrusted SWF files may not communicate with the Internet. You can work around
          * 		this limitation by reclassifying the file as local-with-networking or as trusted.
          */
-        connect(ip: string, port: number): void;
+        connect(ip: string, port: number, path?: string): void;
         /**
          * <p> Send data to the server. </p>
          */
diff --git a/samchon-library/samchon-library-tests.ts b/samchon-library/samchon-library-tests.ts
index a2b0656d5f..186a2f0348 100644
--- a/samchon-library/samchon-library-tests.ts
+++ b/samchon-library/samchon-library-tests.ts
@@ -1,7 +1,4 @@
 /// <reference path="samchon-library.d.ts" />
 
-declare var global: any;
-declare var require: (name: string) => any;
-
-library = require("samchon-library");
+import library = require("samchon-library");
 console.log(library);
\ No newline at end of file
diff --git a/samchon-library/samchon-library.d.ts b/samchon-library/samchon-library.d.ts
index 3daecf0937..1ae5be40e5 100644
--- a/samchon-library/samchon-library.d.ts
+++ b/samchon-library/samchon-library.d.ts
@@ -3,21 +3,11 @@
 // Definitions by: Jeongho Nam <http://samchon.org>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-// ------------------------------------------------------------------------------------
-// In Samchon Collection, merging multiple 'ts' files to a module is not possible yet.
-// Instead of using "import" instruction, use such trick: 
-//
-// <code>
-// declare var global: any;
-// declare var require: Function;
-//
-// library = require("samchon-library");
-// let xml: library.XML = new library.XML();
-// </code>
-//
-// Those declaration of global and require can be substituted by using "node.d.ts"
-// ------------------------------------------------------------------------------------
-
 /// <reference path="../samchon-framework/samchon-framework.d.ts" />
 
-declare var library: typeof samchon.library;
\ No newline at end of file
+declare module "samchon-library"
+{
+	import library = samchon.library;
+	export = library;
+}
+
diff --git a/typescript-stl/typescript-stl-tests.ts b/typescript-stl/typescript-stl-tests.ts
index aebf205f06..cc684cde7e 100644
--- a/typescript-stl/typescript-stl-tests.ts
+++ b/typescript-stl/typescript-stl-tests.ts
@@ -1,7 +1,4 @@
 /// <reference path="typescript-stl.d.ts" />
 
-declare var global: any;
-declare var require: any;
-
-global["std"] = require("typescript-stl");
+import std = require("typescript-stl");
 std.example.test_all();
\ No newline at end of file
diff --git a/typescript-stl/typescript-stl.d.ts b/typescript-stl/typescript-stl.d.ts
index 0ef62635e8..9baa19ec30 100644
--- a/typescript-stl/typescript-stl.d.ts
+++ b/typescript-stl/typescript-stl.d.ts
@@ -1,22 +1,12 @@
-// Type definitions for TypeScript-STL v1.0.0-rc.1
+// Type definitions for TypeScript-STL v1.0.0-rc.2
 // Project: https://github.com/samchon/stl
 // Definitions by: Jeongho Nam <http://samchon.org>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-// ------------------------------------------------------------------------------------
-// In TypeScript, merging multiple 'ts' files to a module is not possible yet.
-// Instead of using "import" instruction, use such trick: 
-//
-// <code>
-// declare var global: any;
-// declare var require: Function;
-//
-// global["std"] = require("typescript-stl");
-// let list: std.List<number> = new std.List<number>();
-// </code>
-//
-// Those declaration of global and require can be substituted by using "node.d.ts"
-// ------------------------------------------------------------------------------------
+declare module "typescript-stl"
+{
+        export = std;
+}
 
 /**
  * <h1> TypeScript-STL </h1>
@@ -25,138 +15,11 @@
  *
  * <p> GitHub Repository: https://github.com/samchon/stl </p>
  *
- *
- * <h2> Introduction </h2>
  * <p> STL (Standard Template Library) Containers and Algorithms for TypeScript. </p>
  *
  * <p> TypeScript-STL is a TypeScript's <b>Standard Template Library</b> who is migrated from C++ STL. Most of classes
  * and functions of STL have implemented. Just enjoy it. </p>
  *
- * <p> <img src="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png"
- *			alt="Abstract Containers"
- *			style="max-width: 100%" /> </p>
- *
- * <h4> Containers </h4>
- * <ul>
- *	<li> Linear Containers </li>
- *	<ul>
- *		<li> <a href="http://samchon.github.io/stl/api/classes/std.vector.html">Vector</a> </li>
- *		<li> <a href="http://samchon.github.io/stl/api/classes/std.list.html">List</a> </li>
- *		<li> <a href="http://samchon.github.io/stl/api/classes/std.deque.html">Deque</a> </li>
- *		<li> Miscellaneous </li>
- *		<ul>
- *			<li> <a href="http://samchon.github.io/stl/api/classes/std.queue.html">Queue</a> </li>
- *			<li> <a href="http://samchon.github.io/stl/api/classes/std.stack.html">Stack</a> </li>
- *			<li> <a href="http://samchon.github.io/stl/api/classes/std.priorityqueue.html">PriorityQueue</a> </li>
- *		</ul>
- *	</ul>
- *	<li> <a href="http://samchon.github.io/stl/api/classes/std.base.tree.rbtree.html">Tree-structured Containers</a> </li>
- *	<ul>
- *		<li>
- *			<a href="http://samchon.github.io/stl/api/classes/std.treeset.html">TreeSet</a>,
- *			<a href="http://samchon.github.io/stl/api/classes/std.treemultiset.html">TreeMultiSet</a>
- *		</li>
- *		<li>
- *			<a href="http://samchon.github.io/stl/api/classes/std.treemap.html">TreeMap</a>,
- *			<a href="http://samchon.github.io/stl/api/classes/std.treemultimap.html">TreeMultiMap</a>
- *		</li>
- *	</ul>
- *	<li> <a href="http://samchon.github.io/stl/api/classes/std.base.hash.hashbuckets.html">Hashed Containers</a> </li>
- *	<ul>
- *		<li>
- *			<a href="http://samchon.github.io/stl/api/classes/std.hashset.html">HashSet</a>,
- *			<a href="http://samchon.github.io/stl/api/classes/std.hashmultiset.html">TreeMultiset</a>
- *		</li>
- *		<li>
- *			<a href="http://samchon.github.io/stl/api/classes/std.hashmap.html">HashMap</a>,
- *			<a href="http://samchon.github.io/stl/api/classes/std.HashMultiMap.html">HashMultiMap</a>
- *		</li>
- *	</ul>
- * </ul>
- *
- * <h4> Global Functions </h4>
- * <ul>
- *	<li> <a href="http://www.cplusplus.com/reference/algorithm">&lt;algorithm&gt;</a> </li>
- *	<li> <a href="http://www.cplusplus.com/reference/exception">&lt;exceptional&gt;</a> </li>
- *	<li> <a href="http://www.cplusplus.com/reference/functional">&lt;functional&gt;</a> </li>
- *	<ul>
- *		<li> <a href="http://samchon.github.io/stl/api/classes/std.bind.html">std.bind</a> </li>
- *	</ul>
- *	<li> &lt;utility&gt; </li>
- *	<ul>
- *		<li> <a href="http://samchon.github.io/stl/api/classes/std.pair.html">std.Pair</a> </li>
- *	</ul>
- * </ul>
- *
- *
- * <h2> References </h2>
- * <p> You can learn and explore about TypeScript-STL more deeply with such below: </p>
- * <ul>
- *	<li> <a href="https://github.com/samchon/stl">GitHub Repository</a> </li>
- *	<li> <a href="https://github.com/samchon/stl/wiki">Guidebook (wiki)</a> </li>
- *	<li> <a href="http://samchon.github.io/stl/api">API Documents</a> </li>
- *	<li> <a href="https://samchon.github.io/stl/design/class_diagram.pdf">Class Diagram</a> </li>
- * </ul>
- *
- *
- * <h2> Installation </h2>
- * <h4> Node </h4>
- * <code> npm install -g typescript-stl </code>
- *
- * <h5> TypeScript </h5>
- * <code>
- * // SOMEWHERE PLACE NODE AND STL HEADERS EXIST
- * /// <reference path="node.d.ts" />
- * /// <reference path="typescript-stl.d.ts" />
- *
- * global["std"] = require("typescript-stl");
- * let list: std.List<string> = new std.List<string>();
- * </code>
- *
- * <h5> Pure JavaScript </h5>
- * <code>
- * var std = require("typescript-stl");
- * var list = new std.List();
- * </code>
- *
- * <h4> Browser </h4>
- * <h5> In HTML Document </h5>
- *
- * <h5> TypeScript, reference difinitions (header) </h5>
- * <code>
- * /// <reference path="typescript-stl.d.ts" />
- * </code>
- *
- *
- * <h2> Index of Guidance, Wiki </h2>
- * <ul>
- *	<li> <a href="https://github.com/samchon/stl/wiki/Home"><b>Outline</b></a> </li>
- *	<ul>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Home#introduction">Introduction</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Home#references">References</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Home#installation">Installation</a> </li>
- *	</ul>
- *	<li> <a href="https://github.com/samchon/stl/wiki/Differences"><b>Differences between C++</b></a> </li>
- *	<ul>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#naming-convention">Naming Convention</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#operator-overriding">Operator Overring</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#iterator">Iterator</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#tree-container">Tree Container</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Differences#hash-container">Hash Container</a> </li>
- *	</ul>
- *	<li> <a href="https://github.com/samchon/stl/wiki/Tutorial"><b>Tutorial</b></a> </li>
- *	<ul>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#linear-container">Linear Container</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#tree-container">Tree Container</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial#hash-container">Hash Container</a> </li>
- *		<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous">Miscellaneous</a> </li>
- *		<ul>
- *			<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous#algorithm">Algorithm</a> </li>
- *			<li> <a href="https://github.com/samchon/stl/wiki/Tutorial-Miscellaneous#functional">Functional</a> </li>
- *		</ul>
- *	</ul>
- * </ul>
- *
  * @author Jeongho Nam <http://samchon.org>
  */
 declare namespace std {
@@ -2802,7 +2665,9 @@ declare namespace std.base {
     /**
      * <p> An abstract container. </p>
      *
-     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -2921,7 +2786,9 @@ declare namespace std {
      * <p> There is not a single type of {@link Iterator bidirectional iterator}: {@link IContainer Each container}
      * may define its own specific iterator type able to iterate through it and access its elements. </p>
      *
-     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @reference http://www.cplusplus.com/reference/iterator/BidirectionalIterator
      * @author Jeongho Nam <http://samchon.org>
@@ -3005,7 +2872,9 @@ declare namespace std {
      * first element in a range is reversed, the reversed iterator points to the element before the first element (this
      * would be the past-the-end element of the reversed range). </p>
      *
-     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @reference http://www.cplusplus.com/reference/iterator/reverse_iterator
      * @author Jeongho Nam <http://samchon.org>
@@ -3235,7 +3104,9 @@ declare namespace std {
      * the end, {@link Deque Deques} perform worse and have less consistent iterators and references than
      * {@link List Lists}. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -3523,7 +3394,9 @@ declare namespace std {
     /**
      * <p> An iterator of {@link Deque}. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
@@ -3593,7 +3466,9 @@ declare namespace std {
     /**
      * <p> A reverse-iterator of Deque. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @param <T> Type of the elements.
      *
@@ -3668,7 +3543,8 @@ declare namespace std {
      * <p> All objects thrown by components of the standard library are derived from this class.
      * Therefore, all standard exceptions can be caught by catching this type by reference. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/exception/exception
      * @author Jeongho Nam <http://samchon.org>
@@ -3716,7 +3592,8 @@ declare namespace std {
      *
      * <p> It is used as a base class for several logical error exceptions. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/logic_error
      * @author Jeongho Nam <http://samchon.org>
@@ -3741,7 +3618,8 @@ declare namespace std {
      * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
      * exception to be thrown by programs. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank"> <
+     * img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/domain_error
      * @author Jeongho Nam <http://samchon.org>
@@ -3762,7 +3640,8 @@ declare namespace std {
      * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
      * also throw exceptions of this type to signal invalid arguments. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/invalid_argument
      * @author Jeongho Nam <http://samchon.org>
@@ -3783,7 +3662,8 @@ declare namespace std {
      * <p> It is a standard exception that can be thrown by programs. Some components of the standard library,
      * such as vector and string also throw exceptions of this type to signal errors resizing. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/length_error
      * @author Jeongho Nam <http://samchon.org>
@@ -3805,7 +3685,8 @@ declare namespace std {
      * such as vector, deque, string and bitset also throw exceptions of this type to signal arguments
      * out of range. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/out_of_range
      * @author Jeongho Nam <http://samchon.org>
@@ -3826,7 +3707,8 @@ declare namespace std {
      *
      * <p> It is used as a base class for several runtime error exceptions. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/runtime_error
      * @author Jeongho Nam <http://samchon.org>
@@ -3847,7 +3729,8 @@ declare namespace std {
      * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
      * also throw exceptions of this type to signal range errors. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/outflow_error
      * @author Jeongho Nam <http://samchon.org>
@@ -3868,7 +3751,8 @@ declare namespace std {
      * <p> No component of the standard library throws exceptions of this type. It is designed as a standard
      * exception to be thrown by programs. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/underflow_error
      * @author Jeongho Nam <http://samchon.org>
@@ -3890,7 +3774,8 @@ declare namespace std {
      * <p> It is a standard exception that can be thrown by programs. Some components of the standard library
      * also throw exceptions of this type to signal range errors. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/stdexcept/range_error
      * @author Jeongho Nam <http://samchon.org>
@@ -4451,7 +4336,8 @@ declare namespace std.base {
      * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
      * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -4588,7 +4474,7 @@ declare namespace std.base {
          * (i.e., its <i>reverse beginning</i>). </p>
          *
          * {@link MapReverseIterator Reverse iterators} iterate backwards: increasing them moves them towards the
-         * beginning of the  </p>
+         * beginning of the container. </p>
          *
          * <p> {@link rbegin} points to the element preceding the one that would be pointed to by member {@link end}.
          * </p>
@@ -4852,7 +4738,8 @@ declare namespace std {
     /**
      * <p> An iterator of {@link MapContainer map container}. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
@@ -4922,7 +4809,8 @@ declare namespace std {
     /**
      * <p> A reverse-iterator of {@link MapContainer map container}. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
@@ -4961,7 +4849,8 @@ declare namespace std.base {
      * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
      * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -5114,7 +5003,8 @@ declare namespace std.base {
      * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
      * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -5202,246 +5092,6 @@ declare namespace std.base {
         swap(obj: MultiMap<Key, T>): void;
     }
 }
-declare namespace std.base {
-    /**
-     * <p> Common interface for hash map. </p>
-     *
-     * <p> {@link IHashMap}s are associative containers that store elements formed by the combination of
-     * a <i>key value</i> and a <i>mapped value</i>. </p>
-     *
-     * <p> In an {@link IHashMap}, the <i>key value</i> is generally used to uniquely identify the
-     * element, while the <i>mapped value</i> is an object with the content associated to this <i>key</i>.
-     * Types of <i>key</i> and <i>mapped value</i> may differ. </p>
-     *
-     * <p> Internally, the elements in the {@link IHashMap} are not sorted in any particular order with
-     * respect to either their <i>key</i> or <i>mapped values</i>, but organized into <i>buckets</i> depending on
-     * their hash values to allow for fast access to individual elements directly by their <i>key values</i>
-     * (with a constant average time complexity on average). </p>
-     *
-     * <p> Elements with equivalent <i>keys</i> are grouped together in the same bucket and in such a way that
-     * an iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Hashed </dt>
-     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
-     *		 by their <i>key</i>. </dd>
-     *
-     *	<dt> Map </dt>
-     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
-     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
-     * </dl>
-     *
-     * @param <Key> Type of the key values.
-     *				Each element in an {@link IHashMap} is identified by a key value.
-     * @param <T> Type of the mapped value.
-     *			  Each element in an {@link IHashMap} is used to store some data as its mapped value.
-     *
-     * @reference http://www.cplusplus.com/reference/unordered_map
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IHashMap<Key, T> {
-        /**
-         * <p> Return iterator to beginning. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the {@link IHashMap}. </p>
-         *
-         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
-         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
-         * container, until invalidated. </p>
-         *
-         * @return An iterator to the first element in the container.
-         */
-        begin(): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to beginning. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashMap}. </p>
-         *
-         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
-         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
-         * bucket, until invalidated. </p>
-         *
-         * @param index Bucket number. This shall be lower than {@link bucket_count}.
-         *
-         * @return An iterator to the first element in the bucket.
-         */
-        begin(index: number): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to end. </p>
-         *
-         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
-         *
-         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
-         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
-         * not be dereferenced - it is generally used to describe the open-end of a range, such as
-         * [<i>begin</i>, <i>end</i>). </p>
-         *
-         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
-         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
-         * until invalidated. </p>
-         *
-         * @return An iterator to the element past the end of the container.
-         */
-        end(): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to end. </p>
-         *
-         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
-         *
-         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
-         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
-         * not be dereferenced - it is generally used to describe the open-end of a range, such as
-         * [<i>begin</i>, <i>end</i>). </p>
-         *
-         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
-         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
-         * until invalidated. </p>
-         *
-         * @param index Bucket number. This shall be lower than {@link bucket_count}.
-         *
-         * @return An iterator to the element past the end of the bucket.
-         */
-        end(index: number): MapIterator<Key, T>;
-        rbegin(): MapReverseIterator<Key, T>;
-        rbegin(index: number): MapReverseIterator<Key, T>;
-        rend(): MapReverseIterator<Key, T>;
-        rend(index: number): MapReverseIterator<Key, T>;
-        /**
-         * <p> Return number of buckets. </p>
-         *
-         * <p> Returns the number of buckets in the {@link IHashMap} container. </p>
-         *
-         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
-         * hash value of their key. </p>
-         *
-         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
-         * table (and thus the probability of collision). The container automatically increases the number of buckets to
-         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
-         * time the number of buckets needs to be increased. </p>
-         *
-         * @return The current amount of buckets.
-         */
-        bucket_count(): number;
-        /**
-         * <p> Return bucket size. </p>
-         *
-         * <p> Returns the number of elements in bucket <i>n</i>. </p>
-         *
-         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
-         * value of their key. </p>
-         *
-         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
-         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
-         * (which is the average bucket size) below its {@link max_load_factor}. </p>
-         *
-         * @param n Bucket number. This shall be lower than {@link bucket_count}.
-         *
-         * @return The number of elements in bucket <i>n</i>.
-         */
-        bucket_size(n: number): number;
-        /**
-         * <p> Get maximum load factor. </p>
-         *
-         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
-         *
-         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
-         * number of buckets ({@link bucket_count}). </p>
-         *
-         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
-         *
-         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
-         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
-         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
-         *
-         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
-         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
-         *
-         * @return The current load factor.
-         */
-        max_load_factor(): number;
-        /**
-         * <p> Set maximum load factor. </p>
-         *
-         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
-         *
-         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
-         * number of buckets ({@link bucket_count}). </p>
-         *
-         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
-         *
-         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
-         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
-         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
-         *
-         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
-         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
-         *
-         * @param z The new maximum load factor.
-         */
-        max_load_factor(z: number): void;
-        /**
-         * <p> Locate element's bucket. </p>
-         *
-         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
-         *
-         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
-         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
-         *
-         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
-         * {@link begin} and {@link end}. </p>
-         *
-         * @param key Key whose bucket is to be located.
-         */
-        bucket(key: Key): number;
-        /**
-         * <p> Request a capacity change. </p>
-         *
-         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
-         * least <i>n</i> elements. </p>
-         *
-         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
-         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
-         *
-         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
-         *
-         * @param n The number of elements requested as minimum capacity.
-         */
-        reserve(n: number): void;
-        /**
-         * <p> Set number of buckets. </p>
-         *
-         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
-         *
-         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
-         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
-         * greater than <i>n</i>. </p>
-         *
-         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
-         * function may have no effect on the {@link bucket_count bucket count} and may not force a
-         * {@link HashBuckets.rehash rehash}. </p>
-         *
-         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
-         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
-         * of iteration of elements within the container. </p>
-         *
-         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
-         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
-         *
-         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
-         * {@link reserve}, that expects the number of elements in the container as argument. </p>
-         *
-         * @param n The minimum number of buckets for the container hash table.
-         */
-        rehash(n: number): void;
-    }
-}
 declare namespace std {
     /**
      * <p> Hashed, unordered map. </p>
@@ -5462,7 +5112,8 @@ declare namespace std {
      * <p> {@link HashMap} containers are faster than {@link TreeMap} containers to access individual elements by their
      * <i>key</i>, although they are generally less efficient for range iteration through a subset of their elements. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -5618,7 +5269,8 @@ declare namespace std {
      * <p> Elements with equivalent <i>keys</i> are grouped together in the same bucket and in such a way that
      * an iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -5776,7 +5428,8 @@ declare namespace std.base {
      * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
      * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -6056,7 +5709,8 @@ declare namespace std {
     /**
      * <p> An iterator of a Set. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
@@ -6114,7 +5768,8 @@ declare namespace std {
     /**
      * <p> A reverse-iterator of Set. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * @param <T> Type of the elements.
      *
@@ -6143,7 +5798,8 @@ declare namespace std.base {
      * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
      * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -6223,7 +5879,8 @@ declare namespace std.base {
      * {@link List} and registering {@link ListIterator iterators} of the {@link data_ list container} to an index
      * table like {@link RBTree tree} or {@link HashBuckets hash-table}. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -6275,243 +5932,6 @@ declare namespace std.base {
         swap(obj: MultiSet<T>): void;
     }
 }
-declare namespace std.base {
-    /**
-     * <p> A common interface for hash set. </p>
-     *
-     * <p> {@link IHashSet}s are containers that store unique elements in no particular order, and which
-     * allow for fast retrieval of individual elements based on their value. </p>
-     *
-     * <p> In an {@link IHashSet}, the value of an element is at the same time its <i>key</i>, that
-     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link IHashSet} cannot be
-     * modified once in the container - they can be inserted and removed, though. </p>
-     *
-     * <p> Internally, the elements in the {@link IHashSet} are not sorted in any particular order, but
-     * organized into buckets depending on their hash values to allow for fast access to individual elements
-     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
-     *
-     * <p> {@link IHashSet} containers are faster than {@link TreeSet} containers to access individual
-     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
-     * subset of their elements. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Hashed </dt>
-     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
-     *		 by their <i>key</i>. </dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements.
-     *			  Each element in an {@link IHashSet} is also uniquely identified by this value.
-     *
-     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IHashSet<T> {
-        /**
-         * <p> Return iterator to beginning. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the {@link IHashSet}. </p>
-         *
-         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
-         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
-         * container, until invalidated. </p>
-         *
-         * @return An iterator to the first element in the container.
-         */
-        begin(): SetIterator<T>;
-        /**
-         * <p> Return iterator to beginning. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashSet}. </p>
-         *
-         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
-         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
-         * bucket, until invalidated. </p>
-         *
-         * @param index Bucket number. This shall be lower than {@link bucket_count}.
-         *
-         * @return An iterator to the first element in the bucket.
-         */
-        begin(index: number): SetIterator<T>;
-        /**
-         * <p> Return iterator to end. </p>
-         *
-         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
-         *
-         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
-         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
-         * not be dereferenced - it is generally used to describe the open-end of a range, such as
-         * [<i>begin</i>, <i>end</i>). </p>
-         *
-         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
-         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
-         * until invalidated. </p>
-         *
-         * @return An iterator to the element past the end of the container.
-         */
-        end(): SetIterator<T>;
-        /**
-         * <p> Return iterator to end. </p>
-         *
-         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
-         *
-         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
-         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
-         * not be dereferenced - it is generally used to describe the open-end of a range, such as
-         * [<i>begin</i>, <i>end</i>). </p>
-         *
-         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
-         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
-         * until invalidated. </p>
-         *
-         * @param index Bucket number. This shall be lower than {@link bucket_count}.
-         *
-         * @return An iterator to the element past the end of the bucket.
-         */
-        end(index: number): SetIterator<T>;
-        rbegin(): SetReverseIterator<T>;
-        rbegin(index: number): SetReverseIterator<T>;
-        rend(): SetReverseIterator<T>;
-        rend(index: number): SetReverseIterator<T>;
-        /**
-         * <p> Return number of buckets. </p>
-         *
-         * <p> Returns the number of buckets in the {@link IHashSet} container. </p>
-         *
-         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
-         * hash value of their key. </p>
-         *
-         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
-         * table (and thus the probability of collision). The container automatically increases the number of buckets to
-         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
-         * time the number of buckets needs to be increased. </p>
-         *
-         * @return The current amount of buckets.
-         */
-        bucket_count(): number;
-        /**
-         * <p> Return bucket size. </p>
-         *
-         * <p> Returns the number of elements in bucket <i>n</i>. </p>
-         *
-         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
-         * value of their key. </p>
-         *
-         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
-         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
-         * (which is the average bucket size) below its {@link max_load_factor}. </p>
-         *
-         * @param n Bucket number. This shall be lower than {@link bucket_count}.
-         *
-         * @return The number of elements in bucket <i>n</i>.
-         */
-        bucket_size(n: number): number;
-        /**
-         * <p> Get maximum load factor. </p>
-         *
-         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
-         *
-         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
-         * number of buckets ({@link bucket_count}). </p>
-         *
-         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
-         *
-         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
-         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
-         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
-         *
-         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
-         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
-         *
-         * @return The current load factor.
-         */
-        max_load_factor(): number;
-        /**
-         * <p> Set maximum load factor. </p>
-         *
-         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
-         *
-         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
-         * number of buckets ({@link bucket_count}). </p>
-         *
-         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
-         *
-         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
-         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
-         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
-         *
-         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
-         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
-         *
-         * @param z The new maximum load factor.
-         */
-        max_load_factor(z: number): void;
-        /**
-         * <p> Locate element's bucket. </p>
-         *
-         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
-         *
-         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
-         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
-         *
-         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
-         * {@link begin} and {@link end}. </p>
-         *
-         * @param key Key whose bucket is to be located.
-         */
-        bucket(key: T): number;
-        /**
-         * <p> Request a capacity change. </p>
-         *
-         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
-         * least <i>n</i> elements. </p>
-         *
-         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
-         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
-         *
-         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
-         *
-         * @param n The number of elements requested as minimum capacity.
-         */
-        reserve(n: number): void;
-        /**
-         * <p> Set number of buckets. </p>
-         *
-         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
-         *
-         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
-         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
-         * greater than <i>n</i>. </p>
-         *
-         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
-         * function may have no effect on the {@link bucket_count bucket count} and may not force a
-         * {@link HashBuckets.rehash rehash}. </p>
-         *
-         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
-         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
-         * of iteration of elements within the container. </p>
-         *
-         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
-         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
-         *
-         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
-         * {@link reserve}, that expects the number of elements in the container as argument. </p>
-         *
-         * @param n The minimum number of buckets for the container hash table.
-         */
-        rehash(n: number): void;
-    }
-}
 declare namespace std {
     /**
      * <p> Hashed, unordered set. </p>
@@ -6531,7 +5951,8 @@ declare namespace std {
      * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
      * subset of their elements. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -6683,7 +6104,8 @@ declare namespace std {
      * <p> Elements with equivalent values are grouped together in the same bucket and in such a way that an
      * iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -6844,7 +6266,9 @@ declare namespace std {
      * distance between these. They also consume some extra memory to keep the linking information associated to each
      * element (which may be an important factor for large lists of small-sized elements). </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -7415,7 +6839,9 @@ declare namespace std {
     /**
      * <p> An iterator, node of a List. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
@@ -7475,7 +6901,9 @@ declare namespace std {
     /**
      * <p> A reverse-iterator of List. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @param <T> Type of the elements.
      *
@@ -7523,7 +6951,9 @@ declare namespace std {
      * By default, if no container class is specified for a particular {@link Queue} class instantiation, the standard
      * container {@link List} is used. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @param <T> Type of elements.
      *
@@ -7853,7 +7283,9 @@ declare namespace std {
      * By default, if no container class is specified for a particular {@link Stack} class instantiation, the standard
      * container {@link List} is used. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @param <T> Type of elements.
      *
@@ -7962,7 +7394,8 @@ declare namespace std.base {
      * so that they can be interpreted when needed as more abstract (and portable)
      * {@link ErrorCondition error conditions}. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
@@ -8071,7 +7504,8 @@ declare namespace std {
      * <p> The class inherits from {@link RuntimeError}, to which it adds an {@link ErrorCode} as
      * member code (and defines a specialized what member). </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/system_error/system_error
      * @author Jeongho Nam <http://samchon.org>
@@ -8136,7 +7570,8 @@ declare namespace std {
      * passed by reference. As such, only one object of each of these types shall exist, each uniquely identifying its own
      * category: all error codes and conditions of a same category shall return a reference to same object. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/system_error/error_category
      * @author Jeongho Nam <http://samchon.org>
@@ -8263,7 +7698,8 @@ declare namespace std {
      * <p> The {@link ErrorCategory categories} associated with the {@link ErrorCondition} and the
      * {@link ErrorCode} define the equivalences between them. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/system_error/error_condition
      * @author Jeongho Nam <http://samchon.org>
@@ -8295,7 +7731,8 @@ declare namespace std {
      * <p> Objects of this class associate such numerical codes to {@link ErrorCategory error categories}, so that they
      * can be interpreted when needed as more abstract (and portable) {@link ErrorCondition error conditions}. </p>
      *
-     * <p> <img src="../assets/images/design/exceptions.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/exceptions.png" style="max-width: 100%" /> </p>
      *
      * @reference http://www.cplusplus.com/reference/system_error/error_code
      * @author Jeongho Nam <http://samchon.org>
@@ -8314,121 +7751,6 @@ declare namespace std {
         constructor(val: number, category: ErrorCategory);
     }
 }
-declare namespace std.base {
-    /**
-     * <p> Common interface for tree-structured map. </p>
-     *
-     * <p> {@link ITreeMap ITreeMaps} are associative containers that store elements formed by a combination of
-     * a <i>key value</i> and a <i>mapped value</i>, following a specific order. </p>
-     *
-     * <p> In a {@link ITreeMap}, the <i>key values</i> are generally used to sort and uniquely identify
-     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
-     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
-     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
-     *
-     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
-     *
-     * <p> Internally, the elements in a {@link ITreeMap}are always sorted by its key following a
-     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
-     *
-     * <p> {@link ITreeMap}containers are generally slower than {@link IHashMap} containers
-     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
-     * on their order. </p>
-     *
-     * <p> {@link ITreeMap TreeMultiMaps} are typically implemented as binary search trees. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		 position in the container. </dd>
-     *
-     *	<dt> Ordered </dt>
-     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
-     *		 given a position in this order. </dd>
-     *
-     *	<dt> Map </dt>
-     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
-     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
-     * </dl>
-     *
-     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
-     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
-     *
-     * @reference http://www.cplusplus.com/reference/map
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface ITreeMap<Key, T> {
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
-         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
-         *
-         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link ITreeMap} contains an element with a key equivalent to <i>k</i>: In this
-         * case, {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound}
-         * returns an iterator pointing to the next element. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is not considered to go before
-         *		   <i>k</i>, or {@link ITreeMap.end} if all keys are considered to go before <i>k</i>.
-         */
-        lower_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
-         * go after <i>k</i> </p>.
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
-         *
-         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the map contains an element with a key equivalent to <i>k</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns an
-         * iterator pointing to the next element. </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return An iterator to the the first element in the container whose key is considered to go after
-         *		   <i>k</i>, or {@link TreeMap.end end} if no keys are considered to go after <i>k</i>.
-         */
-        upper_bound(key: Key): MapIterator<Key, T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
-         * equivalent to <i>k</i> </p>.
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that has a key considered to go after <i>k</i> according to the container's internal
-         * comparison object (key_comp). </p>
-         *
-         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
-         * (i.e., no matter the order in which the keys are passed as arguments). </p>
-         *
-         * @param k Key to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
-    }
-}
 declare namespace std {
     /**
      * <p> Tree-structured map, <code>std::map</code> of STL. </p>
@@ -8451,7 +7773,8 @@ declare namespace std {
      *
      * <p> {@link TreeMap}s are typically implemented as binary search trees. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -8491,7 +7814,7 @@ declare namespace std {
          *
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(compare: (left: Key, right: Key) => boolean);
+        constructor(compare: (x: Key, y: Key) => boolean);
         /**
          * Contruct from elements.
          *
@@ -8504,7 +7827,7 @@ declare namespace std {
          * @param array Elements to be contained.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        constructor(array: Array<Pair<Key, T>>, compare: (x: Key, y: Key) => boolean);
         /**
          * Contruct from tuples.
          *
@@ -8517,7 +7840,7 @@ declare namespace std {
          * @param array Tuples to be contained.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
+        constructor(array: Array<[Key, T]>, compare: (x: Key, y: Key) => boolean);
         /**
          * Copy Constructor.
          *
@@ -8530,7 +7853,7 @@ declare namespace std {
          * @param container Another map to copy.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
+        constructor(container: base.MapContainer<Key, T>, compare: (x: Key, y: Key) => boolean);
         /**
          * Range Constructor.
          *
@@ -8545,7 +7868,7 @@ declare namespace std {
          * @param end Input interator of the final position in a sequence.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (x: Key, y: Key) => boolean);
         /**
          * @inheritdoc
          */
@@ -8554,6 +7877,14 @@ declare namespace std {
          * @inheritdoc
          */
         find(key: Key): MapIterator<Key, T>;
+        /**
+         * @inheritdoc
+         */
+        key_comp(): (x: Key, y: Key) => boolean;
+        /**
+         * @inheritdoc
+         */
+        value_comp(): (x: Pair<Key, T>, y: Pair<Key, T>) => boolean;
         /**
          * @inheritdoc
          */
@@ -8620,7 +7951,8 @@ declare namespace std {
      *
      * <p> {@link TreeMultiMap TreeMultiMaps} are typically implemented as binary search trees. </p>
      *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank"> <
+     * img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -8663,7 +7995,7 @@ declare namespace std {
          *
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(compare: (left: Key, right: Key) => boolean);
+        constructor(compare: (x: Key, y: Key) => boolean);
         /**
          * Contruct from elements.
          *
@@ -8676,7 +8008,7 @@ declare namespace std {
          * @param array Elements to be contained.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(array: Array<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        constructor(array: Array<Pair<Key, T>>, compare: (x: Key, y: Key) => boolean);
         /**
          * Contruct from tuples.
          *
@@ -8689,7 +8021,7 @@ declare namespace std {
          * @param array Tuples to be contained.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(array: Array<[Key, T]>, compare: (left: Key, right: Key) => boolean);
+        constructor(array: Array<[Key, T]>, compare: (x: Key, y: Key) => boolean);
         /**
          * Copy Constructor.
          *
@@ -8702,7 +8034,7 @@ declare namespace std {
          * @param container Another map to copy.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(container: base.MapContainer<Key, T>, compare: (left: Key, right: Key) => boolean);
+        constructor(container: base.MapContainer<Key, T>, compare: (x: Key, y: Key) => boolean);
         /**
          * Range Constructor.
          *
@@ -8717,7 +8049,7 @@ declare namespace std {
          * @param end Input interator of the final position in a sequence.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (left: Key, right: Key) => boolean);
+        constructor(begin: Iterator<Pair<Key, T>>, end: Iterator<Pair<Key, T>>, compare: (x: Key, y: Key) => boolean);
         /**
          * @inheritdoc
          */
@@ -8730,6 +8062,14 @@ declare namespace std {
          * @inheritdoc
          */
         count(key: Key): number;
+        /**
+         * @inheritdoc
+         */
+        key_comp(): (x: Key, y: Key) => boolean;
+        /**
+         * @inheritdoc
+         */
+        value_comp(): (x: Pair<Key, T>, y: Pair<Key, T>) => boolean;
         /**
          * @inheritdoc
          */
@@ -8772,121 +8112,6 @@ declare namespace std {
         private swap_tree_multimap(obj);
     }
 }
-declare namespace std.base {
-    /**
-     * <p> A common interface for tree-structured set. </p>
-     *
-     * <p> {@link ITreeSet TreeMultiSets} are containers that store elements following a specific order. </p>
-     *
-     * <p> In a {@link ITreeSet}, the value of an element also identifies it (the value is itself
-     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link ITreeSet} cannot
-     * be modified once in the container (the elements are always const), but they can be inserted or removed
-     * from the  </p>
-     *
-     * <p> Internally, the elements in a {@link ITreeSet TreeMultiSets} are always sorted following a strict
-     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
-     *
-     * <p> {@link ITreeSet} containers are generally slower than {@link IHashSet} containers
-     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
-     * their order. </p>
-     *
-     * <p> {@link ITreeSet TreeMultiSets} are typically implemented as binary search trees. </p>
-     *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     *	<dt> Associative </dt>
-     *	<dd>
-     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
-     *		position in the container.
-     *	</dd>
-     *
-     *	<dt> Ordered </dt>
-     *	<dd>
-     *		The elements in the container follow a strict order at all times. All inserted elements are
-     *		given a position in this order.
-     *	</dd>
-     *
-     *	<dt> Set </dt>
-     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
-     * </dl>
-     *
-     * @param <T> Type of the elements. Each element in a {@link ITreeSet} container is also identified
-     *			  by this value (each value is itself also the element's <i>key</i>).
-     *
-     * @reference http://www.cplusplus.com/reference/set
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface ITreeSet<T> {
-        /**
-         * <p> Return iterator to lower bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is not considered to
-         * go before <i>val</i> (i.e., either it is equivalent or goes after). </p>
-         *
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(element,val) would return false. </p>
-         *
-         * <p> If the {@link ITreeSet} class is instantiated with the default comparison type ({@link less}),
-         * the function returns an iterator to the first element that is not less than <i>val</i>. </p>
-
-         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
-         * in the case that the {@link ITreeSet} contains elements equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is not considered to go before
-         *		   <i>val</i>, or {@link ITreeSet.end} if all elements are considered to go before <i>val</i>.
-         */
-        lower_bound(val: T): SetIterator<T>;
-        /**
-         * <p> Return iterator to upper bound. </p>
-         *
-         * <p> Returns an iterator pointing to the first element in the container which is considered to go after
-         * <i>val</i>. </p>
-
-         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
-         * iterator to the first element for which key_comp(val,element) would return true. </p>
-
-         * <p> If the {@code ITreeSet} class is instantiated with the default comparison type (less), the
-         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
-         *
-         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
-         * in the case that the {@ITreeSet} contains elements equivalent to <i>val</i>: In this case
-         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
-         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
-         *
-         * @param val Value to compare.
-         *
-         * @return An iterator to the the first element in the container which is considered to go after
-         *		   <i>val</i>, or {@link TreeSet.end end} if no elements are considered to go after <i>val</i>.
-         */
-        upper_bound(val: T): SetIterator<T>;
-        /**
-         * <p> Get range of equal elements. </p>
-         *
-         * <p> Returns the bounds of a range that includes all the elements in the container that are equivalent
-         * to <i>val</i>. </p>
-         *
-         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
-         * the first element that is considered to go after val according to the container's
-         * internal comparison object (key_comp). </p>
-         *
-         * <p> Two elements of a multiset are considered equivalent if the container's comparison object returns
-         * false reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
-         *
-         * @param key Value to search for.
-         *
-         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
-         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
-         *		   (the same as {@link upper_bound}).
-         */
-        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
-    }
-}
 declare namespace std {
     /**
      * <p> Tree-structured set, <code>std::set</code> of STL. </p>
@@ -8907,7 +8132,8 @@ declare namespace std {
      *
      * <p> {@link TreeSet}s are typically implemented as binary search trees. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -8950,7 +8176,7 @@ declare namespace std {
          *
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(compare: (left: T, right: T) => boolean);
+        constructor(compare: (x: T, y: T) => boolean);
         /**
          * Contruct from elements.
          *
@@ -8963,7 +8189,7 @@ declare namespace std {
          * @param array Elements to be contained.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
+        constructor(array: Array<T>, compare: (x: T, y: T) => boolean);
         /**
          * Copy Constructor.
          */
@@ -8974,7 +8200,7 @@ declare namespace std {
          * @param container A container to be copied.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(container: base.IContainer<T>, compare: (left: T, right: T) => boolean);
+        constructor(container: base.IContainer<T>, compare: (x: T, y: T) => boolean);
         /**
          * Range Constructor.
          *
@@ -8989,7 +8215,7 @@ declare namespace std {
          * @param end Input interator of the final position in a sequence.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (x: T, y: T) => boolean);
         /**
          * @inheritdoc
          */
@@ -8998,6 +8224,14 @@ declare namespace std {
          * @inheritdoc
          */
         find(val: T): SetIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        key_comp(): (x: T, y: T) => boolean;
+        /**
+         * @inheritdoc
+         */
+        value_comp(): (x: T, y: T) => boolean;
         /**
          * @inheritdoc
          */
@@ -9058,7 +8292,8 @@ declare namespace std {
      *
      * <p> {@link TreeMultiSet TreeMultiSets} are typically implemented as binary search trees. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -9101,7 +8336,7 @@ declare namespace std {
          *
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(compare: (left: T, right: T) => boolean);
+        constructor(compare: (x: T, y: T) => boolean);
         /**
          * Contruct from elements.
          *
@@ -9114,7 +8349,7 @@ declare namespace std {
          * @param array Elements to be contained.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(array: Array<T>, compare: (left: T, right: T) => boolean);
+        constructor(array: Array<T>, compare: (x: T, y: T) => boolean);
         /**
          * Copy Constructor.
          */
@@ -9125,7 +8360,7 @@ declare namespace std {
          * @param container A container to be copied.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(container: base.Container<T>, compare: (left: T, right: T) => boolean);
+        constructor(container: base.Container<T>, compare: (x: T, y: T) => boolean);
         /**
          * Range Constructor.
          *
@@ -9140,7 +8375,7 @@ declare namespace std {
          * @param end Input interator of the final position in a sequence.
          * @param compare A binary predicate determines order of elements.
          */
-        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (left: T, right: T) => boolean);
+        constructor(begin: Iterator<T>, end: Iterator<T>, compare: (x: T, y: T) => boolean);
         /**
          * @inheritdoc
          */
@@ -9153,6 +8388,14 @@ declare namespace std {
          * @inheritdoc
          */
         count(val: T): number;
+        /**
+         * @inheritdoc
+         */
+        key_comp(): (x: T, y: T) => boolean;
+        /**
+         * @inheritdoc
+         */
+        value_comp(): (x: T, y: T) => boolean;
         /**
          * @inheritdoc
          */
@@ -9298,7 +8541,9 @@ declare namespace std {
      * end, they perform worse than the others, and have less consistent iterators and references than {@link List}s.
      * </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * <h3> Container properties </h3>
      * <dl>
@@ -9682,7 +8927,9 @@ declare namespace std {
     /**
      * <p> An iterator of Vector. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @param <T> Type of the elements.
      *
@@ -9757,7 +9004,9 @@ declare namespace std {
     /**
      * <p> A reverse-iterator of Vector. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
      *
      * @param <T> Type of the elements.
      *
@@ -9779,6 +9028,1172 @@ declare namespace std {
         index: number;
     }
 }
+declare namespace std.base {
+    /**
+     * <p> Static class holding enumeration codes of color of Red-black tree. </p>
+     *
+     * <p> Color codes imposed to nodes of RB-Tree are following those rules: </p>
+     *
+     * <ol>
+     *	<li> A node is either <font color='red'>red</font> or <font color='darkBlue'>black</font>. </li>
+     *	<li> The root is <font color='darkBlue'>black</font>. This rule is sometimes omitted. Since the root can
+     *		 always be changed from <font color='red'>red</font> to <font color='darkBlue'>black</font>, but not
+     *		 necessarily vice versa, this rule has little effect on analysis. </li>
+     *	<li> All leaves (NIL; <code>null</code>) are <font color='darkBlue'>black</font>. </li>
+     *  <li> If a node is <font color='red'>red</font>, then both its children are
+     *		 <font color='darkBlue'>black</font>. </li>
+     *  <li> Every path from a given node to any of its descendant NIL nodes contains the same number of
+     *		 <font color='darkBlue'>black</font> nodes. Some definitions: the number of
+     *		 <font color='darkBlue'>black</font> nodes from the root to a node is the node's
+     *		 <font color='darkBlue'>black</font> depth; the uniform number of <font color='darkBlue'>black</font>
+     *		 nodes in all paths from root to the leaves is called the <font color='darkBlue'>black</font>-height of
+     *		 the red-black tree. </li>
+     * </ol>
+     *
+     * @author Migrated by Jeongho Nam <http://samchon.org>
+     */
+    enum Color {
+        /**
+         * <p> Code of color black. </p>
+         *
+         * <ul>
+         *	<li> Those are clearly black: root, leaf nodes or children nodes of red. </li>
+         *	<li> Every path from a given nodes containes the same number of black nodes exclude NIL(s). </li>
+         * </ul>
+         */
+        BLACK = 0,
+        /**
+         * <p> Code of color red. </p>
+         */
+        RED = 1,
+    }
+}
+declare namespace std.base {
+    enum Hash {
+        MIN_SIZE = 10,
+        RATIO = 1,
+        MAX_RATIO = 2,
+    }
+    /**
+     * <p> Hask buckets. </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class HashBuckets<T> {
+        private buckets_;
+        private item_size_;
+        /**
+         * Default Constructor.
+         */
+        constructor();
+        /**
+         * <p> Reconstruction of hash table. </p>
+         *
+         * <p> All the elements in the hash buckets are rearranged according to their hash value into the new set of
+         * buckets. This may alter the order of iteration of elements within the container. </p>
+         *
+         * <p> Notice that {@link rehash rehashes} are automatically performed whenever its number of elements is going
+         * to greater than its own {@link capacity}. </p>
+         *
+         * @param size Number of bucket size to rehash.
+         */
+        rehash(size: number): void;
+        clear(): void;
+        size(): number;
+        item_size(): number;
+        capacity(): number;
+        at(index: number): Vector<T>;
+        hash_index(val: T): number;
+        insert(val: T): void;
+        erase(val: T): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> Common interface for hash map. </p>
+     *
+     * <p> {@link IHashMap}s are associative containers that store elements formed by the combination of
+     * a <i>key value</i> and a <i>mapped value</i>. </p>
+     *
+     * <p> In an {@link IHashMap}, the <i>key value</i> is generally used to uniquely identify the
+     * element, while the <i>mapped value</i> is an object with the content associated to this <i>key</i>.
+     * Types of <i>key</i> and <i>mapped value</i> may differ. </p>
+     *
+     * <p> Internally, the elements in the {@link IHashMap} are not sorted in any particular order with
+     * respect to either their <i>key</i> or <i>mapped values</i>, but organized into <i>buckets</i> depending on
+     * their hash values to allow for fast access to individual elements directly by their <i>key values</i>
+     * (with a constant average time complexity on average). </p>
+     *
+     * <p> Elements with equivalent <i>keys</i> are grouped together in the same bucket and in such a way that
+     * an iterator can iterate through all of them. Iterators in the container are doubly linked iterators. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
+     * </dl>
+     *
+     * @param <Key> Type of the key values.
+     *				Each element in an {@link IHashMap} is identified by a key value.
+     * @param <T> Type of the mapped value.
+     *			  Each element in an {@link IHashMap} is used to store some data as its mapped value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_map
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IHashMap<Key, T> {
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the {@link IHashMap}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * container, until invalidated. </p>
+         *
+         * @return An iterator to the first element in the container.
+         */
+        begin(): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashMap}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the first element in the bucket.
+         */
+        begin(index: number): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @return An iterator to the element past the end of the container.
+         */
+        end(): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the element past the end of the bucket.
+         */
+        end(index: number): MapIterator<Key, T>;
+        /**
+         * <p> Return {@link MapReverseIterator reverse iterator} to <i>reverse beginning</i>. </p>
+         *
+         * <p> Returns a {@link MapReverseIterator reverse iterator} pointing to the last element in the {@link IHashMap}
+         * (i.e., its <i>reverse beginning</i>). </p>
+         *
+         * {@link MapReverseIterator Reverse iterators} iterate backwards: increasing them moves them towards the
+         * beginning of the container. </p>
+         *
+         * <p> {@link rbegin} points to the element preceding the one that would be pointed to by member {@link end}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @return A {@link MapReverseIterator reverse iterator} to the <i>reverse beginning</i> of the sequence
+         */
+        rbegin(): MapReverseIterator<Key, T>;
+        /**
+         * <p> Return {@link MapReverseIterator reverse iterator} to <i>reverse beginning</i>. </p>
+         *
+         * <p> Returns a {@link MapReverseIterator reverse iterator} pointing to the last element in one of buckets in the
+         * {@link IHashMap} (i.e., its <i>reverse beginning</i>). </p>
+         *
+         * {@link MapReverseIterator Reverse iterators} iterate backwards: increasing them moves them towards the
+         * beginning of the container. </p>
+         *
+         * <p> {@link rbegin} points to the element preceding the one that would be pointed to by member {@link end}. </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return A {@link MapReverseIterator reverse iterator} to the <i>reverse beginning</i> of the sequence
+         */
+        rbegin(index: number): MapReverseIterator<Key, T>;
+        /**
+         * <p> Return {@link MapReverseIterator reverse iterator} to <i>reverse end</i>. </p>
+         *
+         * <p> Returns a {@link MapReverseIterator reverse iterator} pointing to the theoretical element right before
+         * the first element in the {@link IHashMap hash map container} (which is considered its <i>reverse end</i>). </p>
+         *
+         * <p> The range between {@link IHashMap}.{@link rbegin} and {@link IHashMap}.{@link rend} contains all the
+         * elements of the container (in reverse order). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @return A {@link MapReverseIterator reverse iterator} to the <i>reverse end</i> of the sequence.
+         */
+        rend(): MapReverseIterator<Key, T>;
+        /**
+         * <p> Return {@link MapReverseIterator reverse iterator} to <i>reverse end</i>. </p>
+         *
+         * <p> Returns a {@link MapReverseIterator reverse iterator} pointing to the theoretical element right before
+         * the first element in one of buckets in the {@link IHashMap hash map container} (which is considered its
+         * <i>reverse end</i>). </p>
+         *
+         * <p> The range between {@link IHashMap}.{@link rbegin} and {@link IHashMap}.{@link rend} contains all the
+         * elements of the container (in reverse order). </p>
+         *
+         * <p> Notice that an {@link IHashMap} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return A {@link MapReverseIterator reverse iterator} to the <i>reverse end</i> of the sequence.
+         */
+        rend(index: number): MapReverseIterator<Key, T>;
+        /**
+         * <p> Return number of buckets. </p>
+         *
+         * <p> Returns the number of buckets in the {@link IHashMap} container. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their key. </p>
+         *
+         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
+         * table (and thus the probability of collision). The container automatically increases the number of buckets to
+         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
+         * time the number of buckets needs to be increased. </p>
+         *
+         * @return The current amount of buckets.
+         */
+        bucket_count(): number;
+        /**
+         * <p> Return bucket size. </p>
+         *
+         * <p> Returns the number of elements in bucket <i>n</i>. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
+         * value of their key. </p>
+         *
+         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
+         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
+         * (which is the average bucket size) below its {@link max_load_factor}. </p>
+         *
+         * @param n Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return The number of elements in bucket <i>n</i>.
+         */
+        bucket_size(n: number): number;
+        /**
+         * <p> Get maximum load factor. </p>
+         *
+         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @return The current load factor.
+         */
+        max_load_factor(): number;
+        /**
+         * <p> Set maximum load factor. </p>
+         *
+         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @param z The new maximum load factor.
+         */
+        max_load_factor(z: number): void;
+        /**
+         * <p> Locate element's bucket. </p>
+         *
+         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
+         *
+         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
+         * {@link begin} and {@link end}. </p>
+         *
+         * @param key Key whose bucket is to be located.
+         */
+        bucket(key: Key): number;
+        /**
+         * <p> Request a capacity change. </p>
+         *
+         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
+         * least <i>n</i> elements. </p>
+         *
+         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
+         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
+         *
+         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
+         *
+         * @param n The number of elements requested as minimum capacity.
+         */
+        reserve(n: number): void;
+        /**
+         * <p> Set number of buckets. </p>
+         *
+         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
+         *
+         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
+         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
+         * greater than <i>n</i>. </p>
+         *
+         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
+         * function may have no effect on the {@link bucket_count bucket count} and may not force a
+         * {@link HashBuckets.rehash rehash}. </p>
+         *
+         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
+         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
+         * of iteration of elements within the container. </p>
+         *
+         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
+         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
+         *
+         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
+         * {@link reserve}, that expects the number of elements in the container as argument. </p>
+         *
+         * @param n The minimum number of buckets for the container hash table.
+         */
+        rehash(n: number): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> Hash buckets storing {@link MapIterator MapIterators}. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class MapHashBuckets<K, T> extends HashBuckets<MapIterator<K, T>> {
+        private map;
+        constructor(map: MapContainer<K, T>);
+        find(key: K): MapIterator<K, T>;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> A common interface for hash set. </p>
+     *
+     * <p> {@link IHashSet}s are containers that store unique elements in no particular order, and which
+     * allow for fast retrieval of individual elements based on their value. </p>
+     *
+     * <p> In an {@link IHashSet}, the value of an element is at the same time its <i>key</i>, that
+     * identifies it uniquely. Keys are immutable, therefore, the elements in an {@link IHashSet} cannot be
+     * modified once in the container - they can be inserted and removed, though. </p>
+     *
+     * <p> Internally, the elements in the {@link IHashSet} are not sorted in any particular order, but
+     * organized into buckets depending on their hash values to allow for fast access to individual elements
+     * directly by their <i>values</i> (with a constant average time complexity on average). </p>
+     *
+     * <p> {@link IHashSet} containers are faster than {@link TreeSet} containers to access individual
+     * elements by their <i>key</i>, although they are generally less efficient for range iteration through a
+     * subset of their elements. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
+     *
+     *	<dt> Hashed </dt>
+     *	<dd> Hashed containers organize their elements using hash tables that allow for fast access to elements
+     *		 by their <i>key</i>. </dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *			  Each element in an {@link IHashSet} is also uniquely identified by this value.
+     *
+     * @reference http://www.cplusplus.com/reference/unordered_set/unordered_set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IHashSet<T> {
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the {@link IHashSet}. </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * container, until invalidated. </p>
+         *
+         * @return An iterator to the first element in the container.
+         */
+        begin(): SetIterator<T>;
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in one of buckets in the {@link IHashSet}. </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which specific element is considered its
+         * first element. But, in any case, the range that goes from its begin to its end covers all the elements in the
+         * bucket, until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the first element in the bucket.
+         */
+        begin(index: number): SetIterator<T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @return An iterator to the element past the end of the container.
+         */
+        end(): SetIterator<T>;
+        /**
+         * <p> Return iterator to end. </p>
+         *
+         * <p> Returns an iterator pointing to the past-the-end element in the {@link HaspMap} container. </p>
+         *
+         * <p> The iterator returned by end does not point to any element, but to the position that follows the last
+         * element in the {@link HaspMap} container (its <i>past-the-end</i> position). Thus, the value returned shall
+         * not be dereferenced - it is generally used to describe the open-end of a range, such as
+         * [<i>begin</i>, <i>end</i>). </p>
+         *
+         * <p> Notice that an {@link IHashSet} object makes no guarantees on which order its elements follow. But, in any
+         * case, the range that goes from its begin to its end covers all the elements in the container (or the bucket),
+         * until invalidated. </p>
+         *
+         * @param index Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return An iterator to the element past the end of the bucket.
+         */
+        end(index: number): SetIterator<T>;
+        rbegin(): SetReverseIterator<T>;
+        rbegin(index: number): SetReverseIterator<T>;
+        rend(): SetReverseIterator<T>;
+        rend(index: number): SetReverseIterator<T>;
+        /**
+         * <p> Return number of buckets. </p>
+         *
+         * <p> Returns the number of buckets in the {@link IHashSet} container. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their key. </p>
+         *
+         * <p> The number of buckets influences directly the {@link load_factor load factor} of the container's hash
+         * table (and thus the probability of collision). The container automatically increases the number of buckets to
+         * keep the load factor below a specific threshold (its {@link max_load_factor}), causing a {@link rehash} each
+         * time the number of buckets needs to be increased. </p>
+         *
+         * @return The current amount of buckets.
+         */
+        bucket_count(): number;
+        /**
+         * <p> Return bucket size. </p>
+         *
+         * <p> Returns the number of elements in bucket <i>n</i>. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the hash
+         * value of their key. </p>
+         *
+         * <p> The number of elements in a bucket influences the time it takes to access a particular element in the
+         * bucket. The container automatically increases the number of buckets to keep the {@link load_cator load factor}
+         * (which is the average bucket size) below its {@link max_load_factor}. </p>
+         *
+         * @param n Bucket number. This shall be lower than {@link bucket_count}.
+         *
+         * @return The number of elements in bucket <i>n</i>.
+         */
+        bucket_size(n: number): number;
+        /**
+         * <p> Get maximum load factor. </p>
+         *
+         * <p> Returns the current maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @return The current load factor.
+         */
+        max_load_factor(): number;
+        /**
+         * <p> Set maximum load factor. </p>
+         *
+         * <p> Sets <i>z</i> as the cnew maximum load factor for the {@link HashMultiMap} container. </p>
+         *
+         * <p> The load factor is the ratio between the number of elements in the container (its {@link size}) and the
+         * number of buckets ({@link bucket_count}). </p>
+         *
+         * <p> By default, {@link HashMultiMap} containers have a {@link max_load_factor} of 1.0. </p>
+         *
+         * <p> The load factor influences the probability of collision in the hash table (i.e., the probability of two
+         * elements being located in the same bucket). The container uses the value of max_load_factor as the threshold
+         * that forces an increase in the number of buckets (and thus causing a {@link rehash}). </p>
+         *
+         * <p> Note though, that implementations may impose an upper limit on the number of buckets (see
+         * {@link max_bucket_count}), which may force the container to ignore the {@link max_load_factor}. </p>
+         *
+         * @param z The new maximum load factor.
+         */
+        max_load_factor(z: number): void;
+        /**
+         * <p> Locate element's bucket. </p>
+         *
+         * <p> Returns the bucket number where the element with <i>key</i> is located. </p>
+         *
+         * <p> A bucket is a slot in the container's internal hash table to which elements are assigned based on the
+         * hash value of their <i>key</i>. Buckets are numbered from 0 to ({@link bucket_count} - 1). </p>
+         *
+         * <p> Individual elements in a bucket can be accessed by means of the range iterators returned by
+         * {@link begin} and {@link end}. </p>
+         *
+         * @param key Key whose bucket is to be located.
+         */
+        bucket(key: T): number;
+        /**
+         * <p> Request a capacity change. </p>
+         *
+         * <p> Sets the number of buckets in the container ({@link bucket_count}) to the most appropriate to contain at
+         * least <i>n</i> elements. </p>
+         *
+         * <p> If <i>n</i> is greater than the current {@link bucket_count} multiplied by the {@link max_load_factor},
+         * the container's {@link bucket_count} is increased and a {@link rehash} is forced. </p>
+         *
+         * <p> If <i>n</i> is lower than that, the function may have no effect. </p>
+         *
+         * @param n The number of elements requested as minimum capacity.
+         */
+        reserve(n: number): void;
+        /**
+         * <p> Set number of buckets. </p>
+         *
+         * <p> Sets the number of buckets in the container to <i>n</i> or more. </p>
+         *
+         * <p> If <i>n</i> is greater than the current number of buckets in the container ({@link bucket_count}), a
+         * {@link HashBuckets.rehash rehash} is forced. The new {@link bucket_count bucket count} can either be equal or
+         * greater than <i>n</i>. </p>
+         *
+         * <p> If <i>n</i> is lower than the current number of buckets in the container ({@link bucket_count}), the
+         * function may have no effect on the {@link bucket_count bucket count} and may not force a
+         * {@link HashBuckets.rehash rehash}. </p>
+         *
+         * <p> A {@link HashBuckets.rehash rehash} is the reconstruction of the hash table: All the elements in the
+         * container are rearranged according to their hash value into the new set of buckets. This may alter the order
+         * of iteration of elements within the container. </p>
+         *
+         * <p> {@link HashBuckets.rehash Rehashes} are automatically performed by the container whenever its
+         * {@link load_factor load factor} is going to surpass its {@link max_load_factor} in an operation. </p>
+         *
+         * <p> Notice that this function expects the number of buckets as argument. A similar function exists,
+         * {@link reserve}, that expects the number of elements in the container as argument. </p>
+         *
+         * @param n The minimum number of buckets for the container hash table.
+         */
+        rehash(n: number): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> Hash buckets storing {@link SetIterator SetIterators}. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    class SetHashBuckets<T> extends HashBuckets<SetIterator<T>> {
+        private set;
+        constructor(set: SetContainer<T>);
+        find(val: T): SetIterator<T>;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> Array  </p>
+     *
+     * <p> {@link IArray} is an interface for sequence containers representing <i>arrays</i> that can change in
+     * {@link size}. However, compared to <i>arrays</i>, {@link IArray} objectss consume more memory in exchange for
+     * the ability to manage storage and grow dynamically in an efficient way. </p> </p>
+     *
+     * <p> Both {@link Vector Vectors} and {@link Deque Deques} who implemented {@link IArray} provide a very
+     * similar interface and can be used for similar purposes, but internally both work in quite different ways:
+     * While {@link Vector Vectors} use a single array that needs to be occasionally reallocated for growth, the
+     * elements of a {@link Deque} can be scattered in different chunks of storage, with the container keeping the
+     * necessary information internally to provide direct access to any of its elements in constant time and with a
+     * uniform sequential interface (through iterators). Therefore, {@link Deque Deques} are a little more complex
+     * internally than {@link Vector Vectors}, but this allows them to grow more efficiently under certain
+     * circumstances, especially with very long sequences, where reallocations become more expensive. </p>
+     *
+     * <p> Both {@link Vector Vectors} and {@link Deque Deques} provide a very similar interface and can be used for
+     * similar purposes, but internally both work in quite different ways: While {@link Vector Vectors} use a single
+     * array that needs to be occasionally reallocated for growth, the elements of a {@link Deque} can be scattered
+     * in different chunks of storage, with the container keeping the necessary information internally to provide
+     * direct access to any of its elements in constant time and with a uniform sequential interface (through
+     * iterators). Therefore, {@link Deque Deques} are a little more complex internally than {@link Vector Vectors},
+     * but this allows them to grow more efficiently under certain circumstances, especially with very long
+     * sequences, where reallocations become more expensive. </p>
+     *
+     * <p> For operations that involve frequent insertion or removals of elements at positions other than the
+     * beginning or the end, {@link IArray} objects perform worse and have less consistent iterators and references
+     * than {@link List Lists} </p>.
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Sequence </dt>
+     *	<dd>
+     *		Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
+     *		accessed by their position in this sequence.
+     *	</dd>
+     *
+     *	<dt> Dynamic array </dt>
+     *	<dd>
+     *		Allows direct access to any element in the sequence, even through pointer arithmetics, and provides
+     *		relatively fast addition/removal of elements at the end of the sequence.
+     *	</dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IArrayContainer<T> extends ILinearContainer<T> {
+        /**
+         * <p> Request a change in capacity. </p>
+         *
+         * <p> Requests that the {@link IArray container} {@link capacity} be at least enough to contain
+         * <i>n</i> elements. </p>
+         *
+         * <p> If <i>n</i> is greater than the current {@link IArray container} {@link capacity}, the
+         * function causes the {@link IArray container} to reallocate its storage increasing its
+         * {@link capacity} to <i>n</i> (or greater). </p>
+         *
+         * <p> In all other cases, the function call does not cause a reallocation and the
+         * {@link IArray container} {@link capacity} is not affected. </p>
+         *
+         * <p> This function has no effect on the {@link IArray container} {@link size} and cannot alter
+         * its elements. </p>
+         *
+         * @param n Minimum {@link capacity} for the {@link IArray container}.
+         *			Note that the resulting {@link capacity} may be equal or greater than <i>n</i>.
+         */
+        reserve(n: number): void;
+        /**
+         * <p> Return size of allocated storage capacity. </p>
+         *
+         * <p> Returns the size of the storage space currently allocated for the {@link IArray container},
+         * expressed in terms of elements. </p>
+         *
+         * <p> This {@link capacity} is not necessarily equal to the {@link IArray container} {@link size}.
+         * It can be equal or greater, with the extra space allowing to accommodate for growth without the
+         * need to reallocate on each insertion. </p>
+         *
+         * <p> Notice that this {@link capacity} does not suppose a limit on the {@link size} of the
+         * {@link IArray container}. When this {@link capacity} is exhausted and more is needed, it is
+         * automatically expanded by the {@link IArray container} (reallocating it storage space).
+         * The theoretical limit on the {@link size} of a {@link IArray container} is given by member
+         * {@link max_size}. </p>
+         *
+         * <p> The {@link capacity} of a {@link IArray container} can be explicitly altered by calling member
+         * {@link IArray.reserve}. </p>
+         *
+         * @return The size of the currently allocated storage capacity in the {@link IArray container},
+         *		   measured in terms of the number elements it can hold.
+         */
+        capacity(): number;
+        /**
+         * <p> Access element. </p>
+         * <p> Returns a value to the element at position <i>index</i> in the {@link IArray container}.</p>
+         *
+         * <p> The function automatically checks whether <i>index</i> is within the bounds of valid elements
+         * in the {@link IArray container}, throwing an {@link OutOfRange} exception if it is not (i.e.,
+         * if <i>index</i> is greater or equal than its {@link size}). </p>
+         *
+         * @param index Position of an element in the
+         *				If this is greater than or equal to the {@link IArray container} {@link size}, an
+         *				exception of type {@link OutOfRange} is thrown. Notice that the first
+         *				element has a position of 0 (not 1).
+         *
+         * @return The element at the specified position in the
+         */
+        at(index: number): T;
+        /**
+         * <p> Modify element. </p>
+         * <p> Replaces an element at the specified position (<i>index</i>) in this {@link IArray container}
+         * with the specified element (<i>val</i>). </p>
+         *
+         * <p> The function automatically checks whether <i>index</i> is within the bounds of valid elements
+         * in the {@link IArray container}, throwing an {@link OutOfRange} exception if it is not (i.e., if
+         * <i>index</i> is greater or equal than its {@link size}). </p>
+         *
+         * @.param index A specified position of the value to replace.
+         * @param val A value to be stored at the specified position.
+         *
+         * @return The previous element had stored at the specified position.
+         */
+        set(index: number, val: T): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> Random-access iterator. </p>
+     *
+     * <p> {@link IArrayIterator Random-access iterators} are iterators that can be used to access elements at an
+     * arbitrary offset position relative to the element they point to, offering the same functionality as pointers.
+     * </p>
+     *
+     * <p> {@link IArrayIterator Random-access iterators} are the most complete iterators in terms of functionality.
+     * All pointer types are also valid {@link IArrayIterator random-access iterators}. </p>
+     *
+     * <p> There is not a single type of {@link IArrayIterator random-access iterator}: Each container may define its
+     * own specific iterator type able to iterate through it and access its elements. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
+     *
+     * @reference http://www.cplusplus.com/reference/iterator/RandomAccessIterator
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IArrayIterator<T> extends Iterator<T> {
+        /**
+         * Get index, sequence number of the iterator in the source {@link IArray array}.
+         *
+         * @return Sequence number of the iterator in the source {@link IArray array}.
+         */
+        index: number;
+        /**
+         * @inheritdoc
+         */
+        prev(): IArrayIterator<T>;
+        /**
+         * @inheritdoc
+         */
+        next(): IArrayIterator<T>;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> An interface of containers. </p>
+     *
+     * <p> {@link IContainer} is an interface designed for sequence containers. Sequence containers of STL
+     * (Standard Template Library) are based on the {@link IContainer}. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/abstract_containers.png" style="max-width: 100%" />
+     * </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     * 	<dt> Sequence </dt>
+     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
+     *		 accessed by their position in this sequence. </dd>
+     *
+     * 	<dt> Doubly-linked list </dt>
+     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing
+     *		 constant time insert and erase operations before or after a specific element (even of entire ranges),
+     *		 but no direct random access. </dd>
+     * </dl>
+     *
+     * @param <T> Type of elements.
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IContainer<T> {
+        /**
+         * <p> Assign new content to content. </p>
+         *
+         * <p> Assigns new contents to the container, replacing its current contents, and modifying its
+         * {@link size} accordingly. </p>
+         *
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * <p> Clear content. </p>
+         *
+         * <p> Removes all elements from the Container, leaving the container with a size of 0. </p>
+         */
+        clear(): void;
+        /**
+         * <p> Return iterator to beginning. </p>
+         *
+         * <p> Returns an iterator referring the first element in the  </p>
+         *
+         * <h4> Note </h4>
+         * <p> If the container is {@link empty}, the returned iterator is same with {@link end end()}. </p>
+         *
+         * @return An iterator to the first element in the  The iterator containes the first element's value.
+         */
+        begin(): Iterator<T>;
+        /**
+         * <p> Return iterator to end. </p>
+         * <p> Returns an iterator referring to the past-the-end element in the  </p>
+         *
+         * <p> The past-the-end element is the theoretical element that would follow the last element in the
+         * It does not point to any element, and thus shall not be dereferenced. </p>
+         *
+         * <p> Because the ranges used by functions of the Container do not include the element reference by their
+         * closing iterator, this function is often used in combination with {@link IContainer}.{@link begin} to
+         * specify a range including all the elements in the container. </p>
+         *
+         * <h4> Note </h4>
+         * <p> Returned iterator from {@link IContainer}.{@link end} does not refer any element. Trying to accessing
+         * element by the iterator will cause throwing exception ({@link OutOfRange}). </p>
+         *
+         * <p> If the container is {@link empty}, this function returns the same as {@link Container}.{@link begin}.
+         * </p>
+         *
+         * @return An iterator to the end element in the
+         */
+        end(): Iterator<T>;
+        /**
+         * <p> Return {@link ReverseIterator reverse iterator} to <i>reverse beginning</i>. </p>
+         *
+         * <p> Returns a {@link ReverseIterator reverse iterator} pointing to the last element in the container (i.e.,
+         * its <i>reverse beginning</i>). </p>
+         *
+         * <p> {@link ReverseIterator reverse iterators} iterate backwards: increasing them moves them towards the
+         * beginning of the  </p>
+         *
+         * <p> {@link rbegin} points to the element right before the one that would be pointed to by member {@link end}.
+         * </p>
+         *
+         * @return A {@link ReverseIterator reverse iterator} to the <i>reverse beginning</i> of the sequence
+         */
+        rbegin(): base.IReverseIterator<T>;
+        /**
+         * <p> Return {@link ReverseIterator reverse iterator} to <i>reverse end</i>. </p>
+         *
+         * <p> Returns a {@link ReverseIterator reverse iterator} pointing to the theoretical element preceding the
+         * first element in the container (which is considered its <i>reverse end</i>). </p>
+         *
+         * <p> The range between {@link IContainer}.{@link rbegin} and {@link IContainer}.{@link rend} contains all
+         * the elements of the container (in reverse order).
+         *
+         * @return A {@link ReverseIterator reverse iterator} to the <i>reverse end</i> of the sequence
+         */
+        rend(): base.IReverseIterator<T>;
+        /**
+         * Return the number of elements in the Container.
+         *
+         * @return The number of elements in the
+         */
+        size(): number;
+        /**
+         * <p> Test whether the container is empty. </p>
+         * <p> Returns whether the container is empty (i.e. whether its size is 0). </p>
+         *
+         * <p> This function does not modify the container in any way. To clear the content of the container,
+         * see {@link clear clear()}. </p>
+         *
+         * @return <code>true</code> if the container size is 0, <code>false</code> otherwise.
+         */
+        empty(): boolean;
+        /**
+         * <p> Insert elements. </p>
+         *
+         * <p> Appends new elements to the container, and returns the new size of the  </p>
+         *
+         * @param items New elements to insert.
+         *
+         * @return New size of the Container.
+         */
+        push<U extends T>(...items: U[]): number;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The container is extended by inserting a new element before the element at the specified
+         * <i>position</i>. This effectively increases the {@link IContainer.size container size} by the amount of
+         * elements inserted. </p>
+         *
+         * @param position Position in the {@link IContainer} where the new element is inserted.
+         *				   {@link iterator} is a member type, defined as a {@link Iterator random access iterator}
+         *				   type that points to elements.
+         * @param val Value to be copied to the inserted element.
+         *
+         * @return An iterator that points to the newly inserted element.
+         */
+        insert(position: Iterator<T>, val: T): Iterator<T>;
+        /**
+         * <p> Erase an element. </p>
+         *
+         * <p> Removes from the container a single element. </p>
+         *
+         * <p> This effectively reduces the container size by the number of element removed. </p>
+         *
+         * @param position Iterator pointing to a single element to be removed from the Container.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function
+         *		   call. This is the {@link end Container.end} if the operation erased the last element in the
+         *		   sequence.
+         */
+        erase(position: Iterator<T>): Iterator<T>;
+        /**
+         * <p> Erase elements. </p>
+         *
+         * <p> Removes from the container a range of elements. </p>
+         *
+         * <p> This effectively reduces the container size by the number of elements removed. </p>
+         *
+         * @param begin An iterator specifying a range of beginning to erase.
+         * @param end An iterator specifying a range of end to erase.
+         *
+         * @return An iterator pointing to the element that followed the last element erased by the function
+         *		   call. This is the {@link end Container.end} if the operation erased the last element in
+         *		   the sequence.
+         */
+        erase(begin: Iterator<T>, end: Iterator<T>): Iterator<T>;
+        /**
+         * <p> Swap content. </p>
+         *
+         * <p> Exchanges the content of the container by the content of <i>obj</i>, which is another
+         * {@link IContainer container} object with same type of elements. Sizes and container type may differ. </p>
+         *
+         * <p> After the call to this member function, the elements in this container are those which were in <i>obj</i>
+         * before the call, and the elements of <i>obj</i> are those which were in this. All iterators, references and
+         * pointers remain valid for the swapped objects. </p>
+         *
+         * <p> Notice that a non-member function exists with the same name, {@link std.swap swap}, overloading that
+         * algorithm with an optimization that behaves like this member function. </p>
+         *
+         * @param obj Another {@link IContainer container} of the same type of elements (i.e., instantiated
+         *			  with the same template parameter, <b>T</b>) whose content is swapped with that of this
+         *			  {@link container IContainer}.
+         */
+        swap(obj: IContainer<T>): void;
+    }
+    interface IReverseIterator<T> extends ReverseIterator<T, Iterator<T>, IReverseIterator<T>> {
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> An interface for deque  </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
+     *
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface IDequeContainer<T> extends ILinearContainer<T> {
+        /**
+         * <p> Insert element at beginning. </p>
+         *
+         * <p> Inserts a new element at the beginning of the {@link IDeque container}, right before its
+         * current first element. This effectively increases the {@link IDeque container} {@link size} by
+         * one. </p>
+         *
+         * @param val Value to be inserted as an element.
+         */
+        push_front(val: T): void;
+        /**
+         * <p> Delete first element. </p>
+         *
+         * <p> Removes the first element in the {@link IDeque container}, effectively reducing its
+         * {@link size} by one. </p>
+         */
+        pop_front(): void;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> An interface for linear containers.  </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/linear_containers.png" style="max-width: 100%" />
+     * </p>
+     *
+     * @author Jeonngho Nam
+     */
+    interface ILinearContainer<T> extends IContainer<T> {
+        /**
+         * @inheritdoc
+         */
+        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
+        /**
+         * <p> Assign container content. </p>
+         *
+         * <p> Assigns new contents to the {@link IList container}, replacing its current contents,
+         * and modifying its {@link size} accordingly. </p>
+         *
+         * @param n New size for the
+         * @param val Value to fill the container with. Each of the <u>n</u> elements in the container will
+         *			  be initialized to a copy of this value.
+         */
+        assign(n: number, val: T): void;
+        /**
+         * <p> Access first element. </p>
+         * <p> Returns a value of the first element in the {@link IList container}. </p>
+         *
+         * <p> Unlike member {@link end end()}, which returns an iterator just past this element,
+         * this function returns a direct value. </p>
+         *
+         * <p> Calling this function on an {@link empty} {@link IList container} causes undefined behavior. </p>
+         *
+         * @return A value of the first element of the {@link IList container}.
+         */
+        front(): T;
+        /**
+         * <p> Access last element. </p>
+         * <p> Returns a value of the last element in the {@link IList container}. </p>
+         *
+         * <p> Unlike member {@link end end()}, which returns an iterator just past this element,
+         * this function returns a direct value. </p>
+         *
+         * <p> Calling this function on an {@link empty} {@link IList container} causes undefined behavior. </p>
+         *
+         * @return A value of the last element of the {@link IList container}.
+         */
+        back(): T;
+        /**
+         * <p> Add element at the end. </p>
+         *
+         * <p> Adds a new element at the end of the {@link IList container}, after its current last element.
+         * This effectively increases the {@link IList container} {@link size} by one. </p>
+         *
+         * @param val Value to be copied to the new element.
+         */
+        push_back(val: T): void;
+        /**
+         * <p> Delete last element. </p>
+         *
+         * <p> Removes the last element in the {@link IList container}, effectively reducing the
+         * {@link IList container} {@link size} by one. </p>
+         */
+        pop_back(): void;
+        /**
+         * <p> Insert an element. </p>
+         *
+         * <p> The {@link IList conatiner} is extended by inserting new element before the element at the
+         * specified <i>position</i>, effectively increasing the {@link IList container} {@link size} by
+         * one. </p>
+         *
+         * @param position Position in the {@link IList container} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a {@link iterator random access iterator}
+         *				   type that points to elements.
+         * @param val Value to be copied to the inserted element.
+         *
+         * @return An iterator that points to the newly inserted element.
+         */
+        insert(position: Iterator<T>, val: T): Iterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The {@link IList container} is extended by inserting new elements before the element at the
+         * specified <i>position</i>, effectively increasing the {@link IList container} {@link size} by
+         * the number of repeating elements </i>n</i>. </p>
+         *
+         * @param position Position in the {@link IList container} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a {@link iterator random access iterator}
+         *				   type that points to elements.
+         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
+         * @param val Value to be copied (or moved) to the inserted elements.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert(position: Iterator<T>, n: number, val: T): Iterator<T>;
+        /**
+         * <p> Insert elements by range iterators. </p>
+         *
+         * <p> The {@link IList container} is extended by inserting new elements before the element at the
+         * specified <i>position</i>, effectively increasing the {@link IList container} {@link size} by
+         * the number of elements inserted by range iterators. </p>
+         *
+         * @param position Position in the {@link IList container} where the new elements are inserted.
+         *				   {@link iterator} is a member type, defined as a {@link iterator random access iterator}
+         *				   type that points to elements.
+         * @param begin Input interator of the initial position in a sequence.
+         * @param end Input interator of the final position in a sequence.
+         *
+         * @return An iterator that points to the first of the newly inserted elements.
+         */
+        insert<U extends T, InputIterator extends Iterator<U>>(position: Iterator<T>, begin: InputIterator, end: InputIterator): Iterator<T>;
+    }
+}
 declare namespace std.base {
     /**
      * <p> Red-black Tree. </p>
@@ -9830,7 +10245,8 @@ declare namespace std.base {
      *	</li>
      * </ol>
      *
-     * <p> <img src="../assets/images/tree/Red-black_tree_example.svg" width="100%" /> </p>
+     * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_example.svg"
+     *			style="max-width: 100%" /> </p>
      *
      * <p> These constraints enforce a critical property of red-black trees: the path from the root to the farthest
      * leaf is no more than twice as long as the path from the root to the nearest leaf. The result is that the tree
@@ -9868,6 +10284,7 @@ declare namespace std.base {
          * Default Constructor.
          */
         constructor();
+        clear(): void;
         /**
          * Find a node from its contained value.
          *
@@ -10023,7 +10440,8 @@ declare namespace std.base {
          * the only loop, and any rotations occur after this loop, this proves that a constant number of rotations
          * occur. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_insert_case_3.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_insert_case_3.svg"
+                    style="max-width: 100%" /> </p>
          *
          * @param N A node to be inserted or swapped.
          */
@@ -10056,7 +10474,8 @@ declare namespace std.base {
          * node are <font color='darkBlue'>black</font>) is still violated, but now we can resolve this by
          * continuing to case 5. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_insert_case_4.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_insert_case_4.svg"
+                    style="max-width: 100%" /> </p>
          *
          * @param N A node to be inserted or swapped.
          */
@@ -10086,7 +10505,8 @@ declare namespace std.base {
          * through {@link XTreeNode.parent <b>P</b>}. In each case, this is the only
          * <font color='darkBlue'>black</font> node of the three. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_insert_case_5.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_insert_case_5.svg"
+                    style="max-width: 100%" /> </p>
          *
          * @param N A node to be inserted or swapped.
          */
@@ -10239,7 +10659,8 @@ declare namespace std.base {
         /**
          * <p> {@link XTreeNode.sibling <b>S</b>} is <font color='red'>red</font>. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_delete_case_2.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_delete_case_2.svg"
+                    style="max-width: 100%" /> </p>
          *
          * <p> In this case we reverse the colors of {@link XTreeNode.parent <b>P</b>} and
          * {@link XTreeNode.sibling <b>S</b>}, and then rotate left at {@link XTreeNode.parent <b>P</b>}, turning
@@ -10260,7 +10681,8 @@ declare namespace std.base {
          * <p> {@link XTreeNode.parent <b>P</b>}, {@link XTreeNode.sibling <b>S</b>}, and {@link XTreeNode.sibling
          * <b>S</b>}'s children are <font color='darkBlue'>black</font>. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_delete_case_3.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_delete_case_3.svg"
+                    style="max-width: 100%" /> </p>
          *
          * <p> In this case, we simply repaint {@link XTreeNode.sibling <b>S</b>} <font color='red'>red</font>. The
          * result is that all paths passing through {@link XTreeNode.sibling <b>S</b>}, which are precisely those
@@ -10283,7 +10705,8 @@ declare namespace std.base {
          * <p> {@link XTreeNode.sibling <b>S</b>} and {@link XTreeNode.sibling <b>S</b>}'s children are
          * <font color='darkBlue'>black</font>, but {@link XTreeNode.parent <b>P</b>} is <font color='red'>red</font>. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_delete_case_4.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_delete_case_4.svg"
+                    style="max-width: 100%" /> </p>
          *
          * <p> In this case, we simply exchange the colors of {@link XTreeNode.sibling <b>S</b>} and
          * {@link XTreeNode.parent <b>P</b>}. This does not affect the number of <font color='darkBlue'>black</font>
@@ -10299,7 +10722,8 @@ declare namespace std.base {
          * left child is <font color='red'>red</font>, {@link XTreeNode.sibling <b>S</b>}'s right child is
          * <font color='darkBlue'>black</font>, and <i><b>N</b></i> is the left child of its parent. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_delete_case_5.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_delete_case_5.svg"
+                    style="max-width: 100%" /> </p>
          *
          * <p> In this case we rotate right at {@link XTreeNode.sibling <b>S</b>}, so that
          * {@link XTreeNode.sibling <b>S</b>}'s left child becomes {@link XTreeNode.sibling <b>S</b>}'s parent and
@@ -10337,7 +10761,8 @@ declare namespace std.base {
          * <p> Thus, the paths passing through <i><b>N</b></i> pass through one additional
          * <font color='darkBlue'>black</font> node. </p>
          *
-         * <p> <img src="../assets/images/tree/Red-black_tree_delete_case_6.svg" /> </p>
+         * <p> <img src="http://samchon.github.io/stl/api/assets/images/tree/Red-black_tree_delete_case_6.svg"
+                    style="max-width: 100%" /> </p>
          *
          * <p> Meanwhile, if a path does not go through <i><b>N</b></i>, then there are two possibilities: </p>
          * <ol>
@@ -10399,648 +10824,284 @@ declare namespace std.base {
 }
 declare namespace std.base {
     /**
-     * <p> A red-black Tree storing {@link SetIterator SetIterators}. </p>
+     * <p> Common interface for tree-structured map. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> {@link ITreeMap ITreeMaps} are associative containers that store elements formed by a combination of
+     * a <i>key value</i> and a <i>mapped value</i>, following a specific order. </p>
      *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class AtomicTree<T> extends XTree<SetIterator<T>> {
-        private compare_;
-        /**
-         * Default Constructor.
-         */
-        constructor(compare?: (left: T, right: T) => boolean);
-        find(val: T): XTreeNode<SetIterator<T>>;
-        find(it: SetIterator<T>): XTreeNode<SetIterator<T>>;
-        /**
-         * @hidden
-         */
-        private find_by_val(val);
-        get_compare(): (left: T, right: T) => boolean;
-        /**
-         * @inheritdoc
-         */
-        is_equal_to(left: SetIterator<T>, right: SetIterator<T>): boolean;
-        /**
-         * @inheritdoc
-         */
-        is_less(left: SetIterator<T>, right: SetIterator<T>): boolean;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> Static class holding enumeration codes of color of Red-black tree. </p>
+     * <p> In a {@link ITreeMap}, the <i>key values</i> are generally used to sort and uniquely identify
+     * the elements, while the <i>mapped values</i> store the content associated to this <i>key</i>. The types of
+     * <i>key</i> and <i>mapped value</i> may differ, and are grouped together in member type
+     * <code>value_type</code>, which is a {@link Pair} type combining both: </p>
      *
-     * <p> Color codes imposed to nodes of RB-Tree are following those rules: </p>
+     * <p> <code>typedef Pair<const Key, T> value_type;</code> </p>
      *
-     * <ol>
-     *	<li> A node is either <font color='red'>red</font> or <font color='darkBlue'>black</font>. </li>
-     *	<li> The root is <font color='darkBlue'>black</font>. This rule is sometimes omitted. Since the root can
-     *		 always be changed from <font color='red'>red</font> to <font color='darkBlue'>black</font>, but not
-     *		 necessarily vice versa, this rule has little effect on analysis. </li>
-     *	<li> All leaves (NIL; <code>null</code>) are <font color='darkBlue'>black</font>. </li>
-     *  <li> If a node is <font color='red'>red</font>, then both its children are
-     *		 <font color='darkBlue'>black</font>. </li>
-     *  <li> Every path from a given node to any of its descendant NIL nodes contains the same number of
-     *		 <font color='darkBlue'>black</font> nodes. Some definitions: the number of
-     *		 <font color='darkBlue'>black</font> nodes from the root to a node is the node's
-     *		 <font color='darkBlue'>black</font> depth; the uniform number of <font color='darkBlue'>black</font>
-     *		 nodes in all paths from root to the leaves is called the <font color='darkBlue'>black</font>-height of
-     *		 the red-black tree. </li>
-     * </ol>
+     * <p> Internally, the elements in a {@link ITreeMap}are always sorted by its key following a
+     * strict weak ordering criterion indicated by its internal comparison method (of {@link less}). </p>
      *
-     * @author Migrated by Jeongho Nam <http://samchon.org>
-     */
-    enum Color {
-        /**
-         * <p> Code of color black. </p>
-         *
-         * <ul>
-         *	<li> Those are clearly black: root, leaf nodes or children nodes of red. </li>
-         *	<li> Every path from a given nodes containes the same number of black nodes exclude NIL(s). </li>
-         * </ul>
-         */
-        BLACK = 0,
-        /**
-         * <p> Code of color red. </p>
-         */
-        RED = 1,
-    }
-}
-declare namespace std.base {
-    enum Hash {
-        MIN_SIZE = 10,
-        RATIO = 1,
-        MAX_RATIO = 2,
-    }
-    /**
-     * <p> Hask buckets. </p>
+     * <p> {@link ITreeMap}containers are generally slower than {@link IHashMap} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based
+     * on their order. </p>
      *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class HashBuckets<T> {
-        private buckets_;
-        private item_size_;
-        /**
-         * Default Constructor.
-         */
-        constructor();
-        /**
-         * <p> Reconstruction of hash table. </p>
-         *
-         * <p> All the elements in the hash buckets are rearranged according to their hash value into the new set of
-         * buckets. This may alter the order of iteration of elements within the container. </p>
-         *
-         * <p> Notice that {@link rehash rehashes} are automatically performed whenever its number of elements is going
-         * to greater than its own {@link capacity}. </p>
-         *
-         * @param size Number of bucket size to rehash.
-         */
-        rehash(size: number): void;
-        clear(): void;
-        size(): number;
-        item_size(): number;
-        capacity(): number;
-        at(index: number): Vector<T>;
-        hash_index(val: T): number;
-        insert(val: T): void;
-        erase(val: T): void;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> Array  </p>
+     * <p> {@link ITreeMap TreeMultiMaps} are typically implemented as binary search trees. </p>
      *
-     * <p> {@link IArray} is an interface for sequence containers representing <i>arrays</i> that can change in
-     * {@link size}. However, compared to <i>arrays</i>, {@link IArray} objectss consume more memory in exchange for
-     * the ability to manage storage and grow dynamically in an efficient way. </p> </p>
-     *
-     * <p> Both {@link Vector Vectors} and {@link Deque Deques} who implemented {@link IArray} provide a very
-     * similar interface and can be used for similar purposes, but internally both work in quite different ways:
-     * While {@link Vector Vectors} use a single array that needs to be occasionally reallocated for growth, the
-     * elements of a {@link Deque} can be scattered in different chunks of storage, with the container keeping the
-     * necessary information internally to provide direct access to any of its elements in constant time and with a
-     * uniform sequential interface (through iterators). Therefore, {@link Deque Deques} are a little more complex
-     * internally than {@link Vector Vectors}, but this allows them to grow more efficiently under certain
-     * circumstances, especially with very long sequences, where reallocations become more expensive. </p>
-     *
-     * <p> Both {@link Vector Vectors} and {@link Deque Deques} provide a very similar interface and can be used for
-     * similar purposes, but internally both work in quite different ways: While {@link Vector Vectors} use a single
-     * array that needs to be occasionally reallocated for growth, the elements of a {@link Deque} can be scattered
-     * in different chunks of storage, with the container keeping the necessary information internally to provide
-     * direct access to any of its elements in constant time and with a uniform sequential interface (through
-     * iterators). Therefore, {@link Deque Deques} are a little more complex internally than {@link Vector Vectors},
-     * but this allows them to grow more efficiently under certain circumstances, especially with very long
-     * sequences, where reallocations become more expensive. </p>
-     *
-     * <p> For operations that involve frequent insertion or removals of elements at positions other than the
-     * beginning or the end, {@link IArray} objects perform worse and have less consistent iterators and references
-     * than {@link List Lists} </p>.
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * <h3> Container properties </h3>
      * <dl>
-     *	<dt> Sequence </dt>
-     *	<dd>
-     *		Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
-     *		accessed by their position in this sequence.
-     *	</dd>
+     *	<dt> Associative </dt>
+     *	<dd> Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		 position in the container. </dd>
      *
-     *	<dt> Dynamic array </dt>
-     *	<dd>
-     *		Allows direct access to any element in the sequence, even through pointer arithmetics, and provides
-     *		relatively fast addition/removal of elements at the end of the sequence.
-     *	</dd>
+     *	<dt> Ordered </dt>
+     *	<dd> The elements in the container follow a strict order at all times. All inserted elements are
+     *		 given a position in this order. </dd>
+     *
+     *	<dt> Map </dt>
+     *	<dd> Each element associates a <i>key</i> to a <i>mapped value</i>:
+     *		 <i>Keys</i> are meant to identify the elements whose main content is the <i>mapped value</i>. </dd>
      * </dl>
      *
-     * @param <T> Type of the elements.
+     * @param <Key> Type of the keys. Each element in a map is uniquely identified by its key value.
+     * @param <T> Type of the mapped value. Each element in a map stores some data as its mapped value.
      *
+     * @reference http://www.cplusplus.com/reference/map
      * @author Jeongho Nam <http://samchon.org>
      */
-    interface IArrayContainer<T> extends ILinearContainer<T> {
+    interface ITreeMap<Key, T> {
         /**
-         * <p> Request a change in capacity. </p>
+         * <p> Return key comparison function. </p>
          *
-         * <p> Requests that the {@link IArray container} {@link capacity} be at least enough to contain
-         * <i>n</i> elements. </p>
+         * <p> Returns a references of the comparison function used by the container to compare <i>keys</i>. </p>
          *
-         * <p> If <i>n</i> is greater than the current {@link IArray container} {@link capacity}, the
-         * function causes the {@link IArray container} to reallocate its storage increasing its
-         * {@link capacity} to <i>n</i> (or greater). </p>
+         * <p> The <i>comparison object</i> of a {@link ITreeMap tree-map object} is set on
+         * {@link TreeMap.constructor construction}. Its type (<i>Key</i>) is the last parameter of the
+         * {@link ITreeMap.constructor constructors}. By default, this is a {@link less} function, which returns the same
+         * as <i>operator&lt;</i>. </p>
          *
-         * <p> In all other cases, the function call does not cause a reallocation and the
-         * {@link IArray container} {@link capacity} is not affected. </p>
-         *
-         * <p> This function has no effect on the {@link IArray container} {@link size} and cannot alter
-         * its elements. </p>
-         *
-         * @param n Minimum {@link capacity} for the {@link IArray container}.
-         *			Note that the resulting {@link capacity} may be equal or greater than <i>n</i>.
-         */
-        reserve(n: number): void;
-        /**
-         * <p> Return size of allocated storage capacity. </p>
-         *
-         * <p> Returns the size of the storage space currently allocated for the {@link IArray container},
-         * expressed in terms of elements. </p>
-         *
-         * <p> This {@link capacity} is not necessarily equal to the {@link IArray container} {@link size}.
-         * It can be equal or greater, with the extra space allowing to accommodate for growth without the
-         * need to reallocate on each insertion. </p>
-         *
-         * <p> Notice that this {@link capacity} does not suppose a limit on the {@link size} of the
-         * {@link IArray container}. When this {@link capacity} is exhausted and more is needed, it is
-         * automatically expanded by the {@link IArray container} (reallocating it storage space).
-         * The theoretical limit on the {@link size} of a {@link IArray container} is given by member
-         * {@link max_size}. </p>
-         *
-         * <p> The {@link capacity} of a {@link IArray container} can be explicitly altered by calling member
-         * {@link IArray.reserve}. </p>
-         *
-         * @return The size of the currently allocated storage capacity in the {@link IArray container},
-         *		   measured in terms of the number elements it can hold.
-         */
-        capacity(): number;
-        /**
-         * <p> Access element. </p>
-         * <p> Returns a value to the element at position <i>index</i> in the {@link IArray container}.</p>
-         *
-         * <p> The function automatically checks whether <i>index</i> is within the bounds of valid elements
-         * in the {@link IArray container}, throwing an {@link OutOfRange} exception if it is not (i.e.,
-         * if <i>index</i> is greater or equal than its {@link size}). </p>
-         *
-         * @param index Position of an element in the
-         *				If this is greater than or equal to the {@link IArray container} {@link size}, an
-         *				exception of type {@link OutOfRange} is thrown. Notice that the first
-         *				element has a position of 0 (not 1).
-         *
-         * @return The element at the specified position in the
-         */
-        at(index: number): T;
-        /**
-         * <p> Modify element. </p>
-         * <p> Replaces an element at the specified position (<i>index</i>) in this {@link IArray container}
-         * with the specified element (<i>val</i>). </p>
-         *
-         * <p> The function automatically checks whether <i>index</i> is within the bounds of valid elements
-         * in the {@link IArray container}, throwing an {@link OutOfRange} exception if it is not (i.e., if
-         * <i>index</i> is greater or equal than its {@link size}). </p>
-         *
-         * @.param index A specified position of the value to replace.
-         * @param val A value to be stored at the specified position.
-         *
-         * @return The previous element had stored at the specified position.
-         */
-        set(index: number, val: T): void;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> Random-access iterator. </p>
-     *
-     * <p> {@link IArrayIterator Random-access iterators} are iterators that can be used to access elements at an
-     * arbitrary offset position relative to the element they point to, offering the same functionality as pointers.
-     * </p>
-     *
-     * <p> {@link IArrayIterator Random-access iterators} are the most complete iterators in terms of functionality.
-     * All pointer types are also valid {@link IArrayIterator random-access iterators}. </p>
-     *
-     * <p> There is not a single type of {@link IArrayIterator random-access iterator}: Each container may define its
-     * own specific iterator type able to iterate through it and access its elements. </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @reference http://www.cplusplus.com/reference/iterator/RandomAccessIterator
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IArrayIterator<T> extends Iterator<T> {
-        /**
-         * Get index, sequence number of the iterator in the source {@link IArray array}.
-         *
-         * @return Sequence number of the iterator in the source {@link IArray array}.
-         */
-        index: number;
-        /**
-         * @inheritdoc
-         */
-        prev(): IArrayIterator<T>;
-        /**
-         * @inheritdoc
-         */
-        next(): IArrayIterator<T>;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> An interface of containers. </p>
-     *
-     * <p> {@link IContainer} is an interface designed for sequence containers. Sequence containers of STL
-     * (Standard Template Library) are based on the {@link IContainer}. </p>
-     *
-     * <p> <img src="../assets/images/design/abstract_containers.png" width="100%" /> </p>
-     *
-     * <h3> Container properties </h3>
-     * <dl>
-     * 	<dt> Sequence </dt>
-     * 	<dd> Elements in sequence containers are ordered in a strict linear sequence. Individual elements are
-     *		 accessed by their position in this sequence. </dd>
-     *
-     * 	<dt> Doubly-linked list </dt>
-     *	<dd> Each element keeps information on how to locate the next and the previous elements, allowing
-     *		 constant time insert and erase operations before or after a specific element (even of entire ranges),
-     *		 but no direct random access. </dd>
-     * </dl>
-     *
-     * @param <T> Type of elements.
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IContainer<T> {
-        /**
-         * <p> Assign new content to content. </p>
-         *
-         * <p> Assigns new contents to the container, replacing its current contents, and modifying its
-         * {@link size} accordingly. </p>
-         *
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * <p> Clear content. </p>
-         *
-         * <p> Removes all elements from the Container, leaving the container with a size of 0. </p>
-         */
-        clear(): void;
-        /**
-         * <p> Return iterator to beginning. </p>
-         *
-         * <p> Returns an iterator referring the first element in the  </p>
-         *
-         * <h4> Note </h4>
-         * <p> If the container is {@link empty}, the returned iterator is same with {@link end end()}. </p>
-         *
-         * @return An iterator to the first element in the  The iterator containes the first element's value.
-         */
-        begin(): Iterator<T>;
-        /**
-         * <p> Return iterator to end. </p>
-         * <p> Returns an iterator referring to the past-the-end element in the  </p>
-         *
-         * <p> The past-the-end element is the theoretical element that would follow the last element in the
-         * It does not point to any element, and thus shall not be dereferenced. </p>
-         *
-         * <p> Because the ranges used by functions of the Container do not include the element reference by their
-         * closing iterator, this function is often used in combination with {@link IContainer}.{@link begin} to
-         * specify a range including all the elements in the  </p>
-         *
-         * <h4> Note </h4>
-         * <p> Returned iterator from {@link IContainer}.{@link end} does not refer any element. Trying to accessing
-         * element by the iterator will cause throwing exception ({@link OutOfRange}). </p>
-         *
-         * <p> If the container is {@link empty}, this function returns the same as {@link Container}.{@link begin}.
+         * <p> This function determines the order of the elements in the container: it is a function pointer that takes
+         * two arguments of the same type as the element <i>keys</i>, and returns <code>true</code> if the first argument
+         * is considered to go before the second in the strict weak ordering it defines, and <code>false</code> otherwise.
          * </p>
          *
-         * @return An iterator to the end element in the
+         * <p> Two keys are considered equivalent if {@link key_comp} returns <code>false</code> reflexively (i.e., no
+         * matter the order in which the keys are passed as arguments). </p>
+         *
+         * @return The comparison function.
          */
-        end(): Iterator<T>;
+        key_comp(): (x: Key, y: Key) => boolean;
         /**
-         * <p> Return {@link ReverseIterator reverse iterator} to <i>reverse beginning</i>. </p>
+         * <p> Return value comparison function. </p>
          *
-         * <p> Returns a {@link ReverseIterator reverse iterator} pointing to the last element in the container (i.e.,
-         * its <i>reverse beginning</i>). </p>
+         * <p> Returns a comparison function that can be used to compare two elements to get whether the key of the first
+         * one goes before the second. </p>
          *
-         * <p> {@link ReverseIterator reverse iterators} iterate backwards: increasing them moves them towards the
-         * beginning of the  </p>
+         * <p> The arguments taken by this function object are of member type <code>std.Pair<Key, T></code> (defined in
+         * {@link ITreeMap}), but the mapped type (<i>T</i>) part of the value is not taken into consideration in this
+         * comparison. </p>
          *
-         * <p> {@link rbegin} points to the element right before the one that would be pointed to by member {@link end}.
-         * </p>
+         * <p> This comparison class returns <code>true</code> if the {@link Pair.first key} of the <i>first argument</i>
+         * is considered to go before that of the <i>second</i> (according to the strict weak ordering specified by the
+         * container's comparison function, {@link key_comp}), and <code>false</code> otherwise. </p>
          *
-         * @return A {@link ReverseIterator reverse iterator} to the <i>reverse beginning</i> of the sequence
+         * @return The comparison function for element values.
          */
-        rbegin(): base.IReverseIterator<T>;
+        value_comp(): (x: Pair<Key, T>, y: Pair<Key, T>) => boolean;
         /**
-         * <p> Return {@link ReverseIterator reverse iterator} to <i>reverse end</i>. </p>
+         * <p> Return iterator to lower bound. </p>
          *
-         * <p> Returns a {@link ReverseIterator reverse iterator} pointing to the theoretical element preceding the
-         * first element in the container (which is considered its <i>reverse end</i>). </p>
+         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
+         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
          *
-         * <p> The range between {@link IContainer}.{@link rbegin} and {@link IContainer}.{@link rend} contains all
-         * the elements of the container (in reverse order).
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
          *
-         * @return A {@link ReverseIterator reverse iterator} to the <i>reverse end</i> of the sequence
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeMap} contains an element with a key equivalent to <i>k</i>: In this
+         * case, {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound}
+         * returns an iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is not considered to go before
+         *		   <i>k</i>, or {@link ITreeMap.end} if all keys are considered to go before <i>k</i>.
          */
-        rend(): base.IReverseIterator<T>;
+        lower_bound(key: Key): MapIterator<Key, T>;
         /**
-         * Return the number of elements in the Container.
+         * <p> Return iterator to upper bound. </p>
          *
-         * @return The number of elements in the
+         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
+         * go after <i>k</i> </p>.
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
+         *
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the map contains an element with a key equivalent to <i>k</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns an
+         * iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is considered to go after
+         *		   <i>k</i>, or {@link TreeMap.end end} if no keys are considered to go after <i>k</i>.
          */
-        size(): number;
+        upper_bound(key: Key): MapIterator<Key, T>;
         /**
-         * <p> Test whether the container is empty. </p>
-         * <p> Returns whether the container is empty (i.e. whether its size is 0). </p>
+         * <p> Get range of equal elements. </p>
          *
-         * <p> This function does not modify the container in any way. To clear the content of the container,
-         * see {@link clear clear()}. </p>
+         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
+         * equivalent to <i>k</i> </p>.
          *
-         * @return <code>true</code> if the container size is 0, <code>false</code> otherwise.
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that has a key considered to go after <i>k</i> according to the container's internal
+         * comparison object (key_comp). </p>
+         *
+         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
+         * (i.e., no matter the order in which the keys are passed as arguments). </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
          */
-        empty(): boolean;
-        /**
-         * <p> Insert elements. </p>
-         *
-         * <p> Appends new elements to the container, and returns the new size of the  </p>
-         *
-         * @param items New elements to insert.
-         *
-         * @return New size of the Container.
-         */
-        push<U extends T>(...items: U[]): number;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The container is extended by inserting a new element before the element at the specified
-         * <i>position</i>. This effectively increases the {@link IContainer.size container size} by the amount of
-         * elements inserted. </p>
-         *
-         * @param position Position in the {@link IContainer} where the new element is inserted.
-         *				   {@link iterator} is a member type, defined as a {@link Iterator random access iterator}
-         *				   type that points to elements.
-         * @param val Value to be copied to the inserted element.
-         *
-         * @return An iterator that points to the newly inserted element.
-         */
-        insert(position: Iterator<T>, val: T): Iterator<T>;
-        /**
-         * <p> Erase an element. </p>
-         *
-         * <p> Removes from the container a single element. </p>
-         *
-         * <p> This effectively reduces the container size by the number of element removed. </p>
-         *
-         * @param position Iterator pointing to a single element to be removed from the Container.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function
-         *		   call. This is the {@link end Container.end} if the operation erased the last element in the
-         *		   sequence.
-         */
-        erase(position: Iterator<T>): Iterator<T>;
-        /**
-         * <p> Erase elements. </p>
-         *
-         * <p> Removes from the container a range of elements. </p>
-         *
-         * <p> This effectively reduces the container size by the number of elements removed. </p>
-         *
-         * @param begin An iterator specifying a range of beginning to erase.
-         * @param end An iterator specifying a range of end to erase.
-         *
-         * @return An iterator pointing to the element that followed the last element erased by the function
-         *		   call. This is the {@link end Container.end} if the operation erased the last element in
-         *		   the sequence.
-         */
-        erase(begin: Iterator<T>, end: Iterator<T>): Iterator<T>;
-        /**
-         * <p> Swap content. </p>
-         *
-         * <p> Exchanges the content of the container by the content of <i>obj</i>, which is another
-         * {@link IContainer container} object with same type of elements. Sizes and container type may differ. </p>
-         *
-         * <p> After the call to this member function, the elements in this container are those which were in <i>obj</i>
-         * before the call, and the elements of <i>obj</i> are those which were in this. All iterators, references and
-         * pointers remain valid for the swapped objects. </p>
-         *
-         * <p> Notice that a non-member function exists with the same name, {@link std.swap swap}, overloading that
-         * algorithm with an optimization that behaves like this member function. </p>
-         *
-         * @param obj Another {@link IContainer container} of the same type of elements (i.e., instantiated
-         *			  with the same template parameter, <b>T</b>) whose content is swapped with that of this
-         *			  {@link container IContainer}.
-         */
-        swap(obj: IContainer<T>): void;
-    }
-    interface IReverseIterator<T> extends ReverseIterator<T, Iterator<T>, IReverseIterator<T>> {
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
     }
 }
 declare namespace std.base {
     /**
-     * <p> An interface for deque  </p>
+     * <p> A red-black tree storing {@link MapIterator MapIterators}. </p>
      *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    interface IDequeContainer<T> extends ILinearContainer<T> {
-        /**
-         * <p> Insert element at beginning. </p>
-         *
-         * <p> Inserts a new element at the beginning of the {@link IDeque container}, right before its
-         * current first element. This effectively increases the {@link IDeque container} {@link size} by
-         * one. </p>
-         *
-         * @param val Value to be inserted as an element.
-         */
-        push_front(val: T): void;
-        /**
-         * <p> Delete first element. </p>
-         *
-         * <p> Removes the first element in the {@link IDeque container}, effectively reducing its
-         * {@link size} by one. </p>
-         */
-        pop_front(): void;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> An interface for linear containers.  </p>
-     *
-     * <p> <img src="../assets/images/design/linear_containers.png" width="100%" /> </p>
-     *
-     * @author Jeonngho Nam
-     */
-    interface ILinearContainer<T> extends IContainer<T> {
-        /**
-         * @inheritdoc
-         */
-        assign<U extends T, InputIterator extends Iterator<U>>(begin: InputIterator, end: InputIterator): void;
-        /**
-         * <p> Assign container content. </p>
-         *
-         * <p> Assigns new contents to the {@link IList container}, replacing its current contents,
-         * and modifying its {@link size} accordingly. </p>
-         *
-         * @param n New size for the
-         * @param val Value to fill the container with. Each of the <u>n</u> elements in the container will
-         *			  be initialized to a copy of this value.
-         */
-        assign(n: number, val: T): void;
-        /**
-         * <p> Access first element. </p>
-         * <p> Returns a value of the first element in the {@link IList container}. </p>
-         *
-         * <p> Unlike member {@link end end()}, which returns an iterator just past this element,
-         * this function returns a direct value. </p>
-         *
-         * <p> Calling this function on an {@link empty} {@link IList container} causes undefined behavior. </p>
-         *
-         * @return A value of the first element of the {@link IList container}.
-         */
-        front(): T;
-        /**
-         * <p> Access last element. </p>
-         * <p> Returns a value of the last element in the {@link IList container}. </p>
-         *
-         * <p> Unlike member {@link end end()}, which returns an iterator just past this element,
-         * this function returns a direct value. </p>
-         *
-         * <p> Calling this function on an {@link empty} {@link IList container} causes undefined behavior. </p>
-         *
-         * @return A value of the last element of the {@link IList container}.
-         */
-        back(): T;
-        /**
-         * <p> Add element at the end. </p>
-         *
-         * <p> Adds a new element at the end of the {@link IList container}, after its current last element.
-         * This effectively increases the {@link IList container} {@link size} by one. </p>
-         *
-         * @param val Value to be copied to the new element.
-         */
-        push_back(val: T): void;
-        /**
-         * <p> Delete last element. </p>
-         *
-         * <p> Removes the last element in the {@link IList container}, effectively reducing the
-         * {@link IList container} {@link size} by one. </p>
-         */
-        pop_back(): void;
-        /**
-         * <p> Insert an element. </p>
-         *
-         * <p> The {@link IList conatiner} is extended by inserting new element before the element at the
-         * specified <i>position</i>, effectively increasing the {@link IList container} {@link size} by
-         * one. </p>
-         *
-         * @param position Position in the {@link IList container} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a {@link iterator random access iterator}
-         *				   type that points to elements.
-         * @param val Value to be copied to the inserted element.
-         *
-         * @return An iterator that points to the newly inserted element.
-         */
-        insert(position: Iterator<T>, val: T): Iterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The {@link IList container} is extended by inserting new elements before the element at the
-         * specified <i>position</i>, effectively increasing the {@link IList container} {@link size} by
-         * the number of repeating elements </i>n</i>. </p>
-         *
-         * @param position Position in the {@link IList container} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a {@link iterator random access iterator}
-         *				   type that points to elements.
-         * @param n Number of elements to insert. Each element is initialized to a copy of <i>val</i>.
-         * @param val Value to be copied (or moved) to the inserted elements.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert(position: Iterator<T>, n: number, val: T): Iterator<T>;
-        /**
-         * <p> Insert elements by range iterators. </p>
-         *
-         * <p> The {@link IList container} is extended by inserting new elements before the element at the
-         * specified <i>position</i>, effectively increasing the {@link IList container} {@link size} by
-         * the number of elements inserted by range iterators. </p>
-         *
-         * @param position Position in the {@link IList container} where the new elements are inserted.
-         *				   {@link iterator} is a member type, defined as a {@link iterator random access iterator}
-         *				   type that points to elements.
-         * @param begin Input interator of the initial position in a sequence.
-         * @param end Input interator of the final position in a sequence.
-         *
-         * @return An iterator that points to the first of the newly inserted elements.
-         */
-        insert<U extends T, InputIterator extends Iterator<U>>(position: Iterator<T>, begin: InputIterator, end: InputIterator): Iterator<T>;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> Hash buckets storing {@link MapIterator MapIterators}. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
-     *
-     * @author Jeongho Nam <http://samchon.org>
-     */
-    class MapHashBuckets<K, T> extends HashBuckets<MapIterator<K, T>> {
-        private map;
-        constructor(map: MapContainer<K, T>);
-        find(key: K): MapIterator<K, T>;
-    }
-}
-declare namespace std.base {
-    /**
-     * <p> A red-black Tree storing {@link MapIterator MapIterators}. </p>
-     *
-     * <p> <img src="../assets/images/design/map_containers.png" width="100%" /> </p>
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/map_containers.png" style="max-width: 100%" /> </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
     class PairTree<Key, T> extends XTree<MapIterator<Key, T>> {
+        private map_;
         private compare_;
         /**
          * Default Constructor.
          */
-        constructor(compare?: (left: Key, right: Key) => boolean);
+        constructor(map: TreeMap<Key, T> | TreeMultiMap<Key, T>, compare?: (x: Key, y: Key) => boolean);
         find(key: Key): XTreeNode<MapIterator<Key, T>>;
         find(it: MapIterator<Key, T>): XTreeNode<MapIterator<Key, T>>;
         /**
          * @hidden
          */
         private find_by_key(key);
-        get_compare(): (left: Key, right: Key) => boolean;
+        /**
+         * <p> Return iterator to lower bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container whose key is not considered to
+         * go before <i>k</i> (i.e., either it is equivalent or goes after). </p>
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return false. </p>
+         *
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is not less than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeMap} contains an element with a key equivalent to <i>k</i>: In this
+         * case, {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound}
+         * returns an iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is not considered to go before
+         *		   <i>k</i>, or {@link ITreeMap.end} if all keys are considered to go before <i>k</i>.
+         */
+        lower_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * <p> Return iterator to upper bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container whose key is considered to
+         * go after <i>k</i> </p>.
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(<i>k</i>, element_key) would return true. </p>
+         *
+         * <p> If the {@link ITreeMap} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element whose key is greater than <i>k</i> </p>.
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the map contains an element with a key equivalent to <i>k</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to that element, whereas {@link upper_bound} returns an
+         * iterator pointing to the next element. </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return An iterator to the the first element in the container whose key is considered to go after
+         *		   <i>k</i>, or {@link TreeMap.end end} if no keys are considered to go after <i>k</i>.
+         */
+        upper_bound(key: Key): MapIterator<Key, T>;
+        /**
+         * <p> Get range of equal elements. </p>
+         *
+         * <p> Returns the bounds of a range that includes all the elements in the container which have a key
+         * equivalent to <i>k</i> </p>.
+         *
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that has a key considered to go after <i>k</i> according to the container's internal
+         * comparison object (key_comp). </p>
+         *
+         * <p> Two keys are considered equivalent if the container's comparison object returns false reflexively
+         * (i.e., no matter the order in which the keys are passed as arguments). </p>
+         *
+         * @param k Key to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
+         */
+        equal_range(key: Key): Pair<MapIterator<Key, T>, MapIterator<Key, T>>;
+        /**
+         * <p> Return key comparison function. </p>
+         *
+         * <p> Returns a references of the comparison function used by the container to compare <i>keys</i>. </p>
+         *
+         * <p> The <i>comparison object</i> of a {@link ITreeMap tree-map object} is set on
+         * {@link TreeMap.constructor construction}. Its type (<i>Key</i>) is the last parameter of the
+         * {@link ITreeMap.constructor constructors}. By default, this is a {@link less} function, which returns the same
+         * as <i>operator&lt;</i>. </p>
+         *
+         * <p> This function determines the order of the elements in the container: it is a function pointer that takes
+         * two arguments of the same type as the element <i>keys</i>, and returns <code>true</code> if the first argument
+         * is considered to go before the second in the strict weak ordering it defines, and <code>false</code> otherwise.
+         * </p>
+         *
+         * <p> Two keys are considered equivalent if {@link key_comp} returns <code>false</code> reflexively (i.e., no
+         * matter the order in which the keys are passed as arguments). </p>
+         *
+         * @return The comparison function.
+         */
+        key_comp(): (x: Key, y: Key) => boolean;
+        /**
+         * <p> Return value comparison function. </p>
+         *
+         * <p> Returns a comparison function that can be used to compare two elements to get whether the key of the first
+         * one goes before the second. </p>
+         *
+         * <p> The arguments taken by this function object are of member type <code>std.Pair<Key, T></code> (defined in
+         * {@link ITreeMap}), but the mapped type (<i>T</i>) part of the value is not taken into consideration in this
+         * comparison. </p>
+         *
+         * <p> This comparison class returns <code>true</code> if the {@link Pair.first key} of the <i>first argument</i>
+         * is considered to go before that of the <i>second</i> (according to the strict weak ordering specified by the
+         * container's comparison function, {@link key_comp}), and <code>false</code> otherwise. </p>
+         *
+         * @return The comparison function for element values.
+         */
+        value_comp(): (x: Pair<Key, T>, y: Pair<Key, T>) => boolean;
         /**
          * @inheritdoc
          */
@@ -11053,16 +11114,300 @@ declare namespace std.base {
 }
 declare namespace std.base {
     /**
-     * <p> Hash buckets storing {@link SetIterator SetIterators}. </p>
+     * <p> A common interface for tree-structured set. </p>
      *
-     * <p> <img src="../assets/images/design/set_containers.png" width="100%" /> </p>
+     * <p> {@link ITreeSet TreeMultiSets} are containers that store elements following a specific order. </p>
+     *
+     * <p> In a {@link ITreeSet}, the value of an element also identifies it (the value is itself
+     * the <i>key</i>, of type <i>T</i>). The value of the elements in a {@link ITreeSet} cannot
+     * be modified once in the container (the elements are always const), but they can be inserted or removed
+     * from the  </p>
+     *
+     * <p> Internally, the elements in a {@link ITreeSet TreeMultiSets} are always sorted following a strict
+     * weak ordering criterion indicated by its internal comparison method (of {@link IComparable.less less}). </p>
+     *
+     * <p> {@link ITreeSet} containers are generally slower than {@link IHashSet} containers
+     * to access individual elements by their <i>key</i>, but they allow the direct iteration on subsets based on
+     * their order. </p>
+     *
+     * <p> {@link ITreeSet TreeMultiSets} are typically implemented as binary search trees. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
+     *
+     * <h3> Container properties </h3>
+     * <dl>
+     *	<dt> Associative </dt>
+     *	<dd>
+     *		Elements in associative containers are referenced by their <i>key</i> and not by their absolute
+     *		position in the container.
+     *	</dd>
+     *
+     *	<dt> Ordered </dt>
+     *	<dd>
+     *		The elements in the container follow a strict order at all times. All inserted elements are
+     *		given a position in this order.
+     *	</dd>
+     *
+     *	<dt> Set </dt>
+     *	<dd> The value of an element is also the <i>key</i> used to identify it. </dd>
+     * </dl>
+     *
+     * @param <T> Type of the elements. Each element in a {@link ITreeSet} container is also identified
+     *			  by this value (each value is itself also the element's <i>key</i>).
+     *
+     * @reference http://www.cplusplus.com/reference/set
+     * @author Jeongho Nam <http://samchon.org>
+     */
+    interface ITreeSet<T> {
+        /**
+         * <p> Return comparison function. </p>
+         *
+         * <p> Returns a copy of the comparison function used by the container. </p>
+         *
+         * <p> By default, this is a {@link less} object, which returns the same as <i>operator<</i>. </p>
+         *
+         * <p> This object determines the order of the elements in the container: it is a function pointer or a function
+         * object that takes two arguments of the same type as the container elements, and returns <code>true</code> if
+         * the <i>first argument</i> is considered to go before the <i>second</i> in the <i>strict weak ordering</i> it
+         * defines, and <code>false</code> otherwise. </p>
+         *
+         * <p> Two elements of a {@link ITreeSet} are considered equivalent if {@link key_comp} returns <code>false</code>
+         * reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * <p> In {@link ITreeSet} containers, the <i>keys</i> to sort the elements are the values (<i>T</i>) themselves,
+         * therefore {@link key_comp} and its sibling member function {@link value_comp} are equivalent. </p>
+         *
+         * @return The comparison function.
+         */
+        key_comp(): (x: T, y: T) => boolean;
+        /**
+         * <p> Return comparison function. </p>
+         *
+         * <p> Returns a copy of the comparison function used by the container. </p>
+         *
+         * <p> By default, this is a {@link less} object, which returns the same as <i>operator<</i>. </p>
+         *
+         * <p> This object determines the order of the elements in the container: it is a function pointer or a function
+         * object that takes two arguments of the same type as the container elements, and returns <code>true</code> if
+         * the <i>first argument</i> is considered to go before the <i>second</i> in the <i>strict weak ordering</i> it
+         * defines, and <code>false</code> otherwise. </p>
+         *
+         * <p> Two elements of a {@link ITreeSet} are considered equivalent if {@link key_comp} returns <code>false</code>
+         * reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * <p> In {@link ITreeSet} containers, the <i>keys</i> to sort the elements are the values (<i>T</i>) themselves,
+         * therefore {@link key_comp} and its sibling member function {@link value_comp} are equivalent. </p>
+         *
+         * @return The comparison function.
+         */
+        value_comp(): (x: T, y: T) => boolean;
+        /**
+         * <p> Return iterator to lower bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is not considered to
+         * go before <i>val</i> (i.e., either it is equivalent or goes after). </p>
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(element,val) would return false. </p>
+         *
+         * <p> If the {@link ITreeSet} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element that is not less than <i>val</i>. </p>
+
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is not considered to go before
+         *		   <i>val</i>, or {@link ITreeSet.end} if all elements are considered to go before <i>val</i>.
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Return iterator to upper bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is considered to go after
+         * <i>val</i>. </p>
+
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(val,element) would return true. </p>
+
+         * <p> If the {@code ITreeSet} class is instantiated with the default comparison type (less), the
+         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the {@ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is considered to go after
+         *		   <i>val</i>, or {@link TreeSet.end end} if no elements are considered to go after <i>val</i>.
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Get range of equal elements. </p>
+         *
+         * <p> Returns the bounds of a range that includes all the elements in the container that are equivalent
+         * to <i>val</i>. </p>
+         *
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that is considered to go after val according to the container's
+         * internal comparison object (key_comp). </p>
+         *
+         * <p> Two elements of a multiset are considered equivalent if the container's comparison object returns
+         * false reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * @param key Value to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+    }
+}
+declare namespace std.base {
+    /**
+     * <p> A red-black Tree storing {@link SetIterator SetIterators}. </p>
+     *
+     * <p> <a href="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" target="_blank">
+     * <img src="http://samchon.github.io/stl/api/assets/images/design/set_containers.png" style="max-width: 100%" /> </p>
      *
      * @author Jeongho Nam <http://samchon.org>
      */
-    class SetHashBuckets<T> extends HashBuckets<SetIterator<T>> {
-        private set;
-        constructor(set: SetContainer<T>);
-        find(val: T): SetIterator<T>;
+    class AtomicTree<T> extends XTree<SetIterator<T>> {
+        private set_;
+        private compare_;
+        /**
+         * Default Constructor.
+         */
+        constructor(set: TreeSet<T> | TreeMultiSet<T>, compare?: (x: T, y: T) => boolean);
+        find(val: T): XTreeNode<SetIterator<T>>;
+        find(it: SetIterator<T>): XTreeNode<SetIterator<T>>;
+        /**
+         * @hidden
+         */
+        private find_by_val(val);
+        /**
+         * <p> Return iterator to lower bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is not considered to
+         * go before <i>val</i> (i.e., either it is equivalent or goes after). </p>
+         *
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(element,val) would return false. </p>
+         *
+         * <p> If the {@link ITreeSet} class is instantiated with the default comparison type ({@link less}),
+         * the function returns an iterator to the first element that is not less than <i>val</i>. </p>
+
+         * <p> A similar member function, {@link upper_bound}, has the same behavior as {@link lower_bound}, except
+         * in the case that the {@link ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is not considered to go before
+         *		   <i>val</i>, or {@link ITreeSet.end} if all elements are considered to go before <i>val</i>.
+         */
+        lower_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Return iterator to upper bound. </p>
+         *
+         * <p> Returns an iterator pointing to the first element in the container which is considered to go after
+         * <i>val</i>. </p>
+
+         * <p> The function uses its internal comparison object (key_comp) to determine this, returning an
+         * iterator to the first element for which key_comp(val,element) would return true. </p>
+
+         * <p> If the {@code ITreeSet} class is instantiated with the default comparison type (less), the
+         * function returns an iterator to the first element that is greater than <i>val</i>. </p>
+         *
+         * <p> A similar member function, {@link lower_bound}, has the same behavior as {@link upper_bound}, except
+         * in the case that the {@ITreeSet} contains elements equivalent to <i>val</i>: In this case
+         * {@link lower_bound} returns an iterator pointing to the first of such elements, whereas
+         * {@link upper_bound} returns an iterator pointing to the element following the last. </p>
+         *
+         * @param val Value to compare.
+         *
+         * @return An iterator to the the first element in the container which is considered to go after
+         *		   <i>val</i>, or {@link TreeSet.end end} if no elements are considered to go after <i>val</i>.
+         */
+        upper_bound(val: T): SetIterator<T>;
+        /**
+         * <p> Get range of equal elements. </p>
+         *
+         * <p> Returns the bounds of a range that includes all the elements in the container that are equivalent
+         * to <i>val</i>. </p>
+         *
+         * <p> If no matches are found, the range returned has a length of zero, with both iterators pointing to
+         * the first element that is considered to go after val according to the container's
+         * internal comparison object (key_comp). </p>
+         *
+         * <p> Two elements of a multiset are considered equivalent if the container's comparison object returns
+         * false reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * @param key Value to search for.
+         *
+         * @return The function returns a {@link Pair}, whose member {@link Pair.first} is the lower bound of
+         *		   the range (the same as {@link lower_bound}), and {@link Pair.second} is the upper bound
+         *		   (the same as {@link upper_bound}).
+         */
+        equal_range(val: T): Pair<SetIterator<T>, SetIterator<T>>;
+        /**
+         * <p> Return comparison function. </p>
+         *
+         * <p> Returns a copy of the comparison function used by the container. </p>
+         *
+         * <p> By default, this is a {@link less} object, which returns the same as <i>operator<</i>. </p>
+         *
+         * <p> This object determines the order of the elements in the container: it is a function pointer or a function
+         * object that takes two arguments of the same type as the container elements, and returns <code>true</code> if
+         * the <i>first argument</i> is considered to go before the <i>second</i> in the <i>strict weak ordering</i> it
+         * defines, and <code>false</code> otherwise. </p>
+         *
+         * <p> Two elements of a {@link ITreeSet} are considered equivalent if {@link key_comp} returns <code>false</code>
+         * reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * <p> In {@link ITreeSet} containers, the <i>keys</i> to sort the elements are the values (<i>T</i>) themselves,
+         * therefore {@link key_comp} and its sibling member function {@link value_comp} are equivalent. </p>
+         *
+         * @return The comparison function.
+         */
+        key_comp(): (x: T, y: T) => boolean;
+        /**
+         * <p> Return comparison function. </p>
+         *
+         * <p> Returns a copy of the comparison function used by the container. </p>
+         *
+         * <p> By default, this is a {@link less} object, which returns the same as <i>operator<</i>. </p>
+         *
+         * <p> This object determines the order of the elements in the container: it is a function pointer or a function
+         * object that takes two arguments of the same type as the container elements, and returns <code>true</code> if
+         * the <i>first argument</i> is considered to go before the <i>second</i> in the <i>strict weak ordering</i> it
+         * defines, and <code>false</code> otherwise. </p>
+         *
+         * <p> Two elements of a {@link ITreeSet} are considered equivalent if {@link key_comp} returns <code>false</code>
+         * reflexively (i.e., no matter the order in which the elements are passed as arguments). </p>
+         *
+         * <p> In {@link ITreeSet} containers, the <i>keys</i> to sort the elements are the values (<i>T</i>) themselves,
+         * therefore {@link key_comp} and its sibling member function {@link value_comp} are equivalent. </p>
+         *
+         * @return The comparison function.
+         */
+        value_comp(): (x: T, y: T) => boolean;
+        /**
+         * @inheritdoc
+         */
+        is_equal_to(left: SetIterator<T>, right: SetIterator<T>): boolean;
+        /**
+         * @inheritdoc
+         */
+        is_less(left: SetIterator<T>, right: SetIterator<T>): boolean;
     }
 }
 declare namespace std.base {

From 244bca9c78ca30d297118d9e9a62a6f707c5cc9d Mon Sep 17 00:00:00 2001
From: Mario Nebl <hello@herebecode.com>
Date: Mon, 20 Jun 2016 23:31:57 +0200
Subject: [PATCH 220/278] add browser-resolve module

---
 browser-resolve/browser-resolve-tests.ts | 39 +++++++++++++++
 browser-resolve/browser-resolve.d.ts     | 61 ++++++++++++++++++++++++
 2 files changed, 100 insertions(+)
 create mode 100644 browser-resolve/browser-resolve-tests.ts
 create mode 100644 browser-resolve/browser-resolve.d.ts

diff --git a/browser-resolve/browser-resolve-tests.ts b/browser-resolve/browser-resolve-tests.ts
new file mode 100644
index 0000000000..071b17a1d2
--- /dev/null
+++ b/browser-resolve/browser-resolve-tests.ts
@@ -0,0 +1,39 @@
+/// <reference path="./browser-resolve.d.ts" />
+
+import * as browserResolve from 'browser-resolve';
+
+function basic_test_async(callback: (err?: Error, resolved?: string) => void) {
+  browserResolve('typescript', function(error, resolved) {
+    if (error) {
+      return callback(error);
+    }
+    callback(null, resolved);
+  });
+}
+
+function basic_test_sync() {
+  var resolved = browserResolve.sync('typescript');
+}
+
+function options_test_async() {
+  browserResolve('typescript', {
+    browser: 'jsnext:main',
+    filename: './browser-resolve/browser-resolve.js',
+    modules: {
+      fs: './fs-shim.js'
+    }
+  }, function(error, resolved) {
+    if (error) {
+      console.error(error);
+      return;
+    }
+    console.log(resolved);
+  });
+}
+
+function options_test_sync() {
+  var resolved = browserResolve.sync('typescript', {
+    filename: './browser-resolve/browser-resolve.js',
+    modules: {}
+  });
+}
diff --git a/browser-resolve/browser-resolve.d.ts b/browser-resolve/browser-resolve.d.ts
new file mode 100644
index 0000000000..8c1456c8f0
--- /dev/null
+++ b/browser-resolve/browser-resolve.d.ts
@@ -0,0 +1,61 @@
+// Type definitions for browser-resolve
+// Project: https://github.com/defunctzombie/node-browser-resolve
+// Definitions by: Mario Nebl <https://github.com/marionebl/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../resolve/resolve.d.ts" />
+
+declare module 'browser-resolve' {
+  import * as resolve from 'resolve';
+
+  /**
+   * Callback invoked when resolving asynchronously
+   *
+   * @param error
+   * @param resolved Absolute path to resolved identifier
+   */
+  type resolveCallback = (err?: Error, resolved?: string) => void;
+
+  /**
+   * Resolve a module path and call cb(err, path [, pkg])
+   *
+   * @param id Identifier to resolve
+   * @param callback
+   */
+  function browserResolve(id: string, cb: resolveCallback): void;
+
+  /**
+   * Resolve a module path and call cb(err, path [, pkg])
+   *
+   * @param id Identifier to resolve
+   * @param options Options to use for resolving, optional.
+   * @param callback
+   */
+  function browserResolve(id: string, opts: browserResolve.AsyncOpts, cb: resolveCallback): void;
+
+  /**
+   * Returns a module path
+   *
+   * @param id Identifier to resolve
+   * @param options Options to use for resolving, optional.
+   */
+  function browserResolveSync(id: string, opts?: browserResolve.SyncOpts): string;
+
+  namespace browserResolve {
+    interface Opts {
+      // the 'browser' property to use from package.json (defaults to 'browser')
+      browser?: string;
+      // the calling filename where the require() call originated (in the source)
+      filename?: string;
+      // modules object with id to path mappings to consult before doing manual resolution (use to provide core modules)
+      modules?: any;
+    }
+
+    export interface AsyncOpts extends resolve.AsyncOpts, Opts {}
+    export interface SyncOpts extends resolve.SyncOpts, Opts {}
+
+    export var sync: typeof browserResolveSync;
+  }
+
+  export = browserResolve
+}

From 5e27c7933424720b65d6680521bd74dafb236990 Mon Sep 17 00:00:00 2001
From: Jeongho Nam <samchon@samchon.org>
Date: Tue, 21 Jun 2016 16:11:12 +0900
Subject: [PATCH 221/278] Samchon-Framework-Tests

---
 samchon-framework/samchon-framework-tests.ts | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/samchon-framework/samchon-framework-tests.ts b/samchon-framework/samchon-framework-tests.ts
index 88c2632a37..59422caeea 100644
--- a/samchon-framework/samchon-framework-tests.ts
+++ b/samchon-framework/samchon-framework-tests.ts
@@ -1,4 +1,9 @@
 /// <reference path="samchon-framework.d.ts" />
 
 import samchon = require("samchon-framework");
-console.log(samchon);
\ No newline at end of file
+
+let xml = new samchon.library.XML();
+xml.setTag("font");
+xml.setProperty("fontSize", "13");
+
+console.log(xml.toString());
\ No newline at end of file

From 7cbebb0f32dca424e12f394208ffd01ab59cb7c5 Mon Sep 17 00:00:00 2001
From: Jeongho Nam <samchon@samchon.org>
Date: Tue, 21 Jun 2016 16:44:04 +0900
Subject: [PATCH 222/278] IEntityGroup.find has deprecated

ES6 has Array.find method.
---
 samchon-framework/samchon-framework-tests.ts |  7 +------
 samchon-framework/samchon-framework.d.ts     | 19 ++++++-------------
 2 files changed, 7 insertions(+), 19 deletions(-)

diff --git a/samchon-framework/samchon-framework-tests.ts b/samchon-framework/samchon-framework-tests.ts
index 59422caeea..88c2632a37 100644
--- a/samchon-framework/samchon-framework-tests.ts
+++ b/samchon-framework/samchon-framework-tests.ts
@@ -1,9 +1,4 @@
 /// <reference path="samchon-framework.d.ts" />
 
 import samchon = require("samchon-framework");
-
-let xml = new samchon.library.XML();
-xml.setTag("font");
-xml.setProperty("fontSize", "13");
-
-console.log(xml.toString());
\ No newline at end of file
+console.log(samchon);
\ No newline at end of file
diff --git a/samchon-framework/samchon-framework.d.ts b/samchon-framework/samchon-framework.d.ts
index 5a885d6cd1..c81a9d1e5b 100644
--- a/samchon-framework/samchon-framework.d.ts
+++ b/samchon-framework/samchon-framework.d.ts
@@ -2277,24 +2277,24 @@ declare namespace samchon.protocol {
          *
          * <h4> Standard Usage. </h4>
          * <code>
-         *<memberList>
+         * <memberList>
          *	<member id='jhnam88' name='Jeongho Nam' birthdate='1988-03-11' />
          *	<member id='master' name='Administartor' birthdate='2011-07-28' />
-         *</memberList>
+         * </memberList>
          * </code>
          *
          * <h4> Non-standard usage abusing value. </h4>
          * <code>
-         *<member>
+         * <member>
          *	<id>jhnam88</id>
          *	<name>Jeongho Nam</name>
          *	<birthdate>1988-03-11</birthdate>
-         *</member>
-         *<member>
+         * </member>
+         * <member>
          *	<id>master</id>
          *	<name>Administartor</name>
          *	<birthdate>2011-07-28</birthdate>
-         *</member>
+         * </member>
          * </code>
          *
          * @return An XML object representing the Entity.
@@ -2385,7 +2385,6 @@ declare namespace samchon.protocol {
          * @return An iterator to the element, if an element with specified <i>key</i> is found, or
          *		   {@link end end()} otherwise.
          */
-        find(key: any): std.Iterator<T>;
         /**
          * <p> Whether have the item or not. </p>
          *
@@ -2455,7 +2454,6 @@ declare namespace samchon.protocol {
         /**
          * @inheritdoc
          */
-        find(key: any): std.VectorIterator<T>;
         /**
          * @inheritdoc
          */
@@ -2500,7 +2498,6 @@ declare namespace samchon.protocol {
         /**
          * @inheritdoc
          */
-        find(key: any): std.ListIterator<T>;
         /**
          * @inheritdoc
          */
@@ -2545,7 +2542,6 @@ declare namespace samchon.protocol {
         /**
          * @inheritdoc
          */
-        find(key: any): std.DequeIterator<T>;
         /**
          * @inheritdoc
          */
@@ -2597,7 +2593,6 @@ declare namespace samchon.protocol {
         /**
          * @inheritdoc
          */
-        find(key: any): std.VectorIterator<T>;
         /**
          * @inheritdoc
          */
@@ -2642,7 +2637,6 @@ declare namespace samchon.protocol {
         /**
          * @inheritdoc
          */
-        find(key: any): std.ListIterator<T>;
         /**
          * @inheritdoc
          */
@@ -2687,7 +2681,6 @@ declare namespace samchon.protocol {
         /**
          * @inheritdoc
          */
-        find(key: any): std.DequeIterator<T>;
         /**
          * @inheritdoc
          */

From 9ff405abf07600a5b542f89867eb96381d4b6dfb Mon Sep 17 00:00:00 2001
From: Simon <simon@foodit.com>
Date: Tue, 21 Jun 2016 09:36:00 +0100
Subject: [PATCH 223/278] Change raygun options parameter types

`excludedHostnames` and `excludedUserAgents` is an array of strings or regular expressions.
---
 raygun4js/raygun4js.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/raygun4js/raygun4js.d.ts b/raygun4js/raygun4js.d.ts
index c5647f804a..88fd063ea1 100644
--- a/raygun4js/raygun4js.d.ts
+++ b/raygun4js/raygun4js.d.ts
@@ -62,8 +62,8 @@ declare namespace raygun {
         ignoreAjaxAbort?: boolean;
         ignoreAjaxError?: boolean;
         disableAnonymousUserTracking?: boolean;
-        excludedHostnames?: boolean | string[];
-        excludedUserAgents?: boolean | string[];
+        excludedHostnames?: (string|Regex)[];
+        excludedUserAgents?: (string|Regex)[];
         wrapAsynchronousCallbacks?: boolean;
         debugMode?: boolean;
         ignore3rdPartyErrors?: boolean;

From 408c075ad5d3fb8b4d0d85adfbd0d120c54cd4c1 Mon Sep 17 00:00:00 2001
From: Simon <simon@foodit.com>
Date: Tue, 21 Jun 2016 09:41:34 +0100
Subject: [PATCH 224/278] Fix regular expressions type

The previous type was wrong. 'RegExp' is the correct type.
---
 raygun4js/raygun4js.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/raygun4js/raygun4js.d.ts b/raygun4js/raygun4js.d.ts
index 88fd063ea1..974a37f2be 100644
--- a/raygun4js/raygun4js.d.ts
+++ b/raygun4js/raygun4js.d.ts
@@ -62,8 +62,8 @@ declare namespace raygun {
         ignoreAjaxAbort?: boolean;
         ignoreAjaxError?: boolean;
         disableAnonymousUserTracking?: boolean;
-        excludedHostnames?: (string|Regex)[];
-        excludedUserAgents?: (string|Regex)[];
+        excludedHostnames?: (string|RegExp)[];
+        excludedUserAgents?: (string|RegExp)[];
         wrapAsynchronousCallbacks?: boolean;
         debugMode?: boolean;
         ignore3rdPartyErrors?: boolean;

From 984f83346a54b46f552dd2ceb5481f86efaebdd8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Johannes=20Dr=C3=B6nner?=
 <droenner@Mathematik.Uni-Marburg.DE>
Date: Tue, 21 Jun 2016 11:23:20 +0200
Subject: [PATCH 225/278] openlayers: Add filter function for layers in
 SelectOptions

---
 openlayers/openlayers-tests.ts | 4 ++++
 openlayers/openlayers.d.ts     | 4 ++--
 2 files changed, 6 insertions(+), 2 deletions(-)

diff --git a/openlayers/openlayers-tests.ts b/openlayers/openlayers-tests.ts
index a2152b11ad..39bc7284f2 100644
--- a/openlayers/openlayers-tests.ts
+++ b/openlayers/openlayers-tests.ts
@@ -546,3 +546,7 @@ var modify: ol.interaction.Modify = new ol.interaction.Modify({
 var draw: ol.interaction.Draw = new ol.interaction.Draw({
     type: "Point"
 })
+
+const select: ol.interaction.Select = new ol.interaction.Select({
+    layers: (layer: ol.layer.Layer) => true;
+});
diff --git a/openlayers/openlayers.d.ts b/openlayers/openlayers.d.ts
index d1ec613314..5ab387be4e 100644
--- a/openlayers/openlayers.d.ts
+++ b/openlayers/openlayers.d.ts
@@ -552,12 +552,12 @@ declare namespace olx {
         interface SelectOptions {
             addCondition?: ol.events.ConditionType;
             condition?: ol.events.ConditionType;
-            layers?: Array<ol.layer.Layer>;
+            layers?: Array<ol.layer.Layer> | ((layer: ol.layer.Layer) => boolean);
             style?: ol.style.Style | Array<ol.style.Style> | ol.style.StyleFunction;
             removeCondition?: ol.events.ConditionType;
             toggleCondition?: ol.events.ConditionType;
             multi?: boolean;
-            features?: ol.Collection<ol.Feature>
+            features?: ol.Collection<ol.Feature>;
             filter?: ol.interaction.SelectFilterFunction;
             wrapX?: boolean;
         }

From a0c1bd29ed97dc85521ccb1fad4492463960a1e0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Johannes=20Dr=C3=B6nner?=
 <droenner@Mathematik.Uni-Marburg.DE>
Date: Tue, 21 Jun 2016 11:47:10 +0200
Subject: [PATCH 226/278] openlayers: Add missing functions for
 ol.source.TileWMS

---
 openlayers/openlayers.d.ts | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)

diff --git a/openlayers/openlayers.d.ts b/openlayers/openlayers.d.ts
index 5ab387be4e..26753d64a5 100644
--- a/openlayers/openlayers.d.ts
+++ b/openlayers/openlayers.d.ts
@@ -4152,6 +4152,31 @@ declare namespace ol {
 
         class TileWMS {
             constructor(options: olx.TileWMSOptions);
+
+            /**
+             * Update the user-provided (WMS request) parameters.
+             */
+            updateParams(params: Object);
+
+            /**
+             * Get the user-provided (WMS request) params, i.e. those passed to the constructor through the "params" option, and possibly updated using the updateParams method.
+             */
+            getParams(): Object;
+
+            /**
+             * Return the GetFeatureInfo URL for the passed coordinate, resolution, and
+             * projection. Return `undefined` if the GetFeatureInfo URL cannot be
+             * constructed.
+             * @param coordinate Coordinate.
+             * @param resolution Resolution.
+             * @param rojection Projection.
+             * @param params GetFeatureInfo params. `INFO_FORMAT` at least should
+             *     be provided. If `QUERY_LAYERS` is not provided then the layers specified
+             *     in the `LAYERS` parameter will be used. `VERSION` should not be
+             *     specified here.
+             * @return GetFeatureInfo URL.
+             */
+            getGetFeatureInfoUrl(coordinate: ol.Coordinate, resolution: number, projection: ol.proj.ProjectionLike, params: Object): string;
         }
 
         class Vector {

From d679811f3b53886ef5bc6ab4b7f90e38c015e205 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Johannes=20Dr=C3=B6nner?=
 <droenner@Mathematik.Uni-Marburg.DE>
Date: Tue, 21 Jun 2016 12:16:34 +0200
Subject: [PATCH 227/278] openlayers: Add tests for ol.source.TileWMS + Add
 functions and tests for ol.source.Source

---
 openlayers/openlayers-tests.ts | 11 +++++++++++
 openlayers/openlayers.d.ts     | 10 ++++++++++
 2 files changed, 21 insertions(+)

diff --git a/openlayers/openlayers-tests.ts b/openlayers/openlayers-tests.ts
index 39bc7284f2..9aeb8ffce4 100644
--- a/openlayers/openlayers-tests.ts
+++ b/openlayers/openlayers-tests.ts
@@ -358,6 +358,14 @@ var imageWMS: ol.source.ImageWMS = new ol.source.ImageWMS({
     serverType: stringValue,
     url:stringValue
 });
+
+//
+// ol.source.Source
+//
+const source = imageWMS as ol.source.Source;
+voidValue = source.refresh();
+projectionValue = source.getProjection();
+
 //
 // ol.source.TileWMS
 //
@@ -367,6 +375,9 @@ var tileWMS: ol.source.TileWMS = new ol.source.TileWMS({
     url:stringValue
 });
 
+tileWMS.updateParams(tileWMS.getParams());
+stringValue = tileWMS.getGetFeatureInfoUrl();
+
 //
 // ol.source.WMTS
 //
diff --git a/openlayers/openlayers.d.ts b/openlayers/openlayers.d.ts
index 26753d64a5..c03fb0cfd5 100644
--- a/openlayers/openlayers.d.ts
+++ b/openlayers/openlayers.d.ts
@@ -4121,6 +4121,16 @@ declare namespace ol {
         }
 
         class Source {
+            /**
+             * Get the projection of the source.
+             * @return Projection.
+             */
+            getProjection(): ol.proj.Projection;
+
+            /**
+             * Refreshes the source and finally dispatches a 'change' event.
+             */
+            refresh(): void;
         }
 
         class Stamen {

From f526787747c7f05827c83327a291e09eb5ae6da5 Mon Sep 17 00:00:00 2001
From: Alex Pyzhianov <alex.pyzhianov@gmail.com>
Date: Tue, 21 Jun 2016 14:36:46 +0300
Subject: [PATCH 228/278] React: add SVG flters to JSX Elements

---
 react/react.d.ts | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)

diff --git a/react/react.d.ts b/react/react.d.ts
index 7bb584bd03..486ed4a4d3 100644
--- a/react/react.d.ts
+++ b/react/react.d.ts
@@ -2477,6 +2477,24 @@ declare namespace JSX {
         clipPath: React.SVGProps;
         defs: React.SVGProps;
         ellipse: React.SVGProps;
+        feBlend: React.SVGProps;
+        feColorMatrix: React.SVGProps;
+        feComponentTransfer: React.SVGProps;
+        feComposite: React.SVGProps;
+        feConvolveMatrix: React.SVGProps;
+        feDiffuseLighting: React.SVGProps;
+        feDisplacementMap: React.SVGProps;
+        feFlood: React.SVGProps;
+        feGaussianBlur: React.SVGProps;
+        feImage: React.SVGProps;
+        feMerge: React.SVGProps;
+        feMergeNode: React.SVGProps;
+        feMorphology: React.SVGProps;
+        feOffset: React.SVGProps;
+        feSpecularLighting: React.SVGProps;
+        feTile: React.SVGProps;
+        feTurbulence: React.SVGProps;
+        filter: React.SVGProps;
         foreignObject: React.SVGProps;
         g: React.SVGProps;
         image: React.SVGProps;

From 1f94d58f7bc8546b4ae392a8790256f985c240a6 Mon Sep 17 00:00:00 2001
From: Simon de Lang <simondelang@gmail.com>
Date: Tue, 21 Jun 2016 14:06:42 +0200
Subject: [PATCH 229/278] Add MetaProperty to esprima

---
 esprima/esprima.d.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/esprima/esprima.d.ts b/esprima/esprima.d.ts
index bd5f4009d2..30fe9512bf 100644
--- a/esprima/esprima.d.ts
+++ b/esprima/esprima.d.ts
@@ -71,6 +71,7 @@ declare namespace esprima {
         LabeledStatement: string,
         LogicalExpression: string,
         MemberExpression: string,
+        MetaProperty: string,
         MethodDefinition: string,
         NewExpression: string,
         ObjectExpression: string,

From 8c08b0f46fb442e5e83cbbd90818369bccf0c782 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Johannes=20Dr=C3=B6nner?=
 <droenner@Mathematik.Uni-Marburg.DE>
Date: Tue, 21 Jun 2016 14:12:51 +0200
Subject: [PATCH 230/278] openlayers: add source inheritance

---
 openlayers/openlayers.d.ts | 65 ++++++++++++++++++++++----------------
 1 file changed, 37 insertions(+), 28 deletions(-)

diff --git a/openlayers/openlayers.d.ts b/openlayers/openlayers.d.ts
index c03fb0cfd5..44f921a0b5 100644
--- a/openlayers/openlayers.d.ts
+++ b/openlayers/openlayers.d.ts
@@ -4085,42 +4085,48 @@ declare namespace ol {
 
     namespace source {
 
-        class BingMaps {
+        class BingMaps extends TileImage {
         }
 
-        class Cluster {
+        class CartoDB extends XYZ {
         }
 
-        class Image {
+        class Cluster extends Vector {
         }
 
-        class ImageCanvas {
+        class Image extends Source {
+        }
+
+        class ImageArcGISRest extends Image {
+        }
+
+        class ImageCanvas extends Image {
         }
 
         class ImageEvent {
         }
 
-        class ImageMapGuide {
+        class ImageMapGuide extends Image {
         }
 
-        class ImageStatic {
+        class ImageStatic extends Image {
         }
 
-        class ImageVector {
+        class ImageVector extends ImageCanvas {
         }
 
-        class ImageWMS {
+        class ImageWMS extends Image {
             constructor(options: olx.ImageWMSOptions);
         }
 
-        class MapQuest {
+        class MapQuest extends XYZ {
             constructor(options: any);
         }
 
-        class OSM {
+        class OSM extends XYZ {
         }
 
-        class Source {
+        class Source extends Object {
             /**
              * Get the projection of the source.
              * @return Projection.
@@ -4133,40 +4139,37 @@ declare namespace ol {
             refresh(): void;
         }
 
-        class Stamen {
+        class Stamen extends XYZ {
         }
 
-        class Tile {
+        class Tile extends Source {
         }
 
-        class TileArcGISRest {
+        class TileArcGISRest extends TileImage {
         }
 
-        class TileDebug {
+        class TileDebug extends Tile {
         }
 
         class TileEvent {
         }
 
-        class TileImage {
+        class TileImage extends UrlTile {
         }
 
-        class TileJSON {
+        class TileJSON extends TileImage {
         }
 
-        class TileUTFGrid {
+        class TileUTFGrid extends Tile {
         }
 
-        class TileVector {
-        }
-
-        class TileWMS {
+        class TileWMS extends TileImage {
             constructor(options: olx.TileWMSOptions);
 
             /**
              * Update the user-provided (WMS request) parameters.
              */
-            updateParams(params: Object);
+            updateParams(params: Object): void;
 
             /**
              * Get the user-provided (WMS request) params, i.e. those passed to the constructor through the "params" option, and possibly updated using the updateParams method.
@@ -4186,10 +4189,13 @@ declare namespace ol {
              *     specified here.
              * @return GetFeatureInfo URL.
              */
-            getGetFeatureInfoUrl(coordinate: ol.Coordinate, resolution: number, projection: ol.proj.ProjectionLike, params: Object): string;
+            getGetFeatureInfoUrl(coordinate: ol.Coordinate, resolution: number, projection: ol.proj.ProjectionLike, params: {}): string;
         }
 
-        class Vector {
+        class UrlTile extends Tile {
+        }
+
+        class Vector extends Source {
             constructor(opts?: olx.source.VectorOptions)
             /**
              * Add a single feature to the source. If you want to add a batch of features at once,
@@ -4233,14 +4239,17 @@ declare namespace ol {
         class VectorEvent {
         }
 
-        class WMTS {
+        class VectorTile extends UrlTile {
+        }
+
+        class WMTS extends TileImage {
             constructor(options: olx.source.WMTSOptions);
         }
 
-        class XYZ {
+        class XYZ extends TileImage {
         }
 
-        class Zoomify {
+        class Zoomify extends TileImage {
         }
 
         // Namespaces

From 22bcfb974e1fc84b5946ab67cdd6471ef14048a7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Johannes=20Dr=C3=B6nner?=
 <droenner@Mathematik.Uni-Marburg.DE>
Date: Tue, 21 Jun 2016 14:17:30 +0200
Subject: [PATCH 231/278] fix tests

---
 openlayers/openlayers-tests.ts | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/openlayers/openlayers-tests.ts b/openlayers/openlayers-tests.ts
index 9aeb8ffce4..4937d52516 100644
--- a/openlayers/openlayers-tests.ts
+++ b/openlayers/openlayers-tests.ts
@@ -364,7 +364,7 @@ var imageWMS: ol.source.ImageWMS = new ol.source.ImageWMS({
 //
 const source = imageWMS as ol.source.Source;
 voidValue = source.refresh();
-projectionValue = source.getProjection();
+projection = source.getProjection();
 
 //
 // ol.source.TileWMS
@@ -376,7 +376,7 @@ var tileWMS: ol.source.TileWMS = new ol.source.TileWMS({
 });
 
 tileWMS.updateParams(tileWMS.getParams());
-stringValue = tileWMS.getGetFeatureInfoUrl();
+stringValue = tileWMS.getGetFeatureInfoUrl([0, 0], 1, "EPSG:4326", {});
 
 //
 // ol.source.WMTS
@@ -559,5 +559,5 @@ var draw: ol.interaction.Draw = new ol.interaction.Draw({
 })
 
 const select: ol.interaction.Select = new ol.interaction.Select({
-    layers: (layer: ol.layer.Layer) => true;
+    layers: (layer: ol.layer.Layer) => true,
 });

From 7678ef7519c9f177f93c12f0f01243b3cf9487d1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Johannes=20Dr=C3=B6nner?=
 <droenner@Mathematik.Uni-Marburg.DE>
Date: Tue, 21 Jun 2016 14:35:54 +0200
Subject: [PATCH 232/278] replace ol.Object with {}

---
 openlayers/openlayers.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/openlayers/openlayers.d.ts b/openlayers/openlayers.d.ts
index 44f921a0b5..f08238b969 100644
--- a/openlayers/openlayers.d.ts
+++ b/openlayers/openlayers.d.ts
@@ -4169,12 +4169,12 @@ declare namespace ol {
             /**
              * Update the user-provided (WMS request) parameters.
              */
-            updateParams(params: Object): void;
+            updateParams(params: {}): void;
 
             /**
              * Get the user-provided (WMS request) params, i.e. those passed to the constructor through the "params" option, and possibly updated using the updateParams method.
              */
-            getParams(): Object;
+            getParams(): {};
 
             /**
              * Return the GetFeatureInfo URL for the passed coordinate, resolution, and

From 7b465f81218a032c4abc6f4785e5697214261038 Mon Sep 17 00:00:00 2001
From: Daryl LaBar <d3labar@hotmail.com>
Date: Tue, 21 Jun 2016 09:06:20 -0400
Subject: [PATCH 233/278] Added String as valid types for set methods. Removed
 new Modules for string literal types.  Moved String literal types to their
 parent namespaces.

---
 xrm/xrm-tests.ts |  15 +++---
 xrm/xrm.d.ts     | 123 +++++++++++++++++++++++++++--------------------
 2 files changed, 79 insertions(+), 59 deletions(-)

diff --git a/xrm/xrm-tests.ts b/xrm/xrm-tests.ts
index db0608d8cf..f3f4576b02 100644
--- a/xrm/xrm-tests.ts
+++ b/xrm/xrm-tests.ts
@@ -121,16 +121,17 @@ var level: Xrm.Page.ui.FormNotificationLevel;
 level = "ERROR";
 Xrm.Page.ui.setFormNotification("Test", level, "uniqueId"); 
 
-/// Demonstrate
+/// Demonstrate Requirement Level and Submit Mode both via string parameters and String Literal Types
 
-let requirementlevel: Xrm.Page.Attribute.RequirementLevel;
-requirementlevel = "none";
-let submitMode: Xrm.Page.Attribute.SubmitMode;
-submitMode = "always";
+let requirementLevel: Xrm.Page.RequirementLevel = "none";
+let requirementLevelString = "none";
+let submitMode: Xrm.Page.SubmitMode = "always";
+let submitModeString = "always";
 
 let attribute = Xrm.Page.getAttribute<Xrm.Page.LookupAttribute>("customerid");
 attribute.setSubmitMode(submitMode);
-attribute.setRequiredLevel(requirementlevel);
-
+attribute.setSubmitMode(submitMode);
+attribute.setRequiredLevel(requirementLevel);
+attribute.setRequiredLevel(requirementLevelString);
 
 
diff --git a/xrm/xrm.d.ts b/xrm/xrm.d.ts
index 474d232f7c..cf2b4c77c3 100644
--- a/xrm/xrm.d.ts
+++ b/xrm/xrm.d.ts
@@ -210,6 +210,19 @@ declare namespace Xrm
         }
     }
 
+    /**
+     * Client Types for Xrm.Page.context.getClient().
+     */
+    export type Client = "Web" | "Outlook" | "Mobile";
+    /**
+     * Client States for Xrm.Page.context.getClientState().
+     */
+    export type ClientState = "Online" | "Offline";
+    /**
+     * Themes for Xrm.Page.context.getCurrentTheme().
+     */
+    export type Theme = "default" | "Office12Blue" | "Office14Silver";
+
     /**
      * Interface for the client context.
      */
@@ -220,19 +233,14 @@ declare namespace Xrm
          *
          * @return  The client, as either "Web", "Outlook", or "Mobile"
          */
-        getClient(): ClientContext.Client;
+        getClient(): Client;
 
         /**
          * Gets client's current state.
          *
          * @return  The client state, as either "Online" or "Offline"
          */
-        getClientState(): ClientContext.ClientState;
-    }
-
-    export module ClientContext {
-        export type Client = "Web" | "Outlook" | "Mobile";
-        export type ClientState = "Online" | "Offline";
+        getClientState(): ClientState;
     }
 
     /**
@@ -262,7 +270,7 @@ declare namespace Xrm
          *
          * @remarks This function does not work with Dynamics CRM for tablets.
          */
-        getCurrentTheme(): Context.Theme;
+        getCurrentTheme(): Theme;
 
         /**
          * Gets whether automatic save is enabled.
@@ -349,9 +357,6 @@ declare namespace Xrm
         prependOrgName( sPath: string ): string;
     }
 
-    export module Context {
-        export type Theme = "default" | "Office12Blue" | "Office14Silver";
-    }
     /**
      * Interface for the Xrm.Page.data object.
      */
@@ -445,7 +450,7 @@ declare namespace Xrm
          */
         refreshRibbon(): void;
 
-        setFormNotification(message: string, level: Page.ui.FormNotificationLevel, uniqueId: string ): boolean;
+        setFormNotification(message: string, level: Page.ui.FormNotificationLevel | string, uniqueId: string ): boolean;
 
         process: Page.data.ProcessManager;
 
@@ -612,6 +617,23 @@ declare namespace Xrm
      */
     export module Page
     {
+        /**
+         * Requirement Level for Xrm.Page.Attribute.getRequiredLevel() and Xrm.Page.Attribute.setRequiredLevel().
+         */
+        export type RequirementLevel = "none" | "recommended" | "required";
+        /**
+         * Save Modes for Xrm.Page.Entity.save().
+         */
+        export type SaveMode = "saveandclose" | "saveandnew";
+        /**
+         * Status for Xrm.Page.Stage.getStatus().
+         */
+        export type Status = "active" | "inactive";
+        /**
+         * Submit Mode for Xrm.Page.Attribute.getSubmitMode() and Xrm.Page.Attribute.setSubmitMode().
+         */
+        export type SubmitMode = "always" | "dirty" | "never";
+
         /**
          * Interface for a CRM Business Process Flow instance.
          */
@@ -691,7 +713,7 @@ declare namespace Xrm
              *
              * @remarks  This method will return either "active" or "inactive".
              */
-            getStatus(): Stage.Status;
+            getStatus(): Status;
 
             /**
              * Returns a collection of steps in the stage.
@@ -701,10 +723,6 @@ declare namespace Xrm
             getSteps(): Step[];
         }
 
-        export module Stage {
-            export type Status = "active" | "inactive";
-        }
-
         export interface Step
         {
             /**
@@ -991,7 +1009,7 @@ declare namespace Xrm
              *
              * @return  The required level, as either "none", "required", or "recommended"
              */
-            getRequiredLevel(): Attribute.RequirementLevel;
+            getRequiredLevel(): RequirementLevel;
 
             /**
              * Gets current submit mode for the attribute.
@@ -1000,7 +1018,7 @@ declare namespace Xrm
              *
              * @remarks The default value is "dirty"
              */
-            getSubmitMode(): Attribute.SubmitMode;
+            getSubmitMode(): SubmitMode;
 
             /**
              * Gets the current user's privileges for the attribute.
@@ -1021,7 +1039,7 @@ declare namespace Xrm
              *
              * @param   {string}    requirementLevel    The requirement level, as either "none", "required", or "recommended"
              */
-            setRequiredLevel(requirementLevel: Attribute.RequirementLevel): void;
+            setRequiredLevel(requirementLevel: RequirementLevel | string): void;
 
             /**
              * Sets the submit mode.
@@ -1030,7 +1048,7 @@ declare namespace Xrm
              *
              * @remarks The default value is "dirty"
              */
-            setSubmitMode(submitMode: Attribute.SubmitMode): void;
+            setSubmitMode(submitMode: SubmitMode | string): void;
 
             /**
              * A collection of all the controls on the form that interface with this attribute.
@@ -1038,11 +1056,6 @@ declare namespace Xrm
             controls: Collection.ItemCollection<Control>;
         }
 
-        export module Attribute {
-            export type RequirementLevel = "none" | "recommended" | "required" ;
-            export type SubmitMode = "always" | "dirty" | "never";
-        }
-
         /**
          * Interface for a Number attribute.
          *
@@ -1362,7 +1375,7 @@ declare namespace Xrm
              * @param   {string}    saveMode    (Optional) the save mode to save, as either "saveandclose" or
              *                                  "saveandnew".
              */
-            save( saveMode: Entity.SaveMode ): void;
+            save( saveMode: SaveMode | string): void;
 
             /**
              * The collection of attributes for the record.
@@ -1370,10 +1383,6 @@ declare namespace Xrm
             attributes: Collection.ItemCollection<Attribute>;
         }
 
-        export module Entity {
-            export type SaveMode = "saveandclose" | "saveandnew";
-        }
-
         /**
          * Interface for save event arguments.
          */
@@ -2007,7 +2016,7 @@ declare namespace Xrm
              *
              * @param   {string}    displayState   Display state of the tab, as either "expanded" or "collapsed"
              */
-            setDisplayState(displayState: ui.DisplayState ): void;
+            setDisplayState(displayState: ui.DisplayState | string ): void;
 
             /**
              * A reference to the collection of form sections within this tab.
@@ -2047,6 +2056,16 @@ declare namespace Xrm
          */
         export module ui
         {
+            /**
+             * Form Notification Levels for Xrm.Ui.setFormNotification().
+             */
+            export type FormNotificationLevel = "ERROR" | "INFO" | "WARNING";
+
+            /**
+             * Display States for Xrm.ui.ProcessMonitor.setDisplayState().
+             */
+            export type DisplayState = "collapsed" | "expanded";
+
             /**
              * Interface for Xrm.Page.ui.process API
              */
@@ -2201,10 +2220,6 @@ declare namespace Xrm
                  */
                 getEntityReference(): LookupValue;
             }
-
-            export type FormNotificationLevel = "ERROR" | "INFO" | "WARNING";
-
-            export type DisplayState = "collapsed" | "expanded";
         }
 
         /**
@@ -2287,6 +2302,19 @@ declare namespace Xrm
      */
     export module Url
     {
+        /**
+         * Command Bar Display options for Xrm.Url.FormOpenParameters.cmdbar, Xrm.Url.ViewOpenParameters.cmdbar, and Xrm.Utility.FormOpenParameters.cmdbar.
+         */
+        export type CmdBarDisplay = "true" | "false";
+        /**
+         * Navigation Bar Display options for Xrm.Url.FormOpenParameters.navbar, Xrm.Url.ViewOpenParameters.navbar, and Xrm.Utility.FormOpenParameters.navbar.
+         */
+        export type NavBarDisplay = "entity" | "off" | "on";
+        /**
+         * Report Open Action options for Xrm.Url.ReportOpenParameters.actions.
+         */
+        export type ReportAction = "filter" | "run";
+
         /**
          * Interface for defining parameters on a request to open a form with main.aspx (as with
          * window.open). Useful for parsing the keys and values into a string of the format:
@@ -2318,7 +2346,7 @@ declare namespace Xrm
              * Accepted values are: "true"    (The command bar is displayed.)
              *                      "false"   (The command bar is not displayed.)
              */
-            cmdbar?: OpenParameters.CmdBarDisplay;
+            cmdbar?: CmdBarDisplay;
 
             /**
              * Controls whether the Navigation bar is displayed on the form.
@@ -2327,7 +2355,7 @@ declare namespace Xrm
              *                      "entity"  (On an entity form, only the navigation options for related
              *                                entities are available.)
              */
-            navbar?: OpenParameters.NavBarDisplay;
+            navbar?: NavBarDisplay;
         }
 
         /**
@@ -2366,7 +2394,7 @@ declare namespace Xrm
              * Accepted values are: "true"    (The command bar is displayed.)
              *                      "false"   (The command bar is not displayed.)
              */
-            cmdbar?: OpenParameters.CmdBarDisplay;
+            cmdbar?: CmdBarDisplay;
 
             /**
              * Controls whether the Navigation bar is displayed on the form.
@@ -2375,7 +2403,7 @@ declare namespace Xrm
              *                      "entity"  (On an entity form, only the navigation options for related
              *                                entities are available.)
              */
-            navbar?: OpenParameters.NavBarDisplay;
+            navbar?: NavBarDisplay;
         }
 
         /**
@@ -2419,7 +2447,7 @@ declare namespace Xrm
              * @remarks  "run"       Executes the report with default filters.
              *           "filter"    Presents the user with the filter editor, and a "Run Report" button.
              */
-            action: ReportOpenParameters.Action;
+            action: ReportAction;
 
             /**
              * The file name of the report.  For out-of-box reports, this parameter enables context-sensitive
@@ -2432,15 +2460,6 @@ declare namespace Xrm
              */
             id: string;
         }
-
-        export module ReportOpenParameters {
-            export type Action = "filter" | "run";
-        }
-    }
-
-    export module OpenParameters {
-        export type NavBarDisplay = "entity" | "off" | "on";
-        export type CmdBarDisplay = "true" | "false";
     }
 
     /**
@@ -2478,14 +2497,14 @@ declare namespace Xrm
              *                      "entity"  (On an entity form, only the navigation options for related
              *                                entities are available.)
              */
-            navbar?: OpenParameters.NavBarDisplay;
+            navbar?: Url.NavBarDisplay;
 
             /**
              * Controls whether the command bar is displayed.
              * Accepted values are: "true"    (The command bar is displayed.)
              *                      "false"   (The command bar is not displayed.)
              */
-            cmdbar?: OpenParameters.CmdBarDisplay;
+            cmdbar?: Url.CmdBarDisplay;
         }
 
         /**

From 98cd2fe064b63b717fe4aed41b79d01626ab12f9 Mon Sep 17 00:00:00 2001
From: Daniel McAssey <daniel.mcassey@gmail.com>
Date: Tue, 21 Jun 2016 14:12:33 +0100
Subject: [PATCH 234/278] Add ResumableJS Typings

---
 resumablejs/resumable-tests.ts |  33 +++
 resumablejs/resumable.d.ts     | 374 +++++++++++++++++++++++++++++++++
 2 files changed, 407 insertions(+)
 create mode 100644 resumablejs/resumable-tests.ts
 create mode 100644 resumablejs/resumable.d.ts

diff --git a/resumablejs/resumable-tests.ts b/resumablejs/resumable-tests.ts
new file mode 100644
index 0000000000..202a64bd42
--- /dev/null
+++ b/resumablejs/resumable-tests.ts
@@ -0,0 +1,33 @@
+/// <reference path="resumable.d.ts" />
+
+import { Resumable, ResumableFile } from 'resumablejs';
+
+let resumable: Resumable = new Resumable({chunkSize: 123});
+let resumableDefaultOpts: Resumable = new Resumable({});
+resumable.addFile(null, null);
+resumable.assignBrowse(document.getElementById("test"), true);
+resumable.assignBrowse([document.getElementById("test")], true);
+resumable.assignDrop(document.getElementById("test"));
+resumable.assignDrop([document.getElementById("test")]);
+resumable.unAssignDrop(document.getElementById("test"));
+resumable.unAssignDrop([document.getElementById("test")]);
+resumable.cancel();
+let defaults: Object = resumable.defaults;
+let events: any[] = resumable.events;
+let files: any[] = resumable.files;
+resumable.fire();
+let {} = resumable.getFromUniqueIdentifier('test');
+let {} = resumable.getOpt('test');
+let size: number = resumable.getSize();
+resumable.handleChangeEvent(null);
+resumable.handleDropEvent(null);
+let isUploading: boolean = resumable.isUploading();
+resumable.on('test', function() {});
+let opts: Object = resumable.opts;
+resumable.pause();
+let progress:number = resumable.progress();
+resumable.removeFile(null);
+let support: boolean = resumable.support;
+resumable.upload();
+resumable.uploadNextChunk();
+let version:number = resumable.version;
\ No newline at end of file
diff --git a/resumablejs/resumable.d.ts b/resumablejs/resumable.d.ts
new file mode 100644
index 0000000000..265097b149
--- /dev/null
+++ b/resumablejs/resumable.d.ts
@@ -0,0 +1,374 @@
+// Type definitions for Resumable.js
+// Project: https://github.com/23/resumable.js
+// Definitions by: Daniel McAssey <https://github.com/DanielMcAssey>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare namespace Resumable {
+  interface ConfigurationHash {
+    /**
+     * The target URL for the multipart POST request. This can be a string or a function that allows you you to construct and return a value, based on supplied params. (Default: /)
+     **/
+    target?: string;
+    /**
+     * The size in bytes of each uploaded chunk of data. The last uploaded chunk will be at least this size and up to two the size, see Issue #51 for details and reasons. (Default: 1*1024*1024)
+     **/
+    chunkSize?: number;
+    /**
+     * Force all chunks to be less or equal than chunkSize. Otherwise, the last chunk will be greater than or equal to chunkSize. (Default: false)
+     **/
+    forceChunkSize?: boolean;
+    /**
+     * Number of simultaneous uploads (Default: 3)
+     **/
+    simultaneousUploads?: number;
+    /**
+     * The name of the multipart POST parameter to use for the file chunk (Default: file)
+     **/
+    fileParameterName?: string;
+    /**
+     * The name of the chunk index (base-1) in the current upload POST parameter to use for the file chunk (Default: resumableChunkNumber)
+     */
+    chunkNumberParameterName?: string;
+    /**
+     * The name of the total number of chunks POST parameter to use for the file chunk (Default: resumableTotalChunks)
+     */
+    totalChunksParameterName?: string;
+    /**
+     * The name of the general chunk size POST parameter to use for the file chunk (Default: resumableChunkSize)
+     */
+    chunkSizeParameterName?: string;
+    /**
+     * The name of the total file size number POST parameter to use for the file chunk (Default: resumableTotalSize)
+     */
+    totalSizeParameterName?: string;
+    /**
+     * The name of the unique identifier POST parameter to use for the file chunk (Default: resumableIdentifier)
+     */
+    identifierParameterName?: string;
+    /**
+     * The name of the original file name POST parameter to use for the file chunk (Default: resumableFilename)
+     */
+    fileNameParameterName?: string;
+    /**
+     * The name of the file's relative path POST parameter to use for the file chunk (Default: resumableRelativePath)
+     */
+    relativePathParameterName?: string;
+    /**
+     * The name of the current chunk size POST parameter to use for the file chunk (Default: resumableCurrentChunkSize)
+     */
+    currentChunkSizeParameterName?: string;
+    /**
+     * The name of the file type POST parameter to use for the file chunk (Default: resumableType)
+     */
+    typeParameterName?: string;
+    /**
+     * Extra parameters to include in the multipart POST with data. This can be an object or a function. If a function, it will be passed a ResumableFile and a ResumableChunk object (Default: {})
+     **/
+    query?: Object;
+    /**
+     * Method for chunk test request. (Default: 'GET')
+     **/
+    testMethod?: string;
+    /**
+     * Method for chunk upload request. (Default: 'POST')
+     **/
+    uploadMethod?: string;
+    /**
+     * Extra prefix added before the name of each parameter included in the multipart POST or in the test GET. (Default: '')
+     **/
+    parameterNamespace?: string;
+    /**
+     * Extra headers to include in the multipart POST with data. This can be an object or a function that allows you to construct and return a value, based on supplied file (Default: {})
+     **/
+    headers?: Object | ((file: ResumableFile) => Object);
+    /**
+     * Method to use when POSTing chunks to the server (multipart or octet) (Default: multipart)
+     **/
+    method?: string;
+    /**
+     * Prioritize first and last chunks of all files. This can be handy if you can determine if a file is valid for your service from only the first or last chunk. For example, photo or video meta data is usually located in the first part of a file, making it easy to test support from only the first chunk. (Default: false)
+     **/
+    prioritizeFirstAndLastChunk?: boolean;
+    /**
+     * Make a GET request to the server for each chunks to see if it already exists. If implemented on the server-side, this will allow for upload resumes even after a browser crash or even a computer restart. (Default: true)
+     **/
+    testChunks?: boolean;
+    /**
+     * Optional function to process each chunk before testing & sending. Function is passed the chunk as parameter, and should call the preprocessFinished method on the chunk when finished. (Default: null)
+     **/
+    preprocess?: (chunk: ResumableChunk) => ResumableChunk;
+    /**
+     * Override the function that generates unique identifiers for each file. (Default: null)
+     **/
+    generateUniqueIdentifier?: () => string;
+    /**
+     * Indicates how many files can be uploaded in a single session. Valid values are any positive integer and undefined for no limit. (Default: undefined)
+     **/
+    maxFiles?: number;
+    /**
+     * A function which displays the please upload n file(s) at a time message. (Default: displays an alert box with the message Please n one file(s) at a time.)
+     **/
+    maxFilesErrorCallback?: (files: ResumableFile, errorCount: number) => void;
+    /**
+     * The minimum allowed file size. (Default: undefined)
+     **/
+    minFileSize?: boolean;
+    /**
+     * A function which displays an error a selected file is smaller than allowed. (Default: displays an alert for every bad file.)
+     **/
+    minFileSizeErrorCallback?:(file: ResumableFile, errorCount: number) => void;
+    /**
+     * The maximum allowed file size. (Default: undefined)
+     **/
+    maxFileSize?: boolean;
+    /**
+     * A function which displays an error a selected file is larger than allowed. (Default: displays an alert for every bad file.)
+     **/
+    maxFileSizeErrorCallback?: (file: ResumableFile, errorCount: number) => void;
+    /**
+     * The file types allowed to upload. An empty array allow any file type. (Default: [])
+     **/
+    fileType?: string[];
+    /**
+     * A function which displays an error a selected file has type not allowed. (Default: displays an alert for every bad file.)
+     **/
+    fileTypeErrorCallback?: (file: ResumableFile, errorCount: number) => void;
+    /**
+     * The maximum number of retries for a chunk before the upload is failed. Valid values are any positive integer and undefined for no limit. (Default: undefined)
+     **/
+    maxChunkRetries?: number;
+    /**
+     * The number of milliseconds to wait before retrying a chunk on a non-permanent error. Valid values are any positive integer and undefined for immediate retry. (Default: undefined)
+     **/
+    chunkRetryInterval?: number;
+    /**
+     * Standard CORS requests do not send or set any cookies by default. In order to include cookies as part of the request, you need to set the withCredentials property to true. (Default: false)
+     **/
+    withCredentials?: boolean;
+  }
+  
+  class Resumable {
+    constructor(options:ConfigurationHash);
+    
+    /**
+     * A boolean value indicator whether or not Resumable.js is supported by the current browser.
+     **/
+    support: boolean;
+    /**
+     * A hash object of the configuration of the Resumable.js instance.
+     **/
+    opts: ConfigurationHash;
+    /**
+     * An array of ResumableFile file objects added by the user (see full docs for this object type below).
+     **/
+    files: ResumableFile[];
+	
+	defaults: ConfigurationHash;
+    
+    events: Event[];
+    version: number;
+    
+    /**
+     * Assign a browse action to one or more DOM nodes. Pass in true to allow directories to be selected (Chrome only).
+     **/
+    assignBrowse(domNode: Element, isDirectory: boolean): void;
+    assignBrowse(domNodes: Element[], isDirectory: boolean): void;
+    /**
+     * Assign one or more DOM nodes as a drop target.
+     **/
+    assignDrop(domNode: Element): void;
+    assignDrop(domNodes: Element[]): void;
+    unAssignDrop(domNode: Element): void;
+    unAssignDrop(domNodes: Element[]): void;
+    /**
+     * Start or resume uploading.
+     **/
+    upload(): void;
+    uploadNextChunk(): void;
+    /**
+     * Pause uploading.
+     **/
+    pause(): void;
+    /**
+     * Cancel upload of all ResumableFile objects and remove them from the list.
+     **/
+    cancel(): void;
+    fire(): void;
+    /**
+     * Returns a float between 0 and 1 indicating the current upload progress of all files.
+     **/
+    progress(): number;
+    /**
+     * Returns a boolean indicating whether or not the instance is currently uploading anything.
+     **/
+    isUploading(): boolean;
+    /**
+     * Add a HTML5 File object to the list of files.
+     **/
+    addFile(file: File, event: Event): void;
+    /**
+     * Cancel upload of a specific ResumableFile object on the list from the list.
+     **/
+    removeFile(file: ResumableFile): void;
+    /**
+     * Look up a ResumableFile object by its unique identifier.
+     **/
+    getFromUniqueIdentifier(uniqueIdentifier: string): void;
+    /**
+     * Returns the total size of the upload in bytes.
+     **/
+    getSize(): number;
+    getOpt(o: string): any;
+    
+    // Events
+	/**
+	 * Change event handler
+	 **/
+	handleChangeEvent(e: Event): void;
+	 
+	 /**
+	 * Drop event handler
+	 **/
+	handleDropEvent(e: Event): void;
+	
+    /**
+     * Listen for event from Resumable.js (see below)
+     **/
+    on(event: string, callback: Function): void;
+    /**
+     *  A specific file was completed.
+     **/
+    on(event: 'fileSuccess', callback: (file: ResumableFile) => void): void;
+    /**
+     *  Uploading progressed for a specific file.
+     **/
+    on(event: 'fileProgress', callback: (file: ResumableFile) => void): void;
+    /**
+     *  A new file was added. Optionally, you can use the browser event object from when the file was added.
+     **/
+    on(event: 'fileAdded', callback: (file: ResumableFile, event: DragEvent) => void): void;
+    /**
+     *  New files were added.
+     **/
+    on(event: 'filesAdded', callback: (files: ResumableFile[]) => void): void;
+    /**
+     *  Something went wrong during upload of a specific file, uploading is being retried.
+     **/
+    on(event: 'fileRetry', callback: (file: ResumableFile) => void): void;
+    /**
+     *  An error occurred during upload of a specific file.
+     **/
+    on(event: 'fileError', callback: (file: ResumableFile, message: string) => void): void;
+    /**
+     *  Upload has been started on the Resumable object.
+     **/
+    on(event: 'uploadStart', callback: () => void): void;
+    /**
+     *  Uploading completed.
+     **/
+    on(event: 'complete', callback: () => void): void;
+    /**
+     *  Uploading progress.
+     **/
+    on(event: 'progress', callback: () => void): void;
+    /**
+     *  An error, including fileError, occurred.
+     **/
+    on(event: 'error', callback: (message: string, file: ResumableFile) => void): void;
+    /**
+     *  Uploading was paused.
+     **/
+    on(event: 'pause', callback: () => void): void;
+    /**
+     *  Triggers before the items are cancelled allowing to do any processing on uploading files.
+     **/
+    on(event: 'beforeCancel', callback: () => void): void;
+    /**
+     *  Uploading was canceled.
+     **/
+    on(event: 'cancel', callback: () => void): void;
+    /**
+     *  Started preparing file for upload
+     **/
+    on(event: 'chunkingStart', callback: (file: ResumableFile) => void): void;
+    /**
+     *  Show progress in file preparation
+     **/
+    on(event: 'chunkingProgress', callback: (file: ResumableFile, ratio: number) => void): void;
+    /**
+     *  File is ready for upload
+     **/
+    on(event: 'chunkingComplete', callback: (file: ResumableFile) => void): void;
+    /**
+     * Listen to all the events listed above with the same callback function.
+     **/
+    on(event: 'catchAll', callback: () => void): void;
+  }
+
+  interface ResumableFile {
+    /**
+     * A back-reference to the parent Resumable object.
+     **/
+    resumableObj: Resumable;
+    /**
+     * The correlating HTML5 File object.
+     **/
+    file: File;
+    /**
+     * The name of the file.
+     **/
+    fileName: string;
+    /**
+     * The relative path to the file (defaults to file name if relative path doesn't exist)
+     **/
+    relativePath: string;
+    /**
+     * Size in bytes of the file.
+     **/
+    size: number;
+    /**
+     * A unique identifier assigned to this file object. This value is included in uploads to the server for reference, but can also be used in CSS classes etc when building your upload UI.
+     **/
+    uniqueIdentifier: string;
+    /**
+     * An array of ResumableChunk items. You shouldn't need to dig into these.
+     **/
+    chunks: ResumableChunk[];
+
+
+    /**
+     * Returns a float between 0 and 1 indicating the current upload progress of the file. If relative is true, the value is returned relative to all files in the Resumable.js instance.
+     **/
+    progress: (relative: boolean) => number;
+    /**
+     * Abort uploading the file.
+     **/
+    abort: () => void;
+    /**
+     * Abort uploading the file and delete it from the list of files to upload.
+     **/
+    cancel: () => void;
+    /**
+     * Retry uploading the file.
+     **/
+    retry: () => void;
+    /**
+     * Rebuild the state of a ResumableFile object, including reassigning chunks and XMLHttpRequest instances.
+     **/
+    bootstrap: () => void;
+    /**
+     * Returns a boolean indicating whether file chunks is uploading.
+     **/
+    isUploading: () => boolean;
+    /**
+     * Returns a boolean indicating whether the file has completed uploading and received a server response.
+     **/
+    isComplete: () => boolean;
+  }
+  
+  interface ResumableChunk {}
+}
+
+declare module 'resumablejs' {
+  export = Resumable;
+}

From 6e4e790e87c93726a8e42a54603ea108ebc24ef7 Mon Sep 17 00:00:00 2001
From: Daniel McAssey <daniel.mcassey@gmail.com>
Date: Tue, 21 Jun 2016 14:15:40 +0100
Subject: [PATCH 235/278] Add version number

---
 resumablejs/resumable.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/resumablejs/resumable.d.ts b/resumablejs/resumable.d.ts
index 265097b149..8678b8248e 100644
--- a/resumablejs/resumable.d.ts
+++ b/resumablejs/resumable.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for Resumable.js
+// Type definitions for Resumable.js v1.0.2
 // Project: https://github.com/23/resumable.js
 // Definitions by: Daniel McAssey <https://github.com/DanielMcAssey>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped

From a188319382a5d3cbb4a47b2496254a8103eb5e83 Mon Sep 17 00:00:00 2001
From: Jasper Siegmund <jasper@repsaj.nl>
Date: Tue, 21 Jun 2016 15:55:57 +0200
Subject: [PATCH 236/278] Added missing mobileServiceAuthenticationToken for
 User, Push interface with methods and changed the signature of invokeApi.

---
 .../AzureMobileServicesClient.d.ts            | 43 +++++++++++++++++--
 1 file changed, 40 insertions(+), 3 deletions(-)

diff --git a/azure-mobile-services-client/AzureMobileServicesClient.d.ts b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
index b9749002c9..63c9ee454b 100644
--- a/azure-mobile-services-client/AzureMobileServicesClient.d.ts
+++ b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
@@ -1,3 +1,5 @@
+// Generated by typings
+// Source: https://raw.githubusercontent.com/DefinitelyTyped/DefinitelyTyped/master/azure-mobile-services-client/AzureMobileServicesClient.d.ts
 // Type definitions for Microsoft Windows AzureMobile Service 1.0.0
 // Project: http://www.windowsazure.com/en-us/develop/mobile/
 // Definitions by: Morosinotto Daniele <https://github.com/dmorosinotto/>
@@ -7,10 +9,12 @@ declare namespace Microsoft.WindowsAzure {
 
     // MobileServiceClient object based on Microsoft Azure documentation: http://msdn.microsoft.com/en-us/library/windowsazure/jj554219.aspx
     interface MobileServiceClient {
+        new (applicationUrl: string): MobileServiceClient;
         new (applicationUrl: string, applicationKey: string): MobileServiceClient;
         applicationUrl: string;
         applicationKey: string;
         currentUser: User;
+        push: Push;
         //for provider:string use one of ProviderEnum: 'microsoftaccount', 'facebook', 'twitter', 'google'
         login(provider: string, token: string, callback: (error: any, user: User) => void ): void;
         login(provider: string, token: string): asyncPromise;
@@ -18,8 +22,40 @@ declare namespace Microsoft.WindowsAzure {
         login(provider: string): asyncPromise;
         logout(): void;
         getTable(tableName: string): MobileServiceTable;
-        withFilter(serviceFilter: (request: any, next: (request: any, callback: (error:any, response: any) => void ) => void, callback: (error: any, response: any) => void ) => void ) : MobileServiceClient;
-        invokeApi(apiName: string, options?:InvokeApiOptions): asyncPromise;
+        withFilter(serviceFilter: (request: any, next: (request: any, callback: (error: any, response: any) => void) => void, callback: (error: any, response: any) => void) => void): MobileServiceClient;
+        /**
+         * Invokes the specified custom api and returns a response object.
+         *
+         * @param apiName The custom api to invoke.
+         * @param options Contains additional parameter information, valid values are:
+         *     body: The body of the HTTP request.
+         *     method: The HTTP method to use in the request, with the default being POST,
+         *     parameters: Any additional query string parameters, 
+         *     headers: HTTP request headers, specified as an object.
+         * @param callback Optional callback accepting (error, results) parameters.
+         */
+        invokeApi(apiName: string, options: InvokeApiOptions, callback: (error: any, results: any) => void): asyncPromise;
+    }
+
+    interface Push
+    {
+        /**
+         * Register a push channel with the Mobile Apps backend to start receiving notifications.
+         *
+         * @param platform The device platform being used - wns, gcm or apns.
+         * @param pushChannel The push channel identifier or URI.
+         * @param templates An object containing template definitions. Template objects should contain body, headers and tags properties.
+         * @param secondaryTiles An object containing template definitions to be used with secondary tiles when using WNS.
+         * @param callback Optional callback accepting (error, results) parameters.
+         */
+        register(platform: string, pushChannel: string, templates: any, secondaryTiles: any, callback: (error: any, results: any) => void);
+        /**
+         * Invokes the specified custom api and returns a response object.
+         *
+         * @param pushChannel The push channel identifier or URI.
+         * @param callback Optional callback accepting (error, results) parameters.
+         */
+        unregister(pushChannel: string, callback: (error: any, results: any) => void);
     }
 
     interface InvokeApiOptions
@@ -36,6 +72,7 @@ declare namespace Microsoft.WindowsAzure {
         accessTokens: any;   // { [providerName: string]: string; }
         level: string; //for level:string use one of LevelEnum: 'admin','anonymous','authenticated'
         userId: string;
+        mobileServiceAuthenticationToken: string;
     }
 
 
@@ -104,4 +141,4 @@ declare module "azure-mobile-apps-client" {
     export = WindowsAzure;
 }
 
-declare var WindowsAzure: Microsoft.WindowsAzure.WindowsAzureStatic;
+declare var WindowsAzure: Microsoft.WindowsAzure.WindowsAzureStatic;
\ No newline at end of file

From 242eb155fc2681692952269fa71b89f5a4aab116 Mon Sep 17 00:00:00 2001
From: Jasper Siegmund <jasper@repsaj.nl>
Date: Tue, 21 Jun 2016 16:12:27 +0200
Subject: [PATCH 237/278] Added return types to avoid implicit any

---
 azure-mobile-services-client/AzureMobileServicesClient.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/azure-mobile-services-client/AzureMobileServicesClient.d.ts b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
index 63c9ee454b..d401b4d1bc 100644
--- a/azure-mobile-services-client/AzureMobileServicesClient.d.ts
+++ b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
@@ -48,14 +48,14 @@ declare namespace Microsoft.WindowsAzure {
          * @param secondaryTiles An object containing template definitions to be used with secondary tiles when using WNS.
          * @param callback Optional callback accepting (error, results) parameters.
          */
-        register(platform: string, pushChannel: string, templates: any, secondaryTiles: any, callback: (error: any, results: any) => void);
+        register(platform: string, pushChannel: string, templates: any, secondaryTiles: any, callback: (error: any, results: any) => void): void;
         /**
          * Invokes the specified custom api and returns a response object.
          *
          * @param pushChannel The push channel identifier or URI.
          * @param callback Optional callback accepting (error, results) parameters.
          */
-        unregister(pushChannel: string, callback: (error: any, results: any) => void);
+        unregister(pushChannel: string, callback: (error: any, results: any) => void): void;
     }
 
     interface InvokeApiOptions

From 60d75b4b42c6daa969215a53549a6be6dfba286e Mon Sep 17 00:00:00 2001
From: Peter Snider <snider.peter@gmail.com>
Date: Tue, 21 Jun 2016 10:10:09 -0700
Subject: [PATCH 238/278] changed as per @mhegazy, added other missing parts

---
 pino/pino.d.ts | 122 +++++++++++++++++++++++++++++++++++++------------
 1 file changed, 93 insertions(+), 29 deletions(-)

diff --git a/pino/pino.d.ts b/pino/pino.d.ts
index 3816ce0f17..73a8175afd 100644
--- a/pino/pino.d.ts
+++ b/pino/pino.d.ts
@@ -9,50 +9,114 @@ declare module 'pino' {
 
     import stream = require('stream')
 
-    interface Serializers {
-        req(req: Object): Object
-        res(res: Object): Object
+    type Level = 'fatal' | 'error' | 'warn' | 'info' | 'debug' | 'trace' | 'silent'
+    type Headers = {[header: string]: string}
+    type LevelLabelsToValues = {[level: string]: number}
+    type LevelValuesToLabels = {[level: number]: string}
+
+    interface RequestSummary {
+        pid: number
+        hostname: string
+        level: number
+        msg: string
+        time: string
+        v: number
+        req: {
+            method: string
+            url: string
+            headers: Headers
+            remoteAddress: string
+            remotePort: number
+        }
     }
 
+    interface ResponseSummary {
+        pid: number
+        hostname: string
+        level: number
+        msg: string
+        time: string
+        v: number
+        res: {
+            statusCode: number
+            header: string
+        }
+    }
+
+    interface ErrorSummary {
+        pid: number
+        hostname: string
+        level: number
+        msg: string
+        time: number
+        v: number
+        type: string
+        stack: string
+    }
+
+    interface Serializers {
+        req?: (req: any) => RequestSummary
+        res?: (res: any) => ResponseSummary
+        err?: (error: Error) => ErrorSummary
+    }
 
     interface LoggerOptions {
-        name?: string
-        enabled?: boolean
+        // avoid error causes by circular references in the object tree, default true
         safe?: boolean
+        // the name of the logger, default undefined
+        name?: string
+        // an object containing functions for custom serialization of objects.
+        // These functions should return an JSONifiable object and they should never throw
         serializers?: Serializers
+        // Outputs ISO time stamps ('2016-03-09T15:18:53.889Z') instead of Epoch time stamps (1457536759176).
+        // WARNING: This option carries a 25% performance drop, we recommend using default Epoch timestamps and transforming logs after if required.
+        // The pino -t command will do this for you (see CLI). default false.
+        slowtime?: boolean
+        // Enables extreme mode, yields an additional 60% performance (from 250ms down to 100ms per 10000 ops).
+        // There are trade-off's should be understood before usage. See Extreme mode explained. default false
+        extreme?: boolean
+        // enables logging, defaults to true.
+        enabled?: boolean
+        level?: Level
     }
 
-
     interface Pino {
-        (): Logger
-        (options: LoggerOptions): Logger
-        (stream: stream.Writable): Logger
+        (optionsOrStream?: LoggerOptions | stream.Writable): Logger
         (options: LoggerOptions, stream: stream.Writable): Logger
+        levels: {
+            values: LevelLabelsToValues
+            labels: LevelValuesToLabels
+        }
+        LOG_VERSION: number
+        pretty(opts?: {timeTransOnly?: boolean}): stream.Readable
+
     }
 
-
+    type LevelChangeEventListener = (lvl: string, val: number, prevLvl: string, prevVal: number) => void
+    type LevelChangeEvent = 'level-change'
 
     interface Logger {
-        child(bindings: Object): this
-        level: string   // 'fatal' | 'error' | 'warn' | 'info' | 'debug' | 'trace'
-        fatal(msg: string, ...args : any[]): void
-        fatal(obj: Object, msg: string, ...args : any[]): void
-        fatal(obj: Object): void
-        error(msg: string, ...args : any[]): void
-        error(obj: Object, msg: string, ...args : any[]): void
-        error(obj: Object): void
-        warn(msg: string, ...args : any[]): void
-        warn(obj: Object, msg: string, ...args : any[]): void
-        warn(obj: Object): void
+        child(bindings: {}): Logger
+        level: Level
+        levelVal: number
+        on(event: LevelChangeEvent, listener: LevelChangeEventListener): void
+        fatal(obj: {}): void
+        fatal(obj: {}, msg?: string, ...args : any[]): void
+        error(obj: {}): void
+        error(obj: {}, msg?: string, ...args : any[]): void
+        warn(obj: {}): void
+        warn(obj: {}, msg?: string, ...args : any[]): void
         info(msg: string, ...args : any[]): void
-        info(obj: Object, msg: string, ...args : any[]): void
-        info(obj: Object): void
-        debug(msg: string, ...args : any[]): void
-        debug(obj: Object, msg: string, ...args : any[]): void
-        debug(obj: Object): void
-        trace(msg: string, ...args : any[]): void
-        trace(obj: Object, msg: string, ...args : any[]): void
-        trace(obj: Object): void
+        info(obj: {}, msg?: string, ...args : any[]): void
+        debug(obj: {}): void
+        debug(obj: {}, msg?: string, ...args : any[]): void
+        trace(obj: {}): void
+        trace(obj: {}, msg?: string, ...args : any[]): void
+        levels: {
+            values: LevelLabelsToValues
+            labels: LevelValuesToLabels
+        }
+        LOG_VERSION: number
         stdSerializers: Serializers
     }
 

From 86f1b170b051e66508288d58e46917a53046cfa5 Mon Sep 17 00:00:00 2001
From: Peter Snider <snider.peter@gmail.com>
Date: Tue, 21 Jun 2016 10:18:55 -0700
Subject: [PATCH 239/278] added missing corrections

---
 pino/pino.d.ts | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/pino/pino.d.ts b/pino/pino.d.ts
index 73a8175afd..f1e064b379 100644
--- a/pino/pino.d.ts
+++ b/pino/pino.d.ts
@@ -100,17 +100,17 @@ declare module 'pino' {
         level: Level
         levelVal: number
         on(event: LevelChangeEvent, listener: LevelChangeEventListener): void
-        fatal(obj: {}): void
+        fatal(msg: string, ...args : any[]): void
         fatal(obj: {}, msg?: string, ...args : any[]): void
-        error(obj: {}): void
+        error(msg: string, ...args : any[]): void
         error(obj: {}, msg?: string, ...args : any[]): void
-        warn(obj: {}): void
+        warn(msg: string, ...args : any[]): void
         warn(obj: {}, msg?: string, ...args : any[]): void
         info(msg: string, ...args : any[]): void
         info(obj: {}, msg?: string, ...args : any[]): void
-        debug(obj: {}): void
+        debug(msg: string, ...args : any[]): void
         debug(obj: {}, msg?: string, ...args : any[]): void
-        trace(obj: {}): void
+        trace(msg: string, ...args : any[]): void
         trace(obj: {}, msg?: string, ...args : any[]): void
         levels: {
             values: LevelLabelsToValues

From d1b270f02adaec2f4d66484dd302cfbca5f1cb68 Mon Sep 17 00:00:00 2001
From: Travis Hill <HillTravis@users.noreply.github.com>
Date: Tue, 21 Jun 2016 14:48:16 -0400
Subject: [PATCH 240/278] Added missing WHERE methods

Added missing WHERE methods and one missing HAVING method (`andHaving`). Reordered some WHERE methods to be more consistent.
---
 knex/knex.d.ts | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/knex/knex.d.ts b/knex/knex.d.ts
index e5d796350c..70d8cce8cb 100644
--- a/knex/knex.d.ts
+++ b/knex/knex.d.ts
@@ -67,10 +67,14 @@ declare module "knex" {
       where: Where;
       andWhere: Where;
       orWhere: Where;
+      whereNot: Where;
+      andWhereNot: Where;
+      orWhereNot: Where;
       whereRaw: WhereRaw;
+      orWhereRaw: WhereRaw;
+      andWhereRaw: WhereRaw;
       whereWrapped: WhereWrapped;
       havingWrapped: WhereWrapped;
-      orWhereRaw: WhereRaw;
       whereExists: WhereExists;
       orWhereExists: WhereExists;
       whereNotExists: WhereExists;
@@ -84,9 +88,11 @@ declare module "knex" {
       whereNotNull: WhereNull;
       orWhereNotNull: WhereNull;
       whereBetween: WhereBetween;
-      whereNotBetween: WhereBetween;
       orWhereBetween: WhereBetween;
+      andWhereBetween: WhereBetween;
+      whereNotBetween: WhereBetween;
       orWhereNotBetween: WhereBetween;
+      andWhereNotBetween: WhereBetween;
 
       // Group by
       groupBy: GroupBy;
@@ -102,6 +108,7 @@ declare module "knex" {
 
       // Having
       having: Having;
+      andHaving: Having;
       havingRaw: RawQueryBuilder;
       orHaving: Having;
       orHavingRaw: RawQueryBuilder;

From 56ad17659ca740f5ac2becfd6dae1aaf868a49ef Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Tue, 21 Jun 2016 21:42:55 +0000
Subject: [PATCH 241/278] Added babelify definition

---
 babelify/babelify-tests.ts | 23 +++++++++++++++++
 babelify/babelify.d.ts     | 53 ++++++++++++++++++++++++++++++++++++++
 2 files changed, 76 insertions(+)
 create mode 100644 babelify/babelify-tests.ts
 create mode 100644 babelify/babelify.d.ts

diff --git a/babelify/babelify-tests.ts b/babelify/babelify-tests.ts
new file mode 100644
index 0000000000..6ace8462a9
--- /dev/null
+++ b/babelify/babelify-tests.ts
@@ -0,0 +1,23 @@
+/// <reference path="babelify.d.ts" />
+
+import babelify = require("babelify");
+
+module BabelifyTest {
+
+    export function whatDidTheEs6Say(srcPath: string, opts?: babelify.BabelifyOptions) {
+        opts.extensions = opts.extensions || undefined;
+        opts.sourceMapsAbsolute = opts.sourceMapsAbsolute || false;
+        var dst: NodeJS.ReadWriteStream;
+
+        babelify(""); // 'opts' are optional
+
+        babelify(srcPath, opts).on("error", function (err: any) {
+            console.error("babelify error: ", err);
+        });
+
+        babelify.configure(opts)(srcPath).pipe(dst);
+    }
+
+}
+
+export = BabelifyTest;
\ No newline at end of file
diff --git a/babelify/babelify.d.ts b/babelify/babelify.d.ts
new file mode 100644
index 0000000000..daf380f065
--- /dev/null
+++ b/babelify/babelify.d.ts
@@ -0,0 +1,53 @@
+// Type definitions for babelify v7.3.0
+// Project: https://github.com/babel/babelify
+// Definitions by: TeamworkGuy2 <https://github.com/TeamworkGuy2>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+/// <reference path="../babel-core/babel-core.d.ts" />
+
+/** Browserify transform for Babel
+ */
+declare module 'babelify' {
+    import stream = require("stream");
+    import babel = require("babel-core");
+
+
+    /** In addition to the various purposes documented here, all of the babelify options are passed to babel which passes them on to babel.transform() when each file is transformed */
+    interface babelifyOptions extends babel.TransformOptions {
+        /** These are passed to babel.util.canCompile() for each filename
+         * default: null (see babel.
+         */
+        extensions?: string | string[];
+
+        /** if true, a 'sourceFileName' property with a value equal to the current file being transformed is included with the options passed to babel.transform()
+         * default: false
+         */
+        sourceMapsAbsolute?: boolean;
+    }
+
+
+    class babelifyObject extends stream.Transform {
+
+        _transform(buf: string | Buffer, encoding: string, callback: () => void): void;
+
+        _flush(callback: () => void): void;
+    }
+
+
+    function Babelify(filename: string, opts?: babelifyOptions): babelifyObject;
+
+    module Babelify {
+        export interface BabelifyConstructor {
+            (filename: string, opts: babelifyOptions): babelifyObject;
+        }
+
+        export interface BabelifyOptions extends babelifyOptions { }
+
+        export class BabelifyObject extends babelifyObject { }
+
+        export function configure(opts: babelifyOptions): (filename: string) => babelifyObject;
+    }
+
+    export = Babelify;
+}

From bd5ce2d36e55911ad469fbedbc483e1005384aef Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Tue, 21 Jun 2016 21:58:37 +0000
Subject: [PATCH 242/278] simplify interfaces

---
 babelify/babelify.d.ts | 47 ++++++++++++++++++------------------------
 1 file changed, 20 insertions(+), 27 deletions(-)

diff --git a/babelify/babelify.d.ts b/babelify/babelify.d.ts
index daf380f065..2637814a64 100644
--- a/babelify/babelify.d.ts
+++ b/babelify/babelify.d.ts
@@ -13,40 +13,33 @@ declare module 'babelify' {
     import babel = require("babel-core");
 
 
-    /** In addition to the various purposes documented here, all of the babelify options are passed to babel which passes them on to babel.transform() when each file is transformed */
-    interface babelifyOptions extends babel.TransformOptions {
-        /** These are passed to babel.util.canCompile() for each filename
-         * default: null (see babel.
-         */
-        extensions?: string | string[];
-
-        /** if true, a 'sourceFileName' property with a value equal to the current file being transformed is included with the options passed to babel.transform()
-         * default: false
-         */
-        sourceMapsAbsolute?: boolean;
-    }
-
-
-    class babelifyObject extends stream.Transform {
-
-        _transform(buf: string | Buffer, encoding: string, callback: () => void): void;
-
-        _flush(callback: () => void): void;
-    }
-
-
-    function Babelify(filename: string, opts?: babelifyOptions): babelifyObject;
+    function Babelify(filename: string, opts?: Babelify.BabelifyOptions): Babelify.BabelifyObject;
 
     module Babelify {
+
         export interface BabelifyConstructor {
-            (filename: string, opts: babelifyOptions): babelifyObject;
+            (filename: string, opts: Babelify.BabelifyOptions): Babelify.BabelifyObject;
         }
 
-        export interface BabelifyOptions extends babelifyOptions { }
+        /** In addition to the various purposes documented here, all of the babelify options are passed to babel which passes them on to babel.transform() when each file is transformed */
+        export interface BabelifyOptions extends babel.TransformOptions {
+            /** These are passed to babel.util.canCompile() for each filename
+             * default: null
+             */
+            extensions?: string | string[];
 
-        export class BabelifyObject extends babelifyObject { }
+            /** if true, a 'sourceFileName' property with a value equal to the current file being transformed is included with the options passed to babel.transform()
+             * default: false
+             */
+            sourceMapsAbsolute?: boolean;
+        }
 
-        export function configure(opts: babelifyOptions): (filename: string) => babelifyObject;
+        export class BabelifyObject extends stream.Transform {
+            _transform(buf: string | Buffer, encoding: string, callback: () => void): void;
+            _flush(callback: () => void): void;
+        }
+
+        export function configure(opts: Babelify.BabelifyOptions): (filename: string) => Babelify.BabelifyObject;
     }
 
     export = Babelify;

From 74500d735d27ea514acca2eb3cca558c1d97fcef Mon Sep 17 00:00:00 2001
From: TeamworkGuy2 <straitfrommars@rocketmail.com>
Date: Tue, 21 Jun 2016 22:28:32 +0000
Subject: [PATCH 243/278] Added watchify definition

---
 watchify/watchify-tests.ts | 33 ++++++++++++++++++++++++
 watchify/watchify.d.ts     | 51 ++++++++++++++++++++++++++++++++++++++
 2 files changed, 84 insertions(+)
 create mode 100644 watchify/watchify-tests.ts
 create mode 100644 watchify/watchify.d.ts

diff --git a/watchify/watchify-tests.ts b/watchify/watchify-tests.ts
new file mode 100644
index 0000000000..278697ca2e
--- /dev/null
+++ b/watchify/watchify-tests.ts
@@ -0,0 +1,33 @@
+/// <reference path="watchify.d.ts" />
+
+import browserify = require("browserify");
+import watchify = require("watchify");
+
+module WatchifyTest {
+
+    export function setupWatchify(srcPath: string, opts?: watchify.Options) {
+        // new syntax
+        var bfyWatched = browserify(srcPath, {
+            cache: watchify.args.cache,
+            packageCache: watchify.args.packageCache,
+            plugin: [watchify],
+        });
+
+        var stream: NodeJS.ReadWriteStream;
+        bfyWatched.pipeline.get("deps").push(stream);
+
+        // old syntax
+        var bfy = browserify(srcPath);
+
+        var bfyWatched = watchify(bfy, {
+            delay: opts.delay || 100,
+            ignoreWatch: opts.ignoreWatch || false,
+            poll: opts.poll || 0,
+        });
+
+        bfy.pipeline.get('wrap').on("error", function () { });
+    }
+
+}
+
+export = WatchifyTest;
\ No newline at end of file
diff --git a/watchify/watchify.d.ts b/watchify/watchify.d.ts
new file mode 100644
index 0000000000..cad9cbf3af
--- /dev/null
+++ b/watchify/watchify.d.ts
@@ -0,0 +1,51 @@
+// Type definitions for watchify v3.7.0
+// Project: https://github.com/substack/watchify
+// Definitions by: TeamworkGuy2 <https://github.com/TeamworkGuy2>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../browserify/browserify.d.ts" />
+
+declare module 'watchify' {
+
+    var Watchify: Watchify.Constructor;
+
+    /** Watch mode for browserify builds.
+     * Update any source file and your browserify bundle will be recompiled on the spot
+     */
+    module Watchify {
+
+        /** Watch mode for browserify builds.
+         * Update any source file and your browserify bundle will be recompiled on the spot
+         */
+        export interface Constructor {
+            args: { cache: any; packageCache: any; };
+
+            <T extends Browserify.BrowserifyObject>(b: T, opts?: Watchify.Options): T;
+            (b: Browserify.BrowserifyObject, opts?: Watchify.Options): Browserify.BrowserifyObject;
+        }
+
+
+        export interface Options {
+            /** The amount of time in milliseconds to wait before emitting an "update" event after a change.
+             * Default: 100
+             */
+            delay?: number;
+
+            /** Ignores monitoring files for changes. If set to true, then ** /node_modules/ ** will be ignored. For other possible values see Chokidar's documentation on "ignored"
+             * Also see anymatch package: https://github.com/es128/anymatch#usage
+             */
+            ignoreWatch?: boolean | (string | RegExp | ((...values: any[]) => boolean) | (string | RegExp | ((...values: any[]) => boolean))[]);
+
+            /** Enables polling to monitor for changes. If set to true, then a polling interval of 100 ms is used.
+             * If set to a number, then that amount of milliseconds will be the polling interval. For more info see
+             * Chokidar's documentation on "usePolling" and "interval".
+             * This option is useful if you're watching an NFS volume
+             * Also see chokidar package: https://github.com/paulmillr/chokidar#path-filtering
+             */
+            poll?: number;
+        }
+
+    }
+
+    export = Watchify;
+}

From 318273cdee221b2a7ad28d813737010ac26f5b83 Mon Sep 17 00:00:00 2001
From: Chris Clayman <claymanchris@gmail.com>
Date: Tue, 21 Jun 2016 17:11:34 -0700
Subject: [PATCH 244/278] Add .isAtMost() .isAtLeast() to chai.assert defin.

Missing two definitions in chai library. Added here.
---
 chai/chai-3.2.0-tests.ts | 18 ++++++++++++++++++
 chai/chai-3.2.0.d.ts     |  3 +++
 2 files changed, 21 insertions(+)

diff --git a/chai/chai-3.2.0-tests.ts b/chai/chai-3.2.0-tests.ts
index 9b646b1529..cb1b74b8f1 100644
--- a/chai/chai-3.2.0-tests.ts
+++ b/chai/chai-3.2.0-tests.ts
@@ -1930,6 +1930,24 @@ suite('assert', () => {
         }, 'expected 5 to be below 5');
     });
 
+    test('isAtLeast', () => {
+        assert.isAtLeast(5, 3);
+        assert.isAtLeast(5, 5);
+
+        err(() => {
+            assert.isAtLeast(3, 5);
+        }, 'expected 3 to be greater than or equal to 5');
+    });
+
+    test('isAtMost', () => {
+        assert.isAtMost(3, 5);
+        assert.isAtMost(5, 5);
+
+        err(() => {
+            assert.isAtMost(5, 3);
+        }, 'expected 5 to be less than or equal to 3');
+    });
+
     test('extensible', () => { assert.extensible({}); });
     test('isExtensible', () => { assert.isExtensible({}); });
     test('notExtensible', () => { assert.notExtensible(Object.preventExtensions({})); });
diff --git a/chai/chai-3.2.0.d.ts b/chai/chai-3.2.0.d.ts
index 87b0c08e6f..6dc653b72f 100644
--- a/chai/chai-3.2.0.d.ts
+++ b/chai/chai-3.2.0.d.ts
@@ -271,6 +271,9 @@ declare namespace Chai {
         isAbove(val: number, abv: number, msg?: string): void;
         isBelow(val: number, blw: number, msg?: string): void;
 
+        isAtMost(val: number, atmst: number, msg?: string): void;
+        isAtLeast(val: number, atlst: number, msg?: string): void;
+
         isFunction(val: any, msg?: string): void;
         isNotFunction(val: any, msg?: string): void;
 

From 620e3419539bd4e3f7572124a913c2e233bad925 Mon Sep 17 00:00:00 2001
From: frogcjn <frogcjn@163.com>
Date: Wed, 22 Jun 2016 10:03:40 +0800
Subject: [PATCH 245/278] fix error on searchpath options

---
 sequelize/sequelize.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index 02615e2f1e..7fb9b764ed 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -2651,7 +2651,7 @@ declare module "sequelize" {
         /**
          * Options used for Instance.save method
          */
-        interface InstanceSaveOptions extends FieldsOptions, LoggingOptions, ReturningOptions {
+        interface InstanceSaveOptions extends FieldsOptions, LoggingOptions, ReturningOptions, SearchPathOptions {
 
             /**
              * If true, the updatedAt timestamp will not be updated.
@@ -4482,7 +4482,7 @@ declare module "sequelize" {
             /**
              * If false do not prepend the query with the search_path (Postgres only)
              */
-	        supportsSearchPath : boolean;
+	        supportsSearchPath? : boolean;
 
             /**
              * Map returned fields to model's fields if `options.model` or `options.instance` is present.

From 83a9ac9c04d306eb89279e24fc1ac13b7e9cdb5a Mon Sep 17 00:00:00 2001
From: frogcjn <frogcjn@163.com>
Date: Wed, 22 Jun 2016 10:06:59 +0800
Subject: [PATCH 246/278] fix eroor on QueryOptions

---
 sequelize/sequelize.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index 7fb9b764ed..af97bfaeda 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -4488,7 +4488,7 @@ declare module "sequelize" {
              * Map returned fields to model's fields if `options.model` or `options.instance` is present.
              * Mapping will occur before building the model instance.
              */
-            mapToModel : boolean;
+            mapToModel? : boolean;
 
             // TODO: force, cascade
             fieldMap? : { [key: string]: string; }

From cb707bcfa3e99425a4a40f1a21c5e274b455e219 Mon Sep 17 00:00:00 2001
From: Horiuchi_H <horiuchi.g@gmail.com>
Date: Wed, 22 Jun 2016 12:41:01 +0900
Subject: [PATCH 247/278] change eol codes (#9764)

---
 gijgo/gijgo-tests.ts |  44 +++---
 gijgo/gijgo.d.ts     | 334 +++++++++++++++++++++----------------------
 2 files changed, 189 insertions(+), 189 deletions(-)

diff --git a/gijgo/gijgo-tests.ts b/gijgo/gijgo-tests.ts
index 85b7f00b38..4b981c172e 100644
--- a/gijgo/gijgo-tests.ts
+++ b/gijgo/gijgo-tests.ts
@@ -1,23 +1,23 @@
-/// <reference path="../jquery/jquery.d.ts" />
-/// <reference path="gijgo.d.ts" />
-
-// Grid
-$(() => {
-        this.grid = $('#grid').grid({
-            primaryKey: 'ID',
-            columns: [
-                { field: 'ID', width: 50, sortable: true },
-                { field: 'Name', sortable: true },
-            ],
-            pager: { limit: 5, sizes: [2, 5, 10, 20] }
-        });
-});
-
-// Dialog
-$(() => {
-        this.dialog = $('#playerModal').dialog({
-            autoOpen: false,
-            title: 'Player',
-            width: 400
-        });
+/// <reference path="../jquery/jquery.d.ts" />
+/// <reference path="gijgo.d.ts" />
+
+// Grid
+$(() => {
+        this.grid = $('#grid').grid({
+            primaryKey: 'ID',
+            columns: [
+                { field: 'ID', width: 50, sortable: true },
+                { field: 'Name', sortable: true },
+            ],
+            pager: { limit: 5, sizes: [2, 5, 10, 20] }
+        });
+});
+
+// Dialog
+$(() => {
+        this.dialog = $('#playerModal').dialog({
+            autoOpen: false,
+            title: 'Player',
+            width: 400
+        });
 });
\ No newline at end of file
diff --git a/gijgo/gijgo.d.ts b/gijgo/gijgo.d.ts
index f78d88be85..2f9604bbef 100644
--- a/gijgo/gijgo.d.ts
+++ b/gijgo/gijgo.d.ts
@@ -1,167 +1,167 @@
-// Type definitions for Gijgo v0.6.2
-// Project: http://gijgo.com
-// Definitions by: Atanas Atanasov <https://github.com/atatanasov>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
-
-declare module Gijgo {
-
-    //Grid
-    interface GridPager {
-        limit?: number;
-        sizes?: Array<number>;
-        leftControls?: any;
-        rightControls?: any;
-    }
-
-    interface GridColumn {
-        align?: string;
-        cssClass?: string;
-        decimalDigits?: number;
-        editor?: any;
-        events?: any;
-        field?: string;
-        format?: string;
-        headerCssClass?: string;
-        hidden?: boolean;
-        icon?: string;
-        minWidth?: number;
-        priority?: number;
-        sortable?: boolean;
-        stopPropagation?: boolean;
-        title?: string;
-        tmpl?: string;
-        tooltip?: string;
-        type?: string;
-        width?: number;
-    }
-
-    interface GridDefaultParams {
-        direction?: string;
-        limit?: string;
-        page?: string;
-        sortBy?: string;
-    }
-
-    interface GridMapping {
-        dataField?: string;
-        totalRecordsField?: string;
-    }
-
-    interface GridSettings<Entity> {
-        //Configuration options
-        autoGenerateColumns?: boolean;
-        autoLoad?: boolean;
-        columns?: Array<GridColumn>;
-        dataSource?: any;
-        defaultColumnSettings?: GridColumn;
-        defaultParams?: GridDefaultParams;
-        detailTemplate?: string;
-        fontSize?: string;
-        mapping?: string;
-        minWidth?: number;
-        notFoundText?: string;
-        pager?: GridPager;
-        primaryKey?: string;
-        resizableColumns?: boolean;
-        resizeCheckInterval?: number;
-        responsive?: boolean;
-        selectionMethod?: string;
-        selectionType?: string;
-        showHiddenColumnsAsDetails?: boolean;
-        title?: string;
-        toolbarTemplate?: string;
-        uiLibrary?: string;
-        width?: number;
-        params?: any;
-
-        //Events
-        beforeEmptyRowInsert?: (e: any, $row: JQuery) => any;
-        cellDataBound?: (e: any, $wrapper: JQuery, id: string, column: GridColumn, record: Entity) => any;
-        cellDataChanged?: (e: any, $cell: JQuery, column: GridColumn, record: Entity, oldValue: any, newValue: any) => any;
-        columnHide?: (e: any, column: GridColumn) => any;
-        columnShow?: (e: any, column: GridColumn) => any;
-        dataBinding?: (e: any, records: Array<Entity>) => any;
-        dataBound?: (e: any, records: Array<Entity>, totalRecords: number) => any;
-        destroying?: (e: any) => any;
-        detailCollapse?: (e: any, detailWrapper: JQuery, record: Entity) => any;
-        detailExpand?: (e: any, detailWrapper: JQuery, record: Entity) => any;
-        initialized?: (e: any) => any;
-        pageChanging?: (e: any, newPage: number) => any;
-        pageSizeChange?: (e: any, newPage: number) => any;
-        resize?: (e: any, newWidth: number, oldWidth: number) => any;
-        rowDataBound?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-        rowRemoving?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-        rowSelect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-        rowUnselect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
-    }
-
-    interface Grid<Entity, Params> extends JQuery {
-        addRow(record: Entity): Grid<Entity, Params>;
-        clear(showNotFoundText?: boolean): Grid<Entity, Params>;
-        count(): number;
-        destroy(keepTableTag?: boolean, keepWrapperTag?: boolean): void;
-        //get(position: number): Entity; //TODO: rename to getByPosition to avoid conflicts with jquery.get
-        getAll(): Array<Entity>;
-        getById(id: string): Entity;
-        getChanges(): Array<Entity>;
-        getSelected(): string;
-        getSelections(): Array<string>;
-        hideColumn(field: string): Grid<Entity, Params>;
-        makeResponsive(): void;
-        reload(params?: Params): Grid<Entity, Params>;
-        removeRow(id: string): Grid<Entity, Params>;
-        render(response: any): Grid<Entity, Params>;
-        selectAll(): Grid<Entity, Params>;
-        setSelected(id: string | number): Grid<Entity, Params>;
-        showColumn(field: string): Grid<Entity, Params>;
-        title(text: any): any;
-        unSelectAll(): Grid<Entity, Params>;
-        updateRow(id: string, record: Entity): Grid<Entity, Params>;
-    }
-
-    //Dialog
-    interface DialogSettings {
-        //Configuration options
-        autoOpen?: boolean;
-        closeOnEscape?: boolean;
-        draggable?: boolean;
-        height?: number | string;
-        maxHeight?: number;
-        maxWidth?: number;
-        minHeight?: number;
-        minWidth?: number;
-        modal?: boolean;
-        resizable?: boolean;
-        title?: string;
-        uiLibrary?: string;
-        width?: number;
-
-        //Events
-        closed?: (e: any) => any;
-        closing?: (e: any) => any;
-        drag?: (e: any) => any;
-        dragStart?: (e: any) => any;
-        dragStop?: (e: any) => any;
-        initialized?: (e: any) => any;
-        opened?: (e: any) => any;
-        opening?: (e: any) => any;
-        resize?: (e: any) => any;
-        resizeStart?: (e: any) => any;
-        resizeStop?: (e: any) => any;
-    }
-
-    interface Dialog extends JQuery {
-        close(): Dialog;
-        isOpen(): boolean;
-        open(): Dialog;
-    }
-}
-
-
-interface JQuery {
-    grid(settings: Gijgo.GridSettings<any>): Gijgo.Grid<any, any>;
-    grid<Entity>(settings: Gijgo.GridSettings<Entity>): Gijgo.Grid<Entity, any>;
-    grid<Entity, Params>(settings: Gijgo.GridSettings<Entity>): Gijgo.Grid<Entity, Params>;
-
-    dialog(settings: Gijgo.DialogSettings): Gijgo.Dialog;
-}
+// Type definitions for Gijgo v0.6.2
+// Project: http://gijgo.com
+// Definitions by: Atanas Atanasov <https://github.com/atatanasov>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module Gijgo {
+
+    //Grid
+    interface GridPager {
+        limit?: number;
+        sizes?: Array<number>;
+        leftControls?: any;
+        rightControls?: any;
+    }
+
+    interface GridColumn {
+        align?: string;
+        cssClass?: string;
+        decimalDigits?: number;
+        editor?: any;
+        events?: any;
+        field?: string;
+        format?: string;
+        headerCssClass?: string;
+        hidden?: boolean;
+        icon?: string;
+        minWidth?: number;
+        priority?: number;
+        sortable?: boolean;
+        stopPropagation?: boolean;
+        title?: string;
+        tmpl?: string;
+        tooltip?: string;
+        type?: string;
+        width?: number;
+    }
+
+    interface GridDefaultParams {
+        direction?: string;
+        limit?: string;
+        page?: string;
+        sortBy?: string;
+    }
+
+    interface GridMapping {
+        dataField?: string;
+        totalRecordsField?: string;
+    }
+
+    interface GridSettings<Entity> {
+        //Configuration options
+        autoGenerateColumns?: boolean;
+        autoLoad?: boolean;
+        columns?: Array<GridColumn>;
+        dataSource?: any;
+        defaultColumnSettings?: GridColumn;
+        defaultParams?: GridDefaultParams;
+        detailTemplate?: string;
+        fontSize?: string;
+        mapping?: string;
+        minWidth?: number;
+        notFoundText?: string;
+        pager?: GridPager;
+        primaryKey?: string;
+        resizableColumns?: boolean;
+        resizeCheckInterval?: number;
+        responsive?: boolean;
+        selectionMethod?: string;
+        selectionType?: string;
+        showHiddenColumnsAsDetails?: boolean;
+        title?: string;
+        toolbarTemplate?: string;
+        uiLibrary?: string;
+        width?: number;
+        params?: any;
+
+        //Events
+        beforeEmptyRowInsert?: (e: any, $row: JQuery) => any;
+        cellDataBound?: (e: any, $wrapper: JQuery, id: string, column: GridColumn, record: Entity) => any;
+        cellDataChanged?: (e: any, $cell: JQuery, column: GridColumn, record: Entity, oldValue: any, newValue: any) => any;
+        columnHide?: (e: any, column: GridColumn) => any;
+        columnShow?: (e: any, column: GridColumn) => any;
+        dataBinding?: (e: any, records: Array<Entity>) => any;
+        dataBound?: (e: any, records: Array<Entity>, totalRecords: number) => any;
+        destroying?: (e: any) => any;
+        detailCollapse?: (e: any, detailWrapper: JQuery, record: Entity) => any;
+        detailExpand?: (e: any, detailWrapper: JQuery, record: Entity) => any;
+        initialized?: (e: any) => any;
+        pageChanging?: (e: any, newPage: number) => any;
+        pageSizeChange?: (e: any, newPage: number) => any;
+        resize?: (e: any, newWidth: number, oldWidth: number) => any;
+        rowDataBound?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+        rowRemoving?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+        rowSelect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+        rowUnselect?: (e: any, $row: JQuery, id: string, record: Entity) => any;
+    }
+
+    interface Grid<Entity, Params> extends JQuery {
+        addRow(record: Entity): Grid<Entity, Params>;
+        clear(showNotFoundText?: boolean): Grid<Entity, Params>;
+        count(): number;
+        destroy(keepTableTag?: boolean, keepWrapperTag?: boolean): void;
+        //get(position: number): Entity; //TODO: rename to getByPosition to avoid conflicts with jquery.get
+        getAll(): Array<Entity>;
+        getById(id: string): Entity;
+        getChanges(): Array<Entity>;
+        getSelected(): string;
+        getSelections(): Array<string>;
+        hideColumn(field: string): Grid<Entity, Params>;
+        makeResponsive(): void;
+        reload(params?: Params): Grid<Entity, Params>;
+        removeRow(id: string): Grid<Entity, Params>;
+        render(response: any): Grid<Entity, Params>;
+        selectAll(): Grid<Entity, Params>;
+        setSelected(id: string | number): Grid<Entity, Params>;
+        showColumn(field: string): Grid<Entity, Params>;
+        title(text: any): any;
+        unSelectAll(): Grid<Entity, Params>;
+        updateRow(id: string, record: Entity): Grid<Entity, Params>;
+    }
+
+    //Dialog
+    interface DialogSettings {
+        //Configuration options
+        autoOpen?: boolean;
+        closeOnEscape?: boolean;
+        draggable?: boolean;
+        height?: number | string;
+        maxHeight?: number;
+        maxWidth?: number;
+        minHeight?: number;
+        minWidth?: number;
+        modal?: boolean;
+        resizable?: boolean;
+        title?: string;
+        uiLibrary?: string;
+        width?: number;
+
+        //Events
+        closed?: (e: any) => any;
+        closing?: (e: any) => any;
+        drag?: (e: any) => any;
+        dragStart?: (e: any) => any;
+        dragStop?: (e: any) => any;
+        initialized?: (e: any) => any;
+        opened?: (e: any) => any;
+        opening?: (e: any) => any;
+        resize?: (e: any) => any;
+        resizeStart?: (e: any) => any;
+        resizeStop?: (e: any) => any;
+    }
+
+    interface Dialog extends JQuery {
+        close(): Dialog;
+        isOpen(): boolean;
+        open(): Dialog;
+    }
+}
+
+
+interface JQuery {
+    grid(settings: Gijgo.GridSettings<any>): Gijgo.Grid<any, any>;
+    grid<Entity>(settings: Gijgo.GridSettings<Entity>): Gijgo.Grid<Entity, any>;
+    grid<Entity, Params>(settings: Gijgo.GridSettings<Entity>): Gijgo.Grid<Entity, Params>;
+
+    dialog(settings: Gijgo.DialogSettings): Gijgo.Dialog;
+}

From 7aaede33ba523d3c29d6702682b1fbe066a38111 Mon Sep 17 00:00:00 2001
From: mayTree <nallwhy@gmail.com>
Date: Wed, 22 Jun 2016 14:08:40 +0900
Subject: [PATCH 248/278] Fix indentation

---
 underscore/underscore.d.ts | 90 +++++++++++++++++++-------------------
 1 file changed, 45 insertions(+), 45 deletions(-)

diff --git a/underscore/underscore.d.ts b/underscore/underscore.d.ts
index 4b4f9da700..761d9bca06 100644
--- a/underscore/underscore.d.ts
+++ b/underscore/underscore.d.ts
@@ -289,7 +289,7 @@ interface UnderscoreStatic {
 	detect<T>(
 		object: _.Dictionary<T>,
 		iterator: _.ObjectIterator<T, boolean>,
-        context?: any): T;
+		context?: any): T;
 
 	/**
 	* @see _.find
@@ -918,15 +918,15 @@ interface UnderscoreStatic {
 	**/
 	zip(...arrays: any[]): any[];
 
-    /**
-    * The opposite of zip. Given a number of arrays, returns a series of new arrays, the first
-    * of which contains all of the first elements in the input arrays, the second of which
-    * contains all of the second elements, and so on. Use with apply to pass in an array
-    * of arrays
-    * @param arrays The arrays to unzip.
-    * @return Unzipped version of `arrays`.
-    **/
-    unzip(...arrays: any[][]): any[][];
+	/**
+	* The opposite of zip. Given a number of arrays, returns a series of new arrays, the first
+	* of which contains all of the first elements in the input arrays, the second of which
+	* contains all of the second elements, and so on. Use with apply to pass in an array
+	* of arrays
+	* @param arrays The arrays to unzip.
+	* @return Unzipped version of `arrays`.
+	**/
+	unzip(...arrays: any[][]): any[][];
 
 	/**
 	* Converts arrays into objects. Pass either a single list of [key, value] pairs, or a
@@ -3520,7 +3520,7 @@ interface UnderscoreStatic {
 	**/
 	keys(object: any): string[];
 
-    /**
+	/**
 	* Retrieve all the names of object's own and inherited properties.
 	* @param object Retrieve the key or property names from this object.
 	* @return List of all the property names on `object`.
@@ -3541,30 +3541,30 @@ interface UnderscoreStatic {
 	**/
 	values(object: any): any[];
 
-    /**
-     * Like map, but for objects. Transform the value of each property in turn.
-     * @param object The object to transform
-     * @param iteratee The function that transforms property values
-     * @param context The optional context (value of `this`) to bind to
-     * @return a new _.Dictionary of property values
-     */
-    mapObject<T, U>(object: _.Dictionary<T>, iteratee: (val: T, key: string, object: _.Dictionary<T>) => U, context?: any): _.Dictionary<U>;
+	/**
+	 * Like map, but for objects. Transform the value of each property in turn.
+	 * @param object The object to transform
+	 * @param iteratee The function that transforms property values
+	 * @param context The optional context (value of `this`) to bind to
+	 * @return a new _.Dictionary of property values
+	 */
+	mapObject<T, U>(object: _.Dictionary<T>, iteratee: (val: T, key: string, object: _.Dictionary<T>) => U, context?: any): _.Dictionary<U>;
 
-    /**
-     * Like map, but for objects. Transform the value of each property in turn.
-     * @param object The object to transform
-     * @param iteratee The function that tranforms property values
-     * @param context The optional context (value of `this`) to bind to
-     */
-    mapObject<T>(object: any, iteratee: (val: any, key: string, object: any) => T, context?: any): _.Dictionary<T>;
+	/**
+	 * Like map, but for objects. Transform the value of each property in turn.
+	 * @param object The object to transform
+	 * @param iteratee The function that tranforms property values
+	 * @param context The optional context (value of `this`) to bind to
+	 */
+	mapObject<T>(object: any, iteratee: (val: any, key: string, object: any) => T, context?: any): _.Dictionary<T>;
 
-    /**
-     * Like map, but for objects. Retrieves a property from each entry in the object, as if by _.property
-     * @param object The object to transform
-     * @param iteratee The property name to retrieve
-     * @param context The optional context (value of `this`) to bind to
-     */
-    mapObject(object: any, iteratee: string, context?: any): _.Dictionary<any>;
+	/**
+	 * Like map, but for objects. Retrieves a property from each entry in the object, as if by _.property
+	 * @param object The object to transform
+	 * @param iteratee The property name to retrieve
+	 * @param context The optional context (value of `this`) to bind to
+	 */
+	mapObject(object: any, iteratee: string, context?: any): _.Dictionary<any>;
 
 	/**
 	* Convert an object into a list of [key, value] pairs.
@@ -3713,12 +3713,12 @@ interface UnderscoreStatic {
 	**/
 	property(key: string): (object: Object) => any;
 
-    /**
+	/**
 	* Returns a function that will itself return the value of a object key property.
 	* @param key The object to get the property value from.
 	* @return Function which accept a key property in `object` and returns its value.
 	**/
-    propertyOf(object: Object): (key: string) => any;
+	propertyOf(object: Object): (key: string) => any;
 
 	/**
 	* Performs an optimized deep comparison between the two objects,
@@ -3964,7 +3964,7 @@ interface UnderscoreStatic {
 	* If the value of the named property is a function then invoke it; otherwise, return it.
 	* @param object Object to maybe invoke function `property` on.
 	* @param property The function by name to invoke on `object`.
-    * @param defaultValue The value to be returned in case `property` doesn't exist or is undefined.
+	* @param defaultValue The value to be returned in case `property` doesn't exist or is undefined.
 	* @return The result of invoking the function `property` on `object.
 	**/
 	result(object: any, property: string, defaultValue?:any): any;
@@ -4447,7 +4447,7 @@ interface Underscore<T> {
 	**/
 	zip(...arrays: any[][]): any[][];
 
-    /**
+	/**
 	* Wrapped type `any[][]`.
 	* @see _.unzip
 	**/
@@ -4612,11 +4612,11 @@ interface Underscore<T> {
 	**/
 	keys(): string[];
 
-    /**
+	/**
 	* Wrapped type `object`.
 	* @see _.allKeys
 	**/
-    allKeys(): string[];
+	allKeys(): string[];
 
 	/**
 	* Wrapped type `object`.
@@ -4705,7 +4705,7 @@ interface Underscore<T> {
 	**/
 	property(): (object: Object) => any;
 
-    /**
+	/**
 	* Wrapped type `object`.
 	* @see _.propertyOf
 	**/
@@ -4759,7 +4759,7 @@ interface Underscore<T> {
 	**/
 	isFunction(): boolean;
 
-    /**
+	/**
 	* Wrapped type `object`.
 	* @see _.isError
 	**/
@@ -5365,7 +5365,7 @@ interface _Chain<T> {
 	**/
 	zip(...arrays: any[][]): _Chain<T>;
 
-    /**
+	/**
 	* Wrapped type `any[][]`.
 	* @see _.unzip
 	**/
@@ -5530,7 +5530,7 @@ interface _Chain<T> {
 	**/
 	keys(): _Chain<string>;
 
-    /**
+	/**
 	* Wrapped type `object`.
 	* @see _.allKeys
 	**/
@@ -5623,7 +5623,7 @@ interface _Chain<T> {
 	**/
 	property(): _Chain<T>;
 
-    /**
+	/**
 	* Wrapped type `object`.
 	* @see _.propertyOf
 	**/
@@ -5677,7 +5677,7 @@ interface _Chain<T> {
 	**/
 	isFunction(): _Chain<T>;
 
-    /**
+	/**
 	* Wrapped type `object`.
 	* @see _.isError
 	**/

From 830586ef556be5244f3711587b0c774ddfd959c4 Mon Sep 17 00:00:00 2001
From: Horiuchi_H <horiuchi.g@gmail.com>
Date: Wed, 22 Jun 2016 14:41:58 +0900
Subject: [PATCH 249/278] implement `samlp` type definition (#9767)

---
 samlp/samlp-tests.ts | 34 ++++++++++++++++++++++
 samlp/samlp.d.ts     | 67 ++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 101 insertions(+)
 create mode 100644 samlp/samlp-tests.ts
 create mode 100644 samlp/samlp.d.ts

diff --git a/samlp/samlp-tests.ts b/samlp/samlp-tests.ts
new file mode 100644
index 0000000000..7039e1c949
--- /dev/null
+++ b/samlp/samlp-tests.ts
@@ -0,0 +1,34 @@
+/// <reference path="samlp.d.ts" />
+/// <reference path="../node/node.d.ts" />
+/// <reference path="../express/express.d.ts" />
+
+import * as fs from 'fs';
+import * as path from 'path';
+import * as express from 'express';
+import * as samlp from 'samlp';
+
+
+// Example
+const app = express();
+
+app.get('/samlp', samlp.auth({
+  issuer:     'the-issuer',
+  cert:       fs.readFileSync(path.join(__dirname, 'some-cert.pem')),
+  key:        fs.readFileSync(path.join(__dirname, 'some-cert.key')),
+  getPostURL: function (wtrealm, wreply, req, cb) {
+                return cb( null, 'http://someurl.com')
+              }
+}));
+
+app.get('/samlp/FederationMetadata/2007-06/FederationMetadata.xml', samlp.metadata({
+  issuer:   'the-issuer',
+  cert:     fs.readFileSync(path.join(__dirname, 'some-cert.pem')),
+}));
+
+
+app.use((req: express.Request, res: express.Response, next: express.NextFunction) => {
+  samlp.parseRequest(req, (err: any, data: any) => {
+    next();
+  });
+});
+
diff --git a/samlp/samlp.d.ts b/samlp/samlp.d.ts
new file mode 100644
index 0000000000..2993951545
--- /dev/null
+++ b/samlp/samlp.d.ts
@@ -0,0 +1,67 @@
+// Type definitions for SAMLP 1.0.0
+// Project: https://github.com/auth0/node-samlp
+// Definitions by: horiuchi <https://github.com/horiuchi/>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../express/express.d.ts" />
+/// <reference path="../passport/passport.d.ts" />
+
+declare module "samlp" {
+
+    import * as express from 'express';
+    import * as passport from 'passport';
+
+    export function auth(options: IdPOptions): express.Handler;
+    export function logout(options: IdPOptions): express.Handler;
+    export function parseRequest(req: express.Request, callback: (err: any, data: any) => void): void;
+    export function getSamlResponse(options: IdPOptions, user: any, callback: (err: any, samlResponse: any) => void): void;
+    export function sendError(options: IdPOptions): express.Handler;
+    export function metadata(options: IdPMetadataOptions): express.Handler;
+
+    export interface IdPOptions {
+        issuer: string;
+        cert: string | Buffer;
+        key: string | Buffer;
+        audience?: string;
+        recipient?: string;
+        destination?: string;
+        RelayState?: string;
+        digestAlgorithm?: 'sha1' | 'sha256';
+        signatureAlgorithm?: 'rsa-sha1' | 'rsa-sha256';
+        signResponse?: boolean;
+        encryptionCert?: string | Buffer;
+        encryptionPublicKey?: string | Buffer;
+        encryptionAlgorithm?: string;
+        keyEncryptionAlgorighm?: string;
+        lifetimeInSeconds?: number;
+        authnContextClassRef?: string;
+        profileMapper?: PassportProfileMapper;
+        getUserFromRequest?: (req: express.Request) => any;
+        getPostURL: (audience: string, authnRequestDom: any, req: express.Request, callback: (err: any, url: string) => void) => void;
+    }
+    export interface IdPMetadataOptions {
+        issuer: string;
+        cert: string | Buffer;
+        profileMapper?: PassportProfileMapper;
+        redirectEndpointPath?: string;
+        postEndpointPath?: string;
+        logoutEndpointPaths?: {
+            redirect?: string;
+            post?: string;
+        };
+    }
+
+    export class PassportProfileMapper {
+        constructor(pu: passport.Profile);
+        metadata: MetadataItem[];
+        getClaims(): any;
+        getNameIdentifier(): any;
+    }
+    export interface MetadataItem {
+        id: string;
+        optional: boolean;
+        displayName: string;
+        description: string;
+    }
+
+}

From 457de5356265b4a2f2c2b74138c4da8fddc94baf Mon Sep 17 00:00:00 2001
From: frogcjn <frogcjn@163.com>
Date: Wed, 22 Jun 2016 13:42:14 +0800
Subject: [PATCH 250/278] add comment for logging

---
 sequelize/sequelize.d.ts | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/sequelize/sequelize.d.ts b/sequelize/sequelize.d.ts
index af97bfaeda..38072ee079 100644
--- a/sequelize/sequelize.d.ts
+++ b/sequelize/sequelize.d.ts
@@ -2884,6 +2884,10 @@ declare module "sequelize" {
         }
 
         interface LoggingOptions {
+            /**
+            * A function that gets executed while running the query to log the sql.
+            */
+
             logging?: boolean | Function;
 
             /**

From c26def5ccbb91f9fe161b91fe794dd6b90a5126b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Rasmus=20Eeg=20M=C3=B8ller?= <rasmuseeg@outlook.com>
Date: Wed, 22 Jun 2016 08:28:53 +0200
Subject: [PATCH 251/278] dialogData should be optional

---
 umbraco/umbraco-services.d.ts | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/umbraco/umbraco-services.d.ts b/umbraco/umbraco-services.d.ts
index 90585243f0..8b7609c859 100644
--- a/umbraco/umbraco-services.d.ts
+++ b/umbraco/umbraco-services.d.ts
@@ -494,11 +494,10 @@ declare namespace umbraco.services {
         width?: number;
         /*strips the modal from any animation and wrappers, used when you want to inject a dialog into an existing container*/
         inline?: boolean;
-        
         /** 
          * It will set this value as a property on the dialog controller's scope as $scope.dialogData
          */
-	dialogData: any;
+	dialogData?: any;
     }
 
     /**

From 3d765c8f812d6863a310df186665f4086bb6ee9d Mon Sep 17 00:00:00 2001
From: Jasper Siegmund <jasper@repsaj.nl>
Date: Wed, 22 Jun 2016 08:39:33 +0200
Subject: [PATCH 252/278] Changed some of the parameters to optional

As per comment / instructions, I've changed the parameters to optionals.
---
 .../AzureMobileServicesClient.d.ts                    | 11 +++++------
 1 file changed, 5 insertions(+), 6 deletions(-)

diff --git a/azure-mobile-services-client/AzureMobileServicesClient.d.ts b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
index d401b4d1bc..707e7222d8 100644
--- a/azure-mobile-services-client/AzureMobileServicesClient.d.ts
+++ b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
@@ -9,8 +9,7 @@ declare namespace Microsoft.WindowsAzure {
 
     // MobileServiceClient object based on Microsoft Azure documentation: http://msdn.microsoft.com/en-us/library/windowsazure/jj554219.aspx
     interface MobileServiceClient {
-        new (applicationUrl: string): MobileServiceClient;
-        new (applicationUrl: string, applicationKey: string): MobileServiceClient;
+        new (applicationUrl: string, applicationKey?: string): MobileServiceClient;
         applicationUrl: string;
         applicationKey: string;
         currentUser: User;
@@ -34,7 +33,7 @@ declare namespace Microsoft.WindowsAzure {
          *     headers: HTTP request headers, specified as an object.
          * @param callback Optional callback accepting (error, results) parameters.
          */
-        invokeApi(apiName: string, options: InvokeApiOptions, callback: (error: any, results: any) => void): asyncPromise;
+        invokeApi(apiName: string, options?: InvokeApiOptions, callback?: (error: any, results: any) => void): asyncPromise;
     }
 
     interface Push
@@ -48,14 +47,14 @@ declare namespace Microsoft.WindowsAzure {
          * @param secondaryTiles An object containing template definitions to be used with secondary tiles when using WNS.
          * @param callback Optional callback accepting (error, results) parameters.
          */
-        register(platform: string, pushChannel: string, templates: any, secondaryTiles: any, callback: (error: any, results: any) => void): void;
+        register(platform: string, pushChannel: string, templates?: any, secondaryTiles?: any, callback?: (error: any, results: any) => void): void;
         /**
          * Invokes the specified custom api and returns a response object.
          *
          * @param pushChannel The push channel identifier or URI.
          * @param callback Optional callback accepting (error, results) parameters.
          */
-        unregister(pushChannel: string, callback: (error: any, results: any) => void): void;
+        unregister(pushChannel: string, callback?: (error: any, results: any) => void): void;
     }
 
     interface InvokeApiOptions
@@ -141,4 +140,4 @@ declare module "azure-mobile-apps-client" {
     export = WindowsAzure;
 }
 
-declare var WindowsAzure: Microsoft.WindowsAzure.WindowsAzureStatic;
\ No newline at end of file
+declare var WindowsAzure: Microsoft.WindowsAzure.WindowsAzureStatic;

From dc58831c27336536626a67c8148e645265045f40 Mon Sep 17 00:00:00 2001
From: Danilo Bargen <mail@dbrgn.ch>
Date: Thu, 12 May 2016 15:47:19 +0200
Subject: [PATCH 253/278] Update RTCConfiguration interface to latest spec

---
 webrtc/RTCPeerConnection-tests.ts | 24 +++++++++++++++++--
 webrtc/RTCPeerConnection.d.ts     | 39 +++++++++++++++++++++++++++----
 2 files changed, 56 insertions(+), 7 deletions(-)

diff --git a/webrtc/RTCPeerConnection-tests.ts b/webrtc/RTCPeerConnection-tests.ts
index ea850f8724..9cd8087947 100644
--- a/webrtc/RTCPeerConnection-tests.ts
+++ b/webrtc/RTCPeerConnection-tests.ts
@@ -3,8 +3,28 @@
 
 let voidpromise: Promise<void>;
 
-var config: RTCConfiguration =
-    { iceServers: [{ urls: "stun.l.google.com:19302" }] };
+var minimalConfig: RTCConfiguration = {};
+var config: RTCConfiguration = {
+    iceServers: [
+        {
+            // Single url
+            urls: "stun.l.google.com:19302"
+        },
+        {
+            // List of urls and credentials
+            urls: ["another-stun.example.com"],
+            username: "dude",
+            credential: "pass",
+            credentialType: "token"
+        },
+    ],
+    iceTransportPolicy: "relay",
+    bundlePolicy: "max-compat",
+    rtcpMuxPolicy: "negotiate",
+    peerIdentity: "dude",
+    certificates: [{expires: 1337}],
+    iceCandidatePoolSize: 5
+};
 var constraints: RTCMediaConstraints =
     { mandatory: { offerToReceiveAudio: true, offerToReceiveVideo: true } };
 
diff --git a/webrtc/RTCPeerConnection.d.ts b/webrtc/RTCPeerConnection.d.ts
index dcd36d9aec..a3d39130e0 100644
--- a/webrtc/RTCPeerConnection.d.ts
+++ b/webrtc/RTCPeerConnection.d.ts
@@ -20,17 +20,46 @@
 // TODO(2): get Typescript to have union types as WebRtc uses them.
 // https://typescript.codeplex.com/workitem/1364
 
-interface RTCConfiguration {
-  iceServers: RTCIceServer[];
+// https://www.w3.org/TR/webrtc/#idl-def-RTCIceTransportPolicy
+type RTCIceTransportPolicy = 'public' | 'relay' | 'all';
+
+// https://www.w3.org/TR/webrtc/#idl-def-RTCBundlePolicy
+type RTCBundlePolicy = 'balanced' | 'max-compat' | 'max-bundle';
+
+// https://www.w3.org/TR/webrtc/#idl-def-RTCRtcpMuxPolicy
+type RTCRtcpMuxPolicy = 'negotiate' | 'require';
+
+// https://www.w3.org/TR/webrtc/#idl-def-RTCCertificate
+interface RTCCertificate {
+    expires: number;
 }
+
+// https://www.w3.org/TR/webrtc/#idl-def-RTCConfiguration
+// https://developer.mozilla.org/en-US/docs/Web/API/RTCPeerConnection/RTCPeerConnection#RTCConfiguration_dictionary
+interface RTCConfiguration {
+  iceServers           ?: RTCIceServer[];        // optional according to mozilla docs
+  iceTransportPolicy   ?: RTCIceTransportPolicy; // default = 'all'
+  bundlePolicy         ?: RTCBundlePolicy;       // default = 'balanced'
+  rtcpMuxPolicy        ?: RTCRtcpMuxPolicy;      // default = 'require'
+  peerIdentity         ?: string;                // default = null
+  certificates         ?: RTCCertificate[];      // default is auto-generated
+  iceCandidatePoolSize ?: number;                // default = 0
+}
+
 declare var RTCConfiguration: {
   prototype: RTCConfiguration;
   new (): RTCConfiguration;
 };
 
+// https://www.w3.org/TR/webrtc/#idl-def-RTCIceCredentialType
+type RTCIceCredentialType = 'password' | 'token';
+
+// https://www.w3.org/TR/webrtc/#idl-def-RTCIceServer
 interface RTCIceServer {
-  urls: string;
+  urls: string | string[];
+  username?: string;
   credential?: string;
+  credentialType?: RTCIceCredentialType; // default = 'password'
 }
 declare var RTCIceServer: {
   prototype: RTCIceServer;
@@ -42,7 +71,7 @@ interface mozRTCPeerConnection extends RTCPeerConnection {
 }
 declare var mozRTCPeerConnection: {
   prototype: mozRTCPeerConnection;
-  new (settings: RTCPeerConnectionConfig,
+  new (settings?: RTCConfiguration,
        constraints?:RTCMediaConstraints): mozRTCPeerConnection;
 };
 // webkit (Chrome) specific prefixes.
@@ -50,7 +79,7 @@ interface webkitRTCPeerConnection extends RTCPeerConnection {
 }
 declare var webkitRTCPeerConnection: {
   prototype: webkitRTCPeerConnection;
-  new (settings: RTCPeerConnectionConfig,
+  new (settings?: RTCConfiguration,
        constraints?:RTCMediaConstraints): webkitRTCPeerConnection;
 };
 

From 677ea8dbd9aefa9fb94e3a3522c4ccebc9926299 Mon Sep 17 00:00:00 2001
From: Danilo Bargen <mail@dbrgn.ch>
Date: Thu, 12 May 2016 15:53:08 +0200
Subject: [PATCH 254/278] Update header

---
 webrtc/RTCPeerConnection.d.ts | 8 +-------
 1 file changed, 1 insertion(+), 7 deletions(-)

diff --git a/webrtc/RTCPeerConnection.d.ts b/webrtc/RTCPeerConnection.d.ts
index a3d39130e0..66b92c2416 100644
--- a/webrtc/RTCPeerConnection.d.ts
+++ b/webrtc/RTCPeerConnection.d.ts
@@ -3,13 +3,7 @@
 // Definitions by: Ken Smith <https://github.com/smithkl42/>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 //
-// Definitions taken from http://dev.w3.org/2011/webrtc/editor/webrtc.html
-//
-// For example code see:
-//   https://code.google.com/p/webrtc/source/browse/stable/samples/js/apprtc/js/main.js
-//
-// For a generic implementation see that deals with browser differences, see:
-//   https://code.google.com/p/webrtc/source/browse/stable/samples/js/base/adapter.js
+// W3 Spec: https://www.w3.org/TR/webrtc/#idl-def-RTCIceServer
 
 /// <reference path='MediaStream.d.ts' />
 

From 28f0470c08281e988905db7677c9bd0422290bc3 Mon Sep 17 00:00:00 2001
From: Tathagata Chakraborty <tathagata.chakraborty@geometricglobal.com>
Date: Wed, 22 Jun 2016 13:35:26 +0530
Subject: [PATCH 255/278] renaming to lowercase convention

---
 .../datastream.js-tests.ts                                        | 0
 .../DataStream.js.d.ts => datastream.js/datastream.js.d.ts        | 0
 2 files changed, 0 insertions(+), 0 deletions(-)
 rename DataStream.js/DataStream.js-tests.ts => datastream.js/datastream.js-tests.ts (100%)
 rename DataStream.js/DataStream.js.d.ts => datastream.js/datastream.js.d.ts (100%)

diff --git a/DataStream.js/DataStream.js-tests.ts b/datastream.js/datastream.js-tests.ts
similarity index 100%
rename from DataStream.js/DataStream.js-tests.ts
rename to datastream.js/datastream.js-tests.ts
diff --git a/DataStream.js/DataStream.js.d.ts b/datastream.js/datastream.js.d.ts
similarity index 100%
rename from DataStream.js/DataStream.js.d.ts
rename to datastream.js/datastream.js.d.ts

From 9f19feb70d5f8e65689b7e630661302fe7f270aa Mon Sep 17 00:00:00 2001
From: k7sleeper <k7sleeper@gmail.com>
Date: Wed, 22 Jun 2016 10:44:06 +0200
Subject: [PATCH 256/278] added JSDoc comment

---
 z-schema/z-schema.d.ts | 15 ++++++---------
 1 file changed, 6 insertions(+), 9 deletions(-)

diff --git a/z-schema/z-schema.d.ts b/z-schema/z-schema.d.ts
index e151a497b9..4f189f95b3 100644
--- a/z-schema/z-schema.d.ts
+++ b/z-schema/z-schema.d.ts
@@ -37,36 +37,33 @@ declare namespace ZSchema {
     }
 
     export class Validator {
-<<<<<<< HEAD
     
         /**
          * Register a custom format.
          *
-         * @param name - format name of the custom format
+         * @param name - name of the custom format
          * @param validatorFunction - custom format validator function.
-         *   Returns true if value matches the custom format.
+         *   Returns `true` if `value` matches the custom format.
          */
         public static registerFormat(formatName: string, validatorFunction: (value: any) => boolean): void;
 
         /**
          * Unregister a format.
          *
-         * @param name - format name of the custom format
+         * @param name - name of the custom format
          */
         public static unregisterFormat(name: string): void;
         
         /**
          * Get the list of all registered formats.
          *
+         * Both the names of the burned-in formats and the custom format names are
+         * returned by this function.
+         *
          * @returns {string[]} the list of all registered format names.
          */
         public static getRegisteredFormats(): string[];
         
-=======
-        public static registerFormat(name: string, validator: (value: any) => boolean): void;
-        public static unregisterFormat(name: string): void;
-        public static getRegisteredFormats(): string[];
->>>>>>> e325b363f5ee9c72ebde49f1e783ae725f64b7e2
         public static getDefaultOptions(): Options;
     
         constructor(options: Options);

From 9000bf59d4c75186123f5118782c1b6c18d27178 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Johannes=20Dr=C3=B6nner?=
 <droenner@Mathematik.Uni-Marburg.DE>
Date: Wed, 22 Jun 2016 10:57:35 +0200
Subject: [PATCH 257/278] change "extends Object" to "extends ol.Object" and
 "{}" to "any".

---
 openlayers/openlayers.d.ts | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/openlayers/openlayers.d.ts b/openlayers/openlayers.d.ts
index f08238b969..fafaaa186b 100644
--- a/openlayers/openlayers.d.ts
+++ b/openlayers/openlayers.d.ts
@@ -4126,7 +4126,7 @@ declare namespace ol {
         class OSM extends XYZ {
         }
 
-        class Source extends Object {
+        class Source extends ol.Object {
             /**
              * Get the projection of the source.
              * @return Projection.
@@ -4169,12 +4169,12 @@ declare namespace ol {
             /**
              * Update the user-provided (WMS request) parameters.
              */
-            updateParams(params: {}): void;
+            updateParams(params: any): void;
 
             /**
              * Get the user-provided (WMS request) params, i.e. those passed to the constructor through the "params" option, and possibly updated using the updateParams method.
              */
-            getParams(): {};
+            getParams(): any;
 
             /**
              * Return the GetFeatureInfo URL for the passed coordinate, resolution, and

From 7fbf8c7663f9f2b3e4998cda5a51d345afceefb2 Mon Sep 17 00:00:00 2001
From: Daniel McAssey <daniel.mcassey@gmail.com>
Date: Wed, 22 Jun 2016 10:06:42 +0100
Subject: [PATCH 258/278] Correct file names

---
 resumablejs/{resumable-tests.ts => resumablejs-tests.ts} | 0
 resumablejs/{resumable.d.ts => resumablejs.d.ts}         | 0
 2 files changed, 0 insertions(+), 0 deletions(-)
 rename resumablejs/{resumable-tests.ts => resumablejs-tests.ts} (100%)
 rename resumablejs/{resumable.d.ts => resumablejs.d.ts} (100%)

diff --git a/resumablejs/resumable-tests.ts b/resumablejs/resumablejs-tests.ts
similarity index 100%
rename from resumablejs/resumable-tests.ts
rename to resumablejs/resumablejs-tests.ts
diff --git a/resumablejs/resumable.d.ts b/resumablejs/resumablejs.d.ts
similarity index 100%
rename from resumablejs/resumable.d.ts
rename to resumablejs/resumablejs.d.ts

From f6e8e7d2f1cb3e1cf9738d6ef2438e999dc3eb99 Mon Sep 17 00:00:00 2001
From: Daniel McAssey <daniel.mcassey@gmail.com>
Date: Wed, 22 Jun 2016 10:08:11 +0100
Subject: [PATCH 259/278] Fix overload ordering

---
 resumablejs/resumablejs.d.ts | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/resumablejs/resumablejs.d.ts b/resumablejs/resumablejs.d.ts
index 8678b8248e..c87d669a07 100644
--- a/resumablejs/resumablejs.d.ts
+++ b/resumablejs/resumablejs.d.ts
@@ -231,10 +231,6 @@ declare namespace Resumable {
 	 **/
 	handleDropEvent(e: Event): void;
 	
-    /**
-     * Listen for event from Resumable.js (see below)
-     **/
-    on(event: string, callback: Function): void;
     /**
      *  A specific file was completed.
      **/
@@ -303,6 +299,10 @@ declare namespace Resumable {
      * Listen to all the events listed above with the same callback function.
      **/
     on(event: 'catchAll', callback: () => void): void;
+	/**
+     * Listen for event from Resumable.js (see below)
+     **/
+    on(event: string, callback: Function): void;
   }
 
   interface ResumableFile {

From 243e39b8b4657cbd1ff87306b98e5f0be94f525a Mon Sep 17 00:00:00 2001
From: Daniel McAssey <daniel.mcassey@gmail.com>
Date: Wed, 22 Jun 2016 10:10:16 +0100
Subject: [PATCH 260/278] Fix path

---
 resumablejs/resumablejs-tests.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/resumablejs/resumablejs-tests.ts b/resumablejs/resumablejs-tests.ts
index 202a64bd42..e2e9d180d4 100644
--- a/resumablejs/resumablejs-tests.ts
+++ b/resumablejs/resumablejs-tests.ts
@@ -1,4 +1,4 @@
-/// <reference path="resumable.d.ts" />
+/// <reference path="resumablejs.d.ts" />
 
 import { Resumable, ResumableFile } from 'resumablejs';
 

From 900a866673e9261400628091758bd618fe5ddd07 Mon Sep 17 00:00:00 2001
From: Milan Burda <milan.burda@gmail.com>
Date: Sat, 18 Jun 2016 21:19:24 +0200
Subject: [PATCH 261/278] Update to Electron 1.2.4

---
 github-electron/github-electron.d.ts | 64 +++++++++++++++++++++++++---
 1 file changed, 57 insertions(+), 7 deletions(-)

diff --git a/github-electron/github-electron.d.ts b/github-electron/github-electron.d.ts
index f7dd206708..dde54c2254 100644
--- a/github-electron/github-electron.d.ts
+++ b/github-electron/github-electron.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for Electron v1.2.3
+// Type definitions for Electron v1.2.4
 // Project: http://electron.atom.io/
 // Definitions by: jedmao <https://github.com/jedmao/>, rhysd <https://rhysd.github.io>, Milan Burda <https://github.com/miniak/>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
@@ -270,7 +270,7 @@ declare namespace Electron {
 		clearRecentDocuments(): void;
 		/**
 		 * Sets the current executable as the default handler for a protocol (aka URI scheme).
-		 * Once registered, all links with your-protocol:// will be openend with the current executable.
+		 * Once registered, all links with your-protocol:// will be opened with the current executable.
 		 * The whole link, including protocol, will be passed to your application as a parameter.
 		 *
 		 * Note: This is only implemented on OS X and Windows.
@@ -650,15 +650,21 @@ declare namespace Electron {
 		 * Adds devtools extension located at path. The extension will be remembered
 		 * so you only need to call this API once, this API is not for programming use.
 		 * @returns The extension's name.
+		 *
+		 * Note: This API cannot be called before the ready event of the app module is emitted.
 		 */
 		static addDevToolsExtension(path: string): string;
 		/**
 		 * Remove a devtools extension.
 		 * @param name The name of the devtools extension to remove.
+		 *
+		 * Note: This API cannot be called before the ready event of the app module is emitted.
 		 */
 		static removeDevToolsExtension(name: string): void;
 		/**
 		 * @returns devtools extensions.
+		 *
+		 * Note: This API cannot be called before the ready event of the app module is emitted.
 		 */
 		static getDevToolsExtensions(): DevToolsExtensions;
 		/**
@@ -713,6 +719,10 @@ declare namespace Electron {
 		 * @returns Whether the window is visible to the user.
 		 */
 		isVisible(): boolean;
+		/**
+		 * @returns Whether the window is a modal window.
+		 */
+		isModal(): boolean;
 		/**
 		 * Maximizes the window.
 		 */
@@ -1058,6 +1068,20 @@ declare namespace Electron {
 		 * Note: This API is available only on Windows.
 		 */
 		setFocusable(focusable: boolean): void;
+		/**
+		 * Sets parent as current window's parent window,
+		 * passing null will turn current window into a top-level window.
+		 * Note: This API is not available on Windows.
+		 */
+		setParentWindow(parent: BrowserWindow): void;
+		/**
+		 * @returns The parent window.
+		 */
+		getParentWindow(): BrowserWindow;
+		/**
+		 * @returns All child windows.
+		 */
+		getChildWindows(): BrowserWindow[];
 	}
 
 	type SwipeDirection = 'up' | 'right' | 'down' | 'left';
@@ -1367,6 +1391,16 @@ declare namespace Electron {
 		 * Default: true.
 		 */
 		frame?: boolean;
+		/**
+		 * Specify parent window.
+		 * Default: null.
+		 */
+		parent?: BrowserWindow;
+		/**
+		 * Whether this is a modal window. This only works when the window is a child window.
+		 * Default: false.
+		 */
+		modal?: boolean;
 		/**
 		 * Whether the web view accepts a single mouse-down event that simultaneously activates the window.
 		 * Default: false.
@@ -2084,7 +2118,7 @@ declare namespace Electron {
 	}
 
 	type MenuItemType = 'normal' | 'separator' | 'submenu' | 'checkbox' | 'radio';
-	type MenuItemRole = 'undo' | 'redo' | 'cut' | 'copy' | 'paste' | 'pasteandmatchstyle' | 'selectall' | 'delete' | 'minimize' | 'close';
+	type MenuItemRole = 'undo' | 'redo' | 'cut' | 'copy' | 'paste' | 'pasteandmatchstyle' | 'selectall' | 'delete' | 'minimize' | 'close' | 'quit' | 'togglefullscreen';
 	type MenuItemRoleMac = 'about' | 'hide' | 'hideothers' | 'unhide' | 'front' | 'zoom' | 'window' | 'help' | 'services';
 
 	interface MenuItemOptions {
@@ -2204,6 +2238,10 @@ declare namespace Electron {
 		 * will be set as each window's top menu.
 		 */
 		static setApplicationMenu(menu: Menu): void;
+		/**
+		 * @returns The application menu if set, or null if not set.
+		 */
+		static getApplicationMenu(): Menu;
 		/**
 		 * Sends the action to the first responder of application.
 		 * This is used for emulating default Cocoa menu behaviors,
@@ -2219,7 +2257,7 @@ declare namespace Electron {
 		 */
 		static buildFromTemplate(template: MenuItemOptions[]): Menu;
 		/**
-		 * Popups this menu as a context menu in the browserWindow. You can optionally
+		 * Pops up this menu as a context menu in the browserWindow. You can optionally
 		 * provide a (x,y) coordinate to place the menu at, otherwise it will be placed
 		 * at the current mouse cursor position.
 		 * @param x Horizontal coordinate where the menu will be placed.
@@ -3088,6 +3126,14 @@ declare namespace Electron {
 		 * Note: This is only implemented on OS X.
 		 */
 		unsubscribeNotification(id: number): void;
+		/**
+		 * Same as subscribeNotification, but uses NSNotificationCenter for local defaults.
+		 */
+		subscribeLocalNotification(event: string, callback: (event: Event, userInfo: Object) => void): number;
+		/**
+		 * Same as unsubscribeNotification, but removes the subscriber from NSNotificationCenter.
+		 */
+		unsubscribeLocalNotification(id: number): void;
 		/**
 		 * Get the value of key in system preferences.
 		 *
@@ -3206,7 +3252,7 @@ declare namespace Electron {
 			content?: string;
 		}): void;
 		/**
-		 * Popups the context menu of tray icon. When menu is passed,
+		 * Pops up the context menu of tray icon. When menu is passed,
 		 * the menu will showed instead of the tray's context menu.
 		 * The position is only available on Windows, and it is (0, 0) by default.
 		 * Note: This is only implemented on OS X and Windows.
@@ -3216,6 +3262,10 @@ declare namespace Electron {
 		 * Sets the context menu for this icon.
 		 */
 		setContextMenu(menu: Menu): void;
+		/**
+		 * @returns The bounds of this tray icon.
+		 */
+		getBounds(): Bounds;
 	}
 
 	interface Modifiers {
@@ -3721,11 +3771,11 @@ declare namespace Electron {
 
 	interface ContextMenuParams {
 		/**
-		 * x coodinate
+		 * x coordinate
 		 */
 		x: number;
 		/**
-		 * y coodinate
+		 * y coordinate
 		 */
 		y: number;
 		/**

From 5686694c33f62300bea80779ab6381cccd6e38bb Mon Sep 17 00:00:00 2001
From: Milan Burda <milan.burda@gmail.com>
Date: Wed, 22 Jun 2016 12:10:43 +0200
Subject: [PATCH 262/278] Replace OS X and Mac OS with macOS

---
 github-electron/github-electron.d.ts | 162 +++++++++++++--------------
 1 file changed, 81 insertions(+), 81 deletions(-)

diff --git a/github-electron/github-electron.d.ts b/github-electron/github-electron.d.ts
index dde54c2254..ce6efe3869 100644
--- a/github-electron/github-electron.d.ts
+++ b/github-electron/github-electron.d.ts
@@ -34,7 +34,7 @@ declare namespace Electron {
 		/**
 		 * Emitted when the application has finished basic startup.
 		 * On Windows and Linux, the will-finish-launching event
-		 * is the same as the ready event; on OS X, this event represents
+		 * is the same as the ready event; on macOS, this event represents
 		 * the applicationWillFinishLaunching notification of NSApplication.
 		 * You would usually set up listeners for the open-file and open-url events here,
 		 * and start the crash reporter and auto updater.
@@ -81,7 +81,7 @@ declare namespace Electron {
 		 *
 		 * You should call event.preventDefault() if you want to handle this event.
 		 *
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		on(event: 'open-file', listener: (event: Event, url: string) => void): this;
 		/**
@@ -90,12 +90,12 @@ declare namespace Electron {
 		 *
 		 * You should call event.preventDefault() if you want to handle this event.
 		 *
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		on(event: 'open-url', listener: (event: Event, url: string) => void): this;
 		/**
 		 * Emitted when the application is activated, which usually happens when clicks on the applications’s dock icon.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		on(event: 'activate', listener: Function): this;
 		/**
@@ -197,18 +197,18 @@ declare namespace Electron {
 		}): void;
 		/**
 		 * On Linux, focuses on the first visible window.
-		 * On OS X, makes the application the active app.
+		 * On macOS, makes the application the active app.
 		 * On Windows, focuses on the application’s first window.
 		 */
 		focus(): void;
 		/**
 		 * Hides all application windows without minimizing them.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		hide(): void;
 		/**
 		 * Shows application windows after they were hidden. Does not automatically focus them.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		show(): void;
 		/**
@@ -257,15 +257,15 @@ declare namespace Electron {
 		 * Adds path to recent documents list.
 		 *
 		 * This list is managed by the system, on Windows you can visit the list from
-		 * task bar, and on Mac you can visit it from dock menu.
+		 * task bar, and on macOS you can visit it from dock menu.
 		 *
-		 * Note: This is only implemented on OS X and Windows.
+		 * Note: This is only implemented on macOS and Windows.
 		 */
 		addRecentDocument(path: string): void;
 		/**
 		 * Clears the recent documents list.
 		 *
-		 * Note: This is only implemented on OS X and Windows.
+		 * Note: This is only implemented on macOS and Windows.
 		 */
 		clearRecentDocuments(): void;
 		/**
@@ -273,20 +273,20 @@ declare namespace Electron {
 		 * Once registered, all links with your-protocol:// will be opened with the current executable.
 		 * The whole link, including protocol, will be passed to your application as a parameter.
 		 *
-		 * Note: This is only implemented on OS X and Windows.
-		 *       On OS X, you can only register protocols that have been added to your app's info.plist.
+		 * Note: This is only implemented on macOS and Windows.
+		 *       On macOS, you can only register protocols that have been added to your app's info.plist.
 		 */
 		setAsDefaultProtocolClient(protocol: string): void;
 		/**
 		 * Removes the current executable as the default handler for a protocol (aka URI scheme).
 		 *
-		 * Note: This is only implemented on OS X and Windows.
+		 * Note: This is only implemented on macOS and Windows.
 		 */
 		removeAsDefaultProtocolClient(protocol: string): void;
 		/**
 		 * @returns Whether the current executable is the default handler for a protocol (aka URI scheme).
 		 *
-		 * Note: This is only implemented on OS X and Windows.
+		 * Note: This is only implemented on macOS and Windows.
 		 */
 		isDefaultProtocolClient(protocol: string): boolean;
 		/**
@@ -315,13 +315,13 @@ declare namespace Electron {
 		 * @param webpageURL The webpage to load in a browser if no suitable app is
 		 * 					 installed on the resuming device. The scheme must be http or https.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		setUserActivity(type: string, userInfo: Object, webpageURL?: string): void;
 		/**
 		 * @returns The type of the currently running activity.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		getCurrentActivityType(): string;
 		/**
@@ -343,7 +343,7 @@ declare namespace Electron {
 		disableHardwareAcceleration(): void;
 		commandLine: CommandLine;
 		/**
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		dock: Dock;
 	}
@@ -393,49 +393,49 @@ declare namespace Electron {
 		/**
 		 * Cancel the bounce of id.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		cancelBounce(id: number): void;
 		/**
 		 * Bounces the Downloads stack if the filePath is inside the Downloads folder.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		downloadFinished(filePath: string): void;
 		/**
 		 * Sets the string to be displayed in the dock’s badging area.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		setBadge(text: string): void;
 		/**
 		 * Returns the badge string of the dock.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		getBadge(): string;
 		/**
 		 * Hides the dock icon.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		hide(): void;
 		/**
 		 * Shows the dock icon.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		show(): void;
 		/**
 		 * Sets the application dock menu.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		setMenu(menu: Menu): void;
 		/**
 		 * Sets the image associated with this dock icon.
 		 *
-		 * Note: This API is only available on Mac.
+		 * Note: This API is only available on macOS.
 		 */
 		setIcon(icon: NativeImage | string): void;
 	}
@@ -615,17 +615,17 @@ declare namespace Electron {
 		on(event: 'app-command', listener: (event: Event, command: string) => void): this;
 		/**
 		 * Emitted when scroll wheel event phase has begun.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		on(event: 'scroll-touch-begin', listener: Function): this;
 		/**
 		 * Emitted when scroll wheel event phase has ended.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		on(event: 'scroll-touch-end', listener: Function): this;
 		/**
 		 * Emitted on 3-finger swipe.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		on(event: 'swipe', listener: (event: Event, direction: SwipeDirection) => void): this;
 		on(event: string, listener: Function): this;
@@ -762,7 +762,7 @@ declare namespace Electron {
 		 * not included within the aspect ratio calculations.
 		 * This API already takes into account the difference between a window’s size and its content size.
 		 *
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 */
 		setAspectRatio(aspectRatio: number, extraSize?: Dimension): void;
 		/**
@@ -815,31 +815,31 @@ declare namespace Electron {
 		isResizable(): boolean;
 		/**
 		 * Sets whether the window can be moved by user. On Linux does nothing.
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 */
 		setMovable(movable: boolean): void;
 		/**
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 * @returns Whether the window can be moved by user. On Linux always returns true.
 		 */
 		isMovable(): boolean;
 		/**
 		 * Sets whether the window can be manually minimized by user. On Linux does nothing.
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 */
 		setMinimizable(minimizable: boolean): void;
 		/**
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 * @returns Whether the window can be manually minimized by user. On Linux always returns true.
 		 */
 		isMinimizable(): boolean;
 		/**
 		 * Sets whether the window can be manually maximized by user. On Linux does nothing.
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 */
 		setMaximizable(maximizable: boolean): void;
 		/**
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 * @returns Whether the window can be manually maximized by user. On Linux always returns true.
 		 */
 		isMaximizable(): boolean;
@@ -853,11 +853,11 @@ declare namespace Electron {
 		isFullScreenable(): boolean;
 		/**
 		 * Sets whether the window can be manually closed by user. On Linux does nothing.
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 */
 		setClosable(closable: boolean): void;
 		/**
-		 * Note: This API is available only on OS X and Windows.
+		 * Note: This API is available only on macOS and Windows.
 		 * @returns Whether the window can be manually closed by user. On Linux always returns true.
 		 */
 		isClosable(): boolean;
@@ -893,8 +893,8 @@ declare namespace Electron {
 		 */
 		getTitle(): string;
 		/**
-		 * Changes the attachment point for sheets on Mac OS X.
-		 * Note: This API is available only on OS X.
+		 * Changes the attachment point for sheets on macOS.
+		 * Note: This API is available only on macOS.
 		 */
 		setSheetOffset(offsetY: number, offsetX?: number): void;
 		/**
@@ -914,7 +914,7 @@ declare namespace Electron {
 		 */
 		isKiosk(): boolean;
 		/**
-		 * The native type of the handle is HWND on Windows, NSView* on OS X,
+		 * The native type of the handle is HWND on Windows, NSView* on macOS,
 		 * and Window (unsigned long) on Linux.
 		 * @returns The platform-specific handle of the window as Buffer.
 		 */
@@ -939,22 +939,22 @@ declare namespace Electron {
 		/**
 		 * Sets the pathname of the file the window represents, and the icon of the
 		 * file will show in window's title bar.
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 */
 		setRepresentedFilename(filename: string): void;
 		/**
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 * @returns The pathname of the file the window represents.
 		 */
 		getRepresentedFilename(): string;
 		/**
 		 * Specifies whether the window’s document has been edited, and the icon in
 		 * title bar will become grey when set to true.
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 */
 		setDocumentEdited(edited: boolean): void;
 		/**
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 * @returns Whether the window's document has been edited.
 		 */
 		isDocumentEdited(): boolean;
@@ -979,7 +979,7 @@ declare namespace Electron {
 		reload(): void;
 		/**
 		 * Sets the menu as the window top menu.
-		 * Note: This API is not available on OS X.
+		 * Note: This API is not available on macOS.
 		 */
 		setMenu(menu: Menu): void;
 		/**
@@ -1002,11 +1002,11 @@ declare namespace Electron {
 		setOverlayIcon(overlay: NativeImage, description: string): void;
 		/**
 		 * Sets whether the window should have a shadow. On Windows and Linux does nothing.
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 */
 		setHasShadow(hasShadow: boolean): void;
 		/**
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 * @returns whether the window has a shadow. On Windows and Linux always returns true.
 		 */
 		hasShadow(): boolean;
@@ -1018,12 +1018,12 @@ declare namespace Electron {
 		setThumbarButtons(buttons: ThumbarButton[]): boolean;
 		/**
 		 * Same as webContents.showDefinitionForSelection().
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 */
 		showDefinitionForSelection(): void;
 		/**
 		 * Changes window icon.
-		 * Note: This API is not available on OS X.
+		 * Note: This API is not available on macOS.
 		 */
 		setIcon(icon: NativeImage): void;
 		/**
@@ -1200,7 +1200,7 @@ declare namespace Electron {
 		 */
 		directWrite?: boolean;
 		/**
-		 * Enables scroll bounce (rubber banding) effect on OS X.
+		 * Enables scroll bounce (rubber banding) effect on macOS.
 		 * Default: false.
 		 */
 		scrollBounce?: boolean;
@@ -1352,13 +1352,13 @@ declare namespace Electron {
 		alwaysOnTop?: boolean;
 		/**
 		 * Whether the window should show in fullscreen.
-		 * When explicitly set to false the fullscreen button will be hidden or disabled on OS X.
+		 * When explicitly set to false the fullscreen button will be hidden or disabled on macOS.
 		 * Default: false.
 		 */
 		fullscreen?: boolean;
 		/**
 		 * Whether the window can be put into fullscreen mode.
-		 * On OS X, also whether the maximize/zoom button should toggle full screen mode or maximize window.
+		 * On macOS, also whether the maximize/zoom button should toggle full screen mode or maximize window.
 		 * Default: true.
 		 */
 		fullscreenable?: boolean;
@@ -1428,7 +1428,7 @@ declare namespace Electron {
 		backgroundColor?: string;
 		/**
 		 * Whether window should have a shadow.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 * Default: true.
 		 */
 		hasShadow?: boolean;
@@ -1654,7 +1654,7 @@ declare namespace Electron {
 		/**
 		 * You are required to call this method before using other crashReporter APIs.
 		 *
-		 * Note: On OS X, Electron uses a new crashpad client, which is different from breakpad
+		 * Note: On macOS, Electron uses a new crashpad client, which is different from breakpad
 		 * on Windows and Linux. To enable the crash collection feature, you are required to call
 		 * the crashReporter.start API to initialize crashpad in the main process and in each
 		 * renderer process from which you wish to collect crash reports.
@@ -1877,7 +1877,7 @@ declare namespace Electron {
 		/**
 		 * The value will be returned when user cancels the dialog instead of clicking the buttons of the dialog.
 		 * By default it is the index of the buttons that have "cancel" or "no" as label,
-		 * or 0 if there is no such buttons. On OS X and Windows the index of "Cancel" button
+		 * or 0 if there is no such buttons. On macOS and Windows the index of "Cancel" button
 		 * will always be used as cancelId, not matter whether it is already specified.
 		 */
 		cancelId?: number;
@@ -2142,13 +2142,13 @@ declare namespace Electron {
 		 *
 		 * Platform notice:
 		 *   On Linux and Windows, the Command key would not have any effect,
-		 *   you can use CommandOrControl which represents Command on OS X and Control on
+		 *   you can use CommandOrControl which represents Command on macOS and Control on
 		 *   Linux and Windows to define some accelerators.
 		 *
-		 *   Use Alt instead of Option. The Option key only exists on OS X, whereas
+		 *   Use Alt instead of Option. The Option key only exists on macOS, whereas
 		 *   the Alt key is available on all platforms.
 		 *
-		 *   The Super key is mapped to the Windows key on Windows and Linux and Cmd on OS X.
+		 *   The Super key is mapped to the Windows key on Windows and Linux and Cmd on macOS.
 		 *
 		 * Available modifiers:
 		 *   Command (or Cmd for short)
@@ -2234,7 +2234,7 @@ declare namespace Electron {
 		 */
 		constructor();
 		/**
-		 * Sets menu as the application menu on OS X. On Windows and Linux, the menu
+		 * Sets menu as the application menu on macOS. On Windows and Linux, the menu
 		 * will be set as each window's top menu.
 		 */
 		static setApplicationMenu(menu: Menu): void;
@@ -2247,7 +2247,7 @@ declare namespace Electron {
 		 * This is used for emulating default Cocoa menu behaviors,
 		 * usually you would just use the role property of MenuItem.
 		 *
-		 * Note: This method is OS X only.
+		 * Note: This method is macOS only.
 		 */
 		static sendActionToFirstResponder(action: string): void;
 		/**
@@ -2314,8 +2314,8 @@ declare namespace Electron {
 		 */
 		toDataURL(): string;
 		/**
-		 * The native type of the handle is NSImage* on OS X.
-		 * Note: This is only implemented on OS X.
+		 * The native type of the handle is NSImage* on macOS.
+		 * Note: This is only implemented on macOS.
 		 * @returns The platform-specific handle of the image as Buffer.
 		 */
 		getNativeHandle(): Buffer;
@@ -3110,20 +3110,20 @@ declare namespace Electron {
 		/**
 		 * @returns If the system is in Dark Mode.
 		 *
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		isDarkMode(): boolean;
 		/**
-		 * Subscribes to native notifications of OS X, callback will be called when the corresponding event happens.
+		 * Subscribes to native notifications of macOS, callback will be called when the corresponding event happens.
 		 * The id of the subscriber is returned, which can be used to unsubscribe the event.
 		 *
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		subscribeNotification(event: string, callback: (event: Event, userInfo: Object) => void): number;
 		/**
 		 * Removes the subscriber with id.
 		 *
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		unsubscribeNotification(id: number): void;
 		/**
@@ -3137,7 +3137,7 @@ declare namespace Electron {
 		/**
 		 * Get the value of key in system preferences.
 		 *
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		getUserDefault(key: string, type: 'string' | 'boolean' | 'integer' | 'float' | 'double' | 'url' | 'array' | 'dictionary'): any;
 		/**
@@ -3158,17 +3158,17 @@ declare namespace Electron {
 	interface Tray extends NodeJS.EventEmitter {
 		/**
 		 * Emitted when the tray icon is clicked.
-		 * Note: The bounds payload is only implemented on OS X and Windows.
+		 * Note: The bounds payload is only implemented on macOS and Windows.
 		 */
 		on(event: 'click', listener: (modifiers: Modifiers, bounds: Bounds) => void): this;
 		/**
 		 * Emitted when the tray icon is right clicked.
-		 * Note: This is only implemented on OS X and Windows.
+		 * Note: This is only implemented on macOS and Windows.
 		 */
 		on(event: 'right-click', listener: (modifiers: Modifiers, bounds: Bounds) => void): this;
 		/**
 		 * Emitted when the tray icon is double clicked.
-		 * Note: This is only implemented on OS X and Windows.
+		 * Note: This is only implemented on macOS and Windows.
 		 */
 		on(event: 'double-click', listener: (modifiers: Modifiers, bounds: Bounds) => void): this;
 		/**
@@ -3188,27 +3188,27 @@ declare namespace Electron {
 		on(event: 'balloon-closed', listener: Function): this;
 		/**
 		 * Emitted when any dragged items are dropped on the tray icon.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		on(event: 'drop', listener: Function): this;
 		/**
 		 * Emitted when dragged files are dropped in the tray icon.
-		 * Note: This is only implemented on OS X
+		 * Note: This is only implemented on macOS
 		 */
 		on(event: 'drop-files', listener: (event: Event, files: string[]) => void): this;
 		/**
 		 * Emitted when a drag operation enters the tray icon.
-		 * Note: This is only implemented on OS X
+		 * Note: This is only implemented on macOS
 		 */
 		on(event: 'drag-enter', listener: Function): this;
 		/**
 		 * Emitted when a drag operation exits the tray icon.
-		 * Note: This is only implemented on OS X
+		 * Note: This is only implemented on macOS
 		 */
 		on(event: 'drag-leave', listener: Function): this;
 		/**
 		 * Emitted when a drag operation ends on the tray or ends at another location.
-		 * Note: This is only implemented on OS X
+		 * Note: This is only implemented on macOS
 		 */
 		on(event: 'drag-end', listener: Function): this;
 		on(event: string, listener: Function): this;
@@ -3234,12 +3234,12 @@ declare namespace Electron {
 		setToolTip(toolTip: string): void;
 		/**
 		 * Sets the title displayed aside of the tray icon in the status bar.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		setTitle(title: string): void;
 		/**
 		 * Sets whether the tray icon is highlighted when it is clicked.
-		 * Note: This is only implemented on OS X.
+		 * Note: This is only implemented on macOS.
 		 */
 		setHighlightMode(highlight: boolean): void;
 		/**
@@ -3255,7 +3255,7 @@ declare namespace Electron {
 		 * Pops up the context menu of tray icon. When menu is passed,
 		 * the menu will showed instead of the tray's context menu.
 		 * The position is only available on Windows, and it is (0, 0) by default.
-		 * Note: This is only implemented on OS X and Windows.
+		 * Note: This is only implemented on macOS and Windows.
 		 */
 		popUpContextMenu(menu?: Menu, position?: Point): void;
 		/**
@@ -3742,7 +3742,7 @@ declare namespace Electron {
 		savePage(fullPath: string, saveType: 'HTMLOnly' | 'HTMLComplete' | 'MHTML', callback?: (eror: Error) => void): boolean;
 		/**
 		 * Shows pop-up dictionary that searches the selected word on the page.
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 */
 		showDefinitionForSelection(): void;
 		/**
@@ -4532,7 +4532,7 @@ declare namespace Electron {
 		sendInputEvent(event: SendInputEvent): void
 		/**
 		 * Shows pop-up dictionary that searches the selected word on the page.
-		 * Note: This API is available only on OS X.
+		 * Note: This API is available only on macOS.
 		 */
 		showDefinitionForSelection(): void;
 		/**
@@ -4923,7 +4923,7 @@ declare namespace NodeJS {
 		 * Sets the file descriptor soft limit to maxDescriptors or the OS hard limit,
 		 * whichever is lower for the current process.
 		 *
-		 * Note: This API is only available on Mac and Linux.
+		 * Note: This API is only available on macOS and Linux.
 		 */
 		setFdLimit(maxDescriptors: number): void;
 		/**

From 7eb02641a2b08578299d235b98de050838ca077f Mon Sep 17 00:00:00 2001
From: Thomas Achleitner <t.achleitner@meteocontrol.de>
Date: Wed, 22 Jun 2016 13:21:32 +0200
Subject: [PATCH 263/278] add zmq.Socket.pause and zmq.Socket.resume

---
 node_zeromq/zmq-tests.ts |  9 +++++++++
 node_zeromq/zmq.d.ts     | 13 +++++++++++++
 2 files changed, 22 insertions(+)

diff --git a/node_zeromq/zmq-tests.ts b/node_zeromq/zmq-tests.ts
index a62d97a6ca..0c7e031a12 100644
--- a/node_zeromq/zmq-tests.ts
+++ b/node_zeromq/zmq-tests.ts
@@ -42,3 +42,12 @@ function test5() {
     sock.monitor();
     sock.monitor(10);
 }
+
+function test6() {
+    var sock = zmq.socket(zmq.types.dealer);
+    sock.bind('tcp://127.0.0.1', err => {
+        sock.send("some work");
+    });
+    sock.pause();
+    sock.resume();
+}
diff --git a/node_zeromq/zmq.d.ts b/node_zeromq/zmq.d.ts
index 636a014aa6..838c3c6cd4 100644
--- a/node_zeromq/zmq.d.ts
+++ b/node_zeromq/zmq.d.ts
@@ -184,6 +184,19 @@ declare module 'zmq' {
          */
         on(eventName: string, callback: (...buffer: Buffer[]) => void): void;
 
+        /**
+         * Set socket to pause mode
+         * no data will be emit until resume() is called
+         * all send() calls will be queued
+             */
+        pause(): void;
+
+        /**
+         * Set a socket back to normal work mode
+         * triggers a _flushReads and _flushWrites
+         */
+        resume(): void;
+
         // Socket Options
         _fd: any;
         _ioevents: any;

From c7f09bd50f5520f19fc1df7aed665ea10aa115c5 Mon Sep 17 00:00:00 2001
From: marc <mcfisher83@gmail.com>
Date: Wed, 22 Jun 2016 11:20:46 -0500
Subject: [PATCH 264/278] Added typings for the node driver for Cassandra.

---
 nodejs-driver/cassandra.d.ts     | 761 +++++++++++++++++++++++++++++++
 nodejs-driver/cassandra.tests.ts |  11 +
 2 files changed, 772 insertions(+)
 create mode 100644 nodejs-driver/cassandra.d.ts
 create mode 100644 nodejs-driver/cassandra.tests.ts

diff --git a/nodejs-driver/cassandra.d.ts b/nodejs-driver/cassandra.d.ts
new file mode 100644
index 0000000000..93a94b2e3f
--- /dev/null
+++ b/nodejs-driver/cassandra.d.ts
@@ -0,0 +1,761 @@
+// Type definitions for nodejs-driver v0.8.2
+// Project: https://github.com/datastax/nodejs-driver
+// Definitions by: Marc Fisher <http://github.com/Svjard>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+/// <reference path="../long/long.d.ts" />
+
+declare module "cassandra" {
+  type Callback = Function;
+  type ResultCallback = (err: Error, result: types.ResultSet) => void;
+
+  import * as events from "events";
+  import * as stream from "stream";
+  import _Long = require("long");
+
+  namespace policies {
+    namespace addressResolution {
+      var EC2MultiRegionTranslator: EC2MultiRegionTranslatorStatic; 
+
+      interface AddressTranslator {
+        translate(address: string, port: number, callback: Callback): void;  
+      }
+
+      interface EC2MultiRegionTranslatorStatic {
+        new(): EC2MultiRegionTranslator;
+      }
+
+      interface EC2MultiRegionTranslator extends AddressTranslator {
+        logError(address: string, err: Error): void;
+      }
+    }
+
+    namespace loadBalancing {
+      var DCAwareRoundRobinPolicy: DCAwareRoundRobinPolicyStatic;
+      var RoundRobinPolicy: RoundRobinPolicyStatic;
+      var TokenAwarePolicy: TokenAwarePolicyStatic;
+      var WhiteListPolicy: WhiteListPolicyStatic;
+
+      interface LoadBalancingPolicy {
+        init(client: Client, hosts: HostMap, callback: Callback): void;
+        getDistance(host: Host): types.distance;
+        newQueryPlan(keyspace: string, queryOptions: any, callback: Callback): void;
+      }
+
+      interface DCAwareRoundRobinPolicyStatic {
+        new(localDc?: string, usedHostsPerRemoteDc?: number): DCAwareRoundRobinPolicy;
+      }
+
+      interface DCAwareRoundRobinPolicy extends LoadBalancingPolicy {
+        localHostsArray: Array<Host>;
+        remoteHostsArray: Array<Host>;
+      }
+
+      interface RoundRobinPolicyStatic {
+        new(): RoundRobinPolicy;
+      }
+
+      interface RoundRobinPolicy extends LoadBalancingPolicy {}
+
+      interface TokenAwarePolicyStatic {
+        new(childPolicy: LoadBalancingPolicy): TokenAwarePolicy;
+      }
+
+      interface TokenAwarePolicy extends LoadBalancingPolicy {}
+
+      interface WhiteListPolicyStatic {
+        new(childPolicy: LoadBalancingPolicy, whiteList: Array<string>): WhiteListPolicy;
+      }
+
+      interface WhiteListPolicy extends LoadBalancingPolicy {}
+    }
+
+    namespace reconnection {
+      var ConstantReconnectionPolicy: ConstantReconnectionPolicyStatic;
+      var ExponentialReconnectionPolicy: ExponentialReconnectionPolicyStatic;
+
+      interface ReconnectionPolicy {
+        newSchedule(): {next: Function};
+      }
+
+      interface ConstantReconnectionPolicyStatic {
+        new(delay: number): ConstantReconnectionPolicy;
+      }
+
+      interface ConstantReconnectionPolicy extends ReconnectionPolicy {}
+
+      interface ExponentialReconnectionPolicyStatic {
+        new(baseDelay: number, maxDelay: number, startWithNoDelay: boolean): ExponentialReconnectionPolicy;
+      }
+
+      interface ExponentialReconnectionPolicy extends ReconnectionPolicy {}
+    }
+
+    namespace retry {
+      var RetryPolicy: RetryPolicyStatic;
+
+      interface DecisionInfo {
+        decision: number;
+        consistency: number;
+      }
+
+      interface RequestInfo {
+        request: any,
+        nbRetry: number
+      }
+
+      enum retryDecision {
+        rethrow = 0,
+        retry,
+        ignore
+      }
+
+      interface RetryPolicyStatic {
+        new (): RetryPolicy;
+
+        retryDecision: any;
+      }
+
+      interface RetryPolicy {
+        onReadTimeout(requestInfo: RequestInfo, consistency: types.consistencies, received: number, blockFor: number, isDataPresent: boolean): DecisionInfo;
+        onUnavailable(requestInfo: RequestInfo, consistency: types.consistencies, required: number, alive: number): DecisionInfo;
+        onWriteTimeout(requestInfo: RequestInfo, consistency: types.consistencies, received: number, blockFor: number, writeType: string): DecisionInfo;
+        rethrowResult(): { decision: retryDecision };
+        retryResult(): { decision: retryDecision, consistency: types.consistencies, useCurrentHost: boolean };
+      }
+    }
+  }
+
+  namespace types {
+    var BigDecimal: BigDecimalStatic;
+    var InetAddress: InetAddressStatic;
+    var Integer: IntegerStatic;
+    var LocalDate: LocalDateStatic;
+    var LocalTime: LocalTimeStatic;
+    var Long: _Long;
+    var ResultSet: ResultSetStatic;
+    var ResultStream: ResultStreamStatic;
+    var Row: RowStatic;
+    var TimeUuid: TimeUuidStatic;
+    var Tuple: TupleStatic;
+    var Uuid: UuidStatic;
+
+    enum consistencies { 
+      any = 0,
+      one,
+      two,
+      three,
+      quorum,
+      all,
+      localQuorm,
+      eachQuorum,
+      serial,
+      localSerial,
+      localOne
+    }
+    
+    enum dataTypes {
+      custom = 0,
+      ascii,
+      bigint,
+      blob,
+      boolean,
+      counter,
+      decimal,
+      double,
+      float,
+      int,
+      text,
+      timestamp,
+      uuid,
+      varchar,
+      varint,
+      timeuuid,
+      inet,
+      date,
+      time,
+      smallint,
+      tinyint,
+      list,
+      map,
+      set,
+      udt,
+      tuple
+    }
+
+    enum distance {
+      local = 0,
+      remote,
+      ignored
+    }
+
+    interface responseErrorCodes { [key:string]:number; }
+    interface unset { unset: boolean; }
+
+    function generateTimestamp(date?: Date, microseconds?: number): _Long;
+    function timeuuid(options?: {msecs: number | Date, node: Buffer, clockseq: number, nsecs: number}, buffer?: Buffer, offset?: number): string;
+
+    interface BigDecimalStatic {
+      new (unscaledValue: number, scale: number): BigDecimal;
+
+      fromBuffer(buf: Buffer): BigDecimal;
+      toBuffer(value: BigDecimal): Buffer;
+      fromString(value: string): BigDecimal;
+      fromNumber(value: number): BigDecimal;
+    }
+    
+    interface BigDecimal {
+      equals(other: BigDecimal): boolean;
+      inspect(): string;
+      notEquals(other: BigDecimal): boolean;
+      compare(other: BigDecimal): number;
+      subtract(other: BigDecimal): BigDecimal;
+      add(other: BigDecimal): BigDecimal;
+      greaterThan(other: BigDecimal): boolean;
+      isNegative(): boolean;
+      isZero(): boolean;
+      toString(): string;
+      toNumber(): number;
+      toJSON(): string;
+    }
+
+    interface InetAddressStatic {
+      new(buffer: Buffer): InetAddress;
+
+      fromString(value: string): InetAddress;
+    }
+
+    interface InetAddress {
+      equals(other: InetAddress): boolean;
+      getBuffer(): Buffer;
+      inspect(): string;
+      toString(): string;
+      toJSON(): string;
+
+      length: number;
+      version: number;
+    }
+
+    interface IntegerStatic {
+      new(bits: Array<number>, sign: number): Integer;
+      
+      fromInt(value: number): Integer;
+      fromNumber(value: number): Integer;
+      fromBits(bits: Array<number>): Integer;
+      fromString(str: string, opt_radix?: number): Integer;
+      fromBuffer(bits: Buffer): Integer;
+      toBuffer(value: Integer): Buffer;
+
+      ZERO: Integer;
+      ONE: Integer;
+    }
+
+    interface Integer {
+      toInt(): number;
+      toNumber(): number;
+      toString(opt_radix?: number): string;
+      getBits(index: number): number;
+      getBitsUnsigned(index: number): number;
+      getSign(): number;
+      isZero(): boolean;
+      isNegative(): boolean;
+      isOdd(): boolean;
+      equals(other: Integer): boolean;
+      notEquals(other: Integer): boolean;
+      greaterThan(other: Integer): boolean;
+      greaterThanOrEqual(other: Integer): boolean;
+      lessThan(other: Integer): boolean;
+      lessThanOrEqual(other: Integer): boolean;
+      compare(other: Integer): number;
+      shorten(numBits: number): Integer;
+      negate(): Integer;
+      add(other: Integer): Integer;
+      subtract(other: Integer): Integer;
+      multiply(other: Integer): Integer;
+      divide(other: Integer): Integer;
+      modulo(other: Integer): Integer;
+      not(): Integer;
+      and(other: Integer): Integer;
+      or(other: Integer): Integer;
+      xor(other: Integer): Integer;
+      shiftLeft(numBits: number): Integer;
+      shiftRight(numBits: number): Integer;
+      inspect(): string;
+      abs(): Integer;
+      toJSON(): string;
+    }
+
+    interface LocalDateStatic {
+      new(year: number, month: number, day: number): LocalDate;
+
+      now(): LocalDate;
+      utcNow(): LocalDate;
+      fromDate(date: Date): LocalDate;
+      fromString(value: string): LocalDate;
+      fromBuffer(buffer: Buffer): LocalDate;
+    }
+    
+    interface LocalDate {
+      _value: number;
+      year: number;
+      month: number;
+      day: number;
+
+      equals(other: LocalDate): boolean;
+      inspect(): string;
+      toBuffer(): Buffer;
+      toString(): string;
+      toJSON(): string;
+    }
+
+    interface LocalTimeStatic {
+      new (totalNanoseconds: _Long): LocalTime;
+
+      fromString(value: string): LocalTime;
+      now(nanoseconds?: number): LocalTime;
+      fromDate(date: Date, nanoseconds: number): LocalTime;
+      fromMilliseconds(milliseconds: number, nanoseconds?: number): LocalTime;
+      fromBuffer(value: Buffer): LocalTime;
+    }
+
+    interface LocalTime {
+      hour: number;
+      minute: number;
+      second: number;
+      nanosecond: number;
+
+      compare(other: LocalTime): boolean;
+      equals(other: LocalTime): boolean;
+      getTotalNanoseconds(): _Long;
+      inspect(): string;
+      toBuffer(): Buffer;
+      toString(): string;
+      toJSON(): string;
+    }
+
+    interface ResultSetStatic {
+      new(response: any, host: string, triedHost: { [key:string]: any }, consistency: consistencies): ResultSet;
+    }
+
+    interface ResultSet {
+      info: {
+        queriedHost: Host,
+        triedHosts: { [key:string]:string; },
+        achievedConsistency: consistencies,
+        traceId: Uuid,
+        warnings: Array<string>,
+        customPayload: any
+      };
+      rows: Array<Row>;
+      rowLength: number;
+      columns: Array<{ [key:string]:string; }>;
+      pageState: string;
+      nextPage: any; // function
+
+      first(): Row;
+      getPageState(): string;
+      getColumns(): Array<{ [key:string]:string; }>;
+    }
+
+    interface ResultStreamStatic {
+      new (opt: any): ResultSet;
+    }
+
+    interface ResultStream extends stream.Readable {
+      buffer: Buffer;
+      paused: boolean;
+
+      _read(): void;
+      _valve(readNext: Function): void;
+      add(chunk: Buffer): void;
+    }
+
+    interface RowStatic {
+      new(columns: Array<{ [key:string]:string; }>): Row;
+    }
+
+    interface Row {
+      get(columnName: string|number): { [key:string]:any; };
+      values(): Array<{ [key:string]:any; }>;
+      keys(): Array<string>;
+      forEach(callback: Callback): void;
+    }
+
+    interface TimeUuidStatic {
+      new (value?: Date, ticks?: number, nodeId?: string|Buffer, clockId?: string|Buffer): TimeUuid;
+      
+      fromDate(date: Date, ticks?: number, nodeId?: string|Buffer, clockId?: string|Buffer): TimeUuid;
+      fromString(value: string): TimeUuid;
+      min(date: Date, ticks?: number): TimeUuid;
+      max(date: Date, ticks?: number): TimeUuid;
+      now(nodeId?: string|Buffer, clockId?: string|Buffer): TimeUuid;
+    }
+
+    interface TimeUuid extends Uuid {
+      getDatePrecision(): { date: Date, ticks: number };
+      getDate(): Date;
+      getNodeId(): Buffer;
+      getNodeIdString(): string;
+    }
+
+    interface TupleStatic {
+      new (...arguments: Array<any>): Tuple;
+
+      fromArray(elements: Array<any>): Tuple;
+    }
+
+    interface Tuple {
+      elements: Array<any>;
+      length: number;
+      
+      get(index: number): any;
+      toString(): string;
+      toJSON(): string;
+      values(): Array<any>;
+    }
+
+    interface UuidStatic {
+      new (buffer: Buffer): Uuid;
+
+      fromString(value: string): Uuid;
+      random(): Uuid;
+    }
+
+    interface Uuid {
+      buffer: Buffer;
+
+      getBuffer(): Buffer;
+      equals(other: types.Uuid): boolean;
+      toString(): string;
+      inspect(): string;
+      toJSON(): string;
+    }
+  }
+
+  var Client: ClientStatic;
+  var Host: HostStatic;
+  var HostMap: HostMapStatic;
+  var Encoder: EncoderStatic;
+
+  interface ClientOptions {
+    contactPoints: Array<string>,
+    keyspace: string,
+    policies?: {
+      addressResolution?: policies.addressResolution.AddressTranslator,
+      loadBalancing?: policies.loadBalancing.LoadBalancingPolicy,
+      reconnection?: policies.reconnection.ReconnectionPolicy,
+      retry?: policies.retry.RetryPolicy
+    },
+    queryOptions?: QueryOptions,
+    pooling?: {
+      heartBeatInterval: number,
+      coreConnectionsPerHost: { [key:number]:number; },
+      warmup: boolean;
+    },
+    protocolOptions?: {
+      port: number,
+      maxSchemaAgreementWaitSeconds: number,
+      maxVersion: number
+    },
+    socketOptions?: {
+      connectTimeout: number,
+      defunctReadTimeoutThreshold: number,
+      keepAlive: boolean,
+      keepAliveDelay: number,
+      readTimeout: number,
+      tcpNoDelay: boolean,
+      coalescingThreshold: number
+    },
+    authProvider?: auth.AuthProvider,
+    sslOptions?: any,
+    encoding?: {
+      map: Function,
+      set: Function,
+      copyBuffer: boolean,
+      useUndefinedAsUnset: boolean
+    }
+  }
+
+  interface QueryOptions {
+    autoPage?: boolean;
+    captureStackTrace?: boolean;
+    consistency: number;
+    customPayload?: any;
+    fetchSize?: number;
+    hints: Array<string> | Array<Array<string>>;
+    logged?: boolean;
+    pageState?: Buffer|string;
+    prepare?: boolean;
+    readTimeout?: number;
+    retry?: policies.retry.RetryPolicy;
+    retryOnTimeout?: boolean;
+    routingIndexes?: Array<number>;
+    routingKey?: Buffer | Array<Buffer>;
+    routingNames?: Array<string>;
+    serialConsistency?: number;
+    timestamp?: number | _Long;
+    traceQuery?: boolean;
+  }
+
+  interface ClientStatic {
+    new(options?: ClientOptions): Client;
+  }
+
+  interface Client extends events.EventEmitter {
+    hosts: HostMap;
+    keyspace: string;
+    metadata: metadata.Metadata;
+
+    batch(queries: Array<string>|Array<{query: string, params?: any}>, options: QueryOptions, callback: ResultCallback): void;
+    connect(callback: Callback): void;
+    eachRow(query: string, params?: any, options?: QueryOptions, rowCallback?: Callback, callback?: Callback): void;
+    execute(query: string, params?: any, options?: QueryOptions, callback?: ResultCallback): void;
+    getReplicas(keyspace: string, token: Buffer): Array<any>; // TODO: Should this be a more explicit return?
+    shutdown(callback?: Callback): void;
+    stream(query: string, params?: any, options?: QueryOptions, callback?: Callback): void;
+  }
+
+  interface HostStatic {
+    new(address: string, protocolVersion: number, options: ClientOptions): Host;
+  }
+
+  interface Host extends events.EventEmitter {
+    address: string;
+    cassandraVersion: string;
+    dataCenter: string;
+    rack: string;
+    tokens: Array<string>;
+
+    canBeConsideredAsUp(): boolean;
+    getCassandraVersion(): Array<number>;
+    isUp(): boolean;
+  }
+
+  interface HostMapStatic {
+    new (): HostMap;
+  }
+
+  interface HostMap extends events.EventEmitter {
+    length: number;
+
+    forEach(callback: Callback): void;
+    get(key: string): Host;
+    keys(): Array<string>;
+    remove(key: string): void;
+    removeMultiple(keys: Array<string>): void;
+    set(key: string, value: Host): void;
+    values(): Array<Host>;
+  }
+
+  interface EncoderStatic {
+    new(protocolVersion: number, options: ClientOptions) : Encoder; 
+  }
+
+  interface Encoder {
+    decode(buffer: Buffer, type: {code: number, info?: any}): void;
+    encode(value: any, typeInfo?: string|number|{code: number, info?: any}): Buffer;
+  }
+
+  namespace auth {
+    var Authenticator: AuthenticatorStatic;
+    var PlainTextAuthProvider: PlainTextAuthProviderStatic;
+
+    interface AuthenticatorStatic {
+      new (): Authenticator;
+    }
+
+    interface Authenticator {
+      evaluateChallenge(challenge: Buffer, callback: Callback): void;
+      initialResponse(callback: Callback): void;
+      onAuthenticationSuccess(token?: Buffer): void;
+    }
+
+    interface AuthProvider {
+      newAuthenticator(endpoint: string, name: string): void;
+    }
+
+    interface PlainTextAuthProviderStatic {
+      new (username: string, password: string): PlainTextAuthProvider;
+    }
+
+    interface PlainTextAuthProvider extends AuthProvider {
+      newAuthenticator(endpoint: string, name: string): void;
+    }
+  }
+
+  namespace errors {
+    abstract class DriverError {
+      constructor(message: string, constructor?: any);
+    }
+
+    class ArgumentError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class AuthenticationError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class DriverInternalError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class NoHostAvailableError extends DriverError {
+      constructor(innerErrors: any, message?: string); 
+    }
+
+    class NotSupportedError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class OperationTimedOutError extends DriverError {}
+
+    class ResponseError extends DriverError {
+      constructor(code: number, message: string); 
+    }
+  }
+
+  namespace metadata {
+    var Aggregate: AggregateStatic;
+    var Index: IndexStatic;
+    var MaterializedView: MaterializedViewStatic;
+    var Metadata: MetadataStatic;
+    var SchemaFunction: SchemaFunctionStatic;
+    var TableMetadata: TableMetadataStatic;
+
+    type caching = "all" | "keys_only" | "rows_only" | "none";
+
+    interface AggregateStatic {
+      new (): Aggregate;
+    }
+
+    interface Aggregate {
+      argumentTypes: Array<{ code: number, info: any}>;
+      finalFunction: string;
+      initCondition: string;
+      keyspaceName: string,
+      returnType: string;
+      signature: Array<string>;
+      stateFunction: string;
+      stateType: string;
+    }
+
+    interface DataTypeInfo {
+      code: number,
+      info: string | DataTypeInfo | Array<DataTypeInfo>,
+      options: {
+        frozen: boolean,
+        reversed: boolean
+      }
+    }
+
+    interface ColumnInfo {
+      name: string,
+      type: DataTypeInfo
+    }
+
+    interface DataCollection {
+      bloomFilterFalsePositiveChance: number;
+      caching: caching;
+      clusterKeys: Array<{ c: ColumnInfo, index: number, order: string }>;
+      clusteringOrder: Array<string>;
+      columns: Array<ColumnInfo>;
+      columnsByName: { [key: string]: ColumnInfo };
+      comment: string;
+      compactionClass: string;
+      compactionOptions: any;
+      compression: any;
+      crcCheckChange?: number;
+      defaultTtl: number;
+      extensions: any;
+      gcGraceSeconds: number;
+      localReadRepairChance: number;
+      maxIndexInterval?: number;
+      minIndexInterval?: number;
+      name: string;
+      partitionKeys: Array<{ c: ColumnInfo, index: number }>
+      populateCacheOnFlush: boolean;
+      readRepairChance: number;
+      speculateRetry: string;
+    }
+
+    enum IndexType {
+      custom = 0,
+      keys,
+      composites
+    }
+
+    interface IndexStatic {
+      new (name: string, target: string, kind: IndexType, options: Object): Index;
+      
+      fromRows(indexRows: Array<types.Row>): Array<Index>;
+      fromColumnRows(columnRows: Array<types.Row>, columnsByName: { [key:string]: ColumnInfo }): Array<Index>;
+    }
+
+    interface Index {
+      kind: IndexType;
+      name: string;
+      options: Object;
+      target: string;
+
+      isCompositesKind(): boolean;
+      isCustomKind(): boolean;
+      isKeysKind(): boolean;
+    }
+
+    interface MaterializedViewStatic {
+      new (name: string): MaterializedView;
+    }
+
+    interface MaterializedView extends DataCollection {}
+
+    interface MetadataStatic {
+      new (options: ClientOptions, controlConnection: any): Metadata;
+    }
+
+    interface Metadata {
+      clearPrepared(): void;
+
+      getAggregate(keyspaceName: string, name: string, signature: Array<string> | Array<{ code: number, info: any }>, callback: Callback): void;
+      getAggregates(keyspaceName: string, name: string, callback: Callback): void;
+      getFunction(keyspaceName: string, name: string, signature: Array<string> | Array<{ code: number, info: any }>, callback: Callback): void;
+      getFunctions(keyspaceName: string, name: string, callback: Callback): void;
+      getMaterializedView(keyspaceName: string, name: string, callback: Callback): void;
+      getReplicas(keyspaceName: string, tokenBuffer: Buffer): Array<any>;
+      getTable(keyspaceName: string, name: string, callback: Callback): void;
+      getTrace(traceId: types.Uuid, callback: Callback): void;
+      getUdt(keyspaceName: string, name: string, callback: Callback): void;
+      refreshKeyspace(name: string, callback?: Callback): void;
+      refreshKeyspaces(callback?: Callback): void;
+    }
+
+    interface SchemaFunctionStatic {
+      new (): SchemaFunction;
+    }
+
+    interface SchemaFunction {
+      argumentNames: Array<string>;
+      argumentTypes: Array<{ code: number, info: any}>;
+      body: string;
+      calledOnNullInput: boolean;
+      keyspaceName: string,
+      language: string;
+      name: string;
+      returnType: string;
+      signature: Array<string>;
+    }
+
+    interface TableMetadataStatic {
+      new (name: string): TableMetadata;
+    }
+
+    interface TableMetadata extends DataCollection {
+      indexes: Array<Index>;
+      indexInterval?: number;
+      isCompact: boolean;
+      memtableFlushPeriod: number;
+      replicateOnWrite: boolean;
+    }
+  }
+}
\ No newline at end of file
diff --git a/nodejs-driver/cassandra.tests.ts b/nodejs-driver/cassandra.tests.ts
new file mode 100644
index 0000000000..83b3eab679
--- /dev/null
+++ b/nodejs-driver/cassandra.tests.ts
@@ -0,0 +1,11 @@
+/// <reference path="cassandra.d.ts" />
+
+import * as cassandra from 'cassandra';
+import * as util from 'util';
+
+var client = new cassandra.Client({ contactPoints: ['h1', 'h2'], keyspace: 'ks1'});
+
+var query = 'SELECT email, last_name FROM user_profiles WHERE key=?';
+client.execute(query, ['guy'], function(err, result) {
+  console.log('got user profile with email ' + result.rows[0].email);
+});
\ No newline at end of file

From 9d59ec88f70d24f464c116c4d72586f8e6a4d42d Mon Sep 17 00:00:00 2001
From: Bohdan Moskalevskyi <msklvsk@users.noreply.github.com>
Date: Wed, 22 Jun 2016 23:15:53 +0300
Subject: [PATCH 265/278] fix some() return type

---
 wu/wu.d.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/wu/wu.d.ts b/wu/wu.d.ts
index fa7aa9db2c..90f6475ee8 100644
--- a/wu/wu.d.ts
+++ b/wu/wu.d.ts
@@ -50,7 +50,7 @@ declare namespace Wu {
 		slice<T>(iter: Iterable<T>): WuIterable<T>;
 		slice<T>(start: number, iter: Iterable<T>): WuIterable<T>;
 		slice<T>(start: number, stop: number, iter: Iterable<T>): WuIterable<T>;
-		some<T>(fn: Filter<T>, iter: Iterable<T>): WuIterable<T>;
+		some<T>(fn: Filter<T>, iter: Iterable<T>): boolean;
 		spreadMap<T>(fn: (...x: any[]) => T, iter: Iterable<any[]>): WuIterable<T>;
 		take<T>(n: number, iter: Iterable<T>): WuIterable<T>;
 		takeWhile<T>(fn: Filter<T>, iter: Iterable<T>): WuIterable<T>;
@@ -100,7 +100,7 @@ declare namespace Wu {
 		slice(): WuIterable<T>;
 		slice(start: number): WuIterable<T>;
 		slice(start: number, stop: number): WuIterable<T>;
-		some(fn: Filter<T>): WuIterable<T>;
+		some(fn: Filter<T>): boolean;
 		spreadMap(fn: (...x: any[]) => T, iter: Iterable<any[]>): WuIterable<T>;
 		take(n: number): WuIterable<T>;
 		takeWhile(fn: Filter<T>): WuIterable<T>;

From c89335812cb22f607fd5e40d95641ef659a7c4e0 Mon Sep 17 00:00:00 2001
From: "Remo H. Jansen" <remo.jansen@wolksoftware.com>
Date: Thu, 23 Jun 2016 01:44:26 +0100
Subject: [PATCH 266/278] Update inversify.d.ts

---
 inversify/inversify.d.ts | 86 ++++++++++++++++++++--------------------
 1 file changed, 43 insertions(+), 43 deletions(-)

diff --git a/inversify/inversify.d.ts b/inversify/inversify.d.ts
index 36e34a01a9..548cb8a912 100644
--- a/inversify/inversify.d.ts
+++ b/inversify/inversify.d.ts
@@ -31,9 +31,9 @@ declare namespace inversify {
         export interface Newable<T> {
             new(...args: any[]): T;
         }
-
+    
         export type ServiceIdentifier<T> = (string|Symbol|Newable<T>);
-
+    
         export interface Binding<T> extends Clonable<Binding<T>> {
             guid: string;
             moduleId: string;
@@ -49,66 +49,66 @@ declare namespace inversify {
             scope: number; // BindingScope
             type: number; // BindingType
         }
-
+    
         export interface Factory<T> extends Function {
             (...args: any[]): (((...args: any[]) => T)|T);
         }
-
+    
         export interface FactoryCreator<T> extends Function {
             (context: Context): Factory<T>;
         }
-
+    
         export interface Provider<T> extends Function {
             (): Promise<T>;
         }
-
+    
         export interface ProviderCreator<T> extends Function {
             (context: Context): Provider<T>;
         }
-
+    
         export interface PlanAndResolve<T> {
             (args: PlanAndResolveArgs): T[];
         }
-
+    
         export interface PlanAndResolveArgs {
             multiInject: boolean;
-            serviceIdentifier: (string|Symbol|Newable<any>);
+            serviceIdentifier: ServiceIdentifier<any>;
             target: Target;
             contextInterceptor: (contexts: Context) => Context;
         }
-
+    
         export interface Middleware extends Function {
             (next: PlanAndResolve<any>): PlanAndResolve<any>;
         }
-
+    
         export interface Context {
             guid: string;
             kernel: Kernel;
             plan: Plan;
             addPlan(plan: Plan): void;
         }
-
+    
         export interface ReflectResult {
             [key: string]: Metadata[];
         }
-
+    
         export interface Metadata {
             key: string;
             value: any;
         }
-
+    
         export interface Plan {
             parentContext: Context;
             rootRequest: Request;
         }
-
+    
         export interface Planner {
             createContext(kernel: Kernel): Context;
             createPlan(parentContext: Context, binding: Binding<any>, target: Target): Plan;
             getBindings<T>(kernel: Kernel, serviceIdentifier: ServiceIdentifier<T>): Binding<T>[];
             getActiveBindings(parentRequest: Request, target: Target): Binding<any>[];
         }
-
+    
         export interface QueryableString {
             startsWith(searchString: string): boolean;
             endsWith(searchString: string): boolean;
@@ -116,40 +116,40 @@ declare namespace inversify {
             equals(compareString: string): boolean;
             value(): string;
         }
-
+    
         export interface Request {
             guid: string;
-            serviceIdentifier: (string|Symbol|Newable<any>);
+            serviceIdentifier: ServiceIdentifier<any>;
             parentContext: Context;
             parentRequest: Request;
             childRequests: Request[];
             target: Target;
             bindings: Binding<any>[];
             addChildRequest(
-                serviceIdentifier: (string|Symbol|Newable<any>),
+                serviceIdentifier: ServiceIdentifier<any>,
                 bindings: (Binding<any>|Binding<any>[]),
                 target: Target
             ): Request;
         }
-
+    
         export interface Target {
             guid: string;
-            serviceIdentifier: (string|Symbol|Newable<any>);
+            serviceIdentifier: ServiceIdentifier<any>;
             name: QueryableString;
             metadata: Array<Metadata>;
             hasTag(key: string): boolean;
             isArray(): boolean;
-            matchesArray(name: string|Symbol|any): boolean;
+            matchesArray(name: string|Symbol|Newable<any>): boolean;
             isNamed(): boolean;
             isTagged(): boolean;
             matchesNamedTag(name: string): boolean;
             matchesTag(key: string): (value: any) => boolean;
         }
-
+    
         export interface Resolver {
             resolve<T>(context: Context): T;
         }
-
+    
         export interface Kernel {
             guid: string;
             bind<T>(serviceIdentifier: ServiceIdentifier<T>): BindingToSyntax<T>;
@@ -167,48 +167,48 @@ declare namespace inversify {
             snapshot(): void;
             restore(): void;
         }
-
+    
         export interface Bind extends Function {
             <T>(serviceIdentifier: ServiceIdentifier<T>): BindingToSyntax<T>;
         }
-
+    
         export interface KernelModule {
             guid: string;
             registry: (bind: Bind) => void;
         }
-
+    
         export interface KernelSnapshot {
             bindings: Lookup<Binding<any>>;
             middleware: PlanAndResolve<any>;
         }
-
+    
         export interface Clonable<T> {
             clone(): T;
         }
-
+    
         export interface Lookup<T> extends Clonable<Lookup<T>> {
-            add(serviceIdentifier: (string|Symbol|any), value: T): void;
-            get(serviceIdentifier: (string|Symbol|any)): Array<T>;
-            remove(serviceIdentifier: (string|Symbol|any)): void;
+            add(serviceIdentifier: ServiceIdentifier<any>, value: T): void;
+            get(serviceIdentifier: ServiceIdentifier<any>): Array<T>;
+            remove(serviceIdentifier: ServiceIdentifier<any>): void;
             removeByModuleId(moduleId: string): void;
-            hasKey(serviceIdentifier: (string|Symbol|any)): boolean;
+            hasKey(serviceIdentifier: ServiceIdentifier<any>): boolean;
         }
-
+    
         export interface KeyValuePair<T> {
-            serviceIdentifier: (string|Symbol|any);
+            serviceIdentifier: ServiceIdentifier<any>;
             value: Array<T>;
         }
-
+    
         export interface BindingInSyntax<T> {
             inSingletonScope(): BindingWhenOnSyntax<T>;
         }
-
+    
         export interface BindingInWhenOnSyntax<T> extends BindingInSyntax<T>, BindingWhenOnSyntax<T> {}
-
+    
         export interface BindingOnSyntax<T> {
             onActivation(fn: (context: Context, injectable: T) => T): BindingWhenSyntax<T>;
         }
-
+    
         export interface BindingToSyntax<T> {
             to(constructor: { new(...args: any[]): T; }): BindingInWhenOnSyntax<T>;
             toConstantValue(value: T): BindingWhenOnSyntax<T>;
@@ -216,12 +216,12 @@ declare namespace inversify {
             toConstructor<T2>(constructor: Newable<T2>): BindingWhenOnSyntax<T>;
             toFactory<T2>(factory: FactoryCreator<T2>): BindingWhenOnSyntax<T>;
             toFunction(func: T): BindingWhenOnSyntax<T>;
-            toAutoFactory<T2>(serviceIdentifier: (string|Symbol|Newable<T2>)): BindingWhenOnSyntax<T>;
+            toAutoFactory<T2>(serviceIdentifier: ServiceIdentifier<T2>): BindingWhenOnSyntax<T>;
             toProvider<T2>(provider: ProviderCreator<T2>): BindingWhenOnSyntax<T>;
         }
-
+    
         export interface BindingWhenOnSyntax<T> extends BindingWhenSyntax<T>, BindingOnSyntax<T> {}
-
+    
         export interface BindingWhenSyntax<T> {
             when(constraint: (request: Request) => boolean): BindingOnSyntax<T>;
             whenTargetNamed(name: string): BindingOnSyntax<T>;
@@ -238,7 +238,7 @@ declare namespace inversify {
             whenAnyAncestorMatches(constraint: (request: Request) => boolean): BindingOnSyntax<T>;
             whenNoAncestorMatches(constraint: (request: Request) => boolean): BindingOnSyntax<T>;
         }
-
+    
     }
 
     export var Kernel: interfaces.KernelConstructor;

From c2e340243fbf22381f2069218d0cb0a9cc382c82 Mon Sep 17 00:00:00 2001
From: "Remo H. Jansen" <remo.jansen@wolksoftware.com>
Date: Thu, 23 Jun 2016 01:46:28 +0100
Subject: [PATCH 267/278] Update inversify.d.ts

---
 inversify/inversify.d.ts | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/inversify/inversify.d.ts b/inversify/inversify.d.ts
index 548cb8a912..41200ae470 100644
--- a/inversify/inversify.d.ts
+++ b/inversify/inversify.d.ts
@@ -248,8 +248,11 @@ declare namespace inversify {
     export function tagged(metadataKey: string, metadataValue: any): (target: any, targetKey: string, index?: number) => any;
     export function named(name: string): (target: any, targetKey: string, index?: number) => any;
     export function targetName(name: string): (target: any, targetKey: string, index: number) => any;
-    export function inject(serviceIdentifier: (string|Symbol|any)): (target: any, targetKey: string, index?: number) => any;
-    export function multiInject(serviceIdentifier: (string|Symbol|any)): (target: any, targetKey: string, index?: number) => any;
+    export function inject(serviceIdentifier: interfaces.ServiceIdentifier<any>): (target: any, targetKey: string, index?: number) => any;
+
+    export function multiInject(
+        serviceIdentifier: interfaces.ServiceIdentifier<any>
+    ): (target: any, targetKey: string, index?: number) => any;
 
     export function makePropertyInjectDecorator(kernel: interfaces.Kernel):
         (serviceIdentifier: (string|Symbol|interfaces.Newable<any>)) => (proto: any, key: string) => void;
@@ -268,6 +271,7 @@ declare namespace inversify {
     export var taggedConstraint: (tag: string) => (value: any) => (request: interfaces.Request) => boolean;
     export var namedConstraint: (value: any) => (request: interfaces.Request) => boolean;
     export var typeConstraint: (type: (Function|string)) => (request: interfaces.Request) => boolean;
+
 }
 
 declare module "inversify" {

From 350b4790f442aaf916c2fcbacc75cc50aa628339 Mon Sep 17 00:00:00 2001
From: sam <362625119@qq.com>
Date: Thu, 23 Jun 2016 10:18:31 +0800
Subject: [PATCH 268/278] Update soap.d.ts

update soap.d.ts. use interfaces to replace class for Security.
---
 soap/soap.d.ts | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/soap/soap.d.ts b/soap/soap.d.ts
index ce501e9e7a..6fcd1b703f 100644
--- a/soap/soap.d.ts
+++ b/soap/soap.d.ts
@@ -8,12 +8,12 @@
 declare module 'soap' {
     import * as events from 'events';
 
-    class Security {
+    interface Security {
     }
-    class WSSecurity extends Security {
+    class WSSecurity implements   Security {
         constructor(username: string, password: string, options: any);
     }
-    class ClientSSLSecurity extends Security {
+    class ClientSSLSecurity implements   Security {
         constructor(key: string, cert: string, ca: string, defaults: any);
     }
     interface Client extends events.EventEmitter {

From d601a20c30d27085caf61a5ebcb9df51f492f0e5 Mon Sep 17 00:00:00 2001
From: Casper Skydt <a1CasSky@lego.com>
Date: Thu, 23 Jun 2016 08:50:19 +0200
Subject: [PATCH 269/278] Added sns and STS

---
 aws-sdk/aws-sdk.d.ts | 131 ++++++++++++++++++++++++++++++++++++++++++-
 1 file changed, 130 insertions(+), 1 deletion(-)

diff --git a/aws-sdk/aws-sdk.d.ts b/aws-sdk/aws-sdk.d.ts
index a13e03fe7a..20f741efca 100644
--- a/aws-sdk/aws-sdk.d.ts
+++ b/aws-sdk/aws-sdk.d.ts
@@ -18,6 +18,10 @@ declare module "aws-sdk" {
 		accessKeyId: string;
 	}
 
+	export class EnvironmentCredentials extends Credentials {
+		constructor(profile: string);
+	}
+
 	export interface Logger {
 		write?: (chunk: any, encoding?: string, callback?: () => void) => void;
 		log?: (...messages: any[]) => void;
@@ -86,6 +90,8 @@ declare module "aws-sdk" {
 	export interface ClientConfigPartial extends Services {
 		credentials?: Credentials;
 		region?: string;
+        accessKeyId: string;
+        secretAccessKey: string;
 		computeChecksums?: boolean;
 		convertResponseTypes?: boolean;
 		logger?: Logger;
@@ -138,8 +144,30 @@ declare module "aws-sdk" {
 
 	export class SNS {
 		constructor(options?: any);
-		public client: Sns.Client;
+		publish(request: sns.publishRequestParams, callback: (err: any, data: any) => void): void;
 	}
+    
+    export interface publishRequestParams{
+        Message: string, 
+        MessageAttributes?: any,
+        MessageStructure: string, 
+        Subject?: string,
+        TargetArn?: string,
+        TopicArn: string
+    }
+
+	export module sns{
+		export interface publishRequestParams{
+        Message: string, 
+        MessageAttributes?: any,
+        MessageStructure: string, 
+        Subject?: string,
+        TargetArn?: string,
+        TopicArn: string
+    	}
+	}
+    
+    
 
 	export class SimpleWorkflow {
 		constructor(options?: any);
@@ -152,6 +180,51 @@ declare module "aws-sdk" {
 		getObject(params: s3.GetObjectRequest, callback: (err: any, data: any) => void): void;
 	}
 
+	export class STS{
+		constructor(options?: any);
+
+		/**
+		 * Returns a set of temporary security credentials (consisting of an access key ID, a secret access key, and a security token) that you can use to access AWS resources that you might not normally have access to.
+		 */
+		assumeRole(params: sts.AssumeRoleParams, callback: (err: any, data: any) => void): void;
+
+		/**
+		 * Returns a set of temporary security credentials for users who have been authenticated via a SAML authentication response. 
+		 */
+		assumeRoleWithSAML(params: sts.AssumeRoleWithSAMLParams, callback: (err: any, data: any) => void): void;
+
+		/**
+		 * Returns a set of temporary security credentials for users who have been authenticated in a mobile or web application with a web identity provider, such as Amazon Cognito, Login with Amazon, Facebook, Google, or any OpenID Connect-compatible identity provider.
+		 */
+		assumeRoleWithWebIdentity(params: sts.AssumeRoleWithWebIdentityParams, callback: (err: any, data: any) => void): void;
+
+		/**
+		 * Creates a credentials object from STS response data containing credentials information.
+		 */
+		credentialsFrom(params: sts.CredentialsFromParams, callback: (err: any, data: any) => void): void;
+
+		/**
+		 * Decodes additional information about the authorization status of a request from an encoded message returned in response to an AWS request.
+		 */
+		decodeAuthorizationMessage(params: sts.DecodeAuthorizationMessageParams, callback: (err: any, data: any) => void): void;
+
+		/**
+		 * Returns details about the IAM identity whose credentials are used to call the API.
+		 */
+		getCallerIdentity(params: {}, callback: (err: any, data: any) => void): void;
+
+		/**
+		 * Returns a set of temporary security credentials (consisting of an access key ID, a secret access key, and a security token) for a federated user.
+		 */
+		getFederationToken(params: sts.GetFederationTokenParams, callback: (err: any, data: any) => void): void;
+
+		/**
+		 * Returns a set of temporary credentials for an AWS account or IAM user.
+		 */
+		getSessionToken(params: sts.GetSessionTokenParams, callback: (err: any, data: any) => void): void;
+
+	}
+
 	export class ECS {
 		constructor(options?: any);
 		/**
@@ -1345,4 +1418,60 @@ declare module "aws-sdk" {
 			taskDefinition: string;
 		}
 	}
+
+	export module sts {
+		export interface AssumeRoleParams {
+			RoleArn: string;
+			RoleSessionName: string;
+			DurationSeconds?: number;
+			ExternalId?: string;
+			Policy?: string;
+			SerialNumber?: string;
+			TokenCode?: string;
+		}
+
+		export interface AssumeRoleWithSAMLParams {
+			PrincipalArn: string;
+  			RoleArn: string;
+  			SAMLAssertion: string;
+  			DurationSeconds?: number;
+  			Policy?: string;
+		}
+
+		export interface AssumeRoleWithWebIdentityParams {
+			RoleArn: string;
+			RoleSessionName: string;
+			WebIdentityToken: string;
+			DurationSeconds?: number;
+			Policy?: string;
+			ProviderId?: string;
+		}
+
+		export interface CredentialsFromParams {
+			/**
+			 * Data retrieved from a call to AWS.STS.getFederatedToken, getSessionToken(), assumeRole(), or assumeRoleWithWebIdentity().
+			 */
+			Data: any;
+			/**
+			 * An optional credentials object to fill instead of creating a new object. Useful when modifying an existing credentials object from a refresh call.
+			 */
+			Credentials?: Credentials
+		}
+
+		export interface DecodeAuthorizationMessageParams {
+			EncodedMessage: string;
+		}
+
+		export interface GetFederationTokenParams {
+			Name: string;
+  			DurationSeconds?: number,
+  			Policy?: string
+		}
+
+		export interface GetSessionTokenParams {
+			DurationSeconds: number,
+  			SerialNumber: string;
+  			TokenCode: string;
+		}
+	}
 }

From a81bf4083907e52f615cb3da8761db70342d3819 Mon Sep 17 00:00:00 2001
From: Casper Skydt <a1CasSky@lego.com>
Date: Thu, 23 Jun 2016 08:55:43 +0200
Subject: [PATCH 270/278] Removed duplicat item

---
 aws-sdk/aws-sdk.d.ts | 26 ++------------------------
 1 file changed, 2 insertions(+), 24 deletions(-)

diff --git a/aws-sdk/aws-sdk.d.ts b/aws-sdk/aws-sdk.d.ts
index 20f741efca..5946d25982 100644
--- a/aws-sdk/aws-sdk.d.ts
+++ b/aws-sdk/aws-sdk.d.ts
@@ -144,31 +144,9 @@ declare module "aws-sdk" {
 
 	export class SNS {
 		constructor(options?: any);
-		publish(request: sns.publishRequestParams, callback: (err: any, data: any) => void): void;
+		publish(request: Sns.PublishRequest, callback: (err: any, data: any) => void): void;
 	}
-    
-    export interface publishRequestParams{
-        Message: string, 
-        MessageAttributes?: any,
-        MessageStructure: string, 
-        Subject?: string,
-        TargetArn?: string,
-        TopicArn: string
-    }
-
-	export module sns{
-		export interface publishRequestParams{
-        Message: string, 
-        MessageAttributes?: any,
-        MessageStructure: string, 
-        Subject?: string,
-        TargetArn?: string,
-        TopicArn: string
-    	}
-	}
-    
-    
-
+  
 	export class SimpleWorkflow {
 		constructor(options?: any);
 		public client: Swf.Client;

From c17014144b0b6449e54a035f6c17377f46178c81 Mon Sep 17 00:00:00 2001
From: Jasper Siegmund <jasper@repsaj.nl>
Date: Thu, 23 Jun 2016 08:59:30 +0200
Subject: [PATCH 271/278] Removed comments added by typings

---
 azure-mobile-services-client/AzureMobileServicesClient.d.ts | 2 --
 1 file changed, 2 deletions(-)

diff --git a/azure-mobile-services-client/AzureMobileServicesClient.d.ts b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
index 707e7222d8..afd6014598 100644
--- a/azure-mobile-services-client/AzureMobileServicesClient.d.ts
+++ b/azure-mobile-services-client/AzureMobileServicesClient.d.ts
@@ -1,5 +1,3 @@
-// Generated by typings
-// Source: https://raw.githubusercontent.com/DefinitelyTyped/DefinitelyTyped/master/azure-mobile-services-client/AzureMobileServicesClient.d.ts
 // Type definitions for Microsoft Windows AzureMobile Service 1.0.0
 // Project: http://www.windowsazure.com/en-us/develop/mobile/
 // Definitions by: Morosinotto Daniele <https://github.com/dmorosinotto/>

From 70447ffdac98d23328e3eca17b86a13065e1a0a9 Mon Sep 17 00:00:00 2001
From: wagich <wagi_ch@gmx.net>
Date: Thu, 23 Jun 2016 09:32:47 +0200
Subject: [PATCH 272/278] updates tests

---
 flickity/flickity-tests.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/flickity/flickity-tests.ts b/flickity/flickity-tests.ts
index 8d06e4ee7f..4f155f3e17 100644
--- a/flickity/flickity-tests.ts
+++ b/flickity/flickity-tests.ts
@@ -30,7 +30,7 @@
         percentPosition: false,
         prevNextButtons: false,
         selectedAttraction: 0.050,
-        useSetGallerySize: true,
+        setGallerySize: true,
         watchCSS: true,
         wrapAround: true,
         resize: true,
@@ -64,7 +64,7 @@
             percentPosition: false,
             prevNextButtons: false,
             selectedAttraction: 0.050,
-            useSetGallerySize: true,
+            setGallerySize: true,
             watchCSS: true,
             wrapAround: true,
             resize: true,

From e25f0e748187e61a7a01304b40d5ca45b67f60e3 Mon Sep 17 00:00:00 2001
From: tatx <tat@fea.st>
Date: Thu, 23 Jun 2016 17:42:06 +0530
Subject: [PATCH 273/278] fixing the case in the reference in the test file

---
 datastream.js/datastream.js-tests.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/datastream.js/datastream.js-tests.ts b/datastream.js/datastream.js-tests.ts
index 71bb08537e..94fb86f367 100644
--- a/datastream.js/datastream.js-tests.ts
+++ b/datastream.js/datastream.js-tests.ts
@@ -1,4 +1,4 @@
-/// <reference path="DataStream.js.d.ts" />
+/// <reference path="datastream.js.d.ts" />
 
 var buf = new ArrayBuffer(100);
 var ds = new DataStream(buf);

From d10b6882e940bb47a1ea670109a60b594f7f5ed3 Mon Sep 17 00:00:00 2001
From: Kamil Szostak <kszostak@microsoft.com>
Date: Thu, 23 Jun 2016 11:01:58 -0700
Subject: [PATCH 274/278] Add types for telemetry objects

---
 .../applicationinsights-js-tests.ts           |  46 +-
 .../applicationinsights-js.d.ts               | 412 +++++++++++++++++-
 2 files changed, 441 insertions(+), 17 deletions(-)

diff --git a/applicationinsights-js/applicationinsights-js-tests.ts b/applicationinsights-js/applicationinsights-js-tests.ts
index b90ec6c6fe..b8f5ba7bec 100644
--- a/applicationinsights-js/applicationinsights-js-tests.ts
+++ b/applicationinsights-js/applicationinsights-js-tests.ts
@@ -108,8 +108,50 @@ context.operation.syntheticSource = "testAgent";
 
 // track
 var data = new Microsoft.Telemetry.Base();
-var envelope = new Microsoft.Telemetry.Envelope();
+var envelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(data, "name");
 
 context.track(envelope);
 
-context.addTelemetryInitializer((envelope) => false);
\ No newline at end of file
+context.addTelemetryInitializer((envelope) => false);
+
+// track event
+var eventObj = new Microsoft.ApplicationInsights.Telemetry.Event("test", null, null);
+var eventData = new Microsoft.ApplicationInsights.Telemetry.Common.Data<Microsoft.ApplicationInsights.Telemetry.Event>(Microsoft.ApplicationInsights.Telemetry.Event.dataType, eventObj);
+var eventEnvelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(eventData, Microsoft.ApplicationInsights.Telemetry.Event.envelopeType);
+context.track(eventEnvelope);
+
+// track exception
+var exceptionObj = new Microsoft.ApplicationInsights.Telemetry.Exception(new Error(), "handledAt", null, null, AI.SeverityLevel.Critical);
+var exceptionData = new Microsoft.ApplicationInsights.Telemetry.Common.Data<Microsoft.ApplicationInsights.Telemetry.Exception>(Microsoft.ApplicationInsights.Telemetry.Exception.dataType, exceptionObj);
+var exceptionEnvelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(exceptionData, Microsoft.ApplicationInsights.Telemetry.Exception.envelopeType);
+context.track(exceptionEnvelope);
+
+// track metric
+var metricObj = new Microsoft.ApplicationInsights.Telemetry.Metric("name", 1234, 1, 0, 100, null);
+var metricData = new Microsoft.ApplicationInsights.Telemetry.Common.Data<Microsoft.ApplicationInsights.Telemetry.Metric>(Microsoft.ApplicationInsights.Telemetry.Metric.dataType, metricObj);
+var metricEnvelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(metricData, Microsoft.ApplicationInsights.Telemetry.Metric.envelopeType);
+context.track(metricEnvelope);
+
+// track page view
+var pageViewObj = new Microsoft.ApplicationInsights.Telemetry.PageView("page name", "url", 999, null, null);
+var pageViewData = new Microsoft.ApplicationInsights.Telemetry.Common.Data<Microsoft.ApplicationInsights.Telemetry.PageView>(Microsoft.ApplicationInsights.Telemetry.PageView.dataType, pageViewObj);
+var pageViewEnvelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(pageViewData, Microsoft.ApplicationInsights.Telemetry.PageView.envelopeType);
+context.track(pageViewEnvelope);
+
+// track page view performance
+var pageViewPerfObj = new Microsoft.ApplicationInsights.Telemetry.PageViewPerformance("page name", "url", 999, null, null);
+var pageViewPerfData = new Microsoft.ApplicationInsights.Telemetry.Common.Data<Microsoft.ApplicationInsights.Telemetry.PageViewPerformance>(Microsoft.ApplicationInsights.Telemetry.PageViewPerformance.dataType, pageViewPerfObj);
+var pageViewPerfEnvelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(pageViewPerfData, Microsoft.ApplicationInsights.Telemetry.PageViewPerformance.envelopeType);
+context.track(pageViewPerfEnvelope);
+
+// track remote dependency
+var remoteDepObj = new Microsoft.ApplicationInsights.Telemetry.RemoteDependencyData("id", "url", "command", 1, true, 1234, "GET");
+var remoteDepData = new Microsoft.ApplicationInsights.Telemetry.Common.Data<Microsoft.ApplicationInsights.Telemetry.RemoteDependencyData>(Microsoft.ApplicationInsights.Telemetry.RemoteDependencyData.dataType, remoteDepObj);
+var remoteDepEnvelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(remoteDepData, Microsoft.ApplicationInsights.Telemetry.RemoteDependencyData.envelopeType);
+context.track(pageViewPerfEnvelope);
+
+// track trace
+var traceObj = new Microsoft.ApplicationInsights.Telemetry.Trace("message", null);
+var traceData = new Microsoft.ApplicationInsights.Telemetry.Common.Data<Microsoft.ApplicationInsights.Telemetry.Trace>(Microsoft.ApplicationInsights.Telemetry.Trace.dataType, traceObj);
+var traceEnvelope = new Microsoft.ApplicationInsights.Telemetry.Common.Envelope(traceData, Microsoft.ApplicationInsights.Telemetry.Trace.envelopeType);
+context.track(traceEnvelope);
\ No newline at end of file
diff --git a/applicationinsights-js/applicationinsights-js.d.ts b/applicationinsights-js/applicationinsights-js.d.ts
index 5bb2a535f9..d9ad3c1c9d 100644
--- a/applicationinsights-js/applicationinsights-js.d.ts
+++ b/applicationinsights-js/applicationinsights-js.d.ts
@@ -11,6 +11,120 @@ declare module AI {
         Error = 3,
         Critical = 4,
     }
+
+    enum DependencyKind {
+        SQL = 0,
+        Http = 1,
+        Other = 2,
+    }
+
+    enum DependencySourceType {
+        Undefined = 0,
+        Aic = 1,
+        Apmc = 2,
+    }
+
+    class StackFrame {
+        level: number;
+        method: string;
+        assembly: string;
+        fileName: string;
+        line: number;
+        constructor();
+    }
+
+    class ExceptionDetails {
+        id: number;
+        outerId: number;
+        typeName: string;
+        message: string;
+        hasFullStack: boolean;
+        stack: string;
+        parsedStack: StackFrame[];
+        constructor();
+    }
+
+    enum DataPointType {
+        Measurement = 0,
+        Aggregation = 1,
+    }
+
+    class DataPoint {
+        name: string;
+        kind: AI.DataPointType;
+        value: number;
+        count: number;
+        min: number;
+        max: number;
+        stdDev: number;
+        constructor();
+    }
+
+    class EventData extends Microsoft.Telemetry.Domain {
+        ver: number;
+        name: string;
+        properties: any;
+        measurements: any;
+        constructor();
+    }
+
+    class PageViewData extends AI.EventData {
+        ver: number;
+        url: string;
+        name: string;
+        duration: string;
+        referrer: string;
+        referrerData: string;
+        properties: any;
+        measurements: any;
+        constructor();
+    }
+
+    class PageViewPerfData extends AI.PageViewData {
+        ver: number;
+        url: string;
+        perfTotal: string;
+        name: string;
+        duration: string;
+        networkConnect: string;
+        referrer: string;
+        sentRequest: string;
+        referrerData: string;
+        receivedResponse: string;
+        domProcessing: string;
+        properties: any;
+        measurements: any;
+        constructor();
+    }
+
+    class RemoteDependencyData extends Microsoft.Telemetry.Domain {
+        ver: number;
+        name: string;
+        id: string;
+        resultCode: string;
+        kind: AI.DataPointType;
+        value: number;
+        count: number;
+        min: number;
+        max: number;
+        stdDev: number;
+        dependencyKind: AI.DependencyKind;
+        success: boolean;
+        async: boolean;
+        dependencySource: AI.DependencySourceType;
+        commandName: string;
+        dependencyTypeName: string;
+        properties: any;
+        constructor();
+    }
+
+    class MessageData extends Microsoft.Telemetry.Domain {
+        ver: number;
+        message: string;
+        severityLevel: AI.SeverityLevel;
+        properties: any;
+        constructor();
+    }
 }
 
 declare module Microsoft.ApplicationInsights.Context {
@@ -24,8 +138,8 @@ declare module Microsoft.ApplicationInsights.Context {
          */
         build: string;
     }
-	
-	interface IDevice {
+
+    interface IDevice {
         /**
          * The type for the current device.
          */
@@ -71,7 +185,7 @@ declare module Microsoft.ApplicationInsights.Context {
          */
         osversion: string;
     }
-	
+
     interface ILocation {
         /**
          * Client IP address for reverse lookup
@@ -88,15 +202,15 @@ declare module Microsoft.ApplicationInsights.Context {
          * The SDK agent version.
          */
         agentVersion: string;
-    }	
-	
+    }
+
     interface ISample {
         /**
         * Sample rate
         */
         sampleRate: number;
     }
-	
+
     interface ISession {
         /**
         * The session ID.
@@ -117,8 +231,8 @@ declare module Microsoft.ApplicationInsights.Context {
          * Per the spec the ID will be regenerated if more than renewalSpan milliseconds elapse from this time with no activity.
          */
         renewalDate: number;
-    }	
-	
+    }
+
     interface IOperation {
         /**
          * Operation id
@@ -141,8 +255,8 @@ declare module Microsoft.ApplicationInsights.Context {
          */
         syntheticSource: string;
     }
-	
-	interface IUser {
+
+    interface IUser {
         /**
         * The telemetry configuration.
         */
@@ -175,12 +289,221 @@ declare module Microsoft.ApplicationInsights.Context {
 }
 
 declare module Microsoft.Telemetry {
+    class Domain {
+        constructor();
+    }
+
     class Base {
         baseType: string;
         constructor();
     }
-	
-	class Envelope {
+
+    class Data<TDomain> extends Microsoft.Telemetry.Base {
+        baseType: string;
+        baseData: TDomain;
+        constructor();
+    }
+}
+
+declare module Microsoft.ApplicationInsights.Telemetry {
+
+    class Event implements Microsoft.ApplicationInsights.ISerializable {
+        static envelopeType: string;
+        static dataType: string;
+        ver: number;
+        name: string;
+        properties: any;
+        measurements: any;
+        aiDataContract: {
+            ver: Microsoft.ApplicationInsights.FieldType;
+            name: Microsoft.ApplicationInsights.FieldType;
+            properties: Microsoft.ApplicationInsights.FieldType;
+            measurements: Microsoft.ApplicationInsights.FieldType;
+        };
+        /**
+         * Constructs a new instance of the EventTelemetry object
+         */
+        constructor(name: string, properties?: Object, measurements?: Object);
+    }
+
+    class Exception implements Microsoft.ApplicationInsights.ISerializable {
+        static envelopeType: string;
+        static dataType: string;
+        ver: number;
+        handledAt: string;
+        exceptions: AI.ExceptionDetails[];
+        severityLevel: AI.SeverityLevel;
+        problemId: string;
+        crashThreadId: number;
+        properties: any;
+        measurements: any;
+        aiDataContract: {
+            ver: Microsoft.ApplicationInsights.FieldType;
+            handledAt: Microsoft.ApplicationInsights.FieldType;
+            exceptions: Microsoft.ApplicationInsights.FieldType;
+            severityLevel: Microsoft.ApplicationInsights.FieldType;
+            properties: Microsoft.ApplicationInsights.FieldType;
+            measurements: Microsoft.ApplicationInsights.FieldType;
+        };
+        /**
+        * Constructs a new isntance of the ExceptionTelemetry object
+        */
+        constructor(exception: Error, handledAt?: string, properties?: Object, measurements?: Object, severityLevel?: AI.SeverityLevel);
+        /**
+        * Creates a simple exception with 1 stack frame. Useful for manual constracting of exception.
+        */
+        static CreateSimpleException(message: string, typeName: string, assembly: string, fileName: string, details: string, line: number, handledAt?: string): Telemetry.Exception;
+    }
+
+    class Metric implements Microsoft.ApplicationInsights.ISerializable {
+        static envelopeType: string;
+        static dataType: string;
+        ver: number;
+        metrics: AI.DataPoint[];
+        properties: any;
+        aiDataContract: {
+            ver: Microsoft.ApplicationInsights.FieldType;
+            metrics: Microsoft.ApplicationInsights.FieldType;
+            properties: Microsoft.ApplicationInsights.FieldType;
+        };
+        /**
+         * Constructs a new instance of the MetricTelemetry object
+         */
+        constructor(name: string, value: number, count?: number, min?: number, max?: number, properties?: Object);
+    }
+
+    class PageView extends AI.PageViewData implements Microsoft.ApplicationInsights.ISerializable {
+        static envelopeType: string;
+        static dataType: string;
+        aiDataContract: {
+            ver: Microsoft.ApplicationInsights.FieldType;
+            name: Microsoft.ApplicationInsights.FieldType;
+            url: Microsoft.ApplicationInsights.FieldType;
+            duration: Microsoft.ApplicationInsights.FieldType;
+            properties: Microsoft.ApplicationInsights.FieldType;
+            measurements: Microsoft.ApplicationInsights.FieldType;
+        };
+        /**
+         * Constructs a new instance of the PageEventTelemetry object
+         */
+        constructor(name?: string, url?: string, durationMs?: number, properties?: any, measurements?: any);
+    }
+
+    class PageViewPerformance extends AI.PageViewPerfData implements Microsoft.ApplicationInsights.ISerializable {
+        static envelopeType: string;
+        static dataType: string;
+        aiDataContract: {
+            ver: Microsoft.ApplicationInsights.FieldType;
+            name: Microsoft.ApplicationInsights.FieldType;
+            url: Microsoft.ApplicationInsights.FieldType;
+            duration: Microsoft.ApplicationInsights.FieldType;
+            perfTotal: Microsoft.ApplicationInsights.FieldType;
+            networkConnect: Microsoft.ApplicationInsights.FieldType;
+            sentRequest: Microsoft.ApplicationInsights.FieldType;
+            receivedResponse: Microsoft.ApplicationInsights.FieldType;
+            domProcessing: Microsoft.ApplicationInsights.FieldType;
+            properties: Microsoft.ApplicationInsights.FieldType;
+            measurements: Microsoft.ApplicationInsights.FieldType;
+        };
+        /**
+         * Field indicating whether this instance of PageViewPerformance is valid and should be sent
+         */
+        private isValid;
+        /**
+         * Indicates whether this instance of PageViewPerformance is valid and should be sent
+         */
+        getIsValid(): boolean;
+        private durationMs;
+        /**
+        * Gets the total duration (PLT) in milliseconds. Check getIsValid() before using this method.
+        */
+        getDurationMs(): number;
+        /**
+         * Constructs a new instance of the PageEventTelemetry object
+         */
+        constructor(name: string, url: string, unused: number, properties?: any, measurements?: any);
+        static getPerformanceTiming(): PerformanceTiming;
+        /**
+        * Returns true is window performance timing API is supported, false otherwise.
+        */
+        static isPerformanceTimingSupported(): PerformanceTiming;
+        /**
+         * As page loads different parts of performance timing numbers get set. When all of them are set we can report it.
+         * Returns true if ready, false otherwise.
+         */
+        static isPerformanceTimingDataReady(): boolean;
+        static getDuration(start: any, end: any): number;
+    }
+
+    class RemoteDependencyData extends AI.RemoteDependencyData implements Microsoft.ApplicationInsights.ISerializable {
+        static envelopeType: string;
+        static dataType: string;
+        aiDataContract: {
+            id: Microsoft.ApplicationInsights.FieldType;
+            ver: Microsoft.ApplicationInsights.FieldType;
+            name: Microsoft.ApplicationInsights.FieldType;
+            kind: Microsoft.ApplicationInsights.FieldType;
+            value: Microsoft.ApplicationInsights.FieldType;
+            count: Microsoft.ApplicationInsights.FieldType;
+            min: Microsoft.ApplicationInsights.FieldType;
+            max: Microsoft.ApplicationInsights.FieldType;
+            stdDev: Microsoft.ApplicationInsights.FieldType;
+            dependencyKind: Microsoft.ApplicationInsights.FieldType;
+            success: Microsoft.ApplicationInsights.FieldType;
+            async: Microsoft.ApplicationInsights.FieldType;
+            dependencySource: Microsoft.ApplicationInsights.FieldType;
+            commandName: Microsoft.ApplicationInsights.FieldType;
+            dependencyTypeName: Microsoft.ApplicationInsights.FieldType;
+            properties: Microsoft.ApplicationInsights.FieldType;
+            resultCode: Microsoft.ApplicationInsights.FieldType;
+        };
+        /**
+         * Constructs a new instance of the RemoteDependencyData object
+         */
+        constructor(id: string, absoluteUrl: string, commandName: string, value: number, success: boolean, resultCode: number, method?: string);
+        private formatDependencyName(method, absoluteUrl);
+    }
+
+    class Trace extends AI.MessageData implements Microsoft.ApplicationInsights.ISerializable {
+        static envelopeType: string;
+        static dataType: string;
+        aiDataContract: {
+            ver: Microsoft.ApplicationInsights.FieldType;
+            message: Microsoft.ApplicationInsights.FieldType;
+            severityLevel: Microsoft.ApplicationInsights.FieldType;
+            measurements: Microsoft.ApplicationInsights.FieldType;
+            properties: Microsoft.ApplicationInsights.FieldType;
+        };
+        /**
+         * Constructs a new instance of the MetricTelemetry object
+         */
+        constructor(message: string, properties?: Object);
+    }
+}
+
+declare module Microsoft.ApplicationInsights.Telemetry.Common {
+    class Base extends Microsoft.Telemetry.Base implements Microsoft.ApplicationInsights.ISerializable {
+        /**
+         * The data contract for serializing this object.
+         */
+        aiDataContract: {};
+    }
+
+    class Data<TDomain> extends Microsoft.Telemetry.Data<TDomain> implements Microsoft.ApplicationInsights.ISerializable {
+        /**
+         * The data contract for serializing this object.
+         */
+        aiDataContract: {
+            baseType: FieldType;
+            baseData: FieldType;
+        };
+        /**
+         * Constructs a new instance of telemetry data.
+         */
+        constructor(type: string, data: TDomain);
+    }
+
+    class Envelope implements IEnvelope {
         ver: number;
         name: string;
         time: string;
@@ -196,7 +519,27 @@ declare module Microsoft.Telemetry {
         userId: string;
         tags: any;
         data: Base;
-        constructor();
+
+        /**
+         * The data contract for serializing this object.
+         */
+        aiDataContract: any;
+        /**
+         * Constructs a new instance of telemetry data.
+         */
+        constructor(data: Microsoft.Telemetry.Base, name: string);
+    }
+
+    class DataSanitizer {
+        static sanitizeKeyAndAddUniqueness(key: any, map: any): any;
+        static sanitizeKey(name: any): any;
+        static sanitizeString(value: any): any;
+        static sanitizeUrl(url: any): any;
+        static sanitizeMessage(message: any): any;
+        static sanitizeException(exception: any): any;
+        static sanitizeProperties(properties: any): any;
+        static sanitizeMeasurements(measurements: any): any;
+        static padNumber(num: any): string;
     }
 }
 
@@ -228,6 +571,45 @@ declare module Microsoft.ApplicationInsights {
         url?: string;
     }
 
+    /**
+     * Enum is used in aiDataContract to describe how fields are serialized.
+     * For instance: (Fieldtype.Required | FieldType.Array) will mark the field as required and indicate it's an array
+     */
+    enum FieldType {
+        Default = 0,
+        Required = 1,
+        Array = 2,
+        Hidden = 4,
+    }
+
+    interface ISerializable {
+        /**
+         * The set of fields for a serializeable object.
+         * This defines the serialization order and a value of true/false
+         * for each field defines whether the field is required or not.
+         */
+        aiDataContract: any;
+    }
+
+    interface IEnvelope extends ISerializable {
+        ver: number;
+        name: string;
+        time: string;
+        sampleRate: number;
+        seq: string;
+        iKey: string;
+        flags: number;
+        deviceId: string;
+        os: string;
+        osVer: string;
+        appId: string;
+        appVer: string;
+        userId: string;
+        tags: {
+            [name: string]: any;
+        };
+    }
+
     interface ITelemetryContext {
         /**
         * The object describing a component tracked by this object.
@@ -265,11 +647,11 @@ declare module Microsoft.ApplicationInsights {
         * Adds telemetry initializer to the collection. Telemetry initializers will be called one by one
         * before telemetry item is pushed for sending and in the order they were added.
         */
-        addTelemetryInitializer(telemetryInitializer: (envelope: Microsoft.Telemetry.Envelope) => boolean): any;
+        addTelemetryInitializer(telemetryInitializer: (envelope: Microsoft.ApplicationInsights.IEnvelope) => boolean): any;
         /**
         * Tracks telemetry object.
         */
-        track(envelope: Microsoft.Telemetry.Envelope): any;
+        track(envelope: Microsoft.ApplicationInsights.IEnvelope): any;
     }
 
     interface IAppInsights {

From 8c7753c90c610731c12f7649b5992e2618239797 Mon Sep 17 00:00:00 2001
From: marc <mcfisher83@gmail.com>
Date: Thu, 23 Jun 2016 13:03:44 -0500
Subject: [PATCH 275/278] Fixed the module name to correctly reflect
 cassandra-driver name.

---
 .../cassandra.d.ts => cassandra-driver/cassandra-driver.d.ts  | 2 +-
 .../cassandra-driver.tests.ts                                 | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)
 rename nodejs-driver/cassandra.d.ts => cassandra-driver/cassandra-driver.d.ts (99%)
 rename nodejs-driver/cassandra.tests.ts => cassandra-driver/cassandra-driver.tests.ts (77%)

diff --git a/nodejs-driver/cassandra.d.ts b/cassandra-driver/cassandra-driver.d.ts
similarity index 99%
rename from nodejs-driver/cassandra.d.ts
rename to cassandra-driver/cassandra-driver.d.ts
index 93a94b2e3f..0da40f2081 100644
--- a/nodejs-driver/cassandra.d.ts
+++ b/cassandra-driver/cassandra-driver.d.ts
@@ -6,7 +6,7 @@
 /// <reference path="../node/node.d.ts" />
 /// <reference path="../long/long.d.ts" />
 
-declare module "cassandra" {
+declare module "cassandra-driver" {
   type Callback = Function;
   type ResultCallback = (err: Error, result: types.ResultSet) => void;
 
diff --git a/nodejs-driver/cassandra.tests.ts b/cassandra-driver/cassandra-driver.tests.ts
similarity index 77%
rename from nodejs-driver/cassandra.tests.ts
rename to cassandra-driver/cassandra-driver.tests.ts
index 83b3eab679..3eebf93018 100644
--- a/nodejs-driver/cassandra.tests.ts
+++ b/cassandra-driver/cassandra-driver.tests.ts
@@ -1,6 +1,6 @@
-/// <reference path="cassandra.d.ts" />
+/// <reference path="cassandra-driver.d.ts" />
 
-import * as cassandra from 'cassandra';
+import * as cassandra from 'cassandra-driver';
 import * as util from 'util';
 
 var client = new cassandra.Client({ contactPoints: ['h1', 'h2'], keyspace: 'ks1'});

From 205b1234215c80894b2aebe7a3869b6634baad2a Mon Sep 17 00:00:00 2001
From: marc <mcfisher83@gmail.com>
Date: Wed, 22 Jun 2016 11:20:46 -0500
Subject: [PATCH 276/278] Added typings for the node driver for Cassandra.

Fixed the module name to correctly reflect cassandra-driver name.
---
 cassandra-driver/cassandra-driver.d.ts     | 761 +++++++++++++++++++++
 cassandra-driver/cassandra-driver.tests.ts |  11 +
 2 files changed, 772 insertions(+)
 create mode 100644 cassandra-driver/cassandra-driver.d.ts
 create mode 100644 cassandra-driver/cassandra-driver.tests.ts

diff --git a/cassandra-driver/cassandra-driver.d.ts b/cassandra-driver/cassandra-driver.d.ts
new file mode 100644
index 0000000000..0da40f2081
--- /dev/null
+++ b/cassandra-driver/cassandra-driver.d.ts
@@ -0,0 +1,761 @@
+// Type definitions for nodejs-driver v0.8.2
+// Project: https://github.com/datastax/nodejs-driver
+// Definitions by: Marc Fisher <http://github.com/Svjard>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference path="../node/node.d.ts" />
+/// <reference path="../long/long.d.ts" />
+
+declare module "cassandra-driver" {
+  type Callback = Function;
+  type ResultCallback = (err: Error, result: types.ResultSet) => void;
+
+  import * as events from "events";
+  import * as stream from "stream";
+  import _Long = require("long");
+
+  namespace policies {
+    namespace addressResolution {
+      var EC2MultiRegionTranslator: EC2MultiRegionTranslatorStatic; 
+
+      interface AddressTranslator {
+        translate(address: string, port: number, callback: Callback): void;  
+      }
+
+      interface EC2MultiRegionTranslatorStatic {
+        new(): EC2MultiRegionTranslator;
+      }
+
+      interface EC2MultiRegionTranslator extends AddressTranslator {
+        logError(address: string, err: Error): void;
+      }
+    }
+
+    namespace loadBalancing {
+      var DCAwareRoundRobinPolicy: DCAwareRoundRobinPolicyStatic;
+      var RoundRobinPolicy: RoundRobinPolicyStatic;
+      var TokenAwarePolicy: TokenAwarePolicyStatic;
+      var WhiteListPolicy: WhiteListPolicyStatic;
+
+      interface LoadBalancingPolicy {
+        init(client: Client, hosts: HostMap, callback: Callback): void;
+        getDistance(host: Host): types.distance;
+        newQueryPlan(keyspace: string, queryOptions: any, callback: Callback): void;
+      }
+
+      interface DCAwareRoundRobinPolicyStatic {
+        new(localDc?: string, usedHostsPerRemoteDc?: number): DCAwareRoundRobinPolicy;
+      }
+
+      interface DCAwareRoundRobinPolicy extends LoadBalancingPolicy {
+        localHostsArray: Array<Host>;
+        remoteHostsArray: Array<Host>;
+      }
+
+      interface RoundRobinPolicyStatic {
+        new(): RoundRobinPolicy;
+      }
+
+      interface RoundRobinPolicy extends LoadBalancingPolicy {}
+
+      interface TokenAwarePolicyStatic {
+        new(childPolicy: LoadBalancingPolicy): TokenAwarePolicy;
+      }
+
+      interface TokenAwarePolicy extends LoadBalancingPolicy {}
+
+      interface WhiteListPolicyStatic {
+        new(childPolicy: LoadBalancingPolicy, whiteList: Array<string>): WhiteListPolicy;
+      }
+
+      interface WhiteListPolicy extends LoadBalancingPolicy {}
+    }
+
+    namespace reconnection {
+      var ConstantReconnectionPolicy: ConstantReconnectionPolicyStatic;
+      var ExponentialReconnectionPolicy: ExponentialReconnectionPolicyStatic;
+
+      interface ReconnectionPolicy {
+        newSchedule(): {next: Function};
+      }
+
+      interface ConstantReconnectionPolicyStatic {
+        new(delay: number): ConstantReconnectionPolicy;
+      }
+
+      interface ConstantReconnectionPolicy extends ReconnectionPolicy {}
+
+      interface ExponentialReconnectionPolicyStatic {
+        new(baseDelay: number, maxDelay: number, startWithNoDelay: boolean): ExponentialReconnectionPolicy;
+      }
+
+      interface ExponentialReconnectionPolicy extends ReconnectionPolicy {}
+    }
+
+    namespace retry {
+      var RetryPolicy: RetryPolicyStatic;
+
+      interface DecisionInfo {
+        decision: number;
+        consistency: number;
+      }
+
+      interface RequestInfo {
+        request: any,
+        nbRetry: number
+      }
+
+      enum retryDecision {
+        rethrow = 0,
+        retry,
+        ignore
+      }
+
+      interface RetryPolicyStatic {
+        new (): RetryPolicy;
+
+        retryDecision: any;
+      }
+
+      interface RetryPolicy {
+        onReadTimeout(requestInfo: RequestInfo, consistency: types.consistencies, received: number, blockFor: number, isDataPresent: boolean): DecisionInfo;
+        onUnavailable(requestInfo: RequestInfo, consistency: types.consistencies, required: number, alive: number): DecisionInfo;
+        onWriteTimeout(requestInfo: RequestInfo, consistency: types.consistencies, received: number, blockFor: number, writeType: string): DecisionInfo;
+        rethrowResult(): { decision: retryDecision };
+        retryResult(): { decision: retryDecision, consistency: types.consistencies, useCurrentHost: boolean };
+      }
+    }
+  }
+
+  namespace types {
+    var BigDecimal: BigDecimalStatic;
+    var InetAddress: InetAddressStatic;
+    var Integer: IntegerStatic;
+    var LocalDate: LocalDateStatic;
+    var LocalTime: LocalTimeStatic;
+    var Long: _Long;
+    var ResultSet: ResultSetStatic;
+    var ResultStream: ResultStreamStatic;
+    var Row: RowStatic;
+    var TimeUuid: TimeUuidStatic;
+    var Tuple: TupleStatic;
+    var Uuid: UuidStatic;
+
+    enum consistencies { 
+      any = 0,
+      one,
+      two,
+      three,
+      quorum,
+      all,
+      localQuorm,
+      eachQuorum,
+      serial,
+      localSerial,
+      localOne
+    }
+    
+    enum dataTypes {
+      custom = 0,
+      ascii,
+      bigint,
+      blob,
+      boolean,
+      counter,
+      decimal,
+      double,
+      float,
+      int,
+      text,
+      timestamp,
+      uuid,
+      varchar,
+      varint,
+      timeuuid,
+      inet,
+      date,
+      time,
+      smallint,
+      tinyint,
+      list,
+      map,
+      set,
+      udt,
+      tuple
+    }
+
+    enum distance {
+      local = 0,
+      remote,
+      ignored
+    }
+
+    interface responseErrorCodes { [key:string]:number; }
+    interface unset { unset: boolean; }
+
+    function generateTimestamp(date?: Date, microseconds?: number): _Long;
+    function timeuuid(options?: {msecs: number | Date, node: Buffer, clockseq: number, nsecs: number}, buffer?: Buffer, offset?: number): string;
+
+    interface BigDecimalStatic {
+      new (unscaledValue: number, scale: number): BigDecimal;
+
+      fromBuffer(buf: Buffer): BigDecimal;
+      toBuffer(value: BigDecimal): Buffer;
+      fromString(value: string): BigDecimal;
+      fromNumber(value: number): BigDecimal;
+    }
+    
+    interface BigDecimal {
+      equals(other: BigDecimal): boolean;
+      inspect(): string;
+      notEquals(other: BigDecimal): boolean;
+      compare(other: BigDecimal): number;
+      subtract(other: BigDecimal): BigDecimal;
+      add(other: BigDecimal): BigDecimal;
+      greaterThan(other: BigDecimal): boolean;
+      isNegative(): boolean;
+      isZero(): boolean;
+      toString(): string;
+      toNumber(): number;
+      toJSON(): string;
+    }
+
+    interface InetAddressStatic {
+      new(buffer: Buffer): InetAddress;
+
+      fromString(value: string): InetAddress;
+    }
+
+    interface InetAddress {
+      equals(other: InetAddress): boolean;
+      getBuffer(): Buffer;
+      inspect(): string;
+      toString(): string;
+      toJSON(): string;
+
+      length: number;
+      version: number;
+    }
+
+    interface IntegerStatic {
+      new(bits: Array<number>, sign: number): Integer;
+      
+      fromInt(value: number): Integer;
+      fromNumber(value: number): Integer;
+      fromBits(bits: Array<number>): Integer;
+      fromString(str: string, opt_radix?: number): Integer;
+      fromBuffer(bits: Buffer): Integer;
+      toBuffer(value: Integer): Buffer;
+
+      ZERO: Integer;
+      ONE: Integer;
+    }
+
+    interface Integer {
+      toInt(): number;
+      toNumber(): number;
+      toString(opt_radix?: number): string;
+      getBits(index: number): number;
+      getBitsUnsigned(index: number): number;
+      getSign(): number;
+      isZero(): boolean;
+      isNegative(): boolean;
+      isOdd(): boolean;
+      equals(other: Integer): boolean;
+      notEquals(other: Integer): boolean;
+      greaterThan(other: Integer): boolean;
+      greaterThanOrEqual(other: Integer): boolean;
+      lessThan(other: Integer): boolean;
+      lessThanOrEqual(other: Integer): boolean;
+      compare(other: Integer): number;
+      shorten(numBits: number): Integer;
+      negate(): Integer;
+      add(other: Integer): Integer;
+      subtract(other: Integer): Integer;
+      multiply(other: Integer): Integer;
+      divide(other: Integer): Integer;
+      modulo(other: Integer): Integer;
+      not(): Integer;
+      and(other: Integer): Integer;
+      or(other: Integer): Integer;
+      xor(other: Integer): Integer;
+      shiftLeft(numBits: number): Integer;
+      shiftRight(numBits: number): Integer;
+      inspect(): string;
+      abs(): Integer;
+      toJSON(): string;
+    }
+
+    interface LocalDateStatic {
+      new(year: number, month: number, day: number): LocalDate;
+
+      now(): LocalDate;
+      utcNow(): LocalDate;
+      fromDate(date: Date): LocalDate;
+      fromString(value: string): LocalDate;
+      fromBuffer(buffer: Buffer): LocalDate;
+    }
+    
+    interface LocalDate {
+      _value: number;
+      year: number;
+      month: number;
+      day: number;
+
+      equals(other: LocalDate): boolean;
+      inspect(): string;
+      toBuffer(): Buffer;
+      toString(): string;
+      toJSON(): string;
+    }
+
+    interface LocalTimeStatic {
+      new (totalNanoseconds: _Long): LocalTime;
+
+      fromString(value: string): LocalTime;
+      now(nanoseconds?: number): LocalTime;
+      fromDate(date: Date, nanoseconds: number): LocalTime;
+      fromMilliseconds(milliseconds: number, nanoseconds?: number): LocalTime;
+      fromBuffer(value: Buffer): LocalTime;
+    }
+
+    interface LocalTime {
+      hour: number;
+      minute: number;
+      second: number;
+      nanosecond: number;
+
+      compare(other: LocalTime): boolean;
+      equals(other: LocalTime): boolean;
+      getTotalNanoseconds(): _Long;
+      inspect(): string;
+      toBuffer(): Buffer;
+      toString(): string;
+      toJSON(): string;
+    }
+
+    interface ResultSetStatic {
+      new(response: any, host: string, triedHost: { [key:string]: any }, consistency: consistencies): ResultSet;
+    }
+
+    interface ResultSet {
+      info: {
+        queriedHost: Host,
+        triedHosts: { [key:string]:string; },
+        achievedConsistency: consistencies,
+        traceId: Uuid,
+        warnings: Array<string>,
+        customPayload: any
+      };
+      rows: Array<Row>;
+      rowLength: number;
+      columns: Array<{ [key:string]:string; }>;
+      pageState: string;
+      nextPage: any; // function
+
+      first(): Row;
+      getPageState(): string;
+      getColumns(): Array<{ [key:string]:string; }>;
+    }
+
+    interface ResultStreamStatic {
+      new (opt: any): ResultSet;
+    }
+
+    interface ResultStream extends stream.Readable {
+      buffer: Buffer;
+      paused: boolean;
+
+      _read(): void;
+      _valve(readNext: Function): void;
+      add(chunk: Buffer): void;
+    }
+
+    interface RowStatic {
+      new(columns: Array<{ [key:string]:string; }>): Row;
+    }
+
+    interface Row {
+      get(columnName: string|number): { [key:string]:any; };
+      values(): Array<{ [key:string]:any; }>;
+      keys(): Array<string>;
+      forEach(callback: Callback): void;
+    }
+
+    interface TimeUuidStatic {
+      new (value?: Date, ticks?: number, nodeId?: string|Buffer, clockId?: string|Buffer): TimeUuid;
+      
+      fromDate(date: Date, ticks?: number, nodeId?: string|Buffer, clockId?: string|Buffer): TimeUuid;
+      fromString(value: string): TimeUuid;
+      min(date: Date, ticks?: number): TimeUuid;
+      max(date: Date, ticks?: number): TimeUuid;
+      now(nodeId?: string|Buffer, clockId?: string|Buffer): TimeUuid;
+    }
+
+    interface TimeUuid extends Uuid {
+      getDatePrecision(): { date: Date, ticks: number };
+      getDate(): Date;
+      getNodeId(): Buffer;
+      getNodeIdString(): string;
+    }
+
+    interface TupleStatic {
+      new (...arguments: Array<any>): Tuple;
+
+      fromArray(elements: Array<any>): Tuple;
+    }
+
+    interface Tuple {
+      elements: Array<any>;
+      length: number;
+      
+      get(index: number): any;
+      toString(): string;
+      toJSON(): string;
+      values(): Array<any>;
+    }
+
+    interface UuidStatic {
+      new (buffer: Buffer): Uuid;
+
+      fromString(value: string): Uuid;
+      random(): Uuid;
+    }
+
+    interface Uuid {
+      buffer: Buffer;
+
+      getBuffer(): Buffer;
+      equals(other: types.Uuid): boolean;
+      toString(): string;
+      inspect(): string;
+      toJSON(): string;
+    }
+  }
+
+  var Client: ClientStatic;
+  var Host: HostStatic;
+  var HostMap: HostMapStatic;
+  var Encoder: EncoderStatic;
+
+  interface ClientOptions {
+    contactPoints: Array<string>,
+    keyspace: string,
+    policies?: {
+      addressResolution?: policies.addressResolution.AddressTranslator,
+      loadBalancing?: policies.loadBalancing.LoadBalancingPolicy,
+      reconnection?: policies.reconnection.ReconnectionPolicy,
+      retry?: policies.retry.RetryPolicy
+    },
+    queryOptions?: QueryOptions,
+    pooling?: {
+      heartBeatInterval: number,
+      coreConnectionsPerHost: { [key:number]:number; },
+      warmup: boolean;
+    },
+    protocolOptions?: {
+      port: number,
+      maxSchemaAgreementWaitSeconds: number,
+      maxVersion: number
+    },
+    socketOptions?: {
+      connectTimeout: number,
+      defunctReadTimeoutThreshold: number,
+      keepAlive: boolean,
+      keepAliveDelay: number,
+      readTimeout: number,
+      tcpNoDelay: boolean,
+      coalescingThreshold: number
+    },
+    authProvider?: auth.AuthProvider,
+    sslOptions?: any,
+    encoding?: {
+      map: Function,
+      set: Function,
+      copyBuffer: boolean,
+      useUndefinedAsUnset: boolean
+    }
+  }
+
+  interface QueryOptions {
+    autoPage?: boolean;
+    captureStackTrace?: boolean;
+    consistency: number;
+    customPayload?: any;
+    fetchSize?: number;
+    hints: Array<string> | Array<Array<string>>;
+    logged?: boolean;
+    pageState?: Buffer|string;
+    prepare?: boolean;
+    readTimeout?: number;
+    retry?: policies.retry.RetryPolicy;
+    retryOnTimeout?: boolean;
+    routingIndexes?: Array<number>;
+    routingKey?: Buffer | Array<Buffer>;
+    routingNames?: Array<string>;
+    serialConsistency?: number;
+    timestamp?: number | _Long;
+    traceQuery?: boolean;
+  }
+
+  interface ClientStatic {
+    new(options?: ClientOptions): Client;
+  }
+
+  interface Client extends events.EventEmitter {
+    hosts: HostMap;
+    keyspace: string;
+    metadata: metadata.Metadata;
+
+    batch(queries: Array<string>|Array<{query: string, params?: any}>, options: QueryOptions, callback: ResultCallback): void;
+    connect(callback: Callback): void;
+    eachRow(query: string, params?: any, options?: QueryOptions, rowCallback?: Callback, callback?: Callback): void;
+    execute(query: string, params?: any, options?: QueryOptions, callback?: ResultCallback): void;
+    getReplicas(keyspace: string, token: Buffer): Array<any>; // TODO: Should this be a more explicit return?
+    shutdown(callback?: Callback): void;
+    stream(query: string, params?: any, options?: QueryOptions, callback?: Callback): void;
+  }
+
+  interface HostStatic {
+    new(address: string, protocolVersion: number, options: ClientOptions): Host;
+  }
+
+  interface Host extends events.EventEmitter {
+    address: string;
+    cassandraVersion: string;
+    dataCenter: string;
+    rack: string;
+    tokens: Array<string>;
+
+    canBeConsideredAsUp(): boolean;
+    getCassandraVersion(): Array<number>;
+    isUp(): boolean;
+  }
+
+  interface HostMapStatic {
+    new (): HostMap;
+  }
+
+  interface HostMap extends events.EventEmitter {
+    length: number;
+
+    forEach(callback: Callback): void;
+    get(key: string): Host;
+    keys(): Array<string>;
+    remove(key: string): void;
+    removeMultiple(keys: Array<string>): void;
+    set(key: string, value: Host): void;
+    values(): Array<Host>;
+  }
+
+  interface EncoderStatic {
+    new(protocolVersion: number, options: ClientOptions) : Encoder; 
+  }
+
+  interface Encoder {
+    decode(buffer: Buffer, type: {code: number, info?: any}): void;
+    encode(value: any, typeInfo?: string|number|{code: number, info?: any}): Buffer;
+  }
+
+  namespace auth {
+    var Authenticator: AuthenticatorStatic;
+    var PlainTextAuthProvider: PlainTextAuthProviderStatic;
+
+    interface AuthenticatorStatic {
+      new (): Authenticator;
+    }
+
+    interface Authenticator {
+      evaluateChallenge(challenge: Buffer, callback: Callback): void;
+      initialResponse(callback: Callback): void;
+      onAuthenticationSuccess(token?: Buffer): void;
+    }
+
+    interface AuthProvider {
+      newAuthenticator(endpoint: string, name: string): void;
+    }
+
+    interface PlainTextAuthProviderStatic {
+      new (username: string, password: string): PlainTextAuthProvider;
+    }
+
+    interface PlainTextAuthProvider extends AuthProvider {
+      newAuthenticator(endpoint: string, name: string): void;
+    }
+  }
+
+  namespace errors {
+    abstract class DriverError {
+      constructor(message: string, constructor?: any);
+    }
+
+    class ArgumentError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class AuthenticationError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class DriverInternalError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class NoHostAvailableError extends DriverError {
+      constructor(innerErrors: any, message?: string); 
+    }
+
+    class NotSupportedError extends DriverError {
+      constructor(message: string); 
+    }
+
+    class OperationTimedOutError extends DriverError {}
+
+    class ResponseError extends DriverError {
+      constructor(code: number, message: string); 
+    }
+  }
+
+  namespace metadata {
+    var Aggregate: AggregateStatic;
+    var Index: IndexStatic;
+    var MaterializedView: MaterializedViewStatic;
+    var Metadata: MetadataStatic;
+    var SchemaFunction: SchemaFunctionStatic;
+    var TableMetadata: TableMetadataStatic;
+
+    type caching = "all" | "keys_only" | "rows_only" | "none";
+
+    interface AggregateStatic {
+      new (): Aggregate;
+    }
+
+    interface Aggregate {
+      argumentTypes: Array<{ code: number, info: any}>;
+      finalFunction: string;
+      initCondition: string;
+      keyspaceName: string,
+      returnType: string;
+      signature: Array<string>;
+      stateFunction: string;
+      stateType: string;
+    }
+
+    interface DataTypeInfo {
+      code: number,
+      info: string | DataTypeInfo | Array<DataTypeInfo>,
+      options: {
+        frozen: boolean,
+        reversed: boolean
+      }
+    }
+
+    interface ColumnInfo {
+      name: string,
+      type: DataTypeInfo
+    }
+
+    interface DataCollection {
+      bloomFilterFalsePositiveChance: number;
+      caching: caching;
+      clusterKeys: Array<{ c: ColumnInfo, index: number, order: string }>;
+      clusteringOrder: Array<string>;
+      columns: Array<ColumnInfo>;
+      columnsByName: { [key: string]: ColumnInfo };
+      comment: string;
+      compactionClass: string;
+      compactionOptions: any;
+      compression: any;
+      crcCheckChange?: number;
+      defaultTtl: number;
+      extensions: any;
+      gcGraceSeconds: number;
+      localReadRepairChance: number;
+      maxIndexInterval?: number;
+      minIndexInterval?: number;
+      name: string;
+      partitionKeys: Array<{ c: ColumnInfo, index: number }>
+      populateCacheOnFlush: boolean;
+      readRepairChance: number;
+      speculateRetry: string;
+    }
+
+    enum IndexType {
+      custom = 0,
+      keys,
+      composites
+    }
+
+    interface IndexStatic {
+      new (name: string, target: string, kind: IndexType, options: Object): Index;
+      
+      fromRows(indexRows: Array<types.Row>): Array<Index>;
+      fromColumnRows(columnRows: Array<types.Row>, columnsByName: { [key:string]: ColumnInfo }): Array<Index>;
+    }
+
+    interface Index {
+      kind: IndexType;
+      name: string;
+      options: Object;
+      target: string;
+
+      isCompositesKind(): boolean;
+      isCustomKind(): boolean;
+      isKeysKind(): boolean;
+    }
+
+    interface MaterializedViewStatic {
+      new (name: string): MaterializedView;
+    }
+
+    interface MaterializedView extends DataCollection {}
+
+    interface MetadataStatic {
+      new (options: ClientOptions, controlConnection: any): Metadata;
+    }
+
+    interface Metadata {
+      clearPrepared(): void;
+
+      getAggregate(keyspaceName: string, name: string, signature: Array<string> | Array<{ code: number, info: any }>, callback: Callback): void;
+      getAggregates(keyspaceName: string, name: string, callback: Callback): void;
+      getFunction(keyspaceName: string, name: string, signature: Array<string> | Array<{ code: number, info: any }>, callback: Callback): void;
+      getFunctions(keyspaceName: string, name: string, callback: Callback): void;
+      getMaterializedView(keyspaceName: string, name: string, callback: Callback): void;
+      getReplicas(keyspaceName: string, tokenBuffer: Buffer): Array<any>;
+      getTable(keyspaceName: string, name: string, callback: Callback): void;
+      getTrace(traceId: types.Uuid, callback: Callback): void;
+      getUdt(keyspaceName: string, name: string, callback: Callback): void;
+      refreshKeyspace(name: string, callback?: Callback): void;
+      refreshKeyspaces(callback?: Callback): void;
+    }
+
+    interface SchemaFunctionStatic {
+      new (): SchemaFunction;
+    }
+
+    interface SchemaFunction {
+      argumentNames: Array<string>;
+      argumentTypes: Array<{ code: number, info: any}>;
+      body: string;
+      calledOnNullInput: boolean;
+      keyspaceName: string,
+      language: string;
+      name: string;
+      returnType: string;
+      signature: Array<string>;
+    }
+
+    interface TableMetadataStatic {
+      new (name: string): TableMetadata;
+    }
+
+    interface TableMetadata extends DataCollection {
+      indexes: Array<Index>;
+      indexInterval?: number;
+      isCompact: boolean;
+      memtableFlushPeriod: number;
+      replicateOnWrite: boolean;
+    }
+  }
+}
\ No newline at end of file
diff --git a/cassandra-driver/cassandra-driver.tests.ts b/cassandra-driver/cassandra-driver.tests.ts
new file mode 100644
index 0000000000..3eebf93018
--- /dev/null
+++ b/cassandra-driver/cassandra-driver.tests.ts
@@ -0,0 +1,11 @@
+/// <reference path="cassandra-driver.d.ts" />
+
+import * as cassandra from 'cassandra-driver';
+import * as util from 'util';
+
+var client = new cassandra.Client({ contactPoints: ['h1', 'h2'], keyspace: 'ks1'});
+
+var query = 'SELECT email, last_name FROM user_profiles WHERE key=?';
+client.execute(query, ['guy'], function(err, result) {
+  console.log('got user profile with email ' + result.rows[0].email);
+});
\ No newline at end of file

From c5d5cae0cea028224b2a61309c270073dbe32644 Mon Sep 17 00:00:00 2001
From: Matt Strom <strom.matt@gmail.com>
Date: Thu, 23 Jun 2016 12:13:02 -0700
Subject: [PATCH 277/278] Updated function signatures for prompt()

Add function signature overloads for prompt() method on IYeomanGenerator and YeomanGeneratorBase to conform to Promise-based implementation (see https://github.com/yeoman/generator/blob/master/lib/base.js#L229-L238)
---
 yeoman-generator/yeoman-generator.d.ts | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/yeoman-generator/yeoman-generator.d.ts b/yeoman-generator/yeoman-generator.d.ts
index d233c627d3..0708dfac0c 100644
--- a/yeoman-generator/yeoman-generator.d.ts
+++ b/yeoman-generator/yeoman-generator.d.ts
@@ -22,6 +22,7 @@ declare module yo {
         sourceRoot(rootPath?: string): string;
         templatePath(...path: string[]): string;
         prompt(opt: IPromptOptions | IPromptOptions[], callback: (answers: any) => void): void;
+        prompt<T>(opt: IPromptOptions | IPromptOptions[]): PromiseLike<T>;
         npmInstall(packages?: string[] | string, options?: any, cb?: Function): void;
         installDependencies(options?: IInstallDependencyOptions): void;
         spawnCommand(name: string, args?: string[], options?: Object): void;
@@ -59,6 +60,7 @@ declare module yo {
 
         async(): any;
         prompt(opt: IPromptOptions | IPromptOptions[], callback: (answers: any) => void): void;
+        prompt<T>(opt: IPromptOptions | IPromptOptions[]): PromiseLike<T>;
         log(message: string) : void;
         npmInstall(packages: string[], options?: any, cb?: Function) :void;
         installDependencies(options?: IInstallDependencyOptions): void;

From fe06afa8189ebf51b50489b07fc2e03656d6a049 Mon Sep 17 00:00:00 2001
From: boenkes <sylvie.boenke-bowden@autodesk.com>
Date: Thu, 23 Jun 2016 14:54:51 -0700
Subject: [PATCH 278/278] adding 'delay' definition to redux-saga DT

---
 redux-saga/redux-saga.d.ts | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/redux-saga/redux-saga.d.ts b/redux-saga/redux-saga.d.ts
index a51e8faee7..8df9f63a9c 100644
--- a/redux-saga/redux-saga.d.ts
+++ b/redux-saga/redux-saga.d.ts
@@ -45,6 +45,10 @@ declare module 'redux-saga' {
 
   export function takeLatest(pattern: Pattern, saga: Saga, ...args: any[]): { [Symbol.iterator](): IterableIterator<any> };
 
+  export function delay(ms: number): Promise<boolean>;
+
+  export function delay<T>(ms: number, val: T): Promise<T>;
+
   export function isCancelError(e: any): boolean;
 }