@types/jsbn - npm Package Compare versions

Comparing version 1.2.28 to 1.2.29

jsbn/index.d.ts

@@ -1,250 +0,249 @@
-// Type definitions for jsbn v1.2
+// Type definitions for jsbn v1.2.29
 // Project: http://www-cs-students.stanford.edu/%7Etjw/jsbn/
-// Definitions by: Eugene Chernyshov <https://github.com/Evgenus>
+// Definitions by: Eugene Chernyshov <https://github.com/Evgenus>, Al Tabayoyon <https://github.com/al2xed>
 // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
 
-declare namespace jsbn {
+export interface RandomGenerator {
+    nextBytes(bytes: number[]): void;
+}
 
-    interface RandomGenerator {
-        nextBytes(bytes: number[]): void;
-    }
+export class BigInteger {
+    constructor(a: number, c: RandomGenerator);
+    constructor(a: number, b: number, c: RandomGenerator);
+    constructor(a: string, b?: number);
+    constructor(a: number[], b?: number);
+    constructor(a: BigInteger);
 
-    export class BigInteger {
-        constructor(a: number, c: RandomGenerator);
-        constructor(a: number, b: number, c: RandomGenerator);
-        constructor(a: string, b?: number);
-        constructor(a: number[], b?: number);
-        constructor(a: BigInteger);
+    s: number;
+    t: number;
+    data: number[]; // forge specific
 
-        s: number;
-        t: number;
-        data: number[]; // forge specific
+    DB: number;
+    DM: number;
+    DV: number;
 
-        DB: number;
-        DM: number;
-        DV: number;
+    FV: number;
+    F1: number;
+    F2: number;
 
-        FV: number;
-        F1: number;
-        F2: number;
+    // am: Compute w_j += (x*this_i), propagate carries,
+    am(i: number, x: number, w: BigInteger, j: number, c: number, n: number): number;
 
-        // am: Compute w_j += (x*this_i), propagate carries,
-        am(i: number, x: number, w: BigInteger, j: number, c: number, n: number): number;
+    // (protected) copy this to r
+    copyTo(r: BigInteger): void;
 
-        // (protected) copy this to r
-        copyTo(r: BigInteger): void;
+    // (protected) set from integer value x, -DV <= x < DV
+    fromInt(x: number): void;
 
-        // (protected) set from integer value x, -DV <= x < DV
-        fromInt(x: number): void;
+    // (protected) set from string and radix
+    fromString(x: string, b: number): void;
 
-        // (protected) set from string and radix
-        fromString(x: string, b: number): void;
+    // (protected) clamp off excess high words
+    clamp(): void;
 
-        // (protected) clamp off excess high words
-        clamp(): void;
+    // (public) return string representation in given radix
+    toString(b?: number): string;
 
-        // (public) return string representation in given radix
-        toString(b?: number): string;
+    // (public) -this
+    negate(): BigInteger;
 
-        // (public) -this
-        negate(): BigInteger;
+    // (public) |this|
+    abs(): BigInteger;
 
-        // (public) |this|
-        abs(): BigInteger;
+    // (public) return + if this > a, - if this < a, 0 if equal
+    compareTo(a: BigInteger): number;
 
-        // (public) return + if this > a, - if this < a, 0 if equal
-        compareTo(a: BigInteger): number;
+    // (public) return the number of bits in "this"
+    bitLength(): number;
 
-        // (public) return the number of bits in "this"
-        bitLength(): number;
+    // (protected) r = this << n*DB
+    dlShiftTo(n: number, r: BigInteger): void;
 
-        // (protected) r = this << n*DB
-        dlShiftTo(n: number, r: BigInteger): void;
+    // (protected) r = this >> n*DB
+    drShiftTo(n: number, r: BigInteger): void;
 
-        // (protected) r = this >> n*DB
-        drShiftTo(n: number, r: BigInteger): void;
+    // (protected) r = this << n
+    lShiftTo(n: number, r: BigInteger): void;
 
-        // (protected) r = this << n
-        lShiftTo(n: number, r: BigInteger): void;
+    // (protected) r = this >> n
+    rShiftTo(n: number, r: BigInteger): void;
 
-        // (protected) r = this >> n
-        rShiftTo(n: number, r: BigInteger): void;
+    // (protected) r = this - a
+    subTo(a: BigInteger, r: BigInteger): void;
 
-        // (protected) r = this - a
-        subTo(a: BigInteger, r: BigInteger): void;
+    // (protected) r = this * a, r != this,a (HAC 14.12)
+    multiplyTo(a: BigInteger, r: BigInteger): void;
 
-        // (protected) r = this * a, r != this,a (HAC 14.12)
-        multiplyTo(a: BigInteger, r: BigInteger): void;
+    // (protected) r = this^2, r != this (HAC 14.16)
+    squareTo(r: BigInteger): void;
 
-        // (protected) r = this^2, r != this (HAC 14.16)
-        squareTo(r: BigInteger): void;
+    // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
+    // r != q, this != m.  q or r may be null.
+    divRemTo(m: BigInteger, q: BigInteger, r: BigInteger): void;
 
-        // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
-        // r != q, this != m.  q or r may be null.
-        divRemTo(m: BigInteger, q: BigInteger, r: BigInteger): void;
+    // (public) this mod a
+    mod(a: BigInteger): BigInteger;
 
-        // (public) this mod a
-        mod(a: BigInteger): BigInteger;
+    // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
+    invDigit(): number;
 
-        // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
-        invDigit(): number;
+    // (protected) true iff this is even
+    isEven(): boolean;
 
-        // (protected) true iff this is even
-        isEven(): boolean;
+    // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
+    exp(e: number, z: Reduction): BigInteger;
 
-        // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
-        exp(e: number, z: Reduction): BigInteger;
+    // (public) this^e % m, 0 <= e < 2^32
+    modPowInt(e: number, m: BigInteger): BigInteger;
 
-        // (public) this^e % m, 0 <= e < 2^32
-        modPowInt(e: number, m: BigInteger): BigInteger;
+    // (public)
+    clone(): BigInteger;
 
-        // (public)
-        clone(): BigInteger;
+    // (public) return value as integer
+    intValue(): number;
 
-        // (public) return value as integer
-        intValue(): number;
+    // (public) return value as byte
+    byteValue(): number;
 
-        // (public) return value as byte
-        byteValue(): number;
+    // (public) return value as short (assumes DB>=16)
+    shortValue(): number;
 
-        // (public) return value as short (assumes DB>=16)
-        shortValue(): number;
+    // (protected) return x s.t. r^x < DV
+    chunkSize(r: number): number;
 
-        // (protected) return x s.t. r^x < DV
-        chunkSize(r: number): number;
+    // (public) 0 if this == 0, 1 if this > 0
+    signum(): number;
 
-        // (public) 0 if this == 0, 1 if this > 0
-        signum(): number;
+    // (protected) convert to radix string
+    toRadix(b: number): string;
 
-        // (protected) convert to radix string
-        toRadix(b: number): string;
+    // (protected) convert from radix string
+    fromRadix(s: string, b: number): void;
 
-        // (protected) convert from radix string
-        fromRadix(s: string, b: number): void;
+    // (protected) alternate constructor
+    fromNumber(a: number, b?: number, c?: number): void;
 
-        // (protected) alternate constructor
-        fromNumber(a: number, b?: number, c?: number): void;
+    // (public) convert to bigendian byte array
+    toByteArray(): number[];
 
-        // (public) convert to bigendian byte array
-        toByteArray(): number[];
+    equals(a: BigInteger): boolean;
 
-        equals(a: BigInteger): boolean;
+    min(a: BigInteger): BigInteger;
 
-        min(a: BigInteger): BigInteger;
+    max(a: BigInteger): BigInteger;
 
-        max(a: BigInteger): BigInteger;
+    // (protected) r = this op a (bitwise)
+    bitwiseTo(a: BigInteger, op: (x: number, y: number) => number, r: BigInteger): void;
 
-        // (protected) r = this op a (bitwise)
-        bitwiseTo(a: BigInteger, op: (x: number, y: number) => number, r: BigInteger): void;
+    // (public) this & a
+    and(a: BigInteger): BigInteger;
 
-        // (public) this & a
-        and(a: BigInteger): BigInteger;
+    // (public) this | a
+    or(a: BigInteger): BigInteger;
 
-        // (public) this | a
-        or(a: BigInteger): BigInteger;
+    // (public) this ^ a
+    xor(a: BigInteger): BigInteger;
 
-        // (public) this ^ a
-        xor(a: BigInteger): BigInteger;
+    // (public) this & ~a
+    andNot(a: BigInteger): BigInteger;
 
-        // (public) this & ~a
-        andNot(a: BigInteger): BigInteger;
+    // (public) ~this
+    not(): BigInteger;
 
-        // (public) ~this
-        not(): BigInteger;
+    // (public) this << n
+    shiftLeft(n: number): BigInteger;
 
-        // (public) this << n
-        shiftLeft(n: number): BigInteger;
+    // (public) this >> n
+    shiftRight(n: number): BigInteger;
 
-        // (public) this >> n
-        shiftRight(n: number): BigInteger;
+    // (public) returns index of lowest 1-bit (or -1 if none)
+    getLowestSetBit(): number;
 
-        // (public) returns index of lowest 1-bit (or -1 if none)
-        getLowestSetBit(): number;
+    // (public) return number of set bits
+    bitCount(): number;
 
-        // (public) return number of set bits
-        bitCount(): number;
+    // (public) true iff nth bit is set
+    testBit(n: number): boolean;
 
-        // (public) true iff nth bit is set
-        testBit(n: number): boolean;
+    // (protected) this op (1<<n)
+    changeBit(n: number, op: (x: number, y: number) => number): BigInteger;
 
-        // (protected) this op (1<<n)
-        changeBit(n: number, op: (x: number, y: number) => number): BigInteger;
+    // (protected) this op (1<<n)
+    setBit(n: number): BigInteger;
 
-        // (protected) this op (1<<n)
-        setBit(n: number): BigInteger;
+    // (public) this & ~(1<<n)
+    clearBit(n: number): BigInteger
 
-        // (public) this & ~(1<<n)
-        clearBit(n: number): BigInteger
+    // (public) this ^ (1<<n)
+    flipBit(n: number): BigInteger
 
-        // (public) this ^ (1<<n)
-        flipBit(n: number): BigInteger
+    // (protected) r = this + a
+    addTo(a: BigInteger, r: BigInteger): void;
 
-        // (protected) r = this + a
-        addTo(a: BigInteger, r: BigInteger): void;
+    // (public) this + a
+    add(a: BigInteger): BigInteger;
 
-        // (public) this + a
-        add(a: BigInteger): BigInteger;
+    // (public) this - a
+    subtract(a: BigInteger): BigInteger;
 
-        // (public) this - a
-        subtract(a: BigInteger): BigInteger;
+    // (public) this * a
+    multiply(a: BigInteger): BigInteger;
 
-        // (public) this * a
-        multiply(a: BigInteger): BigInteger;
+    // (public) this^2
+    square(): BigInteger;
 
-        // (public) this^2
-        square(): BigInteger;
+    // (public) this / a
+    divide(a: BigInteger): BigInteger;
 
-        // (public) this / a
-        divide(a: BigInteger): BigInteger;
+    // (public) this % a
+    remainder(a: BigInteger): BigInteger;
 
-        // (public) this % a
-        remainder(a: BigInteger): BigInteger;
+    // (public) [this/a,this%a]
+    divideAndRemainder(a: BigInteger): BigInteger[]; // Array of 2 items
 
-        // (public) [this/a,this%a]
-        divideAndRemainder(a: BigInteger): BigInteger[]; // Array of 2 items
+    // (protected) this *= n, this >= 0, 1 < n < DV
+    dMultiply(n: number): void;
 
-        // (protected) this *= n, this >= 0, 1 < n < DV
-        dMultiply(n: number): void;
+    // (protected) this += n << w words, this >= 0
+    dAddOffset(n: number, w: number): void;
 
-        // (protected) this += n << w words, this >= 0
-        dAddOffset(n: number, w: number): void;
+    // (public) this^e
+    pow(e: number): BigInteger;
 
-        // (public) this^e
-        pow(e: number): BigInteger;
+    // (protected) r = lower n words of "this * a", a.t <= n
+    multiplyLowerTo(a: BigInteger, n: number, r: BigInteger): void;
 
-        // (protected) r = lower n words of "this * a", a.t <= n
-        multiplyLowerTo(a: BigInteger, n: number, r: BigInteger): void;
+    // (protected) r = "this * a" without lower n words, n > 0
+    multiplyUpperTo(a: BigInteger, n: number, r: BigInteger): void;
 
-        // (protected) r = "this * a" without lower n words, n > 0
-        multiplyUpperTo(a: BigInteger, n: number, r: BigInteger): void;
+    // (public) this^e % m (HAC 14.85)
+    modPow(e: BigInteger, m: BigInteger): BigInteger;
 
-        // (public) this^e % m (HAC 14.85)
-        modPow(e: BigInteger, m: BigInteger): BigInteger;
+    // (public) gcd(this,a) (HAC 14.54)
+    gcd(a: BigInteger): BigInteger;
 
-        // (public) gcd(this,a) (HAC 14.54)
-        gcd(a: BigInteger): BigInteger;
+    // (protected) this % n, n < 2^26
+    modInt(n: number): number;
 
-        // (protected) this % n, n < 2^26
-        modInt(n: number): number;
+    // (public) 1/this % m (HAC 14.61)
+    modInverse(m: BigInteger): BigInteger;
 
-        // (public) 1/this % m (HAC 14.61)
-        modInverse(m: BigInteger): BigInteger;
+    // (public) test primality with certainty >= 1-.5^t
+    isProbablePrime(t: number): boolean;
 
-        // (public) test primality with certainty >= 1-.5^t
-        isProbablePrime(t: number): boolean;
+    // (protected) true if probably prime (HAC 4.24, Miller-Rabin)
+    millerRabin(t: number): boolean;
 
-        // (protected) true if probably prime (HAC 4.24, Miller-Rabin)
-        millerRabin(t: number): boolean;
+    static ZERO: BigInteger;
+    static ONE: BigInteger;
+}
 
-        static ZERO: BigInteger;
-        static ONE: BigInteger;
-    }
+export interface Reduction {
+    convert(x: BigInteger): BigInteger;
+    revert(x: BigInteger): BigInteger;
+    reduce(x: BigInteger): void;
+    mulTo(x: BigInteger, y: BigInteger, r: BigInteger): void;
+    sqrTo(x: BigInteger, r: BigInteger): void;
+}
 
-    interface Reduction {
-        convert(x: BigInteger): BigInteger;
-        revert(x: BigInteger): BigInteger;
-        reduce(x: BigInteger): void;
-        mulTo(x: BigInteger, y: BigInteger, r: BigInteger): void;
-        sqrTo(x: BigInteger, r: BigInteger): void;
-    }
-}
+export as namespace jsbn;

jsbn/package.json

 {
     "name": "@types/jsbn",
-    "version": "1.2.28",
-    "description": "TypeScript definitions for jsbn v1.2",
+    "version": "1.2.29",
+    "description": "TypeScript definitions for jsbn",
     "license": "MIT",
-    "author": "Eugene Chernyshov <https://github.com/Evgenus>",
+    "contributors": [
+        {
+            "name": "Eugene Chernyshov",
+            "url": "https://github.com/Evgenus",
+            "githubUsername": "Evgenus"
+        },
+        {
+            "name": "Al Tabayoyon",
+            "url": "https://github.com/al2xed",
+            "githubUsername": "al2xed"
+        }
+    ],
     "main": "",
@@ -14,4 +25,4 @@ "repository": {
     "dependencies": {},
-    "typings": "index.d.ts",
-    "typesPublisherContentHash": "4b357b9aba1f0edc962614407f18722ef66482c4fe430c2d94d3ca1264cb7105"
+    "typesPublisherContentHash": "6af56f4e21ce7566c030d805e0c887e9e3c5988f83e860c205f51f0721ae9d5a",
+    "typeScriptVersion": "2.0"
 }

jsbn/README.md

@@ -5,15 +5,13 @@ # Installation
 # Summary
-This package contains type definitions for jsbn v1.2 (http://www-cs-students.stanford.edu/%7Etjw/jsbn/).
+This package contains type definitions for jsbn (http://www-cs-students.stanford.edu/%7Etjw/jsbn/).
 
 # Details
-Files were exported from https://www.github.com/DefinitelyTyped/DefinitelyTyped/tree/types-2.0/jsbn
+Files were exported from https://www.github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/jsbn
 
 Additional Details
- * Last updated: Mon, 19 Sep 2016 17:28:59 GMT
- * File structure: Global
- * Library Dependencies: none
- * Module Dependencies: none
+ * Last updated: Sat, 04 Nov 2017 05:34:19 GMT
+ * Dependencies: none
  * Global values: jsbn
 
 # Credits
-These definitions were written by Eugene Chernyshov <https://github.com/Evgenus>.
+These definitions were written by Eugene Chernyshov <https://github.com/Evgenus>, Al Tabayoyon <https://github.com/al2xed>.

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Major refactor

Supply chain risk

Package has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

9473

increased by3.61%

Number of medium supply chain risk alerts

0

decreased by-100%

Worsened metrics

Lines of code

171

decreased by-11.86%

Number of lines in readme file

17

decreased by-10.53%

No dependency changes