lakutata 2.0.82 → 2.0.83

package/src/lib/base/internal/IEEE754.cjs

@@ -4,102 +4,102 @@ Object.defineProperty(exports, Symbol.toStringTag, {
     value: "Module"
 });
 
-function readIEEE754(t, e, o, i, l) {
+function t(t, e, o, l, i) {
     let s;
-    let a;
-    const n = l * 8 - i - 1;
-    const r = (1 << n) - 1;
-    const E = r >> 1;
-    let h = -7;
-    let w = o ? l - 1 : 0;
-    const f = o ? -1 : 1;
-    let M = t[e + w];
-    w += f;
-    s = M & (1 << -h) - 1;
-    M >>= -h;
-    h += n;
-    while (h > 0) {
+    let n;
+    const a = i * 8 - l - 1;
+    const h = (1 << a) - 1;
+    const f = h >> 1;
+    let r = -7;
+    let w = o ? i - 1 : 0;
+    const M = o ? -1 : 1;
+    let c = t[e + w];
+    w += M;
+    s = c & (1 << -r) - 1;
+    c >>= -r;
+    r += a;
+    while (r > 0) {
         s = s * 256 + t[e + w];
-        w += f;
-        h -= 8;
+        w += M;
+        r -= 8;
     }
-    a = s & (1 << -h) - 1;
-    s >>= -h;
-    h += i;
-    while (h > 0) {
-        a = a * 256 + t[e + w];
-        w += f;
-        h -= 8;
+    n = s & (1 << -r) - 1;
+    s >>= -r;
+    r += l;
+    while (r > 0) {
+        n = n * 256 + t[e + w];
+        w += M;
+        r -= 8;
     }
     if (s === 0) {
-        s = 1 - E;
-    } else if (s === r) {
-        return a ? NaN : (M ? -1 : 1) * Infinity;
+        s = 1 - f;
+    } else if (s === h) {
+        return n ? NaN : (c ? -1 : 1) * Infinity;
     } else {
-        a = a + Math.pow(2, i);
-        s = s - E;
+        n = n + Math.pow(2, l);
+        s = s - f;
     }
-    return (M ? -1 : 1) * a * Math.pow(2, s - i);
+    return (c ? -1 : 1) * n * Math.pow(2, s - l);
 }
 
-function writeIEEE754(t, e, o, i, l, s) {
-    let a;
+function e(t, e, o, l, i, s) {
     let n;
-    let r;
-    let E = s * 8 - l - 1;
-    const h = (1 << E) - 1;
-    const w = h >> 1;
-    const f = l === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
-    let M = i ? 0 : s - 1;
-    const c = i ? 1 : -1;
-    const p = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
+    let a;
+    let h;
+    let f = s * 8 - i - 1;
+    const r = (1 << f) - 1;
+    const w = r >> 1;
+    const M = i === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
+    let c = l ? 0 : s - 1;
+    const p = l ? 1 : -1;
+    const u = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
     e = Math.abs(e);
     if (isNaN(e) || e === Infinity) {
-        n = isNaN(e) ? 1 : 0;
-        a = h;
+        a = isNaN(e) ? 1 : 0;
+        n = r;
     } else {
-        a = Math.floor(Math.log(e) / Math.LN2);
-        if (e * (r = Math.pow(2, -a)) < 1) {
-            a--;
-            r *= 2;
+        n = Math.floor(Math.log(e) / Math.LN2);
+        if (e * (h = Math.pow(2, -n)) < 1) {
+            n--;
+            h *= 2;
         }
-        if (a + w >= 1) {
-            e += f / r;
+        if (n + w >= 1) {
+            e += M / h;
         } else {
-            e += f * Math.pow(2, 1 - w);
+            e += M * Math.pow(2, 1 - w);
         }
-        if (e * r >= 2) {
-            a++;
-            r /= 2;
+        if (e * h >= 2) {
+            n++;
+            h /= 2;
         }
-        if (a + w >= h) {
-            n = 0;
-            a = h;
-        } else if (a + w >= 1) {
-            n = (e * r - 1) * Math.pow(2, l);
-            a = a + w;
-        } else {
-            n = e * Math.pow(2, w - 1) * Math.pow(2, l);
+        if (n + w >= r) {
             a = 0;
+            n = r;
+        } else if (n + w >= 1) {
+            a = (e * h - 1) * Math.pow(2, i);
+            n = n + w;
+        } else {
+            a = e * Math.pow(2, w - 1) * Math.pow(2, i);
+            n = 0;
         }
     }
-    while (l >= 8) {
-        t[o + M] = n & 255;
-        M += c;
-        n /= 256;
-        l -= 8;
-    }
-    a = a << l | n;
-    E += l;
-    while (E > 0) {
-        t[o + M] = a & 255;
-        M += c;
+    while (i >= 8) {
+        t[o + c] = a & 255;
+        c += p;
         a /= 256;
-        E -= 8;
+        i -= 8;
+    }
+    n = n << i | a;
+    f += i;
+    while (f > 0) {
+        t[o + c] = n & 255;
+        c += p;
+        n /= 256;
+        f -= 8;
     }
-    t[o + M - c] |= p * 128;
+    t[o + c - p] |= u * 128;
 }
 
-exports.readIEEE754 = readIEEE754;
+exports.readIEEE754 = t;
 
-exports.writeIEEE754 = writeIEEE754;
+exports.writeIEEE754 = e;

package/src/lib/base/internal/IEEE754.mjs

@@ -1,97 +1,97 @@
-function readIEEE754(t, e, o, i, l) {
-    let a;
+function t(t, e, o, l, i) {
     let n;
-    const s = l * 8 - i - 1;
-    const h = (1 << s) - 1;
-    const w = h >> 1;
-    let f = -7;
-    let M = o ? l - 1 : 0;
-    const E = o ? -1 : 1;
-    let c = t[e + M];
-    M += E;
-    a = c & (1 << -f) - 1;
-    c >>= -f;
-    f += s;
-    while (f > 0) {
-        a = a * 256 + t[e + M];
-        M += E;
-        f -= 8;
-    }
-    n = a & (1 << -f) - 1;
-    a >>= -f;
-    f += i;
-    while (f > 0) {
+    let s;
+    const a = i * 8 - l - 1;
+    const h = (1 << a) - 1;
+    const f = h >> 1;
+    let w = -7;
+    let M = o ? i - 1 : 0;
+    const c = o ? -1 : 1;
+    let p = t[e + M];
+    M += c;
+    n = p & (1 << -w) - 1;
+    p >>= -w;
+    w += a;
+    while (w > 0) {
         n = n * 256 + t[e + M];
-        M += E;
-        f -= 8;
+        M += c;
+        w -= 8;
+    }
+    s = n & (1 << -w) - 1;
+    n >>= -w;
+    w += l;
+    while (w > 0) {
+        s = s * 256 + t[e + M];
+        M += c;
+        w -= 8;
     }
-    if (a === 0) {
-        a = 1 - w;
-    } else if (a === h) {
-        return n ? NaN : (c ? -1 : 1) * Infinity;
+    if (n === 0) {
+        n = 1 - f;
+    } else if (n === h) {
+        return s ? NaN : (p ? -1 : 1) * Infinity;
     } else {
-        n = n + Math.pow(2, i);
-        a = a - w;
+        s = s + Math.pow(2, l);
+        n = n - f;
     }
-    return (c ? -1 : 1) * n * Math.pow(2, a - i);
+    return (p ? -1 : 1) * s * Math.pow(2, n - l);
 }
 
-function writeIEEE754(t, e, o, i, l, a) {
-    let n;
+function e(t, e, o, l, i, n) {
     let s;
+    let a;
     let h;
-    let w = a * 8 - l - 1;
-    const f = (1 << w) - 1;
-    const M = f >> 1;
-    const E = l === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
-    let c = i ? 0 : a - 1;
-    const p = i ? 1 : -1;
+    let f = n * 8 - i - 1;
+    const w = (1 << f) - 1;
+    const M = w >> 1;
+    const c = i === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
+    let p = l ? 0 : n - 1;
+    const N = l ? 1 : -1;
     const r = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
     e = Math.abs(e);
     if (isNaN(e) || e === Infinity) {
-        s = isNaN(e) ? 1 : 0;
-        n = f;
+        a = isNaN(e) ? 1 : 0;
+        s = w;
     } else {
-        n = Math.floor(Math.log(e) / Math.LN2);
-        if (e * (h = Math.pow(2, -n)) < 1) {
-            n--;
+        s = Math.floor(Math.log(e) / Math.LN2);
+        if (e * (h = Math.pow(2, -s)) < 1) {
+            s--;
             h *= 2;
         }
-        if (n + M >= 1) {
-            e += E / h;
+        if (s + M >= 1) {
+            e += c / h;
         } else {
-            e += E * Math.pow(2, 1 - M);
+            e += c * Math.pow(2, 1 - M);
         }
         if (e * h >= 2) {
-            n++;
+            s++;
             h /= 2;
         }
-        if (n + M >= f) {
-            s = 0;
-            n = f;
-        } else if (n + M >= 1) {
-            s = (e * h - 1) * Math.pow(2, l);
-            n = n + M;
+        if (s + M >= w) {
+            a = 0;
+            s = w;
+        } else if (s + M >= 1) {
+            a = (e * h - 1) * Math.pow(2, i);
+            s = s + M;
         } else {
-            s = e * Math.pow(2, M - 1) * Math.pow(2, l);
-            n = 0;
+            a = e * Math.pow(2, M - 1) * Math.pow(2, i);
+            s = 0;
         }
     }
-    while (l >= 8) {
-        t[o + c] = s & 255;
-        c += p;
-        s /= 256;
-        l -= 8;
+    while (i >= 8) {
+        t[o + p] = a & 255;
+        p += N;
+        a /= 256;
+        i -= 8;
     }
-    n = n << l | s;
-    w += l;
-    while (w > 0) {
-        t[o + c] = n & 255;
-        c += p;
-        n /= 256;
-        w -= 8;
+    s = s << i | a;
+    f += i;
+    while (f > 0) {
+        t[o + p] = s & 255;
+        p += N;
+        s /= 256;
+        f -= 8;
     }
-    t[o + c - p] |= r * 128;
+    t[o + p - N] |= r * 128;
 }
 
-export { readIEEE754, writeIEEE754 };
+export { t as readIEEE754, e as writeIEEE754 };

package/src/lib/base/internal/MethodAssistantFunction.cjs

@@ -28,49 +28,49 @@ require("./CamelCase.cjs");
 
 require("../../helpers/NoCase.cjs");
 
-const i = Symbol("ASST.BEFORE.FUNC.SET");
+const s = Symbol("ASST.BEFORE.FUNC.SET");
 
-const s = Symbol("ASST.AFTER.FUNC.SET");
+const i = Symbol("ASST.AFTER.FUNC.SET");
 
 const c = Symbol("ASST.MODIFIED");
 
-function RegisterBeforeFunction(e, t, n, i) {
-    n.value = registerAssistantFunctionToMethod(e, t, applicabilityCheck(n.value, i), {
-        before: i
+function a(e, t, n, s) {
+    n.value = r(e, t, f(n.value, s), {
+        before: s
     });
     return n;
 }
 
-function RegisterAfterFunction(e, t, n, i) {
-    n.value = registerAssistantFunctionToMethod(e, t, applicabilityCheck(n.value, i), {
-        after: i
+function o(e, t, n, s) {
+    n.value = r(e, t, f(n.value, s), {
+        after: s
     });
     return n;
 }
 
-function registerAssistantFunctionToMethod(t, o, a, r) {
-    const f = Reflect.getOwnMetadata(i, t, o) || new Set;
-    const u = Reflect.getOwnMetadata(s, t, o) || new Set;
+function r(t, a, o, r) {
+    const f = Reflect.getOwnMetadata(s, t, a) || new Set;
+    const u = Reflect.getOwnMetadata(i, t, a) || new Set;
     if (r.before) {
         f.add(r.before);
-        Reflect.defineMetadata(i, f, t, o);
+        Reflect.defineMetadata(s, f, t, a);
     }
     if (r.after) {
         u.add(r.after);
-        Reflect.defineMetadata(s, u, t, o);
+        Reflect.defineMetadata(i, u, t, a);
     }
-    if (Reflect.hasOwnMetadata(c, t, o)) return n.As(a);
-    Reflect.defineMetadata(c, true, t, o);
+    if (Reflect.hasOwnMetadata(c, t, a)) return n.As(o);
+    Reflect.defineMetadata(c, true, t, a);
     let l;
-    if (e.isAsyncFunction(a)) {
+    if (e.isAsyncFunction(o)) {
         l = async function(...e) {
-            const n = Reflect.getOwnMetadata(i, t, o) || new Set;
-            const c = Reflect.getOwnMetadata(s, t, o) || new Set;
+            const n = Reflect.getOwnMetadata(s, t, a) || new Set;
+            const c = Reflect.getOwnMetadata(i, t, a) || new Set;
             for (const t of n) {
                 const n = await t.call(this, ...e);
                 if (n !== undefined) e = n;
             }
-            let r = await a.call(this, ...e);
+            let r = await o.call(this, ...e);
             for (const e of c) {
                 const t = await e.call(this, r);
                 if (t !== undefined) r = t;
@@ -79,13 +79,13 @@ function registerAssistantFunctionToMethod(t, o, a, r) {
         };
     } else {
         l = function(...e) {
-            const c = Reflect.getOwnMetadata(i, t, o) || new Set;
-            const r = Reflect.getOwnMetadata(s, t, o) || new Set;
+            const c = Reflect.getOwnMetadata(s, t, a) || new Set;
+            const r = Reflect.getOwnMetadata(i, t, a) || new Set;
             for (const t of c) {
-                const i = n.As(t.call(this, ...e));
-                if (i !== undefined) e = i;
+                const s = n.As(t.call(this, ...e));
+                if (s !== undefined) e = s;
             }
-            let f = a.call(this, ...e);
+            let f = o.call(this, ...e);
             for (const e of r) {
                 const t = n.As(e.call(this, f));
                 if (t !== undefined) f = t;
@@ -96,13 +96,13 @@ function registerAssistantFunctionToMethod(t, o, a, r) {
     return l;
 }
 
-function applicabilityCheck(n, i) {
+function f(n, s) {
     if (!n) throw new t.InvalidAssistantFunctionTypeException("Target method is undefined");
     if (e.isAsyncFunction(n)) return n;
-    if (!e.isAsyncFunction(i)) return n;
+    if (!e.isAsyncFunction(s)) return n;
     throw new t.InvalidAssistantFunctionTypeException("Assistant function must not be async function when target method is not async function");
 }
 
-exports.RegisterAfterFunction = RegisterAfterFunction;
+exports.RegisterAfterFunction = o;
 
-exports.RegisterBeforeFunction = RegisterBeforeFunction;
+exports.RegisterBeforeFunction = a;

package/src/lib/base/internal/MethodAssistantFunction.mjs

@@ -22,79 +22,79 @@ import "./CamelCase.mjs";
 
 import "../../helpers/NoCase.mjs";
 
-const i = Symbol("ASST.BEFORE.FUNC.SET");
+const a = Symbol("ASST.BEFORE.FUNC.SET");
 
 const o = Symbol("ASST.AFTER.FUNC.SET");
 
-const a = Symbol("ASST.MODIFIED");
+const i = Symbol("ASST.MODIFIED");
 
-function RegisterBeforeFunction(t, e, n, i) {
-    n.value = registerAssistantFunctionToMethod(t, e, applicabilityCheck(n.value, i), {
-        before: i
+function s(t, e, n, a) {
+    n.value = r(t, e, c(n.value, a), {
+        before: a
     });
     return n;
 }
 
-function RegisterAfterFunction(t, e, n, i) {
-    n.value = registerAssistantFunctionToMethod(t, e, applicabilityCheck(n.value, i), {
-        after: i
+function f(t, e, n, a) {
+    n.value = r(t, e, c(n.value, a), {
+        after: a
     });
     return n;
 }
 
-function registerAssistantFunctionToMethod(e, s, r, c) {
-    const f = Reflect.getOwnMetadata(i, e, s) || new Set;
+function r(e, s, f, r) {
+    const c = Reflect.getOwnMetadata(a, e, s) || new Set;
     const l = Reflect.getOwnMetadata(o, e, s) || new Set;
-    if (c.before) {
-        f.add(c.before);
-        Reflect.defineMetadata(i, f, e, s);
+    if (r.before) {
+        c.add(r.before);
+        Reflect.defineMetadata(a, c, e, s);
     }
-    if (c.after) {
-        l.add(c.after);
+    if (r.after) {
+        l.add(r.after);
         Reflect.defineMetadata(o, l, e, s);
     }
-    if (Reflect.hasOwnMetadata(a, e, s)) return n(r);
-    Reflect.defineMetadata(a, true, e, s);
+    if (Reflect.hasOwnMetadata(i, e, s)) return n(f);
+    Reflect.defineMetadata(i, true, e, s);
     let d;
-    if (t(r)) {
+    if (t(f)) {
         d = async function(...t) {
-            const n = Reflect.getOwnMetadata(i, e, s) || new Set;
-            const a = Reflect.getOwnMetadata(o, e, s) || new Set;
+            const n = Reflect.getOwnMetadata(a, e, s) || new Set;
+            const i = Reflect.getOwnMetadata(o, e, s) || new Set;
             for (const e of n) {
                 const n = await e.call(this, ...t);
                 if (n !== undefined) t = n;
             }
-            let c = await r.call(this, ...t);
-            for (const t of a) {
-                const e = await t.call(this, c);
-                if (e !== undefined) c = e;
+            let r = await f.call(this, ...t);
+            for (const t of i) {
+                const e = await t.call(this, r);
+                if (e !== undefined) r = e;
             }
-            return c;
+            return r;
         };
     } else {
         d = function(...t) {
-            const a = Reflect.getOwnMetadata(i, e, s) || new Set;
-            const c = Reflect.getOwnMetadata(o, e, s) || new Set;
-            for (const e of a) {
-                const i = n(e.call(this, ...t));
-                if (i !== undefined) t = i;
+            const i = Reflect.getOwnMetadata(a, e, s) || new Set;
+            const r = Reflect.getOwnMetadata(o, e, s) || new Set;
+            for (const e of i) {
+                const a = n(e.call(this, ...t));
+                if (a !== undefined) t = a;
             }
-            let f = r.call(this, ...t);
-            for (const t of c) {
-                const e = n(t.call(this, f));
-                if (e !== undefined) f = e;
+            let c = f.call(this, ...t);
+            for (const t of r) {
+                const e = n(t.call(this, c));
+                if (e !== undefined) c = e;
             }
-            return f;
+            return c;
         };
     }
     return d;
 }
 
-function applicabilityCheck(n, i) {
+function c(n, a) {
     if (!n) throw new e("Target method is undefined");
     if (t(n)) return n;
-    if (!t(i)) return n;
+    if (!t(a)) return n;
     throw new e("Assistant function must not be async function when target method is not async function");
 }
 
-export { RegisterAfterFunction, RegisterBeforeFunction };
+export { f as RegisterAfterFunction, s as RegisterBeforeFunction };