jobsys-explore 4.2.9 → 4.2.11

package/.changeset/bright-cycles-cheer.md

@@ -0,0 +1,5 @@
+---
+"jobsys-explore": patch
+---
+
+page

package/.changeset/hot-apples-jump.md

@@ -0,0 +1,5 @@
+---
+"jobsys-explore": patch
+---
+
+fixed format date

package/CHANGELOG.md

@@ -1,5 +1,36 @@
 # jobsys-explore
 
+## 4.2.11
+
+### Patch Changes
+
+- page
+- select
+- pagination add pullrefresh
+- d
+- fixed format date
+- page
+- useFormFormat
+- rate default null
+- use Dayjs
+- select
+- page
+
+## 4.2.10
+
+### Patch Changes
+
+- page
+- select
+- pagination add pullrefresh
+- d
+- page
+- useFormFormat
+- rate default null
+- use Dayjs
+- select
+- page
+
 ## 4.2.9
 
 ### Patch Changes

package/components/pagination/ExPagination.jsx

@@ -239,6 +239,7 @@ export default defineComponent({
 			return (
 				<div class={`ex-pagination`}>
 					{searchElem()}
+					{slots.prepend?.()}
 
 					<div class={`ex-pagination__list`} style={{ paddingTop: `${state.offsetTop}px` }}>
 						{state.empty ? (

package/dist/hooks.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index-0de12d0f.cjs"),r=require("dayjs"),i=require("lodash-es");require("axios");require("vant");function o(e,u,n){return s.sm2_exports.doEncrypt(e,u,n)}function c(e,u){return s.sm32(e,u)}function F(e,u,n){return s.sm4_exports.encrypt(e,u,n)}function a(e,u,n){return s.sm4_exports.encrypt(e,u,n)}function m(e,u){return(/^\d+$/.test(e)||/^-\d+$/.test(e))&&String(e).length<=10&&(e=parseInt(e+"000")),u?r(e,u):r(e)}function t(e,u){return e?(r.isDayjs(e)||(e=r(e)),e.format(u||"YYYY-MM-DD HH:mm")):""}function S(e){return e?(r.isDayjs(e)||(e=r(e)),e.unix()):""}function y(e,u){return e&&i.isString(e)&&(e=parseInt(e)),e<9999999999&&(e*=1e3),t(new Date(e),u)}exports.STATUS=s.STATUS;exports._configStatus=s._configStatus;exports.useCache=s.useCache;exports.useFetch=s.useFetch;exports.useFindLabelsFromPath=s.useFindLabelsFromPath;exports.useFindOptionByValue=s.useFindOptionByValue;exports.useFindParentValues=s.useFindParentValues;exports.useFindPropertyRecursive=s.useFindPropertyRecursive;exports.useFindTextsFromPath=s.useFindTextsFromPath;exports.useFindTextsInValues=s.useFindTextsInValues;exports.useFormFail=s.useFormFail;exports.useFormFormat=s.useFormFormat;exports.useHiddenForm=s.useHiddenForm;exports.useProcessStatus=s.useProcessStatus;exports.useProcessStatusSuccess=s.useProcessStatusSuccess;exports.useTextFromOptionsValue=s.useTextFromOptionsValue;exports.useDateFormat=t;exports.useDateUnix=S;exports.useDayjs=m;exports.useSm2Encrypt=o;exports.useSm3=c;exports.useSm4Decrypt=a;exports.useSm4Encrypt=F;exports.useTimestampFormat=y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index-f397a67d.cjs"),r=require("dayjs"),i=require("lodash-es");require("axios");require("vant");function o(e,u,n){return s.sm2_exports.doEncrypt(e,u,n)}function c(e,u){return s.sm32(e,u)}function F(e,u,n){return s.sm4_exports.encrypt(e,u,n)}function a(e,u,n){return s.sm4_exports.encrypt(e,u,n)}function m(e,u){return(/^\d+$/.test(e)||/^-\d+$/.test(e))&&String(e).length<=10&&(e=parseInt(e+"000")),u?r(e,u):r(e)}function t(e,u){return e?(r.isDayjs(e)||(e=r(e)),e.format(u||"YYYY-MM-DD HH:mm")):""}function S(e){return e?(r.isDayjs(e)||(e=r(e)),e.unix()):""}function y(e,u){return e&&i.isString(e)&&(e=parseInt(e)),e<9999999999&&(e*=1e3),t(new Date(e),u)}exports.STATUS=s.STATUS;exports._configStatus=s._configStatus;exports.useCache=s.useCache;exports.useFetch=s.useFetch;exports.useFindLabelsFromPath=s.useFindLabelsFromPath;exports.useFindOptionByValue=s.useFindOptionByValue;exports.useFindParentValues=s.useFindParentValues;exports.useFindPropertyRecursive=s.useFindPropertyRecursive;exports.useFindTextsFromPath=s.useFindTextsFromPath;exports.useFindTextsInValues=s.useFindTextsInValues;exports.useFormFail=s.useFormFail;exports.useFormFormat=s.useFormFormat;exports.useHiddenForm=s.useHiddenForm;exports.useProcessStatus=s.useProcessStatus;exports.useProcessStatusSuccess=s.useProcessStatusSuccess;exports.useTextFromOptionsValue=s.useTextFromOptionsValue;exports.useDateFormat=t;exports.useDateUnix=S;exports.useDayjs=m;exports.useSm2Encrypt=o;exports.useSm3=c;exports.useSm4Decrypt=a;exports.useSm4Encrypt=F;exports.useTimestampFormat=y;
 //# sourceMappingURL=hooks.cjs.map

package/dist/hooks.js

@@ -1,5 +1,5 @@
-import { s as t, f as o, g as e } from "./index-5ac7f514.js";
-import { S as j, _ as V, u as Y, a as _, j as E, k as H, m as I, l as b, b as M, i as O, e as U, d as $, n as k, o as v, c as w, h as A } from "./index-5ac7f514.js";
+import { s as t, f as o, g as e } from "./index-20463bba.js";
+import { S as j, _ as V, u as Y, a as _, j as E, k as H, m as I, l as b, b as M, i as O, e as U, d as $, n as k, o as v, c as w, h as A } from "./index-20463bba.js";
 import n from "dayjs";
 import { isString as i } from "lodash-es";
 import "axios";

package/dist/{index-5ac7f514.js → index-20463bba.js}

@@ -1,7 +1,7 @@
 var De = Object.defineProperty;
 var Fe = (t, n, e) => n in t ? De(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
 var L = (t, n, e) => (Fe(t, typeof n != "symbol" ? n + "" : n, e), e);
-import { isString as xt, isObject as jt, reduce as Ke, find as ze, flatMapDeep as Ye, isUndefined as Ae, cloneDeep as Mt, isFunction as Gt, isDate as je, isBoolean as Me, isArray as Ge } from "lodash-es";
+import { isString as xt, isObject as Yt, reduce as Ke, find as ze, flatMapDeep as je, isUndefined as Ae, cloneDeep as Mt, isFunction as Gt, isDate as Ye, isBoolean as Me, isArray as Ge } from "lodash-es";
 import he from "axios";
 import { closeToast as We, allowMultipleToast as kt, showLoadingToast as Zt, showSuccessToast as Qe, showFailToast as Lt } from "vant";
 import de from "dayjs";
@@ -70,7 +70,7 @@ function xr(t) {
         message: e || "加载中...",
         duration: 0,
         forbidClick: !0
-      }) : jt(e) ? n = Zt({ duration: 0, ...e }) : n = Zt({
+      }) : Yt(e) ? n = Zt({ duration: 0, ...e }) : n = Zt({
         message: "加载中...",
         duration: 0,
         forbidClick: !0
@@ -147,7 +147,7 @@ function Ar(t, n, e) {
   }, Xe(t, n, e);
 }
 function tn(t, n, e) {
-  return Ye(t, (o, r) => r === n ? o : r === e ? tn(o, n, e) : []);
+  return je(t, (o, r) => r === n ? o : r === e ? tn(o, n, e) : []);
 }
 function Tr(t, n, e) {
   e = e || {
@@ -226,8 +226,8 @@ function Cr(t, n) {
     var l, s;
     for (let i in r) {
       let u;
-      if (de.isDayjs(r[i]) ? u = r[i] : je(r[i]) && (u = de(r[i])), u && n.date) {
-        xt(n.date) ? r[i] = u.format(n.date) : Gt(n.date) ? r[i] = n.date(u) : r[i] = r[i].unix();
+      if (de.isDayjs(r[i]) ? u = r[i] : Ye(r[i]) && (u = de(r[i])), u && n.date) {
+        xt(n.date) ? r[i] = u.format(n.date) : Gt(n.date) ? r[i] = n.date(u) : r[i] = u.unix();
         continue;
       }
       if (Me(r[i]) && n.boolean) {
@@ -236,13 +236,13 @@ function Cr(t, n) {
       }
       if (n.attachment) {
         const a = n.attachment;
-        if (jt(r[i]) && xt(a) && !Ae(r[i][a])) {
+        if (Yt(r[i]) && xt(a) && !Ae(r[i][a])) {
           r[i] = r[i][a];
           continue;
         } else if (c && xt(r[i]) && xt(a) && a === i) {
           r = r[a];
           continue;
-        } else if (jt(r[i]) && Gt(a)) {
+        } else if (Yt(r[i]) && Gt(a)) {
           r[i] = a(r[i]);
           continue;
         }
@@ -323,7 +323,7 @@ function M(t, n, e) {
     throw new Error(`${t} expected ${e} bytes, got ${r}`);
   return o;
 }
-function Y(...t) {
+function j(...t) {
   const n = new Uint8Array(t.reduce((o, r) => o + r.length, 0));
   let e = 0;
   return t.forEach((o) => {
@@ -377,7 +377,7 @@ function Oe(t, n, e) {
       const b = o.slice();
       m.push(b), f += o.length;
     }
-    return Y(...m);
+    return j(...m);
   };
   return (f, m) => {
     l(), i(f);
@@ -421,7 +421,7 @@ const dn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   bytesToHex: nt,
   bytesToNumberBE: yt,
   bytesToNumberLE: Xt,
-  concatBytes: Y,
+  concatBytes: j,
   createHmacDrbg: Oe,
   ensureBytes: M,
   equalBytes: cn,
@@ -777,7 +777,7 @@ BigInt(4);
 function On(t) {
   const n = An(t), { Fp: e } = n, o = n.toBytes || ((g, h, w) => {
     const y = h.toAffine();
-    return Y(Uint8Array.from([4]), e.toBytes(y.x), e.toBytes(y.y));
+    return j(Uint8Array.from([4]), e.toBytes(y.x), e.toBytes(y.y));
   }), r = n.fromBytes || ((g) => {
     const h = g.subarray(1), w = e.fromBytes(h.subarray(0, e.BYTES)), y = e.fromBytes(h.subarray(e.BYTES, 2 * e.BYTES));
     return { x: w, y };
@@ -909,8 +909,8 @@ function On(t) {
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
       const { a: h, b: w } = n, y = e.mul(w, me), { px: v, py: S, pz: I } = this;
-      let T = e.ZERO, E = e.ZERO, x = e.ZERO, A = e.mul(v, v), j = e.mul(S, S), C = e.mul(I, I), O = e.mul(v, S);
-      return O = e.add(O, O), x = e.mul(v, I), x = e.add(x, x), T = e.mul(h, x), E = e.mul(y, C), E = e.add(T, E), T = e.sub(j, E), E = e.add(j, E), E = e.mul(T, E), T = e.mul(O, T), x = e.mul(y, x), C = e.mul(h, C), O = e.sub(A, C), O = e.mul(h, O), O = e.add(O, x), x = e.add(A, A), A = e.add(x, A), A = e.add(A, C), A = e.mul(A, O), E = e.add(E, A), C = e.mul(S, I), C = e.add(C, C), A = e.mul(C, O), T = e.sub(T, A), x = e.mul(C, j), x = e.add(x, x), x = e.add(x, x), new f(T, E, x);
+      let T = e.ZERO, E = e.ZERO, x = e.ZERO, A = e.mul(v, v), Y = e.mul(S, S), C = e.mul(I, I), O = e.mul(v, S);
+      return O = e.add(O, O), x = e.mul(v, I), x = e.add(x, x), T = e.mul(h, x), E = e.mul(y, C), E = e.add(T, E), T = e.sub(Y, E), E = e.add(Y, E), E = e.mul(T, E), T = e.mul(O, T), x = e.mul(y, x), C = e.mul(h, C), O = e.sub(A, C), O = e.mul(h, O), O = e.add(O, x), x = e.add(A, A), A = e.add(x, A), A = e.add(A, C), A = e.mul(A, O), E = e.add(E, A), C = e.mul(S, I), C = e.add(C, C), A = e.mul(C, O), T = e.sub(T, A), x = e.mul(C, Y), x = e.add(x, x), x = e.add(x, x), new f(T, E, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -920,11 +920,11 @@ function On(t) {
       a(h);
       const { px: w, py: y, pz: v } = this, { px: S, py: I, pz: T } = h;
       let E = e.ZERO, x = e.ZERO, A = e.ZERO;
-      const j = n.a, C = e.mul(n.b, me);
+      const Y = n.a, C = e.mul(n.b, me);
       let O = e.mul(w, S), D = e.mul(y, I), F = e.mul(v, T), rt = e.add(w, y), d = e.add(S, I);
       rt = e.mul(rt, d), d = e.add(O, D), rt = e.sub(rt, d), d = e.add(w, v);
       let p = e.add(S, T);
-      return d = e.mul(d, p), p = e.add(O, F), d = e.sub(d, p), p = e.add(y, v), E = e.add(I, T), p = e.mul(p, E), E = e.add(D, F), p = e.sub(p, E), A = e.mul(j, d), E = e.mul(C, F), A = e.add(E, A), E = e.sub(D, A), A = e.add(D, A), x = e.mul(E, A), D = e.add(O, O), D = e.add(D, O), F = e.mul(j, F), d = e.mul(C, d), D = e.add(D, F), F = e.sub(O, F), F = e.mul(j, F), d = e.add(d, F), O = e.mul(D, d), x = e.add(x, O), O = e.mul(p, d), E = e.mul(rt, E), E = e.sub(E, O), O = e.mul(rt, D), A = e.mul(p, A), A = e.add(A, O), new f(E, x, A);
+      return d = e.mul(d, p), p = e.add(O, F), d = e.sub(d, p), p = e.add(y, v), E = e.add(I, T), p = e.mul(p, E), E = e.add(D, F), p = e.sub(p, E), A = e.mul(Y, d), E = e.mul(C, F), A = e.add(E, A), E = e.sub(D, A), A = e.add(D, A), x = e.mul(E, A), D = e.add(O, O), D = e.add(D, O), F = e.mul(Y, F), d = e.mul(C, d), D = e.add(D, F), F = e.sub(O, F), F = e.mul(Y, F), d = e.add(d, F), O = e.mul(D, d), x = e.add(x, O), O = e.mul(p, d), E = e.mul(rt, E), E = e.sub(E, O), O = e.mul(rt, D), A = e.mul(p, A), A = e.add(A, O), new f(E, x, A);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -972,8 +972,8 @@ function On(t) {
       const { endo: S } = n;
       if (S) {
         const { k1neg: I, k1: T, k2neg: E, k2: x } = S.splitScalar(w);
-        let { p: A, f: j } = this.wNAF(T), { p: C, f: O } = this.wNAF(x);
-        A = b.constTimeNegate(I, A), C = b.constTimeNegate(E, C), C = new f(e.mul(C.px, S.beta), C.py, C.pz), y = A.add(C), v = j.add(O);
+        let { p: A, f: Y } = this.wNAF(T), { p: C, f: O } = this.wNAF(x);
+        A = b.constTimeNegate(I, A), C = b.constTimeNegate(E, C), C = new f(e.mul(C.px, S.beta), C.py, C.pz), y = A.add(C), v = Y.add(O);
       } else {
         const { p: I, f: T } = this.wNAF(w);
         y = I, v = T;
@@ -1058,7 +1058,7 @@ function Un(t) {
   const { ProjectivePoint: u, normPrivateKeyToScalar: a, weierstrassEquation: f, isWithinCurveOrder: m } = On({
     ...n,
     toBytes(d, p, B) {
-      const U = p.toAffine(), P = e.toBytes(U.x), q = Y;
+      const U = p.toAffine(), P = e.toBytes(U.x), q = j;
       return B ? q(Uint8Array.from([p.hasEvenY() ? 2 : 3]), P) : q(Uint8Array.from([4]), P, e.toBytes(U.y));
     },
     fromBytes(d) {
@@ -1193,7 +1193,7 @@ function Un(t) {
   }, x = n.bits2int_modN || function(d) {
     return s(E(d));
   }, A = Jt(n.nBitLength);
-  function j(d) {
+  function Y(d) {
     if (typeof d != "bigint")
       throw new Error("bigint expected");
     if (!(et <= d && d < A))
@@ -1206,12 +1206,12 @@ function Un(t) {
     const { hash: U, randomBytes: P } = n;
     let { lowS: q, prehash: K, extraEntropy: z } = B;
     q == null && (q = !0), d = M("msgHash", d), K && (d = M("prehashed msgHash", U(d)));
-    const ot = x(d), it = a(p), mt = [j(it), j(ot)];
+    const ot = x(d), it = a(p), mt = [Y(it), Y(ot)];
     if (z != null) {
       const ft = z === !0 ? P(e.BYTES) : z;
       mt.push(M("extraEntropy", ft, e.BYTES));
     }
-    const It = Y(...mt), st = ot;
+    const It = j(...mt), st = ot;
     function $t(ft) {
       const Et = E(ft);
       if (!m(Et))
@@ -1412,7 +1412,7 @@ function $n(t = 0) {
   const n = new Uint8Array(t);
   return St ? St.getRandomValues(n) : Vn(t);
 }
-var He = (t) => t instanceof Uint8Array, Yt = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), kn = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+var He = (t) => t instanceof Uint8Array, jt = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), kn = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!kn)
   throw new Error("Non little-endian hardware is not supported");
 var Zn = Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
@@ -1444,7 +1444,7 @@ function Fn(t) {
   return n.outputLen = e.outputLen, n.blockLen = e.blockLen, n.create = () => t(), n;
 }
 var Kn = (t, n, e) => t & n | t & e | n & e, ve = (t, n, e) => t ^ n ^ e, zn = (t, n, e) => t & n | ~t & e;
-function Yn(t, n, e, o) {
+function jn(t, n, e, o) {
   if (typeof t.setBigUint64 == "function")
     return t.setBigUint64(n, e, o);
   const r = BigInt(32), c = BigInt(4294967295), l = Number(e >> r & c), s = Number(e & c), i = o ? 4 : 0, u = o ? 0 : 4;
@@ -1454,7 +1454,7 @@ function W(t, n) {
   const e = n & 31;
   return t << e | t >>> 32 - e;
 }
-function jn(t) {
+function Yn(t) {
   return t ^ W(t, 9) ^ W(t, 17);
 }
 function Mn(t) {
@@ -1469,7 +1469,7 @@ var Gn = class extends _e {
     L(this, "length", 0);
     L(this, "pos", 0);
     L(this, "destroyed", !1);
-    this.blockLen = n, this.outputLen = e, this.padOffset = o, this.isLE = r, this.buffer = new Uint8Array(n), this.view = Yt(this.buffer);
+    this.blockLen = n, this.outputLen = e, this.padOffset = o, this.isLE = r, this.buffer = new Uint8Array(n), this.view = jt(this.buffer);
   }
   update(n) {
     const { view: e, buffer: o, blockLen: r } = this;
@@ -1478,7 +1478,7 @@ var Gn = class extends _e {
     for (let l = 0; l < c; ) {
       const s = Math.min(r - this.pos, c - l);
       if (s === r) {
-        const i = Yt(n);
+        const i = jt(n);
         for (; r <= c - l; l += r)
           this.process(i, l);
         continue;
@@ -1494,8 +1494,8 @@ var Gn = class extends _e {
     e[l++] = 128, this.buffer.subarray(l).fill(0), this.padOffset > r - l && (this.process(o, 0), l = 0);
     for (let f = l; f < r; f++)
       e[f] = 0;
-    Yn(o, r - 8, BigInt(this.length * 8), c), this.process(o, 0);
-    const s = Yt(n), i = this.outputLen;
+    jn(o, r - 8, BigInt(this.length * 8), c), this.process(o, 0);
+    const s = jt(n), i = this.outputLen;
     if (i % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const u = i / 4, a = this.get();
@@ -1544,7 +1544,7 @@ var Gn = class extends _e {
     let { A: o, B: r, C: c, D: l, E: s, F: i, G: u, H: a } = this;
     for (let f = 0; f < 64; f++) {
       let m = f >= 0 && f <= 15, b = m ? Wn : Qn, g = W(W(o, 12) + s + W(b, f), 7), h = g ^ W(o, 12), w = (m ? ve(o, r, c) : Kn(o, r, c)) + l + h + xe[f] | 0, y = (m ? ve(s, i, u) : zn(s, i, u)) + a + g + X[f] | 0;
-      l = c, c = W(r, 9), r = o, o = w, a = u, u = W(i, 19), i = s, s = jn(y);
+      l = c, c = W(r, 9), r = o, o = w, a = u, u = W(i, 19), i = s, s = Yn(y);
     }
     o = o ^ this.A | 0, r = r ^ this.B | 0, c = c ^ this.C | 0, l = l ^ this.D | 0, s = s ^ this.E | 0, i = i ^ this.F | 0, u = u ^ this.G | 0, a = a ^ this.H | 0, this.set(o, r, c, l, s, i, u, a);
   }
@@ -1605,7 +1605,7 @@ var Jn = Pe(BigInt("115792089210356248756420345214020892766250353991924191454421
   Gx: BigInt("22963146547237050559479531362550074578802567295341616970375194840604139615431"),
   Gy: BigInt("85132369209828568825618990617112496413088388631904505083283536607588877201568"),
   hash: tt,
-  hmac: (t, ...n) => re(tt, t, Y(...n)),
+  hmac: (t, ...n) => re(tt, t, j(...n)),
   randomBytes: $n
 }), J = Pe(BigInt(N.CURVE.n));
 function oe(t) {
@@ -1675,7 +1675,7 @@ var Se = _("80000000000000000000000000000000"), Be = _("7fffffffffffffffffffffff
 function rr(t, n) {
   let e = new Uint8Array(n), o = 1, r = 0, c = se;
   const l = new Uint8Array(4), s = () => {
-    l[0] = o >> 24 & 255, l[1] = o >> 16 & 255, l[2] = o >> 8 & 255, l[3] = o & 255, c = tt(Y(t, l)), o++, r = 0;
+    l[0] = o >> 24 & 255, l[1] = o >> 16 & 255, l[2] = o >> 8 & 255, l[3] = o & 255, c = tt(j(t, l)), o++, r = 0;
   };
   s();
   for (let i = 0, u = e.length; i < u; i++)
@@ -1687,14 +1687,14 @@ function or(t, n, e, o, r, c = !1, l = "1234567812345678", s = "1234567812345678
   let f = _t(t.publicKey, l), m = _t(e, s);
   c && ([f, m] = [m, f]);
   const b = _(n.privateKey), g = _(t.privateKey), h = i.x, w = Se + (h & Be), y = J.add(g, J.mulN(w, b)), v = u.x, S = J.add(Se, v & Be), I = u.multiply(S).add(a).multiply(y), T = k(R($(I.x), 64)), E = k(R($(I.y), 64));
-  return rr(Y(T, E, f, m), r);
+  return rr(j(T, E, f, m), r);
 }
 var qe = 0, se = new Uint8Array();
 function ir(t, n, e = 1) {
   const o = typeof t == "string" ? k(Tt(t)) : Uint8Array.from(t), r = typeof n == "string" ? N.ProjectivePoint.fromHex(n) : n, c = oe(), l = _(c.privateKey);
   let s = c.publicKey;
   s.length > 128 && (s = s.substring(s.length - 128));
-  const i = r.multiply(l), u = k(R($(i.x), 64)), a = k(R($(i.y), 64)), f = At(tt(Y(u, o, a)));
+  const i = r.multiply(l), u = k(R($(i.x), 64)), a = k(R($(i.y), 64)), f = At(tt(j(u, o, a)));
   Ve(u, a, o);
   const m = At(o);
   return e === qe ? s + m + f : s + f + m;
@@ -1702,7 +1702,7 @@ function ir(t, n, e = 1) {
 function Ve(t, n, e) {
   let o = 1, r = 0, c = se;
   const l = new Uint8Array(4), s = () => {
-    l[0] = o >> 24 & 255, l[1] = o >> 16 & 255, l[2] = o >> 8 & 255, l[3] = o & 255, c = tt(Y(t, n, l)), o++, r = 0;
+    l[0] = o >> 24 & 255, l[1] = o >> 16 & 255, l[2] = o >> 8 & 255, l[3] = o & 255, c = tt(j(t, n, l)), o++, r = 0;
   };
   s();
   for (let i = 0, u = e.length; i < u; i++)
@@ -1715,7 +1715,7 @@ function sr(t, n, e = 1, {
   let c = t.substring(128, 128 + 64), l = t.substring(128 + 64);
   e === qe && (c = t.substring(t.length - 64), l = t.substring(128, t.length - 64));
   const s = k(l), u = N.ProjectivePoint.fromHex("04" + t.substring(0, 128)).multiply(r), a = k(R($(u.x), 64)), f = k(R($(u.y), 64));
-  return Ve(a, f, s), Vt(Array.from(tt(Y(a, s, f)))) === c.toLowerCase() ? o === "array" ? s : ie(s) : o === "array" ? [] : "";
+  return Ve(a, f, s), Vt(Array.from(tt(j(a, s, f)))) === c.toLowerCase() ? o === "array" ? s : ie(s) : o === "array" ? [] : "";
 }
 function cr(t, n, e = {}) {
   let {
@@ -1768,11 +1768,11 @@ function _t(t, n = "1234567812345678") {
     l = R($(f.x), 64), s = R($(f.y), 64);
   }
   const i = k(n + e + o + r + c + l + s), u = n.length * 4;
-  return tt(Y(new Uint8Array([u >> 8 & 255, u & 255]), i));
+  return tt(j(new Uint8Array([u >> 8 & 255, u & 255]), i));
 }
 function ce(t, n, e = "1234567812345678") {
   const o = _t(n, e);
-  return At(tt(Y(o, typeof t == "string" ? k(t) : t)));
+  return At(tt(j(o, typeof t == "string" ? k(t) : t)));
 }
 function ur(t, n) {
   const e = N.ProjectivePoint.fromHex(t);
@@ -2203,4 +2203,4 @@ export {
   Nn as s,
   Ir as u
 };
-//# sourceMappingURL=index-5ac7f514.js.map
+//# sourceMappingURL=index-20463bba.js.map