lakutata 2.0.95 → 2.0.96

package/vendor/Package.internal.18.cjs

@@ -1,567 +1,272 @@
-/* Build Date: Mon Nov 24 2025 17:58:53 GMT+0800 (China Standard Time) */
+/* Build Date: Mon Nov 24 2025 18:02:01 GMT+0800 (China Standard Time) */
 "use strict";
 
-exports.aspromise = asPromise;
+const e = require("./Package.internal.99.cjs");
 
-function asPromise(e, r) {
-    var t = new Array(arguments.length - 1), n = 0, i = 2, a = true;
-    while (i < arguments.length) t[n++] = arguments[i++];
-    return new Promise(function i(o, u) {
-        t[n] = function e(r) {
-            if (a) {
-                a = false;
-                if (r) u(r); else {
-                    var t = new Array(arguments.length - 1), n = 0;
-                    while (n < t.length) t[n++] = arguments[n];
-                    o.apply(null, t);
-                }
-            }
-        };
-        try {
-            e.apply(r || null, t);
-        } catch (e) {
-            if (a) {
-                a = false;
-                u(e);
-            }
-        }
-    });
-}
-
-exports.base64 = {};
+var n = {
+    exports: {}
+};
 
-(function(e) {
-    var r = e;
-    r.length = function e(r) {
-        var t = r.length;
-        if (!t) return 0;
-        var n = 0;
-        while (--t % 4 > 1 && r.charAt(t) === "=") ++n;
-        return Math.ceil(r.length * 3) / 4 - n;
-    };
-    var t = new Array(64);
-    var n = new Array(123);
-    for (var i = 0; i < 64; ) n[t[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;
-    r.encode = function e(r, n, i) {
-        var a = null, o = [];
-        var u = 0, f = 0, l;
-        while (n < i) {
-            var s = r[n++];
-            switch (f) {
-              case 0:
-                o[u++] = t[s >> 2];
-                l = (s & 3) << 4;
-                f = 1;
-                break;
+n.exports;
 
-              case 1:
-                o[u++] = t[l | s >> 4];
-                l = (s & 15) << 2;
-                f = 2;
-                break;
+var r = e.reusify_1;
 
-              case 2:
-                o[u++] = t[l | s >> 6];
-                o[u++] = t[s & 63];
-                f = 0;
-                break;
-            }
-            if (u > 8191) {
-                (a || (a = [])).push(String.fromCharCode.apply(String, o));
-                u = 0;
+function t(e, n, t) {
+    if (typeof e === "function") {
+        t = n;
+        n = e;
+        e = null;
+    }
+    if (!(t >= 1)) {
+        throw new Error("fastqueue concurrency must be equal to or greater than 1");
+    }
+    var l = r(a);
+    var i = null;
+    var o = null;
+    var c = 0;
+    var f = null;
+    var s = {
+        push: w,
+        drain: u,
+        saturated: u,
+        pause: d,
+        paused: false,
+        get concurrency() {
+            return t;
+        },
+        set concurrency(e) {
+            if (!(e >= 1)) {
+                throw new Error("fastqueue concurrency must be equal to or greater than 1");
             }
-        }
-        if (f) {
-            o[u++] = t[l];
-            o[u++] = 61;
-            if (f === 1) o[u++] = 61;
-        }
-        if (a) {
-            if (u) a.push(String.fromCharCode.apply(String, o.slice(0, u)));
-            return a.join("");
-        }
-        return String.fromCharCode.apply(String, o.slice(0, u));
-    };
-    var a = "invalid encoding";
-    r.decode = function e(r, t, i) {
-        var o = i;
-        var u = 0, f;
-        for (var l = 0; l < r.length; ) {
-            var s = r.charCodeAt(l++);
-            if (s === 61 && u > 1) break;
-            if ((s = n[s]) === undefined) throw Error(a);
-            switch (u) {
-              case 0:
-                f = s;
-                u = 1;
-                break;
-
-              case 1:
-                t[i++] = f << 2 | (s & 48) >> 4;
-                f = s;
-                u = 2;
-                break;
-
-              case 2:
-                t[i++] = (f & 15) << 4 | (s & 60) >> 2;
-                f = s;
-                u = 3;
-                break;
-
-              case 3:
-                t[i++] = (f & 3) << 6 | s;
-                u = 0;
-                break;
+            t = e;
+            if (s.paused) return;
+            for (;i && c < t; ) {
+                c++;
+                y();
             }
-        }
-        if (u === 1) throw Error(a);
-        return i - o;
-    };
-    r.test = function e(r) {
-        return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(r);
+        },
+        running: v,
+        resume: x,
+        idle: k,
+        length: h,
+        getQueue: p,
+        unshift: g,
+        empty: u,
+        kill: m,
+        killAndDrain: b,
+        error: q
     };
-})(exports.base64);
-
-exports.eventemitter = EventEmitter;
-
-function EventEmitter() {
-    this._listeners = {};
-}
-
-EventEmitter.prototype.on = function e(r, t, n) {
-    (this._listeners[r] || (this._listeners[r] = [])).push({
-        fn: t,
-        ctx: n || this
-    });
-    return this;
-};
-
-EventEmitter.prototype.off = function e(r, t) {
-    if (r === undefined) this._listeners = {}; else {
-        if (t === undefined) this._listeners[r] = []; else {
-            var n = this._listeners[r];
-            for (var i = 0; i < n.length; ) if (n[i].fn === t) n.splice(i, 1); else ++i;
-        }
+    return s;
+    function v() {
+        return c;
     }
-    return this;
-};
-
-EventEmitter.prototype.emit = function e(r) {
-    var t = this._listeners[r];
-    if (t) {
-        var n = [], i = 1;
-        for (;i < arguments.length; ) n.push(arguments[i++]);
-        for (i = 0; i < t.length; ) t[i].fn.apply(t[i++].ctx, n);
+    function d() {
+        s.paused = true;
     }
-    return this;
-};
-
-exports.float = factory(factory);
-
-function factory(e) {
-    if (typeof Float32Array !== "undefined") (function() {
-        var r = new Float32Array([ -0 ]), t = new Uint8Array(r.buffer), n = t[3] === 128;
-        function i(e, n, i) {
-            r[0] = e;
-            n[i] = t[0];
-            n[i + 1] = t[1];
-            n[i + 2] = t[2];
-            n[i + 3] = t[3];
-        }
-        function a(e, n, i) {
-            r[0] = e;
-            n[i] = t[3];
-            n[i + 1] = t[2];
-            n[i + 2] = t[1];
-            n[i + 3] = t[0];
-        }
-        e.writeFloatLE = n ? i : a;
-        e.writeFloatBE = n ? a : i;
-        function o(e, n) {
-            t[0] = e[n];
-            t[1] = e[n + 1];
-            t[2] = e[n + 2];
-            t[3] = e[n + 3];
-            return r[0];
-        }
-        function u(e, n) {
-            t[3] = e[n];
-            t[2] = e[n + 1];
-            t[1] = e[n + 2];
-            t[0] = e[n + 3];
-            return r[0];
-        }
-        e.readFloatLE = n ? o : u;
-        e.readFloatBE = n ? u : o;
-    })(); else (function() {
-        function r(e, r, t, n) {
-            var i = r < 0 ? 1 : 0;
-            if (i) r = -r;
-            if (r === 0) e(1 / r > 0 ? 0 : 2147483648, t, n); else if (isNaN(r)) e(2143289344, t, n); else if (r > 34028234663852886e22) e((i << 31 | 2139095040) >>> 0, t, n); else if (r < 11754943508222875e-54) e((i << 31 | Math.round(r / 1401298464324817e-60)) >>> 0, t, n); else {
-                var a = Math.floor(Math.log(r) / Math.LN2), o = Math.round(r * Math.pow(2, -a) * 8388608) & 8388607;
-                e((i << 31 | a + 127 << 23 | o) >>> 0, t, n);
-            }
-        }
-        e.writeFloatLE = r.bind(null, writeUintLE);
-        e.writeFloatBE = r.bind(null, writeUintBE);
-        function t(e, r, t) {
-            var n = e(r, t), i = (n >> 31) * 2 + 1, a = n >>> 23 & 255, o = n & 8388607;
-            return a === 255 ? o ? NaN : i * Infinity : a === 0 ? i * 1401298464324817e-60 * o : i * Math.pow(2, a - 150) * (o + 8388608);
-        }
-        e.readFloatLE = t.bind(null, readUintLE);
-        e.readFloatBE = t.bind(null, readUintBE);
-    })();
-    if (typeof Float64Array !== "undefined") (function() {
-        var r = new Float64Array([ -0 ]), t = new Uint8Array(r.buffer), n = t[7] === 128;
-        function i(e, n, i) {
-            r[0] = e;
-            n[i] = t[0];
-            n[i + 1] = t[1];
-            n[i + 2] = t[2];
-            n[i + 3] = t[3];
-            n[i + 4] = t[4];
-            n[i + 5] = t[5];
-            n[i + 6] = t[6];
-            n[i + 7] = t[7];
+    function h() {
+        var e = i;
+        var n = 0;
+        while (e) {
+            e = e.next;
+            n++;
         }
-        function a(e, n, i) {
-            r[0] = e;
-            n[i] = t[7];
-            n[i + 1] = t[6];
-            n[i + 2] = t[5];
-            n[i + 3] = t[4];
-            n[i + 4] = t[3];
-            n[i + 5] = t[2];
-            n[i + 6] = t[1];
-            n[i + 7] = t[0];
+        return n;
+    }
+    function p() {
+        var e = i;
+        var n = [];
+        while (e) {
+            n.push(e.value);
+            e = e.next;
         }
-        e.writeDoubleLE = n ? i : a;
-        e.writeDoubleBE = n ? a : i;
-        function o(e, n) {
-            t[0] = e[n];
-            t[1] = e[n + 1];
-            t[2] = e[n + 2];
-            t[3] = e[n + 3];
-            t[4] = e[n + 4];
-            t[5] = e[n + 5];
-            t[6] = e[n + 6];
-            t[7] = e[n + 7];
-            return r[0];
+        return n;
+    }
+    function x() {
+        if (!s.paused) return;
+        s.paused = false;
+        if (i === null) {
+            c++;
+            y();
+            return;
         }
-        function u(e, n) {
-            t[7] = e[n];
-            t[6] = e[n + 1];
-            t[5] = e[n + 2];
-            t[4] = e[n + 3];
-            t[3] = e[n + 4];
-            t[2] = e[n + 5];
-            t[1] = e[n + 6];
-            t[0] = e[n + 7];
-            return r[0];
+        for (;i && c < t; ) {
+            c++;
+            y();
         }
-        e.readDoubleLE = n ? o : u;
-        e.readDoubleBE = n ? u : o;
-    })(); else (function() {
-        function r(e, r, t, n, i, a) {
-            var o = n < 0 ? 1 : 0;
-            if (o) n = -n;
-            if (n === 0) {
-                e(0, i, a + r);
-                e(1 / n > 0 ? 0 : 2147483648, i, a + t);
-            } else if (isNaN(n)) {
-                e(0, i, a + r);
-                e(2146959360, i, a + t);
-            } else if (n > 17976931348623157e292) {
-                e(0, i, a + r);
-                e((o << 31 | 2146435072) >>> 0, i, a + t);
+    }
+    function k() {
+        return c === 0 && s.length() === 0;
+    }
+    function w(r, a) {
+        var v = l.get();
+        v.context = e;
+        v.release = y;
+        v.value = r;
+        v.callback = a || u;
+        v.errorHandler = f;
+        if (c >= t || s.paused) {
+            if (o) {
+                o.next = v;
+                o = v;
             } else {
-                var u;
-                if (n < 22250738585072014e-324) {
-                    u = n / 5e-324;
-                    e(u >>> 0, i, a + r);
-                    e((o << 31 | u / 4294967296) >>> 0, i, a + t);
-                } else {
-                    var f = Math.floor(Math.log(n) / Math.LN2);
-                    if (f === 1024) f = 1023;
-                    u = n * Math.pow(2, -f);
-                    e(u * 4503599627370496 >>> 0, i, a + r);
-                    e((o << 31 | f + 1023 << 20 | u * 1048576 & 1048575) >>> 0, i, a + t);
-                }
+                i = v;
+                o = v;
+                s.saturated();
             }
+        } else {
+            c++;
+            n.call(e, v.value, v.worked);
         }
-        e.writeDoubleLE = r.bind(null, writeUintLE, 0, 4);
-        e.writeDoubleBE = r.bind(null, writeUintBE, 4, 0);
-        function t(e, r, t, n, i) {
-            var a = e(n, i + r), o = e(n, i + t);
-            var u = (o >> 31) * 2 + 1, f = o >>> 20 & 2047, l = 4294967296 * (o & 1048575) + a;
-            return f === 2047 ? l ? NaN : u * Infinity : f === 0 ? u * 5e-324 * l : u * Math.pow(2, f - 1075) * (l + 4503599627370496);
-        }
-        e.readDoubleLE = t.bind(null, readUintLE, 0, 4);
-        e.readDoubleBE = t.bind(null, readUintBE, 4, 0);
-    })();
-    return e;
-}
-
-function writeUintLE(e, r, t) {
-    r[t] = e & 255;
-    r[t + 1] = e >>> 8 & 255;
-    r[t + 2] = e >>> 16 & 255;
-    r[t + 3] = e >>> 24;
-}
-
-function writeUintBE(e, r, t) {
-    r[t] = e >>> 24;
-    r[t + 1] = e >>> 16 & 255;
-    r[t + 2] = e >>> 8 & 255;
-    r[t + 3] = e & 255;
-}
-
-function readUintLE(e, r) {
-    return (e[r] | e[r + 1] << 8 | e[r + 2] << 16 | e[r + 3] << 24) >>> 0;
-}
-
-function readUintBE(e, r) {
-    return (e[r] << 24 | e[r + 1] << 16 | e[r + 2] << 8 | e[r + 3]) >>> 0;
-}
-
-exports.inquire_1 = inquire;
-
-function inquire(moduleName) {
-    try {
-        var mod = eval("quire".replace(/^/, "re"))(moduleName);
-        if (mod && (mod.length || Object.keys(mod).length)) return mod;
-    } catch (e) {}
-    return null;
-}
-
-exports.utf8 = {};
-
-(function(e) {
-    var r = e;
-    r.length = function e(r) {
-        var t = 0, n = 0;
-        for (var i = 0; i < r.length; ++i) {
-            n = r.charCodeAt(i);
-            if (n < 128) t += 1; else if (n < 2048) t += 2; else if ((n & 64512) === 55296 && (r.charCodeAt(i + 1) & 64512) === 56320) {
-                ++i;
-                t += 4;
-            } else t += 3;
-        }
-        return t;
-    };
-    r.read = function e(r, t, n) {
-        var i = n - t;
-        if (i < 1) return "";
-        var a = null, o = [], u = 0, f;
-        while (t < n) {
-            f = r[t++];
-            if (f < 128) o[u++] = f; else if (f > 191 && f < 224) o[u++] = (f & 31) << 6 | r[t++] & 63; else if (f > 239 && f < 365) {
-                f = ((f & 7) << 18 | (r[t++] & 63) << 12 | (r[t++] & 63) << 6 | r[t++] & 63) - 65536;
-                o[u++] = 55296 + (f >> 10);
-                o[u++] = 56320 + (f & 1023);
-            } else o[u++] = (f & 15) << 12 | (r[t++] & 63) << 6 | r[t++] & 63;
-            if (u > 8191) {
-                (a || (a = [])).push(String.fromCharCode.apply(String, o));
-                u = 0;
+    }
+    function g(r, a) {
+        var v = l.get();
+        v.context = e;
+        v.release = y;
+        v.value = r;
+        v.callback = a || u;
+        v.errorHandler = f;
+        if (c >= t || s.paused) {
+            if (i) {
+                v.next = i;
+                i = v;
+            } else {
+                i = v;
+                o = v;
+                s.saturated();
             }
+        } else {
+            c++;
+            n.call(e, v.value, v.worked);
         }
-        if (a) {
-            if (u) a.push(String.fromCharCode.apply(String, o.slice(0, u)));
-            return a.join("");
+    }
+    function y(r) {
+        if (r) {
+            l.release(r);
         }
-        return String.fromCharCode.apply(String, o.slice(0, u));
-    };
-    r.write = function e(r, t, n) {
-        var i = n, a, o;
-        for (var u = 0; u < r.length; ++u) {
-            a = r.charCodeAt(u);
-            if (a < 128) {
-                t[n++] = a;
-            } else if (a < 2048) {
-                t[n++] = a >> 6 | 192;
-                t[n++] = a & 63 | 128;
-            } else if ((a & 64512) === 55296 && ((o = r.charCodeAt(u + 1)) & 64512) === 56320) {
-                a = 65536 + ((a & 1023) << 10) + (o & 1023);
-                ++u;
-                t[n++] = a >> 18 | 240;
-                t[n++] = a >> 12 & 63 | 128;
-                t[n++] = a >> 6 & 63 | 128;
-                t[n++] = a & 63 | 128;
+        var u = i;
+        if (u && c <= t) {
+            if (!s.paused) {
+                if (o === i) {
+                    o = null;
+                }
+                i = u.next;
+                u.next = null;
+                n.call(e, u.value, u.worked);
+                if (o === null) {
+                    s.empty();
+                }
             } else {
-                t[n++] = a >> 12 | 224;
-                t[n++] = a >> 6 & 63 | 128;
-                t[n++] = a & 63 | 128;
+                c--;
             }
+        } else if (--c === 0) {
+            s.drain();
         }
-        return n - i;
-    };
-})(exports.utf8);
-
-exports.pool_1 = pool;
+    }
+    function m() {
+        i = null;
+        o = null;
+        s.drain = u;
+    }
+    function b() {
+        i = null;
+        o = null;
+        s.drain();
+        s.drain = u;
+    }
+    function q(e) {
+        f = e;
+    }
+}
 
-function pool(e, r, t) {
-    var n = t || 8192;
-    var i = n >>> 1;
-    var a = null;
-    var o = n;
-    return function t(u) {
-        if (u < 1 || u > i) return e(u);
-        if (o + u > n) {
-            a = e(n);
-            o = 0;
+function u() {}
+
+function a() {
+    this.value = null;
+    this.callback = u;
+    this.next = null;
+    this.release = u;
+    this.context = null;
+    this.errorHandler = null;
+    var e = this;
+    this.worked = function n(r, t) {
+        var a = e.callback;
+        var l = e.errorHandler;
+        var i = e.value;
+        e.value = null;
+        e.callback = u;
+        if (e.errorHandler) {
+            l(r, i);
         }
-        var f = r.call(a, o, o += u);
-        if (o & 7) o = (o | 7) + 1;
-        return f;
+        a.call(e.context, r, t);
+        e.release(e);
     };
 }
 
-var codegen_1;
-
-var hasRequiredCodegen;
-
-function requireCodegen() {
-    if (hasRequiredCodegen) return codegen_1;
-    hasRequiredCodegen = 1;
-    codegen_1 = e;
-    function e(r, t) {
-        if (typeof r === "string") {
-            t = r;
-            r = undefined;
-        }
-        var n = [];
-        function i(r) {
-            if (typeof r !== "string") {
-                var t = a();
-                if (e.verbose) console.log("codegen: " + t);
-                t = "return " + t;
-                if (r) {
-                    var o = Object.keys(r), u = new Array(o.length + 1), f = new Array(o.length), l = 0;
-                    while (l < o.length) {
-                        u[l] = o[l];
-                        f[l] = r[o[l++]];
-                    }
-                    u[l] = t;
-                    return Function.apply(null, u).apply(null, f);
-                }
-                return Function(t)();
-            }
-            var s = new Array(arguments.length - 1), c = 0;
-            while (c < s.length) s[c] = arguments[++c];
-            c = 0;
-            r = r.replace(/%([%dfijs])/g, function e(r, t) {
-                var n = s[c++];
-                switch (t) {
-                  case "d":
-                  case "f":
-                    return String(Number(n));
-
-                  case "i":
-                    return String(Math.floor(n));
-
-                  case "j":
-                    return JSON.stringify(n);
-
-                  case "s":
-                    return String(n);
+function l(e, n, r) {
+    if (typeof e === "function") {
+        r = n;
+        n = e;
+        e = null;
+    }
+    function a(e, r) {
+        n.call(this, e).then(function(e) {
+            r(null, e);
+        }, r);
+    }
+    var l = t(e, a, r);
+    var i = l.push;
+    var o = l.unshift;
+    l.push = c;
+    l.unshift = f;
+    l.drained = s;
+    return l;
+    function c(e) {
+        var n = new Promise(function(n, r) {
+            i(e, function(e, t) {
+                if (e) {
+                    r(e);
+                    return;
                 }
-                return "%";
+                n(t);
             });
-            if (c !== s.length) throw Error("parameter count mismatch");
-            n.push(r);
-            return i;
-        }
-        function a(e) {
-            return "function " + (e || t || "") + "(" + (r && r.join(",") || "") + "){\n  " + n.join("\n  ") + "\n}";
-        }
-        i.toString = a;
-        return i;
+        });
+        n.catch(u);
+        return n;
     }
-    e.verbose = false;
-    return codegen_1;
-}
-
-var fetch_1;
-
-var hasRequiredFetch;
-
-function requireFetch() {
-    if (hasRequiredFetch) return fetch_1;
-    hasRequiredFetch = 1;
-    fetch_1 = n;
-    var e = exports.aspromise, r = exports.inquire_1;
-    var t = r("fs");
-    function n(r, i, a) {
-        if (typeof i === "function") {
-            a = i;
-            i = {};
-        } else if (!i) i = {};
-        if (!a) return e(n, this, r, i);
-        if (!i.xhr && t && t.readFile) return t.readFile(r, function e(t, o) {
-            return t && typeof XMLHttpRequest !== "undefined" ? n.xhr(r, i, a) : t ? a(t) : a(null, i.binary ? o : o.toString("utf8"));
+    function f(e) {
+        var n = new Promise(function(n, r) {
+            o(e, function(e, t) {
+                if (e) {
+                    r(e);
+                    return;
+                }
+                n(t);
+            });
         });
-        return n.xhr(r, i, a);
+        n.catch(u);
+        return n;
     }
-    n.xhr = function e(r, t, n) {
-        var i = new XMLHttpRequest;
-        i.onreadystatechange = function e() {
-            if (i.readyState !== 4) return undefined;
-            if (i.status !== 0 && i.status !== 200) return n(Error("status " + i.status));
-            if (t.binary) {
-                var r = i.response;
-                if (!r) {
-                    r = [];
-                    for (var a = 0; a < i.responseText.length; ++a) r.push(i.responseText.charCodeAt(a) & 255);
+    function s() {
+        var e = new Promise(function(e) {
+            process.nextTick(function() {
+                if (l.idle()) {
+                    e();
+                } else {
+                    var n = l.drain;
+                    l.drain = function() {
+                        if (typeof n === "function") n();
+                        e();
+                        l.drain = n;
+                    };
                 }
-                return n(null, typeof Uint8Array !== "undefined" ? new Uint8Array(r) : r);
-            }
-            return n(null, i.responseText);
-        };
-        if (t.binary) {
-            if ("overrideMimeType" in i) i.overrideMimeType("text/plain; charset=x-user-defined");
-            i.responseType = "arraybuffer";
-        }
-        i.open("GET", r);
-        i.send();
-    };
-    return fetch_1;
-}
-
-var path = {};
-
-var hasRequiredPath;
-
-function requirePath() {
-    if (hasRequiredPath) return path;
-    hasRequiredPath = 1;
-    (function(e) {
-        var r = e;
-        var t = r.isAbsolute = function e(r) {
-            return /^(?:\/|\w+:)/.test(r);
-        };
-        var n = r.normalize = function e(r) {
-            r = r.replace(/\\/g, "/").replace(/\/{2,}/g, "/");
-            var n = r.split("/"), i = t(r), a = "";
-            if (i) a = n.shift() + "/";
-            for (var o = 0; o < n.length; ) {
-                if (n[o] === "..") {
-                    if (o > 0 && n[o - 1] !== "..") n.splice(--o, 2); else if (i) n.splice(o, 1); else ++o;
-                } else if (n[o] === ".") n.splice(o, 1); else ++o;
-            }
-            return a + n.join("/");
-        };
-        r.resolve = function e(r, i, a) {
-            if (!a) i = n(i);
-            if (t(i)) return i;
-            if (!a) r = n(r);
-            return (r = r.replace(/(?:\/|^)[^/]+$/, "")).length ? n(r + "/" + i) : i;
-        };
-    })(path);
-    return path;
+            });
+        });
+        return e;
+    }
 }
 
-exports.requireCodegen = requireCodegen;
+n.exports = t;
 
-exports.requireFetch = requireFetch;
+n.exports.promise = l;
 
-exports.requirePath = requirePath;
+exports.queueExports = n.exports;