@vc-shell/framework 2.0.0-alpha.8 → 2.0.0-alpha.9

package/dist/vendor-nth-check-D0N1qpsw.js

@@ -0,0 +1,45 @@
+import { b as u } from "./vendor-boolbase-DYkUBG-P.js";
+const b = /* @__PURE__ */ new Set([9, 10, 12, 13, 32]), d = 48, l = 57;
+function A(e) {
+  if (e = e.trim().toLowerCase(), e === "even")
+    return [2, 0];
+  if (e === "odd")
+    return [2, 1];
+  let t = 0, r = 0, c = n(), i = s();
+  if (t < e.length && e.charAt(t) === "n" && (t++, r = c * (i ?? 1), o(), t < e.length ? (c = n(), o(), i = s()) : c = i = 0), i === null || t < e.length)
+    throw new Error(`n-th rule couldn't be parsed ('${e}')`);
+  return [r, c * i];
+  function n() {
+    return e.charAt(t) === "-" ? (t++, -1) : (e.charAt(t) === "+" && t++, 1);
+  }
+  function s() {
+    const a = t;
+    let h = 0;
+    for (; t < e.length && e.charCodeAt(t) >= d && e.charCodeAt(t) <= l; )
+      h = h * 10 + (e.charCodeAt(t) - d), t++;
+    return t === a ? null : h;
+  }
+  function o() {
+    for (; t < e.length && b.has(e.charCodeAt(t)); )
+      t++;
+  }
+}
+function C(e) {
+  const t = e[0], r = e[1] - 1;
+  if (r < 0 && t <= 0)
+    return u.falseFunc;
+  if (t === -1)
+    return (n) => n <= r;
+  if (t === 0)
+    return (n) => n === r;
+  if (t === 1)
+    return r < 0 ? u.trueFunc : (n) => n >= r;
+  const c = Math.abs(t), i = (r % c + c) % c;
+  return t > 1 ? (n) => n >= r && n % c === i : (n) => n <= r && n % c === i;
+}
+function p(e) {
+  return C(A(e));
+}
+export {
+  p as n
+};

package/dist/vendor-orderedmap-B3SOk52B.js

@@ -0,0 +1,103 @@
+function e(t) {
+  this.content = t;
+}
+e.prototype = {
+  constructor: e,
+  find: function(t) {
+    for (var n = 0; n < this.content.length; n += 2)
+      if (this.content[n] === t) return n;
+    return -1;
+  },
+  // :: (string) → ?any
+  // Retrieve the value stored under `key`, or return undefined when
+  // no such key exists.
+  get: function(t) {
+    var n = this.find(t);
+    return n == -1 ? void 0 : this.content[n + 1];
+  },
+  // :: (string, any, ?string) → OrderedMap
+  // Create a new map by replacing the value of `key` with a new
+  // value, or adding a binding to the end of the map. If `newKey` is
+  // given, the key of the binding will be replaced with that key.
+  update: function(t, n, r) {
+    var i = r && r != t ? this.remove(r) : this, o = i.find(t), c = i.content.slice();
+    return o == -1 ? c.push(r || t, n) : (c[o + 1] = n, r && (c[o] = r)), new e(c);
+  },
+  // :: (string) → OrderedMap
+  // Return a map with the given key removed, if it existed.
+  remove: function(t) {
+    var n = this.find(t);
+    if (n == -1) return this;
+    var r = this.content.slice();
+    return r.splice(n, 2), new e(r);
+  },
+  // :: (string, any) → OrderedMap
+  // Add a new key to the start of the map.
+  addToStart: function(t, n) {
+    return new e([t, n].concat(this.remove(t).content));
+  },
+  // :: (string, any) → OrderedMap
+  // Add a new key to the end of the map.
+  addToEnd: function(t, n) {
+    var r = this.remove(t).content.slice();
+    return r.push(t, n), new e(r);
+  },
+  // :: (string, string, any) → OrderedMap
+  // Add a key after the given key. If `place` is not found, the new
+  // key is added to the end.
+  addBefore: function(t, n, r) {
+    var i = this.remove(n), o = i.content.slice(), c = i.find(t);
+    return o.splice(c == -1 ? o.length : c, 0, n, r), new e(o);
+  },
+  // :: ((key: string, value: any))
+  // Call the given function for each key/value pair in the map, in
+  // order.
+  forEach: function(t) {
+    for (var n = 0; n < this.content.length; n += 2)
+      t(this.content[n], this.content[n + 1]);
+  },
+  // :: (union<Object, OrderedMap>) → OrderedMap
+  // Create a new map by prepending the keys in this map that don't
+  // appear in `map` before the keys in `map`.
+  prepend: function(t) {
+    return t = e.from(t), t.size ? new e(t.content.concat(this.subtract(t).content)) : this;
+  },
+  // :: (union<Object, OrderedMap>) → OrderedMap
+  // Create a new map by appending the keys in this map that don't
+  // appear in `map` after the keys in `map`.
+  append: function(t) {
+    return t = e.from(t), t.size ? new e(this.subtract(t).content.concat(t.content)) : this;
+  },
+  // :: (union<Object, OrderedMap>) → OrderedMap
+  // Create a map containing all the keys in this map that don't
+  // appear in `map`.
+  subtract: function(t) {
+    var n = this;
+    t = e.from(t);
+    for (var r = 0; r < t.content.length; r += 2)
+      n = n.remove(t.content[r]);
+    return n;
+  },
+  // :: () → Object
+  // Turn ordered map into a plain object.
+  toObject: function() {
+    var t = {};
+    return this.forEach(function(n, r) {
+      t[n] = r;
+    }), t;
+  },
+  // :: number
+  // The amount of keys in this map.
+  get size() {
+    return this.content.length >> 1;
+  }
+};
+e.from = function(t) {
+  if (t instanceof e) return t;
+  var n = [];
+  if (t) for (var r in t) n.push(r, t[r]);
+  return new e(n);
+};
+export {
+  e as O
+};

package/dist/vendor-parse5-htmlparser2-tree-adapter-BUDJ887-.js

@@ -0,0 +1,143 @@
+import { D as x } from "./vendor-parse5-zq5Hn0y9.js";
+import { d as u, i as f, e as h, f as d, P as C, T as g, C as T, E as v, D as m } from "./vendor-domhandler-Kufn9M_V.js";
+function p(e) {
+  const t = e.includes('"') ? "'" : '"';
+  return t + e + t;
+}
+function D(e, t, n) {
+  let r = "!DOCTYPE ";
+  return e && (r += e), t ? r += ` PUBLIC ${p(t)}` : n && (r += " SYSTEM"), n && (r += ` ${p(n)}`), r;
+}
+const o = {
+  // Re-exports from domhandler
+  isCommentNode: h,
+  isElementNode: f,
+  isTextNode: u,
+  //Node construction
+  createDocument() {
+    const e = new m([]);
+    return e["x-mode"] = x.NO_QUIRKS, e;
+  },
+  createDocumentFragment() {
+    return new m([]);
+  },
+  createElement(e, t, n) {
+    const r = /* @__PURE__ */ Object.create(null), i = /* @__PURE__ */ Object.create(null), a = /* @__PURE__ */ Object.create(null);
+    for (let c = 0; c < n.length; c++) {
+      const l = n[c].name;
+      r[l] = n[c].value, i[l] = n[c].namespace, a[l] = n[c].prefix;
+    }
+    const s = new v(e, r, []);
+    return s.namespace = t, s["x-attribsNamespace"] = i, s["x-attribsPrefix"] = a, s;
+  },
+  createCommentNode(e) {
+    return new T(e);
+  },
+  createTextNode(e) {
+    return new g(e);
+  },
+  //Tree mutation
+  appendChild(e, t) {
+    const n = e.children[e.children.length - 1];
+    n && (n.next = t, t.prev = n), e.children.push(t), t.parent = e;
+  },
+  insertBefore(e, t, n) {
+    const r = e.children.indexOf(n), { prev: i } = n;
+    i && (i.next = t, t.prev = i), n.prev = t, t.next = n, e.children.splice(r, 0, t), t.parent = e;
+  },
+  setTemplateContent(e, t) {
+    o.appendChild(e, t);
+  },
+  getTemplateContent(e) {
+    return e.children[0];
+  },
+  setDocumentType(e, t, n, r) {
+    const i = D(t, n, r);
+    let a = e.children.find((s) => d(s) && s.name === "!doctype");
+    a ? a.data = i ?? null : (a = new C("!doctype", i), o.appendChild(e, a)), a["x-name"] = t, a["x-publicId"] = n, a["x-systemId"] = r;
+  },
+  setDocumentMode(e, t) {
+    e["x-mode"] = t;
+  },
+  getDocumentMode(e) {
+    return e["x-mode"];
+  },
+  detachNode(e) {
+    if (e.parent) {
+      const t = e.parent.children.indexOf(e), { prev: n, next: r } = e;
+      e.prev = null, e.next = null, n && (n.next = r), r && (r.prev = n), e.parent.children.splice(t, 1), e.parent = null;
+    }
+  },
+  insertText(e, t) {
+    const n = e.children[e.children.length - 1];
+    n && u(n) ? n.data += t : o.appendChild(e, o.createTextNode(t));
+  },
+  insertTextBefore(e, t, n) {
+    const r = e.children[e.children.indexOf(n) - 1];
+    r && u(r) ? r.data += t : o.insertBefore(e, o.createTextNode(t), n);
+  },
+  adoptAttributes(e, t) {
+    for (let n = 0; n < t.length; n++) {
+      const r = t[n].name;
+      e.attribs[r] === void 0 && (e.attribs[r] = t[n].value, e["x-attribsNamespace"][r] = t[n].namespace, e["x-attribsPrefix"][r] = t[n].prefix);
+    }
+  },
+  //Tree traversing
+  getFirstChild(e) {
+    return e.children[0];
+  },
+  getChildNodes(e) {
+    return e.children;
+  },
+  getParentNode(e) {
+    return e.parent;
+  },
+  getAttrList(e) {
+    return e.attributes;
+  },
+  //Node data
+  getTagName(e) {
+    return e.name;
+  },
+  getNamespaceURI(e) {
+    return e.namespace;
+  },
+  getTextNodeContent(e) {
+    return e.data;
+  },
+  getCommentNodeContent(e) {
+    return e.data;
+  },
+  getDocumentTypeNodeName(e) {
+    var t;
+    return (t = e["x-name"]) !== null && t !== void 0 ? t : "";
+  },
+  getDocumentTypeNodePublicId(e) {
+    var t;
+    return (t = e["x-publicId"]) !== null && t !== void 0 ? t : "";
+  },
+  getDocumentTypeNodeSystemId(e) {
+    var t;
+    return (t = e["x-systemId"]) !== null && t !== void 0 ? t : "";
+  },
+  //Node types
+  isDocumentTypeNode(e) {
+    return d(e) && e.name === "!doctype";
+  },
+  // Source code location
+  setNodeSourceCodeLocation(e, t) {
+    t && (e.startIndex = t.startOffset, e.endIndex = t.endOffset), e.sourceCodeLocation = t;
+  },
+  getNodeSourceCodeLocation(e) {
+    return e.sourceCodeLocation;
+  },
+  updateNodeSourceCodeLocation(e, t) {
+    t.endOffset != null && (e.endIndex = t.endOffset), e.sourceCodeLocation = {
+      ...e.sourceCodeLocation,
+      ...t
+    };
+  }
+};
+export {
+  o as a
+};