npm - @burdenoff/microfe-assethandler - Versions diffs - 2026.820.3 → 2026.820.4 - Mend

@burdenoff/microfe-assethandler 2026.820.3 → 2026.820.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (84) hide show

package/dist/assethandler/utils/printAssetTag.js ADDED Viewed

@@ -0,0 +1,124 @@
+import { __toESM as e } from "../../_virtual/_rolldown/runtime.js";
+import { require_browser as t } from "../../node_modules/qrcode/lib/browser.js";
+//#region src/assethandler/utils/printAssetTag.ts
+var n = /* @__PURE__ */ e(t(), 1);
+async function r({ name: e, tagId: t, assetTag: r, category: a, documentTitle: o = "Asset Tag" }) {
+	if (typeof window > "u") return;
+	let s = await n.toDataURL(t, {
+		width: 160,
+		margin: 2,
+		type: "image/png",
+		errorCorrectionLevel: "M"
+	}), c = window.open("", "_blank", "width=420,height=520");
+	c && (c.document.write(`
+    <!DOCTYPE html>
+    <html>
+      <head>
+        <meta charset="utf-8" />
+        <title>${i(o)}</title>
+        <style>
+          @media print {
+            body { margin: 0; }
+            .no-print { display: none !important; }
+          }
+          body {
+            font-family: system-ui, -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, sans-serif;
+            margin: 0;
+            padding: 24px;
+            display: flex;
+            flex-direction: column;
+            align-items: center;
+            justify-content: center;
+            min-height: 100vh;
+            box-sizing: border-box;
+            background: #fff;
+            color: #111;
+          }
+          .tag-container {
+            display: flex;
+            flex-direction: column;
+            align-items: center;
+            gap: 12px;
+            padding: 24px;
+            border: 1px solid #e5e7eb;
+            border-radius: 12px;
+            background: #fff;
+            box-shadow: 0 1px 3px rgba(0,0,0,0.08);
+          }
+          .asset-name {
+            font-size: 16px;
+            font-weight: 600;
+            margin: 0;
+            text-align: center;
+          }
+          .asset-category {
+            font-size: 11px;
+            text-transform: capitalize;
+            color: #6b7280;
+            margin: 0;
+          }
+          .asset-qr {
+            width: 160px;
+            height: 160px;
+          }
+          .asset-tag {
+            font-family: ui-monospace, SFMono-Regular, Menlo, Monaco, Consolas, monospace;
+            font-size: 13px;
+            font-weight: 500;
+            margin: 0;
+          }
+          .asset-tag-id {
+            font-family: ui-monospace, SFMono-Regular, Menlo, Monaco, Consolas, monospace;
+            font-size: 10px;
+            color: #6b7280;
+            margin: 0;
+          }
+          .print-hint {
+            margin-top: 16px;
+            font-size: 12px;
+            color: #6b7280;
+          }
+          .print-button {
+            margin-top: 12px;
+            padding: 8px 16px;
+            font-size: 13px;
+            border-radius: 6px;
+            border: 1px solid #d1d5db;
+            background: #fff;
+            cursor: pointer;
+          }
+          .print-button:hover { background: #f9fafb; }
+        </style>
+      </head>
+      <body>
+        <div class="tag-container">
+          <p class="asset-name">${i(e)}</p>
+          ${a ? `<p class="asset-category">${i(a)}</p>` : ""}
+          <img class="asset-qr" src="${s}" alt="QR code for asset tag ${i(r)}" />
+          <p class="asset-tag">${i(r)}</p>
+          <p class="asset-tag-id">${i(t)}</p>
+        </div>
+        <div class="no-print print-hint">
+          Press Ctrl/Cmd + P to print this tag, then close the window.
+        </div>
+        <button class="no-print print-button" onclick="window.print()">Print tag</button>
+        <script>
+          window.addEventListener('afterprint', function () {
+            window.close();
+          });
+          // Auto-print after a short delay so the image is fully rendered.
+          setTimeout(function () {
+            window.print();
+          }, 300);
+        <\/script>
+      </body>
+    </html>
+  `), c.document.close());
+}
+function i(e) {
+	return e.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;").replace(/'/g, "&#39;");
+}
+//#endregion
+export { r as printAssetTag };
+//# sourceMappingURL=printAssetTag.js.map

package/dist/assethandler/utils/printAssetTag.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"printAssetTag.js","names":[],"sources":["../../../src/assethandler/utils/printAssetTag.ts"],"sourcesContent":["import QRCode from 'qrcode';\n\nexport interface PrintAssetTagOptions {\n /** Human-readable asset name. */\n name: string;\n /** The scannable tagId (stable, workspace-unique). */\n tagId: string;\n /** Display value for the legacy asset tag / asset number. */\n assetTag: string;\n /** Optional category label shown beneath the name. */\n category?: string;\n /** Document title for the print window. */\n documentTitle?: string;\n}\n\n/**\n * Open a small print window that renders a single asset tag (QR + details) and\n * triggers the browser print dialog. The popup is closed automatically after\n * printing.\n *\n * The print window is a blank document that does not load the host app's CSS\n * variables, so the inline stylesheet below uses concrete hex values. Those\n * colours are chosen to print reliably on any printer and are not part of the\n * application's live theme surface.\n */\nexport async function printAssetTag({\n name,\n tagId,\n assetTag,\n category,\n documentTitle = 'Asset Tag',\n}: PrintAssetTagOptions): Promise<void> {\n if (typeof window === 'undefined') return;\n\n const qrDataUrl = await QRCode.toDataURL(tagId, {\n width: 160,\n margin: 2,\n type: 'image/png',\n errorCorrectionLevel: 'M',\n });\n\n const printWindow = window.open('', '_blank', 'width=420,height=520');\n if (!printWindow) {\n // Popup blocked — let the caller handle the failure if desired.\n return;\n }\n\n // The print popup is a blank document without the host app's CSS variables,\n // so the inline stylesheet uses concrete hex colours for reliable printing.\n /* eslint-disable no-restricted-syntax */\n printWindow.document.write(`\n <!DOCTYPE html>\n <html>\n <head>\n <meta charset=\"utf-8\" />\n <title>${escapeHtml(documentTitle)}</title>\n <style>\n @media print {\n body { margin: 0; }\n .no-print { display: none !important; }\n }\n body {\n font-family: system-ui, -apple-system, BlinkMacSystemFont, \"Segoe UI\", Roboto, sans-serif;\n margin: 0;\n padding: 24px;\n display: flex;\n flex-direction: column;\n align-items: center;\n justify-content: center;\n min-height: 100vh;\n box-sizing: border-box;\n background: #fff;\n color: #111;\n }\n .tag-container {\n display: flex;\n flex-direction: column;\n align-items: center;\n gap: 12px;\n padding: 24px;\n border: 1px solid #e5e7eb;\n border-radius: 12px;\n background: #fff;\n box-shadow: 0 1px 3px rgba(0,0,0,0.08);\n }\n .asset-name {\n font-size: 16px;\n font-weight: 600;\n margin: 0;\n text-align: center;\n }\n .asset-category {\n font-size: 11px;\n text-transform: capitalize;\n color: #6b7280;\n margin: 0;\n }\n .asset-qr {\n width: 160px;\n height: 160px;\n }\n .asset-tag {\n font-family: ui-monospace, SFMono-Regular, Menlo, Monaco, Consolas, monospace;\n font-size: 13px;\n font-weight: 500;\n margin: 0;\n }\n .asset-tag-id {\n font-family: ui-monospace, SFMono-Regular, Menlo, Monaco, Consolas, monospace;\n font-size: 10px;\n color: #6b7280;\n margin: 0;\n }\n .print-hint {\n margin-top: 16px;\n font-size: 12px;\n color: #6b7280;\n }\n .print-button {\n margin-top: 12px;\n padding: 8px 16px;\n font-size: 13px;\n border-radius: 6px;\n border: 1px solid #d1d5db;\n background: #fff;\n cursor: pointer;\n }\n .print-button:hover { background: #f9fafb; }\n </style>\n </head>\n <body>\n <div class=\"tag-container\">\n <p class=\"asset-name\">${escapeHtml(name)}</p>\n ${category ? `<p class=\"asset-category\">${escapeHtml(category)}</p>` : ''}\n <img class=\"asset-qr\" src=\"${qrDataUrl}\" alt=\"QR code for asset tag ${escapeHtml(assetTag)}\" />\n <p class=\"asset-tag\">${escapeHtml(assetTag)}</p>\n <p class=\"asset-tag-id\">${escapeHtml(tagId)}</p>\n </div>\n <div class=\"no-print print-hint\">\n Press Ctrl/Cmd + P to print this tag, then close the window.\n </div>\n <button class=\"no-print print-button\" onclick=\"window.print()\">Print tag</button>\n <script>\n window.addEventListener('afterprint', function () {\n window.close();\n });\n // Auto-print after a short delay so the image is fully rendered.\n setTimeout(function () {\n window.print();\n }, 300);\n </script>\n </body>\n </html>\n `);\n /* eslint-enable no-restricted-syntax */\n\n printWindow.document.close();\n}\n\nfunction escapeHtml(value: string): string {\n return value\n .replace(/&/g, '&')\n .replace(/</g, '<')\n .replace(/>/g, '>')\n .replace(/\"/g, '"')\n .replace(/'/g, ''');\n}\n"],"mappings":";;;;AAyBA,eAAsB,EAAc,EAClC,SACA,UACA,aACA,aACA,mBAAgB,eACsB;AACtC,KAAI,OAAO,SAAW,IAAa;CAEnC,IAAM,IAAY,MAAA,EAAa,UAAU,GAAO;EAC9C,OAAO;EACP,QAAQ;EACR,MAAM;EACN,sBAAsB;EACvB,CAAC,EAEI,IAAc,OAAO,KAAK,IAAI,UAAU,uBAAuB;AAChE,OAQL,EAAY,SAAS,MAAM;;;;;iBAKZ,EAAW,EAAc,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kCA6ET,EAAW,EAAK,CAAC;YACvC,IAAW,6BAA6B,EAAW,EAAS,CAAC,QAAQ,GAAG;uCAC7C,EAAU,+BAA+B,EAAW,EAAS,CAAC;iCACpE,EAAW,EAAS,CAAC;oCAClB,EAAW,EAAM,CAAC;;;;;;;;;;;;;;;;;IAiBlD,EAGF,EAAY,SAAS,OAAO;;AAG9B,SAAS,EAAW,GAAuB;AACzC,QAAO,EACJ,QAAQ,MAAM,QAAQ,CACtB,QAAQ,MAAM,OAAO,CACrB,QAAQ,MAAM,OAAO,CACrB,QAAQ,MAAM,SAAS,CACvB,QAAQ,MAAM,QAAQ"}

package/dist/node_modules/dijkstrajs/dijkstra.js ADDED Viewed

@@ -0,0 +1,61 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+//#region node_modules/dijkstrajs/dijkstra.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	var n = {
+		single_source_shortest_paths: function(e, t, r) {
+			var i = {}, a = {};
+			a[t] = 0;
+			var o = n.PriorityQueue.make();
+			o.push(t, 0);
+			for (var s, c, l, u, d, f, p, m, h; !o.empty();) for (l in s = o.pop(), c = s.value, u = s.cost, d = e[c] || {}, d) d.hasOwnProperty(l) && (f = d[l], p = u + f, m = a[l], h = a[l] === void 0, (h || m > p) && (a[l] = p, o.push(l, p), i[l] = c));
+			if (r !== void 0 && a[r] === void 0) {
+				var g = [
+					"Could not find a path from ",
+					t,
+					" to ",
+					r,
+					"."
+				].join("");
+				throw Error(g);
+			}
+			return i;
+		},
+		extract_shortest_path_from_predecessor_list: function(e, t) {
+			for (var n = [], r = t; r;) n.push(r), e[r], r = e[r];
+			return n.reverse(), n;
+		},
+		find_path: function(e, t, r) {
+			var i = n.single_source_shortest_paths(e, t, r);
+			return n.extract_shortest_path_from_predecessor_list(i, r);
+		},
+		PriorityQueue: {
+			make: function(e) {
+				var t = n.PriorityQueue, r = {}, i;
+				for (i in e ||= {}, t) t.hasOwnProperty(i) && (r[i] = t[i]);
+				return r.queue = [], r.sorter = e.sorter || t.default_sorter, r;
+			},
+			default_sorter: function(e, t) {
+				return e.cost - t.cost;
+			},
+			push: function(e, t) {
+				var n = {
+					value: e,
+					cost: t
+				};
+				this.queue.push(n), this.queue.sort(this.sorter);
+			},
+			pop: function() {
+				return this.queue.shift();
+			},
+			empty: function() {
+				return this.queue.length === 0;
+			}
+		}
+	};
+	t !== void 0 && (t.exports = n);
+}));
+//#endregion
+export default t();
+export { t as require_dijkstra };
+//# sourceMappingURL=dijkstra.js.map

package/dist/node_modules/dijkstrajs/dijkstra.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"dijkstra.js","names":[],"sources":["../../../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"],"x_google_ignoreList":[0],"mappings":";;;CAuBA,IAAI,IAAW;EACb,8BAA8B,SAAS,GAAO,GAAG,GAAG;GAGlD,IAAI,IAAe,EAAE,EAIjB,IAAQ,EAAE;AACd,KAAM,KAAK;GAMX,IAAI,IAAO,EAAS,cAAc,MAAM;AACxC,KAAK,KAAK,GAAG,EAAE;AAUf,QARA,IAAI,GACA,GAAG,GACH,GACA,GACA,GACA,GACA,GACA,GACG,CAAC,EAAK,OAAO,EAalB,MAAK,KAVL,IAAU,EAAK,KAAK,EACpB,IAAI,EAAQ,OACZ,IAAiB,EAAQ,MAGzB,IAAiB,EAAM,MAAM,EAAE,EAKrB,EACR,CAAI,EAAe,eAAe,EAAE,KAElC,IAAY,EAAe,IAK3B,IAAgC,IAAiB,GAMjD,IAAiB,EAAM,IACvB,IAAsB,EAAM,OAAO,SAC/B,KAAe,IAAiB,OAClC,EAAM,KAAK,GACX,EAAK,KAAK,GAAG,EAA8B,EAC3C,EAAa,KAAK;AAM1B,OAAW,MAAM,UAAsB,EAAM,OAAO,QAAa;IAC/D,IAAI,IAAM;KAAC;KAA+B;KAAG;KAAQ;KAAG;KAAI,CAAC,KAAK,GAAG;AACrE,UAAU,MAAM,EAAI;;AAGtB,UAAO;;EAGT,6CAA6C,SAAS,GAAc,GAAG;AAIrE,QAHA,IAAI,IAAQ,EAAE,EACV,IAAI,GAED,GAGL,CAFA,EAAM,KAAK,EAAE,EACC,EAAa,IAC3B,IAAI,EAAa;AAGnB,UADA,EAAM,SAAS,EACR;;EAGT,WAAW,SAAS,GAAO,GAAG,GAAG;GAC/B,IAAI,IAAe,EAAS,6BAA6B,GAAO,GAAG,EAAE;AACrE,UAAO,EAAS,4CACd,GAAc,EAAE;;EAMpB,eAAe;GACb,MAAM,SAAU,GAAM;IACpB,IAAI,IAAI,EAAS,eACb,IAAI,EAAE,EACN;AAEJ,SAAK,KADL,MAAe,EAAE,EACL,EACV,CAAI,EAAE,eAAe,EAAI,KACvB,EAAE,KAAO,EAAE;AAKf,WAFA,EAAE,QAAQ,EAAE,EACZ,EAAE,SAAS,EAAK,UAAU,EAAE,gBACrB;;GAGT,gBAAgB,SAAU,GAAG,GAAG;AAC9B,WAAO,EAAE,OAAO,EAAE;;GAOpB,MAAM,SAAU,GAAO,GAAM;IAC3B,IAAI,IAAO;KAAQ;KAAa;KAAK;AAErC,IADA,KAAK,MAAM,KAAK,EAAK,EACrB,KAAK,MAAM,KAAK,KAAK,OAAO;;GAM9B,KAAK,WAAY;AACf,WAAO,KAAK,MAAM,OAAO;;GAG3B,OAAO,WAAY;AACjB,WAAO,KAAK,MAAM,WAAW;;GAEhC;EACF;AAID,CAAW,MAAW,WACpB,EAAO,UAAU"}

package/dist/node_modules/qrcode/lib/browser.js ADDED Viewed

@@ -0,0 +1,40 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_can_promise as t } from "./can-promise.js";
+import { require_qrcode as n } from "./core/qrcode.js";
+import { require_canvas as r } from "./renderer/canvas.js";
+import { require_svg_tag as i } from "./renderer/svg-tag.js";
+//#region node_modules/qrcode/lib/browser.js
+var a = /* @__PURE__ */ e(((e) => {
+	var a = t(), o = n(), s = r(), c = i();
+	function l(e, t, n, r, i) {
+		let s = [].slice.call(arguments, 1), c = s.length, l = typeof s[c - 1] == "function";
+		if (!l && !a()) throw Error("Callback required as last argument");
+		if (l) {
+			if (c < 2) throw Error("Too few arguments provided");
+			c === 2 ? (i = n, n = t, t = r = void 0) : c === 3 && (t.getContext && i === void 0 ? (i = r, r = void 0) : (i = r, r = n, n = t, t = void 0));
+		} else {
+			if (c < 1) throw Error("Too few arguments provided");
+			return c === 1 ? (n = t, t = r = void 0) : c === 2 && !t.getContext && (r = n, n = t, t = void 0), new Promise(function(i, a) {
+				try {
+					i(e(o.create(n, r), t, r));
+				} catch (e) {
+					a(e);
+				}
+			});
+		}
+		try {
+			let a = o.create(n, r);
+			i(null, e(a, t, r));
+		} catch (e) {
+			i(e);
+		}
+	}
+	e.create = o.create, e.toCanvas = l.bind(null, s.render), e.toDataURL = l.bind(null, s.renderToDataURL), e.toString = l.bind(null, function(e, t, n) {
+		return c.render(e, n);
+	});
+}));
+//#endregion
+export default a();
+export { a as require_browser };
+//# sourceMappingURL=browser.js.map

package/dist/node_modules/qrcode/lib/browser.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"browser.js","names":[],"sources":["../../../../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"],"x_google_ignoreList":[0],"mappings":";;;;;;;CACA,IAAM,IAAA,GAAA,EAEA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CAEN,SAAS,EAAc,GAAY,GAAQ,GAAM,GAAM,GAAI;EACzD,IAAM,IAAO,EAAE,CAAC,MAAM,KAAK,WAAW,EAAE,EAClC,IAAU,EAAK,QACf,IAAc,OAAO,EAAK,IAAU,MAAO;AAEjD,MAAI,CAAC,KAAe,CAAC,GAAY,CAC/B,OAAU,MAAM,qCAAqC;AAGvD,MAAI,GAAa;AACf,OAAI,IAAU,EACZ,OAAU,MAAM,6BAA6B;AAG/C,GAAI,MAAY,KACd,IAAK,GACL,IAAO,GACP,IAAS,IAAO,KAAA,KACP,MAAY,MACjB,EAAO,cAAqB,MAAO,UACrC,IAAK,GACL,IAAO,KAAA,MAEP,IAAK,GACL,IAAO,GACP,IAAO,GACP,IAAS,KAAA;SAGR;AACL,OAAI,IAAU,EACZ,OAAU,MAAM,6BAA6B;AAY/C,UATI,MAAY,KACd,IAAO,GACP,IAAS,IAAO,KAAA,KACP,MAAY,KAAK,CAAC,EAAO,eAClC,IAAO,GACP,IAAO,GACP,IAAS,KAAA,IAGJ,IAAI,QAAQ,SAAU,GAAS,GAAQ;AAC5C,QAAI;AAEF,OAAQ,EADK,EAAO,OAAO,GAAM,EAAK,EACb,GAAQ,EAAK,CAAC;aAChC,GAAG;AACV,OAAO,EAAE;;KAEX;;AAGJ,MAAI;GACF,IAAM,IAAO,EAAO,OAAO,GAAM,EAAK;AACtC,KAAG,MAAM,EAAW,GAAM,GAAQ,EAAK,CAAC;WACjC,GAAG;AACV,KAAG,EAAE;;;AAST,CALA,EAAQ,SAAS,EAAO,QACxB,EAAQ,WAAW,EAAa,KAAK,MAAM,EAAe,OAAO,EACjE,EAAQ,YAAY,EAAa,KAAK,MAAM,EAAe,gBAAgB,EAG3E,EAAQ,WAAW,EAAa,KAAK,MAAM,SAAU,GAAM,GAAG,GAAM;AAClE,SAAO,EAAY,OAAO,GAAM,EAAK;GACrC"}

package/dist/node_modules/qrcode/lib/can-promise.js ADDED Viewed

@@ -0,0 +1,12 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+//#region node_modules/qrcode/lib/can-promise.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	t.exports = function() {
+		return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
+	};
+}));
+//#endregion
+export default t();
+export { t as require_can_promise };
+//# sourceMappingURL=can-promise.js.map

package/dist/node_modules/qrcode/lib/can-promise.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"can-promise.js","names":[],"sources":["../../../../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"],"x_google_ignoreList":[0],"mappings":";;;AAIA,GAAO,UAAU,WAAY;AAC3B,SAAO,OAAO,WAAY,cAAc,QAAQ,aAAa,QAAQ,UAAU"}

package/dist/node_modules/qrcode/lib/core/alignment-pattern.js ADDED Viewed

@@ -0,0 +1,21 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_utils as t } from "./utils.js";
+//#region node_modules/qrcode/lib/core/alignment-pattern.js
+var n = /* @__PURE__ */ e(((e) => {
+	var n = t().getSymbolSize;
+	e.getRowColCoords = function(e) {
+		if (e === 1) return [];
+		let t = Math.floor(e / 7) + 2, r = n(e), i = r === 145 ? 26 : Math.ceil((r - 13) / (2 * t - 2)) * 2, a = [r - 7];
+		for (let e = 1; e < t - 1; e++) a[e] = a[e - 1] - i;
+		return a.push(6), a.reverse();
+	}, e.getPositions = function(t) {
+		let n = [], r = e.getRowColCoords(t), i = r.length;
+		for (let e = 0; e < i; e++) for (let t = 0; t < i; t++) e === 0 && t === 0 || e === 0 && t === i - 1 || e === i - 1 && t === 0 || n.push([r[e], r[t]]);
+		return n;
+	};
+}));
+//#endregion
+export default n();
+export { n as require_alignment_pattern };
+//# sourceMappingURL=alignment-pattern.js.map

package/dist/node_modules/qrcode/lib/core/alignment-pattern.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"alignment-pattern.js","names":[],"sources":["../../../../../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"],"x_google_ignoreList":[0],"mappings":";;;;CAUA,IAAM,IAAA,GAAA,CAAmC;AAqDzC,CArCA,EAAQ,kBAAkB,SAA0B,GAAS;AAC3D,MAAI,MAAY,EAAG,QAAO,EAAE;EAE5B,IAAM,IAAW,KAAK,MAAM,IAAU,EAAE,GAAG,GACrC,IAAO,EAAc,EAAQ,EAC7B,IAAY,MAAS,MAAM,KAAK,KAAK,MAAM,IAAO,OAAO,IAAI,IAAW,GAAG,GAAG,GAC9E,IAAY,CAAC,IAAO,EAAE;AAE5B,OAAK,IAAI,IAAI,GAAG,IAAI,IAAW,GAAG,IAChC,GAAU,KAAK,EAAU,IAAI,KAAK;AAKpC,SAFA,EAAU,KAAK,EAAE,EAEV,EAAU,SAAS;IAuB5B,EAAQ,eAAe,SAAuB,GAAS;EACrD,IAAM,IAAS,EAAE,EACX,IAAM,EAAQ,gBAAgB,EAAQ,EACtC,IAAY,EAAI;AAEtB,OAAK,IAAI,IAAI,GAAG,IAAI,GAAW,IAC7B,MAAK,IAAI,IAAI,GAAG,IAAI,GAAW,IAExB,OAAM,KAAK,MAAM,KACjB,MAAM,KAAK,MAAM,IAAY,KAC7B,MAAM,IAAY,KAAK,MAAM,KAIlC,EAAO,KAAK,CAAC,EAAI,IAAI,EAAI,GAAG,CAAC;AAIjC,SAAO"}

package/dist/node_modules/qrcode/lib/core/alphanumeric-data.js ADDED Viewed

@@ -0,0 +1,28 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_mode as t } from "./mode.js";
+//#region node_modules/qrcode/lib/core/alphanumeric-data.js
+var n = /* @__PURE__ */ e(((e, n) => {
+	var r = t(), i = /* @__PURE__ */ "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:".split("");
+	function a(e) {
+		this.mode = r.ALPHANUMERIC, this.data = e;
+	}
+	a.getBitsLength = function(e) {
+		return 11 * Math.floor(e / 2) + e % 2 * 6;
+	}, a.prototype.getLength = function() {
+		return this.data.length;
+	}, a.prototype.getBitsLength = function() {
+		return a.getBitsLength(this.data.length);
+	}, a.prototype.write = function(e) {
+		let t;
+		for (t = 0; t + 2 <= this.data.length; t += 2) {
+			let n = i.indexOf(this.data[t]) * 45;
+			n += i.indexOf(this.data[t + 1]), e.put(n, 11);
+		}
+		this.data.length % 2 && e.put(i.indexOf(this.data[t]), 6);
+	}, n.exports = a;
+}));
+//#endregion
+export default n();
+export { n as require_alphanumeric_data };
+//# sourceMappingURL=alphanumeric-data.js.map

package/dist/node_modules/qrcode/lib/core/alphanumeric-data.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"alphanumeric-data.js","names":[],"sources":["../../../../../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"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAM,IAAA,GAAA,EAWA,IAAkB,yEAKvB;CAED,SAAS,EAAkB,GAAM;AAE/B,EADA,KAAK,OAAO,EAAK,cACjB,KAAK,OAAO;;AAsCd,CAnCA,EAAiB,gBAAgB,SAAwB,GAAQ;AAC/D,SAAO,KAAK,KAAK,MAAM,IAAS,EAAE,GAAQ,IAAS,IAAd;IAGvC,EAAiB,UAAU,YAAY,WAAsB;AAC3D,SAAO,KAAK,KAAK;IAGnB,EAAiB,UAAU,gBAAgB,WAA0B;AACnE,SAAO,EAAiB,cAAc,KAAK,KAAK,OAAO;IAGzD,EAAiB,UAAU,QAAQ,SAAgB,GAAW;EAC5D,IAAI;AAIJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;GAE7C,IAAI,IAAQ,EAAgB,QAAQ,KAAK,KAAK,GAAG,GAAG;AAMpD,GAHA,KAAS,EAAgB,QAAQ,KAAK,KAAK,IAAI,GAAG,EAGlD,EAAU,IAAI,GAAO,GAAG;;AAK1B,EAAI,KAAK,KAAK,SAAS,KACrB,EAAU,IAAI,EAAgB,QAAQ,KAAK,KAAK,GAAG,EAAE,EAAE;IAI3D,EAAO,UAAU"}

package/dist/node_modules/qrcode/lib/core/bit-buffer.js ADDED Viewed

@@ -0,0 +1,28 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+//#region node_modules/qrcode/lib/core/bit-buffer.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	function n() {
+		this.buffer = [], this.length = 0;
+	}
+	n.prototype = {
+		get: function(e) {
+			let t = Math.floor(e / 8);
+			return (this.buffer[t] >>> 7 - e % 8 & 1) == 1;
+		},
+		put: function(e, t) {
+			for (let n = 0; n < t; n++) this.putBit((e >>> t - n - 1 & 1) == 1);
+		},
+		getLengthInBits: function() {
+			return this.length;
+		},
+		putBit: function(e) {
+			let t = Math.floor(this.length / 8);
+			this.buffer.length <= t && this.buffer.push(0), e && (this.buffer[t] |= 128 >>> this.length % 8), this.length++;
+		}
+	}, t.exports = n;
+}));
+//#endregion
+export default t();
+export { t as require_bit_buffer };
+//# sourceMappingURL=bit-buffer.js.map

package/dist/node_modules/qrcode/lib/core/bit-buffer.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"bit-buffer.js","names":[],"sources":["../../../../../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"],"x_google_ignoreList":[0],"mappings":";;;CAAA,SAAS,IAAa;AAEpB,EADA,KAAK,SAAS,EAAE,EAChB,KAAK,SAAS;;AAkChB,CA/BA,EAAU,YAAY;EAEpB,KAAK,SAAU,GAAO;GACpB,IAAM,IAAW,KAAK,MAAM,IAAQ,EAAE;AACtC,WAAS,KAAK,OAAO,OAAe,IAAI,IAAQ,IAAM,MAAO;;EAG/D,KAAK,SAAU,GAAK,GAAQ;AAC1B,QAAK,IAAI,IAAI,GAAG,IAAI,GAAQ,IAC1B,MAAK,QAAS,MAAS,IAAS,IAAI,IAAM,MAAO,EAAE;;EAIvD,iBAAiB,WAAY;AAC3B,UAAO,KAAK;;EAGd,QAAQ,SAAU,GAAK;GACrB,IAAM,IAAW,KAAK,MAAM,KAAK,SAAS,EAAE;AAS5C,GARI,KAAK,OAAO,UAAU,KACxB,KAAK,OAAO,KAAK,EAAE,EAGjB,MACF,KAAK,OAAO,MAAc,QAAU,KAAK,SAAS,IAGpD,KAAK;;EAER,EAED,EAAO,UAAU"}

package/dist/node_modules/qrcode/lib/core/bit-matrix.js ADDED Viewed

@@ -0,0 +1,23 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+//#region node_modules/qrcode/lib/core/bit-matrix.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	function n(e) {
+		if (!e || e < 1) throw Error("BitMatrix size must be defined and greater than 0");
+		this.size = e, this.data = new Uint8Array(e * e), this.reservedBit = new Uint8Array(e * e);
+	}
+	n.prototype.set = function(e, t, n, r) {
+		let i = e * this.size + t;
+		this.data[i] = n, r && (this.reservedBit[i] = !0);
+	}, n.prototype.get = function(e, t) {
+		return this.data[e * this.size + t];
+	}, n.prototype.xor = function(e, t, n) {
+		this.data[e * this.size + t] ^= n;
+	}, n.prototype.isReserved = function(e, t) {
+		return this.reservedBit[e * this.size + t];
+	}, t.exports = n;
+}));
+//#endregion
+export default t();
+export { t as require_bit_matrix };
+//# sourceMappingURL=bit-matrix.js.map

package/dist/node_modules/qrcode/lib/core/bit-matrix.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"bit-matrix.js","names":[],"sources":["../../../../../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"],"x_google_ignoreList":[0],"mappings":";;;CAKA,SAAS,EAAW,GAAM;AACxB,MAAI,CAAC,KAAQ,IAAO,EAClB,OAAU,MAAM,oDAAoD;AAKtE,EAFA,KAAK,OAAO,GACZ,KAAK,OAAO,IAAI,WAAW,IAAO,EAAK,EACvC,KAAK,cAAc,IAAI,WAAW,IAAO,EAAK;;AAoDhD,CAxCA,EAAU,UAAU,MAAM,SAAU,GAAK,GAAK,GAAO,GAAU;EAC7D,IAAM,IAAQ,IAAM,KAAK,OAAO;AAEhC,EADA,KAAK,KAAK,KAAS,GACf,MAAU,KAAK,YAAY,KAAS;IAU1C,EAAU,UAAU,MAAM,SAAU,GAAK,GAAK;AAC5C,SAAO,KAAK,KAAK,IAAM,KAAK,OAAO;IAWrC,EAAU,UAAU,MAAM,SAAU,GAAK,GAAK,GAAO;AACnD,OAAK,KAAK,IAAM,KAAK,OAAO,MAAQ;IAUtC,EAAU,UAAU,aAAa,SAAU,GAAK,GAAK;AACnD,SAAO,KAAK,YAAY,IAAM,KAAK,OAAO;IAG5C,EAAO,UAAU"}

package/dist/node_modules/qrcode/lib/core/byte-data.js ADDED Viewed

@@ -0,0 +1,23 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_mode as t } from "./mode.js";
+//#region node_modules/qrcode/lib/core/byte-data.js
+var n = /* @__PURE__ */ e(((e, n) => {
+	var r = t();
+	function i(e) {
+		this.mode = r.BYTE, typeof e == "string" ? this.data = new TextEncoder().encode(e) : this.data = new Uint8Array(e);
+	}
+	i.getBitsLength = function(e) {
+		return e * 8;
+	}, i.prototype.getLength = function() {
+		return this.data.length;
+	}, i.prototype.getBitsLength = function() {
+		return i.getBitsLength(this.data.length);
+	}, i.prototype.write = function(e) {
+		for (let t = 0, n = this.data.length; t < n; t++) e.put(this.data[t], 8);
+	}, n.exports = i;
+}));
+//#endregion
+export default n();
+export { n as require_byte_data };
+//# sourceMappingURL=byte-data.js.map

package/dist/node_modules/qrcode/lib/core/byte-data.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"byte-data.js","names":[],"sources":["../../../../../node_modules/qrcode/lib/core/byte-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction ByteData (data) {\n this.mode = Mode.BYTE\n if (typeof (data) === 'string') {\n this.data = new TextEncoder().encode(data)\n } else {\n this.data = new Uint8Array(data)\n }\n}\n\nByteData.getBitsLength = function getBitsLength (length) {\n return length * 8\n}\n\nByteData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nByteData.prototype.getBitsLength = function getBitsLength () {\n return ByteData.getBitsLength(this.data.length)\n}\n\nByteData.prototype.write = function (bitBuffer) {\n for (let i = 0, l = this.data.length; i < l; i++) {\n bitBuffer.put(this.data[i], 8)\n }\n}\n\nmodule.exports = ByteData\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAM,IAAA,GAAA;CAEN,SAAS,EAAU,GAAM;AAEvB,EADA,KAAK,OAAO,EAAK,MACb,OAAQ,KAAU,WACpB,KAAK,OAAO,IAAI,aAAa,CAAC,OAAO,EAAK,GAE1C,KAAK,OAAO,IAAI,WAAW,EAAK;;AAsBpC,CAlBA,EAAS,gBAAgB,SAAwB,GAAQ;AACvD,SAAO,IAAS;IAGlB,EAAS,UAAU,YAAY,WAAsB;AACnD,SAAO,KAAK,KAAK;IAGnB,EAAS,UAAU,gBAAgB,WAA0B;AAC3D,SAAO,EAAS,cAAc,KAAK,KAAK,OAAO;IAGjD,EAAS,UAAU,QAAQ,SAAU,GAAW;AAC9C,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAG,IAC3C,GAAU,IAAI,KAAK,KAAK,IAAI,EAAE;IAIlC,EAAO,UAAU"}