asterui 0.12.0 → 0.12.2

package/dist/index146.js

@@ -1,73 +1,24 @@
-import { __module as c } from "./index151.js";
-var m;
-function j() {
-  return m ? c.exports : (m = 1, (function(y) {
-    var u = {
-      single_source_shortest_paths: function(o, t, e) {
-        var r = {}, i = {};
-        i[t] = 0;
-        var n = u.PriorityQueue.make();
-        n.push(t, 0);
-        for (var f, p, s, h, _, d, a, v, l; !n.empty(); ) {
-          f = n.pop(), p = f.value, h = f.cost, _ = o[p] || {};
-          for (s in _)
-            _.hasOwnProperty(s) && (d = _[s], a = h + d, v = i[s], l = typeof i[s] > "u", (l || v > a) && (i[s] = a, n.push(s, a), r[s] = p));
-        }
-        if (typeof e < "u" && typeof i[e] > "u") {
-          var q = ["Could not find a path from ", t, " to ", e, "."].join("");
-          throw new Error(q);
-        }
-        return r;
-      },
-      extract_shortest_path_from_predecessor_list: function(o, t) {
-        for (var e = [], r = t; r; )
-          e.push(r), o[r], r = o[r];
-        return e.reverse(), e;
-      },
-      find_path: function(o, t, e) {
-        var r = u.single_source_shortest_paths(o, t, e);
-        return u.extract_shortest_path_from_predecessor_list(
-          r,
-          e
-        );
-      },
-      /**
-       * A very naive priority queue implementation.
-       */
-      PriorityQueue: {
-        make: function(o) {
-          var t = u.PriorityQueue, e = {}, r;
-          o = o || {};
-          for (r in t)
-            t.hasOwnProperty(r) && (e[r] = t[r]);
-          return e.queue = [], e.sorter = o.sorter || t.default_sorter, e;
-        },
-        default_sorter: function(o, t) {
-          return o.cost - t.cost;
-        },
-        /**
-         * Add a new item to the queue and ensure the highest priority element
-         * is at the front of the queue.
-         */
-        push: function(o, t) {
-          var e = { value: o, cost: t };
-          this.queue.push(e), this.queue.sort(this.sorter);
-        },
-        /**
-         * Return the highest priority element in the queue.
-         */
-        pop: function() {
-          return this.queue.shift();
-        },
-        empty: function() {
-          return this.queue.length === 0;
-        }
-      }
-    };
-    y.exports = u;
-  })(c), c.exports);
+import { __exports as e } from "./index156.js";
+var s;
+function R() {
+  if (s) return e;
+  s = 1;
+  const n = "[0-9]+", E = "[A-Z $%*+\\-./:]+";
+  let u = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
+  u = u.replace(/u/g, "\\u");
+  const i = "(?:(?![A-Z0-9 $%*+\\-./:]|" + u + `)(?:.|[\r
+]))+`;
+  e.KANJI = new RegExp(u, "g"), e.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), e.BYTE = new RegExp(i, "g"), e.NUMERIC = new RegExp(n, "g"), e.ALPHANUMERIC = new RegExp(E, "g");
+  const c = new RegExp("^" + u + "$"), g = new RegExp("^" + n + "$"), A = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+  return e.testKanji = function(t) {
+    return c.test(t);
+  }, e.testNumeric = function(t) {
+    return g.test(t);
+  }, e.testAlphanumeric = function(t) {
+    return A.test(t);
+  }, e;
 }
 export {
-  j as __require
+  R as __require
 };
 //# sourceMappingURL=index146.js.map

package/dist/index146.js.map

@@ -1 +1 @@
-{"version":3,"file":"index146.js","sources":["../../../node_modules/.pnpm/dijkstrajs@1.0.3/node_modules/dijkstrajs/dijkstra.js"],"sourcesContent":["'use strict';\n\n/******************************************************************************\n * Created 2008-08-19.\n *\n * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.\n *\n * Copyright (C) 2008\n *   Wyatt Baldwin <self@wyattbaldwin.com>\n *   All rights reserved\n *\n * Licensed under the MIT license.\n *\n *   http://www.opensource.org/licenses/mit-license.php\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *****************************************************************************/\nvar dijkstra = {\n  single_source_shortest_paths: function(graph, s, d) {\n    // Predecessor map for each node that has been encountered.\n    // node ID => predecessor node ID\n    var predecessors = {};\n\n    // Costs of shortest paths from s to all nodes encountered.\n    // node ID => cost\n    var costs = {};\n    costs[s] = 0;\n\n    // Costs of shortest paths from s to all nodes encountered; differs from\n    // `costs` in that it provides easy access to the node that currently has\n    // the known shortest path from s.\n    // XXX: Do we actually need both `costs` and `open`?\n    var open = dijkstra.PriorityQueue.make();\n    open.push(s, 0);\n\n    var closest,\n        u, v,\n        cost_of_s_to_u,\n        adjacent_nodes,\n        cost_of_e,\n        cost_of_s_to_u_plus_cost_of_e,\n        cost_of_s_to_v,\n        first_visit;\n    while (!open.empty()) {\n      // In the nodes remaining in graph that have a known cost from s,\n      // find the node, u, that currently has the shortest path from s.\n      closest = open.pop();\n      u = closest.value;\n      cost_of_s_to_u = closest.cost;\n\n      // Get nodes adjacent to u...\n      adjacent_nodes = graph[u] || {};\n\n      // ...and explore the edges that connect u to those nodes, updating\n      // the cost of the shortest paths to any or all of those nodes as\n      // necessary. v is the node across the current edge from u.\n      for (v in adjacent_nodes) {\n        if (adjacent_nodes.hasOwnProperty(v)) {\n          // Get the cost of the edge running from u to v.\n          cost_of_e = adjacent_nodes[v];\n\n          // Cost of s to u plus the cost of u to v across e--this is *a*\n          // cost from s to v that may or may not be less than the current\n          // known cost to v.\n          cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;\n\n          // If we haven't visited v yet OR if the current known cost from s to\n          // v is greater than the new cost we just found (cost of s to u plus\n          // cost of u to v across e), update v's cost in the cost list and\n          // update v's predecessor in the predecessor list (it's now u).\n          cost_of_s_to_v = costs[v];\n          first_visit = (typeof costs[v] === 'undefined');\n          if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {\n            costs[v] = cost_of_s_to_u_plus_cost_of_e;\n            open.push(v, cost_of_s_to_u_plus_cost_of_e);\n            predecessors[v] = u;\n          }\n        }\n      }\n    }\n\n    if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {\n      var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');\n      throw new Error(msg);\n    }\n\n    return predecessors;\n  },\n\n  extract_shortest_path_from_predecessor_list: function(predecessors, d) {\n    var nodes = [];\n    var u = d;\n    var predecessor;\n    while (u) {\n      nodes.push(u);\n      predecessor = predecessors[u];\n      u = predecessors[u];\n    }\n    nodes.reverse();\n    return nodes;\n  },\n\n  find_path: function(graph, s, d) {\n    var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);\n    return dijkstra.extract_shortest_path_from_predecessor_list(\n      predecessors, d);\n  },\n\n  /**\n   * A very naive priority queue implementation.\n   */\n  PriorityQueue: {\n    make: function (opts) {\n      var T = dijkstra.PriorityQueue,\n          t = {},\n          key;\n      opts = opts || {};\n      for (key in T) {\n        if (T.hasOwnProperty(key)) {\n          t[key] = T[key];\n        }\n      }\n      t.queue = [];\n      t.sorter = opts.sorter || T.default_sorter;\n      return t;\n    },\n\n    default_sorter: function (a, b) {\n      return a.cost - b.cost;\n    },\n\n    /**\n     * Add a new item to the queue and ensure the highest priority element\n     * is at the front of the queue.\n     */\n    push: function (value, cost) {\n      var item = {value: value, cost: cost};\n      this.queue.push(item);\n      this.queue.sort(this.sorter);\n    },\n\n    /**\n     * Return the highest priority element in the queue.\n     */\n    pop: function () {\n      return this.queue.shift();\n    },\n\n    empty: function () {\n      return this.queue.length === 0;\n    }\n  }\n};\n\n\n// node.js module exports\nif (typeof module !== 'undefined') {\n  module.exports = dijkstra;\n}\n"],"names":["dijkstra","graph","s","d","predecessors","costs","open","closest","u","v","cost_of_s_to_u","adjacent_nodes","cost_of_e","cost_of_s_to_u_plus_cost_of_e","cost_of_s_to_v","first_visit","msg","nodes","opts","T","t","key","a","b","value","cost","item","module"],"mappings":";;;;AAuBA,QAAIA,IAAW;AAAA,MACb,8BAA8B,SAASC,GAAOC,GAAGC,GAAG;AAGlD,YAAIC,IAAe,CAAA,GAIfC,IAAQ,CAAA;AACZ,QAAAA,EAAMH,CAAC,IAAI;AAMX,YAAII,IAAON,EAAS,cAAc,KAAI;AACtC,QAAAM,EAAK,KAAKJ,GAAG,CAAC;AAUd,iBARIK,GACAC,GAAGC,GACHC,GACAC,GACAC,GACAC,GACAC,GACAC,GACG,CAACT,EAAK,WAAS;AAGpB,UAAAC,IAAUD,EAAK,IAAG,GAClBE,IAAID,EAAQ,OACZG,IAAiBH,EAAQ,MAGzBI,IAAiBV,EAAMO,CAAC,KAAK,CAAA;AAK7B,eAAKC,KAAKE;AACR,YAAIA,EAAe,eAAeF,CAAC,MAEjCG,IAAYD,EAAeF,CAAC,GAK5BI,IAAgCH,IAAiBE,GAMjDE,IAAiBT,EAAMI,CAAC,GACxBM,IAAe,OAAOV,EAAMI,CAAC,IAAM,MAC/BM,KAAeD,IAAiBD,OAClCR,EAAMI,CAAC,IAAII,GACXP,EAAK,KAAKG,GAAGI,CAA6B,GAC1CT,EAAaK,CAAC,IAAID;AAAA,QAI9B;AAEI,YAAI,OAAOL,IAAM,OAAe,OAAOE,EAAMF,CAAC,IAAM,KAAa;AAC/D,cAAIa,IAAM,CAAC,+BAA+Bd,GAAG,QAAQC,GAAG,GAAG,EAAE,KAAK,EAAE;AACpE,gBAAM,IAAI,MAAMa,CAAG;AAAA,QACzB;AAEI,eAAOZ;AAAA,MACX;AAAA,MAEE,6CAA6C,SAASA,GAAcD,GAAG;AAIrE,iBAHIc,IAAQ,CAAA,GACRT,IAAIL,GAEDK;AACL,UAAAS,EAAM,KAAKT,CAAC,GACEJ,EAAaI,CAAC,GAC5BA,IAAIJ,EAAaI,CAAC;AAEpB,eAAAS,EAAM,QAAO,GACNA;AAAA,MACX;AAAA,MAEE,WAAW,SAAShB,GAAOC,GAAGC,GAAG;AAC/B,YAAIC,IAAeJ,EAAS,6BAA6BC,GAAOC,GAAGC,CAAC;AACpE,eAAOH,EAAS;AAAA,UACdI;AAAA,UAAcD;AAAA,QAAC;AAAA,MACrB;AAAA;AAAA;AAAA;AAAA,MAKE,eAAe;AAAA,QACb,MAAM,SAAUe,GAAM;AACpB,cAAIC,IAAInB,EAAS,eACboB,IAAI,CAAA,GACJC;AACJ,UAAAH,IAAOA,KAAQ,CAAA;AACf,eAAKG,KAAOF;AACV,YAAIA,EAAE,eAAeE,CAAG,MACtBD,EAAEC,CAAG,IAAIF,EAAEE,CAAG;AAGlB,iBAAAD,EAAE,QAAQ,CAAA,GACVA,EAAE,SAASF,EAAK,UAAUC,EAAE,gBACrBC;AAAA,QACb;AAAA,QAEI,gBAAgB,SAAUE,GAAGC,GAAG;AAC9B,iBAAOD,EAAE,OAAOC,EAAE;AAAA,QACxB;AAAA;AAAA;AAAA;AAAA;AAAA,QAMI,MAAM,SAAUC,GAAOC,GAAM;AAC3B,cAAIC,IAAO,EAAC,OAAOF,GAAO,MAAMC,EAAI;AACpC,eAAK,MAAM,KAAKC,CAAI,GACpB,KAAK,MAAM,KAAK,KAAK,MAAM;AAAA,QACjC;AAAA;AAAA;AAAA;AAAA,QAKI,KAAK,WAAY;AACf,iBAAO,KAAK,MAAM,MAAK;AAAA,QAC7B;AAAA,QAEI,OAAO,WAAY;AACjB,iBAAO,KAAK,MAAM,WAAW;AAAA,QACnC;AAAA,MACA;AAAA;AAME,IAAAC,YAAiB3B;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index146.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/regex.js"],"sourcesContent":["const numeric = '[0-9]+'\nconst alphanumeric = '[A-Z $%*+\\\\-./:]+'\nlet kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n  '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n  '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n  '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nconst byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ')(?:.|[\\r\\n]))+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nconst TEST_KANJI = new RegExp('^' + kanji + '$')\nconst TEST_NUMERIC = new RegExp('^' + numeric + '$')\nconst TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n  return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n  return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n  return TEST_ALPHANUMERIC.test(str)\n}\n"],"names":["numeric","alphanumeric","kanji","byte","regex","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","str"],"mappings":";;;;;AAAA,QAAMA,IAAU,UACVC,IAAe;AACrB,MAAIC,IAAQ;AAIZ,EAAAA,IAAQA,EAAM,QAAQ,MAAM,KAAK;AAEjC,QAAMC,IAAO,+BAA+BD,IAAQ;AAAA;AAEpD,EAAAE,EAAA,QAAgB,IAAI,OAAOF,GAAO,GAAG,GACrCE,EAAA,aAAqB,IAAI,OAAO,yBAAyB,GAAG,GAC5DA,EAAA,OAAe,IAAI,OAAOD,GAAM,GAAG,GACnCC,EAAA,UAAkB,IAAI,OAAOJ,GAAS,GAAG,GACzCI,EAAA,eAAuB,IAAI,OAAOH,GAAc,GAAG;AAEnD,QAAMI,IAAa,IAAI,OAAO,MAAMH,IAAQ,GAAG,GACzCI,IAAe,IAAI,OAAO,MAAMN,IAAU,GAAG,GAC7CO,IAAoB,IAAI,OAAO,wBAAwB;AAE7D,SAAAH,EAAA,YAAoB,SAAoBI,GAAK;AAC3C,WAAOH,EAAW,KAAKG,CAAG;AAAA,EAC5B,GAEAJ,EAAA,cAAsB,SAAsBI,GAAK;AAC/C,WAAOF,EAAa,KAAKE,CAAG;AAAA,EAC9B,GAEAJ,EAAA,mBAA2B,SAA2BI,GAAK;AACzD,WAAOD,EAAkB,KAAKC,CAAG;AAAA,EACnC;;","x_google_ignoreList":[0]}

package/dist/index147.js

@@ -1,5 +1,5 @@
-var o = {};
+var e = {};
 export {
-  o as __exports
+  e as __exports
 };
 //# sourceMappingURL=index147.js.map

package/dist/index148.js

@@ -1,25 +1,27 @@
-import { __exports as t } from "./index152.js";
-var u;
-function f() {
-  if (u) return t;
-  u = 1;
-  const i = new Uint8Array(512), n = new Uint8Array(256);
-  return (function() {
-    let r = 1;
-    for (let e = 0; e < 255; e++)
-      i[e] = r, n[r] = e, r <<= 1, r & 256 && (r ^= 285);
-    for (let e = 255; e < 512; e++)
-      i[e] = i[e - 255];
-  })(), t.log = function(r) {
-    if (r < 1) throw new Error("log(" + r + ")");
-    return n[r];
-  }, t.exp = function(r) {
-    return i[r];
-  }, t.mul = function(r, e) {
-    return r === 0 || e === 0 ? 0 : i[n[r] + n[e]];
-  }, t;
+import { __require as h } from "./index129.js";
+var u, s;
+function c() {
+  if (s) return u;
+  s = 1;
+  const g = h();
+  function t(i) {
+    this.mode = g.NUMERIC, this.data = i.toString();
+  }
+  return t.getBitsLength = function(e) {
+    return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
+  }, t.prototype.getLength = function() {
+    return this.data.length;
+  }, t.prototype.getBitsLength = function() {
+    return t.getBitsLength(this.data.length);
+  }, t.prototype.write = function(e) {
+    let r, n, a;
+    for (r = 0; r + 3 <= this.data.length; r += 3)
+      n = this.data.substr(r, 3), a = parseInt(n, 10), e.put(a, 10);
+    const o = this.data.length - r;
+    o > 0 && (n = this.data.substr(r), a = parseInt(n, 10), e.put(a, o * 3 + 1));
+  }, u = t, u;
 }
 export {
-  f as __require
+  c as __require
 };
 //# sourceMappingURL=index148.js.map

package/dist/index148.js.map

@@ -1 +1 @@
-{"version":3,"file":"index148.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/galois-field.js"],"sourcesContent":["const EXP_TABLE = new Uint8Array(512)\nconst LOG_TABLE = new Uint8Array(256)\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n  let x = 1\n  for (let i = 0; i < 255; i++) {\n    EXP_TABLE[i] = x\n    LOG_TABLE[x] = i\n\n    x <<= 1 // multiply by 2\n\n    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n    // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n      x ^= 0x11D\n    }\n  }\n\n  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n  // stay inside the bounds (because we will mainly use this table for the multiplication of\n  // two GF numbers, no more).\n  // @see {@link mul}\n  for (let i = 255; i < 512; i++) {\n    EXP_TABLE[i] = EXP_TABLE[i - 255]\n  }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n  if (n < 1) throw new Error('log(' + n + ')')\n  return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n  return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param  {Number} x\n * @param  {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n  if (x === 0 || y === 0) return 0\n\n  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n  // @see {@link initTables}\n  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n"],"names":["EXP_TABLE","LOG_TABLE","x","i","galoisField","n","y"],"mappings":";;;;;AAAA,QAAMA,IAAY,IAAI,WAAW,GAAG,GAC9BC,IAAY,IAAI,WAAW,GAAG;AASnC,UAAC,WAAuB;AACvB,QAAIC,IAAI;AACR,aAASC,IAAI,GAAGA,IAAI,KAAKA;AACvB,MAAAH,EAAUG,CAAC,IAAID,GACfD,EAAUC,CAAC,IAAIC,GAEfD,MAAM,GAIFA,IAAI,QACNA,KAAK;AAQT,aAASC,IAAI,KAAKA,IAAI,KAAKA;AACzB,MAAAH,EAAUG,CAAC,IAAIH,EAAUG,IAAI,GAAG;AAAA,EAEpC,GAAC,GAQDC,EAAA,MAAc,SAAcC,GAAG;AAC7B,QAAIA,IAAI,EAAG,OAAM,IAAI,MAAM,SAASA,IAAI,GAAG;AAC3C,WAAOJ,EAAUI,CAAC;AAAA,EACpB,GAQAD,EAAA,MAAc,SAAcC,GAAG;AAC7B,WAAOL,EAAUK,CAAC;AAAA,EACpB,GASAD,EAAA,MAAc,SAAcF,GAAGI,GAAG;AAChC,WAAIJ,MAAM,KAAKI,MAAM,IAAU,IAIxBN,EAAUC,EAAUC,CAAC,IAAID,EAAUK,CAAC,CAAC;AAAA,EAC9C;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index148.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"names":["Mode","require$$0","NumericData","data","length","bitBuffer","i","group","value","remainingNum","numericData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA;AAEb,WAASC,EAAaC,GAAM;AAC1B,SAAK,OAAOH,EAAK,SACjB,KAAK,OAAOG,EAAK,SAAQ;AAAA,EAC3B;AAEA,SAAAD,EAAY,gBAAgB,SAAwBE,GAAQ;AAC1D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,KAAMA,IAAS,IAAOA,IAAS,IAAK,IAAI,IAAK;AAAA,EAChF,GAEAF,EAAY,UAAU,YAAY,WAAsB;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAY,UAAU,gBAAgB,WAA0B;AAC9D,WAAOA,EAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD,GAEAA,EAAY,UAAU,QAAQ,SAAgBG,GAAW;AACvD,QAAIC,GAAGC,GAAOC;AAId,SAAKF,IAAI,GAAGA,IAAI,KAAK,KAAK,KAAK,QAAQA,KAAK;AAC1C,MAAAC,IAAQ,KAAK,KAAK,OAAOD,GAAG,CAAC,GAC7BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAO,EAAE;AAKzB,UAAMC,IAAe,KAAK,KAAK,SAASH;AACxC,IAAIG,IAAe,MACjBF,IAAQ,KAAK,KAAK,OAAOD,CAAC,GAC1BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAOC,IAAe,IAAI,CAAC;AAAA,EAE7C,GAEAC,IAAiBR;;","x_google_ignoreList":[0]}

package/dist/index149.js

@@ -1,5 +1,74 @@
-var e = {};
+import { __require as s } from "./index129.js";
+var r, o;
+function d() {
+  if (o) return r;
+  o = 1;
+  const u = s(), n = [
+    "0",
+    "1",
+    "2",
+    "3",
+    "4",
+    "5",
+    "6",
+    "7",
+    "8",
+    "9",
+    "A",
+    "B",
+    "C",
+    "D",
+    "E",
+    "F",
+    "G",
+    "H",
+    "I",
+    "J",
+    "K",
+    "L",
+    "M",
+    "N",
+    "O",
+    "P",
+    "Q",
+    "R",
+    "S",
+    "T",
+    "U",
+    "V",
+    "W",
+    "X",
+    "Y",
+    "Z",
+    " ",
+    "$",
+    "%",
+    "*",
+    "+",
+    "-",
+    ".",
+    "/",
+    ":"
+  ];
+  function t(i) {
+    this.mode = u.ALPHANUMERIC, this.data = i;
+  }
+  return t.getBitsLength = function(a) {
+    return 11 * Math.floor(a / 2) + 6 * (a % 2);
+  }, t.prototype.getLength = function() {
+    return this.data.length;
+  }, t.prototype.getBitsLength = function() {
+    return t.getBitsLength(this.data.length);
+  }, t.prototype.write = function(a) {
+    let e;
+    for (e = 0; e + 2 <= this.data.length; e += 2) {
+      let h = n.indexOf(this.data[e]) * 45;
+      h += n.indexOf(this.data[e + 1]), a.put(h, 11);
+    }
+    this.data.length % 2 && a.put(n.indexOf(this.data[e]), 6);
+  }, r = t, r;
+}
 export {
-  e as __exports
+  d as __require
 };
 //# sourceMappingURL=index149.js.map

package/dist/index149.js.map

@@ -1 +1 @@
-{"version":3,"file":"index149.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index149.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["Mode","require$$0","ALPHA_NUM_CHARS","AlphanumericData","data","length","bitBuffer","i","value","alphanumericData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA,GAWPC,IAAkB;AAAA,IACtB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC7C;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,EAC1C;AAEA,WAASC,EAAkBC,GAAM;AAC/B,SAAK,OAAOJ,EAAK,cACjB,KAAK,OAAOI;AAAA,EACd;AAEA,SAAAD,EAAiB,gBAAgB,SAAwBE,GAAQ;AAC/D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,IAAI,KAAKA,IAAS;AAAA,EACrD,GAEAF,EAAiB,UAAU,YAAY,WAAsB;AAC3D,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAiB,UAAU,gBAAgB,WAA0B;AACnE,WAAOA,EAAiB,cAAc,KAAK,KAAK,MAAM;AAAA,EACxD,GAEAA,EAAiB,UAAU,QAAQ,SAAgBG,GAAW;AAC5D,QAAIC;AAIJ,SAAKA,IAAI,GAAGA,IAAI,KAAK,KAAK,KAAK,QAAQA,KAAK,GAAG;AAE7C,UAAIC,IAAQN,EAAgB,QAAQ,KAAK,KAAKK,CAAC,CAAC,IAAI;AAGpD,MAAAC,KAASN,EAAgB,QAAQ,KAAK,KAAKK,IAAI,CAAC,CAAC,GAGjDD,EAAU,IAAIE,GAAO,EAAE;AAAA,IAC3B;AAIE,IAAI,KAAK,KAAK,SAAS,KACrBF,EAAU,IAAIJ,EAAgB,QAAQ,KAAK,KAAKK,CAAC,CAAC,GAAG,CAAC;AAAA,EAE1D,GAEAE,IAAiBN;;","x_google_ignoreList":[0]}

package/dist/index15.js

@@ -1,153 +1,161 @@
-import { jsx as w } from "react/jsx-runtime";
-import { useRef as C, useState as v, useEffect as M } from "react";
-import O from "./index103.js";
-function S(o) {
-  return typeof document > "u" ? "" : getComputedStyle(document.documentElement).getPropertyValue(o).trim();
-}
-function x(o) {
-  const e = o.match(/oklch\(\s*([\d.]+)%?\s+([\d.]+)\s+([\d.]+)/);
-  if (!e) return "";
-  const t = parseFloat(e[1]) / 100, r = parseFloat(e[2]), c = parseFloat(e[3]) * Math.PI / 180, l = r * Math.cos(c), u = r * Math.sin(c), n = t + 0.3963377774 * l + 0.2158037573 * u, f = t - 0.1055613458 * l - 0.0638541728 * u, i = t - 0.0894841775 * l - 1.291485548 * u, s = n * n * n, d = f * f * f, m = i * i * i;
-  let b = 4.0767416621 * s - 3.3077115913 * d + 0.2309699292 * m, y = -1.2684380046 * s + 2.6097574011 * d - 0.3413193965 * m, g = -0.0041960863 * s - 0.7034186147 * d + 1.707614701 * m;
-  const k = (p) => (p = Math.max(0, Math.min(1, p)), p <= 31308e-7 ? 12.92 * p : 1.055 * Math.pow(p, 1 / 2.4) - 0.055);
-  return b = Math.round(k(b) * 255), y = Math.round(k(y) * 255), g = Math.round(k(g) * 255), `#${b.toString(16).padStart(2, "0")}${y.toString(16).padStart(2, "0")}${g.toString(16).padStart(2, "0")}`;
-}
-function V() {
-  return typeof document > "u" ? [] : [
-    "--color-primary",
-    "--color-secondary",
-    "--color-accent",
-    "--color-info",
-    "--color-success",
-    "--color-warning",
-    "--color-error"
-  ].map((e) => {
-    const t = S(e);
-    return t.includes("oklch") ? x(t) : t;
-  }).filter(Boolean);
-}
-function I() {
-  const o = V(), e = S("--color-base-content"), t = e.includes("oklch") ? x(e) : e || "#888888", r = S("--color-base-300"), a = r.includes("oklch") ? x(r) : r || "#e0e0e0", c = t.match(/^#([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})$/i), l = c ? (parseInt(c[1], 16) + parseInt(c[2], 16) + parseInt(c[3], 16)) / 3 > 128 : !1;
-  return {
-    colors: o.length > 0 ? o : void 0,
-    theme: {
-      mode: l ? "dark" : "light"
-    },
-    chart: {
-      background: "transparent",
-      foreColor: t
-    },
-    grid: {
-      borderColor: a
-    },
-    xaxis: {
-      labels: {
-        style: {
-          colors: t
-        }
-      },
-      axisBorder: {
-        color: a
-      },
-      axisTicks: {
-        color: a
-      }
-    },
-    yaxis: {
-      labels: {
-        style: {
-          colors: t
-        }
-      }
-    },
-    legend: {
-      labels: {
-        colors: t
-      }
-    },
-    tooltip: {
-      theme: l ? "dark" : "light",
-      style: {
-        fontSize: "12px"
-      },
-      x: {
-        show: !0
-      },
-      marker: {
-        show: !0
-      }
-    },
-    dataLabels: {
-      style: {
-        colors: [t, t, t, t, t, t, t]
-      },
-      background: {
-        enabled: !1
-      },
-      dropShadow: {
-        enabled: !1
-      }
-    }
-  };
-}
-function h(o, e) {
-  const t = { ...o };
-  for (const r in e)
-    e[r] !== void 0 && (typeof e[r] == "object" && e[r] !== null && !Array.isArray(e[r]) && typeof o[r] == "object" && o[r] !== null && !Array.isArray(o[r]) ? t[r] = h(
-      o[r],
-      e[r]
-    ) : t[r] = e[r]);
-  return t;
-}
-const $ = ({
-  type: o,
-  series: e,
-  width: t = "100%",
-  height: r = 350,
-  options: a = {},
-  themed: c = !0,
-  className: l = ""
-}) => {
-  const u = C(null), n = C(null), [, f] = v(!1), i = () => {
-    const s = {
-      chart: {
-        type: o,
-        width: t,
-        height: r
-      },
-      series: e
+import { jsxs as m, jsx as n } from "react/jsx-runtime";
+import { useState as g, useRef as I, useId as j, useEffect as $, useCallback as E } from "react";
+function T({
+  options: c,
+  value: b,
+  onChange: k,
+  placeholder: M = "Please select",
+  disabled: i = !1,
+  allowClear: S = !0,
+  expandTrigger: D = "click",
+  displayRender: w,
+  size: C = "md",
+  className: B = "",
+  ...H
+}) {
+  const [r, d] = g(!1), [o, p] = g(b || []), [y, u] = g([]), x = I(null), W = j(), N = j();
+  $(() => {
+    b !== void 0 && p(b);
+  }, [b]), $(() => {
+    const e = (s) => {
+      x.current && !x.current.contains(s.target) && (d(!1), u([]));
     };
-    if (c) {
-      const d = I();
-      return h(h(s, d), a);
+    if (r)
+      return document.addEventListener("mousedown", e), () => document.removeEventListener("mousedown", e);
+  }, [r]);
+  const z = E((e, s) => {
+    if (e === 0) return c;
+    let t = c;
+    for (let l = 0; l < e; l++) {
+      const a = t.find((f) => f.value === s[l]);
+      if (!a?.children) return [];
+      t = a.children;
     }
-    return h(s, a);
+    return t;
+  }, [c]), O = E((e) => {
+    const s = [];
+    let t = c;
+    for (const l of e) {
+      const a = t.find((f) => f.value === l);
+      if (!a) break;
+      s.push(a), t = a.children || [];
+    }
+    return s;
+  }, [c]), h = r && y.length > 0 ? y : o, v = [];
+  v.push(c);
+  for (let e = 0; e < h.length; e++) {
+    const s = z(e + 1, h);
+    s.length > 0 && v.push(s);
+  }
+  const K = (e, s) => {
+    if (e.disabled) return;
+    const t = [...h.slice(0, s), e.value];
+    e.children && e.children.length > 0 ? u(t) : (p(t), d(!1), u([]), k?.(t, O(t)));
+  }, A = (e, s) => {
+    if (D !== "hover" || e.disabled) return;
+    const t = [...h.slice(0, s), e.value];
+    u(t);
+  }, R = (e) => {
+    e.stopPropagation(), p([]), k?.([], []);
+  }, V = (e) => {
+    if (!i)
+      switch (e.key) {
+        case "Enter":
+        case " ":
+          e.preventDefault(), d(!r);
+          break;
+        case "Escape":
+          e.preventDefault(), d(!1), u([]);
+          break;
+      }
+  }, L = O(o), P = L.map((e) => e.label), q = w ? w(P, L) : P.join(" / "), F = {
+    xs: "input-xs text-xs",
+    sm: "input-sm text-sm",
+    md: "input-md",
+    lg: "input-lg text-lg"
+  }, G = {
+    xs: "text-xs",
+    sm: "text-sm",
+    md: "text-base",
+    lg: "text-lg"
   };
-  return M(() => {
-    if (!u.current) return;
-    const s = i();
-    return n.current = new O(u.current, s), n.current.render(), f(!0), () => {
-      n.current && (n.current.destroy(), n.current = null);
-    };
-  }, []), M(() => {
-    if (!n.current) return;
-    const s = i();
-    n.current.updateOptions(s, !0, !0);
-  }, [o, e, t, r, a, c]), M(() => {
-    if (!c || typeof window > "u") return;
-    const s = new MutationObserver(() => {
-      if (n.current) {
-        const d = i();
-        n.current.updateOptions(d, !0, !0);
+  return /* @__PURE__ */ m("div", { ref: x, className: `relative inline-block w-full ${B}`, "data-state": r ? "open" : "closed", ...H, children: [
+    /* @__PURE__ */ m(
+      "div",
+      {
+        id: W,
+        role: "combobox",
+        "aria-expanded": r,
+        "aria-haspopup": "listbox",
+        "aria-controls": N,
+        tabIndex: i ? -1 : 0,
+        className: `input input-bordered w-full flex items-center justify-between cursor-pointer ${F[C]} ${i ? "input-disabled cursor-not-allowed" : ""} ${r ? "border-primary" : ""}`,
+        onClick: () => !i && d(!r),
+        onKeyDown: V,
+        children: [
+          /* @__PURE__ */ n("span", { className: o.length === 0 ? "text-base-content/50" : "", children: o.length > 0 ? q : M }),
+          /* @__PURE__ */ m("div", { className: "flex items-center gap-1", children: [
+            S && o.length > 0 && !i && /* @__PURE__ */ n(
+              "button",
+              {
+                type: "button",
+                className: "btn btn-ghost btn-xs btn-circle",
+                onClick: R,
+                "aria-label": "Clear selection",
+                children: /* @__PURE__ */ n("svg", { className: "w-3 h-3", fill: "none", viewBox: "0 0 24 24", stroke: "currentColor", children: /* @__PURE__ */ n("path", { strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 2, d: "M6 18L18 6M6 6l12 12" }) })
+              }
+            ),
+            /* @__PURE__ */ n(
+              "svg",
+              {
+                className: `w-4 h-4 transition-transform ${r ? "rotate-180" : ""}`,
+                fill: "none",
+                viewBox: "0 0 24 24",
+                stroke: "currentColor",
+                children: /* @__PURE__ */ n("path", { strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 2, d: "M19 9l-7 7-7-7" })
+              }
+            )
+          ] })
+        ]
       }
-    });
-    return s.observe(document.documentElement, {
-      attributes: !0,
-      attributeFilter: ["data-theme", "class"]
-    }), () => s.disconnect();
-  }, [c]), /* @__PURE__ */ w("div", { ref: u, className: l });
-};
+    ),
+    r && /* @__PURE__ */ n(
+      "div",
+      {
+        id: N,
+        className: `absolute z-50 mt-1 bg-base-100 border border-base-300 rounded-lg shadow-lg flex ${G[C]}`,
+        children: v.map((e, s) => /* @__PURE__ */ n(
+          "ul",
+          {
+            role: "listbox",
+            className: `min-w-[120px] max-h-[200px] overflow-y-auto py-1 ${s > 0 ? "border-l border-base-300" : ""}`,
+            children: e.map((t) => {
+              const l = o[s] === t.value, a = h[s] === t.value, f = t.children && t.children.length > 0;
+              return /* @__PURE__ */ m(
+                "li",
+                {
+                  role: "option",
+                  "aria-selected": l,
+                  "aria-disabled": t.disabled,
+                  className: `px-3 py-2 cursor-pointer flex items-center justify-between gap-2 ${t.disabled ? "text-base-content/30 cursor-not-allowed" : l ? "bg-primary text-primary-content" : a ? "bg-base-200" : "hover:bg-base-200"}`,
+                  onClick: () => K(t, s),
+                  onMouseEnter: () => A(t, s),
+                  children: [
+                    /* @__PURE__ */ n("span", { children: t.label }),
+                    f && /* @__PURE__ */ n("svg", { className: "w-4 h-4", fill: "none", viewBox: "0 0 24 24", stroke: "currentColor", children: /* @__PURE__ */ n("path", { strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 2, d: "M9 5l7 7-7 7" }) })
+                  ]
+                },
+                t.value
+              );
+            })
+          },
+          s
+        ))
+      }
+    )
+  ] });
+}
 export {
-  $ as Chart
+  T as Cascader
 };
 //# sourceMappingURL=index15.js.map