@ozdao/martyrs 0.2.585 → 0.2.587

package/dist/martyrs/src/modules/wallet/views/store/wallet.store.js

@@ -1,134 +0,0 @@
-import axios from "axios";
-import { BigNumber } from "../../../../../node_modules/.pnpm/bignumber.js@9.1.2/node_modules/bignumber.js/bignumber.js";
-import { reactive } from "vue";
-const API_CRYPTO_PATH = "/api/crypto";
-const WDT_SUPPLY = 2e7;
-const $axios = axios.create({ baseURL: process.env.API_URL, withCredentials: true });
-const state = reactive({
-  rewards: [],
-  tokenBalance: "0",
-  share: "0",
-  account: null,
-  web3: null,
-  depositInfo: null,
-  depositRequestIsActive: false,
-  websocket: null,
-  config: null,
-  chosenNetwork: null
-});
-const timer = reactive({ remaining: 0, interval: null });
-const actions = {
-  loadConfig: async () => {
-    await $axios.get(`${API_CRYPTO_PATH}/deposit/config`).then((r) => {
-      state.config = r.data;
-      state.chosenNetwork = {
-        name: `polygon-WDT`,
-        value: {
-          token: state.config.polygon.tokens.WDT,
-          network: "polygon"
-        }
-      };
-    }).catch((e) => console.error(e));
-  },
-  connectWebSocket: () => {
-    state.websocket = new WebSocket(process.env.WSS_URL);
-    state.websocket.onmessage = (event) => {
-      const message = JSON.parse(event.data);
-      if (message.id === state.depositInfo.id) {
-        const confirmations = state.depositInfo.confirmations;
-        state.depositInfo = message;
-        state.depositInfo.confirmations = confirmations;
-      }
-      if (message.hash === state.depositInfo.tx.hash) {
-        state.depositInfo.confirmations = message.confirmations;
-      }
-    };
-    state.websocket.onerror = (err) => console.error(err);
-  },
-  disconnectWebSocket: () => {
-    if (state.websocket) {
-      state.websocket.close();
-      state.websocket = null;
-    }
-  },
-  listRewards: async () => {
-    try {
-      const r = await $axios.get(`${API_CRYPTO_PATH}/rewards`);
-      state.rewards = r.data;
-      state.tokenBalance = r.data.reduce((acc, v) => acc.plus(v.amount), new BigNumber("0")).toString();
-      state.share = new BigNumber(state.tokenBalance).div(WDT_SUPPLY).multipliedBy(100).toFormat(6);
-    } catch (e) {
-      console.error(e);
-    }
-  },
-  collectRewards: async () => {
-    try {
-      await $axios.post(`${API_CRYPTO_PATH}/collect`, { recipient: state.account });
-      await actions.listRewards();
-    } catch (e) {
-      console.error(e);
-    }
-  },
-  disconnectWallet: async () => {
-    try {
-      await window.ethereum.request({
-        method: "wallet_revokePermissions",
-        params: [{ eth_accounts: {} }]
-      });
-      state.account = null;
-    } catch (e) {
-      console.error(e);
-    }
-  },
-  connectWallet: async () => {
-    try {
-      const accounts = await state.web3.eth.requestAccounts();
-      state.account = accounts[0];
-    } catch (e) {
-      console.error(e);
-    }
-  },
-  tryReconnectWallet: async () => {
-    try {
-      const a = await state.web3.eth.getAccounts();
-      if (a.length > 0) {
-        await actions.connectWallet();
-      }
-    } catch (e) {
-      console.error(e);
-    }
-  },
-  requestCryptoDeposit: async (amount) => {
-    state.depositRequestIsActive = true;
-    await $axios.post(`${API_CRYPTO_PATH}/deposit`, {
-      network: state.chosenNetwork.value.network,
-      amount: new BigNumber(amount).shiftedBy(8).toString(),
-      token: state.chosenNetwork.value.token
-    }).then((r) => {
-      state.depositInfo = r.data;
-      const createTimestamp = new Date(r.data.createdAt).getTime();
-      const dead = createTimestamp + state.config[state.chosenNetwork.value.network].waitingTime;
-      timer.remaining = Math.floor((dead - Date.now()) / 1e3);
-      timer.interval = setInterval(() => {
-        timer.remaining -= 1;
-        if (timer.remaining === 0) {
-          clearInterval(timer.interval);
-        }
-      }, 1e3);
-    }).catch((e) => console.error(e));
-    state.depositRequestIsActive = false;
-    actions.connectWebSocket();
-  },
-  stopTimer: () => {
-    clearInterval(timer.interval);
-  },
-  cancelDeposit: async () => {
-    await $axios.post(`${API_CRYPTO_PATH}/deposit/cancel`, { id: state.depositInfo.id }).then(() => actions.stopTimer()).then(() => actions.disconnectWebSocket()).catch((e) => console.error(e));
-  }
-};
-export {
-  actions,
-  state,
-  timer
-};
-//# sourceMappingURL=wallet.store.js.map

package/dist/martyrs/src/modules/wallet/views/store/wallet.store.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"wallet.store.js","sources":["../../../../../../../src/modules/wallet/views/store/wallet.store.js"],"sourcesContent":["import axios from 'axios';\nimport { BigNumber } from 'bignumber.js';\nimport { reactive } from 'vue';\n\nconst API_CRYPTO_PATH = '/api/crypto';\nconst WDT_SUPPLY = 20_000_000;\n\nconst $axios = axios.create({ baseURL: process.env.API_URL, withCredentials: true });\n\nconst state = reactive({\n  rewards: [],\n  tokenBalance: '0',\n  share: '0',\n  account: null,\n  web3: null,\n  depositInfo: null,\n  depositRequestIsActive: false,\n  websocket: null,\n  config: null,\n  chosenNetwork: null,\n});\n\nconst timer = reactive({ remaining: 0, interval: null });\n\nconst actions = {\n  loadConfig: async () => {\n    await $axios\n      .get(`${API_CRYPTO_PATH}/deposit/config`)\n      .then(r => {\n        state.config = r.data;\n        state.chosenNetwork = {\n          name: `polygon-WDT`,\n          value: {\n            token: state.config.polygon.tokens.WDT,\n            network: 'polygon',\n          },\n        };\n      })\n      .catch(e => console.error(e));\n  },\n\n  connectWebSocket: () => {\n    state.websocket = new WebSocket(process.env.WSS_URL);\n\n    state.websocket.onmessage = event => {\n      const message = JSON.parse(event.data);\n\n      if (message.id === state.depositInfo.id) {\n        const confirmations = state.depositInfo.confirmations;\n\n        state.depositInfo = message;\n        state.depositInfo.confirmations = confirmations;\n      }\n\n      if (message.hash === state.depositInfo.tx.hash) {\n        state.depositInfo.confirmations = message.confirmations;\n      }\n    };\n\n    state.websocket.onerror = err => console.error(err);\n  },\n\n  disconnectWebSocket: () => {\n    if (state.websocket) {\n      state.websocket.close();\n      state.websocket = null;\n    }\n  },\n\n  listRewards: async () => {\n    try {\n      const r = await $axios.get(`${API_CRYPTO_PATH}/rewards`);\n\n      state.rewards = r.data;\n      state.tokenBalance = r.data.reduce((acc, v) => acc.plus(v.amount), new BigNumber('0')).toString();\n\n      state.share = new BigNumber(state.tokenBalance).div(WDT_SUPPLY).multipliedBy(100).toFormat(6);\n    } catch (e) {\n      console.error(e);\n    }\n  },\n\n  collectRewards: async () => {\n    try {\n      await $axios.post(`${API_CRYPTO_PATH}/collect`, { recipient: state.account });\n      await actions.listRewards();\n    } catch (e) {\n      console.error(e);\n    }\n  },\n\n  disconnectWallet: async () => {\n    try {\n      await window.ethereum.request({\n        method: 'wallet_revokePermissions',\n        params: [{ eth_accounts: {} }],\n      });\n      state.account = null;\n    } catch (e) {\n      console.error(e);\n    }\n  },\n\n  connectWallet: async () => {\n    try {\n      const accounts = await state.web3.eth.requestAccounts();\n      state.account = accounts[0];\n    } catch (e) {\n      console.error(e);\n    }\n  },\n\n  tryReconnectWallet: async () => {\n    try {\n      const a = await state.web3.eth.getAccounts();\n      if (a.length > 0) {\n        await actions.connectWallet();\n      }\n    } catch (e) {\n      console.error(e);\n    }\n  },\n\n  requestCryptoDeposit: async amount => {\n    state.depositRequestIsActive = true;\n\n    await $axios\n      .post(`${API_CRYPTO_PATH}/deposit`, {\n        network: state.chosenNetwork.value.network,\n        amount: new BigNumber(amount).shiftedBy(8).toString(),\n        token: state.chosenNetwork.value.token,\n      })\n      .then(r => {\n        state.depositInfo = r.data;\n\n        const createTimestamp = new Date(r.data.createdAt).getTime();\n        const dead = createTimestamp + state.config[state.chosenNetwork.value.network].waitingTime;\n        timer.remaining = Math.floor((dead - Date.now()) / 1000);\n\n        timer.interval = setInterval(() => {\n          timer.remaining -= 1;\n\n          if (timer.remaining === 0) {\n            clearInterval(timer.interval);\n          }\n        }, 1000);\n      })\n      .catch(e => console.error(e));\n\n    state.depositRequestIsActive = false;\n\n    actions.connectWebSocket();\n  },\n\n  stopTimer: () => {\n    clearInterval(timer.interval);\n  },\n\n  cancelDeposit: async () => {\n    await $axios\n      .post(`${API_CRYPTO_PATH}/deposit/cancel`, { id: state.depositInfo.id })\n      .then(() => actions.stopTimer())\n      .then(() => actions.disconnectWebSocket())\n      .catch(e => console.error(e));\n  },\n};\n\nexport { actions, state, timer };\n"],"names":[],"mappings":";;;AAIA,MAAM,kBAAkB;AACxB,MAAM,aAAa;AAEnB,MAAM,SAAS,MAAM,OAAO,EAAE,SAAS,QAAQ,IAAI,SAAS,iBAAiB,MAAM;AAE9E,MAAC,QAAQ,SAAS;AAAA,EACrB,SAAS,CAAA;AAAA,EACT,cAAc;AAAA,EACd,OAAO;AAAA,EACP,SAAS;AAAA,EACT,MAAM;AAAA,EACN,aAAa;AAAA,EACb,wBAAwB;AAAA,EACxB,WAAW;AAAA,EACX,QAAQ;AAAA,EACR,eAAe;AACjB,CAAC;AAEI,MAAC,QAAQ,SAAS,EAAE,WAAW,GAAG,UAAU,KAAI,CAAE;AAElD,MAAC,UAAU;AAAA,EACd,YAAY,YAAY;AACtB,UAAM,OACH,IAAI,GAAG,eAAe,iBAAiB,EACvC,KAAK,OAAK;AACT,YAAM,SAAS,EAAE;AACjB,YAAM,gBAAgB;AAAA,QACpB,MAAM;AAAA,QACN,OAAO;AAAA,UACL,OAAO,MAAM,OAAO,QAAQ,OAAO;AAAA,UACnC,SAAS;AAAA,QACrB;AAAA,MACA;AAAA,IACM,CAAC,EACA,MAAM,OAAK,QAAQ,MAAM,CAAC,CAAC;AAAA,EAChC;AAAA,EAEA,kBAAkB,MAAM;AACtB,UAAM,YAAY,IAAI,UAAU,QAAQ,IAAI,OAAO;AAEnD,UAAM,UAAU,YAAY,WAAS;AACnC,YAAM,UAAU,KAAK,MAAM,MAAM,IAAI;AAErC,UAAI,QAAQ,OAAO,MAAM,YAAY,IAAI;AACvC,cAAM,gBAAgB,MAAM,YAAY;AAExC,cAAM,cAAc;AACpB,cAAM,YAAY,gBAAgB;AAAA,MACpC;AAEA,UAAI,QAAQ,SAAS,MAAM,YAAY,GAAG,MAAM;AAC9C,cAAM,YAAY,gBAAgB,QAAQ;AAAA,MAC5C;AAAA,IACF;AAEA,UAAM,UAAU,UAAU,SAAO,QAAQ,MAAM,GAAG;AAAA,EACpD;AAAA,EAEA,qBAAqB,MAAM;AACzB,QAAI,MAAM,WAAW;AACnB,YAAM,UAAU,MAAK;AACrB,YAAM,YAAY;AAAA,IACpB;AAAA,EACF;AAAA,EAEA,aAAa,YAAY;AACvB,QAAI;AACF,YAAM,IAAI,MAAM,OAAO,IAAI,GAAG,eAAe,UAAU;AAEvD,YAAM,UAAU,EAAE;AAClB,YAAM,eAAe,EAAE,KAAK,OAAO,CAAC,KAAK,MAAM,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,UAAU,GAAG,CAAC,EAAE,SAAQ;AAE/F,YAAM,QAAQ,IAAI,UAAU,MAAM,YAAY,EAAE,IAAI,UAAU,EAAE,aAAa,GAAG,EAAE,SAAS,CAAC;AAAA,IAC9F,SAAS,GAAG;AACV,cAAQ,MAAM,CAAC;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,gBAAgB,YAAY;AAC1B,QAAI;AACF,YAAM,OAAO,KAAK,GAAG,eAAe,YAAY,EAAE,WAAW,MAAM,SAAS;AAC5E,YAAM,QAAQ,YAAW;AAAA,IAC3B,SAAS,GAAG;AACV,cAAQ,MAAM,CAAC;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,kBAAkB,YAAY;AAC5B,QAAI;AACF,YAAM,OAAO,SAAS,QAAQ;AAAA,QAC5B,QAAQ;AAAA,QACR,QAAQ,CAAC,EAAE,cAAc,CAAA,GAAI;AAAA,MACrC,CAAO;AACD,YAAM,UAAU;AAAA,IAClB,SAAS,GAAG;AACV,cAAQ,MAAM,CAAC;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,eAAe,YAAY;AACzB,QAAI;AACF,YAAM,WAAW,MAAM,MAAM,KAAK,IAAI,gBAAe;AACrD,YAAM,UAAU,SAAS,CAAC;AAAA,IAC5B,SAAS,GAAG;AACV,cAAQ,MAAM,CAAC;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,oBAAoB,YAAY;AAC9B,QAAI;AACF,YAAM,IAAI,MAAM,MAAM,KAAK,IAAI,YAAW;AAC1C,UAAI,EAAE,SAAS,GAAG;AAChB,cAAM,QAAQ,cAAa;AAAA,MAC7B;AAAA,IACF,SAAS,GAAG;AACV,cAAQ,MAAM,CAAC;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,sBAAsB,OAAM,WAAU;AACpC,UAAM,yBAAyB;AAE/B,UAAM,OACH,KAAK,GAAG,eAAe,YAAY;AAAA,MAClC,SAAS,MAAM,cAAc,MAAM;AAAA,MACnC,QAAQ,IAAI,UAAU,MAAM,EAAE,UAAU,CAAC,EAAE,SAAQ;AAAA,MACnD,OAAO,MAAM,cAAc,MAAM;AAAA,IACzC,CAAO,EACA,KAAK,OAAK;AACT,YAAM,cAAc,EAAE;AAEtB,YAAM,kBAAkB,IAAI,KAAK,EAAE,KAAK,SAAS,EAAE,QAAO;AAC1D,YAAM,OAAO,kBAAkB,MAAM,OAAO,MAAM,cAAc,MAAM,OAAO,EAAE;AAC/E,YAAM,YAAY,KAAK,OAAO,OAAO,KAAK,IAAG,KAAM,GAAI;AAEvD,YAAM,WAAW,YAAY,MAAM;AACjC,cAAM,aAAa;AAEnB,YAAI,MAAM,cAAc,GAAG;AACzB,wBAAc,MAAM,QAAQ;AAAA,QAC9B;AAAA,MACF,GAAG,GAAI;AAAA,IACT,CAAC,EACA,MAAM,OAAK,QAAQ,MAAM,CAAC,CAAC;AAE9B,UAAM,yBAAyB;AAE/B,YAAQ,iBAAgB;AAAA,EAC1B;AAAA,EAEA,WAAW,MAAM;AACf,kBAAc,MAAM,QAAQ;AAAA,EAC9B;AAAA,EAEA,eAAe,YAAY;AACzB,UAAM,OACH,KAAK,GAAG,eAAe,mBAAmB,EAAE,IAAI,MAAM,YAAY,GAAE,CAAE,EACtE,KAAK,MAAM,QAAQ,UAAS,CAAE,EAC9B,KAAK,MAAM,QAAQ,oBAAmB,CAAE,EACxC,MAAM,OAAK,QAAQ,MAAM,CAAC,CAAC;AAAA,EAChC;AACF;"}

package/dist/node_modules/.pnpm/dijkstrajs@1.0.3/node_modules/dijkstrajs/dijkstra.js

@@ -1,106 +0,0 @@
-import { __module as dijkstra } from "../../../../../_virtual/dijkstra.js";
-var hasRequiredDijkstra;
-function requireDijkstra() {
-  if (hasRequiredDijkstra) return dijkstra.exports;
-  hasRequiredDijkstra = 1;
-  (function(module) {
-    var dijkstra2 = {
-      single_source_shortest_paths: function(graph, s, d) {
-        var predecessors = {};
-        var costs = {};
-        costs[s] = 0;
-        var open = dijkstra2.PriorityQueue.make();
-        open.push(s, 0);
-        var 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;
-        while (!open.empty()) {
-          closest = open.pop();
-          u = closest.value;
-          cost_of_s_to_u = closest.cost;
-          adjacent_nodes = graph[u] || {};
-          for (v in adjacent_nodes) {
-            if (adjacent_nodes.hasOwnProperty(v)) {
-              cost_of_e = adjacent_nodes[v];
-              cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;
-              cost_of_s_to_v = costs[v];
-              first_visit = typeof costs[v] === "undefined";
-              if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {
-                costs[v] = cost_of_s_to_u_plus_cost_of_e;
-                open.push(v, cost_of_s_to_u_plus_cost_of_e);
-                predecessors[v] = u;
-              }
-            }
-          }
-        }
-        if (typeof d !== "undefined" && typeof costs[d] === "undefined") {
-          var msg = ["Could not find a path from ", s, " to ", d, "."].join("");
-          throw new Error(msg);
-        }
-        return predecessors;
-      },
-      extract_shortest_path_from_predecessor_list: function(predecessors, d) {
-        var nodes = [];
-        var u = d;
-        while (u) {
-          nodes.push(u);
-          predecessors[u];
-          u = predecessors[u];
-        }
-        nodes.reverse();
-        return nodes;
-      },
-      find_path: function(graph, s, d) {
-        var predecessors = dijkstra2.single_source_shortest_paths(graph, s, d);
-        return dijkstra2.extract_shortest_path_from_predecessor_list(
-          predecessors,
-          d
-        );
-      },
-      /**
-       * A very naive priority queue implementation.
-       */
-      PriorityQueue: {
-        make: function(opts) {
-          var T = dijkstra2.PriorityQueue, t = {}, key;
-          opts = opts || {};
-          for (key in T) {
-            if (T.hasOwnProperty(key)) {
-              t[key] = T[key];
-            }
-          }
-          t.queue = [];
-          t.sorter = opts.sorter || T.default_sorter;
-          return t;
-        },
-        default_sorter: function(a, b) {
-          return a.cost - b.cost;
-        },
-        /**
-         * Add a new item to the queue and ensure the highest priority element
-         * is at the front of the queue.
-         */
-        push: function(value, cost) {
-          var item = { value, cost };
-          this.queue.push(item);
-          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;
-        }
-      }
-    };
-    {
-      module.exports = dijkstra2;
-    }
-  })(dijkstra);
-  return dijkstra.exports;
-}
-export {
-  requireDijkstra as __require
-};
-//# sourceMappingURL=dijkstra.js.map

package/dist/node_modules/.pnpm/dijkstrajs@1.0.3/node_modules/dijkstrajs/dijkstra.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dijkstra.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"],"mappings":";;;;;;AAuBA,QAAIA,YAAW;AAAA,MACb,8BAA8B,SAAS,OAAO,GAAG,GAAG;AAGlD,YAAI,eAAe,CAAA;AAInB,YAAI,QAAQ,CAAA;AACZ,cAAM,CAAC,IAAI;AAMX,YAAI,OAAOA,UAAS,cAAc,KAAI;AACtC,aAAK,KAAK,GAAG,CAAC;AAEd,YAAI,SACA,GAAG,GACH,gBACA,gBACA,WACA,+BACA,gBACA;AACJ,eAAO,CAAC,KAAK,SAAS;AAGpB,oBAAU,KAAK,IAAG;AAClB,cAAI,QAAQ;AACZ,2BAAiB,QAAQ;AAGzB,2BAAiB,MAAM,CAAC,KAAK,CAAA;AAK7B,eAAK,KAAK,gBAAgB;AACxB,gBAAI,eAAe,eAAe,CAAC,GAAG;AAEpC,0BAAY,eAAe,CAAC;AAK5B,8CAAgC,iBAAiB;AAMjD,+BAAiB,MAAM,CAAC;AACxB,4BAAe,OAAO,MAAM,CAAC,MAAM;AACnC,kBAAI,eAAe,iBAAiB,+BAA+B;AACjE,sBAAM,CAAC,IAAI;AACX,qBAAK,KAAK,GAAG,6BAA6B;AAC1C,6BAAa,CAAC,IAAI;AAAA,cAC9B;AAAA,YACA;AAAA,UACA;AAAA,QACA;AAEI,YAAI,OAAO,MAAM,eAAe,OAAO,MAAM,CAAC,MAAM,aAAa;AAC/D,cAAI,MAAM,CAAC,+BAA+B,GAAG,QAAQ,GAAG,GAAG,EAAE,KAAK,EAAE;AACpE,gBAAM,IAAI,MAAM,GAAG;AAAA,QACzB;AAEI,eAAO;AAAA,MACX;AAAA,MAEE,6CAA6C,SAAS,cAAc,GAAG;AACrE,YAAI,QAAQ,CAAA;AACZ,YAAI,IAAI;AAER,eAAO,GAAG;AACR,gBAAM,KAAK,CAAC;AACE,uBAAa,CAAC;AAC5B,cAAI,aAAa,CAAC;AAAA,QACxB;AACI,cAAM,QAAO;AACb,eAAO;AAAA,MACX;AAAA,MAEE,WAAW,SAAS,OAAO,GAAG,GAAG;AAC/B,YAAI,eAAeA,UAAS,6BAA6B,OAAO,GAAG,CAAC;AACpE,eAAOA,UAAS;AAAA,UACd;AAAA,UAAc;AAAA,QAAC;AAAA,MACrB;AAAA;AAAA;AAAA;AAAA,MAKE,eAAe;AAAA,QACb,MAAM,SAAU,MAAM;AACpB,cAAI,IAAIA,UAAS,eACb,IAAI,CAAA,GACJ;AACJ,iBAAO,QAAQ,CAAA;AACf,eAAK,OAAO,GAAG;AACb,gBAAI,EAAE,eAAe,GAAG,GAAG;AACzB,gBAAE,GAAG,IAAI,EAAE,GAAG;AAAA,YACxB;AAAA,UACA;AACM,YAAE,QAAQ,CAAA;AACV,YAAE,SAAS,KAAK,UAAU,EAAE;AAC5B,iBAAO;AAAA,QACb;AAAA,QAEI,gBAAgB,SAAU,GAAG,GAAG;AAC9B,iBAAO,EAAE,OAAO,EAAE;AAAA,QACxB;AAAA;AAAA;AAAA;AAAA;AAAA,QAMI,MAAM,SAAU,OAAO,MAAM;AAC3B,cAAI,OAAO,EAAC,OAAc,KAAU;AACpC,eAAK,MAAM,KAAK,IAAI;AACpB,eAAK,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;AAKmC;AACjC,uBAAiBA;AAAA,IACnB;AAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/browser.js

@@ -1,79 +0,0 @@
-import { __exports as browser } from "../../../../../../_virtual/browser2.js";
-import { __require as requireCanPromise } from "./can-promise.js";
-import { __require as requireQrcode } from "./core/qrcode.js";
-import { __require as requireCanvas } from "./renderer/canvas.js";
-import { __require as requireSvgTag } from "./renderer/svg-tag.js";
-var hasRequiredBrowser;
-function requireBrowser() {
-  if (hasRequiredBrowser) return browser;
-  hasRequiredBrowser = 1;
-  const canPromise = requireCanPromise();
-  const QRCode = requireQrcode();
-  const CanvasRenderer = requireCanvas();
-  const SvgRenderer = requireSvgTag();
-  function renderCanvas(renderFunc, canvas, text, opts, cb) {
-    const args = [].slice.call(arguments, 1);
-    const argsNum = args.length;
-    const isLastArgCb = typeof args[argsNum - 1] === "function";
-    if (!isLastArgCb && !canPromise()) {
-      throw new Error("Callback required as last argument");
-    }
-    if (isLastArgCb) {
-      if (argsNum < 2) {
-        throw new Error("Too few arguments provided");
-      }
-      if (argsNum === 2) {
-        cb = text;
-        text = canvas;
-        canvas = opts = void 0;
-      } else if (argsNum === 3) {
-        if (canvas.getContext && typeof cb === "undefined") {
-          cb = opts;
-          opts = void 0;
-        } else {
-          cb = opts;
-          opts = text;
-          text = canvas;
-          canvas = void 0;
-        }
-      }
-    } else {
-      if (argsNum < 1) {
-        throw new Error("Too few arguments provided");
-      }
-      if (argsNum === 1) {
-        text = canvas;
-        canvas = opts = void 0;
-      } else if (argsNum === 2 && !canvas.getContext) {
-        opts = text;
-        text = canvas;
-        canvas = void 0;
-      }
-      return new Promise(function(resolve, reject) {
-        try {
-          const data = QRCode.create(text, opts);
-          resolve(renderFunc(data, canvas, opts));
-        } catch (e) {
-          reject(e);
-        }
-      });
-    }
-    try {
-      const data = QRCode.create(text, opts);
-      cb(null, renderFunc(data, canvas, opts));
-    } catch (e) {
-      cb(e);
-    }
-  }
-  browser.create = QRCode.create;
-  browser.toCanvas = renderCanvas.bind(null, CanvasRenderer.render);
-  browser.toDataURL = renderCanvas.bind(null, CanvasRenderer.renderToDataURL);
-  browser.toString = renderCanvas.bind(null, function(data, _, opts) {
-    return SvgRenderer.render(data, opts);
-  });
-  return browser;
-}
-export {
-  requireBrowser as __require
-};
-//# sourceMappingURL=browser.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/browser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"browser.js","sources":["../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/browser.js"],"sourcesContent":["\nconst canPromise = require('./can-promise')\n\nconst QRCode = require('./core/qrcode')\nconst CanvasRenderer = require('./renderer/canvas')\nconst SvgRenderer = require('./renderer/svg-tag.js')\n\nfunction renderCanvas (renderFunc, canvas, text, opts, cb) {\n  const args = [].slice.call(arguments, 1)\n  const argsNum = args.length\n  const isLastArgCb = typeof args[argsNum - 1] === 'function'\n\n  if (!isLastArgCb && !canPromise()) {\n    throw new Error('Callback required as last argument')\n  }\n\n  if (isLastArgCb) {\n    if (argsNum < 2) {\n      throw new Error('Too few arguments provided')\n    }\n\n    if (argsNum === 2) {\n      cb = text\n      text = canvas\n      canvas = opts = undefined\n    } else if (argsNum === 3) {\n      if (canvas.getContext && typeof cb === 'undefined') {\n        cb = opts\n        opts = undefined\n      } else {\n        cb = opts\n        opts = text\n        text = canvas\n        canvas = undefined\n      }\n    }\n  } else {\n    if (argsNum < 1) {\n      throw new Error('Too few arguments provided')\n    }\n\n    if (argsNum === 1) {\n      text = canvas\n      canvas = opts = undefined\n    } else if (argsNum === 2 && !canvas.getContext) {\n      opts = text\n      text = canvas\n      canvas = undefined\n    }\n\n    return new Promise(function (resolve, reject) {\n      try {\n        const data = QRCode.create(text, opts)\n        resolve(renderFunc(data, canvas, opts))\n      } catch (e) {\n        reject(e)\n      }\n    })\n  }\n\n  try {\n    const data = QRCode.create(text, opts)\n    cb(null, renderFunc(data, canvas, opts))\n  } catch (e) {\n    cb(e)\n  }\n}\n\nexports.create = QRCode.create\nexports.toCanvas = renderCanvas.bind(null, CanvasRenderer.render)\nexports.toDataURL = renderCanvas.bind(null, CanvasRenderer.renderToDataURL)\n\n// only svg for now.\nexports.toString = renderCanvas.bind(null, function (data, _, opts) {\n  return SvgRenderer.render(data, opts)\n})\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;;;;;;AACA,QAAM,aAAaA,kBAAA;AAEnB,QAAM,SAASC,cAAA;AACf,QAAM,iBAAiBC,cAAA;AACvB,QAAM,cAAcC,cAAA;AAEpB,WAAS,aAAc,YAAY,QAAQ,MAAM,MAAM,IAAI;AACzD,UAAM,OAAO,CAAA,EAAG,MAAM,KAAK,WAAW,CAAC;AACvC,UAAM,UAAU,KAAK;AACrB,UAAM,cAAc,OAAO,KAAK,UAAU,CAAC,MAAM;AAEjD,QAAI,CAAC,eAAe,CAAC,cAAc;AACjC,YAAM,IAAI,MAAM,oCAAoC;AAAA,IACxD;AAEE,QAAI,aAAa;AACf,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,MAAM,4BAA4B;AAAA,MAClD;AAEI,UAAI,YAAY,GAAG;AACjB,aAAK;AACL,eAAO;AACP,iBAAS,OAAO;AAAA,MACtB,WAAe,YAAY,GAAG;AACxB,YAAI,OAAO,cAAc,OAAO,OAAO,aAAa;AAClD,eAAK;AACL,iBAAO;AAAA,QACf,OAAa;AACL,eAAK;AACL,iBAAO;AACP,iBAAO;AACP,mBAAS;AAAA,QACjB;AAAA,MACA;AAAA,IACA,OAAS;AACL,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,MAAM,4BAA4B;AAAA,MAClD;AAEI,UAAI,YAAY,GAAG;AACjB,eAAO;AACP,iBAAS,OAAO;AAAA,MACtB,WAAe,YAAY,KAAK,CAAC,OAAO,YAAY;AAC9C,eAAO;AACP,eAAO;AACP,iBAAS;AAAA,MACf;AAEI,aAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAC5C,YAAI;AACF,gBAAM,OAAO,OAAO,OAAO,MAAM,IAAI;AACrC,kBAAQ,WAAW,MAAM,QAAQ,IAAI,CAAC;AAAA,QAC9C,SAAe,GAAG;AACV,iBAAO,CAAC;AAAA,QAChB;AAAA,MACA,CAAK;AAAA,IACL;AAEE,QAAI;AACF,YAAM,OAAO,OAAO,OAAO,MAAM,IAAI;AACrC,SAAG,MAAM,WAAW,MAAM,QAAQ,IAAI,CAAC;AAAA,IAC3C,SAAW,GAAG;AACV,SAAG,CAAC;AAAA,IACR;AAAA,EACA;AAEA,UAAA,SAAiB,OAAO;AACxB,UAAA,WAAmB,aAAa,KAAK,MAAM,eAAe,MAAM;AAChE,UAAA,YAAoB,aAAa,KAAK,MAAM,eAAe,eAAe;AAG1E,UAAA,WAAmB,aAAa,KAAK,MAAM,SAAU,MAAM,GAAG,MAAM;AAClE,WAAO,YAAY,OAAO,MAAM,IAAI;AAAA,EACtC,CAAC;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js

@@ -1,14 +0,0 @@
-var canPromise;
-var hasRequiredCanPromise;
-function requireCanPromise() {
-  if (hasRequiredCanPromise) return canPromise;
-  hasRequiredCanPromise = 1;
-  canPromise = function() {
-    return typeof Promise === "function" && Promise.prototype && Promise.prototype.then;
-  };
-  return canPromise;
-}
-export {
-  requireCanPromise as __require
-};
-//# sourceMappingURL=can-promise.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"can-promise.js","sources":["../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js"],"sourcesContent":["// can-promise has a crash in some versions of react native that dont have\n// standard global objects\n// https://github.com/soldair/node-qrcode/issues/157\n\nmodule.exports = function () {\n  return typeof Promise === 'function' && Promise.prototype && Promise.prototype.then\n}\n"],"names":[],"mappings":";;;;;AAIA,eAAiB,WAAY;AAC3B,WAAO,OAAO,YAAY,cAAc,QAAQ,aAAa,QAAQ,UAAU;AAAA,EACjF;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alignment-pattern.js

@@ -1,43 +0,0 @@
-import { __exports as alignmentPattern } from "../../../../../../../_virtual/alignment-pattern.js";
-import { __require as requireUtils } from "./utils.js";
-var hasRequiredAlignmentPattern;
-function requireAlignmentPattern() {
-  if (hasRequiredAlignmentPattern) return alignmentPattern;
-  hasRequiredAlignmentPattern = 1;
-  (function(exports) {
-    const getSymbolSize = requireUtils().getSymbolSize;
-    exports.getRowColCoords = function getRowColCoords(version) {
-      if (version === 1) return [];
-      const posCount = Math.floor(version / 7) + 2;
-      const size = getSymbolSize(version);
-      const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2;
-      const positions = [size - 7];
-      for (let i = 1; i < posCount - 1; i++) {
-        positions[i] = positions[i - 1] - intervals;
-      }
-      positions.push(6);
-      return positions.reverse();
-    };
-    exports.getPositions = function getPositions(version) {
-      const coords = [];
-      const pos = exports.getRowColCoords(version);
-      const posLength = pos.length;
-      for (let i = 0; i < posLength; i++) {
-        for (let j = 0; j < posLength; j++) {
-          if (i === 0 && j === 0 || // top-left
-          i === 0 && j === posLength - 1 || // bottom-left
-          i === posLength - 1 && j === 0) {
-            continue;
-          }
-          coords.push([pos[i], pos[j]]);
-        }
-      }
-      return coords;
-    };
-  })(alignmentPattern);
-  return alignmentPattern;
-}
-export {
-  requireAlignmentPattern as __require
-};
-//# sourceMappingURL=alignment-pattern.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alignment-pattern.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"alignment-pattern.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alignment-pattern.js"],"sourcesContent":["/**\n * Alignment pattern are fixed reference pattern in defined positions\n * in a matrix symbology, which enables the decode software to re-synchronise\n * the coordinate mapping of the image modules in the event of moderate amounts\n * of distortion of the image.\n *\n * Alignment patterns are present only in QR Code symbols of version 2 or larger\n * and their number depends on the symbol version.\n */\n\nconst getSymbolSize = require('./utils').getSymbolSize\n\n/**\n * Calculate the row/column coordinates of the center module of each alignment pattern\n * for the specified QR Code version.\n *\n * The alignment patterns are positioned symmetrically on either side of the diagonal\n * running from the top left corner of the symbol to the bottom right corner.\n *\n * Since positions are simmetrical only half of the coordinates are returned.\n * Each item of the array will represent in turn the x and y coordinate.\n * @see {@link getPositions}\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinate\n */\nexports.getRowColCoords = function getRowColCoords (version) {\n  if (version === 1) return []\n\n  const posCount = Math.floor(version / 7) + 2\n  const size = getSymbolSize(version)\n  const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2\n  const positions = [size - 7] // Last coord is always (size - 7)\n\n  for (let i = 1; i < posCount - 1; i++) {\n    positions[i] = positions[i - 1] - intervals\n  }\n\n  positions.push(6) // First coord is always 6\n\n  return positions.reverse()\n}\n\n/**\n * Returns an array containing the positions of each alignment pattern.\n * Each array's element represent the center point of the pattern as (x, y) coordinates\n *\n * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}\n * and filtering out the items that overlaps with finder pattern\n *\n * @example\n * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.\n * The alignment patterns, therefore, are to be centered on (row, column)\n * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).\n * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns\n * and are not therefore used for alignment patterns.\n *\n * let pos = getPositions(7)\n * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const coords = []\n  const pos = exports.getRowColCoords(version)\n  const posLength = pos.length\n\n  for (let i = 0; i < posLength; i++) {\n    for (let j = 0; j < posLength; j++) {\n      // Skip if position is occupied by finder patterns\n      if ((i === 0 && j === 0) || // top-left\n          (i === 0 && j === posLength - 1) || // bottom-left\n          (i === posLength - 1 && j === 0)) { // top-right\n        continue\n      }\n\n      coords.push([pos[i], pos[j]])\n    }\n  }\n\n  return coords\n}\n"],"names":["require$$0"],"mappings":";;;;;;;AAUA,UAAM,gBAAgBA,eAAmB;AAgBzC,YAAA,kBAA0B,SAAS,gBAAiB,SAAS;AAC3D,UAAI,YAAY,EAAG,QAAO,CAAA;AAE1B,YAAM,WAAW,KAAK,MAAM,UAAU,CAAC,IAAI;AAC3C,YAAM,OAAO,cAAc,OAAO;AAClC,YAAM,YAAY,SAAS,MAAM,KAAK,KAAK,MAAM,OAAO,OAAO,IAAI,WAAW,EAAE,IAAI;AACpF,YAAM,YAAY,CAAC,OAAO,CAAC;AAE3B,eAAS,IAAI,GAAG,IAAI,WAAW,GAAG,KAAK;AACrC,kBAAU,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI;AAAA,MACtC;AAEE,gBAAU,KAAK,CAAC;AAEhB,aAAO,UAAU,QAAO;AAAA,IAC1B;AAsBA,YAAA,eAAuB,SAAS,aAAc,SAAS;AACrD,YAAM,SAAS,CAAA;AACf,YAAM,MAAM,QAAQ,gBAAgB,OAAO;AAC3C,YAAM,YAAY,IAAI;AAEtB,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAElC,cAAK,MAAM,KAAK,MAAM;AAAA,UACjB,MAAM,KAAK,MAAM,YAAY;AAAA,UAC7B,MAAM,YAAY,KAAK,MAAM,GAAI;AACpC;AAAA,UACR;AAEM,iBAAO,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,QAClC;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alphanumeric-data.js

@@ -1,85 +0,0 @@
-import { __require as requireMode } from "./mode.js";
-var alphanumericData;
-var hasRequiredAlphanumericData;
-function requireAlphanumericData() {
-  if (hasRequiredAlphanumericData) return alphanumericData;
-  hasRequiredAlphanumericData = 1;
-  const Mode = requireMode();
-  const ALPHA_NUM_CHARS = [
-    "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 AlphanumericData(data) {
-    this.mode = Mode.ALPHANUMERIC;
-    this.data = data;
-  }
-  AlphanumericData.getBitsLength = function getBitsLength(length) {
-    return 11 * Math.floor(length / 2) + 6 * (length % 2);
-  };
-  AlphanumericData.prototype.getLength = function getLength() {
-    return this.data.length;
-  };
-  AlphanumericData.prototype.getBitsLength = function getBitsLength() {
-    return AlphanumericData.getBitsLength(this.data.length);
-  };
-  AlphanumericData.prototype.write = function write(bitBuffer) {
-    let i;
-    for (i = 0; i + 2 <= this.data.length; i += 2) {
-      let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45;
-      value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1]);
-      bitBuffer.put(value, 11);
-    }
-    if (this.data.length % 2) {
-      bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
-    }
-  };
-  alphanumericData = AlphanumericData;
-  return alphanumericData;
-}
-export {
-  requireAlphanumericData as __require
-};
-//# sourceMappingURL=alphanumeric-data.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alphanumeric-data.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"alphanumeric-data.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":["require$$0"],"mappings":";;;;;;AAAA,QAAM,OAAOA,YAAA;AAWb,QAAM,kBAAkB;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,WAAS,iBAAkB,MAAM;AAC/B,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,mBAAiB,gBAAgB,SAAS,cAAe,QAAQ;AAC/D,WAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AAAA,EACrD;AAEA,mBAAiB,UAAU,YAAY,SAAS,YAAa;AAC3D,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,mBAAiB,UAAU,gBAAgB,SAAS,gBAAiB;AACnE,WAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AAAA,EACxD;AAEA,mBAAiB,UAAU,QAAQ,SAAS,MAAO,WAAW;AAC5D,QAAI;AAIJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,UAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,eAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAIE,QAAI,KAAK,KAAK,SAAS,GAAG;AACxB,gBAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,IAC1D;AAAA,EACA;AAEA,qBAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-buffer.js

@@ -1,40 +0,0 @@
-var bitBuffer;
-var hasRequiredBitBuffer;
-function requireBitBuffer() {
-  if (hasRequiredBitBuffer) return bitBuffer;
-  hasRequiredBitBuffer = 1;
-  function BitBuffer() {
-    this.buffer = [];
-    this.length = 0;
-  }
-  BitBuffer.prototype = {
-    get: function(index) {
-      const bufIndex = Math.floor(index / 8);
-      return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) === 1;
-    },
-    put: function(num, length) {
-      for (let i = 0; i < length; i++) {
-        this.putBit((num >>> length - i - 1 & 1) === 1);
-      }
-    },
-    getLengthInBits: function() {
-      return this.length;
-    },
-    putBit: function(bit) {
-      const bufIndex = Math.floor(this.length / 8);
-      if (this.buffer.length <= bufIndex) {
-        this.buffer.push(0);
-      }
-      if (bit) {
-        this.buffer[bufIndex] |= 128 >>> this.length % 8;
-      }
-      this.length++;
-    }
-  };
-  bitBuffer = BitBuffer;
-  return bitBuffer;
-}
-export {
-  requireBitBuffer as __require
-};
-//# sourceMappingURL=bit-buffer.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-buffer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bit-buffer.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-buffer.js"],"sourcesContent":["function BitBuffer () {\n  this.buffer = []\n  this.length = 0\n}\n\nBitBuffer.prototype = {\n\n  get: function (index) {\n    const bufIndex = Math.floor(index / 8)\n    return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n  },\n\n  put: function (num, length) {\n    for (let i = 0; i < length; i++) {\n      this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n    }\n  },\n\n  getLengthInBits: function () {\n    return this.length\n  },\n\n  putBit: function (bit) {\n    const bufIndex = Math.floor(this.length / 8)\n    if (this.buffer.length <= bufIndex) {\n      this.buffer.push(0)\n    }\n\n    if (bit) {\n      this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n    }\n\n    this.length++\n  }\n}\n\nmodule.exports = BitBuffer\n"],"names":[],"mappings":";;;;;AAAA,WAAS,YAAa;AACpB,SAAK,SAAS,CAAA;AACd,SAAK,SAAS;AAAA,EAChB;AAEA,YAAU,YAAY;AAAA,IAEpB,KAAK,SAAU,OAAO;AACpB,YAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,cAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,IACjE;AAAA,IAEE,KAAK,SAAU,KAAK,QAAQ;AAC1B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,MACxD;AAAA,IACA;AAAA,IAEE,iBAAiB,WAAY;AAC3B,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAAQ,SAAU,KAAK;AACrB,YAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,UAAI,KAAK,OAAO,UAAU,UAAU;AAClC,aAAK,OAAO,KAAK,CAAC;AAAA,MACxB;AAEI,UAAI,KAAK;AACP,aAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,MACxD;AAEI,WAAK;AAAA,IACT;AAAA,EACA;AAEA,cAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-matrix.js

@@ -1,34 +0,0 @@
-var bitMatrix;
-var hasRequiredBitMatrix;
-function requireBitMatrix() {
-  if (hasRequiredBitMatrix) return bitMatrix;
-  hasRequiredBitMatrix = 1;
-  function BitMatrix(size) {
-    if (!size || size < 1) {
-      throw new Error("BitMatrix size must be defined and greater than 0");
-    }
-    this.size = size;
-    this.data = new Uint8Array(size * size);
-    this.reservedBit = new Uint8Array(size * size);
-  }
-  BitMatrix.prototype.set = function(row, col, value, reserved) {
-    const index = row * this.size + col;
-    this.data[index] = value;
-    if (reserved) this.reservedBit[index] = true;
-  };
-  BitMatrix.prototype.get = function(row, col) {
-    return this.data[row * this.size + col];
-  };
-  BitMatrix.prototype.xor = function(row, col, value) {
-    this.data[row * this.size + col] ^= value;
-  };
-  BitMatrix.prototype.isReserved = function(row, col) {
-    return this.reservedBit[row * this.size + col];
-  };
-  bitMatrix = BitMatrix;
-  return bitMatrix;
-}
-export {
-  requireBitMatrix as __require
-};
-//# sourceMappingURL=bit-matrix.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-matrix.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bit-matrix.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-matrix.js"],"sourcesContent":["/**\n * Helper class to handle QR Code symbol modules\n *\n * @param {Number} size Symbol size\n */\nfunction BitMatrix (size) {\n  if (!size || size < 1) {\n    throw new Error('BitMatrix size must be defined and greater than 0')\n  }\n\n  this.size = size\n  this.data = new Uint8Array(size * size)\n  this.reservedBit = new Uint8Array(size * size)\n}\n\n/**\n * Set bit value at specified location\n * If reserved flag is set, this bit will be ignored during masking process\n *\n * @param {Number}  row\n * @param {Number}  col\n * @param {Boolean} value\n * @param {Boolean} reserved\n */\nBitMatrix.prototype.set = function (row, col, value, reserved) {\n  const index = row * this.size + col\n  this.data[index] = value\n  if (reserved) this.reservedBit[index] = true\n}\n\n/**\n * Returns bit value at specified location\n *\n * @param  {Number}  row\n * @param  {Number}  col\n * @return {Boolean}\n */\nBitMatrix.prototype.get = function (row, col) {\n  return this.data[row * this.size + col]\n}\n\n/**\n * Applies xor operator at specified location\n * (used during masking process)\n *\n * @param {Number}  row\n * @param {Number}  col\n * @param {Boolean} value\n */\nBitMatrix.prototype.xor = function (row, col, value) {\n  this.data[row * this.size + col] ^= value\n}\n\n/**\n * Check if bit at specified location is reserved\n *\n * @param {Number}   row\n * @param {Number}   col\n * @return {Boolean}\n */\nBitMatrix.prototype.isReserved = function (row, col) {\n  return this.reservedBit[row * this.size + col]\n}\n\nmodule.exports = BitMatrix\n"],"names":[],"mappings":";;;;;AAKA,WAAS,UAAW,MAAM;AACxB,QAAI,CAAC,QAAQ,OAAO,GAAG;AACrB,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACvE;AAEE,SAAK,OAAO;AACZ,SAAK,OAAO,IAAI,WAAW,OAAO,IAAI;AACtC,SAAK,cAAc,IAAI,WAAW,OAAO,IAAI;AAAA,EAC/C;AAWA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO,UAAU;AAC7D,UAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,SAAK,KAAK,KAAK,IAAI;AACnB,QAAI,SAAU,MAAK,YAAY,KAAK,IAAI;AAAA,EAC1C;AASA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,WAAO,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AAAA,EACxC;AAUA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO;AACnD,SAAK,KAAK,MAAM,KAAK,OAAO,GAAG,KAAK;AAAA,EACtC;AASA,YAAU,UAAU,aAAa,SAAU,KAAK,KAAK;AACnD,WAAO,KAAK,YAAY,MAAM,KAAK,OAAO,GAAG;AAAA,EAC/C;AAEA,cAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/byte-data.js

@@ -1,36 +0,0 @@
-import { __require as requireMode } from "./mode.js";
-var byteData;
-var hasRequiredByteData;
-function requireByteData() {
-  if (hasRequiredByteData) return byteData;
-  hasRequiredByteData = 1;
-  const Mode = requireMode();
-  function ByteData(data) {
-    this.mode = Mode.BYTE;
-    if (typeof data === "string") {
-      this.data = new TextEncoder().encode(data);
-    } else {
-      this.data = new Uint8Array(data);
-    }
-  }
-  ByteData.getBitsLength = function getBitsLength(length) {
-    return length * 8;
-  };
-  ByteData.prototype.getLength = function getLength() {
-    return this.data.length;
-  };
-  ByteData.prototype.getBitsLength = function getBitsLength() {
-    return ByteData.getBitsLength(this.data.length);
-  };
-  ByteData.prototype.write = function(bitBuffer) {
-    for (let i = 0, l = this.data.length; i < l; i++) {
-      bitBuffer.put(this.data[i], 8);
-    }
-  };
-  byteData = ByteData;
-  return byteData;
-}
-export {
-  requireByteData as __require
-};
-//# sourceMappingURL=byte-data.js.map