@bleedingdev/modern-js-utils 3.9.0-ultramodern.9 → 3.9.3-ultramodern.10

package/dist/compiled/filesize/index.mjs

@@ -0,0 +1,451 @@
+/*! LICENSE: index.mjs.LICENSE.txt */
+import { createRequire } from 'node:module';
+createRequire(import.meta.url);
+var e = {};
+(()=>{
+    e.d = (t, i)=>{
+        for(var n in i)if (e.o(i, n) && !e.o(t, n)) Object.defineProperty(t, n, {
+            enumerable: true,
+            get: i[n]
+        });
+    };
+})();
+(()=>{
+    e.o = (e, t)=>Object.prototype.hasOwnProperty.call(e, t);
+})();
+var t = {};
+e.d(t, {
+    O: ()=>filesize,
+    v: ()=>partial
+});
+/**
+ * filesize
+ *
+ * @copyright 2026 Jason Mulligan <jason.mulligan@avoidwork.com>
+ * @license BSD-3-Clause
+ * @version 11.0.26
+ */ const i = "Invalid number";
+const n = "Invalid rounding method";
+const o = "Invalid precision";
+const l = "iec";
+const r = "jedec";
+const s = "si";
+const a = "bit";
+const c = "bits";
+const f = "byte";
+const u = "bytes";
+const p = "kbit";
+const b = "kB";
+const d = "array";
+const m = "function";
+const g = "object";
+const y = "string";
+const h = "exponent";
+const B = "round";
+const N = "e";
+const M = "";
+const v = ".";
+const O = "s";
+const S = " ";
+const w = "0";
+const x = {
+    symbol: {
+        iec: {
+            bits: [
+                "bit",
+                "Kibit",
+                "Mibit",
+                "Gibit",
+                "Tibit",
+                "Pibit",
+                "Eibit",
+                "Zibit",
+                "Yibit"
+            ],
+            bytes: [
+                "B",
+                "KiB",
+                "MiB",
+                "GiB",
+                "TiB",
+                "PiB",
+                "EiB",
+                "ZiB",
+                "YiB"
+            ]
+        },
+        jedec: {
+            bits: [
+                "bit",
+                "Kbit",
+                "Mbit",
+                "Gbit",
+                "Tbit",
+                "Pbit",
+                "Ebit",
+                "Zbit",
+                "Ybit"
+            ],
+            bytes: [
+                "B",
+                "KB",
+                "MB",
+                "GB",
+                "TB",
+                "PB",
+                "EB",
+                "ZB",
+                "YB"
+            ]
+        }
+    },
+    fullform: {
+        iec: [
+            "",
+            "kibi",
+            "mebi",
+            "gibi",
+            "tebi",
+            "pebi",
+            "exbi",
+            "zebi",
+            "yobi"
+        ],
+        jedec: [
+            "",
+            "kilo",
+            "mega",
+            "giga",
+            "tera",
+            "peta",
+            "exa",
+            "zetta",
+            "yotta"
+        ]
+    }
+};
+const E = [
+    1,
+    1024,
+    1048576,
+    1073741824,
+    1099511627776,
+    0x4000000000000,
+    0x1000000000000000,
+    11805916207174113e5,
+    12089258196146292e8
+];
+const I = [
+    1,
+    1e3,
+    1e6,
+    1e9,
+    1e12,
+    1e15,
+    1e18,
+    1e21,
+    1e24
+];
+const P = Math.log(1024);
+const F = Math.log(1e3);
+const T = {
+    [s]: {
+        isDecimal: true,
+        ceil: 1e3,
+        actualStandard: r
+    },
+    [l]: {
+        isDecimal: false,
+        ceil: 1024,
+        actualStandard: l
+    },
+    [r]: {
+        isDecimal: false,
+        ceil: 1024,
+        actualStandard: r
+    }
+};
+function getBaseConfiguration(e, t) {
+    if (T[e]) return T[e];
+    if (2 === t) return {
+        isDecimal: false,
+        ceil: 1024,
+        actualStandard: l
+    };
+    return {
+        isDecimal: true,
+        ceil: 1e3,
+        actualStandard: r
+    };
+}
+function handleZeroValue(e, t, i, n, o, l, r, s, c, u, p, b = M, m = {}, y = M) {
+    let B;
+    B = e > 0 ? 0..toPrecision(e) : c && u > 0 ? 0..toFixed(u) : 0;
+    if (r === h) return 0;
+    B = applyNumberFormatting(e <= 0 && (true === b || b.length > 0) ? 0 : B, b, m, y, c && e <= 0, u, Math.round);
+    if (!p) p = i ? x.symbol[t].bits[0] : x.symbol[t].bytes[0];
+    if (n[p]) p = n[p];
+    if (o) if (l[0]) p = l[0];
+    else {
+        p = x.fullform[t][0];
+        if (i) p += a;
+        else p += f;
+    }
+    if (r === d) return [
+        B,
+        p
+    ];
+    if (r === g) return {
+        value: B,
+        symbol: p,
+        exponent: 0,
+        unit: p
+    };
+    return B + s + p;
+}
+function calculateOptimizedValue(e, t, i, n, o, l = true) {
+    let r;
+    r = i ? I[t] : E[t];
+    let s = e / r;
+    if (n) {
+        s *= 8;
+        if (l && s >= o && t < 8) {
+            s /= o;
+            t++;
+        }
+    }
+    return {
+        result: s,
+        e: t
+    };
+}
+function calculateBigIntExponent(e, t, i, n, o) {
+    if ("string" == typeof t) t = Number(t);
+    if (-1 === t || isNaN(t)) {
+        t = 0;
+        if (n) while(t < 8 && e >= 10n ** BigInt(3 * (t + 1)))t++;
+        else while(t < 8 && e >= 1024n ** BigInt(t + 1))t++;
+    } else t = t < 0 ? 0 : Math.floor(t);
+    if (t > 8) {
+        if (o > 0) o += 8 - t;
+        return {
+            e: 8,
+            precision: o
+        };
+    }
+    return {
+        e: t,
+        precision: o
+    };
+}
+function calculateBigIntValue(e, t, i, n, o, l = true) {
+    const r = i ? 10n ** BigInt(3 * t) : 1024n ** BigInt(t);
+    const s = 10n ** 16n;
+    let a = Number(e * s / r) / Number(s);
+    if (n) {
+        a *= 8;
+        if (l && a >= o && t < 8) {
+            a /= o;
+            t++;
+        }
+    }
+    return {
+        result: a,
+        e: t
+    };
+}
+function applyPrecisionHandling(e, t, i, n, l, r, s, a, c, f) {
+    if ("string" == typeof e) e = parseFloat(e);
+    if ("number" != typeof t || isNaN(t)) throw new TypeError(o);
+    t = Math.floor(t);
+    if (t < 1 || t > 100) throw new TypeError(o);
+    let u = e.toPrecision(t);
+    const p = -1 === f || isNaN(f);
+    if (u.includes(N) && i < 8 && p) {
+        i++;
+        const { result: e } = calculateOptimizedValue(n, i, l, r, s);
+        let o;
+        o = c > 0 ? Math.pow(10, c) : 1;
+        let f;
+        f = 1 === o ? a(e) : a(e * o) / o;
+        u = f.toPrecision(t);
+    }
+    return {
+        value: u,
+        e: i
+    };
+}
+function applyNumberFormatting(e, t, i, n, o, l, r) {
+    let s = e;
+    const a = o && l > 0 ? {
+        minimumFractionDigits: l,
+        maximumFractionDigits: l
+    } : void 0;
+    if (true === t) s = s.toLocaleString(void 0, a);
+    else if (t.length > 0) s = s.toLocaleString(t, {
+        ...i,
+        ...a
+    });
+    else if (n.length > 0) {
+        if (o && l > 0) {
+            const e = Math.pow(10, l);
+            s = r(s * e) / e;
+        }
+        s = s.toString().replace(v, n);
+    }
+    if ("number" == typeof s && isFinite(s) && s.toString().includes(N)) s = s.toLocaleString("en-US", {
+        useGrouping: false
+    });
+    if (o && l > 0 && true !== t && 0 === t.length) {
+        const e = s.toString();
+        const t = n || v;
+        const i = e.split(t);
+        const o = i[1] || M;
+        s = `${i[0]}${t}${o.padEnd(l, w)}`;
+    }
+    return s;
+}
+function calculateExponent(e, t, i, n, o) {
+    if ("string" == typeof t) t = Number(t);
+    if (-1 === t || isNaN(t)) {
+        t = n ? Math.floor(Math.log(e) / F) : Math.floor(Math.log(e) / P);
+        if (t < 0) t = 0;
+    } else t = t < 0 ? 0 : Math.floor(t);
+    if (t > 8) {
+        if (o > 0) o += 8 - t;
+        return {
+            e: 8,
+            precision: o
+        };
+    }
+    return {
+        e: t,
+        precision: o
+    };
+}
+function applyRounding(e, t, i, n, o, l) {
+    let r;
+    r = i > 0 && n > 0 ? Math.pow(10, n) : 1;
+    let s;
+    s = 1 === r ? o(e) : o(e * r) / r;
+    if (s === t && i < 8 && l) {
+        s = 1;
+        i++;
+    }
+    return {
+        value: s,
+        e: i
+    };
+}
+function resolveSymbol(e, t, i, n) {
+    const o = x.symbol[e][t ? c : u];
+    let l;
+    l = n && 1 === i ? t ? p : b : o[i];
+    return l;
+}
+function decorateResult(e, t, i, n, o, l, r, s, c, u, p, b, d, m) {
+    if (t) if ("string" == typeof e[0]) e[0] = `-${e[0]}`;
+    else if (0 === e[0]) e[0] = "-0";
+    else e[0] = -e[0];
+    if (i[e[1]]) e[1] = i[e[1]];
+    let g;
+    g = "string" == typeof e[0] ? parseFloat(e[0]) : e[0];
+    e[0] = applyNumberFormatting(e[0], n, o, l, r, s, m);
+    if (c) {
+        let t;
+        t = d ? a : f;
+        let i;
+        i = 1 === Math.abs(g) ? M : O;
+        if (u[b]) e[1] = u[b];
+        else e[1] = x.fullform[p][b] + t + i;
+    }
+}
+function formatOutput(e, t, i, n, o) {
+    if (n !== d && n !== g && n !== y && n !== h) throw new TypeError(`Invalid output: ${n}`);
+    if (n === d) return e;
+    if (n === g) return {
+        value: e[0],
+        symbol: e[1],
+        exponent: t,
+        unit: i
+    };
+    let l;
+    l = o === S ? `${e[0]} ${e[1]}` : e.join(o);
+    return l;
+}
+function filesize(e, { bits: t = false, pad: o = false, base: l = -1, round: r = 2, locale: s = M, localeOptions: a = {}, separator: c = M, spacer: f = S, symbols: u = {}, standard: p = M, output: b = y, fullform: d = false, fullforms: g = [], exponent: N = -1, roundingMethod: v = B, precision: O = 0 } = {}) {
+    let w = N, x, E = [], I = 0, P = M;
+    const F = "bigint" == typeof e;
+    x = Number(e);
+    if (isNaN(x)) throw new TypeError(i);
+    if (!isFinite(x)) throw new TypeError(i);
+    const { isDecimal: T, ceil: z, actualStandard: C } = getBaseConfiguration(p, l);
+    const D = true === d, j = x < 0, V = Math[v];
+    if (typeof V !== m) throw new TypeError(n);
+    if (j) x = -x;
+    if (0 === x) return handleZeroValue(O, C, t, u, D, g, b, f, o, r, void 0, s, a, c);
+    const $ = F ? j ? -BigInt(e) : BigInt(e) : null;
+    let Z = O;
+    if (F) {
+        const { e: e, precision: t } = calculateBigIntExponent($, w, N, T, O);
+        w = e;
+        Z = t;
+    } else {
+        const { e: e, precision: t } = calculateExponent(x, w, N, T, O);
+        w = e;
+        Z = t;
+    }
+    const G = -1 === N || isNaN(N);
+    let k;
+    k = F ? calculateBigIntValue($, w, T, t, z, G) : calculateOptimizedValue(x, w, T, t, z, G);
+    I = k.result;
+    w = k.e;
+    const J = applyRounding(I, z, w, r, V, G);
+    E[0] = J.value;
+    w = J.e;
+    if (Z > 0) {
+        const e = applyPrecisionHandling(E[0], Z, w, x, T, t, z, V, r, N);
+        E[0] = e.value;
+        w = e.e;
+    }
+    if (b === h) return w;
+    P = resolveSymbol(C, t, w, T);
+    E[1] = P;
+    decorateResult(E, j, u, s, a, c, o, r, D, g, C, w, t, V);
+    return formatOutput(E, w, P, b, f);
+}
+function partial({ bits: e = false, pad: t = false, base: i = -1, round: n = 2, locale: o = M, separator: l = M, spacer: r = S, standard: s = M, output: a = y, fullform: c = false, exponent: f = -1, roundingMethod: u = B, precision: p = 0, localeOptions: b = {}, symbols: d = {}, fullforms: m = [] } = {}) {
+    function safeClone(e) {
+        try {
+            return "function" == typeof structuredClone ? structuredClone(e) : JSON.parse(JSON.stringify(e));
+        } catch  {
+            return JSON.parse(JSON.stringify(e));
+        }
+    }
+    const g = {
+        localeOptions: safeClone(b),
+        symbols: safeClone(d),
+        fullforms: safeClone(m)
+    };
+    return (b)=>filesize(b, {
+            bits: e,
+            pad: t,
+            base: i,
+            round: n,
+            locale: o,
+            localeOptions: g.localeOptions,
+            separator: l,
+            spacer: r,
+            symbols: g.symbols,
+            standard: s,
+            output: a,
+            fullform: c,
+            fullforms: g.fullforms,
+            exponent: f,
+            roundingMethod: u,
+            precision: p
+        });
+}
+var z = t.O;
+var C = t.v;
+export { z as filesize, C as partial };

package/dist/compiled/filesize/index.mjs.LICENSE.txt

@@ -0,0 +1,7 @@
+/**
+ * filesize
+ *
+ * @copyright 2026 Jason Mulligan <jason.mulligan@avoidwork.com>
+ * @license BSD-3-Clause
+ * @version 11.0.26
+ */

package/dist/compiled/filesize/licenses-cjs.txt

@@ -0,0 +1,29 @@
+filesize
+BSD-3-Clause
+Copyright (c) 2026, Jason Mulligan
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the name of filesize nor the names of its
+  contributors may be used to endorse or promote products derived from
+  this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/dist/compiled/filesize/licenses-esm.txt

@@ -0,0 +1,29 @@
+filesize
+BSD-3-Clause
+Copyright (c) 2026, Jason Mulligan
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the name of filesize nor the names of its
+  contributors may be used to endorse or promote products derived from
+  this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/dist/compiled/filesize/package.json

@@ -1 +1 @@
-{"name":"filesize","author":"Jason Mulligan <jason.mulligan@avoidwork.com>","version":"8.0.7","license":"BSD-3-Clause","types":"filesize.d.ts"}
+{"name":"filesize","author":"Jason Mulligan <jason.mulligan@avoidwork.com>","version":"11.0.26","license":"BSD-3-Clause","types":"index.d.ts"}

package/dist/compiled/filesize/provenance.json

@@ -0,0 +1,22 @@
+{
+  "name": "filesize",
+  "sourceName": "filesize",
+  "version": "11.0.26",
+  "entrySha256": "6a498d7fbb1eeb3334fdc1747357eb2c3fdc557499ae664170d205d8a13593dc",
+  "license": "BSD-3-Clause",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/avoidwork/filesize.js.git"
+  },
+  "producer": "scripts/prebundle",
+  "ncc": "0.45.0",
+  "declarations": "6.5.1",
+  "declarationSources": [
+    {
+      "name": "filesize",
+      "version": "11.0.26",
+      "license": "BSD-3-Clause"
+    }
+  ],
+  "lockfileSha256": "b3ac341ea4d3fbd3adf92aa1683e1d5d49f8e7a90ee6b84d9af8904f4643cdd4"
+}

package/dist/compiled/fs-extra/LICENSE

@@ -0,0 +1,15 @@
+(The MIT License)
+
+Copyright (c) 2011-2024 JP Richardson
+
+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/dist/compiled/fs-extra/declaration-licenses/@types_fs-extra/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/dist/compiled/fs-extra/declaration-licenses/@types_jsonfile/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