@naverpay/nurl 0.0.11 → 0.0.12

package/dist/cjs/punycode.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("core-js-pure/features/instance/push.js"),v=2147483647,f=36,k=1,M=26,L=38,V=700,y=72,O=128,S="-",B={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},m=f-k,u=Math.floor,T=String.fromCharCode;function g(t){throw new RangeError(B[t])}function j(t){const n=[];let r=0;const e=t.length;for(;r<e;){const o=t.charCodeAt(r++);if(o>=55296&&o<=56319&&r<e){const s=t.charCodeAt(r++);(s&64512)==56320?b(n).call(n,((o&1023)<<10)+(s&1023)+65536):(b(n).call(n,o),r--)}else b(n).call(n,o)}return n}const D=t=>t>=48&&t<58?26+(t-48):t>=65&&t<91?t-65:t>=97&&t<123?t-97:f,I=(t,n)=>t+22+75*(t<26?1:0)-0,q=(t,n,r)=>{let e=0;for(t=r?u(t/V):t>>1,t+=u(t/n);t>m*M>>1;e+=f)t=u(t/m);return u(e+(m+1)*t/(t+L))},E=t=>{const n=[],r=t.length;let e=0,o=O,s=y,a=t.lastIndexOf(S);a<0&&(a=0);for(let i=0;i<a;++i)t.charCodeAt(i)>=128&&g("not-basic"),b(n).call(n,t.charCodeAt(i));for(let i=a>0?a+1:0;i<r;){const p=e;for(let d=1,l=f;;l+=f){i>=r&&g("invalid-input");const h=D(t.charCodeAt(i++));h>=f&&g("invalid-input"),h>u((v-e)/d)&&g("overflow"),e+=h*d;const w=l<=s?k:l>=s+M?M:l-s;if(h<w)break;const C=f-w;d>u(v/C)&&g("overflow"),d*=C}const c=n.length+1;s=q(e-p,c,p==0),u(e/c)>v-o&&g("overflow"),o+=u(e/c),e%=c,n.splice(e++,0,o)}return String.fromCodePoint(...n)},F=t=>{const n=[],r=j(t),e=r.length;let o=O,s=0,a=y;for(const c of r)c<128&&b(n).call(n,T(c));const i=n.length;let p=i;for(i&&b(n).call(n,S);p<e;){let c=v;for(const l of r)l>=o&&l<c&&(c=l);const d=p+1;c-o>u((v-s)/d)&&g("overflow"),s+=(c-o)*d,o=c;for(const l of r)if(l<o&&++s>v&&g("overflow"),l===o){let h=s;for(let w=f;;w+=f){const C=w<=a?k:w>=a+M?M:w-a;if(h<C)break;const x=h-C,A=f-C;b(n).call(n,T(I(C+x%A))),h=u(x/A)}b(n).call(n,T(I(h))),a=q(s,d,p===i),s=0,++p}++s,++o}return n.join("")};exports.decode=E;exports.encode=F;exports.ucs2decode=j;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const C=2147483647,f=36,T=1,v=26,L=38,V=700,I=72,O=128,S="-",q={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},M=f-T,a=Math.floor,m=String.fromCharCode;function p(t){throw new RangeError(q[t])}function j(t){const n=[];let s=0;const e=t.length;for(;s<e;){const o=t.charCodeAt(s++);if(o>=55296&&o<=56319&&s<e){const r=t.charCodeAt(s++);(r&64512)==56320?n.push(((o&1023)<<10)+(r&1023)+65536):(n.push(o),s--)}else n.push(o)}return n}const B=t=>t>=48&&t<58?26+(t-48):t>=65&&t<91?t-65:t>=97&&t<123?t-97:f,A=(t,n)=>t+22+75*(t<26?1:0)-0,y=(t,n,s)=>{let e=0;for(t=s?a(t/V):t>>1,t+=a(t/n);t>M*v>>1;e+=f)t=a(t/M);return a(e+(M+1)*t/(t+L))},D=t=>{const n=[],s=t.length;let e=0,o=O,r=I,u=t.lastIndexOf(S);u<0&&(u=0);for(let c=0;c<u;++c)t.charCodeAt(c)>=128&&p("not-basic"),n.push(t.charCodeAt(c));for(let c=u>0?u+1:0;c<s;){const g=e;for(let d=1,l=f;;l+=f){c>=s&&p("invalid-input");const h=B(t.charCodeAt(c++));h>=f&&p("invalid-input"),h>a((C-e)/d)&&p("overflow"),e+=h*d;const b=l<=r?T:l>=r+v?v:l-r;if(h<b)break;const w=f-b;d>a(C/w)&&p("overflow"),d*=w}const i=n.length+1;r=y(e-g,i,g==0),a(e/i)>C-o&&p("overflow"),o+=a(e/i),e%=i,n.splice(e++,0,o)}return String.fromCodePoint(...n)},E=t=>{const n=[],s=j(t),e=s.length;let o=O,r=0,u=I;for(const i of s)i<128&&n.push(m(i));const c=n.length;let g=c;for(c&&n.push(S);g<e;){let i=C;for(const l of s)l>=o&&l<i&&(i=l);const d=g+1;i-o>a((C-r)/d)&&p("overflow"),r+=(i-o)*d,o=i;for(const l of s)if(l<o&&++r>C&&p("overflow"),l===o){let h=r;for(let b=f;;b+=f){const w=b<=u?T:b>=u+v?v:b-u;if(h<w)break;const k=h-w,x=f-w;n.push(m(A(w+k%x))),h=a(k/x)}n.push(m(A(h))),u=y(r,d,g===c),r=0,++g}++r,++o}return n.join("")};exports.decode=D;exports.encode=E;exports.ucs2decode=j;

package/dist/esm/punycode.mjs

@@ -1,89 +1,88 @@
-import d from "core-js-pure/features/instance/push.js";
-const v = 2147483647, f = 36, k = 1, m = 26, q = 38, y = 700, L = 72, O = 128, V = "-", B = {
+const v = "-", k = {
   overflow: "Overflow: input needs wider integers to process",
   "not-basic": "Illegal input >= 0x80 (not a basic code point)",
   "invalid-input": "Invalid input"
-}, M = f - k, u = Math.floor, x = String.fromCharCode;
-function g(t) {
-  throw new RangeError(B[t]);
+}, g = 35, u = Math.floor, M = String.fromCharCode;
+function b(t) {
+  throw new RangeError(k[t]);
 }
-function S(t) {
+function A(t) {
   const n = [];
-  let r = 0;
-  const e = t.length;
-  for (; r < e; ) {
-    const o = t.charCodeAt(r++);
-    if (o >= 55296 && o <= 56319 && r < e) {
-      const s = t.charCodeAt(r++);
-      (s & 64512) == 56320 ? d(n).call(n, ((o & 1023) << 10) + (s & 1023) + 65536) : (d(n).call(n, o), r--);
+  let s = 0;
+  const o = t.length;
+  for (; s < o; ) {
+    const e = t.charCodeAt(s++);
+    if (e >= 55296 && e <= 56319 && s < o) {
+      const i = t.charCodeAt(s++);
+      (i & 64512) == 56320 ? n.push(((e & 1023) << 10) + (i & 1023) + 65536) : (n.push(e), s--);
     } else
-      d(n).call(n, o);
+      n.push(e);
   }
   return n;
 }
-const D = (t) => t >= 48 && t < 58 ? 26 + (t - 48) : t >= 65 && t < 91 ? t - 65 : t >= 97 && t < 123 ? t - 97 : f, I = (t, n) => t + 22 + 75 * (t < 26 ? 1 : 0) - 0, j = (t, n, r) => {
-  let e = 0;
+const T = (t) => t >= 48 && t < 58 ? 26 + (t - 48) : t >= 65 && t < 91 ? t - 65 : t >= 97 && t < 123 ? t - 97 : 36, C = (t, n) => t + 22 + 75 * (t < 26 ? 1 : 0) - 0, I = (t, n, s) => {
+  let o = 0;
   for (
-    t = r ? u(t / y) : t >> 1, t += u(t / n);
+    t = s ? u(t / 700) : t >> 1, t += u(t / n);
     /* no initialization */
-    t > M * m >> 1;
-    e += f
+    t > g * 26 >> 1;
+    o += 36
   )
-    t = u(t / M);
-  return u(e + (M + 1) * t / (t + q));
-}, F = (t) => {
-  const n = [], r = t.length;
-  let e = 0, o = O, s = L, a = t.lastIndexOf(V);
-  a < 0 && (a = 0);
-  for (let c = 0; c < a; ++c)
-    t.charCodeAt(c) >= 128 && g("not-basic"), d(n).call(n, t.charCodeAt(c));
-  for (let c = a > 0 ? a + 1 : 0; c < r; ) {
-    const b = e;
-    for (let p = 1, l = f; ; l += f) {
-      c >= r && g("invalid-input");
-      const h = D(t.charCodeAt(c++));
-      h >= f && g("invalid-input"), h > u((v - e) / p) && g("overflow"), e += h * p;
-      const w = l <= s ? k : l >= s + m ? m : l - s;
-      if (h < w)
+    t = u(t / g);
+  return u(o + (g + 1) * t / (t + 38));
+}, B = (t) => {
+  const n = [], s = t.length;
+  let o = 0, e = 128, i = 72, l = t.lastIndexOf(v);
+  l < 0 && (l = 0);
+  for (let a = 0; a < l; ++a)
+    t.charCodeAt(a) >= 128 && b("not-basic"), n.push(t.charCodeAt(a));
+  for (let a = l > 0 ? l + 1 : 0; a < s; ) {
+    const p = o;
+    for (let h = 1, c = 36; ; c += 36) {
+      a >= s && b("invalid-input");
+      const f = T(t.charCodeAt(a++));
+      f >= 36 && b("invalid-input"), f > u((2147483647 - o) / h) && b("overflow"), o += f * h;
+      const x = c <= i ? 1 : c >= i + 26 ? 26 : c - i;
+      if (f < x)
         break;
-      const C = f - w;
-      p > u(v / C) && g("overflow"), p *= C;
+      const d = 36 - x;
+      h > u(2147483647 / d) && b("overflow"), h *= d;
     }
-    const i = n.length + 1;
-    s = j(e - b, i, b == 0), u(e / i) > v - o && g("overflow"), o += u(e / i), e %= i, n.splice(e++, 0, o);
+    const r = n.length + 1;
+    i = I(o - p, r, p == 0), u(o / r) > 2147483647 - e && b("overflow"), e += u(o / r), o %= r, n.splice(o++, 0, e);
   }
   return String.fromCodePoint(...n);
-}, N = (t) => {
-  const n = [], r = S(t), e = r.length;
-  let o = O, s = 0, a = L;
-  for (const i of r)
-    i < 128 && d(n).call(n, x(i));
-  const c = n.length;
-  let b = c;
-  for (c && d(n).call(n, V); b < e; ) {
-    let i = v;
-    for (const l of r)
-      l >= o && l < i && (i = l);
-    const p = b + 1;
-    i - o > u((v - s) / p) && g("overflow"), s += (i - o) * p, o = i;
-    for (const l of r)
-      if (l < o && ++s > v && g("overflow"), l === o) {
-        let h = s;
-        for (let w = f; ; w += f) {
-          const C = w <= a ? k : w >= a + m ? m : w - a;
-          if (h < C)
+}, L = (t) => {
+  const n = [], s = A(t), o = s.length;
+  let e = 128, i = 0, l = 72;
+  for (const r of s)
+    r < 128 && n.push(M(r));
+  const a = n.length;
+  let p = a;
+  for (a && n.push(v); p < o; ) {
+    let r = 2147483647;
+    for (const c of s)
+      c >= e && c < r && (r = c);
+    const h = p + 1;
+    r - e > u((2147483647 - i) / h) && b("overflow"), i += (r - e) * h, e = r;
+    for (const c of s)
+      if (c < e && ++i > 2147483647 && b("overflow"), c === e) {
+        let f = i;
+        for (let x = 36; ; x += 36) {
+          const d = x <= l ? 1 : x >= l + 26 ? 26 : x - l;
+          if (f < d)
             break;
-          const A = h - C, T = f - C;
-          d(n).call(n, x(I(C + A % T))), h = u(A / T);
+          const w = f - d, m = 36 - d;
+          n.push(M(C(d + w % m))), f = u(w / m);
         }
-        d(n).call(n, x(I(h))), a = j(s, p, b === c), s = 0, ++b;
+        n.push(M(C(f))), l = I(i, h, p === a), i = 0, ++p;
       }
-    ++s, ++o;
+    ++i, ++e;
   }
   return n.join("");
 };
 export {
-  F as decode,
-  N as encode,
-  S as ucs2decode
+  B as decode,
+  L as encode,
+  A as ucs2decode
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@naverpay/nurl",
-  "version": "0.0.11",
+  "version": "0.0.12",
   "description": "URL build library",
   "main": "./dist/cjs/index.js",
   "module": "./dist/esm/index.mjs",