ccxt 4.5.59 → 4.5.61

package/js/src/static_dependencies/jsencrypt/lib/asn1js/hex.js

@@ -1,64 +0,0 @@
-// Hex JavaScript decoder
-// Copyright (c) 2008-2013 Lapo Luchini <lapo@lapo.it>
-// Permission to use, copy, modify, and/or distribute this software for any
-// purpose with or without fee is hereby granted, provided that the above
-// copyright notice and this permission notice appear in all copies.
-//
-// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
-let decoder;
-export const Hex = {
-    decode(a) {
-        let i;
-        if (decoder === undefined) {
-            let hex = "0123456789ABCDEF";
-            const ignore = " \f\n\r\t\u00A0\u2028\u2029";
-            decoder = {};
-            for (i = 0; i < 16; ++i) {
-                decoder[hex.charAt(i)] = i;
-            }
-            hex = hex.toLowerCase();
-            for (i = 10; i < 16; ++i) {
-                decoder[hex.charAt(i)] = i;
-            }
-            for (i = 0; i < ignore.length; ++i) {
-                decoder[ignore.charAt(i)] = -1;
-            }
-        }
-        const out = [];
-        let bits = 0;
-        let char_count = 0;
-        for (i = 0; i < a.length; ++i) {
-            let c = a.charAt(i);
-            if (c == "=") {
-                break;
-            }
-            c = decoder[c];
-            if (c == -1) {
-                continue;
-            }
-            if (c === undefined) {
-                throw new Error("Illegal character at offset " + i);
-            }
-            bits |= c;
-            if (++char_count >= 2) {
-                out[out.length] = bits;
-                bits = 0;
-                char_count = 0;
-            }
-            else {
-                bits <<= 4;
-            }
-        }
-        if (char_count) {
-            throw new Error("Hex encoding incomplete: 4 bits missing");
-        }
-        return out;
-    }
-};

package/js/src/static_dependencies/jsencrypt/lib/asn1js/int10.d.ts

@@ -1,9 +0,0 @@
-export declare class Int10 {
-    constructor(value?: string | number);
-    mulAdd(m: number, c: number): void;
-    sub(c: number): void;
-    toString(base?: number): string;
-    valueOf(): number;
-    simplify(): number | this;
-    private buf;
-}

package/js/src/static_dependencies/jsencrypt/lib/asn1js/int10.js

@@ -1,85 +0,0 @@
-// Big integer base-10 printing library
-// Copyright (c) 2014 Lapo Luchini <lapo@lapo.it>
-// Permission to use, copy, modify, and/or distribute this software for any
-// purpose with or without fee is hereby granted, provided that the above
-// copyright notice and this permission notice appear in all copies.
-//
-// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-// ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-// OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-/*jshint browser: true, strict: true, immed: true, latedef: true, undef: true, regexdash: false */
-const max = 10000000000000; // biggest integer that can still fit 2^53 when multiplied by 256
-export class Int10 {
-    constructor(value) {
-        this.buf = [+value || 0];
-    }
-    mulAdd(m, c) {
-        // assert(m <= 256)
-        const b = this.buf;
-        const l = b.length;
-        let i;
-        let t;
-        for (i = 0; i < l; ++i) {
-            t = b[i] * m + c;
-            if (t < max) {
-                c = 0;
-            }
-            else {
-                c = 0 | (t / max);
-                t -= c * max;
-            }
-            b[i] = t;
-        }
-        if (c > 0) {
-            b[i] = c;
-        }
-    }
-    sub(c) {
-        // assert(m <= 256)
-        const b = this.buf;
-        const l = b.length;
-        let i;
-        let t;
-        for (i = 0; i < l; ++i) {
-            t = b[i] - c;
-            if (t < 0) {
-                t += max;
-                c = 1;
-            }
-            else {
-                c = 0;
-            }
-            b[i] = t;
-        }
-        while (b[b.length - 1] === 0) {
-            b.pop();
-        }
-    }
-    toString(base) {
-        if ((base || 10) != 10) {
-            throw new Error("only base 10 is supported");
-        }
-        const b = this.buf;
-        let s = b[b.length - 1].toString();
-        for (let i = b.length - 2; i >= 0; --i) {
-            s += (max + b[i]).toString().substring(1);
-        }
-        return s;
-    }
-    valueOf() {
-        const b = this.buf;
-        let v = 0;
-        for (let i = b.length - 1; i >= 0; --i) {
-            v = v * max + b[i];
-        }
-        return v;
-    }
-    simplify() {
-        const b = this.buf;
-        return (b.length == 1) ? b[0] : this;
-    }
-}