@vc-shell/framework 1.1.75 → 1.1.76

package/dist/vendor-punycode-js-CNI-zL6U.js

@@ -0,0 +1,133 @@
+const M = "-", B = /^xn--/, S = /[^\0-\x7F]/, T = /[\x2E\u3002\uFF0E\uFF61]/g, D = {
+  overflow: "Overflow: input needs wider integers to process",
+  "not-basic": "Illegal input >= 0x80 (not a basic code point)",
+  "invalid-input": "Invalid input"
+}, C = 35, u = Math.floor, g = String.fromCharCode;
+function d(t) {
+  throw new RangeError(D[t]);
+}
+function E(t, n) {
+  const o = [];
+  let e = t.length;
+  for (; e--; )
+    o[e] = n(t[e]);
+  return o;
+}
+function m(t, n) {
+  const o = t.split("@");
+  let e = "";
+  o.length > 1 && (e = o[0] + "@", t = o[1]), t = t.replace(T, ".");
+  const s = t.split("."), c = E(s, n).join(".");
+  return e + c;
+}
+function v(t) {
+  const n = [];
+  let o = 0;
+  const e = t.length;
+  for (; o < e; ) {
+    const s = t.charCodeAt(o++);
+    if (s >= 55296 && s <= 56319 && o < e) {
+      const c = t.charCodeAt(o++);
+      (c & 64512) == 56320 ? n.push(((s & 1023) << 10) + (c & 1023) + 65536) : (n.push(s), o--);
+    } else
+      n.push(s);
+  }
+  return n;
+}
+const L = (t) => String.fromCodePoint(...t), N = function(t) {
+  return t >= 48 && t < 58 ? 26 + (t - 48) : t >= 65 && t < 91 ? t - 65 : t >= 97 && t < 123 ? t - 97 : 36;
+}, I = function(t, n) {
+  return t + 22 + 75 * (t < 26) - ((n != 0) << 5);
+}, F = function(t, n, o) {
+  let e = 0;
+  for (t = o ? u(t / 700) : t >> 1, t += u(t / n); t > C * 26 >> 1; e += 36)
+    t = u(t / C);
+  return u(e + (C + 1) * t / (t + 38));
+}, A = function(t) {
+  const n = [], o = t.length;
+  let e = 0, s = 128, c = 72, l = t.lastIndexOf(M);
+  l < 0 && (l = 0);
+  for (let i = 0; i < l; ++i)
+    t.charCodeAt(i) >= 128 && d("not-basic"), n.push(t.charCodeAt(i));
+  for (let i = l > 0 ? l + 1 : 0; i < o; ) {
+    const r = e;
+    for (let a = 1, f = 36; ; f += 36) {
+      i >= o && d("invalid-input");
+      const x = N(t.charCodeAt(i++));
+      x >= 36 && d("invalid-input"), x > u((2147483647 - e) / a) && d("overflow"), e += x * a;
+      const p = f <= c ? 1 : f >= c + 26 ? 26 : f - c;
+      if (x < p)
+        break;
+      const b = 36 - p;
+      a > u(2147483647 / b) && d("overflow"), a *= b;
+    }
+    const h = n.length + 1;
+    c = F(e - r, h, r == 0), u(e / h) > 2147483647 - s && d("overflow"), s += u(e / h), e %= h, n.splice(e++, 0, s);
+  }
+  return String.fromCodePoint(...n);
+}, k = function(t) {
+  const n = [];
+  t = v(t);
+  const o = t.length;
+  let e = 128, s = 0, c = 72;
+  for (const r of t)
+    r < 128 && n.push(g(r));
+  const l = n.length;
+  let i = l;
+  for (l && n.push(M); i < o; ) {
+    let r = 2147483647;
+    for (const a of t)
+      a >= e && a < r && (r = a);
+    const h = i + 1;
+    r - e > u((2147483647 - s) / h) && d("overflow"), s += (r - e) * h, e = r;
+    for (const a of t)
+      if (a < e && ++s > 2147483647 && d("overflow"), a === e) {
+        let f = s;
+        for (let x = 36; ; x += 36) {
+          const p = x <= c ? 1 : x >= c + 26 ? 26 : x - c;
+          if (f < p)
+            break;
+          const b = f - p, w = 36 - p;
+          n.push(
+            g(I(p + b % w, 0))
+          ), f = u(b / w);
+        }
+        n.push(g(I(f, 0))), c = F(s, h, i === l), s = 0, ++i;
+      }
+    ++s, ++e;
+  }
+  return n.join("");
+}, j = function(t) {
+  return m(t, function(n) {
+    return B.test(n) ? A(n.slice(4).toLowerCase()) : n;
+  });
+}, O = function(t) {
+  return m(t, function(n) {
+    return S.test(n) ? "xn--" + k(n) : n;
+  });
+}, V = {
+  /**
+   * A string representing the current Punycode.js version number.
+   * @memberOf punycode
+   * @type String
+   */
+  version: "2.3.1",
+  /**
+   * An object of methods to convert from JavaScript's internal character
+   * representation (UCS-2) to Unicode code points, and back.
+   * @see <https://mathiasbynens.be/notes/javascript-encoding>
+   * @memberOf punycode
+   * @type Object
+   */
+  ucs2: {
+    decode: v,
+    encode: L
+  },
+  decode: A,
+  encode: k,
+  toASCII: O,
+  toUnicode: j
+};
+export {
+  V as p
+};

package/dist/vendor-rope-sequence-sEGCUMi8.js

@@ -0,0 +1,100 @@
+var l = 200, p = function() {
+};
+p.prototype.append = function(t) {
+  return t.length ? (t = p.from(t), !this.length && t || t.length < l && this.leafAppend(t) || this.length < l && t.leafPrepend(this) || this.appendInner(t)) : this;
+};
+p.prototype.prepend = function(t) {
+  return t.length ? p.from(t).append(this) : this;
+};
+p.prototype.appendInner = function(t) {
+  return new u(this, t);
+};
+p.prototype.slice = function(t, r) {
+  return t === void 0 && (t = 0), r === void 0 && (r = this.length), t >= r ? p.empty : this.sliceInner(Math.max(0, t), Math.min(this.length, r));
+};
+p.prototype.get = function(t) {
+  if (!(t < 0 || t >= this.length))
+    return this.getInner(t);
+};
+p.prototype.forEach = function(t, r, e) {
+  r === void 0 && (r = 0), e === void 0 && (e = this.length), r <= e ? this.forEachInner(t, r, e, 0) : this.forEachInvertedInner(t, r, e, 0);
+};
+p.prototype.map = function(t, r, e) {
+  r === void 0 && (r = 0), e === void 0 && (e = this.length);
+  var n = [];
+  return this.forEach(function(i, s) {
+    return n.push(t(i, s));
+  }, r, e), n;
+};
+p.from = function(t) {
+  return t instanceof p ? t : t && t.length ? new o(t) : p.empty;
+};
+var o = /* @__PURE__ */ function(h) {
+  function t(e) {
+    h.call(this), this.values = e;
+  }
+  h && (t.__proto__ = h), t.prototype = Object.create(h && h.prototype), t.prototype.constructor = t;
+  var r = { length: { configurable: !0 }, depth: { configurable: !0 } };
+  return t.prototype.flatten = function() {
+    return this.values;
+  }, t.prototype.sliceInner = function(n, i) {
+    return n == 0 && i == this.length ? this : new t(this.values.slice(n, i));
+  }, t.prototype.getInner = function(n) {
+    return this.values[n];
+  }, t.prototype.forEachInner = function(n, i, s, f) {
+    for (var a = i; a < s; a++)
+      if (n(this.values[a], f + a) === !1)
+        return !1;
+  }, t.prototype.forEachInvertedInner = function(n, i, s, f) {
+    for (var a = i - 1; a >= s; a--)
+      if (n(this.values[a], f + a) === !1)
+        return !1;
+  }, t.prototype.leafAppend = function(n) {
+    if (this.length + n.length <= l)
+      return new t(this.values.concat(n.flatten()));
+  }, t.prototype.leafPrepend = function(n) {
+    if (this.length + n.length <= l)
+      return new t(n.flatten().concat(this.values));
+  }, r.length.get = function() {
+    return this.values.length;
+  }, r.depth.get = function() {
+    return 0;
+  }, Object.defineProperties(t.prototype, r), t;
+}(p);
+p.empty = new o([]);
+var u = /* @__PURE__ */ function(h) {
+  function t(r, e) {
+    h.call(this), this.left = r, this.right = e, this.length = r.length + e.length, this.depth = Math.max(r.depth, e.depth) + 1;
+  }
+  return h && (t.__proto__ = h), t.prototype = Object.create(h && h.prototype), t.prototype.constructor = t, t.prototype.flatten = function() {
+    return this.left.flatten().concat(this.right.flatten());
+  }, t.prototype.getInner = function(e) {
+    return e < this.left.length ? this.left.get(e) : this.right.get(e - this.left.length);
+  }, t.prototype.forEachInner = function(e, n, i, s) {
+    var f = this.left.length;
+    if (n < f && this.left.forEachInner(e, n, Math.min(i, f), s) === !1 || i > f && this.right.forEachInner(e, Math.max(n - f, 0), Math.min(this.length, i) - f, s + f) === !1)
+      return !1;
+  }, t.prototype.forEachInvertedInner = function(e, n, i, s) {
+    var f = this.left.length;
+    if (n > f && this.right.forEachInvertedInner(e, n - f, Math.max(i, f) - f, s + f) === !1 || i < f && this.left.forEachInvertedInner(e, Math.min(n, f), i, s) === !1)
+      return !1;
+  }, t.prototype.sliceInner = function(e, n) {
+    if (e == 0 && n == this.length)
+      return this;
+    var i = this.left.length;
+    return n <= i ? this.left.slice(e, n) : e >= i ? this.right.slice(e - i, n - i) : this.left.slice(e, i).append(this.right.slice(0, n - i));
+  }, t.prototype.leafAppend = function(e) {
+    var n = this.right.leafAppend(e);
+    if (n)
+      return new t(this.left, n);
+  }, t.prototype.leafPrepend = function(e) {
+    var n = this.left.leafPrepend(e);
+    if (n)
+      return new t(n, this.right);
+  }, t.prototype.appendInner = function(e) {
+    return this.left.depth >= Math.max(this.right.depth, e.depth) + 1 ? new t(this.left, new t(this.right, e)) : new t(this, e);
+  }, t;
+}(p);
+export {
+  p as R
+};