gnache-cli 0.0.1-security → 6.12.2

package/node_modules/@types/bn.js/LICENSE

@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation. All rights reserved.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE

package/node_modules/@types/bn.js/README.md

@@ -0,0 +1,16 @@
+# Installation
+> `npm install --save @types/bn.js`
+
+# Summary
+This package contains type definitions for bn.js (https://github.com/indutny/bn.js).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/bn.js.
+
+### Additional Details
+ * Last updated: Fri, 03 Jan 2020 23:18:13 GMT
+ * Dependencies: [@types/node](https://npmjs.com/package/@types/node)
+ * Global values: none
+
+# Credits
+These definitions were written by Leonid Logvinov (https://github.com/LogvinovLeon), Henry Nguyen (https://github.com/HenryNguyen5), and Gaylor Bosson (https://github.com/Gilthoniel).

package/node_modules/@types/bn.js/index.d.ts

@@ -0,0 +1,586 @@
+// Type definitions for bn.js 4.11
+// Project: https://github.com/indutny/bn.js
+// Definitions by: Leonid Logvinov <https://github.com/LogvinovLeon>
+//                 Henry Nguyen <https://github.com/HenryNguyen5>
+//                 Gaylor Bosson <https://github.com/Gilthoniel>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+/// <reference types="node"/>
+
+declare namespace BN {
+    type Endianness = 'le' | 'be';
+    type IPrimeName = 'k256' | 'p224' | 'p192' | 'p25519';
+
+    interface MPrime {
+        name: string;
+        p: BN;
+        n: number;
+        k: BN;
+    }
+
+    interface ReductionContext {
+        m: number;
+        prime: MPrime;
+        [key: string]: any;
+    }
+}
+
+declare class BN {
+    constructor(
+        number: number | string | number[] | Uint8Array | Buffer | BN,
+        base?: number | 'hex',
+        endian?: BN.Endianness
+    );
+    constructor(
+        number: number | string | number[] | Uint8Array | Buffer | BN,
+        endian?: BN.Endianness
+    )
+
+    /**
+     * @description  create a reduction context
+     */
+    static red(reductionContext: BN | BN.IPrimeName): BN.ReductionContext;
+
+    /**
+     * @description  create a reduction context  with the Montgomery trick.
+     */
+    static mont(num: BN): BN.ReductionContext;
+
+    /**
+     * @description returns true if the supplied object is a BN.js instance
+     */
+    static isBN(b: any): b is BN;
+
+    /**
+     * @description returns the maximum of 2 BN instances.
+     */
+    static max(left: BN, right: BN): BN;
+
+    /**
+     * @description returns the minimum of 2 BN instances.
+     */
+    static min(left: BN, right: BN): BN;
+
+    /**
+     * @description  clone number
+     */
+    clone(): BN;
+
+    /**
+     * @description  convert to base-string and pad with zeroes
+     */
+    toString(base?: number | 'hex', length?: number): string;
+
+    /**
+     * @description convert to Javascript Number (limited to 53 bits)
+     */
+    toNumber(): number;
+
+    /**
+     * @description convert to JSON compatible hex string (alias of toString(16))
+     */
+    toJSON(): string;
+
+    /**
+     * @description  convert to byte Array, and optionally zero pad to length, throwing if already exceeding
+     */
+    toArray(endian?: BN.Endianness, length?: number): number[];
+
+    /**
+     * @description convert to an instance of `type`, which must behave like an Array
+     */
+    toArrayLike(
+        ArrayType: typeof Buffer,
+        endian?: BN.Endianness,
+        length?: number
+    ): Buffer;
+
+    toArrayLike(
+        ArrayType: any[],
+        endian?: BN.Endianness,
+        length?: number
+    ): any[];
+
+    /**
+     * @description  convert to Node.js Buffer (if available). For compatibility with browserify and similar tools, use this instead: a.toArrayLike(Buffer, endian, length)
+     */
+    toBuffer(endian?: BN.Endianness, length?: number): Buffer;
+
+    /**
+     * @description get number of bits occupied
+     */
+    bitLength(): number;
+
+    /**
+     * @description return number of less-significant consequent zero bits (example: 1010000 has 4 zero bits)
+     */
+    zeroBits(): number;
+
+    /**
+     * @description return number of bytes occupied
+     */
+    byteLength(): number;
+
+    /**
+     * @description  true if the number is negative
+     */
+    isNeg(): boolean;
+
+    /**
+     * @description  check if value is even
+     */
+    isEven(): boolean;
+
+    /**
+     * @description   check if value is odd
+     */
+    isOdd(): boolean;
+
+    /**
+     * @description  check if value is zero
+     */
+    isZero(): boolean;
+
+    /**
+     * @description compare numbers and return `-1 (a < b)`, `0 (a == b)`, or `1 (a > b)` depending on the comparison result
+     */
+    cmp(b: BN): -1 | 0 | 1;
+
+    /**
+     * @description compare numbers and return `-1 (a < b)`, `0 (a == b)`, or `1 (a > b)` depending on the comparison result
+     */
+    ucmp(b: BN): -1 | 0 | 1;
+
+    /**
+     * @description compare numbers and return `-1 (a < b)`, `0 (a == b)`, or `1 (a > b)` depending on the comparison result
+     */
+    cmpn(b: number): -1 | 0 | 1;
+
+    /**
+     * @description a less than b
+     */
+    lt(b: BN): boolean;
+
+    /**
+     * @description a less than b
+     */
+    ltn(b: number): boolean;
+
+    /**
+     * @description a less than or equals b
+     */
+    lte(b: BN): boolean;
+
+    /**
+     * @description a less than or equals b
+     */
+    lten(b: number): boolean;
+
+    /**
+     * @description a greater than b
+     */
+    gt(b: BN): boolean;
+
+    /**
+     * @description a greater than b
+     */
+    gtn(b: number): boolean;
+
+    /**
+     * @description a greater than or equals b
+     */
+    gte(b: BN): boolean;
+
+    /**
+     * @description a greater than or equals b
+     */
+    gten(b: number): boolean;
+
+    /**
+     * @description a equals b
+     */
+    eq(b: BN): boolean;
+
+    /**
+     * @description a equals b
+     */
+    eqn(b: number): boolean;
+
+    /**
+     * @description convert to two's complement representation, where width is bit width
+     */
+    toTwos(width: number): BN;
+
+    /**
+     * @description  convert from two's complement representation, where width is the bit width
+     */
+    fromTwos(width: number): BN;
+
+    /**
+     * @description negate sign
+     */
+    neg(): BN;
+
+    /**
+     * @description negate sign
+     */
+    ineg(): BN;
+
+    /**
+     * @description absolute value
+     */
+    abs(): BN;
+
+    /**
+     * @description absolute value
+     */
+    iabs(): BN;
+
+    /**
+     * @description addition
+     */
+    add(b: BN): BN;
+
+    /**
+     * @description  addition
+     */
+    iadd(b: BN): BN;
+
+    /**
+     * @description addition
+     */
+    addn(b: number): BN;
+
+    /**
+     * @description addition
+     */
+    iaddn(b: number): BN;
+
+    /**
+     * @description subtraction
+     */
+    sub(b: BN): BN;
+
+    /**
+     * @description subtraction
+     */
+    isub(b: BN): BN;
+
+    /**
+     * @description subtraction
+     */
+    subn(b: number): BN;
+
+    /**
+     * @description subtraction
+     */
+    isubn(b: number): BN;
+
+    /**
+     * @description multiply
+     */
+    mul(b: BN): BN;
+
+    /**
+     * @description multiply
+     */
+    imul(b: BN): BN;
+
+    /**
+     * @description multiply
+     */
+    muln(b: number): BN;
+
+    /**
+     * @description multiply
+     */
+    imuln(b: number): BN;
+
+    /**
+     * @description square
+     */
+    sqr(): BN;
+
+    /**
+     * @description square
+     */
+    isqr(): BN;
+
+    /**
+     * @description raise `a` to the power of `b`
+     */
+    pow(b: BN): BN;
+
+    /**
+     * @description divide
+     */
+    div(b: BN): BN;
+
+    /**
+     * @description divide
+     */
+    divn(b: number): BN;
+
+    /**
+     * @description divide
+     */
+    idivn(b: number): BN;
+
+    /**
+     * @description reduct
+     */
+    mod(b: BN): BN;
+
+    /**
+     * @description reduct
+     */
+    umod(b: BN): BN;
+
+    /**
+     * @see API consistency https://github.com/indutny/bn.js/pull/130
+     * @description reduct
+     */
+    modn(b: number): number;
+
+    /**
+     * @description  rounded division
+     */
+    divRound(b: BN): BN;
+
+    /**
+     * @description or
+     */
+    or(b: BN): BN;
+
+    /**
+     * @description or
+     */
+    ior(b: BN): BN;
+
+    /**
+     * @description or
+     */
+    uor(b: BN): BN;
+
+    /**
+     * @description or
+     */
+    iuor(b: BN): BN;
+
+    /**
+     * @description and
+     */
+    and(b: BN): BN;
+
+    /**
+     * @description and
+     */
+    iand(b: BN): BN;
+
+    /**
+     * @description and
+     */
+    uand(b: BN): BN;
+
+    /**
+     * @description and
+     */
+    iuand(b: BN): BN;
+
+    /**
+     * @description and (NOTE: `andln` is going to be replaced with `andn` in future)
+     */
+    andln(b: number): BN;
+
+    /**
+     * @description xor
+     */
+    xor(b: BN): BN;
+
+    /**
+     * @description xor
+     */
+    ixor(b: BN): BN;
+
+    /**
+     * @description xor
+     */
+    uxor(b: BN): BN;
+
+    /**
+     * @description xor
+     */
+    iuxor(b: BN): BN;
+
+    /**
+     * @description set specified bit to 1
+     */
+    setn(b: number): BN;
+
+    /**
+     * @description shift left
+     */
+    shln(b: number): BN;
+
+    /**
+     * @description shift left
+     */
+    ishln(b: number): BN;
+
+    /**
+     * @description shift left
+     */
+    ushln(b: number): BN;
+
+    /**
+     * @description shift left
+     */
+    iushln(b: number): BN;
+
+    /**
+     * @description shift right
+     */
+    shrn(b: number): BN;
+
+    /**
+     * @description shift right (unimplemented https://github.com/indutny/bn.js/blob/master/lib/bn.js#L2086)
+     */
+    ishrn(b: number): BN;
+
+    /**
+     * @description shift right
+     */
+    ushrn(b: number): BN;
+    /**
+     * @description shift right
+     */
+
+    iushrn(b: number): BN;
+    /**
+     * @description  test if specified bit is set
+     */
+
+    testn(b: number): boolean;
+    /**
+     * @description clear bits with indexes higher or equal to `b`
+     */
+
+    maskn(b: number): BN;
+    /**
+     * @description clear bits with indexes higher or equal to `b`
+     */
+
+    imaskn(b: number): BN;
+    /**
+     * @description add `1 << b` to the number
+     */
+    bincn(b: number): BN;
+
+    /**
+     * @description not (for the width specified by `w`)
+     */
+    notn(w: number): BN;
+
+    /**
+     * @description not (for the width specified by `w`)
+     */
+    inotn(w: number): BN;
+
+    /**
+     * @description GCD
+     */
+    gcd(b: BN): BN;
+
+    /**
+     * @description Extended GCD results `({ a: ..., b: ..., gcd: ... })`
+     */
+    egcd(b: BN): { a: BN; b: BN; gcd: BN };
+
+    /**
+     * @description inverse `a` modulo `b`
+     */
+    invm(b: BN): BN;
+
+    /**
+     * @description Convert number to red
+     */
+    toRed(reductionContext: BN.ReductionContext): RedBN;
+}
+
+/**
+ * Big-Number class with additionnal methods that are using modular
+ * operation.
+ */
+declare class RedBN extends BN {
+    /**
+     * @description Convert back a number using a reduction context
+     */
+    fromRed(): BN;
+
+    /**
+     * @description modular addition
+     */
+    redAdd(b: BN): RedBN;
+
+    /**
+     * @description in-place modular addition
+     */
+    redIAdd(b: BN): RedBN;
+
+    /**
+     * @description modular subtraction
+     */
+    redSub(b: BN): RedBN;
+
+    /**
+     * @description in-place modular subtraction
+     */
+    redISub(b: BN): RedBN;
+
+    /**
+     * @description modular shift left
+     */
+    redShl(num: number): RedBN;
+
+    /**
+     * @description modular multiplication
+     */
+    redMul(b: BN): RedBN;
+
+    /**
+     * @description in-place modular multiplication
+     */
+    redIMul(b: BN): RedBN;
+
+    /**
+     * @description modular square
+     */
+    redSqr(): RedBN;
+
+    /**
+     * @description in-place modular square
+     */
+    redISqr(): RedBN;
+
+    /**
+     * @description modular square root
+     */
+    redSqrt(): RedBN;
+
+    /**
+     * @description modular inverse of the number
+     */
+    redInvm(): RedBN;
+
+    /**
+     * @description modular negation
+     */
+    redNeg(): RedBN;
+
+    /**
+     * @description modular exponentiation
+     */
+    redPow(b: BN): RedBN;
+}
+
+export = BN;

package/node_modules/@types/bn.js/package.json

@@ -0,0 +1,40 @@
+{
+    "name": "@types/bn.js",
+    "version": "4.11.6",
+    "description": "TypeScript definitions for bn.js",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "Leonid Logvinov",
+            "url": "https://github.com/LogvinovLeon",
+            "githubUsername": "LogvinovLeon"
+        },
+        {
+            "name": "Henry Nguyen",
+            "url": "https://github.com/HenryNguyen5",
+            "githubUsername": "HenryNguyen5"
+        },
+        {
+            "name": "Gaylor Bosson",
+            "url": "https://github.com/Gilthoniel",
+            "githubUsername": "Gilthoniel"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/bn.js"
+    },
+    "scripts": {},
+    "dependencies": {
+        "@types/node": "*"
+    },
+    "typesPublisherContentHash": "ca69ec916d802a517fb065f342c3de9fdb96529c8876e50e1a2021da7c6a7cf6",
+    "typeScriptVersion": "2.8"
+
+,"_resolved": "https://registry.npmjs.org/@types/bn.js/-/bn.js-4.11.6.tgz"
+,"_integrity": "sha512-pqr857jrp2kPuO9uRjZ3PwnJTjoQy+fcdxvBTvHm6dkmEL9q+hDD/2j/0ELOBPtPnS8LjCX0gI9nbl8lVkadpg=="
+,"_from": "@types/bn.js@4.11.6"
+}

package/node_modules/@types/node/LICENSE

@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE

package/node_modules/@types/node/README.md

@@ -0,0 +1,16 @@
+# Installation
+> `npm install --save @types/node`
+
+# Summary
+This package contains type definitions for Node.js (http://nodejs.org/).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/node.
+
+### Additional Details
+ * Last updated: Tue, 22 Sep 2020 00:22:04 GMT
+ * Dependencies: none
+ * Global values: `Buffer`, `__dirname`, `__filename`, `clearImmediate`, `clearInterval`, `clearTimeout`, `console`, `exports`, `global`, `module`, `process`, `queueMicrotask`, `require`, `setImmediate`, `setInterval`, `setTimeout`
+
+# Credits
+These definitions were written by [Microsoft TypeScript](https://github.com/Microsoft), [DefinitelyTyped](https://github.com/DefinitelyTyped), [Alberto Schiabel](https://github.com/jkomyno), [Alexander T.](https://github.com/a-tarasyuk), [Alvis HT Tang](https://github.com/alvis), [Andrew Makarov](https://github.com/r3nya), [Benjamin Toueg](https://github.com/btoueg), [Bruno Scheufler](https://github.com/brunoscheufler), [Chigozirim C.](https://github.com/smac89), [David Junger](https://github.com/touffy), [Deividas Bakanas](https://github.com/DeividasBakanas), [Eugene Y. Q. Shen](https://github.com/eyqs), [Flarna](https://github.com/Flarna), [Hannes Magnusson](https://github.com/Hannes-Magnusson-CK), [Hoàng Văn Khải](https://github.com/KSXGitHub), [Huw](https://github.com/hoo29), [Kelvin Jin](https://github.com/kjin), [Klaus Meinhardt](https://github.com/ajafff), [Lishude](https://github.com/islishude), [Mariusz Wiktorczyk](https://github.com/mwiktorczyk), [Mohsen Azimi](https://github.com/mohsen1), [Nicolas Even](https://github.com/n-e), [Nikita Galkin](https://github.com/galkin), [Parambir Singh](https://github.com/parambirs), [Sebastian Silbermann](https://github.com/eps1lon), [Simon Schick](https://github.com/SimonSchick), [Thomas den Hollander](https://github.com/ThomasdenH), [Wilco Bakker](https://github.com/WilcoBakker), [wwwy3y3](https://github.com/wwwy3y3), [Samuel Ainsworth](https://github.com/samuela), [Kyle Uehlein](https://github.com/kuehlein), [Jordi Oliveras Rovira](https://github.com/j-oliveras), [Thanik Bhongbhibhat](https://github.com/bhongy), [Marcin Kopacz](https://github.com/chyzwar), [Trivikram Kamat](https://github.com/trivikr), [Minh Son Nguyen](https://github.com/nguymin4), [Junxiao Shi](https://github.com/yoursunny), [Ilia Baryshnikov](https://github.com/qwelias), [ExE Boss](https://github.com/ExE-Boss), [Surasak Chaisurin](https://github.com/Ryan-Willpower), [Piotr Błażejewicz](https://github.com/peterblazejewicz), [Anna Henningsen](https://github.com/addaleax), [Jason Kwok](https://github.com/JasonHK), and [Victor Perin](https://github.com/victorperin).