diff --git a/README.md b/README.md
new file mode 100644
index 0000000..38dcd2d
--- /dev/null
+++ b/README.md
@@ -0,0 +1,271 @@
+# QR Code Generator
+
+A powerful QR code generator with support for custom images, color customization, and SVG export. Built with React and vanilla JavaScript utilities.
+
+## Features
+
+- ✅ **QR Code Generation**: Generate QR codes from any text
+- ✅ **Custom Images**: Embed logos or images in the center of QR codes
+- ✅ **Color Customization**: Customize foreground and background colors
+- ✅ **SVG Export**: Export QR codes as scalable vector graphics
+- ✅ **Bitmap Vectorization**: Convert bitmap images to vector paths in SVG
+- ✅ **Multiple Formats**: Support for PNG, JPEG, GIF, WebP, and SVG images
+- ✅ **Precise Positioning**: Perfect centering with decimal coordinates
+- ✅ **Framework Agnostic**: Use with React or vanilla JavaScript
+
+## Installation
+
+```bash
+npm install
+```
+
+## Usage
+
+### With React
+
+The main React component is located at `src/components/TextAreaComponent.jsx`:
+
+```jsx
+import TextAreaComponent from './components/TextAreaComponent';
+
+function App() {
+ return (
+
+
QR Code Generator
+
+
+ );
+}
+```
+
+### With Vanilla JavaScript
+
+Use the utility functions directly in any JavaScript project:
+
+```javascript
+import {
+ generateQRCode,
+ generateCompleteSVGQRCode,
+ downloadSVG,
+ fileToDataURL,
+ validateImageFile
+} from './src/utils/qrCodeUtils.js';
+
+// Generate a basic QR code
+const qrCodeUrl = await generateQRCode('Hello World', '#000000', '#FFFFFF');
+
+// Generate QR code with custom image
+const svgContent = await generateCompleteSVGQRCode(
+ 'Hello World',
+ 'data:image/png;base64,...', // Custom image data URL
+ 20, // Image size percentage
+ '#000000', // Foreground color
+ '#FFFFFF' // Background color
+);
+
+// Download as SVG
+downloadSVG(svgContent, 'qrcode.svg');
+```
+
+## API Reference
+
+### Core Functions
+
+#### `generateQRCode(text, foregroundColor, backgroundColor)`
+Generates a QR code as a data URL (PNG format).
+
+- **Parameters:**
+ - `text` (string): Text to encode in the QR code
+ - `foregroundColor` (string): QR code color (default: '#000000')
+ - `backgroundColor` (string): Background color (default: '#FFFFFF')
+- **Returns:** Promise - Data URL of the generated QR code
+
+#### `generateSVGQRCode(text, foregroundColor, backgroundColor)`
+Generates a QR code as an SVG string.
+
+- **Parameters:**
+ - `text` (string): Text to encode in the QR code
+ - `foregroundColor` (string): QR code color (default: '#000000')
+ - `backgroundColor` (string): Background color (default: '#FFFFFF')
+- **Returns:** Promise - SVG string of the generated QR code
+
+#### `generateCompleteSVGQRCode(text, imageUrl, imageSize, foregroundColor, backgroundColor)`
+Generates a complete SVG QR code with embedded image.
+
+- **Parameters:**
+ - `text` (string): Text to encode in the QR code
+ - `imageUrl` (string, optional): Custom image data URL
+ - `imageSize` (number): Image size as percentage (0-100, default: 20)
+ - `foregroundColor` (string): QR code color (default: '#000000')
+ - `backgroundColor` (string): Background color (default: '#FFFFFF')
+- **Returns:** Promise - Complete SVG string with embedded image
+
+### Image Processing Functions
+
+#### `addImageToQRCode(qrCodeUrl, imageUrl, imageSize)`
+Adds a custom image to a QR code data URL.
+
+- **Parameters:**
+ - `qrCodeUrl` (string): The QR code data URL
+ - `imageUrl` (string): The custom image data URL
+ - `imageSize` (number): Image size as percentage (0-100)
+- **Returns:** Promise - Data URL of QR code with embedded image
+
+#### `addImageToSVG(svgString, imageUrl, imageSize)`
+Adds a custom image to an SVG QR code.
+
+- **Parameters:**
+ - `svgString` (string): The SVG QR code string
+ - `imageUrl` (string): The custom image data URL
+ - `imageSize` (number): Image size as percentage (0-100)
+- **Returns:** Promise - SVG string with embedded image
+
+#### `vectorizeBitmap(img, targetSize, x, y, svgDoc)`
+Converts a bitmap image to SVG vector elements.
+
+- **Parameters:**
+ - `img` (HTMLImageElement): The image element to vectorize
+ - `targetSize` (number): Target size in QR coordinate system
+ - `x` (number): X position in QR coordinate system
+ - `y` (number): Y position in QR coordinate system
+ - `svgDoc` (Document): The SVG document to add elements to
+- **Returns:** Promise - SVG group element containing vectorized image
+
+### Utility Functions
+
+#### `downloadSVG(svgContent, filename)`
+Downloads an SVG string as a file.
+
+- **Parameters:**
+ - `svgContent` (string): The SVG content to download
+ - `filename` (string): The filename for the download (default: 'qrcode.svg')
+
+#### `fileToDataURL(file)`
+Converts a file to data URL.
+
+- **Parameters:**
+ - `file` (File): The file to convert
+- **Returns:** Promise - Data URL of the file
+
+#### `validateImageFile(file, maxSize)`
+Validates an image file.
+
+- **Parameters:**
+ - `file` (File): The file to validate
+ - `maxSize` (number): Maximum file size in bytes (default: 2MB)
+- **Returns:** Object - Validation result with success boolean and error message
+
+## Examples
+
+### Basic QR Code Generation
+
+```javascript
+import { generateQRCode } from './src/utils/qrCodeUtils.js';
+
+const qrCode = await generateQRCode('https://example.com');
+console.log(qrCode); // data:image/png;base64,...
+```
+
+### QR Code with Custom Image
+
+```javascript
+import { generateCompleteSVGQRCode, downloadSVG } from './src/utils/qrCodeUtils.js';
+
+const svgContent = await generateCompleteSVGQRCode(
+ 'https://example.com',
+ 'data:image/svg+xml;base64,...', // Your logo
+ 25, // 25% of QR code size
+ '#1a1a1a', // Dark gray
+ '#ffffff' // White
+);
+
+downloadSVG(svgContent, 'company-qrcode.svg');
+```
+
+### File Upload and Validation
+
+```javascript
+import { fileToDataURL, validateImageFile } from './src/utils/qrCodeUtils.js';
+
+const fileInput = document.getElementById('file-input');
+const file = fileInput.files[0];
+
+const validation = validateImageFile(file);
+if (validation.success) {
+ const dataUrl = await fileToDataURL(file);
+ // Use dataUrl for QR code generation
+} else {
+ alert(validation.error);
+}
+```
+
+## Vanilla JavaScript Example
+
+See `examples/vanilla-js-example.html` for a complete vanilla JavaScript implementation.
+
+## Development
+
+### Running the Development Server
+
+```bash
+npm run dev
+```
+
+### Building for Production
+
+```bash
+npm run build
+```
+
+### Project Structure
+
+```
+src/
+├── components/
+│ └── TextAreaComponent.jsx # Main React component
+├── utils/
+│ └── qrCodeUtils.js # Pure JavaScript utility functions
+├── App.jsx # React app entry point
+├── main.jsx # React app initialization
+└── style.css # Global styles
+
+examples/
+└── vanilla-js-example.html # Vanilla JavaScript example
+
+dist/ # Production build output
+```
+
+## Dependencies
+
+- **React**: UI framework
+- **Vite**: Build tool and development server
+- **qrcode**: QR code generation library
+- **imagetracer**: Bitmap to vector conversion (optional)
+
+## Browser Support
+
+- Modern browsers with ES6 module support
+- Canvas API support for image processing
+- File API support for file uploads
+
+## License
+
+MIT License - feel free to use this project for any purpose.
+
+## Contributing
+
+1. Fork the repository
+2. Create a feature branch
+3. Make your changes
+4. Add tests if applicable
+5. Submit a pull request
+
+## Changelog
+
+### v1.0.0
+- Initial release
+- QR code generation with custom images
+- SVG export with vectorization
+- React and vanilla JavaScript support
+- Color customization
+- Precise coordinate positioning
\ No newline at end of file
diff --git a/STANDALONE_BUNDLE.md b/STANDALONE_BUNDLE.md
new file mode 100644
index 0000000..1ec9332
--- /dev/null
+++ b/STANDALONE_BUNDLE.md
@@ -0,0 +1,281 @@
+# Standalone QR Code Utils Bundle
+
+A complete, self-contained bundle of the QR Code Generator utilities that includes all dependencies. No external dependencies required!
+
+## 📦 Bundle Files
+
+The standalone build creates three formats in the `dist/` directory:
+
+- **`qr-code-utils.iife.js`** (28 KB) - Immediately Invoked Function Expression (IIFE) for browser use
+- **`qr-code-utils.umd.js`** (28 KB) - Universal Module Definition for Node.js and bundlers
+- **`qr-code-utils.es.js`** (61 KB) - ES Module for modern bundlers and browsers
+
+## 🚀 Quick Start
+
+### Browser (IIFE)
+```html
+
+
+
+ QR Code Generator
+
+
+
+
+
+
+
+
+
+```
+
+### ES Module
+```javascript
+import { generateQRCode, generateCompleteSVGQRCode } from './qr-code-utils.es.js';
+
+// Generate basic QR code
+const qrCode = await generateQRCode('Hello World');
+
+// Generate QR code with custom image
+const svgContent = await generateCompleteSVGQRCode(
+ 'Hello World',
+ 'data:image/png;base64,...', // Custom image
+ 20, // Image size percentage
+ '#000000', // Foreground color
+ '#FFFFFF' // Background color
+);
+```
+
+### Node.js (UMD)
+```javascript
+const { generateQRCode } = require('./qr-code-utils.umd.js');
+
+async function generateQR() {
+ const qrCode = await generateQRCode('Hello World');
+ console.log(qrCode);
+}
+
+generateQR();
+```
+
+## 🔧 Building the Bundle
+
+### Prerequisites
+```bash
+npm install
+```
+
+### Build Commands
+```bash
+# Build standalone bundle
+npm run build:standalone
+
+# Build with detailed info
+npm run build:standalone:info
+```
+
+### Build Configuration
+The standalone bundle is configured in `vite.standalone.config.js`:
+
+- **Entry Point**: `src/utils/qrCodeUtils.js`
+- **Dependencies Included**: `qrcode`, `imagetracer`
+- **Formats**: ES Module, UMD, IIFE
+- **Optimization**: Minified with Terser
+- **Target**: ES2018 for modern browser support
+
+## 📋 Included Functions
+
+### Core QR Code Generation
+- `generateQRCode(text, foregroundColor, backgroundColor)` - Generate PNG QR code
+- `generateSVGQRCode(text, foregroundColor, backgroundColor)` - Generate SVG QR code
+- `generateCompleteSVGQRCode(text, imageUrl, imageSize, foregroundColor, backgroundColor)` - Complete QR code with image
+
+### Image Processing
+- `addImageToQRCode(qrCodeUrl, imageUrl, imageSize)` - Add image to PNG QR code
+- `addImageToSVG(svgString, imageUrl, imageSize)` - Add image to SVG QR code
+- `vectorizeBitmap(img, targetSize, x, y, svgDoc)` - Convert bitmap to vector
+
+### Utilities
+- `downloadSVG(svgContent, filename)` - Download SVG file
+- `fileToDataURL(file)` - Convert file to data URL
+- `validateImageFile(file, maxSize)` - Validate image file
+
+## 🎯 Use Cases
+
+### 1. Static Websites
+```html
+
+
+```
+
+### 2. CDN Distribution
+```html
+
+
+```
+
+### 3. Node.js Applications
+```javascript
+const { generateCompleteSVGQRCode } = require('./qr-code-utils.umd.js');
+
+// Generate QR codes on the server
+const svgContent = await generateCompleteSVGQRCode(
+ 'https://example.com',
+ logoDataUrl,
+ 25,
+ '#1a1a1a',
+ '#ffffff'
+);
+```
+
+### 4. Modern Bundlers (Webpack, Rollup, Vite)
+```javascript
+import { generateQRCode } from './qr-code-utils.es.js';
+
+// Tree-shakeable imports
+const qrCode = await generateQRCode('Hello World');
+```
+
+## 📊 Bundle Analysis
+
+### Size Breakdown
+- **IIFE/UMD**: ~28 KB (gzipped: ~10.5 KB)
+- **ES Module**: ~61 KB (gzipped: ~15 KB)
+- **Source Maps**: ~140 KB each
+
+### Dependencies Included
+- **qrcode**: QR code generation library
+- **imagetracer**: Bitmap to vector conversion
+- **All utilities**: Complete set of helper functions
+
+### Browser Support
+- **ES2018+**: Modern browsers with ES6+ support
+- **Canvas API**: Required for image processing
+- **File API**: Required for file uploads
+- **Blob API**: Required for downloads
+
+## 🔍 Bundle Contents
+
+The standalone bundle includes:
+
+1. **QR Code Generation**: Complete QR code generation with error correction
+2. **Image Processing**: Custom image embedding with white background
+3. **Vectorization**: Bitmap to SVG vector conversion
+4. **File Handling**: File validation and data URL conversion
+5. **Download Utilities**: SVG download functionality
+6. **Error Handling**: Comprehensive error handling and validation
+
+## 🛠️ Customization
+
+### Modify Bundle Configuration
+Edit `vite.standalone.config.js`:
+
+```javascript
+export default defineConfig({
+ build: {
+ lib: {
+ entry: resolve(__dirname, 'src/utils/qrCodeUtils.js'),
+ name: 'QRCodeUtils', // Change global variable name
+ formats: ['es', 'umd', 'iife'], // Choose formats
+ fileName: (format) => `my-qr-utils.${format}.js` // Custom filename
+ },
+ rollupOptions: {
+ external: [], // Add external dependencies if needed
+ output: {
+ globals: {} // Define global variables for externals
+ }
+ }
+ }
+});
+```
+
+### Exclude Dependencies
+To exclude dependencies and use them as externals:
+
+```javascript
+rollupOptions: {
+ external: ['qrcode', 'imagetracer'],
+ output: {
+ globals: {
+ qrcode: 'QRCode',
+ imagetracer: 'ImageTracer'
+ }
+ }
+}
+```
+
+## 🧪 Testing the Bundle
+
+### Browser Test
+1. Build the bundle: `npm run build:standalone`
+2. Open `examples/standalone-bundle-example.html` in a browser
+3. Test all features: QR generation, image upload, SVG export
+
+### Node.js Test
+```javascript
+const { generateQRCode } = require('./dist/qr-code-utils.umd.js');
+
+generateQRCode('Test QR Code')
+ .then(qrCode => console.log('QR Code generated:', qrCode.substring(0, 50) + '...'))
+ .catch(error => console.error('Error:', error));
+```
+
+## 📈 Performance
+
+### Bundle Optimization
+- **Tree Shaking**: ES module format supports tree shaking
+- **Minification**: Terser optimization for smallest bundle size
+- **Source Maps**: Development debugging support
+- **Gzip Compression**: Optimized for network transfer
+
+### Runtime Performance
+- **Async Operations**: All functions return promises for non-blocking execution
+- **Memory Efficient**: Proper cleanup of canvas and blob objects
+- **Error Recovery**: Graceful fallbacks for failed operations
+
+## 🔒 Security
+
+### File Validation
+- **Type Checking**: Validates image file types
+- **Size Limits**: Configurable file size limits
+- **Data URL Safety**: Secure data URL generation
+
+### XSS Prevention
+- **Input Sanitization**: Validates all input parameters
+- **Safe DOM Manipulation**: Uses safe DOM methods
+- **Error Handling**: Prevents information leakage
+
+## 📚 Examples
+
+See the following examples for complete usage:
+
+- `examples/standalone-bundle-example.html` - Complete browser example
+- `examples/vanilla-js-example.html` - Vanilla JavaScript with modules
+- `src/components/TextAreaComponent.jsx` - React component usage
+
+## 🤝 Contributing
+
+To modify the standalone bundle:
+
+1. Update `src/utils/qrCodeUtils.js` with new functions
+2. Test with `npm run build:standalone`
+3. Verify functionality in `examples/standalone-bundle-example.html`
+4. Update documentation as needed
+
+## 📄 License
+
+MIT License - Same as the main project
\ No newline at end of file
diff --git a/dist/assets/index-Bjb0tQZ7.js b/dist/assets/index-Bjb0tQZ7.js
deleted file mode 100644
index b0f7dc9..0000000
--- a/dist/assets/index-Bjb0tQZ7.js
+++ /dev/null
@@ -1,56 +0,0 @@
-(function(){const m=document.createElement("link").relList;if(m&&m.supports&&m.supports("modulepreload"))return;for(const r of document.querySelectorAll('link[rel="modulepreload"]'))c(r);new MutationObserver(r=>{for(const d of r)if(d.type==="childList")for(const M of d.addedNodes)M.tagName==="LINK"&&M.rel==="modulepreload"&&c(M)}).observe(document,{childList:!0,subtree:!0});function b(r){const d={};return r.integrity&&(d.integrity=r.integrity),r.referrerPolicy&&(d.referrerPolicy=r.referrerPolicy),r.crossOrigin==="use-credentials"?d.credentials="include":r.crossOrigin==="anonymous"?d.credentials="omit":d.credentials="same-origin",d}function c(r){if(r.ep)return;r.ep=!0;const d=b(r);fetch(r.href,d)}})();function Bc(s){return s&&s.__esModule&&Object.prototype.hasOwnProperty.call(s,"default")?s.default:s}var uc={exports:{}},Aa={};/**
- * @license React
- * react-jsx-runtime.production.js
- *
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */var O0;function Qh(){if(O0)return Aa;O0=1;var s=Symbol.for("react.transitional.element"),m=Symbol.for("react.fragment");function b(c,r,d){var M=null;if(d!==void 0&&(M=""+d),r.key!==void 0&&(M=""+r.key),"key"in r){d={};for(var R in r)R!=="key"&&(d[R]=r[R])}else d=r;return r=d.ref,{$$typeof:s,type:c,key:M,ref:r!==void 0?r:null,props:d}}return Aa.Fragment=m,Aa.jsx=b,Aa.jsxs=b,Aa}var U0;function jh(){return U0||(U0=1,uc.exports=Qh()),uc.exports}var At=jh(),ac={exports:{}},rt={};/**
- * @license React
- * react.production.js
- *
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */var N0;function Xh(){if(N0)return rt;N0=1;var s=Symbol.for("react.transitional.element"),m=Symbol.for("react.portal"),b=Symbol.for("react.fragment"),c=Symbol.for("react.strict_mode"),r=Symbol.for("react.profiler"),d=Symbol.for("react.consumer"),M=Symbol.for("react.context"),R=Symbol.for("react.forward_ref"),v=Symbol.for("react.suspense"),S=Symbol.for("react.memo"),N=Symbol.for("react.lazy"),G=Symbol.iterator;function B(h){return h===null||typeof h!="object"?null:(h=G&&h[G]||h["@@iterator"],typeof h=="function"?h:null)}var q={isMounted:function(){return!1},enqueueForceUpdate:function(){},enqueueReplaceState:function(){},enqueueSetState:function(){}},W=Object.assign,lt={};function ct(h,p,x){this.props=h,this.context=p,this.refs=lt,this.updater=x||q}ct.prototype.isReactComponent={},ct.prototype.setState=function(h,p){if(typeof h!="object"&&typeof h!="function"&&h!=null)throw Error("takes an object of state variables to update or a function which returns an object of state variables.");this.updater.enqueueSetState(this,h,p,"setState")},ct.prototype.forceUpdate=function(h){this.updater.enqueueForceUpdate(this,h,"forceUpdate")};function K(){}K.prototype=ct.prototype;function P(h,p,x){this.props=h,this.context=p,this.refs=lt,this.updater=x||q}var L=P.prototype=new K;L.constructor=P,W(L,ct.prototype),L.isPureReactComponent=!0;var j=Array.isArray,F={H:null,A:null,T:null,S:null,V:null},H=Object.prototype.hasOwnProperty;function Q(h,p,x,C,I,gt){return x=gt.ref,{$$typeof:s,type:h,key:p,ref:x!==void 0?x:null,props:gt}}function Z(h,p){return Q(h.type,p,void 0,void 0,void 0,h.props)}function X(h){return typeof h=="object"&&h!==null&&h.$$typeof===s}function et(h){var p={"=":"=0",":":"=2"};return"$"+h.replace(/[=:]/g,function(x){return p[x]})}var J=/\/+/g;function V(h,p){return typeof h=="object"&&h!==null&&h.key!=null?et(""+h.key):p.toString(36)}function k(){}function nt(h){switch(h.status){case"fulfilled":return h.value;case"rejected":throw h.reason;default:switch(typeof h.status=="string"?h.then(k,k):(h.status="pending",h.then(function(p){h.status==="pending"&&(h.status="fulfilled",h.value=p)},function(p){h.status==="pending"&&(h.status="rejected",h.reason=p)})),h.status){case"fulfilled":return h.value;case"rejected":throw h.reason}}throw h}function Ot(h,p,x,C,I){var gt=typeof h;(gt==="undefined"||gt==="boolean")&&(h=null);var ft=!1;if(h===null)ft=!0;else switch(gt){case"bigint":case"string":case"number":ft=!0;break;case"object":switch(h.$$typeof){case s:case m:ft=!0;break;case N:return ft=h._init,Ot(ft(h._payload),p,x,C,I)}}if(ft)return I=I(h),ft=C===""?"."+V(h,0):C,j(I)?(x="",ft!=null&&(x=ft.replace(J,"$&/")+"/"),Ot(I,p,x,"",function($t){return $t})):I!=null&&(X(I)&&(I=Z(I,x+(I.key==null||h&&h.key===I.key?"":(""+I.key).replace(J,"$&/")+"/")+ft)),p.push(I)),1;ft=0;var Nt=C===""?".":C+":";if(j(h))for(var yt=0;yt>>1,h=_[bt];if(0>>1;btr(C,tt))Ir(gt,C)?(_[bt]=gt,_[I]=tt,bt=I):(_[bt]=C,_[x]=tt,bt=x);else if(Ir(gt,tt))_[bt]=gt,_[I]=tt,bt=I;else break t}}return Y}function r(_,Y){var tt=_.sortIndex-Y.sortIndex;return tt!==0?tt:_.id-Y.id}if(s.unstable_now=void 0,typeof performance=="object"&&typeof performance.now=="function"){var d=performance;s.unstable_now=function(){return d.now()}}else{var M=Date,R=M.now();s.unstable_now=function(){return M.now()-R}}var v=[],S=[],N=1,G=null,B=3,q=!1,W=!1,lt=!1,ct=!1,K=typeof setTimeout=="function"?setTimeout:null,P=typeof clearTimeout=="function"?clearTimeout:null,L=typeof setImmediate<"u"?setImmediate:null;function j(_){for(var Y=b(S);Y!==null;){if(Y.callback===null)c(S);else if(Y.startTime<=_)c(S),Y.sortIndex=Y.expirationTime,m(v,Y);else break;Y=b(S)}}function F(_){if(lt=!1,j(_),!W)if(b(v)!==null)W=!0,H||(H=!0,V());else{var Y=b(S);Y!==null&&Ot(F,Y.startTime-_)}}var H=!1,Q=-1,Z=5,X=-1;function et(){return ct?!0:!(s.unstable_now()-X_&&et());){var bt=G.callback;if(typeof bt=="function"){G.callback=null,B=G.priorityLevel;var h=bt(G.expirationTime<=_);if(_=s.unstable_now(),typeof h=="function"){G.callback=h,j(_),Y=!0;break l}G===b(v)&&c(v),j(_)}else c(v);G=b(v)}if(G!==null)Y=!0;else{var p=b(S);p!==null&&Ot(F,p.startTime-_),Y=!1}}break t}finally{G=null,B=tt,q=!1}Y=void 0}}finally{Y?V():H=!1}}}var V;if(typeof L=="function")V=function(){L(J)};else if(typeof MessageChannel<"u"){var k=new MessageChannel,nt=k.port2;k.port1.onmessage=J,V=function(){nt.postMessage(null)}}else V=function(){K(J,0)};function Ot(_,Y){Q=K(function(){_(s.unstable_now())},Y)}s.unstable_IdlePriority=5,s.unstable_ImmediatePriority=1,s.unstable_LowPriority=4,s.unstable_NormalPriority=3,s.unstable_Profiling=null,s.unstable_UserBlockingPriority=2,s.unstable_cancelCallback=function(_){_.callback=null},s.unstable_forceFrameRate=function(_){0>_||125<_?console.error("forceFrameRate takes a positive int between 0 and 125, forcing frame rates higher than 125 fps is not supported"):Z=0<_?Math.floor(1e3/_):5},s.unstable_getCurrentPriorityLevel=function(){return B},s.unstable_next=function(_){switch(B){case 1:case 2:case 3:var Y=3;break;default:Y=B}var tt=B;B=Y;try{return _()}finally{B=tt}},s.unstable_requestPaint=function(){ct=!0},s.unstable_runWithPriority=function(_,Y){switch(_){case 1:case 2:case 3:case 4:case 5:break;default:_=3}var tt=B;B=_;try{return Y()}finally{B=tt}},s.unstable_scheduleCallback=function(_,Y,tt){var bt=s.unstable_now();switch(typeof tt=="object"&&tt!==null?(tt=tt.delay,tt=typeof tt=="number"&&0bt?(_.sortIndex=tt,m(S,_),b(v)===null&&_===b(S)&&(lt?(P(Q),Q=-1):lt=!0,Ot(F,tt-bt))):(_.sortIndex=h,m(v,_),W||q||(W=!0,H||(H=!0,V()))),_},s.unstable_shouldYield=et,s.unstable_wrapCallback=function(_){var Y=B;return function(){var tt=B;B=Y;try{return _.apply(this,arguments)}finally{B=tt}}}}(fc)),fc}var C0;function Zh(){return C0||(C0=1,ic.exports=Lh()),ic.exports}var cc={exports:{}},kt={};/**
- * @license React
- * react-dom.production.js
- *
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */var q0;function Vh(){if(q0)return kt;q0=1;var s=Cc();function m(v){var S="https://react.dev/errors/"+v;if(1"u"||typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE!="function"))try{__REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE(s)}catch(m){console.error(m)}}return s(),cc.exports=Vh(),cc.exports}/**
- * @license React
- * react-dom-client.production.js
- *
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */var Y0;function Kh(){if(Y0)return Ma;Y0=1;var s=Zh(),m=Cc(),b=wh();function c(t){var l="https://react.dev/errors/"+t;if(1h||(t.current=bt[h],bt[h]=null,h--)}function C(t,l){h++,bt[h]=t.current,t.current=l}var I=p(null),gt=p(null),ft=p(null),Nt=p(null);function yt(t,l){switch(C(ft,l),C(gt,t),C(I,null),l.nodeType){case 9:case 11:t=(t=l.documentElement)&&(t=t.namespaceURI)?e0(t):0;break;default:if(t=l.tagName,l=l.namespaceURI)l=e0(l),t=u0(l,t);else switch(t){case"svg":t=1;break;case"math":t=2;break;default:t=0}}x(I),C(I,t)}function $t(){x(I),x(gt),x(ft)}function Se(t){t.memoizedState!==null&&C(Nt,t);var l=I.current,e=u0(l,t.type);l!==e&&(C(gt,t),C(I,e))}function Ra(t){gt.current===t&&(x(I),x(gt)),Nt.current===t&&(x(Nt),ma._currentValue=tt)}var Ln=Object.prototype.hasOwnProperty,Zn=s.unstable_scheduleCallback,Vn=s.unstable_cancelCallback,vd=s.unstable_shouldYield,md=s.unstable_requestPaint,zl=s.unstable_now,Sd=s.unstable_getCurrentPriorityLevel,Hc=s.unstable_ImmediatePriority,Yc=s.unstable_UserBlockingPriority,_a=s.unstable_NormalPriority,bd=s.unstable_LowPriority,Gc=s.unstable_IdlePriority,Ed=s.log,Td=s.unstable_setDisableYieldValue,Ru=null,ul=null;function Kl(t){if(typeof Ed=="function"&&Td(t),ul&&typeof ul.setStrictMode=="function")try{ul.setStrictMode(Ru,t)}catch{}}var al=Math.clz32?Math.clz32:zd,Ad=Math.log,Md=Math.LN2;function zd(t){return t>>>=0,t===0?32:31-(Ad(t)/Md|0)|0}var Da=256,Oa=4194304;function be(t){var l=t&42;if(l!==0)return l;switch(t&-t){case 1:return 1;case 2:return 2;case 4:return 4;case 8:return 8;case 16:return 16;case 32:return 32;case 64:return 64;case 128:return 128;case 256:case 512:case 1024:case 2048:case 4096:case 8192:case 16384:case 32768:case 65536:case 131072:case 262144:case 524288:case 1048576:case 2097152:return t&4194048;case 4194304:case 8388608:case 16777216:case 33554432:return t&62914560;case 67108864:return 67108864;case 134217728:return 134217728;case 268435456:return 268435456;case 536870912:return 536870912;case 1073741824:return 0;default:return t}}function Ua(t,l,e){var u=t.pendingLanes;if(u===0)return 0;var a=0,n=t.suspendedLanes,i=t.pingedLanes;t=t.warmLanes;var f=u&134217727;return f!==0?(u=f&~n,u!==0?a=be(u):(i&=f,i!==0?a=be(i):e||(e=f&~t,e!==0&&(a=be(e))))):(f=u&~n,f!==0?a=be(f):i!==0?a=be(i):e||(e=u&~t,e!==0&&(a=be(e)))),a===0?0:l!==0&&l!==a&&(l&n)===0&&(n=a&-a,e=l&-l,n>=e||n===32&&(e&4194048)!==0)?l:a}function _u(t,l){return(t.pendingLanes&~(t.suspendedLanes&~t.pingedLanes)&l)===0}function Rd(t,l){switch(t){case 1:case 2:case 4:case 8:case 64:return l+250;case 16:case 32:case 128:case 256:case 512:case 1024:case 2048:case 4096:case 8192:case 16384:case 32768:case 65536:case 131072:case 262144:case 524288:case 1048576:case 2097152:return l+5e3;case 4194304:case 8388608:case 16777216:case 33554432:return-1;case 67108864:case 134217728:case 268435456:case 536870912:case 1073741824:return-1;default:return-1}}function Qc(){var t=Da;return Da<<=1,(Da&4194048)===0&&(Da=256),t}function jc(){var t=Oa;return Oa<<=1,(Oa&62914560)===0&&(Oa=4194304),t}function wn(t){for(var l=[],e=0;31>e;e++)l.push(t);return l}function Du(t,l){t.pendingLanes|=l,l!==268435456&&(t.suspendedLanes=0,t.pingedLanes=0,t.warmLanes=0)}function _d(t,l,e,u,a,n){var i=t.pendingLanes;t.pendingLanes=e,t.suspendedLanes=0,t.pingedLanes=0,t.warmLanes=0,t.expiredLanes&=e,t.entangledLanes&=e,t.errorRecoveryDisabledLanes&=e,t.shellSuspendCounter=0;var f=t.entanglements,o=t.expirationTimes,T=t.hiddenUpdates;for(e=i&~e;0)":-1a||o[u]!==T[a]){var D=`
-`+o[u].replace(" at new "," at ");return t.displayName&&D.includes("")&&(D=D.replace("",t.displayName)),D}while(1<=u&&0<=a);break}}}finally{Fn=!1,Error.prepareStackTrace=e}return(e=t?t.displayName||t.name:"")?Ve(e):""}function Bd(t){switch(t.tag){case 26:case 27:case 5:return Ve(t.type);case 16:return Ve("Lazy");case 13:return Ve("Suspense");case 19:return Ve("SuspenseList");case 0:case 15:return In(t.type,!1);case 11:return In(t.type.render,!1);case 1:return In(t.type,!0);case 31:return Ve("Activity");default:return""}}function kc(t){try{var l="";do l+=Bd(t),t=t.return;while(t);return l}catch(e){return`
-Error generating stack: `+e.message+`
-`+e.stack}}function dl(t){switch(typeof t){case"bigint":case"boolean":case"number":case"string":case"undefined":return t;case"object":return t;default:return""}}function $c(t){var l=t.type;return(t=t.nodeName)&&t.toLowerCase()==="input"&&(l==="checkbox"||l==="radio")}function Cd(t){var l=$c(t)?"checked":"value",e=Object.getOwnPropertyDescriptor(t.constructor.prototype,l),u=""+t[l];if(!t.hasOwnProperty(l)&&typeof e<"u"&&typeof e.get=="function"&&typeof e.set=="function"){var a=e.get,n=e.set;return Object.defineProperty(t,l,{configurable:!0,get:function(){return a.call(this)},set:function(i){u=""+i,n.call(this,i)}}),Object.defineProperty(t,l,{enumerable:e.enumerable}),{getValue:function(){return u},setValue:function(i){u=""+i},stopTracking:function(){t._valueTracker=null,delete t[l]}}}}function Ba(t){t._valueTracker||(t._valueTracker=Cd(t))}function Fc(t){if(!t)return!1;var l=t._valueTracker;if(!l)return!0;var e=l.getValue(),u="";return t&&(u=$c(t)?t.checked?"true":"false":t.value),t=u,t!==e?(l.setValue(t),!0):!1}function Ca(t){if(t=t||(typeof document<"u"?document:void 0),typeof t>"u")return null;try{return t.activeElement||t.body}catch{return t.body}}var qd=/[\n"\\]/g;function hl(t){return t.replace(qd,function(l){return"\\"+l.charCodeAt(0).toString(16)+" "})}function Pn(t,l,e,u,a,n,i,f){t.name="",i!=null&&typeof i!="function"&&typeof i!="symbol"&&typeof i!="boolean"?t.type=i:t.removeAttribute("type"),l!=null?i==="number"?(l===0&&t.value===""||t.value!=l)&&(t.value=""+dl(l)):t.value!==""+dl(l)&&(t.value=""+dl(l)):i!=="submit"&&i!=="reset"||t.removeAttribute("value"),l!=null?ti(t,i,dl(l)):e!=null?ti(t,i,dl(e)):u!=null&&t.removeAttribute("value"),a==null&&n!=null&&(t.defaultChecked=!!n),a!=null&&(t.checked=a&&typeof a!="function"&&typeof a!="symbol"),f!=null&&typeof f!="function"&&typeof f!="symbol"&&typeof f!="boolean"?t.name=""+dl(f):t.removeAttribute("name")}function Ic(t,l,e,u,a,n,i,f){if(n!=null&&typeof n!="function"&&typeof n!="symbol"&&typeof n!="boolean"&&(t.type=n),l!=null||e!=null){if(!(n!=="submit"&&n!=="reset"||l!=null))return;e=e!=null?""+dl(e):"",l=l!=null?""+dl(l):e,f||l===t.value||(t.value=l),t.defaultValue=l}u=u??a,u=typeof u!="function"&&typeof u!="symbol"&&!!u,t.checked=f?t.checked:!!u,t.defaultChecked=!!u,i!=null&&typeof i!="function"&&typeof i!="symbol"&&typeof i!="boolean"&&(t.name=i)}function ti(t,l,e){l==="number"&&Ca(t.ownerDocument)===t||t.defaultValue===""+e||(t.defaultValue=""+e)}function we(t,l,e,u){if(t=t.options,l){l={};for(var a=0;a"u"||typeof window.document>"u"||typeof window.document.createElement>"u"),ni=!1;if(Bl)try{var pu={};Object.defineProperty(pu,"passive",{get:function(){ni=!0}}),window.addEventListener("test",pu,pu),window.removeEventListener("test",pu,pu)}catch{ni=!1}var Wl=null,ii=null,Ha=null;function nr(){if(Ha)return Ha;var t,l=ii,e=l.length,u,a="value"in Wl?Wl.value:Wl.textContent,n=a.length;for(t=0;t=qu),sr=" ",dr=!1;function hr(t,l){switch(t){case"keyup":return c1.indexOf(l.keyCode)!==-1;case"keydown":return l.keyCode!==229;case"keypress":case"mousedown":case"focusout":return!0;default:return!1}}function gr(t){return t=t.detail,typeof t=="object"&&"data"in t?t.data:null}var ke=!1;function o1(t,l){switch(t){case"compositionend":return gr(l);case"keypress":return l.which!==32?null:(dr=!0,sr);case"textInput":return t=l.data,t===sr&&dr?null:t;default:return null}}function s1(t,l){if(ke)return t==="compositionend"||!si&&hr(t,l)?(t=nr(),Ha=ii=Wl=null,ke=!1,t):null;switch(t){case"paste":return null;case"keypress":if(!(l.ctrlKey||l.altKey||l.metaKey)||l.ctrlKey&&l.altKey){if(l.char&&1=l)return{node:e,offset:l-t};t=u}t:{for(;e;){if(e.nextSibling){e=e.nextSibling;break t}e=e.parentNode}e=void 0}e=Ar(e)}}function zr(t,l){return t&&l?t===l?!0:t&&t.nodeType===3?!1:l&&l.nodeType===3?zr(t,l.parentNode):"contains"in t?t.contains(l):t.compareDocumentPosition?!!(t.compareDocumentPosition(l)&16):!1:!1}function Rr(t){t=t!=null&&t.ownerDocument!=null&&t.ownerDocument.defaultView!=null?t.ownerDocument.defaultView:window;for(var l=Ca(t.document);l instanceof t.HTMLIFrameElement;){try{var e=typeof l.contentWindow.location.href=="string"}catch{e=!1}if(e)t=l.contentWindow;else break;l=Ca(t.document)}return l}function gi(t){var l=t&&t.nodeName&&t.nodeName.toLowerCase();return l&&(l==="input"&&(t.type==="text"||t.type==="search"||t.type==="tel"||t.type==="url"||t.type==="password")||l==="textarea"||t.contentEditable==="true")}var b1=Bl&&"documentMode"in document&&11>=document.documentMode,$e=null,yi=null,Qu=null,vi=!1;function _r(t,l,e){var u=e.window===e?e.document:e.nodeType===9?e:e.ownerDocument;vi||$e==null||$e!==Ca(u)||(u=$e,"selectionStart"in u&&gi(u)?u={start:u.selectionStart,end:u.selectionEnd}:(u=(u.ownerDocument&&u.ownerDocument.defaultView||window).getSelection(),u={anchorNode:u.anchorNode,anchorOffset:u.anchorOffset,focusNode:u.focusNode,focusOffset:u.focusOffset}),Qu&&Gu(Qu,u)||(Qu=u,u=_n(yi,"onSelect"),0>=i,a-=i,ql=1<<32-al(l)+a|e<n?n:8;var i=_.T,f={};_.T=f,lf(t,!1,l,e);try{var o=a(),T=_.S;if(T!==null&&T(f,o),o!==null&&typeof o=="object"&&typeof o.then=="function"){var D=O1(o,u);Pu(t,l,D,ol(t))}else Pu(t,l,u,ol(t))}catch(U){Pu(t,l,{then:function(){},status:"rejected",reason:U},ol())}finally{Y.p=n,_.T=i}}function C1(){}function Pi(t,l,e,u){if(t.tag!==5)throw Error(c(476));var a=Oo(t).queue;Do(t,a,l,tt,e===null?C1:function(){return Uo(t),e(u)})}function Oo(t){var l=t.memoizedState;if(l!==null)return l;l={memoizedState:tt,baseState:tt,baseQueue:null,queue:{pending:null,lanes:0,dispatch:null,lastRenderedReducer:Ql,lastRenderedState:tt},next:null};var e={};return l.next={memoizedState:e,baseState:e,baseQueue:null,queue:{pending:null,lanes:0,dispatch:null,lastRenderedReducer:Ql,lastRenderedState:e},next:null},t.memoizedState=l,t=t.alternate,t!==null&&(t.memoizedState=l),l}function Uo(t){var l=Oo(t).next.queue;Pu(t,l,{},ol())}function tf(){return Wt(ma)}function No(){return Gt().memoizedState}function po(){return Gt().memoizedState}function q1(t){for(var l=t.return;l!==null;){switch(l.tag){case 24:case 3:var e=ol();t=Fl(e);var u=Il(l,t,e);u!==null&&(sl(u,l,e),Ju(u,l,e)),l={cache:Ni()},t.payload=l;return}l=l.return}}function H1(t,l,e){var u=ol();e={lane:u,revertLane:0,action:e,hasEagerState:!1,eagerState:null,next:null},nn(t)?Co(l,e):(e=Ei(t,l,e,u),e!==null&&(sl(e,t,u),qo(e,l,u)))}function Bo(t,l,e){var u=ol();Pu(t,l,e,u)}function Pu(t,l,e,u){var a={lane:u,revertLane:0,action:e,hasEagerState:!1,eagerState:null,next:null};if(nn(t))Co(l,a);else{var n=t.alternate;if(t.lanes===0&&(n===null||n.lanes===0)&&(n=l.lastRenderedReducer,n!==null))try{var i=l.lastRenderedState,f=n(i,e);if(a.hasEagerState=!0,a.eagerState=f,nl(f,i))return La(t,l,a,0),Dt===null&&xa(),!1}catch{}finally{}if(e=Ei(t,l,a,u),e!==null)return sl(e,t,u),qo(e,l,u),!0}return!1}function lf(t,l,e,u){if(u={lane:2,revertLane:qf(),action:u,hasEagerState:!1,eagerState:null,next:null},nn(t)){if(l)throw Error(c(479))}else l=Ei(t,e,u,2),l!==null&&sl(l,t,2)}function nn(t){var l=t.alternate;return t===ot||l!==null&&l===ot}function Co(t,l){iu=Pa=!0;var e=t.pending;e===null?l.next=l:(l.next=e.next,e.next=l),t.pending=l}function qo(t,l,e){if((e&4194048)!==0){var u=l.lanes;u&=t.pendingLanes,e|=u,l.lanes=e,xc(t,e)}}var fn={readContext:Wt,use:ln,useCallback:qt,useContext:qt,useEffect:qt,useImperativeHandle:qt,useLayoutEffect:qt,useInsertionEffect:qt,useMemo:qt,useReducer:qt,useRef:qt,useState:qt,useDebugValue:qt,useDeferredValue:qt,useTransition:qt,useSyncExternalStore:qt,useId:qt,useHostTransitionStatus:qt,useFormState:qt,useActionState:qt,useOptimistic:qt,useMemoCache:qt,useCacheRefresh:qt},Ho={readContext:Wt,use:ln,useCallback:function(t,l){return tl().memoizedState=[t,l===void 0?null:l],t},useContext:Wt,useEffect:So,useImperativeHandle:function(t,l,e){e=e!=null?e.concat([t]):null,an(4194308,4,Ao.bind(null,l,t),e)},useLayoutEffect:function(t,l){return an(4194308,4,t,l)},useInsertionEffect:function(t,l){an(4,2,t,l)},useMemo:function(t,l){var e=tl();l=l===void 0?null:l;var u=t();if(Be){Kl(!0);try{t()}finally{Kl(!1)}}return e.memoizedState=[u,l],u},useReducer:function(t,l,e){var u=tl();if(e!==void 0){var a=e(l);if(Be){Kl(!0);try{e(l)}finally{Kl(!1)}}}else a=l;return u.memoizedState=u.baseState=a,t={pending:null,lanes:0,dispatch:null,lastRenderedReducer:t,lastRenderedState:a},u.queue=t,t=t.dispatch=H1.bind(null,ot,t),[u.memoizedState,t]},useRef:function(t){var l=tl();return t={current:t},l.memoizedState=t},useState:function(t){t=ki(t);var l=t.queue,e=Bo.bind(null,ot,l);return l.dispatch=e,[t.memoizedState,e]},useDebugValue:Fi,useDeferredValue:function(t,l){var e=tl();return Ii(e,t,l)},useTransition:function(){var t=ki(!1);return t=Do.bind(null,ot,t.queue,!0,!1),tl().memoizedState=t,[!1,t]},useSyncExternalStore:function(t,l,e){var u=ot,a=tl();if(St){if(e===void 0)throw Error(c(407));e=e()}else{if(e=l(),Dt===null)throw Error(c(349));(vt&124)!==0||lo(u,l,e)}a.memoizedState=e;var n={value:e,getSnapshot:l};return a.queue=n,So(uo.bind(null,u,n,t),[t]),u.flags|=2048,cu(9,un(),eo.bind(null,u,n,e,l),null),e},useId:function(){var t=tl(),l=Dt.identifierPrefix;if(St){var e=Hl,u=ql;e=(u&~(1<<32-al(u)-1)).toString(32)+e,l="«"+l+"R"+e,e=tn++,0at?(Zt=$,$=null):Zt=$.sibling;var mt=A(y,$,E[at],O);if(mt===null){$===null&&($=Zt);break}t&&$&&mt.alternate===null&&l(y,$),g=n(mt,g,at),st===null?w=mt:st.sibling=mt,st=mt,$=Zt}if(at===E.length)return e(y,$),St&&_e(y,at),w;if($===null){for(;atat?(Zt=$,$=null):Zt=$.sibling;var ye=A(y,$,mt.value,O);if(ye===null){$===null&&($=Zt);break}t&&$&&ye.alternate===null&&l(y,$),g=n(ye,g,at),st===null?w=ye:st.sibling=ye,st=ye,$=Zt}if(mt.done)return e(y,$),St&&_e(y,at),w;if($===null){for(;!mt.done;at++,mt=E.next())mt=U(y,mt.value,O),mt!==null&&(g=n(mt,g,at),st===null?w=mt:st.sibling=mt,st=mt);return St&&_e(y,at),w}for($=u($);!mt.done;at++,mt=E.next())mt=z($,y,at,mt.value,O),mt!==null&&(t&&mt.alternate!==null&&$.delete(mt.key===null?at:mt.key),g=n(mt,g,at),st===null?w=mt:st.sibling=mt,st=mt);return t&&$.forEach(function(Gh){return l(y,Gh)}),St&&_e(y,at),w}function Rt(y,g,E,O){if(typeof E=="object"&&E!==null&&E.type===W&&E.key===null&&(E=E.props.children),typeof E=="object"&&E!==null){switch(E.$$typeof){case B:t:{for(var w=E.key;g!==null;){if(g.key===w){if(w=E.type,w===W){if(g.tag===7){e(y,g.sibling),O=a(g,E.props.children),O.return=y,y=O;break t}}else if(g.elementType===w||typeof w=="object"&&w!==null&&w.$$typeof===Z&&Go(w)===g.type){e(y,g.sibling),O=a(g,E.props),la(O,E),O.return=y,y=O;break t}e(y,g);break}else l(y,g);g=g.sibling}E.type===W?(O=ze(E.props.children,y.mode,O,E.key),O.return=y,y=O):(O=Va(E.type,E.key,E.props,null,y.mode,O),la(O,E),O.return=y,y=O)}return i(y);case q:t:{for(w=E.key;g!==null;){if(g.key===w)if(g.tag===4&&g.stateNode.containerInfo===E.containerInfo&&g.stateNode.implementation===E.implementation){e(y,g.sibling),O=a(g,E.children||[]),O.return=y,y=O;break t}else{e(y,g);break}else l(y,g);g=g.sibling}O=Mi(E,y.mode,O),O.return=y,y=O}return i(y);case Z:return w=E._init,E=w(E._payload),Rt(y,g,E,O)}if(Ot(E))return it(y,g,E,O);if(V(E)){if(w=V(E),typeof w!="function")throw Error(c(150));return E=w.call(E),ut(y,g,E,O)}if(typeof E.then=="function")return Rt(y,g,cn(E),O);if(E.$$typeof===L)return Rt(y,g,Wa(y,E),O);rn(y,E)}return typeof E=="string"&&E!==""||typeof E=="number"||typeof E=="bigint"?(E=""+E,g!==null&&g.tag===6?(e(y,g.sibling),O=a(g,E),O.return=y,y=O):(e(y,g),O=Ai(E,y.mode,O),O.return=y,y=O),i(y)):e(y,g)}return function(y,g,E,O){try{ta=0;var w=Rt(y,g,E,O);return ru=null,w}catch($){if($===wu||$===$a)throw $;var st=il(29,$,null,y.mode);return st.lanes=O,st.return=y,st}finally{}}}var ou=Qo(!0),jo=Qo(!1),Sl=p(null),_l=null;function te(t){var l=t.alternate;C(jt,jt.current&1),C(Sl,t),_l===null&&(l===null||nu.current!==null||l.memoizedState!==null)&&(_l=t)}function Xo(t){if(t.tag===22){if(C(jt,jt.current),C(Sl,t),_l===null){var l=t.alternate;l!==null&&l.memoizedState!==null&&(_l=t)}}else le()}function le(){C(jt,jt.current),C(Sl,Sl.current)}function jl(t){x(Sl),_l===t&&(_l=null),x(jt)}var jt=p(0);function on(t){for(var l=t;l!==null;){if(l.tag===13){var e=l.memoizedState;if(e!==null&&(e=e.dehydrated,e===null||e.data==="$?"||Kf(e)))return l}else if(l.tag===19&&l.memoizedProps.revealOrder!==void 0){if((l.flags&128)!==0)return l}else if(l.child!==null){l.child.return=l,l=l.child;continue}if(l===t)break;for(;l.sibling===null;){if(l.return===null||l.return===t)return null;l=l.return}l.sibling.return=l.return,l=l.sibling}return null}function ef(t,l,e,u){l=t.memoizedState,e=e(u,l),e=e==null?l:N({},l,e),t.memoizedState=e,t.lanes===0&&(t.updateQueue.baseState=e)}var uf={enqueueSetState:function(t,l,e){t=t._reactInternals;var u=ol(),a=Fl(u);a.payload=l,e!=null&&(a.callback=e),l=Il(t,a,u),l!==null&&(sl(l,t,u),Ju(l,t,u))},enqueueReplaceState:function(t,l,e){t=t._reactInternals;var u=ol(),a=Fl(u);a.tag=1,a.payload=l,e!=null&&(a.callback=e),l=Il(t,a,u),l!==null&&(sl(l,t,u),Ju(l,t,u))},enqueueForceUpdate:function(t,l){t=t._reactInternals;var e=ol(),u=Fl(e);u.tag=2,l!=null&&(u.callback=l),l=Il(t,u,e),l!==null&&(sl(l,t,e),Ju(l,t,e))}};function xo(t,l,e,u,a,n,i){return t=t.stateNode,typeof t.shouldComponentUpdate=="function"?t.shouldComponentUpdate(u,n,i):l.prototype&&l.prototype.isPureReactComponent?!Gu(e,u)||!Gu(a,n):!0}function Lo(t,l,e,u){t=l.state,typeof l.componentWillReceiveProps=="function"&&l.componentWillReceiveProps(e,u),typeof l.UNSAFE_componentWillReceiveProps=="function"&&l.UNSAFE_componentWillReceiveProps(e,u),l.state!==t&&uf.enqueueReplaceState(l,l.state,null)}function Ce(t,l){var e=l;if("ref"in l){e={};for(var u in l)u!=="ref"&&(e[u]=l[u])}if(t=t.defaultProps){e===l&&(e=N({},e));for(var a in t)e[a]===void 0&&(e[a]=t[a])}return e}var sn=typeof reportError=="function"?reportError:function(t){if(typeof window=="object"&&typeof window.ErrorEvent=="function"){var l=new window.ErrorEvent("error",{bubbles:!0,cancelable:!0,message:typeof t=="object"&&t!==null&&typeof t.message=="string"?String(t.message):String(t),error:t});if(!window.dispatchEvent(l))return}else if(typeof process=="object"&&typeof process.emit=="function"){process.emit("uncaughtException",t);return}console.error(t)};function Zo(t){sn(t)}function Vo(t){console.error(t)}function wo(t){sn(t)}function dn(t,l){try{var e=t.onUncaughtError;e(l.value,{componentStack:l.stack})}catch(u){setTimeout(function(){throw u})}}function Ko(t,l,e){try{var u=t.onCaughtError;u(e.value,{componentStack:e.stack,errorBoundary:l.tag===1?l.stateNode:null})}catch(a){setTimeout(function(){throw a})}}function af(t,l,e){return e=Fl(e),e.tag=3,e.payload={element:null},e.callback=function(){dn(t,l)},e}function Jo(t){return t=Fl(t),t.tag=3,t}function Wo(t,l,e,u){var a=e.type.getDerivedStateFromError;if(typeof a=="function"){var n=u.value;t.payload=function(){return a(n)},t.callback=function(){Ko(l,e,u)}}var i=e.stateNode;i!==null&&typeof i.componentDidCatch=="function"&&(t.callback=function(){Ko(l,e,u),typeof a!="function"&&(fe===null?fe=new Set([this]):fe.add(this));var f=u.stack;this.componentDidCatch(u.value,{componentStack:f!==null?f:""})})}function G1(t,l,e,u,a){if(e.flags|=32768,u!==null&&typeof u=="object"&&typeof u.then=="function"){if(l=e.alternate,l!==null&&Lu(l,e,a,!0),e=Sl.current,e!==null){switch(e.tag){case 13:return _l===null?Uf():e.alternate===null&&Ct===0&&(Ct=3),e.flags&=-257,e.flags|=65536,e.lanes=a,u===Ci?e.flags|=16384:(l=e.updateQueue,l===null?e.updateQueue=new Set([u]):l.add(u),pf(t,u,a)),!1;case 22:return e.flags|=65536,u===Ci?e.flags|=16384:(l=e.updateQueue,l===null?(l={transitions:null,markerInstances:null,retryQueue:new Set([u])},e.updateQueue=l):(e=l.retryQueue,e===null?l.retryQueue=new Set([u]):e.add(u)),pf(t,u,a)),!1}throw Error(c(435,e.tag))}return pf(t,u,a),Uf(),!1}if(St)return l=Sl.current,l!==null?((l.flags&65536)===0&&(l.flags|=256),l.flags|=65536,l.lanes=a,u!==_i&&(t=Error(c(422),{cause:u}),xu(gl(t,e)))):(u!==_i&&(l=Error(c(423),{cause:u}),xu(gl(l,e))),t=t.current.alternate,t.flags|=65536,a&=-a,t.lanes|=a,u=gl(u,e),a=af(t.stateNode,u,a),Yi(t,a),Ct!==4&&(Ct=2)),!1;var n=Error(c(520),{cause:u});if(n=gl(n,e),ca===null?ca=[n]:ca.push(n),Ct!==4&&(Ct=2),l===null)return!0;u=gl(u,e),e=l;do{switch(e.tag){case 3:return e.flags|=65536,t=a&-a,e.lanes|=t,t=af(e.stateNode,u,t),Yi(e,t),!1;case 1:if(l=e.type,n=e.stateNode,(e.flags&128)===0&&(typeof l.getDerivedStateFromError=="function"||n!==null&&typeof n.componentDidCatch=="function"&&(fe===null||!fe.has(n))))return e.flags|=65536,a&=-a,e.lanes|=a,a=Jo(a),Wo(a,t,e,u),Yi(e,a),!1}e=e.return}while(e!==null);return!1}var ko=Error(c(461)),xt=!1;function Vt(t,l,e,u){l.child=t===null?jo(l,null,e,u):ou(l,t.child,e,u)}function $o(t,l,e,u,a){e=e.render;var n=l.ref;if("ref"in u){var i={};for(var f in u)f!=="ref"&&(i[f]=u[f])}else i=u;return Ne(l),u=xi(t,l,e,i,n,a),f=Li(),t!==null&&!xt?(Zi(t,l,a),Xl(t,l,a)):(St&&f&&zi(l),l.flags|=1,Vt(t,l,u,a),l.child)}function Fo(t,l,e,u,a){if(t===null){var n=e.type;return typeof n=="function"&&!Ti(n)&&n.defaultProps===void 0&&e.compare===null?(l.tag=15,l.type=n,Io(t,l,n,u,a)):(t=Va(e.type,null,u,l,l.mode,a),t.ref=l.ref,t.return=l,l.child=t)}if(n=t.child,!hf(t,a)){var i=n.memoizedProps;if(e=e.compare,e=e!==null?e:Gu,e(i,u)&&t.ref===l.ref)return Xl(t,l,a)}return l.flags|=1,t=Cl(n,u),t.ref=l.ref,t.return=l,l.child=t}function Io(t,l,e,u,a){if(t!==null){var n=t.memoizedProps;if(Gu(n,u)&&t.ref===l.ref)if(xt=!1,l.pendingProps=u=n,hf(t,a))(t.flags&131072)!==0&&(xt=!0);else return l.lanes=t.lanes,Xl(t,l,a)}return nf(t,l,e,u,a)}function Po(t,l,e){var u=l.pendingProps,a=u.children,n=t!==null?t.memoizedState:null;if(u.mode==="hidden"){if((l.flags&128)!==0){if(u=n!==null?n.baseLanes|e:e,t!==null){for(a=l.child=t.child,n=0;a!==null;)n=n|a.lanes|a.childLanes,a=a.sibling;l.childLanes=n&~u}else l.childLanes=0,l.child=null;return ts(t,l,u,e)}if((e&536870912)!==0)l.memoizedState={baseLanes:0,cachePool:null},t!==null&&ka(l,n!==null?n.cachePool:null),n!==null?Fr(l,n):Qi(),Xo(l);else return l.lanes=l.childLanes=536870912,ts(t,l,n!==null?n.baseLanes|e:e,e)}else n!==null?(ka(l,n.cachePool),Fr(l,n),le(),l.memoizedState=null):(t!==null&&ka(l,null),Qi(),le());return Vt(t,l,a,e),l.child}function ts(t,l,e,u){var a=Bi();return a=a===null?null:{parent:Qt._currentValue,pool:a},l.memoizedState={baseLanes:e,cachePool:a},t!==null&&ka(l,null),Qi(),Xo(l),t!==null&&Lu(t,l,u,!0),null}function hn(t,l){var e=l.ref;if(e===null)t!==null&&t.ref!==null&&(l.flags|=4194816);else{if(typeof e!="function"&&typeof e!="object")throw Error(c(284));(t===null||t.ref!==e)&&(l.flags|=4194816)}}function nf(t,l,e,u,a){return Ne(l),e=xi(t,l,e,u,void 0,a),u=Li(),t!==null&&!xt?(Zi(t,l,a),Xl(t,l,a)):(St&&u&&zi(l),l.flags|=1,Vt(t,l,e,a),l.child)}function ls(t,l,e,u,a,n){return Ne(l),l.updateQueue=null,e=Pr(l,u,e,a),Ir(t),u=Li(),t!==null&&!xt?(Zi(t,l,n),Xl(t,l,n)):(St&&u&&zi(l),l.flags|=1,Vt(t,l,e,n),l.child)}function es(t,l,e,u,a){if(Ne(l),l.stateNode===null){var n=tu,i=e.contextType;typeof i=="object"&&i!==null&&(n=Wt(i)),n=new e(u,n),l.memoizedState=n.state!==null&&n.state!==void 0?n.state:null,n.updater=uf,l.stateNode=n,n._reactInternals=l,n=l.stateNode,n.props=u,n.state=l.memoizedState,n.refs={},qi(l),i=e.contextType,n.context=typeof i=="object"&&i!==null?Wt(i):tu,n.state=l.memoizedState,i=e.getDerivedStateFromProps,typeof i=="function"&&(ef(l,e,i,u),n.state=l.memoizedState),typeof e.getDerivedStateFromProps=="function"||typeof n.getSnapshotBeforeUpdate=="function"||typeof n.UNSAFE_componentWillMount!="function"&&typeof n.componentWillMount!="function"||(i=n.state,typeof n.componentWillMount=="function"&&n.componentWillMount(),typeof n.UNSAFE_componentWillMount=="function"&&n.UNSAFE_componentWillMount(),i!==n.state&&uf.enqueueReplaceState(n,n.state,null),ku(l,u,n,a),Wu(),n.state=l.memoizedState),typeof n.componentDidMount=="function"&&(l.flags|=4194308),u=!0}else if(t===null){n=l.stateNode;var f=l.memoizedProps,o=Ce(e,f);n.props=o;var T=n.context,D=e.contextType;i=tu,typeof D=="object"&&D!==null&&(i=Wt(D));var U=e.getDerivedStateFromProps;D=typeof U=="function"||typeof n.getSnapshotBeforeUpdate=="function",f=l.pendingProps!==f,D||typeof n.UNSAFE_componentWillReceiveProps!="function"&&typeof n.componentWillReceiveProps!="function"||(f||T!==i)&&Lo(l,n,u,i),$l=!1;var A=l.memoizedState;n.state=A,ku(l,u,n,a),Wu(),T=l.memoizedState,f||A!==T||$l?(typeof U=="function"&&(ef(l,e,U,u),T=l.memoizedState),(o=$l||xo(l,e,o,u,A,T,i))?(D||typeof n.UNSAFE_componentWillMount!="function"&&typeof n.componentWillMount!="function"||(typeof n.componentWillMount=="function"&&n.componentWillMount(),typeof n.UNSAFE_componentWillMount=="function"&&n.UNSAFE_componentWillMount()),typeof n.componentDidMount=="function"&&(l.flags|=4194308)):(typeof n.componentDidMount=="function"&&(l.flags|=4194308),l.memoizedProps=u,l.memoizedState=T),n.props=u,n.state=T,n.context=i,u=o):(typeof n.componentDidMount=="function"&&(l.flags|=4194308),u=!1)}else{n=l.stateNode,Hi(t,l),i=l.memoizedProps,D=Ce(e,i),n.props=D,U=l.pendingProps,A=n.context,T=e.contextType,o=tu,typeof T=="object"&&T!==null&&(o=Wt(T)),f=e.getDerivedStateFromProps,(T=typeof f=="function"||typeof n.getSnapshotBeforeUpdate=="function")||typeof n.UNSAFE_componentWillReceiveProps!="function"&&typeof n.componentWillReceiveProps!="function"||(i!==U||A!==o)&&Lo(l,n,u,o),$l=!1,A=l.memoizedState,n.state=A,ku(l,u,n,a),Wu();var z=l.memoizedState;i!==U||A!==z||$l||t!==null&&t.dependencies!==null&&Ja(t.dependencies)?(typeof f=="function"&&(ef(l,e,f,u),z=l.memoizedState),(D=$l||xo(l,e,D,u,A,z,o)||t!==null&&t.dependencies!==null&&Ja(t.dependencies))?(T||typeof n.UNSAFE_componentWillUpdate!="function"&&typeof n.componentWillUpdate!="function"||(typeof n.componentWillUpdate=="function"&&n.componentWillUpdate(u,z,o),typeof n.UNSAFE_componentWillUpdate=="function"&&n.UNSAFE_componentWillUpdate(u,z,o)),typeof n.componentDidUpdate=="function"&&(l.flags|=4),typeof n.getSnapshotBeforeUpdate=="function"&&(l.flags|=1024)):(typeof n.componentDidUpdate!="function"||i===t.memoizedProps&&A===t.memoizedState||(l.flags|=4),typeof n.getSnapshotBeforeUpdate!="function"||i===t.memoizedProps&&A===t.memoizedState||(l.flags|=1024),l.memoizedProps=u,l.memoizedState=z),n.props=u,n.state=z,n.context=o,u=D):(typeof n.componentDidUpdate!="function"||i===t.memoizedProps&&A===t.memoizedState||(l.flags|=4),typeof n.getSnapshotBeforeUpdate!="function"||i===t.memoizedProps&&A===t.memoizedState||(l.flags|=1024),u=!1)}return n=u,hn(t,l),u=(l.flags&128)!==0,n||u?(n=l.stateNode,e=u&&typeof e.getDerivedStateFromError!="function"?null:n.render(),l.flags|=1,t!==null&&u?(l.child=ou(l,t.child,null,a),l.child=ou(l,null,e,a)):Vt(t,l,e,a),l.memoizedState=n.state,t=l.child):t=Xl(t,l,a),t}function us(t,l,e,u){return Xu(),l.flags|=256,Vt(t,l,e,u),l.child}var ff={dehydrated:null,treeContext:null,retryLane:0,hydrationErrors:null};function cf(t){return{baseLanes:t,cachePool:Zr()}}function rf(t,l,e){return t=t!==null?t.childLanes&~e:0,l&&(t|=bl),t}function as(t,l,e){var u=l.pendingProps,a=!1,n=(l.flags&128)!==0,i;if((i=n)||(i=t!==null&&t.memoizedState===null?!1:(jt.current&2)!==0),i&&(a=!0,l.flags&=-129),i=(l.flags&32)!==0,l.flags&=-33,t===null){if(St){if(a?te(l):le(),St){var f=Bt,o;if(o=f){t:{for(o=f,f=Rl;o.nodeType!==8;){if(!f){f=null;break t}if(o=Ml(o.nextSibling),o===null){f=null;break t}}f=o}f!==null?(l.memoizedState={dehydrated:f,treeContext:Re!==null?{id:ql,overflow:Hl}:null,retryLane:536870912,hydrationErrors:null},o=il(18,null,null,0),o.stateNode=f,o.return=l,l.child=o,Ft=l,Bt=null,o=!0):o=!1}o||Oe(l)}if(f=l.memoizedState,f!==null&&(f=f.dehydrated,f!==null))return Kf(f)?l.lanes=32:l.lanes=536870912,null;jl(l)}return f=u.children,u=u.fallback,a?(le(),a=l.mode,f=gn({mode:"hidden",children:f},a),u=ze(u,a,e,null),f.return=l,u.return=l,f.sibling=u,l.child=f,a=l.child,a.memoizedState=cf(e),a.childLanes=rf(t,i,e),l.memoizedState=ff,u):(te(l),of(l,f))}if(o=t.memoizedState,o!==null&&(f=o.dehydrated,f!==null)){if(n)l.flags&256?(te(l),l.flags&=-257,l=sf(t,l,e)):l.memoizedState!==null?(le(),l.child=t.child,l.flags|=128,l=null):(le(),a=u.fallback,f=l.mode,u=gn({mode:"visible",children:u.children},f),a=ze(a,f,e,null),a.flags|=2,u.return=l,a.return=l,u.sibling=a,l.child=u,ou(l,t.child,null,e),u=l.child,u.memoizedState=cf(e),u.childLanes=rf(t,i,e),l.memoizedState=ff,l=a);else if(te(l),Kf(f)){if(i=f.nextSibling&&f.nextSibling.dataset,i)var T=i.dgst;i=T,u=Error(c(419)),u.stack="",u.digest=i,xu({value:u,source:null,stack:null}),l=sf(t,l,e)}else if(xt||Lu(t,l,e,!1),i=(e&t.childLanes)!==0,xt||i){if(i=Dt,i!==null&&(u=e&-e,u=(u&42)!==0?1:Kn(u),u=(u&(i.suspendedLanes|e))!==0?0:u,u!==0&&u!==o.retryLane))throw o.retryLane=u,Pe(t,u),sl(i,t,u),ko;f.data==="$?"||Uf(),l=sf(t,l,e)}else f.data==="$?"?(l.flags|=192,l.child=t.child,l=null):(t=o.treeContext,Bt=Ml(f.nextSibling),Ft=l,St=!0,De=null,Rl=!1,t!==null&&(vl[ml++]=ql,vl[ml++]=Hl,vl[ml++]=Re,ql=t.id,Hl=t.overflow,Re=l),l=of(l,u.children),l.flags|=4096);return l}return a?(le(),a=u.fallback,f=l.mode,o=t.child,T=o.sibling,u=Cl(o,{mode:"hidden",children:u.children}),u.subtreeFlags=o.subtreeFlags&65011712,T!==null?a=Cl(T,a):(a=ze(a,f,e,null),a.flags|=2),a.return=l,u.return=l,u.sibling=a,l.child=u,u=a,a=l.child,f=t.child.memoizedState,f===null?f=cf(e):(o=f.cachePool,o!==null?(T=Qt._currentValue,o=o.parent!==T?{parent:T,pool:T}:o):o=Zr(),f={baseLanes:f.baseLanes|e,cachePool:o}),a.memoizedState=f,a.childLanes=rf(t,i,e),l.memoizedState=ff,u):(te(l),e=t.child,t=e.sibling,e=Cl(e,{mode:"visible",children:u.children}),e.return=l,e.sibling=null,t!==null&&(i=l.deletions,i===null?(l.deletions=[t],l.flags|=16):i.push(t)),l.child=e,l.memoizedState=null,e)}function of(t,l){return l=gn({mode:"visible",children:l},t.mode),l.return=t,t.child=l}function gn(t,l){return t=il(22,t,null,l),t.lanes=0,t.stateNode={_visibility:1,_pendingMarkers:null,_retryCache:null,_transitions:null},t}function sf(t,l,e){return ou(l,t.child,null,e),t=of(l,l.pendingProps.children),t.flags|=2,l.memoizedState=null,t}function ns(t,l,e){t.lanes|=l;var u=t.alternate;u!==null&&(u.lanes|=l),Oi(t.return,l,e)}function df(t,l,e,u,a){var n=t.memoizedState;n===null?t.memoizedState={isBackwards:l,rendering:null,renderingStartTime:0,last:u,tail:e,tailMode:a}:(n.isBackwards=l,n.rendering=null,n.renderingStartTime=0,n.last=u,n.tail=e,n.tailMode=a)}function is(t,l,e){var u=l.pendingProps,a=u.revealOrder,n=u.tail;if(Vt(t,l,u.children,e),u=jt.current,(u&2)!==0)u=u&1|2,l.flags|=128;else{if(t!==null&&(t.flags&128)!==0)t:for(t=l.child;t!==null;){if(t.tag===13)t.memoizedState!==null&&ns(t,e,l);else if(t.tag===19)ns(t,e,l);else if(t.child!==null){t.child.return=t,t=t.child;continue}if(t===l)break t;for(;t.sibling===null;){if(t.return===null||t.return===l)break t;t=t.return}t.sibling.return=t.return,t=t.sibling}u&=1}switch(C(jt,u),a){case"forwards":for(e=l.child,a=null;e!==null;)t=e.alternate,t!==null&&on(t)===null&&(a=e),e=e.sibling;e=a,e===null?(a=l.child,l.child=null):(a=e.sibling,e.sibling=null),df(l,!1,a,e,n);break;case"backwards":for(e=null,a=l.child,l.child=null;a!==null;){if(t=a.alternate,t!==null&&on(t)===null){l.child=a;break}t=a.sibling,a.sibling=e,e=a,a=t}df(l,!0,e,null,n);break;case"together":df(l,!1,null,null,void 0);break;default:l.memoizedState=null}return l.child}function Xl(t,l,e){if(t!==null&&(l.dependencies=t.dependencies),ie|=l.lanes,(e&l.childLanes)===0)if(t!==null){if(Lu(t,l,e,!1),(e&l.childLanes)===0)return null}else return null;if(t!==null&&l.child!==t.child)throw Error(c(153));if(l.child!==null){for(t=l.child,e=Cl(t,t.pendingProps),l.child=e,e.return=l;t.sibling!==null;)t=t.sibling,e=e.sibling=Cl(t,t.pendingProps),e.return=l;e.sibling=null}return l.child}function hf(t,l){return(t.lanes&l)!==0?!0:(t=t.dependencies,!!(t!==null&&Ja(t)))}function Q1(t,l,e){switch(l.tag){case 3:yt(l,l.stateNode.containerInfo),kl(l,Qt,t.memoizedState.cache),Xu();break;case 27:case 5:Se(l);break;case 4:yt(l,l.stateNode.containerInfo);break;case 10:kl(l,l.type,l.memoizedProps.value);break;case 13:var u=l.memoizedState;if(u!==null)return u.dehydrated!==null?(te(l),l.flags|=128,null):(e&l.child.childLanes)!==0?as(t,l,e):(te(l),t=Xl(t,l,e),t!==null?t.sibling:null);te(l);break;case 19:var a=(t.flags&128)!==0;if(u=(e&l.childLanes)!==0,u||(Lu(t,l,e,!1),u=(e&l.childLanes)!==0),a){if(u)return is(t,l,e);l.flags|=128}if(a=l.memoizedState,a!==null&&(a.rendering=null,a.tail=null,a.lastEffect=null),C(jt,jt.current),u)break;return null;case 22:case 23:return l.lanes=0,Po(t,l,e);case 24:kl(l,Qt,t.memoizedState.cache)}return Xl(t,l,e)}function fs(t,l,e){if(t!==null)if(t.memoizedProps!==l.pendingProps)xt=!0;else{if(!hf(t,e)&&(l.flags&128)===0)return xt=!1,Q1(t,l,e);xt=(t.flags&131072)!==0}else xt=!1,St&&(l.flags&1048576)!==0&&Yr(l,Ka,l.index);switch(l.lanes=0,l.tag){case 16:t:{t=l.pendingProps;var u=l.elementType,a=u._init;if(u=a(u._payload),l.type=u,typeof u=="function")Ti(u)?(t=Ce(u,t),l.tag=1,l=es(null,l,u,t,e)):(l.tag=0,l=nf(null,l,u,t,e));else{if(u!=null){if(a=u.$$typeof,a===j){l.tag=11,l=$o(null,l,u,t,e);break t}else if(a===Q){l.tag=14,l=Fo(null,l,u,t,e);break t}}throw l=nt(u)||u,Error(c(306,l,""))}}return l;case 0:return nf(t,l,l.type,l.pendingProps,e);case 1:return u=l.type,a=Ce(u,l.pendingProps),es(t,l,u,a,e);case 3:t:{if(yt(l,l.stateNode.containerInfo),t===null)throw Error(c(387));u=l.pendingProps;var n=l.memoizedState;a=n.element,Hi(t,l),ku(l,u,null,e);var i=l.memoizedState;if(u=i.cache,kl(l,Qt,u),u!==n.cache&&Ui(l,[Qt],e,!0),Wu(),u=i.element,n.isDehydrated)if(n={element:u,isDehydrated:!1,cache:i.cache},l.updateQueue.baseState=n,l.memoizedState=n,l.flags&256){l=us(t,l,u,e);break t}else if(u!==a){a=gl(Error(c(424)),l),xu(a),l=us(t,l,u,e);break t}else{switch(t=l.stateNode.containerInfo,t.nodeType){case 9:t=t.body;break;default:t=t.nodeName==="HTML"?t.ownerDocument.body:t}for(Bt=Ml(t.firstChild),Ft=l,St=!0,De=null,Rl=!0,e=jo(l,null,u,e),l.child=e;e;)e.flags=e.flags&-3|4096,e=e.sibling}else{if(Xu(),u===a){l=Xl(t,l,e);break t}Vt(t,l,u,e)}l=l.child}return l;case 26:return hn(t,l),t===null?(e=s0(l.type,null,l.pendingProps,null))?l.memoizedState=e:St||(e=l.type,t=l.pendingProps,u=On(ft.current).createElement(e),u[Jt]=l,u[It]=t,Kt(u,e,t),Xt(u),l.stateNode=u):l.memoizedState=s0(l.type,t.memoizedProps,l.pendingProps,t.memoizedState),null;case 27:return Se(l),t===null&&St&&(u=l.stateNode=c0(l.type,l.pendingProps,ft.current),Ft=l,Rl=!0,a=Bt,oe(l.type)?(Jf=a,Bt=Ml(u.firstChild)):Bt=a),Vt(t,l,l.pendingProps.children,e),hn(t,l),t===null&&(l.flags|=4194304),l.child;case 5:return t===null&&St&&((a=u=Bt)&&(u=dh(u,l.type,l.pendingProps,Rl),u!==null?(l.stateNode=u,Ft=l,Bt=Ml(u.firstChild),Rl=!1,a=!0):a=!1),a||Oe(l)),Se(l),a=l.type,n=l.pendingProps,i=t!==null?t.memoizedProps:null,u=n.children,Zf(a,n)?u=null:i!==null&&Zf(a,i)&&(l.flags|=32),l.memoizedState!==null&&(a=xi(t,l,N1,null,null,e),ma._currentValue=a),hn(t,l),Vt(t,l,u,e),l.child;case 6:return t===null&&St&&((t=e=Bt)&&(e=hh(e,l.pendingProps,Rl),e!==null?(l.stateNode=e,Ft=l,Bt=null,t=!0):t=!1),t||Oe(l)),null;case 13:return as(t,l,e);case 4:return yt(l,l.stateNode.containerInfo),u=l.pendingProps,t===null?l.child=ou(l,null,u,e):Vt(t,l,u,e),l.child;case 11:return $o(t,l,l.type,l.pendingProps,e);case 7:return Vt(t,l,l.pendingProps,e),l.child;case 8:return Vt(t,l,l.pendingProps.children,e),l.child;case 12:return Vt(t,l,l.pendingProps.children,e),l.child;case 10:return u=l.pendingProps,kl(l,l.type,u.value),Vt(t,l,u.children,e),l.child;case 9:return a=l.type._context,u=l.pendingProps.children,Ne(l),a=Wt(a),u=u(a),l.flags|=1,Vt(t,l,u,e),l.child;case 14:return Fo(t,l,l.type,l.pendingProps,e);case 15:return Io(t,l,l.type,l.pendingProps,e);case 19:return is(t,l,e);case 31:return u=l.pendingProps,e=l.mode,u={mode:u.mode,children:u.children},t===null?(e=gn(u,e),e.ref=l.ref,l.child=e,e.return=l,l=e):(e=Cl(t.child,u),e.ref=l.ref,l.child=e,e.return=l,l=e),l;case 22:return Po(t,l,e);case 24:return Ne(l),u=Wt(Qt),t===null?(a=Bi(),a===null&&(a=Dt,n=Ni(),a.pooledCache=n,n.refCount++,n!==null&&(a.pooledCacheLanes|=e),a=n),l.memoizedState={parent:u,cache:a},qi(l),kl(l,Qt,a)):((t.lanes&e)!==0&&(Hi(t,l),ku(l,null,null,e),Wu()),a=t.memoizedState,n=l.memoizedState,a.parent!==u?(a={parent:u,cache:u},l.memoizedState=a,l.lanes===0&&(l.memoizedState=l.updateQueue.baseState=a),kl(l,Qt,u)):(u=n.cache,kl(l,Qt,u),u!==a.cache&&Ui(l,[Qt],e,!0))),Vt(t,l,l.pendingProps.children,e),l.child;case 29:throw l.pendingProps}throw Error(c(156,l.tag))}function xl(t){t.flags|=4}function cs(t,l){if(l.type!=="stylesheet"||(l.state.loading&4)!==0)t.flags&=-16777217;else if(t.flags|=16777216,!v0(l)){if(l=Sl.current,l!==null&&((vt&4194048)===vt?_l!==null:(vt&62914560)!==vt&&(vt&536870912)===0||l!==_l))throw Ku=Ci,Vr;t.flags|=8192}}function yn(t,l){l!==null&&(t.flags|=4),t.flags&16384&&(l=t.tag!==22?jc():536870912,t.lanes|=l,gu|=l)}function ea(t,l){if(!St)switch(t.tailMode){case"hidden":l=t.tail;for(var e=null;l!==null;)l.alternate!==null&&(e=l),l=l.sibling;e===null?t.tail=null:e.sibling=null;break;case"collapsed":e=t.tail;for(var u=null;e!==null;)e.alternate!==null&&(u=e),e=e.sibling;u===null?l||t.tail===null?t.tail=null:t.tail.sibling=null:u.sibling=null}}function pt(t){var l=t.alternate!==null&&t.alternate.child===t.child,e=0,u=0;if(l)for(var a=t.child;a!==null;)e|=a.lanes|a.childLanes,u|=a.subtreeFlags&65011712,u|=a.flags&65011712,a.return=t,a=a.sibling;else for(a=t.child;a!==null;)e|=a.lanes|a.childLanes,u|=a.subtreeFlags,u|=a.flags,a.return=t,a=a.sibling;return t.subtreeFlags|=u,t.childLanes=e,l}function j1(t,l,e){var u=l.pendingProps;switch(Ri(l),l.tag){case 31:case 16:case 15:case 0:case 11:case 7:case 8:case 12:case 9:case 14:return pt(l),null;case 1:return pt(l),null;case 3:return e=l.stateNode,u=null,t!==null&&(u=t.memoizedState.cache),l.memoizedState.cache!==u&&(l.flags|=2048),Gl(Qt),$t(),e.pendingContext&&(e.context=e.pendingContext,e.pendingContext=null),(t===null||t.child===null)&&(ju(l)?xl(l):t===null||t.memoizedState.isDehydrated&&(l.flags&256)===0||(l.flags|=1024,jr())),pt(l),null;case 26:return e=l.memoizedState,t===null?(xl(l),e!==null?(pt(l),cs(l,e)):(pt(l),l.flags&=-16777217)):e?e!==t.memoizedState?(xl(l),pt(l),cs(l,e)):(pt(l),l.flags&=-16777217):(t.memoizedProps!==u&&xl(l),pt(l),l.flags&=-16777217),null;case 27:Ra(l),e=ft.current;var a=l.type;if(t!==null&&l.stateNode!=null)t.memoizedProps!==u&&xl(l);else{if(!u){if(l.stateNode===null)throw Error(c(166));return pt(l),null}t=I.current,ju(l)?Gr(l):(t=c0(a,u,e),l.stateNode=t,xl(l))}return pt(l),null;case 5:if(Ra(l),e=l.type,t!==null&&l.stateNode!=null)t.memoizedProps!==u&&xl(l);else{if(!u){if(l.stateNode===null)throw Error(c(166));return pt(l),null}if(t=I.current,ju(l))Gr(l);else{switch(a=On(ft.current),t){case 1:t=a.createElementNS("http://www.w3.org/2000/svg",e);break;case 2:t=a.createElementNS("http://www.w3.org/1998/Math/MathML",e);break;default:switch(e){case"svg":t=a.createElementNS("http://www.w3.org/2000/svg",e);break;case"math":t=a.createElementNS("http://www.w3.org/1998/Math/MathML",e);break;case"script":t=a.createElement("div"),t.innerHTML="",
+ "esm": "import { generateQRCode } from \"qr-code-utils.es.js\"",
+ "umd": "const { generateQRCode } = require(\"qr-code-utils.umd.js\")"
+ }
+}
\ No newline at end of file
diff --git a/dist/index.html b/dist/index.html
deleted file mode 100644
index 198fe16..0000000
--- a/dist/index.html
+++ /dev/null
@@ -1,14 +0,0 @@
-
-
-
-
-
-
- QR Codes
-
-
-
-
-
-
-
diff --git a/dist/qr-code-utils.es.js b/dist/qr-code-utils.es.js
new file mode 100644
index 0000000..2332ac5
--- /dev/null
+++ b/dist/qr-code-utils.es.js
@@ -0,0 +1,2178 @@
+var browser = {};
+var canPromise$1 = function() {
+ return typeof Promise === "function" && Promise.prototype && Promise.prototype.then;
+};
+var qrcode = {};
+var utils$1 = {};
+let toSJISFunction;
+const CODEWORDS_COUNT = [
+ 0,
+ // Not used
+ 26,
+ 44,
+ 70,
+ 100,
+ 134,
+ 172,
+ 196,
+ 242,
+ 292,
+ 346,
+ 404,
+ 466,
+ 532,
+ 581,
+ 655,
+ 733,
+ 815,
+ 901,
+ 991,
+ 1085,
+ 1156,
+ 1258,
+ 1364,
+ 1474,
+ 1588,
+ 1706,
+ 1828,
+ 1921,
+ 2051,
+ 2185,
+ 2323,
+ 2465,
+ 2611,
+ 2761,
+ 2876,
+ 3034,
+ 3196,
+ 3362,
+ 3532,
+ 3706
+];
+utils$1.getSymbolSize = function getSymbolSize(version2) {
+ if (!version2) throw new Error('"version" cannot be null or undefined');
+ if (version2 < 1 || version2 > 40) throw new Error('"version" should be in range from 1 to 40');
+ return version2 * 4 + 17;
+};
+utils$1.getSymbolTotalCodewords = function getSymbolTotalCodewords(version2) {
+ return CODEWORDS_COUNT[version2];
+};
+utils$1.getBCHDigit = function(data) {
+ let digit = 0;
+ while (data !== 0) {
+ digit++;
+ data >>>= 1;
+ }
+ return digit;
+};
+utils$1.setToSJISFunction = function setToSJISFunction(f) {
+ if (typeof f !== "function") {
+ throw new Error('"toSJISFunc" is not a valid function.');
+ }
+ toSJISFunction = f;
+};
+utils$1.isKanjiModeEnabled = function() {
+ return typeof toSJISFunction !== "undefined";
+};
+utils$1.toSJIS = function toSJIS(kanji2) {
+ return toSJISFunction(kanji2);
+};
+var errorCorrectionLevel = {};
+(function(exports) {
+ exports.L = { bit: 1 };
+ exports.M = { bit: 0 };
+ exports.Q = { bit: 3 };
+ exports.H = { bit: 2 };
+ function fromString(string) {
+ if (typeof string !== "string") {
+ throw new Error("Param is not a string");
+ }
+ const lcStr = string.toLowerCase();
+ switch (lcStr) {
+ case "l":
+ case "low":
+ return exports.L;
+ case "m":
+ case "medium":
+ return exports.M;
+ case "q":
+ case "quartile":
+ return exports.Q;
+ case "h":
+ case "high":
+ return exports.H;
+ default:
+ throw new Error("Unknown EC Level: " + string);
+ }
+ }
+ exports.isValid = function isValid2(level) {
+ return level && typeof level.bit !== "undefined" && level.bit >= 0 && level.bit < 4;
+ };
+ exports.from = function from(value, defaultValue) {
+ if (exports.isValid(value)) {
+ return value;
+ }
+ try {
+ return fromString(value);
+ } catch (e) {
+ return defaultValue;
+ }
+ };
+})(errorCorrectionLevel);
+function BitBuffer$1() {
+ this.buffer = [];
+ this.length = 0;
+}
+BitBuffer$1.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++;
+ }
+};
+var bitBuffer = BitBuffer$1;
+function BitMatrix$1(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$1.prototype.set = function(row, col, value, reserved) {
+ const index = row * this.size + col;
+ this.data[index] = value;
+ if (reserved) this.reservedBit[index] = true;
+};
+BitMatrix$1.prototype.get = function(row, col) {
+ return this.data[row * this.size + col];
+};
+BitMatrix$1.prototype.xor = function(row, col, value) {
+ this.data[row * this.size + col] ^= value;
+};
+BitMatrix$1.prototype.isReserved = function(row, col) {
+ return this.reservedBit[row * this.size + col];
+};
+var bitMatrix = BitMatrix$1;
+var alignmentPattern = {};
+(function(exports) {
+ const getSymbolSize3 = utils$1.getSymbolSize;
+ exports.getRowColCoords = function getRowColCoords(version2) {
+ if (version2 === 1) return [];
+ const posCount = Math.floor(version2 / 7) + 2;
+ const size = getSymbolSize3(version2);
+ 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 getPositions2(version2) {
+ const coords = [];
+ const pos = exports.getRowColCoords(version2);
+ 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);
+var finderPattern = {};
+const getSymbolSize2 = utils$1.getSymbolSize;
+const FINDER_PATTERN_SIZE = 7;
+finderPattern.getPositions = function getPositions(version2) {
+ const size = getSymbolSize2(version2);
+ return [
+ // top-left
+ [0, 0],
+ // top-right
+ [size - FINDER_PATTERN_SIZE, 0],
+ // bottom-left
+ [0, size - FINDER_PATTERN_SIZE]
+ ];
+};
+var maskPattern = {};
+(function(exports) {
+ exports.Patterns = {
+ PATTERN000: 0,
+ PATTERN001: 1,
+ PATTERN010: 2,
+ PATTERN011: 3,
+ PATTERN100: 4,
+ PATTERN101: 5,
+ PATTERN110: 6,
+ PATTERN111: 7
+ };
+ const PenaltyScores = {
+ N1: 3,
+ N2: 3,
+ N3: 40,
+ N4: 10
+ };
+ exports.isValid = function isValid2(mask) {
+ return mask != null && mask !== "" && !isNaN(mask) && mask >= 0 && mask <= 7;
+ };
+ exports.from = function from(value) {
+ return exports.isValid(value) ? parseInt(value, 10) : void 0;
+ };
+ exports.getPenaltyN1 = function getPenaltyN1(data) {
+ const size = data.size;
+ let points = 0;
+ let sameCountCol = 0;
+ let sameCountRow = 0;
+ let lastCol = null;
+ let lastRow = null;
+ for (let row = 0; row < size; row++) {
+ sameCountCol = sameCountRow = 0;
+ lastCol = lastRow = null;
+ for (let col = 0; col < size; col++) {
+ let module = data.get(row, col);
+ if (module === lastCol) {
+ sameCountCol++;
+ } else {
+ if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+ lastCol = module;
+ sameCountCol = 1;
+ }
+ module = data.get(col, row);
+ if (module === lastRow) {
+ sameCountRow++;
+ } else {
+ if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+ lastRow = module;
+ sameCountRow = 1;
+ }
+ }
+ if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+ if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+ }
+ return points;
+ };
+ exports.getPenaltyN2 = function getPenaltyN2(data) {
+ const size = data.size;
+ let points = 0;
+ for (let row = 0; row < size - 1; row++) {
+ for (let col = 0; col < size - 1; col++) {
+ const last = data.get(row, col) + data.get(row, col + 1) + data.get(row + 1, col) + data.get(row + 1, col + 1);
+ if (last === 4 || last === 0) points++;
+ }
+ }
+ return points * PenaltyScores.N2;
+ };
+ exports.getPenaltyN3 = function getPenaltyN3(data) {
+ const size = data.size;
+ let points = 0;
+ let bitsCol = 0;
+ let bitsRow = 0;
+ for (let row = 0; row < size; row++) {
+ bitsCol = bitsRow = 0;
+ for (let col = 0; col < size; col++) {
+ bitsCol = bitsCol << 1 & 2047 | data.get(row, col);
+ if (col >= 10 && (bitsCol === 1488 || bitsCol === 93)) points++;
+ bitsRow = bitsRow << 1 & 2047 | data.get(col, row);
+ if (col >= 10 && (bitsRow === 1488 || bitsRow === 93)) points++;
+ }
+ }
+ return points * PenaltyScores.N3;
+ };
+ exports.getPenaltyN4 = function getPenaltyN4(data) {
+ let darkCount = 0;
+ const modulesCount = data.data.length;
+ for (let i = 0; i < modulesCount; i++) darkCount += data.data[i];
+ const k = Math.abs(Math.ceil(darkCount * 100 / modulesCount / 5) - 10);
+ return k * PenaltyScores.N4;
+ };
+ function getMaskAt(maskPattern2, i, j) {
+ switch (maskPattern2) {
+ case exports.Patterns.PATTERN000:
+ return (i + j) % 2 === 0;
+ case exports.Patterns.PATTERN001:
+ return i % 2 === 0;
+ case exports.Patterns.PATTERN010:
+ return j % 3 === 0;
+ case exports.Patterns.PATTERN011:
+ return (i + j) % 3 === 0;
+ case exports.Patterns.PATTERN100:
+ return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0;
+ case exports.Patterns.PATTERN101:
+ return i * j % 2 + i * j % 3 === 0;
+ case exports.Patterns.PATTERN110:
+ return (i * j % 2 + i * j % 3) % 2 === 0;
+ case exports.Patterns.PATTERN111:
+ return (i * j % 3 + (i + j) % 2) % 2 === 0;
+ default:
+ throw new Error("bad maskPattern:" + maskPattern2);
+ }
+ }
+ exports.applyMask = function applyMask(pattern, data) {
+ const size = data.size;
+ for (let col = 0; col < size; col++) {
+ for (let row = 0; row < size; row++) {
+ if (data.isReserved(row, col)) continue;
+ data.xor(row, col, getMaskAt(pattern, row, col));
+ }
+ }
+ };
+ exports.getBestMask = function getBestMask(data, setupFormatFunc) {
+ const numPatterns = Object.keys(exports.Patterns).length;
+ let bestPattern = 0;
+ let lowerPenalty = Infinity;
+ for (let p = 0; p < numPatterns; p++) {
+ setupFormatFunc(p);
+ exports.applyMask(p, data);
+ const penalty = exports.getPenaltyN1(data) + exports.getPenaltyN2(data) + exports.getPenaltyN3(data) + exports.getPenaltyN4(data);
+ exports.applyMask(p, data);
+ if (penalty < lowerPenalty) {
+ lowerPenalty = penalty;
+ bestPattern = p;
+ }
+ }
+ return bestPattern;
+ };
+})(maskPattern);
+var errorCorrectionCode = {};
+const ECLevel$1 = errorCorrectionLevel;
+const EC_BLOCKS_TABLE = [
+ // L M Q H
+ 1,
+ 1,
+ 1,
+ 1,
+ 1,
+ 1,
+ 1,
+ 1,
+ 1,
+ 1,
+ 2,
+ 2,
+ 1,
+ 2,
+ 2,
+ 4,
+ 1,
+ 2,
+ 4,
+ 4,
+ 2,
+ 4,
+ 4,
+ 4,
+ 2,
+ 4,
+ 6,
+ 5,
+ 2,
+ 4,
+ 6,
+ 6,
+ 2,
+ 5,
+ 8,
+ 8,
+ 4,
+ 5,
+ 8,
+ 8,
+ 4,
+ 5,
+ 8,
+ 11,
+ 4,
+ 8,
+ 10,
+ 11,
+ 4,
+ 9,
+ 12,
+ 16,
+ 4,
+ 9,
+ 16,
+ 16,
+ 6,
+ 10,
+ 12,
+ 18,
+ 6,
+ 10,
+ 17,
+ 16,
+ 6,
+ 11,
+ 16,
+ 19,
+ 6,
+ 13,
+ 18,
+ 21,
+ 7,
+ 14,
+ 21,
+ 25,
+ 8,
+ 16,
+ 20,
+ 25,
+ 8,
+ 17,
+ 23,
+ 25,
+ 9,
+ 17,
+ 23,
+ 34,
+ 9,
+ 18,
+ 25,
+ 30,
+ 10,
+ 20,
+ 27,
+ 32,
+ 12,
+ 21,
+ 29,
+ 35,
+ 12,
+ 23,
+ 34,
+ 37,
+ 12,
+ 25,
+ 34,
+ 40,
+ 13,
+ 26,
+ 35,
+ 42,
+ 14,
+ 28,
+ 38,
+ 45,
+ 15,
+ 29,
+ 40,
+ 48,
+ 16,
+ 31,
+ 43,
+ 51,
+ 17,
+ 33,
+ 45,
+ 54,
+ 18,
+ 35,
+ 48,
+ 57,
+ 19,
+ 37,
+ 51,
+ 60,
+ 19,
+ 38,
+ 53,
+ 63,
+ 20,
+ 40,
+ 56,
+ 66,
+ 21,
+ 43,
+ 59,
+ 70,
+ 22,
+ 45,
+ 62,
+ 74,
+ 24,
+ 47,
+ 65,
+ 77,
+ 25,
+ 49,
+ 68,
+ 81
+];
+const EC_CODEWORDS_TABLE = [
+ // L M Q H
+ 7,
+ 10,
+ 13,
+ 17,
+ 10,
+ 16,
+ 22,
+ 28,
+ 15,
+ 26,
+ 36,
+ 44,
+ 20,
+ 36,
+ 52,
+ 64,
+ 26,
+ 48,
+ 72,
+ 88,
+ 36,
+ 64,
+ 96,
+ 112,
+ 40,
+ 72,
+ 108,
+ 130,
+ 48,
+ 88,
+ 132,
+ 156,
+ 60,
+ 110,
+ 160,
+ 192,
+ 72,
+ 130,
+ 192,
+ 224,
+ 80,
+ 150,
+ 224,
+ 264,
+ 96,
+ 176,
+ 260,
+ 308,
+ 104,
+ 198,
+ 288,
+ 352,
+ 120,
+ 216,
+ 320,
+ 384,
+ 132,
+ 240,
+ 360,
+ 432,
+ 144,
+ 280,
+ 408,
+ 480,
+ 168,
+ 308,
+ 448,
+ 532,
+ 180,
+ 338,
+ 504,
+ 588,
+ 196,
+ 364,
+ 546,
+ 650,
+ 224,
+ 416,
+ 600,
+ 700,
+ 224,
+ 442,
+ 644,
+ 750,
+ 252,
+ 476,
+ 690,
+ 816,
+ 270,
+ 504,
+ 750,
+ 900,
+ 300,
+ 560,
+ 810,
+ 960,
+ 312,
+ 588,
+ 870,
+ 1050,
+ 336,
+ 644,
+ 952,
+ 1110,
+ 360,
+ 700,
+ 1020,
+ 1200,
+ 390,
+ 728,
+ 1050,
+ 1260,
+ 420,
+ 784,
+ 1140,
+ 1350,
+ 450,
+ 812,
+ 1200,
+ 1440,
+ 480,
+ 868,
+ 1290,
+ 1530,
+ 510,
+ 924,
+ 1350,
+ 1620,
+ 540,
+ 980,
+ 1440,
+ 1710,
+ 570,
+ 1036,
+ 1530,
+ 1800,
+ 570,
+ 1064,
+ 1590,
+ 1890,
+ 600,
+ 1120,
+ 1680,
+ 1980,
+ 630,
+ 1204,
+ 1770,
+ 2100,
+ 660,
+ 1260,
+ 1860,
+ 2220,
+ 720,
+ 1316,
+ 1950,
+ 2310,
+ 750,
+ 1372,
+ 2040,
+ 2430
+];
+errorCorrectionCode.getBlocksCount = function getBlocksCount(version2, errorCorrectionLevel2) {
+ switch (errorCorrectionLevel2) {
+ case ECLevel$1.L:
+ return EC_BLOCKS_TABLE[(version2 - 1) * 4 + 0];
+ case ECLevel$1.M:
+ return EC_BLOCKS_TABLE[(version2 - 1) * 4 + 1];
+ case ECLevel$1.Q:
+ return EC_BLOCKS_TABLE[(version2 - 1) * 4 + 2];
+ case ECLevel$1.H:
+ return EC_BLOCKS_TABLE[(version2 - 1) * 4 + 3];
+ default:
+ return void 0;
+ }
+};
+errorCorrectionCode.getTotalCodewordsCount = function getTotalCodewordsCount(version2, errorCorrectionLevel2) {
+ switch (errorCorrectionLevel2) {
+ case ECLevel$1.L:
+ return EC_CODEWORDS_TABLE[(version2 - 1) * 4 + 0];
+ case ECLevel$1.M:
+ return EC_CODEWORDS_TABLE[(version2 - 1) * 4 + 1];
+ case ECLevel$1.Q:
+ return EC_CODEWORDS_TABLE[(version2 - 1) * 4 + 2];
+ case ECLevel$1.H:
+ return EC_CODEWORDS_TABLE[(version2 - 1) * 4 + 3];
+ default:
+ return void 0;
+ }
+};
+var polynomial = {};
+var galoisField = {};
+const EXP_TABLE = new Uint8Array(512);
+const LOG_TABLE = new Uint8Array(256);
+(function initTables() {
+ let x = 1;
+ for (let i = 0; i < 255; i++) {
+ EXP_TABLE[i] = x;
+ LOG_TABLE[x] = i;
+ x <<= 1;
+ if (x & 256) {
+ x ^= 285;
+ }
+ }
+ for (let i = 255; i < 512; i++) {
+ EXP_TABLE[i] = EXP_TABLE[i - 255];
+ }
+})();
+galoisField.log = function log(n) {
+ if (n < 1) throw new Error("log(" + n + ")");
+ return LOG_TABLE[n];
+};
+galoisField.exp = function exp(n) {
+ return EXP_TABLE[n];
+};
+galoisField.mul = function mul(x, y) {
+ if (x === 0 || y === 0) return 0;
+ return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]];
+};
+(function(exports) {
+ const GF = galoisField;
+ exports.mul = function mul2(p1, p2) {
+ const coeff = new Uint8Array(p1.length + p2.length - 1);
+ for (let i = 0; i < p1.length; i++) {
+ for (let j = 0; j < p2.length; j++) {
+ coeff[i + j] ^= GF.mul(p1[i], p2[j]);
+ }
+ }
+ return coeff;
+ };
+ exports.mod = function mod(divident, divisor) {
+ let result = new Uint8Array(divident);
+ while (result.length - divisor.length >= 0) {
+ const coeff = result[0];
+ for (let i = 0; i < divisor.length; i++) {
+ result[i] ^= GF.mul(divisor[i], coeff);
+ }
+ let offset = 0;
+ while (offset < result.length && result[offset] === 0) offset++;
+ result = result.slice(offset);
+ }
+ return result;
+ };
+ exports.generateECPolynomial = function generateECPolynomial(degree) {
+ let poly = new Uint8Array([1]);
+ for (let i = 0; i < degree; i++) {
+ poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]));
+ }
+ return poly;
+ };
+})(polynomial);
+const Polynomial = polynomial;
+function ReedSolomonEncoder$1(degree) {
+ this.genPoly = void 0;
+ this.degree = degree;
+ if (this.degree) this.initialize(this.degree);
+}
+ReedSolomonEncoder$1.prototype.initialize = function initialize(degree) {
+ this.degree = degree;
+ this.genPoly = Polynomial.generateECPolynomial(this.degree);
+};
+ReedSolomonEncoder$1.prototype.encode = function encode(data) {
+ if (!this.genPoly) {
+ throw new Error("Encoder not initialized");
+ }
+ const paddedData = new Uint8Array(data.length + this.degree);
+ paddedData.set(data);
+ const remainder = Polynomial.mod(paddedData, this.genPoly);
+ const start = this.degree - remainder.length;
+ if (start > 0) {
+ const buff = new Uint8Array(this.degree);
+ buff.set(remainder, start);
+ return buff;
+ }
+ return remainder;
+};
+var reedSolomonEncoder = ReedSolomonEncoder$1;
+var version = {};
+var mode = {};
+var versionCheck = {};
+versionCheck.isValid = function isValid(version2) {
+ return !isNaN(version2) && version2 >= 1 && version2 <= 40;
+};
+var regex = {};
+const numeric = "[0-9]+";
+const alphanumeric = "[A-Z $%*+\\-./:]+";
+let kanji = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
+kanji = kanji.replace(/u/g, "\\u");
+const byte = "(?:(?![A-Z0-9 $%*+\\-./:]|" + kanji + ")(?:.|[\r\n]))+";
+regex.KANJI = new RegExp(kanji, "g");
+regex.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g");
+regex.BYTE = new RegExp(byte, "g");
+regex.NUMERIC = new RegExp(numeric, "g");
+regex.ALPHANUMERIC = new RegExp(alphanumeric, "g");
+const TEST_KANJI = new RegExp("^" + kanji + "$");
+const TEST_NUMERIC = new RegExp("^" + numeric + "$");
+const TEST_ALPHANUMERIC = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+regex.testKanji = function testKanji(str) {
+ return TEST_KANJI.test(str);
+};
+regex.testNumeric = function testNumeric(str) {
+ return TEST_NUMERIC.test(str);
+};
+regex.testAlphanumeric = function testAlphanumeric(str) {
+ return TEST_ALPHANUMERIC.test(str);
+};
+(function(exports) {
+ const VersionCheck = versionCheck;
+ const Regex = regex;
+ exports.NUMERIC = {
+ id: "Numeric",
+ bit: 1 << 0,
+ ccBits: [10, 12, 14]
+ };
+ exports.ALPHANUMERIC = {
+ id: "Alphanumeric",
+ bit: 1 << 1,
+ ccBits: [9, 11, 13]
+ };
+ exports.BYTE = {
+ id: "Byte",
+ bit: 1 << 2,
+ ccBits: [8, 16, 16]
+ };
+ exports.KANJI = {
+ id: "Kanji",
+ bit: 1 << 3,
+ ccBits: [8, 10, 12]
+ };
+ exports.MIXED = {
+ bit: -1
+ };
+ exports.getCharCountIndicator = function getCharCountIndicator(mode2, version2) {
+ if (!mode2.ccBits) throw new Error("Invalid mode: " + mode2);
+ if (!VersionCheck.isValid(version2)) {
+ throw new Error("Invalid version: " + version2);
+ }
+ if (version2 >= 1 && version2 < 10) return mode2.ccBits[0];
+ else if (version2 < 27) return mode2.ccBits[1];
+ return mode2.ccBits[2];
+ };
+ exports.getBestModeForData = function getBestModeForData(dataStr) {
+ if (Regex.testNumeric(dataStr)) return exports.NUMERIC;
+ else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC;
+ else if (Regex.testKanji(dataStr)) return exports.KANJI;
+ else return exports.BYTE;
+ };
+ exports.toString = function toString(mode2) {
+ if (mode2 && mode2.id) return mode2.id;
+ throw new Error("Invalid mode");
+ };
+ exports.isValid = function isValid2(mode2) {
+ return mode2 && mode2.bit && mode2.ccBits;
+ };
+ function fromString(string) {
+ if (typeof string !== "string") {
+ throw new Error("Param is not a string");
+ }
+ const lcStr = string.toLowerCase();
+ switch (lcStr) {
+ case "numeric":
+ return exports.NUMERIC;
+ case "alphanumeric":
+ return exports.ALPHANUMERIC;
+ case "kanji":
+ return exports.KANJI;
+ case "byte":
+ return exports.BYTE;
+ default:
+ throw new Error("Unknown mode: " + string);
+ }
+ }
+ exports.from = function from(value, defaultValue) {
+ if (exports.isValid(value)) {
+ return value;
+ }
+ try {
+ return fromString(value);
+ } catch (e) {
+ return defaultValue;
+ }
+ };
+})(mode);
+(function(exports) {
+ const Utils2 = utils$1;
+ const ECCode2 = errorCorrectionCode;
+ const ECLevel2 = errorCorrectionLevel;
+ const Mode2 = mode;
+ const VersionCheck = versionCheck;
+ const G18 = 1 << 12 | 1 << 11 | 1 << 10 | 1 << 9 | 1 << 8 | 1 << 5 | 1 << 2 | 1 << 0;
+ const G18_BCH = Utils2.getBCHDigit(G18);
+ function getBestVersionForDataLength(mode2, length, errorCorrectionLevel2) {
+ for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {
+ if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel2, mode2)) {
+ return currentVersion;
+ }
+ }
+ return void 0;
+ }
+ function getReservedBitsCount(mode2, version2) {
+ return Mode2.getCharCountIndicator(mode2, version2) + 4;
+ }
+ function getTotalBitsFromDataArray(segments2, version2) {
+ let totalBits = 0;
+ segments2.forEach(function(data) {
+ const reservedBits = getReservedBitsCount(data.mode, version2);
+ totalBits += reservedBits + data.getBitsLength();
+ });
+ return totalBits;
+ }
+ function getBestVersionForMixedData(segments2, errorCorrectionLevel2) {
+ for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {
+ const length = getTotalBitsFromDataArray(segments2, currentVersion);
+ if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel2, Mode2.MIXED)) {
+ return currentVersion;
+ }
+ }
+ return void 0;
+ }
+ exports.from = function from(value, defaultValue) {
+ if (VersionCheck.isValid(value)) {
+ return parseInt(value, 10);
+ }
+ return defaultValue;
+ };
+ exports.getCapacity = function getCapacity(version2, errorCorrectionLevel2, mode2) {
+ if (!VersionCheck.isValid(version2)) {
+ throw new Error("Invalid QR Code version");
+ }
+ if (typeof mode2 === "undefined") mode2 = Mode2.BYTE;
+ const totalCodewords = Utils2.getSymbolTotalCodewords(version2);
+ const ecTotalCodewords = ECCode2.getTotalCodewordsCount(version2, errorCorrectionLevel2);
+ const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
+ if (mode2 === Mode2.MIXED) return dataTotalCodewordsBits;
+ const usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode2, version2);
+ switch (mode2) {
+ case Mode2.NUMERIC:
+ return Math.floor(usableBits / 10 * 3);
+ case Mode2.ALPHANUMERIC:
+ return Math.floor(usableBits / 11 * 2);
+ case Mode2.KANJI:
+ return Math.floor(usableBits / 13);
+ case Mode2.BYTE:
+ default:
+ return Math.floor(usableBits / 8);
+ }
+ };
+ exports.getBestVersionForData = function getBestVersionForData(data, errorCorrectionLevel2) {
+ let seg;
+ const ecl = ECLevel2.from(errorCorrectionLevel2, ECLevel2.M);
+ if (Array.isArray(data)) {
+ if (data.length > 1) {
+ return getBestVersionForMixedData(data, ecl);
+ }
+ if (data.length === 0) {
+ return 1;
+ }
+ seg = data[0];
+ } else {
+ seg = data;
+ }
+ return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl);
+ };
+ exports.getEncodedBits = function getEncodedBits2(version2) {
+ if (!VersionCheck.isValid(version2) || version2 < 7) {
+ throw new Error("Invalid QR Code version");
+ }
+ let d = version2 << 12;
+ while (Utils2.getBCHDigit(d) - G18_BCH >= 0) {
+ d ^= G18 << Utils2.getBCHDigit(d) - G18_BCH;
+ }
+ return version2 << 12 | d;
+ };
+})(version);
+var formatInfo = {};
+const Utils$3 = utils$1;
+const G15 = 1 << 10 | 1 << 8 | 1 << 5 | 1 << 4 | 1 << 2 | 1 << 1 | 1 << 0;
+const G15_MASK = 1 << 14 | 1 << 12 | 1 << 10 | 1 << 4 | 1 << 1;
+const G15_BCH = Utils$3.getBCHDigit(G15);
+formatInfo.getEncodedBits = function getEncodedBits(errorCorrectionLevel2, mask) {
+ const data = errorCorrectionLevel2.bit << 3 | mask;
+ let d = data << 10;
+ while (Utils$3.getBCHDigit(d) - G15_BCH >= 0) {
+ d ^= G15 << Utils$3.getBCHDigit(d) - G15_BCH;
+ }
+ return (data << 10 | d) ^ G15_MASK;
+};
+var segments = {};
+const Mode$4 = mode;
+function NumericData(data) {
+ this.mode = Mode$4.NUMERIC;
+ this.data = data.toString();
+}
+NumericData.getBitsLength = function getBitsLength(length) {
+ return 10 * Math.floor(length / 3) + (length % 3 ? length % 3 * 3 + 1 : 0);
+};
+NumericData.prototype.getLength = function getLength() {
+ return this.data.length;
+};
+NumericData.prototype.getBitsLength = function getBitsLength2() {
+ return NumericData.getBitsLength(this.data.length);
+};
+NumericData.prototype.write = function write(bitBuffer2) {
+ let i, group, value;
+ for (i = 0; i + 3 <= this.data.length; i += 3) {
+ group = this.data.substr(i, 3);
+ value = parseInt(group, 10);
+ bitBuffer2.put(value, 10);
+ }
+ const remainingNum = this.data.length - i;
+ if (remainingNum > 0) {
+ group = this.data.substr(i);
+ value = parseInt(group, 10);
+ bitBuffer2.put(value, remainingNum * 3 + 1);
+ }
+};
+var numericData = NumericData;
+const Mode$3 = mode;
+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$3.ALPHANUMERIC;
+ this.data = data;
+}
+AlphanumericData.getBitsLength = function getBitsLength3(length) {
+ return 11 * Math.floor(length / 2) + 6 * (length % 2);
+};
+AlphanumericData.prototype.getLength = function getLength2() {
+ return this.data.length;
+};
+AlphanumericData.prototype.getBitsLength = function getBitsLength4() {
+ return AlphanumericData.getBitsLength(this.data.length);
+};
+AlphanumericData.prototype.write = function write2(bitBuffer2) {
+ 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]);
+ bitBuffer2.put(value, 11);
+ }
+ if (this.data.length % 2) {
+ bitBuffer2.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
+ }
+};
+var alphanumericData = AlphanumericData;
+const Mode$2 = mode;
+function ByteData(data) {
+ this.mode = Mode$2.BYTE;
+ if (typeof data === "string") {
+ this.data = new TextEncoder().encode(data);
+ } else {
+ this.data = new Uint8Array(data);
+ }
+}
+ByteData.getBitsLength = function getBitsLength5(length) {
+ return length * 8;
+};
+ByteData.prototype.getLength = function getLength3() {
+ return this.data.length;
+};
+ByteData.prototype.getBitsLength = function getBitsLength6() {
+ return ByteData.getBitsLength(this.data.length);
+};
+ByteData.prototype.write = function(bitBuffer2) {
+ for (let i = 0, l = this.data.length; i < l; i++) {
+ bitBuffer2.put(this.data[i], 8);
+ }
+};
+var byteData = ByteData;
+const Mode$1 = mode;
+const Utils$2 = utils$1;
+function KanjiData(data) {
+ this.mode = Mode$1.KANJI;
+ this.data = data;
+}
+KanjiData.getBitsLength = function getBitsLength7(length) {
+ return length * 13;
+};
+KanjiData.prototype.getLength = function getLength4() {
+ return this.data.length;
+};
+KanjiData.prototype.getBitsLength = function getBitsLength8() {
+ return KanjiData.getBitsLength(this.data.length);
+};
+KanjiData.prototype.write = function(bitBuffer2) {
+ let i;
+ for (i = 0; i < this.data.length; i++) {
+ let value = Utils$2.toSJIS(this.data[i]);
+ if (value >= 33088 && value <= 40956) {
+ value -= 33088;
+ } else if (value >= 57408 && value <= 60351) {
+ value -= 49472;
+ } else {
+ throw new Error(
+ "Invalid SJIS character: " + this.data[i] + "\nMake sure your charset is UTF-8"
+ );
+ }
+ value = (value >>> 8 & 255) * 192 + (value & 255);
+ bitBuffer2.put(value, 13);
+ }
+};
+var kanjiData = KanjiData;
+var dijkstra = { exports: {} };
+(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);
+var dijkstraExports = dijkstra.exports;
+(function(exports) {
+ const Mode2 = mode;
+ const NumericData2 = numericData;
+ const AlphanumericData2 = alphanumericData;
+ const ByteData2 = byteData;
+ const KanjiData2 = kanjiData;
+ const Regex = regex;
+ const Utils2 = utils$1;
+ const dijkstra2 = dijkstraExports;
+ function getStringByteLength(str) {
+ return unescape(encodeURIComponent(str)).length;
+ }
+ function getSegments(regex2, mode2, str) {
+ const segments2 = [];
+ let result;
+ while ((result = regex2.exec(str)) !== null) {
+ segments2.push({
+ data: result[0],
+ index: result.index,
+ mode: mode2,
+ length: result[0].length
+ });
+ }
+ return segments2;
+ }
+ function getSegmentsFromString(dataStr) {
+ const numSegs = getSegments(Regex.NUMERIC, Mode2.NUMERIC, dataStr);
+ const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode2.ALPHANUMERIC, dataStr);
+ let byteSegs;
+ let kanjiSegs;
+ if (Utils2.isKanjiModeEnabled()) {
+ byteSegs = getSegments(Regex.BYTE, Mode2.BYTE, dataStr);
+ kanjiSegs = getSegments(Regex.KANJI, Mode2.KANJI, dataStr);
+ } else {
+ byteSegs = getSegments(Regex.BYTE_KANJI, Mode2.BYTE, dataStr);
+ kanjiSegs = [];
+ }
+ const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs);
+ return segs.sort(function(s1, s2) {
+ return s1.index - s2.index;
+ }).map(function(obj) {
+ return {
+ data: obj.data,
+ mode: obj.mode,
+ length: obj.length
+ };
+ });
+ }
+ function getSegmentBitsLength(length, mode2) {
+ switch (mode2) {
+ case Mode2.NUMERIC:
+ return NumericData2.getBitsLength(length);
+ case Mode2.ALPHANUMERIC:
+ return AlphanumericData2.getBitsLength(length);
+ case Mode2.KANJI:
+ return KanjiData2.getBitsLength(length);
+ case Mode2.BYTE:
+ return ByteData2.getBitsLength(length);
+ }
+ }
+ function mergeSegments(segs) {
+ return segs.reduce(function(acc, curr) {
+ const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null;
+ if (prevSeg && prevSeg.mode === curr.mode) {
+ acc[acc.length - 1].data += curr.data;
+ return acc;
+ }
+ acc.push(curr);
+ return acc;
+ }, []);
+ }
+ function buildNodes(segs) {
+ const nodes = [];
+ for (let i = 0; i < segs.length; i++) {
+ const seg = segs[i];
+ switch (seg.mode) {
+ case Mode2.NUMERIC:
+ nodes.push([
+ seg,
+ { data: seg.data, mode: Mode2.ALPHANUMERIC, length: seg.length },
+ { data: seg.data, mode: Mode2.BYTE, length: seg.length }
+ ]);
+ break;
+ case Mode2.ALPHANUMERIC:
+ nodes.push([
+ seg,
+ { data: seg.data, mode: Mode2.BYTE, length: seg.length }
+ ]);
+ break;
+ case Mode2.KANJI:
+ nodes.push([
+ seg,
+ { data: seg.data, mode: Mode2.BYTE, length: getStringByteLength(seg.data) }
+ ]);
+ break;
+ case Mode2.BYTE:
+ nodes.push([
+ { data: seg.data, mode: Mode2.BYTE, length: getStringByteLength(seg.data) }
+ ]);
+ }
+ }
+ return nodes;
+ }
+ function buildGraph(nodes, version2) {
+ const table = {};
+ const graph = { start: {} };
+ let prevNodeIds = ["start"];
+ for (let i = 0; i < nodes.length; i++) {
+ const nodeGroup = nodes[i];
+ const currentNodeIds = [];
+ for (let j = 0; j < nodeGroup.length; j++) {
+ const node = nodeGroup[j];
+ const key = "" + i + j;
+ currentNodeIds.push(key);
+ table[key] = { node, lastCount: 0 };
+ graph[key] = {};
+ for (let n = 0; n < prevNodeIds.length; n++) {
+ const prevNodeId = prevNodeIds[n];
+ if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {
+ graph[prevNodeId][key] = getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) - getSegmentBitsLength(table[prevNodeId].lastCount, node.mode);
+ table[prevNodeId].lastCount += node.length;
+ } else {
+ if (table[prevNodeId]) table[prevNodeId].lastCount = node.length;
+ graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) + 4 + Mode2.getCharCountIndicator(node.mode, version2);
+ }
+ }
+ }
+ prevNodeIds = currentNodeIds;
+ }
+ for (let n = 0; n < prevNodeIds.length; n++) {
+ graph[prevNodeIds[n]].end = 0;
+ }
+ return { map: graph, table };
+ }
+ function buildSingleSegment(data, modesHint) {
+ let mode2;
+ const bestMode = Mode2.getBestModeForData(data);
+ mode2 = Mode2.from(modesHint, bestMode);
+ if (mode2 !== Mode2.BYTE && mode2.bit < bestMode.bit) {
+ throw new Error('"' + data + '" cannot be encoded with mode ' + Mode2.toString(mode2) + ".\n Suggested mode is: " + Mode2.toString(bestMode));
+ }
+ if (mode2 === Mode2.KANJI && !Utils2.isKanjiModeEnabled()) {
+ mode2 = Mode2.BYTE;
+ }
+ switch (mode2) {
+ case Mode2.NUMERIC:
+ return new NumericData2(data);
+ case Mode2.ALPHANUMERIC:
+ return new AlphanumericData2(data);
+ case Mode2.KANJI:
+ return new KanjiData2(data);
+ case Mode2.BYTE:
+ return new ByteData2(data);
+ }
+ }
+ exports.fromArray = function fromArray(array) {
+ return array.reduce(function(acc, seg) {
+ if (typeof seg === "string") {
+ acc.push(buildSingleSegment(seg, null));
+ } else if (seg.data) {
+ acc.push(buildSingleSegment(seg.data, seg.mode));
+ }
+ return acc;
+ }, []);
+ };
+ exports.fromString = function fromString(data, version2) {
+ const segs = getSegmentsFromString(data, Utils2.isKanjiModeEnabled());
+ const nodes = buildNodes(segs);
+ const graph = buildGraph(nodes, version2);
+ const path = dijkstra2.find_path(graph.map, "start", "end");
+ const optimizedSegs = [];
+ for (let i = 1; i < path.length - 1; i++) {
+ optimizedSegs.push(graph.table[path[i]].node);
+ }
+ return exports.fromArray(mergeSegments(optimizedSegs));
+ };
+ exports.rawSplit = function rawSplit(data) {
+ return exports.fromArray(
+ getSegmentsFromString(data, Utils2.isKanjiModeEnabled())
+ );
+ };
+})(segments);
+const Utils$1 = utils$1;
+const ECLevel = errorCorrectionLevel;
+const BitBuffer = bitBuffer;
+const BitMatrix = bitMatrix;
+const AlignmentPattern = alignmentPattern;
+const FinderPattern = finderPattern;
+const MaskPattern = maskPattern;
+const ECCode = errorCorrectionCode;
+const ReedSolomonEncoder = reedSolomonEncoder;
+const Version = version;
+const FormatInfo = formatInfo;
+const Mode = mode;
+const Segments = segments;
+function setupFinderPattern(matrix, version2) {
+ const size = matrix.size;
+ const pos = FinderPattern.getPositions(version2);
+ for (let i = 0; i < pos.length; i++) {
+ const row = pos[i][0];
+ const col = pos[i][1];
+ for (let r = -1; r <= 7; r++) {
+ if (row + r <= -1 || size <= row + r) continue;
+ for (let c = -1; c <= 7; c++) {
+ if (col + c <= -1 || size <= col + c) continue;
+ if (r >= 0 && r <= 6 && (c === 0 || c === 6) || c >= 0 && c <= 6 && (r === 0 || r === 6) || r >= 2 && r <= 4 && c >= 2 && c <= 4) {
+ matrix.set(row + r, col + c, true, true);
+ } else {
+ matrix.set(row + r, col + c, false, true);
+ }
+ }
+ }
+ }
+}
+function setupTimingPattern(matrix) {
+ const size = matrix.size;
+ for (let r = 8; r < size - 8; r++) {
+ const value = r % 2 === 0;
+ matrix.set(r, 6, value, true);
+ matrix.set(6, r, value, true);
+ }
+}
+function setupAlignmentPattern(matrix, version2) {
+ const pos = AlignmentPattern.getPositions(version2);
+ for (let i = 0; i < pos.length; i++) {
+ const row = pos[i][0];
+ const col = pos[i][1];
+ for (let r = -2; r <= 2; r++) {
+ for (let c = -2; c <= 2; c++) {
+ if (r === -2 || r === 2 || c === -2 || c === 2 || r === 0 && c === 0) {
+ matrix.set(row + r, col + c, true, true);
+ } else {
+ matrix.set(row + r, col + c, false, true);
+ }
+ }
+ }
+ }
+}
+function setupVersionInfo(matrix, version2) {
+ const size = matrix.size;
+ const bits = Version.getEncodedBits(version2);
+ let row, col, mod;
+ for (let i = 0; i < 18; i++) {
+ row = Math.floor(i / 3);
+ col = i % 3 + size - 8 - 3;
+ mod = (bits >> i & 1) === 1;
+ matrix.set(row, col, mod, true);
+ matrix.set(col, row, mod, true);
+ }
+}
+function setupFormatInfo(matrix, errorCorrectionLevel2, maskPattern2) {
+ const size = matrix.size;
+ const bits = FormatInfo.getEncodedBits(errorCorrectionLevel2, maskPattern2);
+ let i, mod;
+ for (i = 0; i < 15; i++) {
+ mod = (bits >> i & 1) === 1;
+ if (i < 6) {
+ matrix.set(i, 8, mod, true);
+ } else if (i < 8) {
+ matrix.set(i + 1, 8, mod, true);
+ } else {
+ matrix.set(size - 15 + i, 8, mod, true);
+ }
+ if (i < 8) {
+ matrix.set(8, size - i - 1, mod, true);
+ } else if (i < 9) {
+ matrix.set(8, 15 - i - 1 + 1, mod, true);
+ } else {
+ matrix.set(8, 15 - i - 1, mod, true);
+ }
+ }
+ matrix.set(size - 8, 8, 1, true);
+}
+function setupData(matrix, data) {
+ const size = matrix.size;
+ let inc = -1;
+ let row = size - 1;
+ let bitIndex = 7;
+ let byteIndex = 0;
+ for (let col = size - 1; col > 0; col -= 2) {
+ if (col === 6) col--;
+ while (true) {
+ for (let c = 0; c < 2; c++) {
+ if (!matrix.isReserved(row, col - c)) {
+ let dark = false;
+ if (byteIndex < data.length) {
+ dark = (data[byteIndex] >>> bitIndex & 1) === 1;
+ }
+ matrix.set(row, col - c, dark);
+ bitIndex--;
+ if (bitIndex === -1) {
+ byteIndex++;
+ bitIndex = 7;
+ }
+ }
+ }
+ row += inc;
+ if (row < 0 || size <= row) {
+ row -= inc;
+ inc = -inc;
+ break;
+ }
+ }
+ }
+}
+function createData(version2, errorCorrectionLevel2, segments2) {
+ const buffer = new BitBuffer();
+ segments2.forEach(function(data) {
+ buffer.put(data.mode.bit, 4);
+ buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version2));
+ data.write(buffer);
+ });
+ const totalCodewords = Utils$1.getSymbolTotalCodewords(version2);
+ const ecTotalCodewords = ECCode.getTotalCodewordsCount(version2, errorCorrectionLevel2);
+ const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
+ if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {
+ buffer.put(0, 4);
+ }
+ while (buffer.getLengthInBits() % 8 !== 0) {
+ buffer.putBit(0);
+ }
+ const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8;
+ for (let i = 0; i < remainingByte; i++) {
+ buffer.put(i % 2 ? 17 : 236, 8);
+ }
+ return createCodewords(buffer, version2, errorCorrectionLevel2);
+}
+function createCodewords(bitBuffer2, version2, errorCorrectionLevel2) {
+ const totalCodewords = Utils$1.getSymbolTotalCodewords(version2);
+ const ecTotalCodewords = ECCode.getTotalCodewordsCount(version2, errorCorrectionLevel2);
+ const dataTotalCodewords = totalCodewords - ecTotalCodewords;
+ const ecTotalBlocks = ECCode.getBlocksCount(version2, errorCorrectionLevel2);
+ const blocksInGroup2 = totalCodewords % ecTotalBlocks;
+ const blocksInGroup1 = ecTotalBlocks - blocksInGroup2;
+ const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks);
+ const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks);
+ const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1;
+ const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1;
+ const rs = new ReedSolomonEncoder(ecCount);
+ let offset = 0;
+ const dcData = new Array(ecTotalBlocks);
+ const ecData = new Array(ecTotalBlocks);
+ let maxDataSize = 0;
+ const buffer = new Uint8Array(bitBuffer2.buffer);
+ for (let b = 0; b < ecTotalBlocks; b++) {
+ const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2;
+ dcData[b] = buffer.slice(offset, offset + dataSize);
+ ecData[b] = rs.encode(dcData[b]);
+ offset += dataSize;
+ maxDataSize = Math.max(maxDataSize, dataSize);
+ }
+ const data = new Uint8Array(totalCodewords);
+ let index = 0;
+ let i, r;
+ for (i = 0; i < maxDataSize; i++) {
+ for (r = 0; r < ecTotalBlocks; r++) {
+ if (i < dcData[r].length) {
+ data[index++] = dcData[r][i];
+ }
+ }
+ }
+ for (i = 0; i < ecCount; i++) {
+ for (r = 0; r < ecTotalBlocks; r++) {
+ data[index++] = ecData[r][i];
+ }
+ }
+ return data;
+}
+function createSymbol(data, version2, errorCorrectionLevel2, maskPattern2) {
+ let segments2;
+ if (Array.isArray(data)) {
+ segments2 = Segments.fromArray(data);
+ } else if (typeof data === "string") {
+ let estimatedVersion = version2;
+ if (!estimatedVersion) {
+ const rawSegments = Segments.rawSplit(data);
+ estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel2);
+ }
+ segments2 = Segments.fromString(data, estimatedVersion || 40);
+ } else {
+ throw new Error("Invalid data");
+ }
+ const bestVersion = Version.getBestVersionForData(segments2, errorCorrectionLevel2);
+ if (!bestVersion) {
+ throw new Error("The amount of data is too big to be stored in a QR Code");
+ }
+ if (!version2) {
+ version2 = bestVersion;
+ } else if (version2 < bestVersion) {
+ throw new Error(
+ "\nThe chosen QR Code version cannot contain this amount of data.\nMinimum version required to store current data is: " + bestVersion + ".\n"
+ );
+ }
+ const dataBits = createData(version2, errorCorrectionLevel2, segments2);
+ const moduleCount = Utils$1.getSymbolSize(version2);
+ const modules = new BitMatrix(moduleCount);
+ setupFinderPattern(modules, version2);
+ setupTimingPattern(modules);
+ setupAlignmentPattern(modules, version2);
+ setupFormatInfo(modules, errorCorrectionLevel2, 0);
+ if (version2 >= 7) {
+ setupVersionInfo(modules, version2);
+ }
+ setupData(modules, dataBits);
+ if (isNaN(maskPattern2)) {
+ maskPattern2 = MaskPattern.getBestMask(
+ modules,
+ setupFormatInfo.bind(null, modules, errorCorrectionLevel2)
+ );
+ }
+ MaskPattern.applyMask(maskPattern2, modules);
+ setupFormatInfo(modules, errorCorrectionLevel2, maskPattern2);
+ return {
+ modules,
+ version: version2,
+ errorCorrectionLevel: errorCorrectionLevel2,
+ maskPattern: maskPattern2,
+ segments: segments2
+ };
+}
+qrcode.create = function create(data, options) {
+ if (typeof data === "undefined" || data === "") {
+ throw new Error("No input text");
+ }
+ let errorCorrectionLevel2 = ECLevel.M;
+ let version2;
+ let mask;
+ if (typeof options !== "undefined") {
+ errorCorrectionLevel2 = ECLevel.from(options.errorCorrectionLevel, ECLevel.M);
+ version2 = Version.from(options.version);
+ mask = MaskPattern.from(options.maskPattern);
+ if (options.toSJISFunc) {
+ Utils$1.setToSJISFunction(options.toSJISFunc);
+ }
+ }
+ return createSymbol(data, version2, errorCorrectionLevel2, mask);
+};
+var canvas = {};
+var utils = {};
+(function(exports) {
+ function hex2rgba(hex) {
+ if (typeof hex === "number") {
+ hex = hex.toString();
+ }
+ if (typeof hex !== "string") {
+ throw new Error("Color should be defined as hex string");
+ }
+ let hexCode = hex.slice().replace("#", "").split("");
+ if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {
+ throw new Error("Invalid hex color: " + hex);
+ }
+ if (hexCode.length === 3 || hexCode.length === 4) {
+ hexCode = Array.prototype.concat.apply([], hexCode.map(function(c) {
+ return [c, c];
+ }));
+ }
+ if (hexCode.length === 6) hexCode.push("F", "F");
+ const hexValue = parseInt(hexCode.join(""), 16);
+ return {
+ r: hexValue >> 24 & 255,
+ g: hexValue >> 16 & 255,
+ b: hexValue >> 8 & 255,
+ a: hexValue & 255,
+ hex: "#" + hexCode.slice(0, 6).join("")
+ };
+ }
+ exports.getOptions = function getOptions(options) {
+ if (!options) options = {};
+ if (!options.color) options.color = {};
+ const margin = typeof options.margin === "undefined" || options.margin === null || options.margin < 0 ? 4 : options.margin;
+ const width = options.width && options.width >= 21 ? options.width : void 0;
+ const scale = options.scale || 4;
+ return {
+ width,
+ scale: width ? 4 : scale,
+ margin,
+ color: {
+ dark: hex2rgba(options.color.dark || "#000000ff"),
+ light: hex2rgba(options.color.light || "#ffffffff")
+ },
+ type: options.type,
+ rendererOpts: options.rendererOpts || {}
+ };
+ };
+ exports.getScale = function getScale(qrSize, opts) {
+ return opts.width && opts.width >= qrSize + opts.margin * 2 ? opts.width / (qrSize + opts.margin * 2) : opts.scale;
+ };
+ exports.getImageWidth = function getImageWidth(qrSize, opts) {
+ const scale = exports.getScale(qrSize, opts);
+ return Math.floor((qrSize + opts.margin * 2) * scale);
+ };
+ exports.qrToImageData = function qrToImageData(imgData, qr, opts) {
+ const size = qr.modules.size;
+ const data = qr.modules.data;
+ const scale = exports.getScale(size, opts);
+ const symbolSize = Math.floor((size + opts.margin * 2) * scale);
+ const scaledMargin = opts.margin * scale;
+ const palette = [opts.color.light, opts.color.dark];
+ for (let i = 0; i < symbolSize; i++) {
+ for (let j = 0; j < symbolSize; j++) {
+ let posDst = (i * symbolSize + j) * 4;
+ let pxColor = opts.color.light;
+ if (i >= scaledMargin && j >= scaledMargin && i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {
+ const iSrc = Math.floor((i - scaledMargin) / scale);
+ const jSrc = Math.floor((j - scaledMargin) / scale);
+ pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0];
+ }
+ imgData[posDst++] = pxColor.r;
+ imgData[posDst++] = pxColor.g;
+ imgData[posDst++] = pxColor.b;
+ imgData[posDst] = pxColor.a;
+ }
+ }
+ };
+})(utils);
+(function(exports) {
+ const Utils2 = utils;
+ function clearCanvas(ctx, canvas2, size) {
+ ctx.clearRect(0, 0, canvas2.width, canvas2.height);
+ if (!canvas2.style) canvas2.style = {};
+ canvas2.height = size;
+ canvas2.width = size;
+ canvas2.style.height = size + "px";
+ canvas2.style.width = size + "px";
+ }
+ function getCanvasElement() {
+ try {
+ return document.createElement("canvas");
+ } catch (e) {
+ throw new Error("You need to specify a canvas element");
+ }
+ }
+ exports.render = function render2(qrData, canvas2, options) {
+ let opts = options;
+ let canvasEl = canvas2;
+ if (typeof opts === "undefined" && (!canvas2 || !canvas2.getContext)) {
+ opts = canvas2;
+ canvas2 = void 0;
+ }
+ if (!canvas2) {
+ canvasEl = getCanvasElement();
+ }
+ opts = Utils2.getOptions(opts);
+ const size = Utils2.getImageWidth(qrData.modules.size, opts);
+ const ctx = canvasEl.getContext("2d");
+ const image = ctx.createImageData(size, size);
+ Utils2.qrToImageData(image.data, qrData, opts);
+ clearCanvas(ctx, canvasEl, size);
+ ctx.putImageData(image, 0, 0);
+ return canvasEl;
+ };
+ exports.renderToDataURL = function renderToDataURL(qrData, canvas2, options) {
+ let opts = options;
+ if (typeof opts === "undefined" && (!canvas2 || !canvas2.getContext)) {
+ opts = canvas2;
+ canvas2 = void 0;
+ }
+ if (!opts) opts = {};
+ const canvasEl = exports.render(qrData, canvas2, opts);
+ const type = opts.type || "image/png";
+ const rendererOpts = opts.rendererOpts || {};
+ return canvasEl.toDataURL(type, rendererOpts.quality);
+ };
+})(canvas);
+var svgTag = {};
+const Utils = utils;
+function getColorAttrib(color, attrib) {
+ const alpha = color.a / 255;
+ const str = attrib + '="' + color.hex + '"';
+ return alpha < 1 ? str + " " + attrib + '-opacity="' + alpha.toFixed(2).slice(1) + '"' : str;
+}
+function svgCmd(cmd, x, y) {
+ let str = cmd + x;
+ if (typeof y !== "undefined") str += " " + y;
+ return str;
+}
+function qrToPath(data, size, margin) {
+ let path = "";
+ let moveBy = 0;
+ let newRow = false;
+ let lineLength = 0;
+ for (let i = 0; i < data.length; i++) {
+ const col = Math.floor(i % size);
+ const row = Math.floor(i / size);
+ if (!col && !newRow) newRow = true;
+ if (data[i]) {
+ lineLength++;
+ if (!(i > 0 && col > 0 && data[i - 1])) {
+ path += newRow ? svgCmd("M", col + margin, 0.5 + row + margin) : svgCmd("m", moveBy, 0);
+ moveBy = 0;
+ newRow = false;
+ }
+ if (!(col + 1 < size && data[i + 1])) {
+ path += svgCmd("h", lineLength);
+ lineLength = 0;
+ }
+ } else {
+ moveBy++;
+ }
+ }
+ return path;
+}
+svgTag.render = function render(qrData, options, cb) {
+ const opts = Utils.getOptions(options);
+ const size = qrData.modules.size;
+ const data = qrData.modules.data;
+ const qrcodesize = size + opts.margin * 2;
+ const bg = !opts.color.light.a ? "" : "';
+ const path = "';
+ const viewBox = 'viewBox="0 0 ' + qrcodesize + " " + qrcodesize + '"';
+ const width = !opts.width ? "" : 'width="' + opts.width + '" height="' + opts.width + '" ';
+ const svgTag2 = '\n";
+ if (typeof cb === "function") {
+ cb(null, svgTag2);
+ }
+ return svgTag2;
+};
+const canPromise = canPromise$1;
+const QRCode = qrcode;
+const CanvasRenderer = canvas;
+const SvgRenderer = svgTag;
+function renderCanvas(renderFunc, canvas2, 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 = canvas2;
+ canvas2 = opts = void 0;
+ } else if (argsNum === 3) {
+ if (canvas2.getContext && typeof cb === "undefined") {
+ cb = opts;
+ opts = void 0;
+ } else {
+ cb = opts;
+ opts = text;
+ text = canvas2;
+ canvas2 = void 0;
+ }
+ }
+ } else {
+ if (argsNum < 1) {
+ throw new Error("Too few arguments provided");
+ }
+ if (argsNum === 1) {
+ text = canvas2;
+ canvas2 = opts = void 0;
+ } else if (argsNum === 2 && !canvas2.getContext) {
+ opts = text;
+ text = canvas2;
+ canvas2 = void 0;
+ }
+ return new Promise(function(resolve, reject) {
+ try {
+ const data = QRCode.create(text, opts);
+ resolve(renderFunc(data, canvas2, opts));
+ } catch (e) {
+ reject(e);
+ }
+ });
+ }
+ try {
+ const data = QRCode.create(text, opts);
+ cb(null, renderFunc(data, canvas2, 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);
+});
+const generateQRCode = async (text, foregroundColor = "#000000", backgroundColor = "#FFFFFF") => {
+ try {
+ const dataUrl = await browser.toDataURL(text, {
+ color: {
+ dark: foregroundColor,
+ light: backgroundColor
+ },
+ width: 512,
+ margin: 2,
+ errorCorrectionLevel: "H"
+ });
+ return dataUrl;
+ } catch (error) {
+ console.error("Error generating QR code:", error);
+ return null;
+ }
+};
+const generateSVGQRCode = async (text, foregroundColor = "#000000", backgroundColor = "#FFFFFF") => {
+ try {
+ const svgString = await browser.toString(text, {
+ type: "svg",
+ width: 512,
+ margin: 2,
+ errorCorrectionLevel: "H",
+ color: {
+ dark: foregroundColor,
+ light: backgroundColor
+ }
+ });
+ return svgString;
+ } catch (error) {
+ console.error("Error generating SVG QR code:", error);
+ return null;
+ }
+};
+const addImageToQRCode = async (qrCodeUrl, imageUrl, imageSize = 20) => {
+ return new Promise((resolve) => {
+ const canvas2 = document.createElement("canvas");
+ const ctx = canvas2.getContext("2d");
+ canvas2.width = 512;
+ canvas2.height = 512;
+ const qrImage = new Image();
+ const customImage = new Image();
+ qrImage.onload = () => {
+ ctx.drawImage(qrImage, 0, 0, 512, 512);
+ customImage.onload = () => {
+ const calculatedImageSize = 512 * (imageSize / 100);
+ const margin = 16;
+ const boxSize = calculatedImageSize + margin * 2;
+ const boxX = (512 - boxSize) / 2;
+ const boxY = (512 - boxSize) / 2;
+ ctx.fillStyle = "#FFFFFF";
+ ctx.fillRect(boxX, boxY, boxSize, boxSize);
+ const imageX = boxX + margin;
+ const imageY = boxY + margin;
+ ctx.drawImage(customImage, imageX, imageY, calculatedImageSize, calculatedImageSize);
+ resolve(canvas2.toDataURL("image/png"));
+ };
+ customImage.onerror = () => {
+ console.error("Error loading custom image");
+ resolve(qrCodeUrl);
+ };
+ customImage.src = imageUrl;
+ };
+ qrImage.onerror = () => {
+ console.error("Error loading QR code");
+ resolve(qrCodeUrl);
+ };
+ qrImage.src = qrCodeUrl;
+ });
+};
+const vectorizeBitmap = (img, targetSize, x, y, svgDoc) => {
+ return new Promise((resolve) => {
+ const canvas2 = document.createElement("canvas");
+ const ctx = canvas2.getContext("2d");
+ canvas2.width = img.width;
+ canvas2.height = img.height;
+ ctx.drawImage(img, 0, 0);
+ const imageData = ctx.getImageData(0, 0, canvas2.width, canvas2.height);
+ const group = svgDoc.createElementNS("http://www.w3.org/2000/svg", "g");
+ const scale = targetSize / Math.max(img.width, img.height);
+ group.setAttribute("transform", `translate(${x.toFixed(2)}, ${y.toFixed(2)}) scale(${scale.toFixed(4)})`);
+ const sampleSize = Math.max(1, Math.floor(Math.min(img.width, img.height) / 32));
+ const data = imageData.data;
+ for (let y2 = 0; y2 < img.height; y2 += sampleSize) {
+ for (let x2 = 0; x2 < img.width; x2 += sampleSize) {
+ const index = (y2 * img.width + x2) * 4;
+ const r = data[index];
+ const g = data[index + 1];
+ const b = data[index + 2];
+ const a = data[index + 3];
+ if (a > 128 && (r > 0 || g > 0 || b > 0)) {
+ const rect = svgDoc.createElementNS("http://www.w3.org/2000/svg", "rect");
+ rect.setAttribute("x", x2.toFixed(2));
+ rect.setAttribute("y", y2.toFixed(2));
+ rect.setAttribute("width", sampleSize.toFixed(2));
+ rect.setAttribute("height", sampleSize.toFixed(2));
+ rect.setAttribute("fill", `rgb(${r}, ${g}, ${b})`);
+ group.appendChild(rect);
+ }
+ }
+ }
+ resolve(group);
+ });
+};
+const addImageToSVG = async (svgString, imageUrl, imageSize = 20) => {
+ return new Promise((resolve) => {
+ const img = new Image();
+ img.onload = () => {
+ const parser = new DOMParser();
+ const svgDoc = parser.parseFromString(svgString, "image/svg+xml");
+ const svgElement = svgDoc.documentElement;
+ const qrSize = 33;
+ const calculatedImageSize = qrSize * (imageSize / 100);
+ const margin = 2;
+ const boxSize = calculatedImageSize + margin * 2;
+ const boxX = (qrSize - boxSize) / 2;
+ const boxY = (qrSize - boxSize) / 2;
+ const imageX = boxX + margin;
+ const imageY = boxY + margin;
+ const whiteBox = svgDoc.createElementNS("http://www.w3.org/2000/svg", "rect");
+ whiteBox.setAttribute("x", boxX.toFixed(2));
+ whiteBox.setAttribute("y", boxY.toFixed(2));
+ whiteBox.setAttribute("width", boxSize.toFixed(2));
+ whiteBox.setAttribute("height", boxSize.toFixed(2));
+ whiteBox.setAttribute("fill", "#FFFFFF");
+ svgElement.appendChild(whiteBox);
+ if (imageUrl.startsWith("data:image/svg+xml")) {
+ console.log("Processing SVG image");
+ const imageElement = svgDoc.createElementNS("http://www.w3.org/2000/svg", "image");
+ imageElement.setAttribute("x", imageX.toFixed(2));
+ imageElement.setAttribute("y", imageY.toFixed(2));
+ imageElement.setAttribute("width", calculatedImageSize.toFixed(2));
+ imageElement.setAttribute("height", calculatedImageSize.toFixed(2));
+ imageElement.setAttribute("href", imageUrl);
+ svgElement.appendChild(imageElement);
+ console.log("SVG image element added");
+ const serializer = new XMLSerializer();
+ resolve(serializer.serializeToString(svgElement));
+ } else {
+ console.log("Processing bitmap image");
+ vectorizeBitmap(img, calculatedImageSize, imageX, imageY, svgDoc).then((vectorizedImage) => {
+ svgElement.appendChild(vectorizedImage);
+ console.log("Vectorized image group added");
+ const serializer = new XMLSerializer();
+ resolve(serializer.serializeToString(svgElement));
+ }).catch((error) => {
+ console.error("Vectorization failed:", error);
+ const serializer = new XMLSerializer();
+ resolve(serializer.serializeToString(svgElement));
+ });
+ }
+ };
+ img.onerror = () => {
+ console.error("Error loading image for SVG");
+ resolve(svgString);
+ };
+ img.src = imageUrl;
+ });
+};
+const generateCompleteSVGQRCode = async (text, imageUrl = null, imageSize = 20, foregroundColor = "#000000", backgroundColor = "#FFFFFF") => {
+ try {
+ const svgString = await generateSVGQRCode(text, foregroundColor, backgroundColor);
+ if (!svgString) {
+ return null;
+ }
+ if (imageUrl) {
+ console.log("Adding custom image to SVG...");
+ const result = await addImageToSVG(svgString, imageUrl, imageSize);
+ console.log("SVG with image generated");
+ return result;
+ }
+ return svgString;
+ } catch (error) {
+ console.error("Error generating complete SVG QR code:", error);
+ return null;
+ }
+};
+const downloadSVG = (svgContent, filename = "qrcode.svg") => {
+ if (!svgContent) {
+ console.error("No SVG content to download");
+ return;
+ }
+ const blob = new Blob([svgContent], { type: "image/svg+xml" });
+ const url = URL.createObjectURL(blob);
+ const a = document.createElement("a");
+ a.href = url;
+ a.download = filename;
+ document.body.appendChild(a);
+ a.click();
+ document.body.removeChild(a);
+ URL.revokeObjectURL(url);
+};
+const fileToDataURL = (file) => {
+ return new Promise((resolve, reject) => {
+ const reader = new FileReader();
+ reader.onload = () => resolve(reader.result);
+ reader.onerror = reject;
+ reader.readAsDataURL(file);
+ });
+};
+const validateImageFile = (file, maxSize = 2 * 1024 * 1024) => {
+ const allowedTypes = ["image/jpeg", "image/png", "image/gif", "image/webp", "image/svg+xml"];
+ if (!allowedTypes.includes(file.type)) {
+ return {
+ success: false,
+ error: "Please select a valid image file (JPEG, PNG, GIF, WebP, or SVG)"
+ };
+ }
+ if (file.size > maxSize) {
+ return {
+ success: false,
+ error: `File size must be less than ${Math.round(maxSize / 1024 / 1024)}MB`
+ };
+ }
+ return { success: true };
+};
+export {
+ addImageToQRCode,
+ addImageToSVG,
+ downloadSVG,
+ fileToDataURL,
+ generateCompleteSVGQRCode,
+ generateQRCode,
+ generateSVGQRCode,
+ validateImageFile,
+ vectorizeBitmap
+};
+//# sourceMappingURL=qr-code-utils.es.js.map
diff --git a/dist/qr-code-utils.es.js.map b/dist/qr-code-utils.es.js.map
new file mode 100644
index 0000000..a42659a
--- /dev/null
+++ b/dist/qr-code-utils.es.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"qr-code-utils.es.js","sources":["../node_modules/qrcode/lib/can-promise.js","../node_modules/qrcode/lib/core/utils.js","../node_modules/qrcode/lib/core/error-correction-level.js","../node_modules/qrcode/lib/core/bit-buffer.js","../node_modules/qrcode/lib/core/bit-matrix.js","../node_modules/qrcode/lib/core/alignment-pattern.js","../node_modules/qrcode/lib/core/finder-pattern.js","../node_modules/qrcode/lib/core/mask-pattern.js","../node_modules/qrcode/lib/core/error-correction-code.js","../node_modules/qrcode/lib/core/galois-field.js","../node_modules/qrcode/lib/core/polynomial.js","../node_modules/qrcode/lib/core/reed-solomon-encoder.js","../node_modules/qrcode/lib/core/version-check.js","../node_modules/qrcode/lib/core/regex.js","../node_modules/qrcode/lib/core/mode.js","../node_modules/qrcode/lib/core/version.js","../node_modules/qrcode/lib/core/format-info.js","../node_modules/qrcode/lib/core/numeric-data.js","../node_modules/qrcode/lib/core/alphanumeric-data.js","../node_modules/qrcode/lib/core/byte-data.js","../node_modules/qrcode/lib/core/kanji-data.js","../node_modules/dijkstrajs/dijkstra.js","../node_modules/qrcode/lib/core/segments.js","../node_modules/qrcode/lib/core/qrcode.js","../node_modules/qrcode/lib/renderer/utils.js","../node_modules/qrcode/lib/renderer/canvas.js","../node_modules/qrcode/lib/renderer/svg-tag.js","../node_modules/qrcode/lib/browser.js","../src/utils/qrCodeUtils.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","let toSJISFunction\nconst CODEWORDS_COUNT = [\n 0, // Not used\n 26, 44, 70, 100, 134, 172, 196, 242, 292, 346,\n 404, 466, 532, 581, 655, 733, 815, 901, 991, 1085,\n 1156, 1258, 1364, 1474, 1588, 1706, 1828, 1921, 2051, 2185,\n 2323, 2465, 2611, 2761, 2876, 3034, 3196, 3362, 3532, 3706\n]\n\n/**\n * Returns the QR Code size for the specified version\n *\n * @param {Number} version QR Code version\n * @return {Number} size of QR code\n */\nexports.getSymbolSize = function getSymbolSize (version) {\n if (!version) throw new Error('\"version\" cannot be null or undefined')\n if (version < 1 || version > 40) throw new Error('\"version\" should be in range from 1 to 40')\n return version * 4 + 17\n}\n\n/**\n * Returns the total number of codewords used to store data and EC information.\n *\n * @param {Number} version QR Code version\n * @return {Number} Data length in bits\n */\nexports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {\n return CODEWORDS_COUNT[version]\n}\n\n/**\n * Encode data with Bose-Chaudhuri-Hocquenghem\n *\n * @param {Number} data Value to encode\n * @return {Number} Encoded value\n */\nexports.getBCHDigit = function (data) {\n let digit = 0\n\n while (data !== 0) {\n digit++\n data >>>= 1\n }\n\n return digit\n}\n\nexports.setToSJISFunction = function setToSJISFunction (f) {\n if (typeof f !== 'function') {\n throw new Error('\"toSJISFunc\" is not a valid function.')\n }\n\n toSJISFunction = f\n}\n\nexports.isKanjiModeEnabled = function () {\n return typeof toSJISFunction !== 'undefined'\n}\n\nexports.toSJIS = function toSJIS (kanji) {\n return toSJISFunction(kanji)\n}\n","exports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n const lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'l':\n case 'low':\n return exports.L\n\n case 'm':\n case 'medium':\n return exports.M\n\n case 'q':\n case 'quartile':\n return exports.Q\n\n case 'h':\n case 'high':\n return exports.H\n\n default:\n throw new Error('Unknown EC Level: ' + string)\n }\n}\n\nexports.isValid = function isValid (level) {\n return level && typeof level.bit !== 'undefined' &&\n level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n","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","/**\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","/**\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","const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n const size = getSymbolSize(version)\n\n return [\n // top-left\n [0, 0],\n // top-right\n [size - FINDER_PATTERN_SIZE, 0],\n // bottom-left\n [0, size - FINDER_PATTERN_SIZE]\n ]\n}\n","/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n PATTERN000: 0,\n PATTERN001: 1,\n PATTERN010: 2,\n PATTERN011: 3,\n PATTERN100: 4,\n PATTERN101: 5,\n PATTERN110: 6,\n PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n N1: 3,\n N2: 3,\n N3: 40,\n N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param {Number} mask Mask pattern\n * @return {Boolean} true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param {Number|String} value Mask pattern value\n * @return {Number} Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n const size = data.size\n let points = 0\n let sameCountCol = 0\n let sameCountRow = 0\n let lastCol = null\n let lastRow = null\n\n for (let row = 0; row < size; row++) {\n sameCountCol = sameCountRow = 0\n lastCol = lastRow = null\n\n for (let col = 0; col < size; col++) {\n let module = data.get(row, col)\n if (module === lastCol) {\n sameCountCol++\n } else {\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n lastCol = module\n sameCountCol = 1\n }\n\n module = data.get(col, row)\n if (module === lastRow) {\n sameCountRow++\n } else {\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n lastRow = module\n sameCountRow = 1\n }\n }\n\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n }\n\n return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n const size = data.size\n let points = 0\n\n for (let row = 0; row < size - 1; row++) {\n for (let col = 0; col < size - 1; col++) {\n const last = data.get(row, col) +\n data.get(row, col + 1) +\n data.get(row + 1, col) +\n data.get(row + 1, col + 1)\n\n if (last === 4 || last === 0) points++\n }\n }\n\n return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n const size = data.size\n let points = 0\n let bitsCol = 0\n let bitsRow = 0\n\n for (let row = 0; row < size; row++) {\n bitsCol = bitsRow = 0\n for (let col = 0; col < size; col++) {\n bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n }\n }\n\n return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n let darkCount = 0\n const modulesCount = data.data.length\n\n for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param {Number} maskPattern Pattern reference value\n * @param {Number} i Row\n * @param {Number} j Column\n * @return {Boolean} Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n switch (maskPattern) {\n case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n case exports.Patterns.PATTERN001: return i % 2 === 0\n case exports.Patterns.PATTERN010: return j % 3 === 0\n case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n default: throw new Error('bad maskPattern:' + maskPattern)\n }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param {Number} pattern Pattern reference number\n * @param {BitMatrix} data BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n const size = data.size\n\n for (let col = 0; col < size; col++) {\n for (let row = 0; row < size; row++) {\n if (data.isReserved(row, col)) continue\n data.xor(row, col, getMaskAt(pattern, row, col))\n }\n }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n const numPatterns = Object.keys(exports.Patterns).length\n let bestPattern = 0\n let lowerPenalty = Infinity\n\n for (let p = 0; p < numPatterns; p++) {\n setupFormatFunc(p)\n exports.applyMask(p, data)\n\n // Calculate penalty\n const penalty =\n exports.getPenaltyN1(data) +\n exports.getPenaltyN2(data) +\n exports.getPenaltyN3(data) +\n exports.getPenaltyN4(data)\n\n // Undo previously applied mask\n exports.applyMask(p, data)\n\n if (penalty < lowerPenalty) {\n lowerPenalty = penalty\n bestPattern = p\n }\n }\n\n return bestPattern\n}\n","const ECLevel = require('./error-correction-level')\r\n\r\nconst EC_BLOCKS_TABLE = [\r\n// L M Q H\r\n 1, 1, 1, 1,\r\n 1, 1, 1, 1,\r\n 1, 1, 2, 2,\r\n 1, 2, 2, 4,\r\n 1, 2, 4, 4,\r\n 2, 4, 4, 4,\r\n 2, 4, 6, 5,\r\n 2, 4, 6, 6,\r\n 2, 5, 8, 8,\r\n 4, 5, 8, 8,\r\n 4, 5, 8, 11,\r\n 4, 8, 10, 11,\r\n 4, 9, 12, 16,\r\n 4, 9, 16, 16,\r\n 6, 10, 12, 18,\r\n 6, 10, 17, 16,\r\n 6, 11, 16, 19,\r\n 6, 13, 18, 21,\r\n 7, 14, 21, 25,\r\n 8, 16, 20, 25,\r\n 8, 17, 23, 25,\r\n 9, 17, 23, 34,\r\n 9, 18, 25, 30,\r\n 10, 20, 27, 32,\r\n 12, 21, 29, 35,\r\n 12, 23, 34, 37,\r\n 12, 25, 34, 40,\r\n 13, 26, 35, 42,\r\n 14, 28, 38, 45,\r\n 15, 29, 40, 48,\r\n 16, 31, 43, 51,\r\n 17, 33, 45, 54,\r\n 18, 35, 48, 57,\r\n 19, 37, 51, 60,\r\n 19, 38, 53, 63,\r\n 20, 40, 56, 66,\r\n 21, 43, 59, 70,\r\n 22, 45, 62, 74,\r\n 24, 47, 65, 77,\r\n 25, 49, 68, 81\r\n]\r\n\r\nconst EC_CODEWORDS_TABLE = [\r\n// L M Q H\r\n 7, 10, 13, 17,\r\n 10, 16, 22, 28,\r\n 15, 26, 36, 44,\r\n 20, 36, 52, 64,\r\n 26, 48, 72, 88,\r\n 36, 64, 96, 112,\r\n 40, 72, 108, 130,\r\n 48, 88, 132, 156,\r\n 60, 110, 160, 192,\r\n 72, 130, 192, 224,\r\n 80, 150, 224, 264,\r\n 96, 176, 260, 308,\r\n 104, 198, 288, 352,\r\n 120, 216, 320, 384,\r\n 132, 240, 360, 432,\r\n 144, 280, 408, 480,\r\n 168, 308, 448, 532,\r\n 180, 338, 504, 588,\r\n 196, 364, 546, 650,\r\n 224, 416, 600, 700,\r\n 224, 442, 644, 750,\r\n 252, 476, 690, 816,\r\n 270, 504, 750, 900,\r\n 300, 560, 810, 960,\r\n 312, 588, 870, 1050,\r\n 336, 644, 952, 1110,\r\n 360, 700, 1020, 1200,\r\n 390, 728, 1050, 1260,\r\n 420, 784, 1140, 1350,\r\n 450, 812, 1200, 1440,\r\n 480, 868, 1290, 1530,\r\n 510, 924, 1350, 1620,\r\n 540, 980, 1440, 1710,\r\n 570, 1036, 1530, 1800,\r\n 570, 1064, 1590, 1890,\r\n 600, 1120, 1680, 1980,\r\n 630, 1204, 1770, 2100,\r\n 660, 1260, 1860, 2220,\r\n 720, 1316, 1950, 2310,\r\n 750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n","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","const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param {Uint8Array} p1 Polynomial\n * @param {Uint8Array} p2 Polynomial\n * @return {Uint8Array} Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n for (let i = 0; i < p1.length; i++) {\n for (let j = 0; j < p2.length; j++) {\n coeff[i + j] ^= GF.mul(p1[i], p2[j])\n }\n }\n\n return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param {Uint8Array} divident Polynomial\n * @param {Uint8Array} divisor Polynomial\n * @return {Uint8Array} Remainder\n */\nexports.mod = function mod (divident, divisor) {\n let result = new Uint8Array(divident)\n\n while ((result.length - divisor.length) >= 0) {\n const coeff = result[0]\n\n for (let i = 0; i < divisor.length; i++) {\n result[i] ^= GF.mul(divisor[i], coeff)\n }\n\n // remove all zeros from buffer head\n let offset = 0\n while (offset < result.length && result[offset] === 0) offset++\n result = result.slice(offset)\n }\n\n return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param {Number} degree Degree of the generator polynomial\n * @return {Uint8Array} Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n let poly = new Uint8Array([1])\n for (let i = 0; i < degree; i++) {\n poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n }\n\n return poly\n}\n","const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n this.genPoly = undefined\n this.degree = degree\n\n if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n // create an irreducible generator polynomial\n this.degree = degree\n this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param {Uint8Array} data Buffer containing input data\n * @return {Uint8Array} Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n if (!this.genPoly) {\n throw new Error('Encoder not initialized')\n }\n\n // Calculate EC for this data block\n // extends data size to data+genPoly size\n const paddedData = new Uint8Array(data.length + this.degree)\n paddedData.set(data)\n\n // The error correction codewords are the remainder after dividing the data codewords\n // by a generator polynomial\n const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n // return EC data blocks (last n byte, where n is the degree of genPoly)\n // If coefficients number in remainder are less than genPoly degree,\n // pad with 0s to the left to reach the needed number of coefficients\n const start = this.degree - remainder.length\n if (start > 0) {\n const buff = new Uint8Array(this.degree)\n buff.set(remainder, start)\n\n return buff\n }\n\n return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n","/**\n * Check if QR Code version is valid\n *\n * @param {Number} version QR Code version\n * @return {Boolean} true if valid version, false otherwise\n */\nexports.isValid = function isValid (version) {\n return !isNaN(version) && version >= 1 && version <= 40\n}\n","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","const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n id: 'Numeric',\n bit: 1 << 0,\n ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n * 26 alphabetic characters (A - Z),\n * and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n id: 'Alphanumeric',\n bit: 1 << 1,\n ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n id: 'Byte',\n bit: 1 << 2,\n ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n id: 'Kanji',\n bit: 1 << 3,\n ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param {Mode} mode Data mode\n * @param {Number} version QR Code version\n * @return {Number} Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n if (!VersionCheck.isValid(version)) {\n throw new Error('Invalid version: ' + version)\n }\n\n if (version >= 1 && version < 10) return mode.ccBits[0]\n else if (version < 27) return mode.ccBits[1]\n return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param {String} dataStr Input data string\n * @return {Mode} Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n else if (Regex.testKanji(dataStr)) return exports.KANJI\n else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String} Mode name\n */\nexports.toString = function toString (mode) {\n if (mode && mode.id) return mode.id\n throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param {Mode} mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param {String} string Mode name\n * @returns {Mode} Mode object\n */\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n const lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'numeric':\n return exports.NUMERIC\n case 'alphanumeric':\n return exports.ALPHANUMERIC\n case 'kanji':\n return exports.KANJI\n case 'byte':\n return exports.BYTE\n default:\n throw new Error('Unknown mode: ' + string)\n }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param {Mode|String} value Encoding mode\n * @param {Mode} defaultValue Fallback value\n * @return {Mode} Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n","const Utils = require('./utils')\nconst ECCode = require('./error-correction-code')\nconst ECLevel = require('./error-correction-level')\nconst Mode = require('./mode')\nconst VersionCheck = require('./version-check')\n\n// Generator polynomial used to encode version information\nconst G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0)\nconst G18_BCH = Utils.getBCHDigit(G18)\n\nfunction getBestVersionForDataLength (mode, length, errorCorrectionLevel) {\n for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\nfunction getReservedBitsCount (mode, version) {\n // Character count indicator + mode indicator bits\n return Mode.getCharCountIndicator(mode, version) + 4\n}\n\nfunction getTotalBitsFromDataArray (segments, version) {\n let totalBits = 0\n\n segments.forEach(function (data) {\n const reservedBits = getReservedBitsCount(data.mode, version)\n totalBits += reservedBits + data.getBitsLength()\n })\n\n return totalBits\n}\n\nfunction getBestVersionForMixedData (segments, errorCorrectionLevel) {\n for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n const length = getTotalBitsFromDataArray(segments, currentVersion)\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, Mode.MIXED)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\n/**\n * Returns version number from a value.\n * If value is not a valid version, returns defaultValue\n *\n * @param {Number|String} value QR Code version\n * @param {Number} defaultValue Fallback value\n * @return {Number} QR Code version number\n */\nexports.from = function from (value, defaultValue) {\n if (VersionCheck.isValid(value)) {\n return parseInt(value, 10)\n }\n\n return defaultValue\n}\n\n/**\n * Returns how much data can be stored with the specified QR code version\n * and error correction level\n *\n * @param {Number} version QR Code version (1-40)\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} Quantity of storable data\n */\nexports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode) {\n if (!VersionCheck.isValid(version)) {\n throw new Error('Invalid QR Code version')\n }\n\n // Use Byte mode as default\n if (typeof mode === 'undefined') mode = Mode.BYTE\n\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n if (mode === Mode.MIXED) return dataTotalCodewordsBits\n\n const usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode, version)\n\n // Return max number of storable codewords\n switch (mode) {\n case Mode.NUMERIC:\n return Math.floor((usableBits / 10) * 3)\n\n case Mode.ALPHANUMERIC:\n return Math.floor((usableBits / 11) * 2)\n\n case Mode.KANJI:\n return Math.floor(usableBits / 13)\n\n case Mode.BYTE:\n default:\n return Math.floor(usableBits / 8)\n }\n}\n\n/**\n * Returns the minimum version needed to contain the amount of data\n *\n * @param {Segment} data Segment of data\n * @param {Number} [errorCorrectionLevel=H] Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} QR Code version\n */\nexports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel) {\n let seg\n\n const ecl = ECLevel.from(errorCorrectionLevel, ECLevel.M)\n\n if (Array.isArray(data)) {\n if (data.length > 1) {\n return getBestVersionForMixedData(data, ecl)\n }\n\n if (data.length === 0) {\n return 1\n }\n\n seg = data[0]\n } else {\n seg = data\n }\n\n return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)\n}\n\n/**\n * Returns version information with relative error correction bits\n *\n * The version information is included in QR Code symbols of version 7 or larger.\n * It consists of an 18-bit sequence containing 6 data bits,\n * with 12 error correction bits calculated using the (18, 6) Golay code.\n *\n * @param {Number} version QR Code version\n * @return {Number} Encoded version info bits\n */\nexports.getEncodedBits = function getEncodedBits (version) {\n if (!VersionCheck.isValid(version) || version < 7) {\n throw new Error('Invalid QR Code version')\n }\n\n let d = version << 12\n\n while (Utils.getBCHDigit(d) - G18_BCH >= 0) {\n d ^= (G18 << (Utils.getBCHDigit(d) - G18_BCH))\n }\n\n return (version << 12) | d\n}\n","const Utils = require('./utils')\n\nconst G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nconst G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nconst G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Number} mask Mask pattern\n * @return {Number} Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n const data = ((errorCorrectionLevel.bit << 3) | mask)\n let d = data << 10\n\n while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n }\n\n // xor final data with mask pattern in order to ensure that\n // no combination of Error Correction Level and data mask pattern\n // will result in an all-zero data string\n return ((data << 10) | d) ^ G15_MASK\n}\n","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","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","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","const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n this.mode = Mode.KANJI\n this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n let i\n\n // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n // These byte values are shifted from the JIS X 0208 values.\n // JIS X 0208 gives details of the shift coded representation.\n for (i = 0; i < this.data.length; i++) {\n let value = Utils.toSJIS(this.data[i])\n\n // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n if (value >= 0x8140 && value <= 0x9FFC) {\n // Subtract 0x8140 from Shift JIS value\n value -= 0x8140\n\n // For characters with Shift JIS values from 0xE040 to 0xEBBF\n } else if (value >= 0xE040 && value <= 0xEBBF) {\n // Subtract 0xC140 from Shift JIS value\n value -= 0xC140\n } else {\n throw new Error(\n 'Invalid SJIS character: ' + this.data[i] + '\\n' +\n 'Make sure your charset is UTF-8')\n }\n\n // Multiply most significant byte of result by 0xC0\n // and add least significant byte to product\n value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n // Convert result to a 13-bit binary string\n bitBuffer.put(value, 13)\n }\n}\n\nmodule.exports = KanjiData\n","'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 \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","const Mode = require('./mode')\nconst NumericData = require('./numeric-data')\nconst AlphanumericData = require('./alphanumeric-data')\nconst ByteData = require('./byte-data')\nconst KanjiData = require('./kanji-data')\nconst Regex = require('./regex')\nconst Utils = require('./utils')\nconst dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param {String} str Input string\n * @return {Number} Number of byte\n */\nfunction getStringByteLength (str) {\n return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param {Mode} mode Segment mode\n * @param {String} str String to process\n * @return {Array} Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n const segments = []\n let result\n\n while ((result = regex.exec(str)) !== null) {\n segments.push({\n data: result[0],\n index: result.index,\n mode: mode,\n length: result[0].length\n })\n }\n\n return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param {String} dataStr Input string\n * @return {Array} Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n let byteSegs\n let kanjiSegs\n\n if (Utils.isKanjiModeEnabled()) {\n byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n } else {\n byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n kanjiSegs = []\n }\n\n const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n return segs\n .sort(function (s1, s2) {\n return s1.index - s2.index\n })\n .map(function (obj) {\n return {\n data: obj.data,\n mode: obj.mode,\n length: obj.length\n }\n })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param {Number} length String length\n * @param {Mode} mode Segment mode\n * @return {Number} Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n switch (mode) {\n case Mode.NUMERIC:\n return NumericData.getBitsLength(length)\n case Mode.ALPHANUMERIC:\n return AlphanumericData.getBitsLength(length)\n case Mode.KANJI:\n return KanjiData.getBitsLength(length)\n case Mode.BYTE:\n return ByteData.getBitsLength(length)\n }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction mergeSegments (segs) {\n return segs.reduce(function (acc, curr) {\n const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n if (prevSeg && prevSeg.mode === curr.mode) {\n acc[acc.length - 1].data += curr.data\n return acc\n }\n\n acc.push(curr)\n return acc\n }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction buildNodes (segs) {\n const nodes = []\n for (let i = 0; i < segs.length; i++) {\n const seg = segs[i]\n\n switch (seg.mode) {\n case Mode.NUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.ALPHANUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.KANJI:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n break\n case Mode.BYTE:\n nodes.push([\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n }\n }\n\n return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param {Array} nodes Array of object with segments data\n * @param {Number} version QR Code version\n * @return {Object} Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n const table = {}\n const graph = { start: {} }\n let prevNodeIds = ['start']\n\n for (let i = 0; i < nodes.length; i++) {\n const nodeGroup = nodes[i]\n const currentNodeIds = []\n\n for (let j = 0; j < nodeGroup.length; j++) {\n const node = nodeGroup[j]\n const key = '' + i + j\n\n currentNodeIds.push(key)\n table[key] = { node: node, lastCount: 0 }\n graph[key] = {}\n\n for (let n = 0; n < prevNodeIds.length; n++) {\n const prevNodeId = prevNodeIds[n]\n\n if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n graph[prevNodeId][key] =\n getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n table[prevNodeId].lastCount += node.length\n } else {\n if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n 4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n }\n }\n }\n\n prevNodeIds = currentNodeIds\n }\n\n for (let n = 0; n < prevNodeIds.length; n++) {\n graph[prevNodeIds[n]].end = 0\n }\n\n return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param {String} data Input data\n * @param {Mode | String} modesHint Data mode\n * @return {Segment} Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n let mode\n const bestMode = Mode.getBestModeForData(data)\n\n mode = Mode.from(modesHint, bestMode)\n\n // Make sure data can be encoded\n if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n throw new Error('\"' + data + '\"' +\n ' cannot be encoded with mode ' + Mode.toString(mode) +\n '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n }\n\n // Use Mode.BYTE if Kanji support is disabled\n if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n mode = Mode.BYTE\n }\n\n switch (mode) {\n case Mode.NUMERIC:\n return new NumericData(data)\n\n case Mode.ALPHANUMERIC:\n return new AlphanumericData(data)\n\n case Mode.KANJI:\n return new KanjiData(data)\n\n case Mode.BYTE:\n return new ByteData(data)\n }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param {Array} array Array of objects with segments data\n * @return {Array} Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n return array.reduce(function (acc, seg) {\n if (typeof seg === 'string') {\n acc.push(buildSingleSegment(seg, null))\n } else if (seg.data) {\n acc.push(buildSingleSegment(seg.data, seg.mode))\n }\n\n return acc\n }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @return {Array} Array of segments\n */\nexports.fromString = function fromString (data, version) {\n const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n const nodes = buildNodes(segs)\n const graph = buildGraph(nodes, version)\n const path = dijkstra.find_path(graph.map, 'start', 'end')\n\n const optimizedSegs = []\n for (let i = 1; i < path.length - 1; i++) {\n optimizedSegs.push(graph.table[path[i]].node)\n }\n\n return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param {string} data Input string\n * @return {Array} Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n return exports.fromArray(\n getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n )\n}\n","const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n * http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n// http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n// http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n const size = matrix.size\n const pos = FinderPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -1; r <= 7; r++) {\n if (row + r <= -1 || size <= row + r) continue\n\n for (let c = -1; c <= 7; c++) {\n if (col + c <= -1 || size <= col + c) continue\n\n if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n const size = matrix.size\n\n for (let r = 8; r < size - 8; r++) {\n const value = r % 2 === 0\n matrix.set(r, 6, value, true)\n matrix.set(6, r, value, true)\n }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n const pos = AlignmentPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -2; r <= 2; r++) {\n for (let c = -2; c <= 2; c++) {\n if (r === -2 || r === 2 || c === -2 || c === 2 ||\n (r === 0 && c === 0)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n const size = matrix.size\n const bits = Version.getEncodedBits(version)\n let row, col, mod\n\n for (let i = 0; i < 18; i++) {\n row = Math.floor(i / 3)\n col = i % 3 + size - 8 - 3\n mod = ((bits >> i) & 1) === 1\n\n matrix.set(row, col, mod, true)\n matrix.set(col, row, mod, true)\n }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {Number} maskPattern Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n const size = matrix.size\n const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n let i, mod\n\n for (i = 0; i < 15; i++) {\n mod = ((bits >> i) & 1) === 1\n\n // vertical\n if (i < 6) {\n matrix.set(i, 8, mod, true)\n } else if (i < 8) {\n matrix.set(i + 1, 8, mod, true)\n } else {\n matrix.set(size - 15 + i, 8, mod, true)\n }\n\n // horizontal\n if (i < 8) {\n matrix.set(8, size - i - 1, mod, true)\n } else if (i < 9) {\n matrix.set(8, 15 - i - 1 + 1, mod, true)\n } else {\n matrix.set(8, 15 - i - 1, mod, true)\n }\n }\n\n // fixed module\n matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Uint8Array} data Data codewords\n */\nfunction setupData (matrix, data) {\n const size = matrix.size\n let inc = -1\n let row = size - 1\n let bitIndex = 7\n let byteIndex = 0\n\n for (let col = size - 1; col > 0; col -= 2) {\n if (col === 6) col--\n\n while (true) {\n for (let c = 0; c < 2; c++) {\n if (!matrix.isReserved(row, col - c)) {\n let dark = false\n\n if (byteIndex < data.length) {\n dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n }\n\n matrix.set(row, col - c, dark)\n bitIndex--\n\n if (bitIndex === -1) {\n byteIndex++\n bitIndex = 7\n }\n }\n }\n\n row += inc\n\n if (row < 0 || size <= row) {\n row -= inc\n inc = -inc\n break\n }\n }\n }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {ByteData} data Data input\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n // Prepare data buffer\n const buffer = new BitBuffer()\n\n segments.forEach(function (data) {\n // prefix data with mode indicator (4 bits)\n buffer.put(data.mode.bit, 4)\n\n // Prefix data with character count indicator.\n // The character count indicator is a string of bits that represents the\n // number of characters that are being encoded.\n // The character count indicator must be placed after the mode indicator\n // and must be a certain number of bits long, depending on the QR version\n // and data mode\n // @see {@link Mode.getCharCountIndicator}.\n buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n // add binary data sequence to buffer\n data.write(buffer)\n })\n\n // Calculate required number of bits\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n // Add a terminator.\n // If the bit string is shorter than the total number of required bits,\n // a terminator of up to four 0s must be added to the right side of the string.\n // If the bit string is more than four bits shorter than the required number of bits,\n // add four 0s to the end.\n if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n buffer.put(0, 4)\n }\n\n // If the bit string is fewer than four bits shorter, add only the number of 0s that\n // are needed to reach the required number of bits.\n\n // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n // pad the string on the right with 0s to make the string's length a multiple of 8.\n while (buffer.getLengthInBits() % 8 !== 0) {\n buffer.putBit(0)\n }\n\n // Add pad bytes if the string is still shorter than the total number of required bits.\n // Extend the buffer to fill the data capacity of the symbol corresponding to\n // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n // and 00010001 (0x11) alternately.\n const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n for (let i = 0; i < remainingByte; i++) {\n buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n }\n\n return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param {BitBuffer} bitBuffer Data to encode\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n // Total number of blocks\n const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n // Calculate how many blocks each group should contain\n const blocksInGroup2 = totalCodewords % ecTotalBlocks\n const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n // Number of EC codewords is the same for both groups\n const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n const rs = new ReedSolomonEncoder(ecCount)\n\n let offset = 0\n const dcData = new Array(ecTotalBlocks)\n const ecData = new Array(ecTotalBlocks)\n let maxDataSize = 0\n const buffer = new Uint8Array(bitBuffer.buffer)\n\n // Divide the buffer into the required number of blocks\n for (let b = 0; b < ecTotalBlocks; b++) {\n const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n // extract a block of data from buffer\n dcData[b] = buffer.slice(offset, offset + dataSize)\n\n // Calculate EC codewords for this data block\n ecData[b] = rs.encode(dcData[b])\n\n offset += dataSize\n maxDataSize = Math.max(maxDataSize, dataSize)\n }\n\n // Create final data\n // Interleave the data and error correction codewords from each block\n const data = new Uint8Array(totalCodewords)\n let index = 0\n let i, r\n\n // Add data codewords\n for (i = 0; i < maxDataSize; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n if (i < dcData[r].length) {\n data[index++] = dcData[r][i]\n }\n }\n }\n\n // Apped EC codewords\n for (i = 0; i < ecCount; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n data[index++] = ecData[r][i]\n }\n }\n\n return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @param {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param {MaskPattern} maskPattern Mask pattern\n * @return {Object} Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n let segments\n\n if (Array.isArray(data)) {\n segments = Segments.fromArray(data)\n } else if (typeof data === 'string') {\n let estimatedVersion = version\n\n if (!estimatedVersion) {\n const rawSegments = Segments.rawSplit(data)\n\n // Estimate best version that can contain raw splitted segments\n estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n }\n\n // Build optimized segments\n // If estimated version is undefined, try with the highest version\n segments = Segments.fromString(data, estimatedVersion || 40)\n } else {\n throw new Error('Invalid data')\n }\n\n // Get the min version that can contain data\n const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n // If no version is found, data cannot be stored\n if (!bestVersion) {\n throw new Error('The amount of data is too big to be stored in a QR Code')\n }\n\n // If not specified, use min version as default\n if (!version) {\n version = bestVersion\n\n // Check if the specified version can contain the data\n } else if (version < bestVersion) {\n throw new Error('\\n' +\n 'The chosen QR Code version cannot contain this amount of data.\\n' +\n 'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n )\n }\n\n const dataBits = createData(version, errorCorrectionLevel, segments)\n\n // Allocate matrix buffer\n const moduleCount = Utils.getSymbolSize(version)\n const modules = new BitMatrix(moduleCount)\n\n // Add function modules\n setupFinderPattern(modules, version)\n setupTimingPattern(modules)\n setupAlignmentPattern(modules, version)\n\n // Add temporary dummy bits for format info just to set them as reserved.\n // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n // since the masking operation must be performed only on the encoding region.\n // These blocks will be replaced with correct values later in code.\n setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n if (version >= 7) {\n setupVersionInfo(modules, version)\n }\n\n // Add data codewords\n setupData(modules, dataBits)\n\n if (isNaN(maskPattern)) {\n // Find best mask pattern\n maskPattern = MaskPattern.getBestMask(modules,\n setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n }\n\n // Apply mask pattern\n MaskPattern.applyMask(maskPattern, modules)\n\n // Replace format info bits with correct values\n setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n return {\n modules: modules,\n version: version,\n errorCorrectionLevel: errorCorrectionLevel,\n maskPattern: maskPattern,\n segments: segments\n }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data Input data\n * @param {Object} options Optional configurations\n * @param {Number} options.version QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n if (typeof data === 'undefined' || data === '') {\n throw new Error('No input text')\n }\n\n let errorCorrectionLevel = ECLevel.M\n let version\n let mask\n\n if (typeof options !== 'undefined') {\n // Use higher error correction level as default\n errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n version = Version.from(options.version)\n mask = MaskPattern.from(options.maskPattern)\n\n if (options.toSJISFunc) {\n Utils.setToSJISFunction(options.toSJISFunc)\n }\n }\n\n return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n","function hex2rgba (hex) {\n if (typeof hex === 'number') {\n hex = hex.toString()\n }\n\n if (typeof hex !== 'string') {\n throw new Error('Color should be defined as hex string')\n }\n\n let hexCode = hex.slice().replace('#', '').split('')\n if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {\n throw new Error('Invalid hex color: ' + hex)\n }\n\n // Convert from short to long form (fff -> ffffff)\n if (hexCode.length === 3 || hexCode.length === 4) {\n hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {\n return [c, c]\n }))\n }\n\n // Add default alpha value\n if (hexCode.length === 6) hexCode.push('F', 'F')\n\n const hexValue = parseInt(hexCode.join(''), 16)\n\n return {\n r: (hexValue >> 24) & 255,\n g: (hexValue >> 16) & 255,\n b: (hexValue >> 8) & 255,\n a: hexValue & 255,\n hex: '#' + hexCode.slice(0, 6).join('')\n }\n}\n\nexports.getOptions = function getOptions (options) {\n if (!options) options = {}\n if (!options.color) options.color = {}\n\n const margin = typeof options.margin === 'undefined' ||\n options.margin === null ||\n options.margin < 0\n ? 4\n : options.margin\n\n const width = options.width && options.width >= 21 ? options.width : undefined\n const scale = options.scale || 4\n\n return {\n width: width,\n scale: width ? 4 : scale,\n margin: margin,\n color: {\n dark: hex2rgba(options.color.dark || '#000000ff'),\n light: hex2rgba(options.color.light || '#ffffffff')\n },\n type: options.type,\n rendererOpts: options.rendererOpts || {}\n }\n}\n\nexports.getScale = function getScale (qrSize, opts) {\n return opts.width && opts.width >= qrSize + opts.margin * 2\n ? opts.width / (qrSize + opts.margin * 2)\n : opts.scale\n}\n\nexports.getImageWidth = function getImageWidth (qrSize, opts) {\n const scale = exports.getScale(qrSize, opts)\n return Math.floor((qrSize + opts.margin * 2) * scale)\n}\n\nexports.qrToImageData = function qrToImageData (imgData, qr, opts) {\n const size = qr.modules.size\n const data = qr.modules.data\n const scale = exports.getScale(size, opts)\n const symbolSize = Math.floor((size + opts.margin * 2) * scale)\n const scaledMargin = opts.margin * scale\n const palette = [opts.color.light, opts.color.dark]\n\n for (let i = 0; i < symbolSize; i++) {\n for (let j = 0; j < symbolSize; j++) {\n let posDst = (i * symbolSize + j) * 4\n let pxColor = opts.color.light\n\n if (i >= scaledMargin && j >= scaledMargin &&\n i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {\n const iSrc = Math.floor((i - scaledMargin) / scale)\n const jSrc = Math.floor((j - scaledMargin) / scale)\n pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]\n }\n\n imgData[posDst++] = pxColor.r\n imgData[posDst++] = pxColor.g\n imgData[posDst++] = pxColor.b\n imgData[posDst] = pxColor.a\n }\n }\n}\n","const Utils = require('./utils')\n\nfunction clearCanvas (ctx, canvas, size) {\n ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n if (!canvas.style) canvas.style = {}\n canvas.height = size\n canvas.width = size\n canvas.style.height = size + 'px'\n canvas.style.width = size + 'px'\n}\n\nfunction getCanvasElement () {\n try {\n return document.createElement('canvas')\n } catch (e) {\n throw new Error('You need to specify a canvas element')\n }\n}\n\nexports.render = function render (qrData, canvas, options) {\n let opts = options\n let canvasEl = canvas\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!canvas) {\n canvasEl = getCanvasElement()\n }\n\n opts = Utils.getOptions(opts)\n const size = Utils.getImageWidth(qrData.modules.size, opts)\n\n const ctx = canvasEl.getContext('2d')\n const image = ctx.createImageData(size, size)\n Utils.qrToImageData(image.data, qrData, opts)\n\n clearCanvas(ctx, canvasEl, size)\n ctx.putImageData(image, 0, 0)\n\n return canvasEl\n}\n\nexports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {\n let opts = options\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!opts) opts = {}\n\n const canvasEl = exports.render(qrData, canvas, opts)\n\n const type = opts.type || 'image/png'\n const rendererOpts = opts.rendererOpts || {}\n\n return canvasEl.toDataURL(type, rendererOpts.quality)\n}\n","const Utils = require('./utils')\n\nfunction getColorAttrib (color, attrib) {\n const alpha = color.a / 255\n const str = attrib + '=\"' + color.hex + '\"'\n\n return alpha < 1\n ? str + ' ' + attrib + '-opacity=\"' + alpha.toFixed(2).slice(1) + '\"'\n : str\n}\n\nfunction svgCmd (cmd, x, y) {\n let str = cmd + x\n if (typeof y !== 'undefined') str += ' ' + y\n\n return str\n}\n\nfunction qrToPath (data, size, margin) {\n let path = ''\n let moveBy = 0\n let newRow = false\n let lineLength = 0\n\n for (let i = 0; i < data.length; i++) {\n const col = Math.floor(i % size)\n const row = Math.floor(i / size)\n\n if (!col && !newRow) newRow = true\n\n if (data[i]) {\n lineLength++\n\n if (!(i > 0 && col > 0 && data[i - 1])) {\n path += newRow\n ? svgCmd('M', col + margin, 0.5 + row + margin)\n : svgCmd('m', moveBy, 0)\n\n moveBy = 0\n newRow = false\n }\n\n if (!(col + 1 < size && data[i + 1])) {\n path += svgCmd('h', lineLength)\n lineLength = 0\n }\n } else {\n moveBy++\n }\n }\n\n return path\n}\n\nexports.render = function render (qrData, options, cb) {\n const opts = Utils.getOptions(options)\n const size = qrData.modules.size\n const data = qrData.modules.data\n const qrcodesize = size + opts.margin * 2\n\n const bg = !opts.color.light.a\n ? ''\n : ''\n\n const path =\n ''\n\n const viewBox = 'viewBox=\"' + '0 0 ' + qrcodesize + ' ' + qrcodesize + '\"'\n\n const width = !opts.width ? '' : 'width=\"' + opts.width + '\" height=\"' + opts.width + '\" '\n\n const svgTag = '\\n'\n\n if (typeof cb === 'function') {\n cb(null, svgTag)\n }\n\n return svgTag\n}\n","\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","import QRCode from 'qrcode'\nimport { imageTracer } from 'imagetracer'\n\n/**\n * Generate a QR code as a data URL (PNG)\n * @param {string} text - The text to encode in the QR code\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - Data URL of the generated QR code\n */\nexport const generateQRCode = async (text, foregroundColor = '#000000', backgroundColor = '#FFFFFF') => {\n try {\n const dataUrl = await QRCode.toDataURL(text, {\n color: {\n dark: foregroundColor,\n light: backgroundColor\n },\n width: 512,\n margin: 2,\n errorCorrectionLevel: 'H'\n })\n return dataUrl\n } catch (error) {\n console.error('Error generating QR code:', error)\n return null\n }\n}\n\n/**\n * Generate a QR code as SVG string\n * @param {string} text - The text to encode in the QR code\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - SVG string of the generated QR code\n */\nexport const generateSVGQRCode = async (text, foregroundColor = '#000000', backgroundColor = '#FFFFFF') => {\n try {\n const svgString = await QRCode.toString(text, {\n type: 'svg',\n width: 512,\n margin: 2,\n errorCorrectionLevel: 'H',\n color: {\n dark: foregroundColor,\n light: backgroundColor\n }\n })\n return svgString\n } catch (error) {\n console.error('Error generating SVG QR code:', error)\n return null\n }\n}\n\n/**\n * Add a custom image to a QR code data URL\n * @param {string} qrCodeUrl - The QR code data URL\n * @param {string} imageUrl - The custom image data URL\n * @param {number} imageSize - Image size as percentage (0-100)\n * @returns {Promise} - Data URL of QR code with embedded image\n */\nexport const addImageToQRCode = async (qrCodeUrl, imageUrl, imageSize = 20) => {\n return new Promise((resolve) => {\n const canvas = document.createElement('canvas')\n const ctx = canvas.getContext('2d')\n \n // Set canvas size\n canvas.width = 512\n canvas.height = 512\n \n // Create image objects\n const qrImage = new Image()\n const customImage = new Image()\n \n qrImage.onload = () => {\n // Draw QR code\n ctx.drawImage(qrImage, 0, 0, 512, 512)\n \n customImage.onload = () => {\n // Calculate image size based on user preference\n const calculatedImageSize = 512 * (imageSize / 100)\n \n // Calculate white box size with margin\n const margin = 16 // 8 pixel margin around the image\n const boxSize = calculatedImageSize + (margin * 2)\n const boxX = (512 - boxSize) / 2\n const boxY = (512 - boxSize) / 2\n \n // Draw white background box\n ctx.fillStyle = '#FFFFFF'\n ctx.fillRect(boxX, boxY, boxSize, boxSize)\n \n // Calculate image position within the white box\n const imageX = boxX + margin\n const imageY = boxY + margin\n \n // Draw custom image\n ctx.drawImage(customImage, imageX, imageY, calculatedImageSize, calculatedImageSize)\n \n // Convert canvas to data URL\n resolve(canvas.toDataURL('image/png'))\n }\n \n // Handle image loading errors\n customImage.onerror = () => {\n console.error('Error loading custom image')\n resolve(qrCodeUrl) // Return QR code without custom image\n }\n \n customImage.src = imageUrl\n }\n \n // Handle QR code loading errors\n qrImage.onerror = () => {\n console.error('Error loading QR code')\n resolve(qrCodeUrl) // Return original QR code if loading fails\n }\n \n qrImage.src = qrCodeUrl\n })\n}\n\n/**\n * Vectorize a bitmap image to SVG elements\n * @param {HTMLImageElement} img - The image element to vectorize\n * @param {number} targetSize - Target size in QR coordinate system\n * @param {number} x - X position in QR coordinate system\n * @param {number} y - Y position in QR coordinate system\n * @param {Document} svgDoc - The SVG document to add elements to\n * @returns {Promise} - SVG group element containing vectorized image\n */\nexport const vectorizeBitmap = (img, targetSize, x, y, svgDoc) => {\n return new Promise((resolve) => {\n // Create a canvas to get the image data\n const canvas = document.createElement('canvas')\n const ctx = canvas.getContext('2d')\n \n // Set canvas size to match the image\n canvas.width = img.width\n canvas.height = img.height\n \n // Draw the image to canvas\n ctx.drawImage(img, 0, 0)\n \n // Get image data for vectorization\n const imageData = ctx.getImageData(0, 0, canvas.width, canvas.height)\n \n // Create a group for the vectorized image\n const group = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'g')\n // Scale the image to fit within the target size in the QR coordinate system\n const scale = targetSize / Math.max(img.width, img.height)\n group.setAttribute('transform', `translate(${x.toFixed(2)}, ${y.toFixed(2)}) scale(${scale.toFixed(4)})`)\n \n // Sample pixels and create colored rectangles\n const sampleSize = Math.max(1, Math.floor(Math.min(img.width, img.height) / 32)) // Sample every N pixels\n const data = imageData.data\n \n for (let y = 0; y < img.height; y += sampleSize) {\n for (let x = 0; x < img.width; x += sampleSize) {\n const index = (y * img.width + x) * 4\n const r = data[index]\n const g = data[index + 1]\n const b = data[index + 2]\n const a = data[index + 3]\n \n // Only create rectangles for non-transparent pixels with sufficient opacity\n if (a > 128 && (r > 0 || g > 0 || b > 0)) {\n const rect = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'rect')\n rect.setAttribute('x', x.toFixed(2))\n rect.setAttribute('y', y.toFixed(2))\n rect.setAttribute('width', sampleSize.toFixed(2))\n rect.setAttribute('height', sampleSize.toFixed(2))\n rect.setAttribute('fill', `rgb(${r}, ${g}, ${b})`)\n group.appendChild(rect)\n }\n }\n }\n \n resolve(group)\n })\n}\n\n/**\n * Add a custom image to an SVG QR code\n * @param {string} svgString - The SVG QR code string\n * @param {string} imageUrl - The custom image data URL\n * @param {number} imageSize - Image size as percentage (0-100)\n * @returns {Promise} - SVG string with embedded image\n */\nexport const addImageToSVG = async (svgString, imageUrl, imageSize = 20) => {\n return new Promise((resolve) => {\n const img = new Image()\n \n img.onload = () => {\n // Parse the SVG string to add custom image\n const parser = new DOMParser()\n const svgDoc = parser.parseFromString(svgString, 'image/svg+xml')\n const svgElement = svgDoc.documentElement\n \n // Calculate image size and position with precise decimal coordinates\n // The QR code uses a 33x33 coordinate system, so we need to scale accordingly\n const qrSize = 33 // QR code coordinate system size\n const calculatedImageSize = qrSize * (imageSize / 100)\n const margin = 2 // Smaller margin for the 33x33 coordinate system\n const boxSize = calculatedImageSize + (margin * 2)\n const boxX = (qrSize - boxSize) / 2\n const boxY = (qrSize - boxSize) / 2\n const imageX = boxX + margin\n const imageY = boxY + margin\n \n // Create white background rectangle with precise positioning\n const whiteBox = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'rect')\n whiteBox.setAttribute('x', boxX.toFixed(2))\n whiteBox.setAttribute('y', boxY.toFixed(2))\n whiteBox.setAttribute('width', boxSize.toFixed(2))\n whiteBox.setAttribute('height', boxSize.toFixed(2))\n whiteBox.setAttribute('fill', '#FFFFFF')\n \n // Add elements to SVG\n svgElement.appendChild(whiteBox)\n \n // Handle different image types\n if (imageUrl.startsWith('data:image/svg+xml')) {\n console.log('Processing SVG image')\n // For SVG images, embed the SVG content directly with precise positioning\n const imageElement = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'image')\n imageElement.setAttribute('x', imageX.toFixed(2))\n imageElement.setAttribute('y', imageY.toFixed(2))\n imageElement.setAttribute('width', calculatedImageSize.toFixed(2))\n imageElement.setAttribute('height', calculatedImageSize.toFixed(2))\n imageElement.setAttribute('href', imageUrl)\n svgElement.appendChild(imageElement)\n console.log('SVG image element added')\n \n // Convert back to string\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n } else {\n console.log('Processing bitmap image')\n // For bitmap images, convert to vector paths\n vectorizeBitmap(img, calculatedImageSize, imageX, imageY, svgDoc).then((vectorizedImage) => {\n svgElement.appendChild(vectorizedImage)\n console.log('Vectorized image group added')\n \n // Convert back to string\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n }).catch((error) => {\n console.error('Vectorization failed:', error)\n // Convert back to string without the image\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n })\n }\n }\n \n img.onerror = () => {\n console.error('Error loading image for SVG')\n resolve(svgString) // Return SVG without image if loading fails\n }\n \n img.src = imageUrl\n })\n}\n\n/**\n * Generate a complete SVG QR code with embedded image\n * @param {string} text - The text to encode in the QR code\n * @param {string} imageUrl - The custom image data URL (optional)\n * @param {number} imageSize - Image size as percentage (0-100, default: 20)\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - Complete SVG string with embedded image\n */\nexport const generateCompleteSVGQRCode = async (\n text, \n imageUrl = null, \n imageSize = 20, \n foregroundColor = '#000000', \n backgroundColor = '#FFFFFF'\n) => {\n try {\n // Generate base SVG QR code\n const svgString = await generateSVGQRCode(text, foregroundColor, backgroundColor)\n \n if (!svgString) {\n return null\n }\n \n // Add custom image if provided\n if (imageUrl) {\n console.log('Adding custom image to SVG...')\n const result = await addImageToSVG(svgString, imageUrl, imageSize)\n console.log('SVG with image generated')\n return result\n }\n \n return svgString\n } catch (error) {\n console.error('Error generating complete SVG QR code:', error)\n return null\n }\n}\n\n/**\n * Download an SVG string as a file\n * @param {string} svgContent - The SVG content to download\n * @param {string} filename - The filename for the download (default: 'qrcode.svg')\n */\nexport const downloadSVG = (svgContent, filename = 'qrcode.svg') => {\n if (!svgContent) {\n console.error('No SVG content to download')\n return\n }\n \n // Create download link\n const blob = new Blob([svgContent], { type: 'image/svg+xml' })\n const url = URL.createObjectURL(blob)\n const a = document.createElement('a')\n a.href = url\n a.download = filename\n document.body.appendChild(a)\n a.click()\n document.body.removeChild(a)\n URL.revokeObjectURL(url)\n}\n\n/**\n * Convert a file to data URL\n * @param {File} file - The file to convert\n * @returns {Promise} - Data URL of the file\n */\nexport const fileToDataURL = (file) => {\n return new Promise((resolve, reject) => {\n const reader = new FileReader()\n reader.onload = () => resolve(reader.result)\n reader.onerror = reject\n reader.readAsDataURL(file)\n })\n}\n\n/**\n * Validate image file\n * @param {File} file - The file to validate\n * @param {number} maxSize - Maximum file size in bytes (default: 2MB)\n * @returns {Object} - Validation result with success boolean and error message\n */\nexport const validateImageFile = (file, maxSize = 2 * 1024 * 1024) => {\n const allowedTypes = ['image/jpeg', 'image/png', 'image/gif', 'image/webp', 'image/svg+xml']\n \n if (!allowedTypes.includes(file.type)) {\n return {\n success: false,\n error: 'Please select a valid image file (JPEG, PNG, GIF, WebP, or SVG)'\n }\n }\n \n if (file.size > maxSize) {\n return {\n success: false,\n error: `File size must be less than ${Math.round(maxSize / 1024 / 1024)}MB`\n }\n }\n \n return { success: true }\n} "],"names":["canPromise","utils","version","kanji","isValid","BitBuffer","BitMatrix","getSymbolSize","require$$0","getPositions","maskPattern","ECLevel","errorCorrectionLevel","mul","ReedSolomonEncoder","require$$1","mode","Utils","ECCode","require$$2","Mode","require$$3","require$$4","segments","getEncodedBits","getBitsLength","bitBuffer","getLength","write","dijkstra","NumericData","AlphanumericData","ByteData","KanjiData","require$$5","require$$6","require$$7","regex","require$$8","require$$9","require$$10","require$$11","require$$12","canvas","render","svgTag","QRCode","y","x"],"mappings":";AAIA,IAAAA,eAAiB,WAAY;AAC3B,SAAO,OAAO,YAAY,cAAc,QAAQ,aAAa,QAAQ,UAAU;AACjF;;;ACNA,IAAI;AACJ,MAAM,kBAAkB;AAAA,EACtB;AAAA;AAAA,EACA;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC1C;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC7C;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EACtD;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AACxD;AAQAC,QAAA,gBAAwB,SAAS,cAAeC,UAAS;AACvD,MAAI,CAACA,SAAS,OAAM,IAAI,MAAM,uCAAuC;AACrE,MAAIA,WAAU,KAAKA,WAAU,GAAI,OAAM,IAAI,MAAM,2CAA2C;AAC5F,SAAOA,WAAU,IAAI;AACvB;AAQAD,QAAA,0BAAkC,SAAS,wBAAyBC,UAAS;AAC3E,SAAO,gBAAgBA,QAAO;AAChC;AAQAD,QAAA,cAAsB,SAAU,MAAM;AACpC,MAAI,QAAQ;AAEZ,SAAO,SAAS,GAAG;AACjB;AACA,cAAU;AAAA,EACd;AAEE,SAAO;AACT;AAEAA,QAAA,oBAA4B,SAAS,kBAAmB,GAAG;AACzD,MAAI,OAAO,MAAM,YAAY;AAC3B,UAAM,IAAI,MAAM,uCAAuC;AAAA,EAC3D;AAEE,mBAAiB;AACnB;AAEAA,QAAA,qBAA6B,WAAY;AACvC,SAAO,OAAO,mBAAmB;AACnC;AAEAA,QAAA,SAAiB,SAAS,OAAQE,QAAO;AACvC,SAAO,eAAeA,MAAK;AAC7B;;;AC9DA,UAAA,IAAY,EAAE,KAAK,EAAC;AACpB,UAAA,IAAY,EAAE,KAAK,EAAC;AACpB,UAAA,IAAY,EAAE,KAAK,EAAC;AACpB,UAAA,IAAY,EAAE,KAAK,EAAC;AAEpB,WAAS,WAAY,QAAQ;AAC3B,QAAI,OAAO,WAAW,UAAU;AAC9B,YAAM,IAAI,MAAM,uBAAuB;AAAA,IAC3C;AAEE,UAAM,QAAQ,OAAO,YAAW;AAEhC,YAAQ,OAAK;AAAA,MACX,KAAK;AAAA,MACL,KAAK;AACH,eAAO,QAAQ;AAAA,MAEjB,KAAK;AAAA,MACL,KAAK;AACH,eAAO,QAAQ;AAAA,MAEjB,KAAK;AAAA,MACL,KAAK;AACH,eAAO,QAAQ;AAAA,MAEjB,KAAK;AAAA,MACL,KAAK;AACH,eAAO,QAAQ;AAAA,MAEjB;AACE,cAAM,IAAI,MAAM,uBAAuB,MAAM;AAAA;EAEnD;AAEA,UAAA,UAAkB,SAASC,SAAS,OAAO;AACzC,WAAO,SAAS,OAAO,MAAM,QAAQ,eACnC,MAAM,OAAO,KAAK,MAAM,MAAM;AAAA,EAClC;AAEA,UAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,QAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1B,aAAO;AAAA,IACX;AAEE,QAAI;AACF,aAAO,WAAW,KAAK;AAAA,IAC3B,SAAW,GAAG;AACV,aAAO;AAAA,IACX;AAAA,EACA;;ACjDA,SAASC,cAAa;AACpB,OAAK,SAAS,CAAA;AACd,OAAK,SAAS;AAChB;AAEAA,YAAU,YAAY;AAAA,EAEpB,KAAK,SAAU,OAAO;AACpB,UAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,YAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,EACjE;AAAA,EAEE,KAAK,SAAU,KAAK,QAAQ;AAC1B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,IACxD;AAAA,EACA;AAAA,EAEE,iBAAiB,WAAY;AAC3B,WAAO,KAAK;AAAA,EAChB;AAAA,EAEE,QAAQ,SAAU,KAAK;AACrB,UAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,QAAI,KAAK,OAAO,UAAU,UAAU;AAClC,WAAK,OAAO,KAAK,CAAC;AAAA,IACxB;AAEI,QAAI,KAAK;AACP,WAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,IACxD;AAEI,SAAK;AAAA,EACT;AACA;AAEA,IAAA,YAAiBA;AC/BjB,SAASC,YAAW,MAAM;AACxB,MAAI,CAAC,QAAQ,OAAO,GAAG;AACrB,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACvE;AAEE,OAAK,OAAO;AACZ,OAAK,OAAO,IAAI,WAAW,OAAO,IAAI;AACtC,OAAK,cAAc,IAAI,WAAW,OAAO,IAAI;AAC/C;AAWAA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO,UAAU;AAC7D,QAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,OAAK,KAAK,KAAK,IAAI;AACnB,MAAI,SAAU,MAAK,YAAY,KAAK,IAAI;AAC1C;AASAA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,SAAO,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AACxC;AAUAA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO;AACnD,OAAK,KAAK,MAAM,KAAK,OAAO,GAAG,KAAK;AACtC;AASAA,YAAU,UAAU,aAAa,SAAU,KAAK,KAAK;AACnD,SAAO,KAAK,YAAY,MAAM,KAAK,OAAO,GAAG;AAC/C;AAEA,IAAA,YAAiBA;;;ACtDjB,QAAMC,iBAAgBC,QAAmB;AAgBzC,UAAA,kBAA0B,SAAS,gBAAiBN,UAAS;AAC3D,QAAIA,aAAY,EAAG,QAAO,CAAA;AAE1B,UAAM,WAAW,KAAK,MAAMA,WAAU,CAAC,IAAI;AAC3C,UAAM,OAAOK,eAAcL,QAAO;AAClC,UAAM,YAAY,SAAS,MAAM,KAAK,KAAK,MAAM,OAAO,OAAO,IAAI,WAAW,EAAE,IAAI;AACpF,UAAM,YAAY,CAAC,OAAO,CAAC;AAE3B,aAAS,IAAI,GAAG,IAAI,WAAW,GAAG,KAAK;AACrC,gBAAU,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI;AAAA,IACtC;AAEE,cAAU,KAAK,CAAC;AAEhB,WAAO,UAAU,QAAO;AAAA,EAC1B;AAsBA,UAAA,eAAuB,SAASO,cAAcP,UAAS;AACrD,UAAM,SAAS,CAAA;AACf,UAAM,MAAM,QAAQ,gBAAgBA,QAAO;AAC3C,UAAM,YAAY,IAAI;AAEtB,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAElC,YAAK,MAAM,KAAK,MAAM;AAAA,QACjB,MAAM,KAAK,MAAM,YAAY;AAAA,QAC7B,MAAM,YAAY,KAAK,MAAM,GAAI;AACpC;AAAA,QACR;AAEM,eAAO,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,MAClC;AAAA,IACA;AAEE,WAAO;AAAA,EACT;;;AClFA,MAAMK,iBAAgBC,QAAmB;AACzC,MAAM,sBAAsB;AAS5B,cAAA,eAAuB,SAAS,aAAcN,UAAS;AACrD,QAAM,OAAOK,eAAcL,QAAO;AAElC,SAAO;AAAA;AAAA,IAEL,CAAC,GAAG,CAAC;AAAA;AAAA,IAEL,CAAC,OAAO,qBAAqB,CAAC;AAAA;AAAA,IAE9B,CAAC,GAAG,OAAO,mBAAmB;AAAA,EAClC;AACA;;;ACjBA,UAAA,WAAmB;AAAA,IACjB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA;AAOd,QAAM,gBAAgB;AAAA,IACpB,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA;AASN,UAAA,UAAkB,SAASE,SAAS,MAAM;AACxC,WAAO,QAAQ,QAAQ,SAAS,MAAM,CAAC,MAAM,IAAI,KAAK,QAAQ,KAAK,QAAQ;AAAA,EAC7E;AASA,UAAA,OAAe,SAAS,KAAM,OAAO;AACnC,WAAO,QAAQ,QAAQ,KAAK,IAAI,SAAS,OAAO,EAAE,IAAI;AAAA,EACxD;AASA,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AACb,QAAI,eAAe;AACnB,QAAI,eAAe;AACnB,QAAI,UAAU;AACd,QAAI,UAAU;AAEd,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,qBAAe,eAAe;AAC9B,gBAAU,UAAU;AAEpB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAI,SAAS,KAAK,IAAI,KAAK,GAAG;AAC9B,YAAI,WAAW,SAAS;AACtB;AAAA,QACR,OAAa;AACL,cAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,oBAAU;AACV,yBAAe;AAAA,QACvB;AAEM,iBAAS,KAAK,IAAI,KAAK,GAAG;AAC1B,YAAI,WAAW,SAAS;AACtB;AAAA,QACR,OAAa;AACL,cAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,oBAAU;AACV,yBAAe;AAAA,QACvB;AAAA,MACA;AAEI,UAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,UAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AAAA,IACxE;AAEE,WAAO;AAAA,EACT;AAOA,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AAEb,aAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,eAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,cAAM,OAAO,KAAK,IAAI,KAAK,GAAG,IAC5B,KAAK,IAAI,KAAK,MAAM,CAAC,IACrB,KAAK,IAAI,MAAM,GAAG,GAAG,IACrB,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC;AAE3B,YAAI,SAAS,KAAK,SAAS,EAAG;AAAA,MACpC;AAAA,IACA;AAEE,WAAO,SAAS,cAAc;AAAA,EAChC;AAQA,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AACb,QAAI,UAAU;AACd,QAAI,UAAU;AAEd,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,gBAAU,UAAU;AACpB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,kBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,YAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAE3D,kBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,YAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAAA,MACjE;AAAA,IACA;AAEE,WAAO,SAAS,cAAc;AAAA,EAChC;AAUA,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,QAAI,YAAY;AAChB,UAAM,eAAe,KAAK,KAAK;AAE/B,aAAS,IAAI,GAAG,IAAI,cAAc,IAAK,cAAa,KAAK,KAAK,CAAC;AAE/D,UAAM,IAAI,KAAK,IAAI,KAAK,KAAM,YAAY,MAAM,eAAgB,CAAC,IAAI,EAAE;AAEvE,WAAO,IAAI,cAAc;AAAA,EAC3B;AAUA,WAAS,UAAWM,cAAa,GAAG,GAAG;AACrC,YAAQA,cAAW;AAAA,MACjB,KAAK,QAAQ,SAAS;AAAY,gBAAQ,IAAI,KAAK,MAAM;AAAA,MACzD,KAAK,QAAQ,SAAS;AAAY,eAAO,IAAI,MAAM;AAAA,MACnD,KAAK,QAAQ,SAAS;AAAY,eAAO,IAAI,MAAM;AAAA,MACnD,KAAK,QAAQ,SAAS;AAAY,gBAAQ,IAAI,KAAK,MAAM;AAAA,MACzD,KAAK,QAAQ,SAAS;AAAY,gBAAQ,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM;AAAA,MACzF,KAAK,QAAQ,SAAS;AAAY,eAAQ,IAAI,IAAK,IAAK,IAAI,IAAK,MAAM;AAAA,MACvE,KAAK,QAAQ,SAAS;AAAY,gBAAS,IAAI,IAAK,IAAK,IAAI,IAAK,KAAK,MAAM;AAAA,MAC7E,KAAK,QAAQ,SAAS;AAAY,gBAAS,IAAI,IAAK,KAAK,IAAI,KAAK,KAAK,MAAM;AAAA,MAE7E;AAAS,cAAM,IAAI,MAAM,qBAAqBA,YAAW;AAAA;EAE7D;AAQA,UAAA,YAAoB,SAAS,UAAW,SAAS,MAAM;AACrD,UAAM,OAAO,KAAK;AAElB,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAI,KAAK,WAAW,KAAK,GAAG,EAAG;AAC/B,aAAK,IAAI,KAAK,KAAK,UAAU,SAAS,KAAK,GAAG,CAAC;AAAA,MACrD;AAAA,IACA;AAAA,EACA;AAQA,UAAA,cAAsB,SAAS,YAAa,MAAM,iBAAiB;AACjE,UAAM,cAAc,OAAO,KAAK,QAAQ,QAAQ,EAAE;AAClD,QAAI,cAAc;AAClB,QAAI,eAAe;AAEnB,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,sBAAgB,CAAC;AACjB,cAAQ,UAAU,GAAG,IAAI;AAGzB,YAAM,UACJ,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI;AAG3B,cAAQ,UAAU,GAAG,IAAI;AAEzB,UAAI,UAAU,cAAc;AAC1B,uBAAe;AACf,sBAAc;AAAA,MACpB;AAAA,IACA;AAEE,WAAO;AAAA,EACT;;;ACzOA,MAAMC,YAAUH;AAEhB,MAAM,kBAAkB;AAAA;AAAA,EAEtB;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACT;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EACV;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EACV;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EACV;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AACd;AAEA,MAAM,qBAAqB;AAAA;AAAA,EAEzB;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACX;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EACZ;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EACb;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EACb;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EACd;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EACd;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EACd;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EACd;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACf;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAChB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAChB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAChB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAChB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAChB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAChB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AAAA,EAChB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EACjB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EACjB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EACjB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EACjB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EACjB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EACjB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AACnB;AAUA,oBAAA,iBAAyB,SAAS,eAAgBN,UAASU,uBAAsB;AAC/E,UAAQA,uBAAoB;AAAA,IAC1B,KAAKD,UAAQ;AACX,aAAO,iBAAiBT,WAAU,KAAK,IAAI,CAAC;AAAA,IAC9C,KAAKS,UAAQ;AACX,aAAO,iBAAiBT,WAAU,KAAK,IAAI,CAAC;AAAA,IAC9C,KAAKS,UAAQ;AACX,aAAO,iBAAiBT,WAAU,KAAK,IAAI,CAAC;AAAA,IAC9C,KAAKS,UAAQ;AACX,aAAO,iBAAiBT,WAAU,KAAK,IAAI,CAAC;AAAA,IAC9C;AACE,aAAO;AAAA,EACb;AACA;AAUA,oBAAA,yBAAiC,SAAS,uBAAwBA,UAASU,uBAAsB;AAC/F,UAAQA,uBAAoB;AAAA,IAC1B,KAAKD,UAAQ;AACX,aAAO,oBAAoBT,WAAU,KAAK,IAAI,CAAC;AAAA,IACjD,KAAKS,UAAQ;AACX,aAAO,oBAAoBT,WAAU,KAAK,IAAI,CAAC;AAAA,IACjD,KAAKS,UAAQ;AACX,aAAO,oBAAoBT,WAAU,KAAK,IAAI,CAAC;AAAA,IACjD,KAAKS,UAAQ;AACX,aAAO,oBAAoBT,WAAU,KAAK,IAAI,CAAC;AAAA,IACjD;AACE,aAAO;AAAA,EACb;AACA;;;ACtIA,MAAM,YAAY,IAAI,WAAW,GAAG;AACpC,MAAM,YAAY,IAAI,WAAW,GAAG;AAAA,CASlC,SAAS,aAAc;AACvB,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,cAAU,CAAC,IAAI;AACf,cAAU,CAAC,IAAI;AAEf,UAAM;AAIN,QAAI,IAAI,KAAO;AACb,WAAK;AAAA,IACX;AAAA,EACA;AAME,WAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,cAAU,CAAC,IAAI,UAAU,IAAI,GAAG;AAAA,EACpC;AACA,GAAC;AAQD,YAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,MAAI,IAAI,EAAG,OAAM,IAAI,MAAM,SAAS,IAAI,GAAG;AAC3C,SAAO,UAAU,CAAC;AACpB;AAQA,YAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,SAAO,UAAU,CAAC;AACpB;AASA,YAAA,MAAc,SAAS,IAAK,GAAG,GAAG;AAChC,MAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAI/B,SAAO,UAAU,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;AAC9C;AAAA;ACpEA,QAAM,KAAKM;AASX,UAAA,MAAc,SAASK,KAAK,IAAI,IAAI;AAClC,UAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,cAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MACzC;AAAA,IACA;AAEE,WAAO;AAAA,EACT;AASA,UAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,QAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,WAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,YAAM,QAAQ,OAAO,CAAC;AAEtB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,eAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,MAC3C;AAGI,UAAI,SAAS;AACb,aAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,eAAS,OAAO,MAAM,MAAM;AAAA,IAChC;AAEE,WAAO;AAAA,EACT;AASA,UAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,QAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAO,QAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,IAC3D;AAEE,WAAO;AAAA,EACT;;AC7DA,MAAM,aAAaL;AAEnB,SAASM,qBAAoB,QAAQ;AACnC,OAAK,UAAU;AACf,OAAK,SAAS;AAEd,MAAI,KAAK,OAAQ,MAAK,WAAW,KAAK,MAAM;AAC9C;AAQAA,qBAAmB,UAAU,aAAa,SAAS,WAAY,QAAQ;AAErE,OAAK,SAAS;AACd,OAAK,UAAU,WAAW,qBAAqB,KAAK,MAAM;AAC5D;AAQAA,qBAAmB,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3D,MAAI,CAAC,KAAK,SAAS;AACjB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC7C;AAIE,QAAM,aAAa,IAAI,WAAW,KAAK,SAAS,KAAK,MAAM;AAC3D,aAAW,IAAI,IAAI;AAInB,QAAM,YAAY,WAAW,IAAI,YAAY,KAAK,OAAO;AAKzD,QAAM,QAAQ,KAAK,SAAS,UAAU;AACtC,MAAI,QAAQ,GAAG;AACb,UAAM,OAAO,IAAI,WAAW,KAAK,MAAM;AACvC,SAAK,IAAI,WAAW,KAAK;AAEzB,WAAO;AAAA,EACX;AAEE,SAAO;AACT;AAEA,IAAA,qBAAiBA;;;;ACjDjB,aAAA,UAAkB,SAAS,QAASZ,UAAS;AAC3C,SAAO,CAAC,MAAMA,QAAO,KAAKA,YAAW,KAAKA,YAAW;AACvD;;ACRA,MAAM,UAAU;AAChB,MAAM,eAAe;AACrB,IAAI,QAAQ;AAIZ,QAAQ,MAAM,QAAQ,MAAM,KAAK;AAEjC,MAAM,OAAO,+BAA+B,QAAQ;AAEpD,MAAA,QAAgB,IAAI,OAAO,OAAO,GAAG;AACrC,MAAA,aAAqB,IAAI,OAAO,yBAAyB,GAAG;AAC5D,MAAA,OAAe,IAAI,OAAO,MAAM,GAAG;AACnC,MAAA,UAAkB,IAAI,OAAO,SAAS,GAAG;AACzC,MAAA,eAAuB,IAAI,OAAO,cAAc,GAAG;AAEnD,MAAM,aAAa,IAAI,OAAO,MAAM,QAAQ,GAAG;AAC/C,MAAM,eAAe,IAAI,OAAO,MAAM,UAAU,GAAG;AACnD,MAAM,oBAAoB,IAAI,OAAO,wBAAwB;AAE7D,MAAA,YAAoB,SAAS,UAAW,KAAK;AAC3C,SAAO,WAAW,KAAK,GAAG;AAC5B;AAEA,MAAA,cAAsB,SAAS,YAAa,KAAK;AAC/C,SAAO,aAAa,KAAK,GAAG;AAC9B;AAEA,MAAA,mBAA2B,SAAS,iBAAkB,KAAK;AACzD,SAAO,kBAAkB,KAAK,GAAG;AACnC;AAAA;AC9BA,QAAM,eAAeM;AACrB,QAAM,QAAQO;AASd,UAAA,UAAkB;AAAA,IAChB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA;AAYrB,UAAA,eAAuB;AAAA,IACrB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA;AAQpB,UAAA,OAAe;AAAA,IACb,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA;AAYpB,UAAA,QAAgB;AAAA,IACd,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA;AASpB,UAAA,QAAgB;AAAA,IACd,KAAK;AAAA;AAWP,UAAA,wBAAgC,SAAS,sBAAuBC,OAAMd,UAAS;AAC7E,QAAI,CAACc,MAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,KAAI;AAEzD,QAAI,CAAC,aAAa,QAAQd,QAAO,GAAG;AAClC,YAAM,IAAI,MAAM,sBAAsBA,QAAO;AAAA,IACjD;AAEE,QAAIA,YAAW,KAAKA,WAAU,GAAI,QAAOc,MAAK,OAAO,CAAC;AAAA,aAC7Cd,WAAU,GAAI,QAAOc,MAAK,OAAO,CAAC;AAC3C,WAAOA,MAAK,OAAO,CAAC;AAAA,EACtB;AAQA,UAAA,qBAA6B,SAAS,mBAAoB,SAAS;AACjE,QAAI,MAAM,YAAY,OAAO,EAAG,QAAO,QAAQ;AAAA,aACtC,MAAM,iBAAiB,OAAO,EAAG,QAAO,QAAQ;AAAA,aAChD,MAAM,UAAU,OAAO,EAAG,QAAO,QAAQ;AAAA,QAC7C,QAAO,QAAQ;AAAA,EACtB;AAQA,UAAA,WAAmB,SAAS,SAAUA,OAAM;AAC1C,QAAIA,SAAQA,MAAK,GAAI,QAAOA,MAAK;AACjC,UAAM,IAAI,MAAM,cAAc;AAAA,EAChC;AAQA,UAAA,UAAkB,SAASZ,SAASY,OAAM;AACxC,WAAOA,SAAQA,MAAK,OAAOA,MAAK;AAAA,EAClC;AAQA,WAAS,WAAY,QAAQ;AAC3B,QAAI,OAAO,WAAW,UAAU;AAC9B,YAAM,IAAI,MAAM,uBAAuB;AAAA,IAC3C;AAEE,UAAM,QAAQ,OAAO,YAAW;AAEhC,YAAQ,OAAK;AAAA,MACX,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB;AACE,cAAM,IAAI,MAAM,mBAAmB,MAAM;AAAA;EAE/C;AAUA,UAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,QAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1B,aAAO;AAAA,IACX;AAEE,QAAI;AACF,aAAO,WAAW,KAAK;AAAA,IAC3B,SAAW,GAAG;AACV,aAAO;AAAA,IACX;AAAA,EACA;;;ACtKA,QAAMC,SAAQT;AACd,QAAMU,UAASH;AACf,QAAMJ,WAAUQ;AAChB,QAAMC,QAAOC;AACb,QAAM,eAAeC;AAGrB,QAAM,MAAO,KAAK,KAAO,KAAK,KAAO,KAAK,KAAO,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK;AAClG,QAAM,UAAUL,OAAM,YAAY,GAAG;AAErC,WAAS,4BAA6BD,OAAM,QAAQJ,uBAAsB;AACxE,aAAS,iBAAiB,GAAG,kBAAkB,IAAI,kBAAkB;AACnE,UAAI,UAAU,QAAQ,YAAY,gBAAgBA,uBAAsBI,KAAI,GAAG;AAC7E,eAAO;AAAA,MACb;AAAA,IACA;AAEE,WAAO;AAAA,EACT;AAEA,WAAS,qBAAsBA,OAAMd,UAAS;AAE5C,WAAOkB,MAAK,sBAAsBJ,OAAMd,QAAO,IAAI;AAAA,EACrD;AAEA,WAAS,0BAA2BqB,WAAUrB,UAAS;AACrD,QAAI,YAAY;AAEhB,IAAAqB,UAAS,QAAQ,SAAU,MAAM;AAC/B,YAAM,eAAe,qBAAqB,KAAK,MAAMrB,QAAO;AAC5D,mBAAa,eAAe,KAAK,cAAa;AAAA,IAClD,CAAG;AAED,WAAO;AAAA,EACT;AAEA,WAAS,2BAA4BqB,WAAUX,uBAAsB;AACnE,aAAS,iBAAiB,GAAG,kBAAkB,IAAI,kBAAkB;AACnE,YAAM,SAAS,0BAA0BW,WAAU,cAAc;AACjE,UAAI,UAAU,QAAQ,YAAY,gBAAgBX,uBAAsBQ,MAAK,KAAK,GAAG;AACnF,eAAO;AAAA,MACb;AAAA,IACA;AAEE,WAAO;AAAA,EACT;AAUA,UAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,QAAI,aAAa,QAAQ,KAAK,GAAG;AAC/B,aAAO,SAAS,OAAO,EAAE;AAAA,IAC7B;AAEE,WAAO;AAAA,EACT;AAWA,UAAA,cAAsB,SAAS,YAAalB,UAASU,uBAAsBI,OAAM;AAC/E,QAAI,CAAC,aAAa,QAAQd,QAAO,GAAG;AAClC,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC7C;AAGE,QAAI,OAAOc,UAAS,YAAa,CAAAA,QAAOI,MAAK;AAG7C,UAAM,iBAAiBH,OAAM,wBAAwBf,QAAO;AAG5D,UAAM,mBAAmBgB,QAAO,uBAAuBhB,UAASU,qBAAoB;AAGpF,UAAM,0BAA0B,iBAAiB,oBAAoB;AAErE,QAAII,UAASI,MAAK,MAAO,QAAO;AAEhC,UAAM,aAAa,yBAAyB,qBAAqBJ,OAAMd,QAAO;AAG9E,YAAQc,OAAI;AAAA,MACV,KAAKI,MAAK;AACR,eAAO,KAAK,MAAO,aAAa,KAAM,CAAC;AAAA,MAEzC,KAAKA,MAAK;AACR,eAAO,KAAK,MAAO,aAAa,KAAM,CAAC;AAAA,MAEzC,KAAKA,MAAK;AACR,eAAO,KAAK,MAAM,aAAa,EAAE;AAAA,MAEnC,KAAKA,MAAK;AAAA,MACV;AACE,eAAO,KAAK,MAAM,aAAa,CAAC;AAAA;EAEtC;AAUA,UAAA,wBAAgC,SAAS,sBAAuB,MAAMR,uBAAsB;AAC1F,QAAI;AAEJ,UAAM,MAAMD,SAAQ,KAAKC,uBAAsBD,SAAQ,CAAC;AAExD,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,UAAI,KAAK,SAAS,GAAG;AACnB,eAAO,2BAA2B,MAAM,GAAG;AAAA,MACjD;AAEI,UAAI,KAAK,WAAW,GAAG;AACrB,eAAO;AAAA,MACb;AAEI,YAAM,KAAK,CAAC;AAAA,IAChB,OAAS;AACL,YAAM;AAAA,IACV;AAEE,WAAO,4BAA4B,IAAI,MAAM,IAAI,UAAS,GAAI,GAAG;AAAA,EACnE;AAYA,UAAA,iBAAyB,SAASa,gBAAgBtB,UAAS;AACzD,QAAI,CAAC,aAAa,QAAQA,QAAO,KAAKA,WAAU,GAAG;AACjD,YAAM,IAAI,MAAM,yBAAyB;AAAA,IAC7C;AAEE,QAAI,IAAIA,YAAW;AAEnB,WAAOe,OAAM,YAAY,CAAC,IAAI,WAAW,GAAG;AAC1C,WAAM,OAAQA,OAAM,YAAY,CAAC,IAAI;AAAA,IACzC;AAEE,WAAQf,YAAW,KAAM;AAAA,EAC3B;;;AClKA,MAAMe,UAAQT;AAEd,MAAM,MAAO,KAAK,KAAO,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK;AACrF,MAAM,WAAY,KAAK,KAAO,KAAK,KAAO,KAAK,KAAO,KAAK,IAAM,KAAK;AACtE,MAAM,UAAUS,QAAM,YAAY,GAAG;AAYrC,WAAA,iBAAyB,SAAS,eAAgBL,uBAAsB,MAAM;AAC5E,QAAM,OAASA,sBAAqB,OAAO,IAAK;AAChD,MAAI,IAAI,QAAQ;AAEhB,SAAOK,QAAM,YAAY,CAAC,IAAI,WAAW,GAAG;AAC1C,SAAM,OAAQA,QAAM,YAAY,CAAC,IAAI;AAAA,EACzC;AAKE,UAAS,QAAQ,KAAM,KAAK;AAC9B;;AC5BA,MAAMG,SAAOZ;AAEb,SAAS,YAAa,MAAM;AAC1B,OAAK,OAAOY,OAAK;AACjB,OAAK,OAAO,KAAK,SAAQ;AAC3B;AAEA,YAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAChF;AAEA,YAAY,UAAU,YAAY,SAAS,YAAa;AACtD,SAAO,KAAK,KAAK;AACnB;AAEA,YAAY,UAAU,gBAAgB,SAASK,iBAAiB;AAC9D,SAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AACnD;AAEA,YAAY,UAAU,QAAQ,SAAS,MAAOC,YAAW;AACvD,MAAI,GAAG,OAAO;AAId,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,YAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,YAAQ,SAAS,OAAO,EAAE;AAE1B,IAAAA,WAAU,IAAI,OAAO,EAAE;AAAA,EAC3B;AAIE,QAAM,eAAe,KAAK,KAAK,SAAS;AACxC,MAAI,eAAe,GAAG;AACpB,YAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,YAAQ,SAAS,OAAO,EAAE;AAE1B,IAAAA,WAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,EAC7C;AACA;AAEA,IAAA,cAAiB;AC1CjB,MAAMN,SAAOZ;AAWb,MAAM,kBAAkB;AAAA,EACtB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC7C;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAC1C;AAEA,SAAS,iBAAkB,MAAM;AAC/B,OAAK,OAAOY,OAAK;AACjB,OAAK,OAAO;AACd;AAEA,iBAAiB,gBAAgB,SAASK,eAAe,QAAQ;AAC/D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AACrD;AAEA,iBAAiB,UAAU,YAAY,SAASE,aAAa;AAC3D,SAAO,KAAK,KAAK;AACnB;AAEA,iBAAiB,UAAU,gBAAgB,SAASF,iBAAiB;AACnE,SAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AACxD;AAEA,iBAAiB,UAAU,QAAQ,SAASG,OAAOF,YAAW;AAC5D,MAAI;AAIJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,QAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,aAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,IAAAA,WAAU,IAAI,OAAO,EAAE;AAAA,EAC3B;AAIE,MAAI,KAAK,KAAK,SAAS,GAAG;AACxB,IAAAA,WAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,EAC1D;AACA;AAEA,IAAA,mBAAiB;AC1DjB,MAAMN,SAAOZ;AAEb,SAAS,SAAU,MAAM;AACvB,OAAK,OAAOY,OAAK;AACjB,MAAI,OAAQ,SAAU,UAAU;AAC9B,SAAK,OAAO,IAAI,YAAW,EAAG,OAAO,IAAI;AAAA,EAC7C,OAAS;AACL,SAAK,OAAO,IAAI,WAAW,IAAI;AAAA,EACnC;AACA;AAEA,SAAS,gBAAgB,SAASK,eAAe,QAAQ;AACvD,SAAO,SAAS;AAClB;AAEA,SAAS,UAAU,YAAY,SAASE,aAAa;AACnD,SAAO,KAAK,KAAK;AACnB;AAEA,SAAS,UAAU,gBAAgB,SAASF,iBAAiB;AAC3D,SAAO,SAAS,cAAc,KAAK,KAAK,MAAM;AAChD;AAEA,SAAS,UAAU,QAAQ,SAAUC,YAAW;AAC9C,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK;AAChD,IAAAA,WAAU,IAAI,KAAK,KAAK,CAAC,GAAG,CAAC;AAAA,EACjC;AACA;AAEA,IAAA,WAAiB;AC7BjB,MAAMN,SAAOZ;AACb,MAAMS,UAAQF;AAEd,SAAS,UAAW,MAAM;AACxB,OAAK,OAAOK,OAAK;AACjB,OAAK,OAAO;AACd;AAEA,UAAU,gBAAgB,SAASK,eAAe,QAAQ;AACxD,SAAO,SAAS;AAClB;AAEA,UAAU,UAAU,YAAY,SAASE,aAAa;AACpD,SAAO,KAAK,KAAK;AACnB;AAEA,UAAU,UAAU,gBAAgB,SAASF,iBAAiB;AAC5D,SAAO,UAAU,cAAc,KAAK,KAAK,MAAM;AACjD;AAEA,UAAU,UAAU,QAAQ,SAAUC,YAAW;AAC/C,MAAI;AAKJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACrC,QAAI,QAAQT,QAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAGrC,QAAI,SAAS,SAAU,SAAS,OAAQ;AAEtC,eAAS;AAAA,IAGf,WAAe,SAAS,SAAU,SAAS,OAAQ;AAE7C,eAAS;AAAA,IACf,OAAW;AACL,YAAM,IAAI;AAAA,QACR,6BAA6B,KAAK,KAAK,CAAC,IAAI;AAAA,MACX;AAAA,IACzC;AAII,aAAW,UAAU,IAAK,OAAQ,OAAS,QAAQ;AAGnD,IAAAS,WAAU,IAAI,OAAO,EAAE;AAAA,EAC3B;AACA;AAEA,IAAA,YAAiB;;;AC9BjB,MAAIG,YAAW;AAAA,IACb,8BAA8B,SAAS,OAAO,GAAG,GAAG;AAGlD,UAAI,eAAe,CAAA;AAInB,UAAI,QAAQ,CAAA;AACZ,YAAM,CAAC,IAAI;AAMX,UAAI,OAAOA,UAAS,cAAc,KAAI;AACtC,WAAK,KAAK,GAAG,CAAC;AAEd,UAAI,SACA,GAAG,GACH,gBACA,gBACA,WACA,+BACA,gBACA;AACJ,aAAO,CAAC,KAAK,SAAS;AAGpB,kBAAU,KAAK,IAAG;AAClB,YAAI,QAAQ;AACZ,yBAAiB,QAAQ;AAGzB,yBAAiB,MAAM,CAAC,KAAK,CAAA;AAK7B,aAAK,KAAK,gBAAgB;AACxB,cAAI,eAAe,eAAe,CAAC,GAAG;AAEpC,wBAAY,eAAe,CAAC;AAK5B,4CAAgC,iBAAiB;AAMjD,6BAAiB,MAAM,CAAC;AACxB,0BAAe,OAAO,MAAM,CAAC,MAAM;AACnC,gBAAI,eAAe,iBAAiB,+BAA+B;AACjE,oBAAM,CAAC,IAAI;AACX,mBAAK,KAAK,GAAG,6BAA6B;AAC1C,2BAAa,CAAC,IAAI;AAAA,YAC9B;AAAA,UACA;AAAA,QACA;AAAA,MACA;AAEI,UAAI,OAAO,MAAM,eAAe,OAAO,MAAM,CAAC,MAAM,aAAa;AAC/D,YAAI,MAAM,CAAC,+BAA+B,GAAG,QAAQ,GAAG,GAAG,EAAE,KAAK,EAAE;AACpE,cAAM,IAAI,MAAM,GAAG;AAAA,MACzB;AAEI,aAAO;AAAA,IACX;AAAA,IAEE,6CAA6C,SAAS,cAAc,GAAG;AACrE,UAAI,QAAQ,CAAA;AACZ,UAAI,IAAI;AAER,aAAO,GAAG;AACR,cAAM,KAAK,CAAC;AACE,qBAAa,CAAC;AAC5B,YAAI,aAAa,CAAC;AAAA,MACxB;AACI,YAAM,QAAO;AACb,aAAO;AAAA,IACX;AAAA,IAEE,WAAW,SAAS,OAAO,GAAG,GAAG;AAC/B,UAAI,eAAeA,UAAS,6BAA6B,OAAO,GAAG,CAAC;AACpE,aAAOA,UAAS;AAAA,QACd;AAAA,QAAc;AAAA,MAAC;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA,IAKE,eAAe;AAAA,MACb,MAAM,SAAU,MAAM;AACpB,YAAI,IAAIA,UAAS,eACb,IAAI,CAAA,GACJ;AACJ,eAAO,QAAQ,CAAA;AACf,aAAK,OAAO,GAAG;AACb,cAAI,EAAE,eAAe,GAAG,GAAG;AACzB,cAAE,GAAG,IAAI,EAAE,GAAG;AAAA,UACxB;AAAA,QACA;AACM,UAAE,QAAQ,CAAA;AACV,UAAE,SAAS,KAAK,UAAU,EAAE;AAC5B,eAAO;AAAA,MACb;AAAA,MAEI,gBAAgB,SAAU,GAAG,GAAG;AAC9B,eAAO,EAAE,OAAO,EAAE;AAAA,MACxB;AAAA;AAAA;AAAA;AAAA;AAAA,MAMI,MAAM,SAAU,OAAO,MAAM;AAC3B,YAAI,OAAO,EAAC,OAAc,KAAU;AACpC,aAAK,MAAM,KAAK,IAAI;AACpB,aAAK,MAAM,KAAK,KAAK,MAAM;AAAA,MACjC;AAAA;AAAA;AAAA;AAAA,MAKI,KAAK,WAAY;AACf,eAAO,KAAK,MAAM,MAAK;AAAA,MAC7B;AAAA,MAEI,OAAO,WAAY;AACjB,eAAO,KAAK,MAAM,WAAW;AAAA,MACnC;AAAA;EAEA;AAImC;AACjC,WAAA,UAAiBA;AAAA,EACnB;;;;ACpKA,QAAMT,QAAOZ;AACb,QAAMsB,eAAcf;AACpB,QAAMgB,oBAAmBZ;AACzB,QAAMa,YAAWX;AACjB,QAAMY,aAAYX;AAClB,QAAM,QAAQY;AACd,QAAMjB,SAAQkB;AACd,QAAMN,YAAWO;AAQjB,WAAS,oBAAqB,KAAK;AACjC,WAAO,SAAS,mBAAmB,GAAG,CAAC,EAAE;AAAA,EAC3C;AAUA,WAAS,YAAaC,QAAOrB,OAAM,KAAK;AACtC,UAAMO,YAAW,CAAA;AACjB,QAAI;AAEJ,YAAQ,SAASc,OAAM,KAAK,GAAG,OAAO,MAAM;AAC1C,MAAAd,UAAS,KAAK;AAAA,QACZ,MAAM,OAAO,CAAC;AAAA,QACd,OAAO,OAAO;AAAA,QACd,MAAMP;AAAA,QACN,QAAQ,OAAO,CAAC,EAAE;AAAA,MACxB,CAAK;AAAA,IACL;AAEE,WAAOO;AAAA,EACT;AASA,WAAS,sBAAuB,SAAS;AACvC,UAAM,UAAU,YAAY,MAAM,SAASH,MAAK,SAAS,OAAO;AAChE,UAAM,eAAe,YAAY,MAAM,cAAcA,MAAK,cAAc,OAAO;AAC/E,QAAI;AACJ,QAAI;AAEJ,QAAIH,OAAM,sBAAsB;AAC9B,iBAAW,YAAY,MAAM,MAAMG,MAAK,MAAM,OAAO;AACrD,kBAAY,YAAY,MAAM,OAAOA,MAAK,OAAO,OAAO;AAAA,IAC5D,OAAS;AACL,iBAAW,YAAY,MAAM,YAAYA,MAAK,MAAM,OAAO;AAC3D,kBAAY,CAAA;AAAA,IAChB;AAEE,UAAM,OAAO,QAAQ,OAAO,cAAc,UAAU,SAAS;AAE7D,WAAO,KACJ,KAAK,SAAU,IAAI,IAAI;AACtB,aAAO,GAAG,QAAQ,GAAG;AAAA,IAC3B,CAAK,EACA,IAAI,SAAU,KAAK;AAClB,aAAO;AAAA,QACL,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA;IAEpB,CAAK;AAAA,EACL;AAUA,WAAS,qBAAsB,QAAQJ,OAAM;AAC3C,YAAQA,OAAI;AAAA,MACV,KAAKI,MAAK;AACR,eAAOU,aAAY,cAAc,MAAM;AAAA,MACzC,KAAKV,MAAK;AACR,eAAOW,kBAAiB,cAAc,MAAM;AAAA,MAC9C,KAAKX,MAAK;AACR,eAAOa,WAAU,cAAc,MAAM;AAAA,MACvC,KAAKb,MAAK;AACR,eAAOY,UAAS,cAAc,MAAM;AAAA;EAE1C;AAQA,WAAS,cAAe,MAAM;AAC5B,WAAO,KAAK,OAAO,SAAU,KAAK,MAAM;AACtC,YAAM,UAAU,IAAI,SAAS,KAAK,IAAI,IAAI,IAAI,SAAS,CAAC,IAAI;AAC5D,UAAI,WAAW,QAAQ,SAAS,KAAK,MAAM;AACzC,YAAI,IAAI,SAAS,CAAC,EAAE,QAAQ,KAAK;AACjC,eAAO;AAAA,MACb;AAEI,UAAI,KAAK,IAAI;AACb,aAAO;AAAA,IACX,GAAK,CAAA,CAAE;AAAA,EACP;AAkBA,WAAS,WAAY,MAAM;AACzB,UAAM,QAAQ,CAAA;AACd,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAElB,cAAQ,IAAI,MAAI;AAAA,QACd,KAAKZ,MAAK;AACR,gBAAM,KAAK;AAAA,YAAC;AAAA,YACV,EAAE,MAAM,IAAI,MAAM,MAAMA,MAAK,cAAc,QAAQ,IAAI,OAAM;AAAA,YAC7D,EAAE,MAAM,IAAI,MAAM,MAAMA,MAAK,MAAM,QAAQ,IAAI,OAAM;AAAA,UAC/D,CAAS;AACD;AAAA,QACF,KAAKA,MAAK;AACR,gBAAM,KAAK;AAAA,YAAC;AAAA,YACV,EAAE,MAAM,IAAI,MAAM,MAAMA,MAAK,MAAM,QAAQ,IAAI,OAAM;AAAA,UAC/D,CAAS;AACD;AAAA,QACF,KAAKA,MAAK;AACR,gBAAM,KAAK;AAAA,YAAC;AAAA,YACV,EAAE,MAAM,IAAI,MAAM,MAAMA,MAAK,MAAM,QAAQ,oBAAoB,IAAI,IAAI,EAAC;AAAA,UAClF,CAAS;AACD;AAAA,QACF,KAAKA,MAAK;AACR,gBAAM,KAAK;AAAA,YACT,EAAE,MAAM,IAAI,MAAM,MAAMA,MAAK,MAAM,QAAQ,oBAAoB,IAAI,IAAI,EAAC;AAAA,UAClF,CAAS;AAAA;IAET;AAEE,WAAO;AAAA,EACT;AAcA,WAAS,WAAY,OAAOlB,UAAS;AACnC,UAAM,QAAQ,CAAA;AACd,UAAM,QAAQ,EAAE,OAAO,CAAA,EAAE;AACzB,QAAI,cAAc,CAAC,OAAO;AAE1B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAM,YAAY,MAAM,CAAC;AACzB,YAAM,iBAAiB,CAAA;AAEvB,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,cAAM,OAAO,UAAU,CAAC;AACxB,cAAM,MAAM,KAAK,IAAI;AAErB,uBAAe,KAAK,GAAG;AACvB,cAAM,GAAG,IAAI,EAAE,MAAY,WAAW,EAAC;AACvC,cAAM,GAAG,IAAI,CAAA;AAEb,iBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,gBAAM,aAAa,YAAY,CAAC;AAEhC,cAAI,MAAM,UAAU,KAAK,MAAM,UAAU,EAAE,KAAK,SAAS,KAAK,MAAM;AAClE,kBAAM,UAAU,EAAE,GAAG,IACnB,qBAAqB,MAAM,UAAU,EAAE,YAAY,KAAK,QAAQ,KAAK,IAAI,IACzE,qBAAqB,MAAM,UAAU,EAAE,WAAW,KAAK,IAAI;AAE7D,kBAAM,UAAU,EAAE,aAAa,KAAK;AAAA,UAC9C,OAAe;AACL,gBAAI,MAAM,UAAU,EAAG,OAAM,UAAU,EAAE,YAAY,KAAK;AAE1D,kBAAM,UAAU,EAAE,GAAG,IAAI,qBAAqB,KAAK,QAAQ,KAAK,IAAI,IAClE,IAAIkB,MAAK,sBAAsB,KAAK,MAAMlB,QAAO;AAAA,UAC7D;AAAA,QACA;AAAA,MACA;AAEI,oBAAc;AAAA,IAClB;AAEE,aAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,YAAM,YAAY,CAAC,CAAC,EAAE,MAAM;AAAA,IAChC;AAEE,WAAO,EAAE,KAAK,OAAO,MAAY;AAAA,EACnC;AAUA,WAAS,mBAAoB,MAAM,WAAW;AAC5C,QAAIc;AACJ,UAAM,WAAWI,MAAK,mBAAmB,IAAI;AAE7C,IAAAJ,QAAOI,MAAK,KAAK,WAAW,QAAQ;AAGpC,QAAIJ,UAASI,MAAK,QAAQJ,MAAK,MAAM,SAAS,KAAK;AACjD,YAAM,IAAI,MAAM,MAAM,OAAO,mCACOI,MAAK,SAASJ,KAAI,IACpD,4BAA4BI,MAAK,SAAS,QAAQ,CAAC;AAAA,IACzD;AAGE,QAAIJ,UAASI,MAAK,SAAS,CAACH,OAAM,mBAAkB,GAAI;AACtD,MAAAD,QAAOI,MAAK;AAAA,IAChB;AAEE,YAAQJ,OAAI;AAAA,MACV,KAAKI,MAAK;AACR,eAAO,IAAIU,aAAY,IAAI;AAAA,MAE7B,KAAKV,MAAK;AACR,eAAO,IAAIW,kBAAiB,IAAI;AAAA,MAElC,KAAKX,MAAK;AACR,eAAO,IAAIa,WAAU,IAAI;AAAA,MAE3B,KAAKb,MAAK;AACR,eAAO,IAAIY,UAAS,IAAI;AAAA;EAE9B;AAiBA,UAAA,YAAoB,SAAS,UAAW,OAAO;AAC7C,WAAO,MAAM,OAAO,SAAU,KAAK,KAAK;AACtC,UAAI,OAAO,QAAQ,UAAU;AAC3B,YAAI,KAAK,mBAAmB,KAAK,IAAI,CAAC;AAAA,MAC5C,WAAe,IAAI,MAAM;AACnB,YAAI,KAAK,mBAAmB,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,MACrD;AAEI,aAAO;AAAA,IACX,GAAK,CAAA,CAAE;AAAA,EACP;AAUA,UAAA,aAAqB,SAAS,WAAY,MAAM9B,UAAS;AACvD,UAAM,OAAO,sBAAsB,MAAMe,OAAM,mBAAkB,CAAE;AAEnE,UAAM,QAAQ,WAAW,IAAI;AAC7B,UAAM,QAAQ,WAAW,OAAOf,QAAO;AACvC,UAAM,OAAO2B,UAAS,UAAU,MAAM,KAAK,SAAS,KAAK;AAEzD,UAAM,gBAAgB,CAAA;AACtB,aAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;AACxC,oBAAc,KAAK,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,IAAI;AAAA,IAChD;AAEE,WAAO,QAAQ,UAAU,cAAc,aAAa,CAAC;AAAA,EACvD;AAYA,UAAA,WAAmB,SAAS,SAAU,MAAM;AAC1C,WAAO,QAAQ;AAAA,MACb,sBAAsB,MAAMZ,OAAM,mBAAkB,CAAE;AAAA;EAE1D;;ACzUA,MAAMA,UAAQT;AACd,MAAM,UAAUO;AAChB,MAAM,YAAYI;AAClB,MAAM,YAAYE;AAClB,MAAM,mBAAmBC;AACzB,MAAM,gBAAgBY;AACtB,MAAM,cAAcC;AACpB,MAAM,SAASC;AACf,MAAM,qBAAqBE;AAC3B,MAAM,UAAUC;AAChB,MAAM,aAAaC;AACnB,MAAM,OAAOC;AACb,MAAM,WAAWC;AAkCjB,SAAS,mBAAoB,QAAQxC,UAAS;AAC5C,QAAM,OAAO,OAAO;AACpB,QAAM,MAAM,cAAc,aAAaA,QAAO;AAE9C,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,UAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,YAAK,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACxC,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACtC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAI;AACxC,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QAClD;AAAA,MACA;AAAA,IACA;AAAA,EACA;AACA;AASA,SAAS,mBAAoB,QAAQ;AACnC,QAAM,OAAO,OAAO;AAEpB,WAAS,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK;AACjC,UAAM,QAAQ,IAAI,MAAM;AACxB,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAC5B,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAAA,EAChC;AACA;AAUA,SAAS,sBAAuB,QAAQA,UAAS;AAC/C,QAAM,MAAM,iBAAiB,aAAaA,QAAO;AAEjD,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,KAC1C,MAAM,KAAK,MAAM,GAAI;AACtB,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QAClD;AAAA,MACA;AAAA,IACA;AAAA,EACA;AACA;AAQA,SAAS,iBAAkB,QAAQA,UAAS;AAC1C,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,QAAQ,eAAeA,QAAO;AAC3C,MAAI,KAAK,KAAK;AAEd,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,KAAK,MAAM,IAAI,CAAC;AACtB,UAAM,IAAI,IAAI,OAAO,IAAI;AACzB,WAAQ,QAAQ,IAAK,OAAO;AAE5B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAC9B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAAA,EAClC;AACA;AASA,SAAS,gBAAiB,QAAQU,uBAAsBF,cAAa;AACnE,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,WAAW,eAAeE,uBAAsBF,YAAW;AACxE,MAAI,GAAG;AAEP,OAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACvB,WAAQ,QAAQ,IAAK,OAAO;AAG5B,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IAChC,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IACpC,OAAW;AACL,aAAO,IAAI,OAAO,KAAK,GAAG,GAAG,KAAK,IAAI;AAAA,IAC5C;AAGI,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,OAAO,IAAI,GAAG,KAAK,IAAI;AAAA,IAC3C,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI;AAAA,IAC7C,OAAW;AACL,aAAO,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI;AAAA,IACzC;AAAA,EACA;AAGE,SAAO,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI;AACjC;AAQA,SAAS,UAAW,QAAQ,MAAM;AAChC,QAAM,OAAO,OAAO;AACpB,MAAI,MAAM;AACV,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,WAAS,MAAM,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG;AAC1C,QAAI,QAAQ,EAAG;AAEf,WAAO,MAAM;AACX,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,OAAO,WAAW,KAAK,MAAM,CAAC,GAAG;AACpC,cAAI,OAAO;AAEX,cAAI,YAAY,KAAK,QAAQ;AAC3B,oBAAU,KAAK,SAAS,MAAM,WAAY,OAAO;AAAA,UAC7D;AAEU,iBAAO,IAAI,KAAK,MAAM,GAAG,IAAI;AAC7B;AAEA,cAAI,aAAa,IAAI;AACnB;AACA,uBAAW;AAAA,UACvB;AAAA,QACA;AAAA,MACA;AAEM,aAAO;AAEP,UAAI,MAAM,KAAK,QAAQ,KAAK;AAC1B,eAAO;AACP,cAAM,CAAC;AACP;AAAA,MACR;AAAA,IACA;AAAA,EACA;AACA;AAUA,SAAS,WAAYR,UAASU,uBAAsBW,WAAU;AAE5D,QAAM,SAAS,IAAI,UAAS;AAE5B,EAAAA,UAAS,QAAQ,SAAU,MAAM;AAE/B,WAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAS3B,WAAO,IAAI,KAAK,UAAS,GAAI,KAAK,sBAAsB,KAAK,MAAMrB,QAAO,CAAC;AAG3E,SAAK,MAAM,MAAM;AAAA,EACrB,CAAG;AAGD,QAAM,iBAAiBe,QAAM,wBAAwBf,QAAO;AAC5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASU,qBAAoB;AACpF,QAAM,0BAA0B,iBAAiB,oBAAoB;AAOrE,MAAI,OAAO,oBAAoB,KAAK,wBAAwB;AAC1D,WAAO,IAAI,GAAG,CAAC;AAAA,EACnB;AAOE,SAAO,OAAO,oBAAoB,MAAM,GAAG;AACzC,WAAO,OAAO,CAAC;AAAA,EACnB;AAME,QAAM,iBAAiB,yBAAyB,OAAO,gBAAe,KAAM;AAC5E,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,WAAO,IAAI,IAAI,IAAI,KAAO,KAAM,CAAC;AAAA,EACrC;AAEE,SAAO,gBAAgB,QAAQV,UAASU,qBAAoB;AAC9D;AAWA,SAAS,gBAAiBc,YAAWxB,UAASU,uBAAsB;AAElE,QAAM,iBAAiBK,QAAM,wBAAwBf,QAAO;AAG5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASU,qBAAoB;AAGpF,QAAM,qBAAqB,iBAAiB;AAG5C,QAAM,gBAAgB,OAAO,eAAeV,UAASU,qBAAoB;AAGzE,QAAM,iBAAiB,iBAAiB;AACxC,QAAM,iBAAiB,gBAAgB;AAEvC,QAAM,yBAAyB,KAAK,MAAM,iBAAiB,aAAa;AAExE,QAAM,wBAAwB,KAAK,MAAM,qBAAqB,aAAa;AAC3E,QAAM,wBAAwB,wBAAwB;AAGtD,QAAM,UAAU,yBAAyB;AAGzC,QAAM,KAAK,IAAI,mBAAmB,OAAO;AAEzC,MAAI,SAAS;AACb,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,MAAI,cAAc;AAClB,QAAM,SAAS,IAAI,WAAWc,WAAU,MAAM;AAG9C,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,UAAM,WAAW,IAAI,iBAAiB,wBAAwB;AAG9D,WAAO,CAAC,IAAI,OAAO,MAAM,QAAQ,SAAS,QAAQ;AAGlD,WAAO,CAAC,IAAI,GAAG,OAAO,OAAO,CAAC,CAAC;AAE/B,cAAU;AACV,kBAAc,KAAK,IAAI,aAAa,QAAQ;AAAA,EAChD;AAIE,QAAM,OAAO,IAAI,WAAW,cAAc;AAC1C,MAAI,QAAQ;AACZ,MAAI,GAAG;AAGP,OAAK,IAAI,GAAG,IAAI,aAAa,KAAK;AAChC,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,UAAI,IAAI,OAAO,CAAC,EAAE,QAAQ;AACxB,aAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,MACnC;AAAA,IACA;AAAA,EACA;AAGE,OAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,WAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,IACjC;AAAA,EACA;AAEE,SAAO;AACT;AAWA,SAAS,aAAc,MAAMxB,UAASU,uBAAsBF,cAAa;AACvE,MAAIa;AAEJ,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,IAAAA,YAAW,SAAS,UAAU,IAAI;AAAA,EACtC,WAAa,OAAO,SAAS,UAAU;AACnC,QAAI,mBAAmBrB;AAEvB,QAAI,CAAC,kBAAkB;AACrB,YAAM,cAAc,SAAS,SAAS,IAAI;AAG1C,yBAAmB,QAAQ,sBAAsB,aAAaU,qBAAoB;AAAA,IACxF;AAII,IAAAW,YAAW,SAAS,WAAW,MAAM,oBAAoB,EAAE;AAAA,EAC/D,OAAS;AACL,UAAM,IAAI,MAAM,cAAc;AAAA,EAClC;AAGE,QAAM,cAAc,QAAQ,sBAAsBA,WAAUX,qBAAoB;AAGhF,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC7E;AAGE,MAAI,CAACV,UAAS;AACZ,IAAAA,WAAU;AAAA,EAGd,WAAaA,WAAU,aAAa;AAChC,UAAM,IAAI;AAAA,MAAM,0HAE0C,cAAc;AAAA,IAC5E;AAAA,EACA;AAEE,QAAM,WAAW,WAAWA,UAASU,uBAAsBW,SAAQ;AAGnE,QAAM,cAAcN,QAAM,cAAcf,QAAO;AAC/C,QAAM,UAAU,IAAI,UAAU,WAAW;AAGzC,qBAAmB,SAASA,QAAO;AACnC,qBAAmB,OAAO;AAC1B,wBAAsB,SAASA,QAAO;AAMtC,kBAAgB,SAASU,uBAAsB,CAAC;AAEhD,MAAIV,YAAW,GAAG;AAChB,qBAAiB,SAASA,QAAO;AAAA,EACrC;AAGE,YAAU,SAAS,QAAQ;AAE3B,MAAI,MAAMQ,YAAW,GAAG;AAEtB,IAAAA,eAAc,YAAY;AAAA,MAAY;AAAA,MACpC,gBAAgB,KAAK,MAAM,SAASE,qBAAoB;AAAA,IAAC;AAAA,EAC/D;AAGE,cAAY,UAAUF,cAAa,OAAO;AAG1C,kBAAgB,SAASE,uBAAsBF,YAAW;AAE1D,SAAO;AAAA,IACL;AAAA,IACA,SAASR;AAAA,IACT,sBAAsBU;AAAA,IACtB,aAAaF;AAAA,IACb,UAAUa;AAAA,EACd;AACA;AAWA,OAAA,SAAiB,SAAS,OAAQ,MAAM,SAAS;AAC/C,MAAI,OAAO,SAAS,eAAe,SAAS,IAAI;AAC9C,UAAM,IAAI,MAAM,eAAe;AAAA,EACnC;AAEE,MAAIX,wBAAuB,QAAQ;AACnC,MAAIV;AACJ,MAAI;AAEJ,MAAI,OAAO,YAAY,aAAa;AAElC,IAAAU,wBAAuB,QAAQ,KAAK,QAAQ,sBAAsB,QAAQ,CAAC;AAC3E,IAAAV,WAAU,QAAQ,KAAK,QAAQ,OAAO;AACtC,WAAO,YAAY,KAAK,QAAQ,WAAW;AAE3C,QAAI,QAAQ,YAAY;AACtBe,cAAM,kBAAkB,QAAQ,UAAU;AAAA,IAChD;AAAA,EACA;AAEE,SAAO,aAAa,MAAMf,UAASU,uBAAsB,IAAI;AAC/D;;;;AC9eA,WAAS,SAAU,KAAK;AACtB,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI,SAAQ;AAAA,IACtB;AAEE,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI,MAAM,uCAAuC;AAAA,IAC3D;AAEE,QAAI,UAAU,IAAI,MAAK,EAAG,QAAQ,KAAK,EAAE,EAAE,MAAM,EAAE;AACnD,QAAI,QAAQ,SAAS,KAAK,QAAQ,WAAW,KAAK,QAAQ,SAAS,GAAG;AACpE,YAAM,IAAI,MAAM,wBAAwB,GAAG;AAAA,IAC/C;AAGE,QAAI,QAAQ,WAAW,KAAK,QAAQ,WAAW,GAAG;AAChD,gBAAU,MAAM,UAAU,OAAO,MAAM,CAAA,GAAI,QAAQ,IAAI,SAAU,GAAG;AAClE,eAAO,CAAC,GAAG,CAAC;AAAA,MAClB,CAAK,CAAC;AAAA,IACN;AAGE,QAAI,QAAQ,WAAW,EAAG,SAAQ,KAAK,KAAK,GAAG;AAE/C,UAAM,WAAW,SAAS,QAAQ,KAAK,EAAE,GAAG,EAAE;AAE9C,WAAO;AAAA,MACL,GAAI,YAAY,KAAM;AAAA,MACtB,GAAI,YAAY,KAAM;AAAA,MACtB,GAAI,YAAY,IAAK;AAAA,MACrB,GAAG,WAAW;AAAA,MACd,KAAK,MAAM,QAAQ,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE;AAAA;EAE1C;AAEA,UAAA,aAAqB,SAAS,WAAY,SAAS;AACjD,QAAI,CAAC,QAAS,WAAU,CAAA;AACxB,QAAI,CAAC,QAAQ,MAAO,SAAQ,QAAQ,CAAA;AAEpC,UAAM,SAAS,OAAO,QAAQ,WAAW,eACvC,QAAQ,WAAW,QACnB,QAAQ,SAAS,IACf,IACA,QAAQ;AAEZ,UAAM,QAAQ,QAAQ,SAAS,QAAQ,SAAS,KAAK,QAAQ,QAAQ;AACrE,UAAM,QAAQ,QAAQ,SAAS;AAE/B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,QAAQ,IAAI;AAAA,MACnB;AAAA,MACA,OAAO;AAAA,QACL,MAAM,SAAS,QAAQ,MAAM,QAAQ,WAAW;AAAA,QAChD,OAAO,SAAS,QAAQ,MAAM,SAAS,WAAW;AAAA;MAEpD,MAAM,QAAQ;AAAA,MACd,cAAc,QAAQ,gBAAgB,CAAA;AAAA;EAE1C;AAEA,UAAA,WAAmB,SAAS,SAAU,QAAQ,MAAM;AAClD,WAAO,KAAK,SAAS,KAAK,SAAS,SAAS,KAAK,SAAS,IACtD,KAAK,SAAS,SAAS,KAAK,SAAS,KACrC,KAAK;AAAA,EACX;AAEA,UAAA,gBAAwB,SAAS,cAAe,QAAQ,MAAM;AAC5D,UAAM,QAAQ,QAAQ,SAAS,QAAQ,IAAI;AAC3C,WAAO,KAAK,OAAO,SAAS,KAAK,SAAS,KAAK,KAAK;AAAA,EACtD;AAEA,UAAA,gBAAwB,SAAS,cAAe,SAAS,IAAI,MAAM;AACjE,UAAM,OAAO,GAAG,QAAQ;AACxB,UAAM,OAAO,GAAG,QAAQ;AACxB,UAAM,QAAQ,QAAQ,SAAS,MAAM,IAAI;AACzC,UAAM,aAAa,KAAK,OAAO,OAAO,KAAK,SAAS,KAAK,KAAK;AAC9D,UAAM,eAAe,KAAK,SAAS;AACnC,UAAM,UAAU,CAAC,KAAK,MAAM,OAAO,KAAK,MAAM,IAAI;AAElD,aAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,eAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,YAAI,UAAU,IAAI,aAAa,KAAK;AACpC,YAAI,UAAU,KAAK,MAAM;AAEzB,YAAI,KAAK,gBAAgB,KAAK,gBAC5B,IAAI,aAAa,gBAAgB,IAAI,aAAa,cAAc;AAChE,gBAAM,OAAO,KAAK,OAAO,IAAI,gBAAgB,KAAK;AAClD,gBAAM,OAAO,KAAK,OAAO,IAAI,gBAAgB,KAAK;AAClD,oBAAU,QAAQ,KAAK,OAAO,OAAO,IAAI,IAAI,IAAI,CAAC;AAAA,QAC1D;AAEM,gBAAQ,QAAQ,IAAI,QAAQ;AAC5B,gBAAQ,QAAQ,IAAI,QAAQ;AAC5B,gBAAQ,QAAQ,IAAI,QAAQ;AAC5B,gBAAQ,MAAM,IAAI,QAAQ;AAAA,MAChC;AAAA,IACA;AAAA,EACA;;;AClGA,QAAMK,SAAQT;AAEd,WAAS,YAAa,KAAKmC,SAAQ,MAAM;AACvC,QAAI,UAAU,GAAG,GAAGA,QAAO,OAAOA,QAAO,MAAM;AAE/C,QAAI,CAACA,QAAO,MAAO,CAAAA,QAAO,QAAQ,CAAA;AAClC,IAAAA,QAAO,SAAS;AAChB,IAAAA,QAAO,QAAQ;AACf,IAAAA,QAAO,MAAM,SAAS,OAAO;AAC7B,IAAAA,QAAO,MAAM,QAAQ,OAAO;AAAA,EAC9B;AAEA,WAAS,mBAAoB;AAC3B,QAAI;AACF,aAAO,SAAS,cAAc,QAAQ;AAAA,IAC1C,SAAW,GAAG;AACV,YAAM,IAAI,MAAM,sCAAsC;AAAA,IAC1D;AAAA,EACA;AAEA,UAAA,SAAiB,SAASC,QAAQ,QAAQD,SAAQ,SAAS;AACzD,QAAI,OAAO;AACX,QAAI,WAAWA;AAEf,QAAI,OAAO,SAAS,gBAAgB,CAACA,WAAU,CAACA,QAAO,aAAa;AAClE,aAAOA;AACP,MAAAA,UAAS;AAAA,IACb;AAEE,QAAI,CAACA,SAAQ;AACX,iBAAW,iBAAgB;AAAA,IAC/B;AAEE,WAAO1B,OAAM,WAAW,IAAI;AAC5B,UAAM,OAAOA,OAAM,cAAc,OAAO,QAAQ,MAAM,IAAI;AAE1D,UAAM,MAAM,SAAS,WAAW,IAAI;AACpC,UAAM,QAAQ,IAAI,gBAAgB,MAAM,IAAI;AAC5C,IAAAA,OAAM,cAAc,MAAM,MAAM,QAAQ,IAAI;AAE5C,gBAAY,KAAK,UAAU,IAAI;AAC/B,QAAI,aAAa,OAAO,GAAG,CAAC;AAE5B,WAAO;AAAA,EACT;AAEA,UAAA,kBAA0B,SAAS,gBAAiB,QAAQ0B,SAAQ,SAAS;AAC3E,QAAI,OAAO;AAEX,QAAI,OAAO,SAAS,gBAAgB,CAACA,WAAU,CAACA,QAAO,aAAa;AAClE,aAAOA;AACP,MAAAA,UAAS;AAAA,IACb;AAEE,QAAI,CAAC,KAAM,QAAO,CAAA;AAElB,UAAM,WAAW,QAAQ,OAAO,QAAQA,SAAQ,IAAI;AAEpD,UAAM,OAAO,KAAK,QAAQ;AAC1B,UAAM,eAAe,KAAK,gBAAgB,CAAA;AAE1C,WAAO,SAAS,UAAU,MAAM,aAAa,OAAO;AAAA,EACtD;;;AC9DA,MAAM,QAAQnC;AAEd,SAAS,eAAgB,OAAO,QAAQ;AACtC,QAAM,QAAQ,MAAM,IAAI;AACxB,QAAM,MAAM,SAAS,OAAO,MAAM,MAAM;AAExC,SAAO,QAAQ,IACX,MAAM,MAAM,SAAS,eAAe,MAAM,QAAQ,CAAC,EAAE,MAAM,CAAC,IAAI,MAChE;AACN;AAEA,SAAS,OAAQ,KAAK,GAAG,GAAG;AAC1B,MAAI,MAAM,MAAM;AAChB,MAAI,OAAO,MAAM,YAAa,QAAO,MAAM;AAE3C,SAAO;AACT;AAEA,SAAS,SAAU,MAAM,MAAM,QAAQ;AACrC,MAAI,OAAO;AACX,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,aAAa;AAEjB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,MAAM,IAAI,IAAI;AAC/B,UAAM,MAAM,KAAK,MAAM,IAAI,IAAI;AAE/B,QAAI,CAAC,OAAO,CAAC,OAAQ,UAAS;AAE9B,QAAI,KAAK,CAAC,GAAG;AACX;AAEA,UAAI,EAAE,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI,CAAC,IAAI;AACtC,gBAAQ,SACJ,OAAO,KAAK,MAAM,QAAQ,MAAM,MAAM,MAAM,IAC5C,OAAO,KAAK,QAAQ,CAAC;AAEzB,iBAAS;AACT,iBAAS;AAAA,MACjB;AAEM,UAAI,EAAE,MAAM,IAAI,QAAQ,KAAK,IAAI,CAAC,IAAI;AACpC,gBAAQ,OAAO,KAAK,UAAU;AAC9B,qBAAa;AAAA,MACrB;AAAA,IACA,OAAW;AACL;AAAA,IACN;AAAA,EACA;AAEE,SAAO;AACT;AAEA,OAAA,SAAiB,SAAS,OAAQ,QAAQ,SAAS,IAAI;AACrD,QAAM,OAAO,MAAM,WAAW,OAAO;AACrC,QAAM,OAAO,OAAO,QAAQ;AAC5B,QAAM,OAAO,OAAO,QAAQ;AAC5B,QAAM,aAAa,OAAO,KAAK,SAAS;AAExC,QAAM,KAAK,CAAC,KAAK,MAAM,MAAM,IACzB,KACA,WAAW,eAAe,KAAK,MAAM,OAAO,MAAM,IAClD,cAAc,aAAa,MAAM,aAAa;AAElD,QAAM,OACJ,WAAW,eAAe,KAAK,MAAM,MAAM,QAAQ,IACnD,SAAS,SAAS,MAAM,MAAM,KAAK,MAAM,IAAI;AAE/C,QAAM,UAAU,kBAAuB,aAAa,MAAM,aAAa;AAEvE,QAAM,QAAQ,CAAC,KAAK,QAAQ,KAAK,YAAY,KAAK,QAAQ,eAAe,KAAK,QAAQ;AAEtF,QAAMqC,UAAS,6CAA6C,QAAQ,UAAU,mCAAmC,KAAK,OAAO;AAE7H,MAAI,OAAO,OAAO,YAAY;AAC5B,OAAG,MAAMA,OAAM;AAAA,EACnB;AAEE,SAAOA;AACT;AC/EA,MAAM,aAAarC;AAEnB,MAAM,SAASO;AACf,MAAM,iBAAiBI;AACvB,MAAM,cAAcE;AAEpB,SAAS,aAAc,YAAYsB,SAAQ,MAAM,MAAM,IAAI;AACzD,QAAM,OAAO,CAAA,EAAG,MAAM,KAAK,WAAW,CAAC;AACvC,QAAM,UAAU,KAAK;AACrB,QAAM,cAAc,OAAO,KAAK,UAAU,CAAC,MAAM;AAEjD,MAAI,CAAC,eAAe,CAAC,cAAc;AACjC,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACxD;AAEE,MAAI,aAAa;AACf,QAAI,UAAU,GAAG;AACf,YAAM,IAAI,MAAM,4BAA4B;AAAA,IAClD;AAEI,QAAI,YAAY,GAAG;AACjB,WAAK;AACL,aAAOA;AACP,MAAAA,UAAS,OAAO;AAAA,IACtB,WAAe,YAAY,GAAG;AACxB,UAAIA,QAAO,cAAc,OAAO,OAAO,aAAa;AAClD,aAAK;AACL,eAAO;AAAA,MACf,OAAa;AACL,aAAK;AACL,eAAO;AACP,eAAOA;AACP,QAAAA,UAAS;AAAA,MACjB;AAAA,IACA;AAAA,EACA,OAAS;AACL,QAAI,UAAU,GAAG;AACf,YAAM,IAAI,MAAM,4BAA4B;AAAA,IAClD;AAEI,QAAI,YAAY,GAAG;AACjB,aAAOA;AACP,MAAAA,UAAS,OAAO;AAAA,IACtB,WAAe,YAAY,KAAK,CAACA,QAAO,YAAY;AAC9C,aAAO;AACP,aAAOA;AACP,MAAAA,UAAS;AAAA,IACf;AAEI,WAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAC5C,UAAI;AACF,cAAM,OAAO,OAAO,OAAO,MAAM,IAAI;AACrC,gBAAQ,WAAW,MAAMA,SAAQ,IAAI,CAAC;AAAA,MAC9C,SAAe,GAAG;AACV,eAAO,CAAC;AAAA,MAChB;AAAA,IACA,CAAK;AAAA,EACL;AAEE,MAAI;AACF,UAAM,OAAO,OAAO,OAAO,MAAM,IAAI;AACrC,OAAG,MAAM,WAAW,MAAMA,SAAQ,IAAI,CAAC;AAAA,EAC3C,SAAW,GAAG;AACV,OAAG,CAAC;AAAA,EACR;AACA;AAEA,QAAA,SAAiB,OAAO;AACxB,QAAA,WAAmB,aAAa,KAAK,MAAM,eAAe,MAAM;AAChE,QAAA,YAAoB,aAAa,KAAK,MAAM,eAAe,eAAe;AAG1E,QAAA,WAAmB,aAAa,KAAK,MAAM,SAAU,MAAM,GAAG,MAAM;AAClE,SAAO,YAAY,OAAO,MAAM,IAAI;AACtC,CAAC;ACjEW,MAAC,iBAAiB,OAAO,MAAM,kBAAkB,WAAW,kBAAkB,cAAc;AACtG,MAAI;AACF,UAAM,UAAU,MAAMG,QAAO,UAAU,MAAM;AAAA,MAC3C,OAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO;AAAA,MACf;AAAA,MACM,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,sBAAsB;AAAA,IAC5B,CAAK;AACD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,YAAQ,MAAM,6BAA6B,KAAK;AAChD,WAAO;AAAA,EACT;AACF;AASY,MAAC,oBAAoB,OAAO,MAAM,kBAAkB,WAAW,kBAAkB,cAAc;AACzG,MAAI;AACF,UAAM,YAAY,MAAMA,QAAO,SAAS,MAAM;AAAA,MAC5C,MAAM;AAAA,MACN,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,sBAAsB;AAAA,MACtB,OAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO;AAAA,MACf;AAAA,IACA,CAAK;AACD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,YAAQ,MAAM,iCAAiC,KAAK;AACpD,WAAO;AAAA,EACT;AACF;AASY,MAAC,mBAAmB,OAAO,WAAW,UAAU,YAAY,OAAO;AAC7E,SAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,UAAMH,UAAS,SAAS,cAAc,QAAQ;AAC9C,UAAM,MAAMA,QAAO,WAAW,IAAI;AAGlC,IAAAA,QAAO,QAAQ;AACf,IAAAA,QAAO,SAAS;AAGhB,UAAM,UAAU,IAAI,MAAK;AACzB,UAAM,cAAc,IAAI,MAAK;AAE7B,YAAQ,SAAS,MAAM;AAErB,UAAI,UAAU,SAAS,GAAG,GAAG,KAAK,GAAG;AAErC,kBAAY,SAAS,MAAM;AAEzB,cAAM,sBAAsB,OAAO,YAAY;AAG/C,cAAM,SAAS;AACf,cAAM,UAAU,sBAAuB,SAAS;AAChD,cAAM,QAAQ,MAAM,WAAW;AAC/B,cAAM,QAAQ,MAAM,WAAW;AAG/B,YAAI,YAAY;AAChB,YAAI,SAAS,MAAM,MAAM,SAAS,OAAO;AAGzC,cAAM,SAAS,OAAO;AACtB,cAAM,SAAS,OAAO;AAGtB,YAAI,UAAU,aAAa,QAAQ,QAAQ,qBAAqB,mBAAmB;AAGnF,gBAAQA,QAAO,UAAU,WAAW,CAAC;AAAA,MACvC;AAGA,kBAAY,UAAU,MAAM;AAC1B,gBAAQ,MAAM,4BAA4B;AAC1C,gBAAQ,SAAS;AAAA,MACnB;AAEA,kBAAY,MAAM;AAAA,IACpB;AAGA,YAAQ,UAAU,MAAM;AACtB,cAAQ,MAAM,uBAAuB;AACrC,cAAQ,SAAS;AAAA,IACnB;AAEA,YAAQ,MAAM;AAAA,EAChB,CAAC;AACH;AAWY,MAAC,kBAAkB,CAAC,KAAK,YAAY,GAAG,GAAG,WAAW;AAChE,SAAO,IAAI,QAAQ,CAAC,YAAY;AAE9B,UAAMA,UAAS,SAAS,cAAc,QAAQ;AAC9C,UAAM,MAAMA,QAAO,WAAW,IAAI;AAGlC,IAAAA,QAAO,QAAQ,IAAI;AACnB,IAAAA,QAAO,SAAS,IAAI;AAGpB,QAAI,UAAU,KAAK,GAAG,CAAC;AAGvB,UAAM,YAAY,IAAI,aAAa,GAAG,GAAGA,QAAO,OAAOA,QAAO,MAAM;AAGpE,UAAM,QAAQ,OAAO,gBAAgB,8BAA8B,GAAG;AAEtE,UAAM,QAAQ,aAAa,KAAK,IAAI,IAAI,OAAO,IAAI,MAAM;AACzD,UAAM,aAAa,aAAa,aAAa,EAAE,QAAQ,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,WAAW,MAAM,QAAQ,CAAC,CAAC,GAAG;AAGxG,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,IAAI,OAAO,IAAI,MAAM,IAAI,EAAE,CAAC;AAC/E,UAAM,OAAO,UAAU;AAEvB,aAASI,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK,YAAY;AAC/C,eAASC,KAAI,GAAGA,KAAI,IAAI,OAAOA,MAAK,YAAY;AAC9C,cAAM,SAASD,KAAI,IAAI,QAAQC,MAAK;AACpC,cAAM,IAAI,KAAK,KAAK;AACpB,cAAM,IAAI,KAAK,QAAQ,CAAC;AACxB,cAAM,IAAI,KAAK,QAAQ,CAAC;AACxB,cAAM,IAAI,KAAK,QAAQ,CAAC;AAGxB,YAAI,IAAI,QAAQ,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI;AACxC,gBAAM,OAAO,OAAO,gBAAgB,8BAA8B,MAAM;AACxE,eAAK,aAAa,KAAKA,GAAE,QAAQ,CAAC,CAAC;AACnC,eAAK,aAAa,KAAKD,GAAE,QAAQ,CAAC,CAAC;AACnC,eAAK,aAAa,SAAS,WAAW,QAAQ,CAAC,CAAC;AAChD,eAAK,aAAa,UAAU,WAAW,QAAQ,CAAC,CAAC;AACjD,eAAK,aAAa,QAAQ,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG;AACjD,gBAAM,YAAY,IAAI;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AAEA,YAAQ,KAAK;AAAA,EACf,CAAC;AACH;AASY,MAAC,gBAAgB,OAAO,WAAW,UAAU,YAAY,OAAO;AAC1E,SAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,UAAM,MAAM,IAAI,MAAK;AAErB,QAAI,SAAS,MAAM;AAEjB,YAAM,SAAS,IAAI,UAAS;AAC5B,YAAM,SAAS,OAAO,gBAAgB,WAAW,eAAe;AAChE,YAAM,aAAa,OAAO;AAI1B,YAAM,SAAS;AACf,YAAM,sBAAsB,UAAU,YAAY;AAClD,YAAM,SAAS;AACf,YAAM,UAAU,sBAAuB,SAAS;AAChD,YAAM,QAAQ,SAAS,WAAW;AAClC,YAAM,QAAQ,SAAS,WAAW;AAClC,YAAM,SAAS,OAAO;AACtB,YAAM,SAAS,OAAO;AAGtB,YAAM,WAAW,OAAO,gBAAgB,8BAA8B,MAAM;AAC5E,eAAS,aAAa,KAAK,KAAK,QAAQ,CAAC,CAAC;AAC1C,eAAS,aAAa,KAAK,KAAK,QAAQ,CAAC,CAAC;AAC1C,eAAS,aAAa,SAAS,QAAQ,QAAQ,CAAC,CAAC;AACjD,eAAS,aAAa,UAAU,QAAQ,QAAQ,CAAC,CAAC;AAClD,eAAS,aAAa,QAAQ,SAAS;AAGvC,iBAAW,YAAY,QAAQ;AAG/B,UAAI,SAAS,WAAW,oBAAoB,GAAG;AAC7C,gBAAQ,IAAI,sBAAsB;AAElC,cAAM,eAAe,OAAO,gBAAgB,8BAA8B,OAAO;AACjF,qBAAa,aAAa,KAAK,OAAO,QAAQ,CAAC,CAAC;AAChD,qBAAa,aAAa,KAAK,OAAO,QAAQ,CAAC,CAAC;AAChD,qBAAa,aAAa,SAAS,oBAAoB,QAAQ,CAAC,CAAC;AACjE,qBAAa,aAAa,UAAU,oBAAoB,QAAQ,CAAC,CAAC;AAClE,qBAAa,aAAa,QAAQ,QAAQ;AAC1C,mBAAW,YAAY,YAAY;AACnC,gBAAQ,IAAI,yBAAyB;AAGrC,cAAM,aAAa,IAAI,cAAa;AACpC,gBAAQ,WAAW,kBAAkB,UAAU,CAAC;AAAA,MAClD,OAAO;AACL,gBAAQ,IAAI,yBAAyB;AAErC,wBAAgB,KAAK,qBAAqB,QAAQ,QAAQ,MAAM,EAAE,KAAK,CAAC,oBAAoB;AAC1F,qBAAW,YAAY,eAAe;AACtC,kBAAQ,IAAI,8BAA8B;AAG1C,gBAAM,aAAa,IAAI,cAAa;AACpC,kBAAQ,WAAW,kBAAkB,UAAU,CAAC;AAAA,QAClD,CAAC,EAAE,MAAM,CAAC,UAAU;AAClB,kBAAQ,MAAM,yBAAyB,KAAK;AAE5C,gBAAM,aAAa,IAAI,cAAa;AACpC,kBAAQ,WAAW,kBAAkB,UAAU,CAAC;AAAA,QAClD,CAAC;AAAA,MACH;AAAA,IACF;AAEA,QAAI,UAAU,MAAM;AAClB,cAAQ,MAAM,6BAA6B;AAC3C,cAAQ,SAAS;AAAA,IACnB;AAEA,QAAI,MAAM;AAAA,EACZ,CAAC;AACH;AAWY,MAAC,4BAA4B,OACvC,MACA,WAAW,MACX,YAAY,IACZ,kBAAkB,WAClB,kBAAkB,cACf;AACH,MAAI;AAEF,UAAM,YAAY,MAAM,kBAAkB,MAAM,iBAAiB,eAAe;AAEhF,QAAI,CAAC,WAAW;AACd,aAAO;AAAA,IACT;AAGA,QAAI,UAAU;AACZ,cAAQ,IAAI,+BAA+B;AAC3C,YAAM,SAAS,MAAM,cAAc,WAAW,UAAU,SAAS;AACjE,cAAQ,IAAI,0BAA0B;AACtC,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,SAAS,OAAO;AACd,YAAQ,MAAM,0CAA0C,KAAK;AAC7D,WAAO;AAAA,EACT;AACF;AAOY,MAAC,cAAc,CAAC,YAAY,WAAW,iBAAiB;AAClE,MAAI,CAAC,YAAY;AACf,YAAQ,MAAM,4BAA4B;AAC1C;AAAA,EACF;AAGA,QAAM,OAAO,IAAI,KAAK,CAAC,UAAU,GAAG,EAAE,MAAM,gBAAe,CAAE;AAC7D,QAAM,MAAM,IAAI,gBAAgB,IAAI;AACpC,QAAM,IAAI,SAAS,cAAc,GAAG;AACpC,IAAE,OAAO;AACT,IAAE,WAAW;AACb,WAAS,KAAK,YAAY,CAAC;AAC3B,IAAE,MAAK;AACP,WAAS,KAAK,YAAY,CAAC;AAC3B,MAAI,gBAAgB,GAAG;AACzB;AAOY,MAAC,gBAAgB,CAAC,SAAS;AACrC,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,UAAM,SAAS,IAAI,WAAU;AAC7B,WAAO,SAAS,MAAM,QAAQ,OAAO,MAAM;AAC3C,WAAO,UAAU;AACjB,WAAO,cAAc,IAAI;AAAA,EAC3B,CAAC;AACH;AAQY,MAAC,oBAAoB,CAAC,MAAM,UAAU,IAAI,OAAO,SAAS;AACpE,QAAM,eAAe,CAAC,cAAc,aAAa,aAAa,cAAc,eAAe;AAE3F,MAAI,CAAC,aAAa,SAAS,KAAK,IAAI,GAAG;AACrC,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACb;AAAA,EACE;AAEA,MAAI,KAAK,OAAO,SAAS;AACvB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO,+BAA+B,KAAK,MAAM,UAAU,OAAO,IAAI,CAAC;AAAA,IAC7E;AAAA,EACE;AAEA,SAAO,EAAE,SAAS,KAAI;AACxB;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]}
\ No newline at end of file
diff --git a/dist/qr-code-utils.iife.js b/dist/qr-code-utils.iife.js
new file mode 100644
index 0000000..8dc7258
--- /dev/null
+++ b/dist/qr-code-utils.iife.js
@@ -0,0 +1,2 @@
+var QRCodeUtils=function(t){"use strict";var e={},n={},r={};let o;const i=[0,26,44,70,100,134,172,196,242,292,346,404,466,532,581,655,733,815,901,991,1085,1156,1258,1364,1474,1588,1706,1828,1921,2051,2185,2323,2465,2611,2761,2876,3034,3196,3362,3532,3706];r.getSymbolSize=function(t){if(!t)throw new Error('"version" cannot be null or undefined');if(t<1||t>40)throw new Error('"version" should be in range from 1 to 40');return 4*t+17},r.getSymbolTotalCodewords=function(t){return i[t]},r.getBCHDigit=function(t){let e=0;for(;0!==t;)e++,t>>>=1;return e},r.setToSJISFunction=function(t){if("function"!=typeof t)throw new Error('"toSJISFunc" is not a valid function.');o=t},r.isKanjiModeEnabled=function(){return void 0!==o},r.toSJIS=function(t){return o(t)};var a,s={};function c(){this.buffer=[],this.length=0}(a=s).L={bit:1},a.M={bit:0},a.Q={bit:3},a.H={bit:2},a.isValid=function(t){return t&&void 0!==t.bit&&t.bit>=0&&t.bit<4},a.from=function(t,e){if(a.isValid(t))return t;try{return function(t){if("string"!=typeof t)throw new Error("Param is not a string");switch(t.toLowerCase()){case"l":case"low":return a.L;case"m":case"medium":return a.M;case"q":case"quartile":return a.Q;case"h":case"high":return a.H;default:throw new Error("Unknown EC Level: "+t)}}(t)}catch(n){return e}},c.prototype={get:function(t){const e=Math.floor(t/8);return 1==(this.buffer[e]>>>7-t%8&1)},put:function(t,e){for(let n=0;n>>e-n-1&1))},getLengthInBits:function(){return this.length},putBit:function(t){const e=Math.floor(this.length/8);this.buffer.length<=e&&this.buffer.push(0),t&&(this.buffer[e]|=128>>>this.length%8),this.length++}};var u=c;function l(t){if(!t||t<1)throw new Error("BitMatrix size must be defined and greater than 0");this.size=t,this.data=new Uint8Array(t*t),this.reservedBit=new Uint8Array(t*t)}l.prototype.set=function(t,e,n,r){const o=t*this.size+e;this.data[o]=n,r&&(this.reservedBit[o]=!0)},l.prototype.get=function(t,e){return this.data[t*this.size+e]},l.prototype.xor=function(t,e,n){this.data[t*this.size+e]^=n},l.prototype.isReserved=function(t,e){return this.reservedBit[t*this.size+e]};var d=l,g={};!function(t){const e=r.getSymbolSize;t.getRowColCoords=function(t){if(1===t)return[];const n=Math.floor(t/7)+2,r=e(t),o=145===r?26:2*Math.ceil((r-13)/(2*n-2)),i=[r-7];for(let e=1;e=0&&t<=7},t.from=function(e){return t.isValid(e)?parseInt(e,10):void 0},t.getPenaltyN1=function(t){const n=t.size;let r=0,o=0,i=0,a=null,s=null;for(let c=0;c=5&&(r+=e+(o-5)),a=n,o=1),n=t.get(u,c),n===s?i++:(i>=5&&(r+=e+(i-5)),s=n,i=1)}o>=5&&(r+=e+(o-5)),i>=5&&(r+=e+(i-5))}return r},t.getPenaltyN2=function(t){const e=t.size;let r=0;for(let n=0;n=10&&(1488===o||93===o)&&n++,i=i<<1&2047|t.get(a,r),a>=10&&(1488===i||93===i)&&n++}return n*r},t.getPenaltyN4=function(t){let e=0;const n=t.data.length;for(let r=0;r=0;){const t=r[0];for(let i=0;i0){const t=new Uint8Array(this.degree);return t.set(n,r),t}return n};var M=B,P={},R={},T={isValid:function(t){return!isNaN(t)&&t>=1&&t<=40}},N={};const F="[0-9]+";let S="(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";S=S.replace(/u/g,"\\u");const x="(?:(?![A-Z0-9 $%*+\\-./:]|"+S+")(?:.|[\r\n]))+";N.KANJI=new RegExp(S,"g"),N.BYTE_KANJI=new RegExp("[^A-Z0-9 $%*+\\-./:]+","g"),N.BYTE=new RegExp(x,"g"),N.NUMERIC=new RegExp(F,"g"),N.ALPHANUMERIC=new RegExp("[A-Z $%*+\\-./:]+","g");const L=new RegExp("^"+S+"$"),U=new RegExp("^"+F+"$"),z=new RegExp("^[A-Z0-9 $%*+\\-./:]+$");N.testKanji=function(t){return L.test(t)},N.testNumeric=function(t){return U.test(t)},N.testAlphanumeric=function(t){return z.test(t)},function(t){const e=T,n=N;t.NUMERIC={id:"Numeric",bit:1,ccBits:[10,12,14]},t.ALPHANUMERIC={id:"Alphanumeric",bit:2,ccBits:[9,11,13]},t.BYTE={id:"Byte",bit:4,ccBits:[8,16,16]},t.KANJI={id:"Kanji",bit:8,ccBits:[8,10,12]},t.MIXED={bit:-1},t.getCharCountIndicator=function(t,n){if(!t.ccBits)throw new Error("Invalid mode: "+t);if(!e.isValid(n))throw new Error("Invalid version: "+n);return n>=1&&n<10?t.ccBits[0]:n<27?t.ccBits[1]:t.ccBits[2]},t.getBestModeForData=function(e){return n.testNumeric(e)?t.NUMERIC:n.testAlphanumeric(e)?t.ALPHANUMERIC:n.testKanji(e)?t.KANJI:t.BYTE},t.toString=function(t){if(t&&t.id)return t.id;throw new Error("Invalid mode")},t.isValid=function(t){return t&&t.bit&&t.ccBits},t.from=function(e,n){if(t.isValid(e))return e;try{return function(e){if("string"!=typeof e)throw new Error("Param is not a string");switch(e.toLowerCase()){case"numeric":return t.NUMERIC;case"alphanumeric":return t.ALPHANUMERIC;case"kanji":return t.KANJI;case"byte":return t.BYTE;default:throw new Error("Unknown mode: "+e)}}(e)}catch(r){return n}}}(R),function(t){const e=r,n=p,o=s,i=R,a=T,c=e.getBCHDigit(7973);function u(t,e){return i.getCharCountIndicator(t,e)+4}function l(t,e){let n=0;return t.forEach(function(t){const r=u(t.mode,e);n+=r+t.getBitsLength()}),n}t.from=function(t,e){return a.isValid(t)?parseInt(t,10):e},t.getCapacity=function(t,r,o){if(!a.isValid(t))throw new Error("Invalid QR Code version");void 0===o&&(o=i.BYTE);const s=8*(e.getSymbolTotalCodewords(t)-n.getTotalCodewordsCount(t,r));if(o===i.MIXED)return s;const c=s-u(o,t);switch(o){case i.NUMERIC:return Math.floor(c/10*3);case i.ALPHANUMERIC:return Math.floor(c/11*2);case i.KANJI:return Math.floor(c/13);case i.BYTE:default:return Math.floor(c/8)}},t.getBestVersionForData=function(e,n){let r;const a=o.from(n,o.M);if(Array.isArray(e)){if(e.length>1)return function(e,n){for(let r=1;r<=40;r++)if(l(e,r)<=t.getCapacity(r,n,i.MIXED))return r}(e,a);if(0===e.length)return 1;r=e[0]}else r=e;return function(e,n,r){for(let o=1;o<=40;o++)if(n<=t.getCapacity(o,r,e))return o}(r.mode,r.getLength(),a)},t.getEncodedBits=function(t){if(!a.isValid(t)||t<7)throw new Error("Invalid QR Code version");let n=t<<12;for(;e.getBCHDigit(n)-c>=0;)n^=7973<=0;)r^=1335<0&&(n=this.data.substr(e),r=parseInt(n,10),t.put(r,3*o+1))};var Y=K;const _=R,Q=["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 j(t){this.mode=_.ALPHANUMERIC,this.data=t}j.getBitsLength=function(t){return 11*Math.floor(t/2)+t%2*6},j.prototype.getLength=function(){return this.data.length},j.prototype.getBitsLength=function(){return j.getBitsLength(this.data.length)},j.prototype.write=function(t){let e;for(e=0;e+2<=this.data.length;e+=2){let n=45*Q.indexOf(this.data[e]);n+=Q.indexOf(this.data[e+1]),t.put(n,11)}this.data.length%2&&t.put(Q.indexOf(this.data[e]),6)};var G=j;const O=R;function $(t){this.mode=O.BYTE,this.data="string"==typeof t?(new TextEncoder).encode(t):new Uint8Array(t)}$.getBitsLength=function(t){return 8*t},$.prototype.getLength=function(){return this.data.length},$.prototype.getBitsLength=function(){return $.getBitsLength(this.data.length)},$.prototype.write=function(t){for(let e=0,n=this.data.length;e=33088&&n<=40956)n-=33088;else{if(!(n>=57408&&n<=60351))throw new Error("Invalid SJIS character: "+this.data[e]+"\nMake sure your charset is UTF-8");n-=49472}n=192*(n>>>8&255)+(255&n),t.put(n,13)}};var tt,et=Z,nt={exports:{}};nt.exports=tt={single_source_shortest_paths:function(t,e,n){var r={},o={};o[e]=0;var i,a,s,c,u,l,d,g=tt.PriorityQueue.make();for(g.push(e,0);!g.empty();)for(s in a=(i=g.pop()).value,c=i.cost,u=t[a]||{})u.hasOwnProperty(s)&&(l=c+u[s],d=o[s],(void 0===o[s]||d>l)&&(o[s]=l,g.push(s,l),r[s]=a));if(void 0!==n&&void 0===o[n]){var h=["Could not find a path from ",e," to ",n,"."].join("");throw new Error(h)}return r},extract_shortest_path_from_predecessor_list:function(t,e){for(var n=[],r=e;r;)n.push(r),t[r],r=t[r];return n.reverse(),n},find_path:function(t,e,n){var r=tt.single_source_shortest_paths(t,e,n);return tt.extract_shortest_path_from_predecessor_list(r,n)},PriorityQueue:{make:function(t){var e,n=tt.PriorityQueue,r={};for(e in t=t||{},n)n.hasOwnProperty(e)&&(r[e]=n[e]);return r.queue=[],r.sorter=t.sorter||n.default_sorter,r},default_sorter:function(t,e){return t.cost-e.cost},push:function(t,e){var n={value:t,cost:e};this.queue.push(n),this.queue.sort(this.sorter)},pop:function(){return this.queue.shift()},empty:function(){return 0===this.queue.length}}};var rt=nt.exports;!function(t){const e=R,n=Y,o=G,i=q,a=et,s=N,c=r,u=rt;function l(t){return unescape(encodeURIComponent(t)).length}function d(t,e,n){const r=[];let o;for(;null!==(o=t.exec(n));)r.push({data:o[0],index:o.index,mode:e,length:o[0].length});return r}function g(t){const n=d(s.NUMERIC,e.NUMERIC,t),r=d(s.ALPHANUMERIC,e.ALPHANUMERIC,t);let o,i;c.isKanjiModeEnabled()?(o=d(s.BYTE,e.BYTE,t),i=d(s.KANJI,e.KANJI,t)):(o=d(s.BYTE_KANJI,e.BYTE,t),i=[]);return n.concat(r,o,i).sort(function(t,e){return t.index-e.index}).map(function(t){return{data:t.data,mode:t.mode,length:t.length}})}function h(t,r){switch(r){case e.NUMERIC:return n.getBitsLength(t);case e.ALPHANUMERIC:return o.getBitsLength(t);case e.KANJI:return a.getBitsLength(t);case e.BYTE:return i.getBitsLength(t)}}function f(t,r){let s;const u=e.getBestModeForData(t);if(s=e.from(r,u),s!==e.BYTE&&s.bit=0?t[t.length-1]:null;return n&&n.mode===e.mode?(t[t.length-1].data+=e.data,t):(t.push(e),t)},[])}(s))},t.rawSplit=function(e){return t.fromArray(g(e,c.isKanjiModeEnabled()))}}(H);const ot=r,it=s,at=u,st=d,ct=g,ut=h,lt=m,dt=p,gt=M,ht=P,ft=k,mt=R,pt=H;function wt(t,e,n){const r=t.size,o=ft.getEncodedBits(e,n);let i,a;for(i=0;i<15;i++)a=1==(o>>i&1),i<6?t.set(i,8,a,!0):i<8?t.set(i+1,8,a,!0):t.set(r-15+i,8,a,!0),i<8?t.set(8,r-i-1,a,!0):i<9?t.set(8,15-i-1+1,a,!0):t.set(8,15-i-1,a,!0);t.set(r-8,8,1,!0)}function Et(t,e,n){const r=new at;n.forEach(function(e){r.put(e.mode.bit,4),r.put(e.getLength(),mt.getCharCountIndicator(e.mode,t)),e.write(r)});const o=8*(ot.getSymbolTotalCodewords(t)-dt.getTotalCodewordsCount(t,e));for(r.getLengthInBits()+4<=o&&r.put(0,4);r.getLengthInBits()%8!=0;)r.putBit(0);const i=(o-r.getLengthInBits())/8;for(let a=0;a=0&&r<=6&&(0===o||6===o)||o>=0&&o<=6&&(0===r||6===r)||r>=2&&r<=4&&o>=2&&o<=4?t.set(e+r,i+o,!0,!0):t.set(e+r,i+o,!1,!0))}}(c,e),function(t){const e=t.size;for(let n=8;n=7&&function(t,e){const n=t.size,r=ht.getEncodedBits(e);let o,i,a;for(let s=0;s<18;s++)o=Math.floor(s/3),i=s%3+n-8-3,a=1==(r>>s&1),t.set(o,i,a,!0),t.set(i,o,a,!0)}(c,e),function(t,e){const n=t.size;let r=-1,o=n-1,i=7,a=0;for(let s=n-1;s>0;s-=2)for(6===s&&s--;;){for(let n=0;n<2;n++)if(!t.isReserved(o,s-n)){let r=!1;a>>i&1)),t.set(o,s-n,r),i--,-1===i&&(a++,i=7)}if(o+=r,o<0||n<=o){o-=r,r=-r;break}}}(c,a),isNaN(r)&&(r=lt.getBestMask(c,wt.bind(null,c,n))),lt.applyMask(r,c),wt(c,n,r),{modules:c,version:e,errorCorrectionLevel:n,maskPattern:r,segments:o}}n.create=function(t,e){if(void 0===t||""===t)throw new Error("No input text");let n,r,o=it.M;return void 0!==e&&(o=it.from(e.errorCorrectionLevel,it.M),n=ht.from(e.version),r=lt.from(e.maskPattern),e.toSJISFunc&&ot.setToSJISFunction(e.toSJISFunc)),yt(t,n,o,r)};var vt={},At={};!function(t){function e(t){if("number"==typeof t&&(t=t.toString()),"string"!=typeof t)throw new Error("Color should be defined as hex string");let e=t.slice().replace("#","").split("");if(e.length<3||5===e.length||e.length>8)throw new Error("Invalid hex color: "+t);3!==e.length&&4!==e.length||(e=Array.prototype.concat.apply([],e.map(function(t){return[t,t]}))),6===e.length&&e.push("F","F");const n=parseInt(e.join(""),16);return{r:n>>24&255,g:n>>16&255,b:n>>8&255,a:255&n,hex:"#"+e.slice(0,6).join("")}}t.getOptions=function(t){t||(t={}),t.color||(t.color={});const n=void 0===t.margin||null===t.margin||t.margin<0?4:t.margin,r=t.width&&t.width>=21?t.width:void 0,o=t.scale||4;return{width:r,scale:r?4:o,margin:n,color:{dark:e(t.color.dark||"#000000ff"),light:e(t.color.light||"#ffffffff")},type:t.type,rendererOpts:t.rendererOpts||{}}},t.getScale=function(t,e){return e.width&&e.width>=t+2*e.margin?e.width/(t+2*e.margin):e.scale},t.getImageWidth=function(e,n){const r=t.getScale(e,n);return Math.floor((e+2*n.margin)*r)},t.qrToImageData=function(e,n,r){const o=n.modules.size,i=n.modules.data,a=t.getScale(o,r),s=Math.floor((o+2*r.margin)*a),c=r.margin*a,u=[r.color.light,r.color.dark];for(let t=0;t=c&&n>=c&&t':"",c="0&&c>0&&t[s-1]||(r+=i?Bt("M",c+n,.5+u+n):Bt("m",o,0),o=0,i=!1),c+1',u='viewBox="0 0 '+a+" "+a+'"',l='\n";return"function"==typeof n&&n(null,l),l};const Mt=function(){return"function"==typeof Promise&&Promise.prototype&&Promise.prototype.then},Pt=n,Rt=vt,Tt=Ct;function Nt(t,e,n,r,o){const i=[].slice.call(arguments,1),a=i.length,s="function"==typeof i[a-1];if(!s&&!Mt())throw new Error("Callback required as last argument");if(!s){if(a<1)throw new Error("Too few arguments provided");return 1===a?(n=e,e=r=void 0):2!==a||e.getContext||(r=n,n=e,e=void 0),new Promise(function(o,i){try{const i=Pt.create(n,r);o(t(i,e,r))}catch(a){i(a)}})}if(a<2)throw new Error("Too few arguments provided");2===a?(o=n,n=e,e=r=void 0):3===a&&(e.getContext&&void 0===o?(o=r,r=void 0):(o=r,r=n,n=e,e=void 0));try{const i=Pt.create(n,r);o(null,t(i,e,r))}catch(c){o(c)}}e.create=Pt.create,e.toCanvas=Nt.bind(null,Rt.render),e.toDataURL=Nt.bind(null,Rt.renderToDataURL),e.toString=Nt.bind(null,function(t,e,n){return Tt.render(t,n)});const Ft=async(t,n="#000000",r="#FFFFFF")=>{try{return await e.toString(t,{type:"svg",width:512,margin:2,errorCorrectionLevel:"H",color:{dark:n,light:r}})}catch(o){return console.error("Error generating SVG QR code:",o),null}},St=(t,e,n,r,o)=>new Promise(i=>{const a=document.createElement("canvas"),s=a.getContext("2d");a.width=t.width,a.height=t.height,s.drawImage(t,0,0);const c=s.getImageData(0,0,a.width,a.height),u=o.createElementNS("http://www.w3.org/2000/svg","g"),l=e/Math.max(t.width,t.height);u.setAttribute("transform",`translate(${n.toFixed(2)}, ${r.toFixed(2)}) scale(${l.toFixed(4)})`);const d=Math.max(1,Math.floor(Math.min(t.width,t.height)/32)),g=c.data;for(let e=0;e128&&(i>0||a>0||s>0)){const t=o.createElementNS("http://www.w3.org/2000/svg","rect");t.setAttribute("x",n.toFixed(2)),t.setAttribute("y",e.toFixed(2)),t.setAttribute("width",d.toFixed(2)),t.setAttribute("height",d.toFixed(2)),t.setAttribute("fill",`rgb(${i}, ${a}, ${s})`),u.appendChild(t)}}i(u)}),xt=async(t,e,n=20)=>new Promise(r=>{const o=new Image;o.onload=()=>{const i=(new DOMParser).parseFromString(t,"image/svg+xml"),a=i.documentElement,s=n/100*33,c=s+4,u=(33-c)/2,l=(33-c)/2,d=u+2,g=l+2,h=i.createElementNS("http://www.w3.org/2000/svg","rect");if(h.setAttribute("x",u.toFixed(2)),h.setAttribute("y",l.toFixed(2)),h.setAttribute("width",c.toFixed(2)),h.setAttribute("height",c.toFixed(2)),h.setAttribute("fill","#FFFFFF"),a.appendChild(h),e.startsWith("data:image/svg+xml")){console.log("Processing SVG image");const t=i.createElementNS("http://www.w3.org/2000/svg","image");t.setAttribute("x",d.toFixed(2)),t.setAttribute("y",g.toFixed(2)),t.setAttribute("width",s.toFixed(2)),t.setAttribute("height",s.toFixed(2)),t.setAttribute("href",e),a.appendChild(t),console.log("SVG image element added");const n=new XMLSerializer;r(n.serializeToString(a))}else console.log("Processing bitmap image"),St(o,s,d,g,i).then(t=>{a.appendChild(t),console.log("Vectorized image group added");const e=new XMLSerializer;r(e.serializeToString(a))}).catch(t=>{console.error("Vectorization failed:",t);const e=new XMLSerializer;r(e.serializeToString(a))})},o.onerror=()=>{console.error("Error loading image for SVG"),r(t)},o.src=e});return t.addImageToQRCode=async(t,e,n=20)=>new Promise(r=>{const o=document.createElement("canvas"),i=o.getContext("2d");o.width=512,o.height=512;const a=new Image,s=new Image;a.onload=()=>{i.drawImage(a,0,0,512,512),s.onload=()=>{const t=n/100*512,e=t+32,a=(512-e)/2,c=(512-e)/2;i.fillStyle="#FFFFFF",i.fillRect(a,c,e,e);const u=a+16,l=c+16;i.drawImage(s,u,l,t,t),r(o.toDataURL("image/png"))},s.onerror=()=>{console.error("Error loading custom image"),r(t)},s.src=e},a.onerror=()=>{console.error("Error loading QR code"),r(t)},a.src=t}),t.addImageToSVG=xt,t.downloadSVG=(t,e="qrcode.svg")=>{if(!t)return void console.error("No SVG content to download");const n=new Blob([t],{type:"image/svg+xml"}),r=URL.createObjectURL(n),o=document.createElement("a");o.href=r,o.download=e,document.body.appendChild(o),o.click(),document.body.removeChild(o),URL.revokeObjectURL(r)},t.fileToDataURL=t=>new Promise((e,n)=>{const r=new FileReader;r.onload=()=>e(r.result),r.onerror=n,r.readAsDataURL(t)}),t.generateCompleteSVGQRCode=async(t,e=null,n=20,r="#000000",o="#FFFFFF")=>{try{const i=await Ft(t,r,o);if(!i)return null;if(e){console.log("Adding custom image to SVG...");const t=await xt(i,e,n);return console.log("SVG with image generated"),t}return i}catch(i){return console.error("Error generating complete SVG QR code:",i),null}},t.generateQRCode=async(t,n="#000000",r="#FFFFFF")=>{try{return await e.toDataURL(t,{color:{dark:n,light:r},width:512,margin:2,errorCorrectionLevel:"H"})}catch(o){return console.error("Error generating QR code:",o),null}},t.generateSVGQRCode=Ft,t.validateImageFile=(t,e=2097152)=>["image/jpeg","image/png","image/gif","image/webp","image/svg+xml"].includes(t.type)?t.size>e?{success:!1,error:`File size must be less than ${Math.round(e/1024/1024)}MB`}:{success:!0}:{success:!1,error:"Please select a valid image file (JPEG, PNG, GIF, WebP, or SVG)"},t.vectorizeBitmap=St,Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),t}({});
+//# sourceMappingURL=qr-code-utils.iife.js.map
diff --git a/dist/qr-code-utils.iife.js.map b/dist/qr-code-utils.iife.js.map
new file mode 100644
index 0000000..2253c85
--- /dev/null
+++ b/dist/qr-code-utils.iife.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"qr-code-utils.iife.js","sources":["../node_modules/qrcode/lib/core/utils.js","../node_modules/qrcode/lib/core/bit-buffer.js","../node_modules/qrcode/lib/core/error-correction-level.js","../node_modules/qrcode/lib/core/bit-matrix.js","../node_modules/qrcode/lib/core/alignment-pattern.js","../node_modules/qrcode/lib/core/finder-pattern.js","../node_modules/qrcode/lib/core/mask-pattern.js","../node_modules/qrcode/lib/core/error-correction-code.js","../node_modules/qrcode/lib/core/galois-field.js","../node_modules/qrcode/lib/core/polynomial.js","../node_modules/qrcode/lib/core/reed-solomon-encoder.js","../node_modules/qrcode/lib/core/version-check.js","../node_modules/qrcode/lib/core/regex.js","../node_modules/qrcode/lib/core/mode.js","../node_modules/qrcode/lib/core/version.js","../node_modules/qrcode/lib/core/format-info.js","../node_modules/qrcode/lib/core/numeric-data.js","../node_modules/qrcode/lib/core/alphanumeric-data.js","../node_modules/qrcode/lib/core/byte-data.js","../node_modules/qrcode/lib/core/kanji-data.js","../node_modules/dijkstrajs/dijkstra.js","../node_modules/qrcode/lib/core/segments.js","../node_modules/qrcode/lib/core/qrcode.js","../node_modules/qrcode/lib/renderer/utils.js","../node_modules/qrcode/lib/renderer/canvas.js","../node_modules/qrcode/lib/renderer/svg-tag.js","../node_modules/qrcode/lib/browser.js","../node_modules/qrcode/lib/can-promise.js","../src/utils/qrCodeUtils.js"],"sourcesContent":["let toSJISFunction\nconst CODEWORDS_COUNT = [\n 0, // Not used\n 26, 44, 70, 100, 134, 172, 196, 242, 292, 346,\n 404, 466, 532, 581, 655, 733, 815, 901, 991, 1085,\n 1156, 1258, 1364, 1474, 1588, 1706, 1828, 1921, 2051, 2185,\n 2323, 2465, 2611, 2761, 2876, 3034, 3196, 3362, 3532, 3706\n]\n\n/**\n * Returns the QR Code size for the specified version\n *\n * @param {Number} version QR Code version\n * @return {Number} size of QR code\n */\nexports.getSymbolSize = function getSymbolSize (version) {\n if (!version) throw new Error('\"version\" cannot be null or undefined')\n if (version < 1 || version > 40) throw new Error('\"version\" should be in range from 1 to 40')\n return version * 4 + 17\n}\n\n/**\n * Returns the total number of codewords used to store data and EC information.\n *\n * @param {Number} version QR Code version\n * @return {Number} Data length in bits\n */\nexports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {\n return CODEWORDS_COUNT[version]\n}\n\n/**\n * Encode data with Bose-Chaudhuri-Hocquenghem\n *\n * @param {Number} data Value to encode\n * @return {Number} Encoded value\n */\nexports.getBCHDigit = function (data) {\n let digit = 0\n\n while (data !== 0) {\n digit++\n data >>>= 1\n }\n\n return digit\n}\n\nexports.setToSJISFunction = function setToSJISFunction (f) {\n if (typeof f !== 'function') {\n throw new Error('\"toSJISFunc\" is not a valid function.')\n }\n\n toSJISFunction = f\n}\n\nexports.isKanjiModeEnabled = function () {\n return typeof toSJISFunction !== 'undefined'\n}\n\nexports.toSJIS = function toSJIS (kanji) {\n return toSJISFunction(kanji)\n}\n","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","exports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n const lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'l':\n case 'low':\n return exports.L\n\n case 'm':\n case 'medium':\n return exports.M\n\n case 'q':\n case 'quartile':\n return exports.Q\n\n case 'h':\n case 'high':\n return exports.H\n\n default:\n throw new Error('Unknown EC Level: ' + string)\n }\n}\n\nexports.isValid = function isValid (level) {\n return level && typeof level.bit !== 'undefined' &&\n level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n","/**\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","/**\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","const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n const size = getSymbolSize(version)\n\n return [\n // top-left\n [0, 0],\n // top-right\n [size - FINDER_PATTERN_SIZE, 0],\n // bottom-left\n [0, size - FINDER_PATTERN_SIZE]\n ]\n}\n","/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n PATTERN000: 0,\n PATTERN001: 1,\n PATTERN010: 2,\n PATTERN011: 3,\n PATTERN100: 4,\n PATTERN101: 5,\n PATTERN110: 6,\n PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n N1: 3,\n N2: 3,\n N3: 40,\n N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param {Number} mask Mask pattern\n * @return {Boolean} true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param {Number|String} value Mask pattern value\n * @return {Number} Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n const size = data.size\n let points = 0\n let sameCountCol = 0\n let sameCountRow = 0\n let lastCol = null\n let lastRow = null\n\n for (let row = 0; row < size; row++) {\n sameCountCol = sameCountRow = 0\n lastCol = lastRow = null\n\n for (let col = 0; col < size; col++) {\n let module = data.get(row, col)\n if (module === lastCol) {\n sameCountCol++\n } else {\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n lastCol = module\n sameCountCol = 1\n }\n\n module = data.get(col, row)\n if (module === lastRow) {\n sameCountRow++\n } else {\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n lastRow = module\n sameCountRow = 1\n }\n }\n\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n }\n\n return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n const size = data.size\n let points = 0\n\n for (let row = 0; row < size - 1; row++) {\n for (let col = 0; col < size - 1; col++) {\n const last = data.get(row, col) +\n data.get(row, col + 1) +\n data.get(row + 1, col) +\n data.get(row + 1, col + 1)\n\n if (last === 4 || last === 0) points++\n }\n }\n\n return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n const size = data.size\n let points = 0\n let bitsCol = 0\n let bitsRow = 0\n\n for (let row = 0; row < size; row++) {\n bitsCol = bitsRow = 0\n for (let col = 0; col < size; col++) {\n bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n }\n }\n\n return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n let darkCount = 0\n const modulesCount = data.data.length\n\n for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param {Number} maskPattern Pattern reference value\n * @param {Number} i Row\n * @param {Number} j Column\n * @return {Boolean} Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n switch (maskPattern) {\n case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n case exports.Patterns.PATTERN001: return i % 2 === 0\n case exports.Patterns.PATTERN010: return j % 3 === 0\n case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n default: throw new Error('bad maskPattern:' + maskPattern)\n }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param {Number} pattern Pattern reference number\n * @param {BitMatrix} data BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n const size = data.size\n\n for (let col = 0; col < size; col++) {\n for (let row = 0; row < size; row++) {\n if (data.isReserved(row, col)) continue\n data.xor(row, col, getMaskAt(pattern, row, col))\n }\n }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n const numPatterns = Object.keys(exports.Patterns).length\n let bestPattern = 0\n let lowerPenalty = Infinity\n\n for (let p = 0; p < numPatterns; p++) {\n setupFormatFunc(p)\n exports.applyMask(p, data)\n\n // Calculate penalty\n const penalty =\n exports.getPenaltyN1(data) +\n exports.getPenaltyN2(data) +\n exports.getPenaltyN3(data) +\n exports.getPenaltyN4(data)\n\n // Undo previously applied mask\n exports.applyMask(p, data)\n\n if (penalty < lowerPenalty) {\n lowerPenalty = penalty\n bestPattern = p\n }\n }\n\n return bestPattern\n}\n","const ECLevel = require('./error-correction-level')\r\n\r\nconst EC_BLOCKS_TABLE = [\r\n// L M Q H\r\n 1, 1, 1, 1,\r\n 1, 1, 1, 1,\r\n 1, 1, 2, 2,\r\n 1, 2, 2, 4,\r\n 1, 2, 4, 4,\r\n 2, 4, 4, 4,\r\n 2, 4, 6, 5,\r\n 2, 4, 6, 6,\r\n 2, 5, 8, 8,\r\n 4, 5, 8, 8,\r\n 4, 5, 8, 11,\r\n 4, 8, 10, 11,\r\n 4, 9, 12, 16,\r\n 4, 9, 16, 16,\r\n 6, 10, 12, 18,\r\n 6, 10, 17, 16,\r\n 6, 11, 16, 19,\r\n 6, 13, 18, 21,\r\n 7, 14, 21, 25,\r\n 8, 16, 20, 25,\r\n 8, 17, 23, 25,\r\n 9, 17, 23, 34,\r\n 9, 18, 25, 30,\r\n 10, 20, 27, 32,\r\n 12, 21, 29, 35,\r\n 12, 23, 34, 37,\r\n 12, 25, 34, 40,\r\n 13, 26, 35, 42,\r\n 14, 28, 38, 45,\r\n 15, 29, 40, 48,\r\n 16, 31, 43, 51,\r\n 17, 33, 45, 54,\r\n 18, 35, 48, 57,\r\n 19, 37, 51, 60,\r\n 19, 38, 53, 63,\r\n 20, 40, 56, 66,\r\n 21, 43, 59, 70,\r\n 22, 45, 62, 74,\r\n 24, 47, 65, 77,\r\n 25, 49, 68, 81\r\n]\r\n\r\nconst EC_CODEWORDS_TABLE = [\r\n// L M Q H\r\n 7, 10, 13, 17,\r\n 10, 16, 22, 28,\r\n 15, 26, 36, 44,\r\n 20, 36, 52, 64,\r\n 26, 48, 72, 88,\r\n 36, 64, 96, 112,\r\n 40, 72, 108, 130,\r\n 48, 88, 132, 156,\r\n 60, 110, 160, 192,\r\n 72, 130, 192, 224,\r\n 80, 150, 224, 264,\r\n 96, 176, 260, 308,\r\n 104, 198, 288, 352,\r\n 120, 216, 320, 384,\r\n 132, 240, 360, 432,\r\n 144, 280, 408, 480,\r\n 168, 308, 448, 532,\r\n 180, 338, 504, 588,\r\n 196, 364, 546, 650,\r\n 224, 416, 600, 700,\r\n 224, 442, 644, 750,\r\n 252, 476, 690, 816,\r\n 270, 504, 750, 900,\r\n 300, 560, 810, 960,\r\n 312, 588, 870, 1050,\r\n 336, 644, 952, 1110,\r\n 360, 700, 1020, 1200,\r\n 390, 728, 1050, 1260,\r\n 420, 784, 1140, 1350,\r\n 450, 812, 1200, 1440,\r\n 480, 868, 1290, 1530,\r\n 510, 924, 1350, 1620,\r\n 540, 980, 1440, 1710,\r\n 570, 1036, 1530, 1800,\r\n 570, 1064, 1590, 1890,\r\n 600, 1120, 1680, 1980,\r\n 630, 1204, 1770, 2100,\r\n 660, 1260, 1860, 2220,\r\n 720, 1316, 1950, 2310,\r\n 750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n","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","const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param {Uint8Array} p1 Polynomial\n * @param {Uint8Array} p2 Polynomial\n * @return {Uint8Array} Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n for (let i = 0; i < p1.length; i++) {\n for (let j = 0; j < p2.length; j++) {\n coeff[i + j] ^= GF.mul(p1[i], p2[j])\n }\n }\n\n return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param {Uint8Array} divident Polynomial\n * @param {Uint8Array} divisor Polynomial\n * @return {Uint8Array} Remainder\n */\nexports.mod = function mod (divident, divisor) {\n let result = new Uint8Array(divident)\n\n while ((result.length - divisor.length) >= 0) {\n const coeff = result[0]\n\n for (let i = 0; i < divisor.length; i++) {\n result[i] ^= GF.mul(divisor[i], coeff)\n }\n\n // remove all zeros from buffer head\n let offset = 0\n while (offset < result.length && result[offset] === 0) offset++\n result = result.slice(offset)\n }\n\n return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param {Number} degree Degree of the generator polynomial\n * @return {Uint8Array} Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n let poly = new Uint8Array([1])\n for (let i = 0; i < degree; i++) {\n poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n }\n\n return poly\n}\n","const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n this.genPoly = undefined\n this.degree = degree\n\n if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n // create an irreducible generator polynomial\n this.degree = degree\n this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param {Uint8Array} data Buffer containing input data\n * @return {Uint8Array} Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n if (!this.genPoly) {\n throw new Error('Encoder not initialized')\n }\n\n // Calculate EC for this data block\n // extends data size to data+genPoly size\n const paddedData = new Uint8Array(data.length + this.degree)\n paddedData.set(data)\n\n // The error correction codewords are the remainder after dividing the data codewords\n // by a generator polynomial\n const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n // return EC data blocks (last n byte, where n is the degree of genPoly)\n // If coefficients number in remainder are less than genPoly degree,\n // pad with 0s to the left to reach the needed number of coefficients\n const start = this.degree - remainder.length\n if (start > 0) {\n const buff = new Uint8Array(this.degree)\n buff.set(remainder, start)\n\n return buff\n }\n\n return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n","/**\n * Check if QR Code version is valid\n *\n * @param {Number} version QR Code version\n * @return {Boolean} true if valid version, false otherwise\n */\nexports.isValid = function isValid (version) {\n return !isNaN(version) && version >= 1 && version <= 40\n}\n","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","const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n id: 'Numeric',\n bit: 1 << 0,\n ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n * 26 alphabetic characters (A - Z),\n * and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n id: 'Alphanumeric',\n bit: 1 << 1,\n ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n id: 'Byte',\n bit: 1 << 2,\n ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n id: 'Kanji',\n bit: 1 << 3,\n ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param {Mode} mode Data mode\n * @param {Number} version QR Code version\n * @return {Number} Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n if (!VersionCheck.isValid(version)) {\n throw new Error('Invalid version: ' + version)\n }\n\n if (version >= 1 && version < 10) return mode.ccBits[0]\n else if (version < 27) return mode.ccBits[1]\n return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param {String} dataStr Input data string\n * @return {Mode} Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n else if (Regex.testKanji(dataStr)) return exports.KANJI\n else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String} Mode name\n */\nexports.toString = function toString (mode) {\n if (mode && mode.id) return mode.id\n throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param {Mode} mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param {String} string Mode name\n * @returns {Mode} Mode object\n */\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n const lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'numeric':\n return exports.NUMERIC\n case 'alphanumeric':\n return exports.ALPHANUMERIC\n case 'kanji':\n return exports.KANJI\n case 'byte':\n return exports.BYTE\n default:\n throw new Error('Unknown mode: ' + string)\n }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param {Mode|String} value Encoding mode\n * @param {Mode} defaultValue Fallback value\n * @return {Mode} Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n","const Utils = require('./utils')\nconst ECCode = require('./error-correction-code')\nconst ECLevel = require('./error-correction-level')\nconst Mode = require('./mode')\nconst VersionCheck = require('./version-check')\n\n// Generator polynomial used to encode version information\nconst G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0)\nconst G18_BCH = Utils.getBCHDigit(G18)\n\nfunction getBestVersionForDataLength (mode, length, errorCorrectionLevel) {\n for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\nfunction getReservedBitsCount (mode, version) {\n // Character count indicator + mode indicator bits\n return Mode.getCharCountIndicator(mode, version) + 4\n}\n\nfunction getTotalBitsFromDataArray (segments, version) {\n let totalBits = 0\n\n segments.forEach(function (data) {\n const reservedBits = getReservedBitsCount(data.mode, version)\n totalBits += reservedBits + data.getBitsLength()\n })\n\n return totalBits\n}\n\nfunction getBestVersionForMixedData (segments, errorCorrectionLevel) {\n for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n const length = getTotalBitsFromDataArray(segments, currentVersion)\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, Mode.MIXED)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\n/**\n * Returns version number from a value.\n * If value is not a valid version, returns defaultValue\n *\n * @param {Number|String} value QR Code version\n * @param {Number} defaultValue Fallback value\n * @return {Number} QR Code version number\n */\nexports.from = function from (value, defaultValue) {\n if (VersionCheck.isValid(value)) {\n return parseInt(value, 10)\n }\n\n return defaultValue\n}\n\n/**\n * Returns how much data can be stored with the specified QR code version\n * and error correction level\n *\n * @param {Number} version QR Code version (1-40)\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} Quantity of storable data\n */\nexports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode) {\n if (!VersionCheck.isValid(version)) {\n throw new Error('Invalid QR Code version')\n }\n\n // Use Byte mode as default\n if (typeof mode === 'undefined') mode = Mode.BYTE\n\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n if (mode === Mode.MIXED) return dataTotalCodewordsBits\n\n const usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode, version)\n\n // Return max number of storable codewords\n switch (mode) {\n case Mode.NUMERIC:\n return Math.floor((usableBits / 10) * 3)\n\n case Mode.ALPHANUMERIC:\n return Math.floor((usableBits / 11) * 2)\n\n case Mode.KANJI:\n return Math.floor(usableBits / 13)\n\n case Mode.BYTE:\n default:\n return Math.floor(usableBits / 8)\n }\n}\n\n/**\n * Returns the minimum version needed to contain the amount of data\n *\n * @param {Segment} data Segment of data\n * @param {Number} [errorCorrectionLevel=H] Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} QR Code version\n */\nexports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel) {\n let seg\n\n const ecl = ECLevel.from(errorCorrectionLevel, ECLevel.M)\n\n if (Array.isArray(data)) {\n if (data.length > 1) {\n return getBestVersionForMixedData(data, ecl)\n }\n\n if (data.length === 0) {\n return 1\n }\n\n seg = data[0]\n } else {\n seg = data\n }\n\n return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)\n}\n\n/**\n * Returns version information with relative error correction bits\n *\n * The version information is included in QR Code symbols of version 7 or larger.\n * It consists of an 18-bit sequence containing 6 data bits,\n * with 12 error correction bits calculated using the (18, 6) Golay code.\n *\n * @param {Number} version QR Code version\n * @return {Number} Encoded version info bits\n */\nexports.getEncodedBits = function getEncodedBits (version) {\n if (!VersionCheck.isValid(version) || version < 7) {\n throw new Error('Invalid QR Code version')\n }\n\n let d = version << 12\n\n while (Utils.getBCHDigit(d) - G18_BCH >= 0) {\n d ^= (G18 << (Utils.getBCHDigit(d) - G18_BCH))\n }\n\n return (version << 12) | d\n}\n","const Utils = require('./utils')\n\nconst G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nconst G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nconst G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Number} mask Mask pattern\n * @return {Number} Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n const data = ((errorCorrectionLevel.bit << 3) | mask)\n let d = data << 10\n\n while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n }\n\n // xor final data with mask pattern in order to ensure that\n // no combination of Error Correction Level and data mask pattern\n // will result in an all-zero data string\n return ((data << 10) | d) ^ G15_MASK\n}\n","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","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","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","const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n this.mode = Mode.KANJI\n this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n let i\n\n // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n // These byte values are shifted from the JIS X 0208 values.\n // JIS X 0208 gives details of the shift coded representation.\n for (i = 0; i < this.data.length; i++) {\n let value = Utils.toSJIS(this.data[i])\n\n // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n if (value >= 0x8140 && value <= 0x9FFC) {\n // Subtract 0x8140 from Shift JIS value\n value -= 0x8140\n\n // For characters with Shift JIS values from 0xE040 to 0xEBBF\n } else if (value >= 0xE040 && value <= 0xEBBF) {\n // Subtract 0xC140 from Shift JIS value\n value -= 0xC140\n } else {\n throw new Error(\n 'Invalid SJIS character: ' + this.data[i] + '\\n' +\n 'Make sure your charset is UTF-8')\n }\n\n // Multiply most significant byte of result by 0xC0\n // and add least significant byte to product\n value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n // Convert result to a 13-bit binary string\n bitBuffer.put(value, 13)\n }\n}\n\nmodule.exports = KanjiData\n","'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 \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","const Mode = require('./mode')\nconst NumericData = require('./numeric-data')\nconst AlphanumericData = require('./alphanumeric-data')\nconst ByteData = require('./byte-data')\nconst KanjiData = require('./kanji-data')\nconst Regex = require('./regex')\nconst Utils = require('./utils')\nconst dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param {String} str Input string\n * @return {Number} Number of byte\n */\nfunction getStringByteLength (str) {\n return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param {Mode} mode Segment mode\n * @param {String} str String to process\n * @return {Array} Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n const segments = []\n let result\n\n while ((result = regex.exec(str)) !== null) {\n segments.push({\n data: result[0],\n index: result.index,\n mode: mode,\n length: result[0].length\n })\n }\n\n return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param {String} dataStr Input string\n * @return {Array} Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n let byteSegs\n let kanjiSegs\n\n if (Utils.isKanjiModeEnabled()) {\n byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n } else {\n byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n kanjiSegs = []\n }\n\n const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n return segs\n .sort(function (s1, s2) {\n return s1.index - s2.index\n })\n .map(function (obj) {\n return {\n data: obj.data,\n mode: obj.mode,\n length: obj.length\n }\n })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param {Number} length String length\n * @param {Mode} mode Segment mode\n * @return {Number} Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n switch (mode) {\n case Mode.NUMERIC:\n return NumericData.getBitsLength(length)\n case Mode.ALPHANUMERIC:\n return AlphanumericData.getBitsLength(length)\n case Mode.KANJI:\n return KanjiData.getBitsLength(length)\n case Mode.BYTE:\n return ByteData.getBitsLength(length)\n }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction mergeSegments (segs) {\n return segs.reduce(function (acc, curr) {\n const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n if (prevSeg && prevSeg.mode === curr.mode) {\n acc[acc.length - 1].data += curr.data\n return acc\n }\n\n acc.push(curr)\n return acc\n }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction buildNodes (segs) {\n const nodes = []\n for (let i = 0; i < segs.length; i++) {\n const seg = segs[i]\n\n switch (seg.mode) {\n case Mode.NUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.ALPHANUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.KANJI:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n break\n case Mode.BYTE:\n nodes.push([\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n }\n }\n\n return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param {Array} nodes Array of object with segments data\n * @param {Number} version QR Code version\n * @return {Object} Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n const table = {}\n const graph = { start: {} }\n let prevNodeIds = ['start']\n\n for (let i = 0; i < nodes.length; i++) {\n const nodeGroup = nodes[i]\n const currentNodeIds = []\n\n for (let j = 0; j < nodeGroup.length; j++) {\n const node = nodeGroup[j]\n const key = '' + i + j\n\n currentNodeIds.push(key)\n table[key] = { node: node, lastCount: 0 }\n graph[key] = {}\n\n for (let n = 0; n < prevNodeIds.length; n++) {\n const prevNodeId = prevNodeIds[n]\n\n if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n graph[prevNodeId][key] =\n getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n table[prevNodeId].lastCount += node.length\n } else {\n if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n 4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n }\n }\n }\n\n prevNodeIds = currentNodeIds\n }\n\n for (let n = 0; n < prevNodeIds.length; n++) {\n graph[prevNodeIds[n]].end = 0\n }\n\n return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param {String} data Input data\n * @param {Mode | String} modesHint Data mode\n * @return {Segment} Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n let mode\n const bestMode = Mode.getBestModeForData(data)\n\n mode = Mode.from(modesHint, bestMode)\n\n // Make sure data can be encoded\n if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n throw new Error('\"' + data + '\"' +\n ' cannot be encoded with mode ' + Mode.toString(mode) +\n '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n }\n\n // Use Mode.BYTE if Kanji support is disabled\n if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n mode = Mode.BYTE\n }\n\n switch (mode) {\n case Mode.NUMERIC:\n return new NumericData(data)\n\n case Mode.ALPHANUMERIC:\n return new AlphanumericData(data)\n\n case Mode.KANJI:\n return new KanjiData(data)\n\n case Mode.BYTE:\n return new ByteData(data)\n }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param {Array} array Array of objects with segments data\n * @return {Array} Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n return array.reduce(function (acc, seg) {\n if (typeof seg === 'string') {\n acc.push(buildSingleSegment(seg, null))\n } else if (seg.data) {\n acc.push(buildSingleSegment(seg.data, seg.mode))\n }\n\n return acc\n }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @return {Array} Array of segments\n */\nexports.fromString = function fromString (data, version) {\n const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n const nodes = buildNodes(segs)\n const graph = buildGraph(nodes, version)\n const path = dijkstra.find_path(graph.map, 'start', 'end')\n\n const optimizedSegs = []\n for (let i = 1; i < path.length - 1; i++) {\n optimizedSegs.push(graph.table[path[i]].node)\n }\n\n return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param {string} data Input string\n * @return {Array} Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n return exports.fromArray(\n getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n )\n}\n","const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n * http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n// http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n// http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n const size = matrix.size\n const pos = FinderPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -1; r <= 7; r++) {\n if (row + r <= -1 || size <= row + r) continue\n\n for (let c = -1; c <= 7; c++) {\n if (col + c <= -1 || size <= col + c) continue\n\n if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n const size = matrix.size\n\n for (let r = 8; r < size - 8; r++) {\n const value = r % 2 === 0\n matrix.set(r, 6, value, true)\n matrix.set(6, r, value, true)\n }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n const pos = AlignmentPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -2; r <= 2; r++) {\n for (let c = -2; c <= 2; c++) {\n if (r === -2 || r === 2 || c === -2 || c === 2 ||\n (r === 0 && c === 0)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n const size = matrix.size\n const bits = Version.getEncodedBits(version)\n let row, col, mod\n\n for (let i = 0; i < 18; i++) {\n row = Math.floor(i / 3)\n col = i % 3 + size - 8 - 3\n mod = ((bits >> i) & 1) === 1\n\n matrix.set(row, col, mod, true)\n matrix.set(col, row, mod, true)\n }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {Number} maskPattern Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n const size = matrix.size\n const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n let i, mod\n\n for (i = 0; i < 15; i++) {\n mod = ((bits >> i) & 1) === 1\n\n // vertical\n if (i < 6) {\n matrix.set(i, 8, mod, true)\n } else if (i < 8) {\n matrix.set(i + 1, 8, mod, true)\n } else {\n matrix.set(size - 15 + i, 8, mod, true)\n }\n\n // horizontal\n if (i < 8) {\n matrix.set(8, size - i - 1, mod, true)\n } else if (i < 9) {\n matrix.set(8, 15 - i - 1 + 1, mod, true)\n } else {\n matrix.set(8, 15 - i - 1, mod, true)\n }\n }\n\n // fixed module\n matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Uint8Array} data Data codewords\n */\nfunction setupData (matrix, data) {\n const size = matrix.size\n let inc = -1\n let row = size - 1\n let bitIndex = 7\n let byteIndex = 0\n\n for (let col = size - 1; col > 0; col -= 2) {\n if (col === 6) col--\n\n while (true) {\n for (let c = 0; c < 2; c++) {\n if (!matrix.isReserved(row, col - c)) {\n let dark = false\n\n if (byteIndex < data.length) {\n dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n }\n\n matrix.set(row, col - c, dark)\n bitIndex--\n\n if (bitIndex === -1) {\n byteIndex++\n bitIndex = 7\n }\n }\n }\n\n row += inc\n\n if (row < 0 || size <= row) {\n row -= inc\n inc = -inc\n break\n }\n }\n }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {ByteData} data Data input\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n // Prepare data buffer\n const buffer = new BitBuffer()\n\n segments.forEach(function (data) {\n // prefix data with mode indicator (4 bits)\n buffer.put(data.mode.bit, 4)\n\n // Prefix data with character count indicator.\n // The character count indicator is a string of bits that represents the\n // number of characters that are being encoded.\n // The character count indicator must be placed after the mode indicator\n // and must be a certain number of bits long, depending on the QR version\n // and data mode\n // @see {@link Mode.getCharCountIndicator}.\n buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n // add binary data sequence to buffer\n data.write(buffer)\n })\n\n // Calculate required number of bits\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n // Add a terminator.\n // If the bit string is shorter than the total number of required bits,\n // a terminator of up to four 0s must be added to the right side of the string.\n // If the bit string is more than four bits shorter than the required number of bits,\n // add four 0s to the end.\n if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n buffer.put(0, 4)\n }\n\n // If the bit string is fewer than four bits shorter, add only the number of 0s that\n // are needed to reach the required number of bits.\n\n // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n // pad the string on the right with 0s to make the string's length a multiple of 8.\n while (buffer.getLengthInBits() % 8 !== 0) {\n buffer.putBit(0)\n }\n\n // Add pad bytes if the string is still shorter than the total number of required bits.\n // Extend the buffer to fill the data capacity of the symbol corresponding to\n // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n // and 00010001 (0x11) alternately.\n const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n for (let i = 0; i < remainingByte; i++) {\n buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n }\n\n return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param {BitBuffer} bitBuffer Data to encode\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n // Total number of blocks\n const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n // Calculate how many blocks each group should contain\n const blocksInGroup2 = totalCodewords % ecTotalBlocks\n const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n // Number of EC codewords is the same for both groups\n const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n const rs = new ReedSolomonEncoder(ecCount)\n\n let offset = 0\n const dcData = new Array(ecTotalBlocks)\n const ecData = new Array(ecTotalBlocks)\n let maxDataSize = 0\n const buffer = new Uint8Array(bitBuffer.buffer)\n\n // Divide the buffer into the required number of blocks\n for (let b = 0; b < ecTotalBlocks; b++) {\n const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n // extract a block of data from buffer\n dcData[b] = buffer.slice(offset, offset + dataSize)\n\n // Calculate EC codewords for this data block\n ecData[b] = rs.encode(dcData[b])\n\n offset += dataSize\n maxDataSize = Math.max(maxDataSize, dataSize)\n }\n\n // Create final data\n // Interleave the data and error correction codewords from each block\n const data = new Uint8Array(totalCodewords)\n let index = 0\n let i, r\n\n // Add data codewords\n for (i = 0; i < maxDataSize; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n if (i < dcData[r].length) {\n data[index++] = dcData[r][i]\n }\n }\n }\n\n // Apped EC codewords\n for (i = 0; i < ecCount; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n data[index++] = ecData[r][i]\n }\n }\n\n return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @param {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param {MaskPattern} maskPattern Mask pattern\n * @return {Object} Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n let segments\n\n if (Array.isArray(data)) {\n segments = Segments.fromArray(data)\n } else if (typeof data === 'string') {\n let estimatedVersion = version\n\n if (!estimatedVersion) {\n const rawSegments = Segments.rawSplit(data)\n\n // Estimate best version that can contain raw splitted segments\n estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n }\n\n // Build optimized segments\n // If estimated version is undefined, try with the highest version\n segments = Segments.fromString(data, estimatedVersion || 40)\n } else {\n throw new Error('Invalid data')\n }\n\n // Get the min version that can contain data\n const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n // If no version is found, data cannot be stored\n if (!bestVersion) {\n throw new Error('The amount of data is too big to be stored in a QR Code')\n }\n\n // If not specified, use min version as default\n if (!version) {\n version = bestVersion\n\n // Check if the specified version can contain the data\n } else if (version < bestVersion) {\n throw new Error('\\n' +\n 'The chosen QR Code version cannot contain this amount of data.\\n' +\n 'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n )\n }\n\n const dataBits = createData(version, errorCorrectionLevel, segments)\n\n // Allocate matrix buffer\n const moduleCount = Utils.getSymbolSize(version)\n const modules = new BitMatrix(moduleCount)\n\n // Add function modules\n setupFinderPattern(modules, version)\n setupTimingPattern(modules)\n setupAlignmentPattern(modules, version)\n\n // Add temporary dummy bits for format info just to set them as reserved.\n // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n // since the masking operation must be performed only on the encoding region.\n // These blocks will be replaced with correct values later in code.\n setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n if (version >= 7) {\n setupVersionInfo(modules, version)\n }\n\n // Add data codewords\n setupData(modules, dataBits)\n\n if (isNaN(maskPattern)) {\n // Find best mask pattern\n maskPattern = MaskPattern.getBestMask(modules,\n setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n }\n\n // Apply mask pattern\n MaskPattern.applyMask(maskPattern, modules)\n\n // Replace format info bits with correct values\n setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n return {\n modules: modules,\n version: version,\n errorCorrectionLevel: errorCorrectionLevel,\n maskPattern: maskPattern,\n segments: segments\n }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data Input data\n * @param {Object} options Optional configurations\n * @param {Number} options.version QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n if (typeof data === 'undefined' || data === '') {\n throw new Error('No input text')\n }\n\n let errorCorrectionLevel = ECLevel.M\n let version\n let mask\n\n if (typeof options !== 'undefined') {\n // Use higher error correction level as default\n errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n version = Version.from(options.version)\n mask = MaskPattern.from(options.maskPattern)\n\n if (options.toSJISFunc) {\n Utils.setToSJISFunction(options.toSJISFunc)\n }\n }\n\n return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n","function hex2rgba (hex) {\n if (typeof hex === 'number') {\n hex = hex.toString()\n }\n\n if (typeof hex !== 'string') {\n throw new Error('Color should be defined as hex string')\n }\n\n let hexCode = hex.slice().replace('#', '').split('')\n if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {\n throw new Error('Invalid hex color: ' + hex)\n }\n\n // Convert from short to long form (fff -> ffffff)\n if (hexCode.length === 3 || hexCode.length === 4) {\n hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {\n return [c, c]\n }))\n }\n\n // Add default alpha value\n if (hexCode.length === 6) hexCode.push('F', 'F')\n\n const hexValue = parseInt(hexCode.join(''), 16)\n\n return {\n r: (hexValue >> 24) & 255,\n g: (hexValue >> 16) & 255,\n b: (hexValue >> 8) & 255,\n a: hexValue & 255,\n hex: '#' + hexCode.slice(0, 6).join('')\n }\n}\n\nexports.getOptions = function getOptions (options) {\n if (!options) options = {}\n if (!options.color) options.color = {}\n\n const margin = typeof options.margin === 'undefined' ||\n options.margin === null ||\n options.margin < 0\n ? 4\n : options.margin\n\n const width = options.width && options.width >= 21 ? options.width : undefined\n const scale = options.scale || 4\n\n return {\n width: width,\n scale: width ? 4 : scale,\n margin: margin,\n color: {\n dark: hex2rgba(options.color.dark || '#000000ff'),\n light: hex2rgba(options.color.light || '#ffffffff')\n },\n type: options.type,\n rendererOpts: options.rendererOpts || {}\n }\n}\n\nexports.getScale = function getScale (qrSize, opts) {\n return opts.width && opts.width >= qrSize + opts.margin * 2\n ? opts.width / (qrSize + opts.margin * 2)\n : opts.scale\n}\n\nexports.getImageWidth = function getImageWidth (qrSize, opts) {\n const scale = exports.getScale(qrSize, opts)\n return Math.floor((qrSize + opts.margin * 2) * scale)\n}\n\nexports.qrToImageData = function qrToImageData (imgData, qr, opts) {\n const size = qr.modules.size\n const data = qr.modules.data\n const scale = exports.getScale(size, opts)\n const symbolSize = Math.floor((size + opts.margin * 2) * scale)\n const scaledMargin = opts.margin * scale\n const palette = [opts.color.light, opts.color.dark]\n\n for (let i = 0; i < symbolSize; i++) {\n for (let j = 0; j < symbolSize; j++) {\n let posDst = (i * symbolSize + j) * 4\n let pxColor = opts.color.light\n\n if (i >= scaledMargin && j >= scaledMargin &&\n i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {\n const iSrc = Math.floor((i - scaledMargin) / scale)\n const jSrc = Math.floor((j - scaledMargin) / scale)\n pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]\n }\n\n imgData[posDst++] = pxColor.r\n imgData[posDst++] = pxColor.g\n imgData[posDst++] = pxColor.b\n imgData[posDst] = pxColor.a\n }\n }\n}\n","const Utils = require('./utils')\n\nfunction clearCanvas (ctx, canvas, size) {\n ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n if (!canvas.style) canvas.style = {}\n canvas.height = size\n canvas.width = size\n canvas.style.height = size + 'px'\n canvas.style.width = size + 'px'\n}\n\nfunction getCanvasElement () {\n try {\n return document.createElement('canvas')\n } catch (e) {\n throw new Error('You need to specify a canvas element')\n }\n}\n\nexports.render = function render (qrData, canvas, options) {\n let opts = options\n let canvasEl = canvas\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!canvas) {\n canvasEl = getCanvasElement()\n }\n\n opts = Utils.getOptions(opts)\n const size = Utils.getImageWidth(qrData.modules.size, opts)\n\n const ctx = canvasEl.getContext('2d')\n const image = ctx.createImageData(size, size)\n Utils.qrToImageData(image.data, qrData, opts)\n\n clearCanvas(ctx, canvasEl, size)\n ctx.putImageData(image, 0, 0)\n\n return canvasEl\n}\n\nexports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {\n let opts = options\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!opts) opts = {}\n\n const canvasEl = exports.render(qrData, canvas, opts)\n\n const type = opts.type || 'image/png'\n const rendererOpts = opts.rendererOpts || {}\n\n return canvasEl.toDataURL(type, rendererOpts.quality)\n}\n","const Utils = require('./utils')\n\nfunction getColorAttrib (color, attrib) {\n const alpha = color.a / 255\n const str = attrib + '=\"' + color.hex + '\"'\n\n return alpha < 1\n ? str + ' ' + attrib + '-opacity=\"' + alpha.toFixed(2).slice(1) + '\"'\n : str\n}\n\nfunction svgCmd (cmd, x, y) {\n let str = cmd + x\n if (typeof y !== 'undefined') str += ' ' + y\n\n return str\n}\n\nfunction qrToPath (data, size, margin) {\n let path = ''\n let moveBy = 0\n let newRow = false\n let lineLength = 0\n\n for (let i = 0; i < data.length; i++) {\n const col = Math.floor(i % size)\n const row = Math.floor(i / size)\n\n if (!col && !newRow) newRow = true\n\n if (data[i]) {\n lineLength++\n\n if (!(i > 0 && col > 0 && data[i - 1])) {\n path += newRow\n ? svgCmd('M', col + margin, 0.5 + row + margin)\n : svgCmd('m', moveBy, 0)\n\n moveBy = 0\n newRow = false\n }\n\n if (!(col + 1 < size && data[i + 1])) {\n path += svgCmd('h', lineLength)\n lineLength = 0\n }\n } else {\n moveBy++\n }\n }\n\n return path\n}\n\nexports.render = function render (qrData, options, cb) {\n const opts = Utils.getOptions(options)\n const size = qrData.modules.size\n const data = qrData.modules.data\n const qrcodesize = size + opts.margin * 2\n\n const bg = !opts.color.light.a\n ? ''\n : ''\n\n const path =\n ''\n\n const viewBox = 'viewBox=\"' + '0 0 ' + qrcodesize + ' ' + qrcodesize + '\"'\n\n const width = !opts.width ? '' : 'width=\"' + opts.width + '\" height=\"' + opts.width + '\" '\n\n const svgTag = '\\n'\n\n if (typeof cb === 'function') {\n cb(null, svgTag)\n }\n\n return svgTag\n}\n","\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","// 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","import QRCode from 'qrcode'\nimport { imageTracer } from 'imagetracer'\n\n/**\n * Generate a QR code as a data URL (PNG)\n * @param {string} text - The text to encode in the QR code\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - Data URL of the generated QR code\n */\nexport const generateQRCode = async (text, foregroundColor = '#000000', backgroundColor = '#FFFFFF') => {\n try {\n const dataUrl = await QRCode.toDataURL(text, {\n color: {\n dark: foregroundColor,\n light: backgroundColor\n },\n width: 512,\n margin: 2,\n errorCorrectionLevel: 'H'\n })\n return dataUrl\n } catch (error) {\n console.error('Error generating QR code:', error)\n return null\n }\n}\n\n/**\n * Generate a QR code as SVG string\n * @param {string} text - The text to encode in the QR code\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - SVG string of the generated QR code\n */\nexport const generateSVGQRCode = async (text, foregroundColor = '#000000', backgroundColor = '#FFFFFF') => {\n try {\n const svgString = await QRCode.toString(text, {\n type: 'svg',\n width: 512,\n margin: 2,\n errorCorrectionLevel: 'H',\n color: {\n dark: foregroundColor,\n light: backgroundColor\n }\n })\n return svgString\n } catch (error) {\n console.error('Error generating SVG QR code:', error)\n return null\n }\n}\n\n/**\n * Add a custom image to a QR code data URL\n * @param {string} qrCodeUrl - The QR code data URL\n * @param {string} imageUrl - The custom image data URL\n * @param {number} imageSize - Image size as percentage (0-100)\n * @returns {Promise} - Data URL of QR code with embedded image\n */\nexport const addImageToQRCode = async (qrCodeUrl, imageUrl, imageSize = 20) => {\n return new Promise((resolve) => {\n const canvas = document.createElement('canvas')\n const ctx = canvas.getContext('2d')\n \n // Set canvas size\n canvas.width = 512\n canvas.height = 512\n \n // Create image objects\n const qrImage = new Image()\n const customImage = new Image()\n \n qrImage.onload = () => {\n // Draw QR code\n ctx.drawImage(qrImage, 0, 0, 512, 512)\n \n customImage.onload = () => {\n // Calculate image size based on user preference\n const calculatedImageSize = 512 * (imageSize / 100)\n \n // Calculate white box size with margin\n const margin = 16 // 8 pixel margin around the image\n const boxSize = calculatedImageSize + (margin * 2)\n const boxX = (512 - boxSize) / 2\n const boxY = (512 - boxSize) / 2\n \n // Draw white background box\n ctx.fillStyle = '#FFFFFF'\n ctx.fillRect(boxX, boxY, boxSize, boxSize)\n \n // Calculate image position within the white box\n const imageX = boxX + margin\n const imageY = boxY + margin\n \n // Draw custom image\n ctx.drawImage(customImage, imageX, imageY, calculatedImageSize, calculatedImageSize)\n \n // Convert canvas to data URL\n resolve(canvas.toDataURL('image/png'))\n }\n \n // Handle image loading errors\n customImage.onerror = () => {\n console.error('Error loading custom image')\n resolve(qrCodeUrl) // Return QR code without custom image\n }\n \n customImage.src = imageUrl\n }\n \n // Handle QR code loading errors\n qrImage.onerror = () => {\n console.error('Error loading QR code')\n resolve(qrCodeUrl) // Return original QR code if loading fails\n }\n \n qrImage.src = qrCodeUrl\n })\n}\n\n/**\n * Vectorize a bitmap image to SVG elements\n * @param {HTMLImageElement} img - The image element to vectorize\n * @param {number} targetSize - Target size in QR coordinate system\n * @param {number} x - X position in QR coordinate system\n * @param {number} y - Y position in QR coordinate system\n * @param {Document} svgDoc - The SVG document to add elements to\n * @returns {Promise} - SVG group element containing vectorized image\n */\nexport const vectorizeBitmap = (img, targetSize, x, y, svgDoc) => {\n return new Promise((resolve) => {\n // Create a canvas to get the image data\n const canvas = document.createElement('canvas')\n const ctx = canvas.getContext('2d')\n \n // Set canvas size to match the image\n canvas.width = img.width\n canvas.height = img.height\n \n // Draw the image to canvas\n ctx.drawImage(img, 0, 0)\n \n // Get image data for vectorization\n const imageData = ctx.getImageData(0, 0, canvas.width, canvas.height)\n \n // Create a group for the vectorized image\n const group = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'g')\n // Scale the image to fit within the target size in the QR coordinate system\n const scale = targetSize / Math.max(img.width, img.height)\n group.setAttribute('transform', `translate(${x.toFixed(2)}, ${y.toFixed(2)}) scale(${scale.toFixed(4)})`)\n \n // Sample pixels and create colored rectangles\n const sampleSize = Math.max(1, Math.floor(Math.min(img.width, img.height) / 32)) // Sample every N pixels\n const data = imageData.data\n \n for (let y = 0; y < img.height; y += sampleSize) {\n for (let x = 0; x < img.width; x += sampleSize) {\n const index = (y * img.width + x) * 4\n const r = data[index]\n const g = data[index + 1]\n const b = data[index + 2]\n const a = data[index + 3]\n \n // Only create rectangles for non-transparent pixels with sufficient opacity\n if (a > 128 && (r > 0 || g > 0 || b > 0)) {\n const rect = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'rect')\n rect.setAttribute('x', x.toFixed(2))\n rect.setAttribute('y', y.toFixed(2))\n rect.setAttribute('width', sampleSize.toFixed(2))\n rect.setAttribute('height', sampleSize.toFixed(2))\n rect.setAttribute('fill', `rgb(${r}, ${g}, ${b})`)\n group.appendChild(rect)\n }\n }\n }\n \n resolve(group)\n })\n}\n\n/**\n * Add a custom image to an SVG QR code\n * @param {string} svgString - The SVG QR code string\n * @param {string} imageUrl - The custom image data URL\n * @param {number} imageSize - Image size as percentage (0-100)\n * @returns {Promise} - SVG string with embedded image\n */\nexport const addImageToSVG = async (svgString, imageUrl, imageSize = 20) => {\n return new Promise((resolve) => {\n const img = new Image()\n \n img.onload = () => {\n // Parse the SVG string to add custom image\n const parser = new DOMParser()\n const svgDoc = parser.parseFromString(svgString, 'image/svg+xml')\n const svgElement = svgDoc.documentElement\n \n // Calculate image size and position with precise decimal coordinates\n // The QR code uses a 33x33 coordinate system, so we need to scale accordingly\n const qrSize = 33 // QR code coordinate system size\n const calculatedImageSize = qrSize * (imageSize / 100)\n const margin = 2 // Smaller margin for the 33x33 coordinate system\n const boxSize = calculatedImageSize + (margin * 2)\n const boxX = (qrSize - boxSize) / 2\n const boxY = (qrSize - boxSize) / 2\n const imageX = boxX + margin\n const imageY = boxY + margin\n \n // Create white background rectangle with precise positioning\n const whiteBox = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'rect')\n whiteBox.setAttribute('x', boxX.toFixed(2))\n whiteBox.setAttribute('y', boxY.toFixed(2))\n whiteBox.setAttribute('width', boxSize.toFixed(2))\n whiteBox.setAttribute('height', boxSize.toFixed(2))\n whiteBox.setAttribute('fill', '#FFFFFF')\n \n // Add elements to SVG\n svgElement.appendChild(whiteBox)\n \n // Handle different image types\n if (imageUrl.startsWith('data:image/svg+xml')) {\n console.log('Processing SVG image')\n // For SVG images, embed the SVG content directly with precise positioning\n const imageElement = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'image')\n imageElement.setAttribute('x', imageX.toFixed(2))\n imageElement.setAttribute('y', imageY.toFixed(2))\n imageElement.setAttribute('width', calculatedImageSize.toFixed(2))\n imageElement.setAttribute('height', calculatedImageSize.toFixed(2))\n imageElement.setAttribute('href', imageUrl)\n svgElement.appendChild(imageElement)\n console.log('SVG image element added')\n \n // Convert back to string\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n } else {\n console.log('Processing bitmap image')\n // For bitmap images, convert to vector paths\n vectorizeBitmap(img, calculatedImageSize, imageX, imageY, svgDoc).then((vectorizedImage) => {\n svgElement.appendChild(vectorizedImage)\n console.log('Vectorized image group added')\n \n // Convert back to string\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n }).catch((error) => {\n console.error('Vectorization failed:', error)\n // Convert back to string without the image\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n })\n }\n }\n \n img.onerror = () => {\n console.error('Error loading image for SVG')\n resolve(svgString) // Return SVG without image if loading fails\n }\n \n img.src = imageUrl\n })\n}\n\n/**\n * Generate a complete SVG QR code with embedded image\n * @param {string} text - The text to encode in the QR code\n * @param {string} imageUrl - The custom image data URL (optional)\n * @param {number} imageSize - Image size as percentage (0-100, default: 20)\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - Complete SVG string with embedded image\n */\nexport const generateCompleteSVGQRCode = async (\n text, \n imageUrl = null, \n imageSize = 20, \n foregroundColor = '#000000', \n backgroundColor = '#FFFFFF'\n) => {\n try {\n // Generate base SVG QR code\n const svgString = await generateSVGQRCode(text, foregroundColor, backgroundColor)\n \n if (!svgString) {\n return null\n }\n \n // Add custom image if provided\n if (imageUrl) {\n console.log('Adding custom image to SVG...')\n const result = await addImageToSVG(svgString, imageUrl, imageSize)\n console.log('SVG with image generated')\n return result\n }\n \n return svgString\n } catch (error) {\n console.error('Error generating complete SVG QR code:', error)\n return null\n }\n}\n\n/**\n * Download an SVG string as a file\n * @param {string} svgContent - The SVG content to download\n * @param {string} filename - The filename for the download (default: 'qrcode.svg')\n */\nexport const downloadSVG = (svgContent, filename = 'qrcode.svg') => {\n if (!svgContent) {\n console.error('No SVG content to download')\n return\n }\n \n // Create download link\n const blob = new Blob([svgContent], { type: 'image/svg+xml' })\n const url = URL.createObjectURL(blob)\n const a = document.createElement('a')\n a.href = url\n a.download = filename\n document.body.appendChild(a)\n a.click()\n document.body.removeChild(a)\n URL.revokeObjectURL(url)\n}\n\n/**\n * Convert a file to data URL\n * @param {File} file - The file to convert\n * @returns {Promise} - Data URL of the file\n */\nexport const fileToDataURL = (file) => {\n return new Promise((resolve, reject) => {\n const reader = new FileReader()\n reader.onload = () => resolve(reader.result)\n reader.onerror = reject\n reader.readAsDataURL(file)\n })\n}\n\n/**\n * Validate image file\n * @param {File} file - The file to validate\n * @param {number} maxSize - Maximum file size in bytes (default: 2MB)\n * @returns {Object} - Validation result with success boolean and error message\n */\nexport const validateImageFile = (file, maxSize = 2 * 1024 * 1024) => {\n const allowedTypes = ['image/jpeg', 'image/png', 'image/gif', 'image/webp', 'image/svg+xml']\n \n if (!allowedTypes.includes(file.type)) {\n return {\n success: false,\n error: 'Please select a valid image file (JPEG, PNG, GIF, WebP, or SVG)'\n }\n }\n \n if (file.size > maxSize) {\n return {\n success: false,\n error: `File size must be less than ${Math.round(maxSize / 1024 / 1024)}MB`\n }\n }\n \n return { success: true }\n} "],"names":["toSJISFunction","CODEWORDS_COUNT","utils","getSymbolSize","version","Error","getSymbolTotalCodewords","getBCHDigit","data","digit","setToSJISFunction","f","isKanjiModeEnabled","toSJIS","kanji","BitBuffer","this","buffer","length","L","bit","exports","M","Q","H","isValid","level","from","value","defaultValue","string","toLowerCase","fromString","e","prototype","get","index","bufIndex","Math","floor","put","num","i","putBit","getLengthInBits","push","bitBuffer","BitMatrix","size","Uint8Array","reservedBit","set","row","col","reserved","xor","isReserved","bitMatrix","require$$0","getRowColCoords","posCount","intervals","ceil","positions","reverse","getPositions","coords","pos","posLength","j","finderPattern","Patterns","PATTERN000","PATTERN001","PATTERN010","PATTERN011","PATTERN100","PATTERN101","PATTERN110","PATTERN111","PenaltyScores","getMaskAt","maskPattern","mask","isNaN","parseInt","getPenaltyN1","points","sameCountCol","sameCountRow","lastCol","lastRow","module","getPenaltyN2","last","getPenaltyN3","bitsCol","bitsRow","getPenaltyN4","darkCount","modulesCount","abs","applyMask","pattern","getBestMask","setupFormatFunc","numPatterns","Object","keys","bestPattern","lowerPenalty","Infinity","p","penalty","ECLevel","EC_BLOCKS_TABLE","EC_CODEWORDS_TABLE","errorCorrectionCode","getBlocksCount","errorCorrectionLevel","getTotalCodewordsCount","EXP_TABLE","LOG_TABLE","x","galoisField","log","n","exp","mul","y","GF","p1","p2","coeff","mod","divident","divisor","result","offset","slice","generateECPolynomial","degree","poly","Polynomial","ReedSolomonEncoder","genPoly","initialize","encode","paddedData","remainder","start","buff","reedSolomonEncoder","versionCheck","numeric","replace","byte","regex","KANJI","RegExp","BYTE_KANJI","BYTE","NUMERIC","ALPHANUMERIC","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","testKanji","str","test","testNumeric","testAlphanumeric","VersionCheck","Regex","require$$1","id","ccBits","MIXED","getCharCountIndicator","mode","getBestModeForData","dataStr","toString","Utils","ECCode","require$$2","Mode","require$$3","require$$4","G18_BCH","getReservedBitsCount","getTotalBitsFromDataArray","segments","totalBits","forEach","reservedBits","getBitsLength","getCapacity","dataTotalCodewordsBits","usableBits","getBestVersionForData","seg","ecl","Array","isArray","currentVersion","getBestVersionForMixedData","getBestVersionForDataLength","getLength","getEncodedBits","d","G15_BCH","formatInfo","NumericData","write","group","substr","remainingNum","numericData","ALPHA_NUM_CHARS","AlphanumericData","indexOf","alphanumericData","ByteData","TextEncoder","l","byteData","KanjiData","dijkstra","kanjiData","single_source_shortest_paths","graph","s","predecessors","costs","closest","u","v","cost_of_s_to_u","adjacent_nodes","cost_of_s_to_u_plus_cost_of_e","cost_of_s_to_v","open","PriorityQueue","make","empty","pop","cost","hasOwnProperty","msg","join","extract_shortest_path_from_predecessor_list","nodes","find_path","opts","key","T","t","queue","sorter","default_sorter","a","b","item","sort","shift","require$$5","require$$6","require$$7","getStringByteLength","unescape","encodeURIComponent","getSegments","exec","getSegmentsFromString","numSegs","alphaNumSegs","byteSegs","kanjiSegs","concat","s1","s2","map","obj","getSegmentBitsLength","buildSingleSegment","modesHint","bestMode","fromArray","array","reduce","acc","segs","buildNodes","table","prevNodeIds","nodeGroup","currentNodeIds","node","lastCount","prevNodeId","end","buildGraph","path","optimizedSegs","curr","prevSeg","mergeSegments","rawSplit","AlignmentPattern","FinderPattern","MaskPattern","require$$8","Version","require$$9","FormatInfo","require$$10","require$$11","Segments","require$$12","setupFormatInfo","matrix","bits","createData","remainingByte","totalCodewords","ecTotalCodewords","dataTotalCodewords","ecTotalBlocks","blocksInGroup2","blocksInGroup1","totalCodewordsInGroup1","dataCodewordsInGroup1","dataCodewordsInGroup2","ecCount","rs","dcData","ecData","maxDataSize","dataSize","max","r","createCodewords","createSymbol","estimatedVersion","rawSegments","bestVersion","dataBits","moduleCount","modules","c","setupFinderPattern","setupTimingPattern","setupAlignmentPattern","setupVersionInfo","inc","bitIndex","byteIndex","dark","setupData","bind","qrcode","create","options","toSJISFunc","hex2rgba","hex","hexCode","split","apply","hexValue","g","getOptions","color","margin","width","scale","light","type","rendererOpts","getScale","qrSize","getImageWidth","qrToImageData","imgData","qr","symbolSize","scaledMargin","palette","posDst","pxColor","render","qrData","canvas","canvasEl","getContext","document","createElement","getCanvasElement","ctx","image","createImageData","clearRect","height","style","clearCanvas","putImageData","renderToDataURL","toDataURL","quality","getColorAttrib","attrib","alpha","toFixed","svgCmd","cmd","svgTag","cb","qrcodesize","bg","moveBy","newRow","lineLength","qrToPath","viewBox","canPromise","Promise","then","QRCode","CanvasRenderer","SvgRenderer","renderCanvas","renderFunc","text","args","call","arguments","argsNum","isLastArgCb","resolve","reject","browser","toCanvas","_","generateSVGQRCode","async","foregroundColor","backgroundColor","error","console","vectorizeBitmap","img","targetSize","svgDoc","drawImage","imageData","getImageData","createElementNS","setAttribute","sampleSize","min","rect","appendChild","addImageToSVG","svgString","imageUrl","imageSize","Image","onload","DOMParser","parseFromString","svgElement","documentElement","calculatedImageSize","boxSize","boxX","boxY","imageX","imageY","whiteBox","startsWith","imageElement","serializer","XMLSerializer","serializeToString","vectorizedImage","catch","onerror","src","qrCodeUrl","qrImage","customImage","fillStyle","fillRect","svgContent","filename","blob","Blob","url","URL","createObjectURL","href","download","body","click","removeChild","revokeObjectURL","file","reader","FileReader","readAsDataURL","maxSize","includes","success","round"],"mappings":"4DAAA,IAAIA,EACJ,MAAMC,EAAkB,CACtB,EACA,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC1C,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAC7C,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KACtD,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MASxDC,EAAAC,cAAwB,SAAwBC,GAC9C,IAAKA,EAAS,MAAM,IAAIC,MAAM,yCAC9B,GAAID,EAAU,GAAKA,EAAU,GAAI,MAAM,IAAIC,MAAM,6CACjD,OAAiB,EAAVD,EAAc,EACvB,EAQAF,EAAAI,wBAAkC,SAAkCF,GAClE,OAAOH,EAAgBG,EACzB,EAQAF,EAAAK,YAAsB,SAAUC,GAC9B,IAAIC,EAAQ,EAEZ,KAAgB,IAATD,GACLC,IACAD,KAAU,EAGZ,OAAOC,CACT,EAEAP,EAAAQ,kBAA4B,SAA4BC,GACtD,GAAiB,mBAANA,EACT,MAAM,IAAIN,MAAM,yCAGlBL,EAAiBW,CACnB,EAEAT,EAAAU,mBAA6B,WAC3B,YAAiC,IAAnBZ,CAChB,EAEAE,EAAAW,OAAiB,SAAiBC,GAChC,OAAOd,EAAec,EACxB,aC9DA,SAASC,IACPC,KAAKC,OAAS,GACdD,KAAKE,OAAS,CAChB,OCHAC,EAAY,CAAEC,IAAK,GACnBC,EAAAC,EAAY,CAAEF,IAAK,GACnBC,EAAAE,EAAY,CAAEH,IAAK,GACnBC,EAAAG,EAAY,CAAEJ,IAAK,GA+BnBC,EAAAI,QAAkB,SAAkBC,GAClC,OAAOA,QAA8B,IAAdA,EAAMN,KAC3BM,EAAMN,KAAO,GAAKM,EAAMN,IAAM,CAClC,EAEAC,EAAAM,KAAe,SAAeC,EAAOC,GACnC,GAAIR,EAAQI,QAAQG,GAClB,OAAOA,EAGT,IACE,OAxCJ,SAAqBE,GACnB,GAAsB,iBAAXA,EACT,MAAM,IAAIzB,MAAM,yBAKlB,OAFcyB,EAAOC,eAGnB,IAAK,IACL,IAAK,MACH,OAAOV,EAAQF,EAEjB,IAAK,IACL,IAAK,SACH,OAAOE,EAAQC,EAEjB,IAAK,IACL,IAAK,WACH,OAAOD,EAAQE,EAEjB,IAAK,IACL,IAAK,OACH,OAAOF,EAAQG,EAEjB,QACE,MAAM,IAAInB,MAAM,qBAAuByB,GAE7C,CAaWE,CAAWJ,EACtB,OAAWK,GACP,OAAOJ,CACX,CACA,ED5CAd,EAAUmB,UAAY,CAEpBC,IAAK,SAAUC,GACb,MAAMC,EAAWC,KAAKC,MAAMH,EAAQ,GACpC,OAA6D,IAApDpB,KAAKC,OAAOoB,KAAe,EAAID,EAAQ,EAAM,EAC1D,EAEEI,IAAK,SAAUC,EAAKvB,GAClB,IAAA,IAASwB,EAAI,EAAGA,EAAIxB,EAAQwB,IAC1B1B,KAAK2B,OAA4C,IAAnCF,IAASvB,EAASwB,EAAI,EAAM,GAEhD,EAEEE,gBAAiB,WACf,OAAO5B,KAAKE,MAChB,EAEEyB,OAAQ,SAAUvB,GAChB,MAAMiB,EAAWC,KAAKC,MAAMvB,KAAKE,OAAS,GACtCF,KAAKC,OAAOC,QAAUmB,GACxBrB,KAAKC,OAAO4B,KAAK,GAGfzB,IACFJ,KAAKC,OAAOoB,IAAc,MAAUrB,KAAKE,OAAS,GAGpDF,KAAKE,QACT,GAGA,IAAA4B,EAAiB/B,EE/BjB,SAASgC,EAAWC,GAClB,IAAKA,GAAQA,EAAO,EAClB,MAAM,IAAI3C,MAAM,qDAGlBW,KAAKgC,KAAOA,EACZhC,KAAKR,KAAO,IAAIyC,WAAWD,EAAOA,GAClChC,KAAKkC,YAAc,IAAID,WAAWD,EAAOA,EAC3C,CAWAD,EAAUb,UAAUiB,IAAM,SAAUC,EAAKC,EAAKzB,EAAO0B,GACnD,MAAMlB,EAAQgB,EAAMpC,KAAKgC,KAAOK,EAChCrC,KAAKR,KAAK4B,GAASR,EACf0B,IAAUtC,KAAKkC,YAAYd,IAAS,EAC1C,EASAW,EAAUb,UAAUC,IAAM,SAAUiB,EAAKC,GACvC,OAAOrC,KAAKR,KAAK4C,EAAMpC,KAAKgC,KAAOK,EACrC,EAUAN,EAAUb,UAAUqB,IAAM,SAAUH,EAAKC,EAAKzB,GAC5CZ,KAAKR,KAAK4C,EAAMpC,KAAKgC,KAAOK,IAAQzB,CACtC,EASAmB,EAAUb,UAAUsB,WAAa,SAAUJ,EAAKC,GAC9C,OAAOrC,KAAKkC,YAAYE,EAAMpC,KAAKgC,KAAOK,EAC5C,EAEA,IAAAI,EAAiBV,oBCtDjB,MAAM5C,EAAgBuD,EAAmBvD,cAgBzCkB,EAAAsC,gBAA0B,SAA0BvD,GAClD,GAAgB,IAAZA,EAAe,MAAO,GAE1B,MAAMwD,EAAWtB,KAAKC,MAAMnC,EAAU,GAAK,EACrC4C,EAAO7C,EAAcC,GACrByD,EAAqB,MAATb,EAAe,GAAmD,EAA9CV,KAAKwB,MAAMd,EAAO,KAAO,EAAIY,EAAW,IACxEG,EAAY,CAACf,EAAO,GAE1B,IAAA,IAASN,EAAI,EAAGA,EAAIkB,EAAW,EAAGlB,IAChCqB,EAAUrB,GAAKqB,EAAUrB,EAAI,GAAKmB,EAKpC,OAFAE,EAAUlB,KAAK,GAERkB,EAAUC,SACnB,EAsBA3C,EAAA4C,aAAuB,SAAuB7D,GAC5C,MAAM8D,EAAS,GACTC,EAAM9C,EAAQsC,gBAAgBvD,GAC9BgE,EAAYD,EAAIjD,OAEtB,IAAA,IAASwB,EAAI,EAAGA,EAAI0B,EAAW1B,IAC7B,IAAA,IAAS2B,EAAI,EAAGA,EAAID,EAAWC,IAElB,IAAN3B,GAAiB,IAAN2B,GACL,IAAN3B,GAAW2B,IAAMD,EAAY,GAC7B1B,IAAM0B,EAAY,GAAW,IAANC,GAI5BH,EAAOrB,KAAK,CAACsB,EAAIzB,GAAIyB,EAAIE,KAI7B,OAAOH,CACT,eClFA,MAAM/D,EAAgBuD,EAAmBvD,cAUzCmE,EAAAL,aAAuB,SAAuB7D,GAC5C,MAAM4C,EAAO7C,EAAcC,GAE3B,MAAO,CAEL,CAAC,EAAG,GAEJ,CAAC4C,EAhBuB,EAgBK,GAE7B,CAAC,EAAGA,EAlBoB,GAoB5B,wBCjBA3B,EAAAkD,SAAmB,CACjBC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,GAOd,MAAMC,EACA,EADAA,EAEA,EAFAA,EAGA,GAHAA,EAIA,GAkJN,SAASC,EAAWC,EAAaxC,EAAG2B,GAClC,OAAQa,GACN,KAAK7D,EAAQkD,SAASC,WAAY,OAAQ9B,EAAI2B,GAAK,GAAM,EACzD,KAAKhD,EAAQkD,SAASE,WAAY,OAAO/B,EAAI,GAAM,EACnD,KAAKrB,EAAQkD,SAASG,WAAY,OAAOL,EAAI,GAAM,EACnD,KAAKhD,EAAQkD,SAASI,WAAY,OAAQjC,EAAI2B,GAAK,GAAM,EACzD,KAAKhD,EAAQkD,SAASK,WAAY,OAAQtC,KAAKC,MAAMG,EAAI,GAAKJ,KAAKC,MAAM8B,EAAI,IAAM,GAAM,EACzF,KAAKhD,EAAQkD,SAASM,WAAY,OAAQnC,EAAI2B,EAAK,EAAK3B,EAAI2B,EAAK,GAAM,EACvE,KAAKhD,EAAQkD,SAASO,WAAY,OAASpC,EAAI2B,EAAK,EAAK3B,EAAI2B,EAAK,GAAK,GAAM,EAC7E,KAAKhD,EAAQkD,SAASQ,WAAY,OAASrC,EAAI2B,EAAK,GAAK3B,EAAI2B,GAAK,GAAK,GAAM,EAE7E,QAAS,MAAM,IAAIhE,MAAM,mBAAqB6E,GAElD,CAtJA7D,EAAAI,QAAkB,SAAkB0D,GAClC,OAAe,MAARA,GAAyB,KAATA,IAAgBC,MAAMD,IAASA,GAAQ,GAAKA,GAAQ,CAC7E,EASA9D,EAAAM,KAAe,SAAeC,GAC5B,OAAOP,EAAQI,QAAQG,GAASyD,SAASzD,EAAO,SAAM,CACxD,EASAP,EAAAiE,aAAuB,SAAuB9E,GAC5C,MAAMwC,EAAOxC,EAAKwC,KAClB,IAAIuC,EAAS,EACTC,EAAe,EACfC,EAAe,EACfC,EAAU,KACVC,EAAU,KAEd,IAAA,IAASvC,EAAM,EAAGA,EAAMJ,EAAMI,IAAO,CACnCoC,EAAeC,EAAe,EAC9BC,EAAUC,EAAU,KAEpB,IAAA,IAAStC,EAAM,EAAGA,EAAML,EAAMK,IAAO,CACnC,IAAIuC,EAASpF,EAAK2B,IAAIiB,EAAKC,GACvBuC,IAAWF,EACbF,KAEIA,GAAgB,IAAGD,GAAUP,GAAoBQ,EAAe,IACpEE,EAAUE,EACVJ,EAAe,GAGjBI,EAASpF,EAAK2B,IAAIkB,EAAKD,GACnBwC,IAAWD,EACbF,KAEIA,GAAgB,IAAGF,GAAUP,GAAoBS,EAAe,IACpEE,EAAUC,EACVH,EAAe,EAEvB,CAEQD,GAAgB,IAAGD,GAAUP,GAAoBQ,EAAe,IAChEC,GAAgB,IAAGF,GAAUP,GAAoBS,EAAe,GACxE,CAEE,OAAOF,CACT,EAOAlE,EAAAwE,aAAuB,SAAuBrF,GAC5C,MAAMwC,EAAOxC,EAAKwC,KAClB,IAAIuC,EAAS,EAEb,IAAA,IAASnC,EAAM,EAAGA,EAAMJ,EAAO,EAAGI,IAChC,IAAA,IAASC,EAAM,EAAGA,EAAML,EAAO,EAAGK,IAAO,CACvC,MAAMyC,EAAOtF,EAAK2B,IAAIiB,EAAKC,GACzB7C,EAAK2B,IAAIiB,EAAKC,EAAM,GACpB7C,EAAK2B,IAAIiB,EAAM,EAAGC,GAClB7C,EAAK2B,IAAIiB,EAAM,EAAGC,EAAM,GAEb,IAATyC,GAAuB,IAATA,GAAYP,GACpC,CAGE,OAAOA,EAASP,CAClB,EAQA3D,EAAA0E,aAAuB,SAAuBvF,GAC5C,MAAMwC,EAAOxC,EAAKwC,KAClB,IAAIuC,EAAS,EACTS,EAAU,EACVC,EAAU,EAEd,IAAA,IAAS7C,EAAM,EAAGA,EAAMJ,EAAMI,IAAO,CACnC4C,EAAUC,EAAU,EACpB,IAAA,IAAS5C,EAAM,EAAGA,EAAML,EAAMK,IAC5B2C,EAAYA,GAAW,EAAK,KAASxF,EAAK2B,IAAIiB,EAAKC,GAC/CA,GAAO,KAAmB,OAAZ2C,GAAiC,KAAZA,IAAoBT,IAE3DU,EAAYA,GAAW,EAAK,KAASzF,EAAK2B,IAAIkB,EAAKD,GAC/CC,GAAO,KAAmB,OAAZ4C,GAAiC,KAAZA,IAAoBV,GAEjE,CAEE,OAAOA,EAASP,CAClB,EAUA3D,EAAA6E,aAAuB,SAAuB1F,GAC5C,IAAI2F,EAAY,EAChB,MAAMC,EAAe5F,EAAKA,KAAKU,OAE/B,IAAA,IAASwB,EAAI,EAAGA,EAAI0D,EAAc1D,IAAKyD,GAAa3F,EAAKA,KAAKkC,GAI9D,OAFUJ,KAAK+D,IAAI/D,KAAKwB,KAAkB,IAAZqC,EAAkBC,EAAgB,GAAK,IAE1DpB,CACb,EA+BA3D,EAAAiF,UAAoB,SAAoBC,EAAS/F,GAC/C,MAAMwC,EAAOxC,EAAKwC,KAElB,IAAA,IAASK,EAAM,EAAGA,EAAML,EAAMK,IAC5B,IAAA,IAASD,EAAM,EAAGA,EAAMJ,EAAMI,IACxB5C,EAAKgD,WAAWJ,EAAKC,IACzB7C,EAAK+C,IAAIH,EAAKC,EAAK4B,EAAUsB,EAASnD,EAAKC,GAGjD,EAQAhC,EAAAmF,YAAsB,SAAsBhG,EAAMiG,GAChD,MAAMC,EAAcC,OAAOC,KAAKvF,EAAQkD,UAAUrD,OAClD,IAAI2F,EAAc,EACdC,EAAeC,IAEnB,IAAA,IAASC,EAAI,EAAGA,EAAIN,EAAaM,IAAK,CACpCP,EAAgBO,GAChB3F,EAAQiF,UAAUU,EAAGxG,GAGrB,MAAMyG,EACJ5F,EAAQiE,aAAa9E,GACrBa,EAAQwE,aAAarF,GACrBa,EAAQ0E,aAAavF,GACrBa,EAAQ6E,aAAa1F,GAGvBa,EAAQiF,UAAUU,EAAGxG,GAEjByG,EAAUH,IACZA,EAAeG,EACfJ,EAAcG,EAEpB,CAEE,OAAOH,CACT,eCzOA,MAAMK,EAAUxD,EAEVyD,EAAkB,CAEtB,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,GACT,EAAG,EAAG,GAAI,GACV,EAAG,EAAG,GAAI,GACV,EAAG,EAAG,GAAI,GACV,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,IAGRC,EAAqB,CAEzB,EAAG,GAAI,GAAI,GACX,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,IACZ,GAAI,GAAI,IAAK,IACb,GAAI,GAAI,IAAK,IACb,GAAI,IAAK,IAAK,IACd,GAAI,IAAK,IAAK,IACd,GAAI,IAAK,IAAK,IACd,GAAI,IAAK,IAAK,IACd,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,KACf,IAAK,IAAK,IAAK,KACf,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,MAWnBC,EAAAC,eAAyB,SAAyBlH,EAASmH,GACzD,OAAQA,GACN,KAAKL,EAAQ/F,EACX,OAAOgG,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,KAAK8G,EAAQ5F,EACX,OAAO6F,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,KAAK8G,EAAQ3F,EACX,OAAO4F,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,KAAK8G,EAAQ1F,EACX,OAAO2F,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,QACE,OAEN,EAUAiH,EAAAG,uBAAiC,SAAiCpH,EAASmH,GACzE,OAAQA,GACN,KAAKL,EAAQ/F,EACX,OAAOiG,EAAmC,GAAfhH,EAAU,GAAS,GAChD,KAAK8G,EAAQ5F,EACX,OAAO8F,EAAmC,GAAfhH,EAAU,GAAS,GAChD,KAAK8G,EAAQ3F,EACX,OAAO6F,EAAmC,GAAfhH,EAAU,GAAS,GAChD,KAAK8G,EAAQ1F,EACX,OAAO4F,EAAmC,GAAfhH,EAAU,GAAS,GAChD,QACE,OAEN,gBCtIA,MAAMqH,EAAY,IAAIxE,WAAW,KAC3ByE,EAAY,IAAIzE,WAAW,MAShC,WACC,IAAI0E,EAAI,EACR,IAAA,IAASjF,EAAI,EAAGA,EAAI,IAAKA,IACvB+E,EAAU/E,GAAKiF,EACfD,EAAUC,GAAKjF,EAEfiF,IAAM,EAIE,IAAJA,IACFA,GAAK,KAQT,IAAA,IAASjF,EAAI,IAAKA,EAAI,IAAKA,IACzB+E,EAAU/E,GAAK+E,EAAU/E,EAAI,IAEjC,CAtBC,GA8BDkF,EAAAC,IAAc,SAAcC,GAC1B,GAAIA,EAAI,EAAG,MAAM,IAAIzH,MAAM,OAASyH,EAAI,KACxC,OAAOJ,EAAUI,EACnB,EAQAF,EAAAG,IAAc,SAAcD,GAC1B,OAAOL,EAAUK,EACnB,EASAF,EAAAI,IAAc,SAAcL,EAAGM,GAC7B,OAAU,IAANN,GAAiB,IAANM,EAAgB,EAIxBR,EAAUC,EAAUC,GAAKD,EAAUO,GAC5C,cCpEA,MAAMC,EAAKxE,EASXrC,EAAA2G,IAAc,SAAcG,EAAIC,GAC9B,MAAMC,EAAQ,IAAIpF,WAAWkF,EAAGjH,OAASkH,EAAGlH,OAAS,GAErD,IAAA,IAASwB,EAAI,EAAGA,EAAIyF,EAAGjH,OAAQwB,IAC7B,IAAA,IAAS2B,EAAI,EAAGA,EAAI+D,EAAGlH,OAAQmD,IAC7BgE,EAAM3F,EAAI2B,IAAM6D,EAAGF,IAAIG,EAAGzF,GAAI0F,EAAG/D,IAIrC,OAAOgE,CACT,EASAhH,EAAAiH,IAAc,SAAcC,EAAUC,GACpC,IAAIC,EAAS,IAAIxF,WAAWsF,GAE5B,KAAQE,EAAOvH,OAASsH,EAAQtH,QAAW,GAAG,CAC5C,MAAMmH,EAAQI,EAAO,GAErB,IAAA,IAAS/F,EAAI,EAAGA,EAAI8F,EAAQtH,OAAQwB,IAClC+F,EAAO/F,IAAMwF,EAAGF,IAAIQ,EAAQ9F,GAAI2F,GAIlC,IAAIK,EAAS,EACb,KAAOA,EAASD,EAAOvH,QAA6B,IAAnBuH,EAAOC,IAAeA,IACvDD,EAASA,EAAOE,MAAMD,EAC1B,CAEE,OAAOD,CACT,EASApH,EAAAuH,qBAA+B,SAA+BC,GAC5D,IAAIC,EAAO,IAAI7F,WAAW,CAAC,IAC3B,IAAA,IAASP,EAAI,EAAGA,EAAImG,EAAQnG,IAC1BoG,EAAOzH,EAAQ2G,IAAIc,EAAM,IAAI7F,WAAW,CAAC,EAAGiF,EAAGH,IAAIrF,MAGrD,OAAOoG,CACT,MC7DA,MAAMC,EAAarF,EAEnB,SAASsF,EAAoBH,GAC3B7H,KAAKiI,aAAU,EACfjI,KAAK6H,OAASA,EAEV7H,KAAK6H,QAAQ7H,KAAKkI,WAAWlI,KAAK6H,OACxC,CAQAG,EAAmB9G,UAAUgH,WAAa,SAAqBL,GAE7D7H,KAAK6H,OAASA,EACd7H,KAAKiI,QAAUF,EAAWH,qBAAqB5H,KAAK6H,OACtD,EAQAG,EAAmB9G,UAAUiH,OAAS,SAAiB3I,GACrD,IAAKQ,KAAKiI,QACR,MAAM,IAAI5I,MAAM,2BAKlB,MAAM+I,EAAa,IAAInG,WAAWzC,EAAKU,OAASF,KAAK6H,QACrDO,EAAWjG,IAAI3C,GAIf,MAAM6I,EAAYN,EAAWT,IAAIc,EAAYpI,KAAKiI,SAK5CK,EAAQtI,KAAK6H,OAASQ,EAAUnI,OACtC,GAAIoI,EAAQ,EAAG,CACb,MAAMC,EAAO,IAAItG,WAAWjC,KAAK6H,QAGjC,OAFAU,EAAKpG,IAAIkG,EAAWC,GAEbC,CACX,CAEE,OAAOF,CACT,EAEA,IAAAG,EAAiBR,eCjDjBS,QAAkB,SAAkBrJ,GAClC,OAAQgF,MAAMhF,IAAYA,GAAW,GAAKA,GAAW,EACvD,QCRA,MAAMsJ,EAAU,SAEhB,IAAI5I,EAAQ,mNAIZA,EAAQA,EAAM6I,QAAQ,KAAM,OAE5B,MAAMC,EAAO,6BAA+B9I,EAAQ,kBAEpD+I,EAAAC,MAAgB,IAAIC,OAAOjJ,EAAO,KAClC+I,EAAAG,WAAqB,IAAID,OAAO,wBAAyB,KACzDF,EAAAI,KAAe,IAAIF,OAAOH,EAAM,KAChCC,EAAAK,QAAkB,IAAIH,OAAOL,EAAS,KACtCG,EAAAM,aAAuB,IAAIJ,OAbN,oBAa2B,KAEhD,MAAMK,EAAa,IAAIL,OAAO,IAAMjJ,EAAQ,KACtCuJ,EAAe,IAAIN,OAAO,IAAML,EAAU,KAC1CY,EAAoB,IAAIP,OAAO,0BAErCF,EAAAU,UAAoB,SAAoBC,GACtC,OAAOJ,EAAWK,KAAKD,EACzB,EAEAX,EAAAa,YAAsB,SAAsBF,GAC1C,OAAOH,EAAaI,KAAKD,EAC3B,EAEAX,EAAAc,iBAA2B,SAA2BH,GACpD,OAAOF,EAAkBG,KAAKD,EAChC,cC9BA,MAAMI,EAAelH,EACfmH,EAAQC,EASdzJ,EAAA6I,QAAkB,CAChBa,GAAI,UACJ3J,IAAK,EACL4J,OAAQ,CAAC,GAAI,GAAI,KAYnB3J,EAAA8I,aAAuB,CACrBY,GAAI,eACJ3J,IAAK,EACL4J,OAAQ,CAAC,EAAG,GAAI,KAQlB3J,EAAA4I,KAAe,CACbc,GAAI,OACJ3J,IAAK,EACL4J,OAAQ,CAAC,EAAG,GAAI,KAYlB3J,EAAAyI,MAAgB,CACdiB,GAAI,QACJ3J,IAAK,EACL4J,OAAQ,CAAC,EAAG,GAAI,KASlB3J,EAAA4J,MAAgB,CACd7J,KAAK,GAWPC,EAAA6J,sBAAgC,SAAgCC,EAAM/K,GACpE,IAAK+K,EAAKH,aAAc,IAAI3K,MAAM,iBAAmB8K,GAErD,IAAKP,EAAanJ,QAAQrB,GACxB,MAAM,IAAIC,MAAM,oBAAsBD,GAGxC,OAAIA,GAAW,GAAKA,EAAU,GAAW+K,EAAKH,OAAO,GAC5C5K,EAAU,GAAW+K,EAAKH,OAAO,GACnCG,EAAKH,OAAO,EACrB,EAQA3J,EAAA+J,mBAA6B,SAA6BC,GACxD,OAAIR,EAAMH,YAAYW,GAAiBhK,EAAQ6I,QACtCW,EAAMF,iBAAiBU,GAAiBhK,EAAQ8I,aAChDU,EAAMN,UAAUc,GAAiBhK,EAAQyI,MACtCzI,EAAQ4I,IACtB,EAQA5I,EAAAiK,SAAmB,SAAmBH,GACpC,GAAIA,GAAQA,EAAKJ,GAAI,OAAOI,EAAKJ,GACjC,MAAM,IAAI1K,MAAM,eAClB,EAQAgB,EAAAI,QAAkB,SAAkB0J,GAClC,OAAOA,GAAQA,EAAK/J,KAAO+J,EAAKH,MAClC,EAqCA3J,EAAAM,KAAe,SAAeC,EAAOC,GACnC,GAAIR,EAAQI,QAAQG,GAClB,OAAOA,EAGT,IACE,OAnCJ,SAAqBE,GACnB,GAAsB,iBAAXA,EACT,MAAM,IAAIzB,MAAM,yBAKlB,OAFcyB,EAAOC,eAGnB,IAAK,UACH,OAAOV,EAAQ6I,QACjB,IAAK,eACH,OAAO7I,EAAQ8I,aACjB,IAAK,QACH,OAAO9I,EAAQyI,MACjB,IAAK,OACH,OAAOzI,EAAQ4I,KACjB,QACE,MAAM,IAAI5J,MAAM,iBAAmByB,GAEzC,CAgBWE,CAAWJ,EACtB,OAAWK,GACP,OAAOJ,CACX,CACA,kBCtKA,MAAM0J,EAAQ7H,EACR8H,EAASV,EACT5D,EAAUuE,EACVC,EAAOC,EACPf,EAAegB,EAIfC,EAAUN,EAAMhL,YADT,MAab,SAASuL,EAAsBX,EAAM/K,GAEnC,OAAOsL,EAAKR,sBAAsBC,EAAM/K,GAAW,CACrD,CAEA,SAAS2L,EAA2BC,EAAU5L,GAC5C,IAAI6L,EAAY,EAOhB,OALAD,EAASE,QAAQ,SAAU1L,GACzB,MAAM2L,EAAeL,EAAqBtL,EAAK2K,KAAM/K,GACrD6L,GAAaE,EAAe3L,EAAK4L,eACrC,GAESH,CACT,CAqBA5K,EAAAM,KAAe,SAAeC,EAAOC,GACnC,OAAI+I,EAAanJ,QAAQG,GAChByD,SAASzD,EAAO,IAGlBC,CACT,EAWAR,EAAAgL,YAAsB,SAAsBjM,EAASmH,EAAsB4D,GACzE,IAAKP,EAAanJ,QAAQrB,GACxB,MAAM,IAAIC,MAAM,gCAIE,IAAT8K,IAAsBA,EAAOO,EAAKzB,MAG7C,MAMMqC,EAA+D,GAN9Cf,EAAMjL,wBAAwBF,GAG5BoL,EAAOhE,uBAAuBpH,EAASmH,IAKhE,GAAI4D,IAASO,EAAKT,MAAO,OAAOqB,EAEhC,MAAMC,EAAaD,EAAyBR,EAAqBX,EAAM/K,GAGvE,OAAQ+K,GACN,KAAKO,EAAKxB,QACR,OAAO5H,KAAKC,MAAOgK,EAAa,GAAM,GAExC,KAAKb,EAAKvB,aACR,OAAO7H,KAAKC,MAAOgK,EAAa,GAAM,GAExC,KAAKb,EAAK5B,MACR,OAAOxH,KAAKC,MAAMgK,EAAa,IAEjC,KAAKb,EAAKzB,KACV,QACE,OAAO3H,KAAKC,MAAMgK,EAAa,GAErC,EAUAlL,EAAAmL,sBAAgC,SAAgChM,EAAM+G,GACpE,IAAIkF,EAEJ,MAAMC,EAAMxF,EAAQvF,KAAK4F,EAAsBL,EAAQ5F,GAEvD,GAAIqL,MAAMC,QAAQpM,GAAO,CACvB,GAAIA,EAAKU,OAAS,EAChB,OAzFN,SAAqC8K,EAAUzE,GAC7C,IAAA,IAASsF,EAAiB,EAAGA,GAAkB,GAAIA,IAEjD,GADed,EAA0BC,EAAUa,IACrCxL,EAAQgL,YAAYQ,EAAgBtF,EAAsBmE,EAAKT,OAC3E,OAAO4B,CAKb,CAgFaC,CAA2BtM,EAAMkM,GAG1C,GAAoB,IAAhBlM,EAAKU,OACP,OAAO,EAGTuL,EAAMjM,EAAK,EACf,MACIiM,EAAMjM,EAGR,OA/HF,SAAsC2K,EAAMjK,EAAQqG,GAClD,IAAA,IAASsF,EAAiB,EAAGA,GAAkB,GAAIA,IACjD,GAAI3L,GAAUG,EAAQgL,YAAYQ,EAAgBtF,EAAsB4D,GACtE,OAAO0B,CAKb,CAuHSE,CAA4BN,EAAItB,KAAMsB,EAAIO,YAAaN,EAChE,EAYArL,EAAA4L,eAAyB,SAAyB7M,GAChD,IAAKwK,EAAanJ,QAAQrB,IAAYA,EAAU,EAC9C,MAAM,IAAIC,MAAM,2BAGlB,IAAI6M,EAAI9M,GAAW,GAEnB,KAAOmL,EAAMhL,YAAY2M,GAAKrB,GAAW,GACvCqB,GAvJS,MAuJK3B,EAAMhL,YAAY2M,GAAKrB,EAGvC,OAAQzL,GAAW,GAAM8M,CAC3B,eClKA,MAAM3B,EAAQ7H,EAIRyJ,EAAU5B,EAAMhL,YAFT,MAcb6M,EAAAH,eAAyB,SAAyB1F,EAAsBpC,GACtE,MAAM3E,EAAS+G,EAAqBnG,KAAO,EAAK+D,EAChD,IAAI+H,EAAI1M,GAAQ,GAEhB,KAAO+K,EAAMhL,YAAY2M,GAAKC,GAAW,GACvCD,GAnBS,MAmBK3B,EAAMhL,YAAY2M,GAAKC,EAMvC,OAxBgB,OAwBP3M,GAAQ,GAAM0M,EACzB,WC5BA,MAAMxB,EAAOhI,EAEb,SAAS2J,EAAa7M,GACpBQ,KAAKmK,KAAOO,EAAKxB,QACjBlJ,KAAKR,KAAOA,EAAK8K,UACnB,CAEA+B,EAAYjB,cAAgB,SAAwBlL,GAClD,OAAO,GAAKoB,KAAKC,MAAMrB,EAAS,IAAOA,EAAS,EAAOA,EAAS,EAAK,EAAI,EAAK,EAChF,EAEAmM,EAAYnL,UAAU8K,UAAY,WAChC,OAAOhM,KAAKR,KAAKU,MACnB,EAEAmM,EAAYnL,UAAUkK,cAAgB,WACpC,OAAOiB,EAAYjB,cAAcpL,KAAKR,KAAKU,OAC7C,EAEAmM,EAAYnL,UAAUoL,MAAQ,SAAgBxK,GAC5C,IAAIJ,EAAG6K,EAAO3L,EAId,IAAKc,EAAI,EAAGA,EAAI,GAAK1B,KAAKR,KAAKU,OAAQwB,GAAK,EAC1C6K,EAAQvM,KAAKR,KAAKgN,OAAO9K,EAAG,GAC5Bd,EAAQyD,SAASkI,EAAO,IAExBzK,EAAUN,IAAIZ,EAAO,IAKvB,MAAM6L,EAAezM,KAAKR,KAAKU,OAASwB,EACpC+K,EAAe,IACjBF,EAAQvM,KAAKR,KAAKgN,OAAO9K,GACzBd,EAAQyD,SAASkI,EAAO,IAExBzK,EAAUN,IAAIZ,EAAsB,EAAf6L,EAAmB,GAE5C,EAEA,IAAAC,EAAiBL,EC1CjB,MAAM3B,EAAOhI,EAWPiK,EAAkB,CACtB,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC7C,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC5D,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC5D,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAG1C,SAASC,EAAkBpN,GACzBQ,KAAKmK,KAAOO,EAAKvB,aACjBnJ,KAAKR,KAAOA,CACd,CAEAoN,EAAiBxB,cAAgB,SAAwBlL,GACvD,OAAO,GAAKoB,KAAKC,MAAMrB,EAAS,GAAUA,EAAS,EAAd,CACvC,EAEA0M,EAAiB1L,UAAU8K,UAAY,WACrC,OAAOhM,KAAKR,KAAKU,MACnB,EAEA0M,EAAiB1L,UAAUkK,cAAgB,WACzC,OAAOwB,EAAiBxB,cAAcpL,KAAKR,KAAKU,OAClD,EAEA0M,EAAiB1L,UAAUoL,MAAQ,SAAgBxK,GACjD,IAAIJ,EAIJ,IAAKA,EAAI,EAAGA,EAAI,GAAK1B,KAAKR,KAAKU,OAAQwB,GAAK,EAAG,CAE7C,IAAId,EAAgD,GAAxC+L,EAAgBE,QAAQ7M,KAAKR,KAAKkC,IAG9Cd,GAAS+L,EAAgBE,QAAQ7M,KAAKR,KAAKkC,EAAI,IAG/CI,EAAUN,IAAIZ,EAAO,GACzB,CAIMZ,KAAKR,KAAKU,OAAS,GACrB4B,EAAUN,IAAImL,EAAgBE,QAAQ7M,KAAKR,KAAKkC,IAAK,EAEzD,EAEA,IAAAoL,EAAiBF,EC1DjB,MAAMlC,EAAOhI,EAEb,SAASqK,EAAUvN,GACjBQ,KAAKmK,KAAOO,EAAKzB,KAEfjJ,KAAKR,KADe,iBAAVA,GACE,IAAIwN,aAAc7E,OAAO3I,GAEzB,IAAIyC,WAAWzC,EAE/B,CAEAuN,EAAS3B,cAAgB,SAAwBlL,GAC/C,OAAgB,EAATA,CACT,EAEA6M,EAAS7L,UAAU8K,UAAY,WAC7B,OAAOhM,KAAKR,KAAKU,MACnB,EAEA6M,EAAS7L,UAAUkK,cAAgB,WACjC,OAAO2B,EAAS3B,cAAcpL,KAAKR,KAAKU,OAC1C,EAEA6M,EAAS7L,UAAUoL,MAAQ,SAAUxK,GACnC,IAAA,IAASJ,EAAI,EAAGuL,EAAIjN,KAAKR,KAAKU,OAAQwB,EAAIuL,EAAGvL,IAC3CI,EAAUN,IAAIxB,KAAKR,KAAKkC,GAAI,EAEhC,EAEA,IAAAwL,EAAiBH,EC7BjB,MAAMrC,EAAOhI,EACP6H,EAAQT,EAEd,SAASqD,EAAW3N,GAClBQ,KAAKmK,KAAOO,EAAK5B,MACjB9I,KAAKR,KAAOA,CACd,CAEA2N,EAAU/B,cAAgB,SAAwBlL,GAChD,OAAgB,GAATA,CACT,EAEAiN,EAAUjM,UAAU8K,UAAY,WAC9B,OAAOhM,KAAKR,KAAKU,MACnB,EAEAiN,EAAUjM,UAAUkK,cAAgB,WAClC,OAAO+B,EAAU/B,cAAcpL,KAAKR,KAAKU,OAC3C,EAEAiN,EAAUjM,UAAUoL,MAAQ,SAAUxK,GACpC,IAAIJ,EAKJ,IAAKA,EAAI,EAAGA,EAAI1B,KAAKR,KAAKU,OAAQwB,IAAK,CACrC,IAAId,EAAQ2J,EAAM1K,OAAOG,KAAKR,KAAKkC,IAGnC,GAAId,GAAS,OAAUA,GAAS,MAE9BA,GAAS,UAGf,MAAeA,GAAS,OAAUA,GAAS,OAIrC,MAAM,IAAIvB,MACR,2BAA6BW,KAAKR,KAAKkC,GAAK,qCAH9Cd,GAAS,KAKf,CAIIA,EAAkC,KAAvBA,IAAU,EAAK,MAAyB,IAARA,GAG3CkB,EAAUN,IAAIZ,EAAO,GACzB,CACA,EAEA,IC9BIwM,GD8BJC,GAAiBF,qBC8Gf9M,QA5IE+M,GAAW,CACbE,6BAA8B,SAASC,EAAOC,EAAGtB,GAG/C,IAAIuB,EAAe,CAAA,EAIfC,EAAQ,CAAA,EACZA,EAAMF,GAAK,EAMX,IAGIG,EACAC,EAAGC,EACHC,EACAC,EAEAC,EACAC,EATAC,EAAOd,GAASe,cAAcC,OAWlC,IAVAF,EAAKrM,KAAK2L,EAAG,IAULU,EAAKG,SAaX,IAAKR,KATLD,GADAD,EAAUO,EAAKI,OACH1N,MACZkN,EAAiBH,EAAQY,KAGzBR,EAAiBR,EAAMK,IAAM,CAAA,EAMvBG,EAAeS,eAAeX,KAOhCG,EAAgCF,EALpBC,EAAeF,GAW3BI,EAAiBP,EAAMG,SACY,IAAbH,EAAMG,IACTI,EAAiBD,KAClCN,EAAMG,GAAKG,EACXE,EAAKrM,KAAKgM,EAAGG,GACbP,EAAaI,GAAKD,IAM1B,QAAiB,IAAN1B,QAAyC,IAAbwB,EAAMxB,GAAoB,CAC/D,IAAIuC,EAAM,CAAC,8BAA+BjB,EAAG,OAAQtB,EAAG,KAAKwC,KAAK,IAClE,MAAM,IAAIrP,MAAMoP,EACtB,CAEI,OAAOhB,CACX,EAEEkB,4CAA6C,SAASlB,EAAcvB,GAIlE,IAHA,IAAI0C,EAAQ,GACRhB,EAAI1B,EAED0B,GACLgB,EAAM/M,KAAK+L,GACGH,EAAaG,GAC3BA,EAAIH,EAAaG,GAGnB,OADAgB,EAAM5L,UACC4L,CACX,EAEEC,UAAW,SAAStB,EAAOC,EAAGtB,GAC5B,IAAIuB,EAAeL,GAASE,6BAA6BC,EAAOC,EAAGtB,GACnE,OAAOkB,GAASuB,4CACdlB,EAAcvB,EACpB,EAKEiC,cAAe,CACbC,KAAM,SAAUU,GACd,IAEIC,EAFAC,EAAI5B,GAASe,cACbc,EAAI,CAAA,EAGR,IAAKF,KADLD,EAAOA,GAAQ,CAAA,EACHE,EACNA,EAAER,eAAeO,KACnBE,EAAEF,GAAOC,EAAED,IAKf,OAFAE,EAAEC,MAAQ,GACVD,EAAEE,OAASL,EAAKK,QAAUH,EAAEI,eACrBH,CACb,EAEIG,eAAgB,SAAUC,EAAGC,GAC3B,OAAOD,EAAEd,KAAOe,EAAEf,IACxB,EAMI1M,KAAM,SAAUjB,EAAO2N,GACrB,IAAIgB,EAAO,CAAC3O,QAAc2N,QAC1BvO,KAAKkP,MAAMrN,KAAK0N,GAChBvP,KAAKkP,MAAMM,KAAKxP,KAAKmP,OAC3B,EAKIb,IAAK,WACH,OAAOtO,KAAKkP,MAAMO,OACxB,EAEIpB,MAAO,WACL,OAA6B,IAAtBrO,KAAKkP,MAAMhP,MACxB,mCC5JA,MAAMwK,EAAOhI,EACP2J,EAAcvC,EACd8C,EAAmBnC,EACnBsC,EAAWpC,EACXwC,EAAYvC,GACZf,EAAQ6F,EACRnF,EAAQoF,EACRvC,EAAWwC,GAQjB,SAASC,EAAqBrG,GAC5B,OAAOsG,SAASC,mBAAmBvG,IAAMtJ,MAC3C,CAUA,SAAS8P,EAAanH,EAAOsB,EAAMX,GACjC,MAAMwB,EAAW,GACjB,IAAIvD,EAEJ,KAAsC,QAA9BA,EAASoB,EAAMoH,KAAKzG,KAC1BwB,EAASnJ,KAAK,CACZrC,KAAMiI,EAAO,GACbrG,MAAOqG,EAAOrG,MACd+I,KAAMA,EACNjK,OAAQuH,EAAO,GAAGvH,SAItB,OAAO8K,CACT,CASA,SAASkF,EAAuB7F,GAC9B,MAAM8F,EAAUH,EAAYnG,EAAMX,QAASwB,EAAKxB,QAASmB,GACnD+F,EAAeJ,EAAYnG,EAAMV,aAAcuB,EAAKvB,aAAckB,GACxE,IAAIgG,EACAC,EAEA/F,EAAM3K,sBACRyQ,EAAWL,EAAYnG,EAAMZ,KAAMyB,EAAKzB,KAAMoB,GAC9CiG,EAAYN,EAAYnG,EAAMf,MAAO4B,EAAK5B,MAAOuB,KAEjDgG,EAAWL,EAAYnG,EAAMb,WAAY0B,EAAKzB,KAAMoB,GACpDiG,EAAY,IAKd,OAFaH,EAAQI,OAAOH,EAAcC,EAAUC,GAGjDd,KAAK,SAAUgB,EAAIC,GAClB,OAAOD,EAAGpP,MAAQqP,EAAGrP,KAC3B,GACKsP,IAAI,SAAUC,GACb,MAAO,CACLnR,KAAMmR,EAAInR,KACV2K,KAAMwG,EAAIxG,KACVjK,OAAQyQ,EAAIzQ,OAEpB,EACA,CAUA,SAAS0Q,EAAsB1Q,EAAQiK,GACrC,OAAQA,GACN,KAAKO,EAAKxB,QACR,OAAOmD,EAAYjB,cAAclL,GACnC,KAAKwK,EAAKvB,aACR,OAAOyD,EAAiBxB,cAAclL,GACxC,KAAKwK,EAAK5B,MACR,OAAOqE,EAAU/B,cAAclL,GACjC,KAAKwK,EAAKzB,KACR,OAAO8D,EAAS3B,cAAclL,GAEpC,CAsIA,SAAS2Q,EAAoBrR,EAAMsR,GACjC,IAAI3G,EACJ,MAAM4G,EAAWrG,EAAKN,mBAAmB5K,GAKzC,GAHA2K,EAAOO,EAAK/J,KAAKmQ,EAAWC,GAGxB5G,IAASO,EAAKzB,MAAQkB,EAAK/J,IAAM2Q,EAAS3Q,IAC5C,MAAM,IAAIf,MAAM,IAAMG,EAAO,iCACOkL,EAAKJ,SAASH,GAChD,0BAA4BO,EAAKJ,SAASyG,IAQ9C,OAJI5G,IAASO,EAAK5B,OAAUyB,EAAM3K,uBAChCuK,EAAOO,EAAKzB,MAGNkB,GACN,KAAKO,EAAKxB,QACR,OAAO,IAAImD,EAAY7M,GAEzB,KAAKkL,EAAKvB,aACR,OAAO,IAAIyD,EAAiBpN,GAE9B,KAAKkL,EAAK5B,MACR,OAAO,IAAIqE,EAAU3N,GAEvB,KAAKkL,EAAKzB,KACR,OAAO,IAAI8D,EAASvN,GAE1B,CAiBAa,EAAA2Q,UAAoB,SAAoBC,GACtC,OAAOA,EAAMC,OAAO,SAAUC,EAAK1F,GAOjC,MANmB,iBAARA,EACT0F,EAAItP,KAAKgP,EAAmBpF,EAAK,OACxBA,EAAIjM,MACb2R,EAAItP,KAAKgP,EAAmBpF,EAAIjM,KAAMiM,EAAItB,OAGrCgH,CACX,EAAK,GACL,EAUA9Q,EAAAW,WAAqB,SAAqBxB,EAAMJ,GAC9C,MAEMwP,EAxKR,SAAqBwC,GACnB,MAAMxC,EAAQ,GACd,IAAA,IAASlN,EAAI,EAAGA,EAAI0P,EAAKlR,OAAQwB,IAAK,CACpC,MAAM+J,EAAM2F,EAAK1P,GAEjB,OAAQ+J,EAAItB,MACV,KAAKO,EAAKxB,QACR0F,EAAM/M,KAAK,CAAC4J,EACV,CAAEjM,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKvB,aAAcjJ,OAAQuL,EAAIvL,QACvD,CAAEV,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQuL,EAAIvL,UAEjD,MACF,KAAKwK,EAAKvB,aACRyF,EAAM/M,KAAK,CAAC4J,EACV,CAAEjM,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQuL,EAAIvL,UAEjD,MACF,KAAKwK,EAAK5B,MACR8F,EAAM/M,KAAK,CAAC4J,EACV,CAAEjM,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQ2P,EAAoBpE,EAAIjM,SAErE,MACF,KAAKkL,EAAKzB,KACR2F,EAAM/M,KAAK,CACT,CAAErC,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQ2P,EAAoBpE,EAAIjM,SAG7E,CAEE,OAAOoP,CACT,CA0IgByC,CAFDnB,EAAsB1Q,EAAM+K,EAAM3K,uBAGzC2N,EA7HR,SAAqBqB,EAAOxP,GAC1B,MAAMkS,EAAQ,CAAA,EACR/D,EAAQ,CAAEjF,MAAO,CAAA,GACvB,IAAIiJ,EAAc,CAAC,SAEnB,IAAA,IAAS7P,EAAI,EAAGA,EAAIkN,EAAM1O,OAAQwB,IAAK,CACrC,MAAM8P,EAAY5C,EAAMlN,GAClB+P,EAAiB,GAEvB,IAAA,IAASpO,EAAI,EAAGA,EAAImO,EAAUtR,OAAQmD,IAAK,CACzC,MAAMqO,EAAOF,EAAUnO,GACjB0L,EAAM,GAAKrN,EAAI2B,EAErBoO,EAAe5P,KAAKkN,GACpBuC,EAAMvC,GAAO,CAAE2C,OAAYC,UAAW,GACtCpE,EAAMwB,GAAO,CAAA,EAEb,IAAA,IAASjI,EAAI,EAAGA,EAAIyK,EAAYrR,OAAQ4G,IAAK,CAC3C,MAAM8K,EAAaL,EAAYzK,GAE3BwK,EAAMM,IAAeN,EAAMM,GAAYF,KAAKvH,OAASuH,EAAKvH,MAC5DoD,EAAMqE,GAAY7C,GAChB6B,EAAqBU,EAAMM,GAAYD,UAAYD,EAAKxR,OAAQwR,EAAKvH,MACrEyG,EAAqBU,EAAMM,GAAYD,UAAWD,EAAKvH,MAEzDmH,EAAMM,GAAYD,WAAaD,EAAKxR,SAEhCoR,EAAMM,OAAmBA,GAAYD,UAAYD,EAAKxR,QAE1DqN,EAAMqE,GAAY7C,GAAO6B,EAAqBc,EAAKxR,OAAQwR,EAAKvH,MAC9D,EAAIO,EAAKR,sBAAsBwH,EAAKvH,KAAM/K,GAEtD,CACA,CAEImS,EAAcE,CAClB,CAEE,IAAA,IAAS3K,EAAI,EAAGA,EAAIyK,EAAYrR,OAAQ4G,IACtCyG,EAAMgE,EAAYzK,IAAI+K,IAAM,EAG9B,MAAO,CAAEnB,IAAKnD,EAAO+D,QACvB,CAkFgBQ,CAAWlD,EAAOxP,GAC1B2S,EAAO3E,EAASyB,UAAUtB,EAAMmD,IAAK,QAAS,OAE9CsB,EAAgB,GACtB,IAAA,IAAStQ,EAAI,EAAGA,EAAIqQ,EAAK7R,OAAS,EAAGwB,IACnCsQ,EAAcnQ,KAAK0L,EAAM+D,MAAMS,EAAKrQ,IAAIgQ,MAG1C,OAAOrR,EAAQ2Q,UA9MjB,SAAwBI,GACtB,OAAOA,EAAKF,OAAO,SAAUC,EAAKc,GAChC,MAAMC,EAAUf,EAAIjR,OAAS,GAAK,EAAIiR,EAAIA,EAAIjR,OAAS,GAAK,KAC5D,OAAIgS,GAAWA,EAAQ/H,OAAS8H,EAAK9H,MACnCgH,EAAIA,EAAIjR,OAAS,GAAGV,MAAQyS,EAAKzS,KAC1B2R,IAGTA,EAAItP,KAAKoQ,GACFd,EACX,EAAK,GACL,CAmM2BgB,CAAcH,GACzC,EAYA3R,EAAA+R,SAAmB,SAAmB5S,GACpC,OAAOa,EAAQ2Q,UACbd,EAAsB1Q,EAAM+K,EAAM3K,sBAEtC,MCzUA,MAAM2K,GAAQ7H,EACRwD,GAAU4D,EACV/J,GAAY0K,EACZ1I,GAAY4I,EACZ0H,GAAmBzH,EACnB0H,GAAgB5C,EAChB6C,GAAc5C,EACdnF,GAASoF,EACT5H,GAAqBwK,EACrBC,GAAUC,EACVC,GAAaC,EACblI,GAAOmI,EACPC,GAAWC,EAqIjB,SAASC,GAAiBC,EAAQ1M,EAAsBrC,GACtD,MAAMlC,EAAOiR,EAAOjR,KACdkR,EAAOP,GAAW1G,eAAe1F,EAAsBrC,GAC7D,IAAIxC,EAAG4F,EAEP,IAAK5F,EAAI,EAAGA,EAAI,GAAIA,IAClB4F,EAA4B,IAApB4L,GAAQxR,EAAK,GAGjBA,EAAI,EACNuR,EAAO9Q,IAAIT,EAAG,EAAG4F,GAAK,GACb5F,EAAI,EACbuR,EAAO9Q,IAAIT,EAAI,EAAG,EAAG4F,GAAK,GAE1B2L,EAAO9Q,IAAIH,EAAO,GAAKN,EAAG,EAAG4F,GAAK,GAIhC5F,EAAI,EACNuR,EAAO9Q,IAAI,EAAGH,EAAON,EAAI,EAAG4F,GAAK,GACxB5F,EAAI,EACbuR,EAAO9Q,IAAI,EAAG,GAAKT,EAAI,EAAI,EAAG4F,GAAK,GAEnC2L,EAAO9Q,IAAI,EAAG,GAAKT,EAAI,EAAG4F,GAAK,GAKnC2L,EAAO9Q,IAAIH,EAAO,EAAG,EAAG,GAAG,EAC7B,CAwDA,SAASmR,GAAY/T,EAASmH,EAAsByE,GAElD,MAAM/K,EAAS,IAAIF,GAEnBiL,EAASE,QAAQ,SAAU1L,GAEzBS,EAAOuB,IAAIhC,EAAK2K,KAAK/J,IAAK,GAS1BH,EAAOuB,IAAIhC,EAAKwM,YAAatB,GAAKR,sBAAsB1K,EAAK2K,KAAM/K,IAGnEI,EAAK8M,MAAMrM,EACf,GAGE,MAEMqL,EAA+D,GAF9Cf,GAAMjL,wBAAwBF,GAC5BoL,GAAOhE,uBAAuBpH,EAASmH,IAiBhE,IATItG,EAAO2B,kBAAoB,GAAK0J,GAClCrL,EAAOuB,IAAI,EAAG,GAQTvB,EAAO2B,kBAAoB,GAAM,GACtC3B,EAAO0B,OAAO,GAOhB,MAAMyR,GAAiB9H,EAAyBrL,EAAO2B,mBAAqB,EAC5E,IAAA,IAASF,EAAI,EAAGA,EAAI0R,EAAe1R,IACjCzB,EAAOuB,IAAIE,EAAI,EAAI,GAAO,IAAM,GAGlC,OAYF,SAA0BI,EAAW1C,EAASmH,GAE5C,MAAM8M,EAAiB9I,GAAMjL,wBAAwBF,GAG/CkU,EAAmB9I,GAAOhE,uBAAuBpH,EAASmH,GAG1DgN,EAAqBF,EAAiBC,EAGtCE,EAAgBhJ,GAAOlE,eAAelH,EAASmH,GAG/CkN,EAAiBJ,EAAiBG,EAClCE,EAAiBF,EAAgBC,EAEjCE,EAAyBrS,KAAKC,MAAM8R,EAAiBG,GAErDI,EAAwBtS,KAAKC,MAAMgS,EAAqBC,GACxDK,EAAwBD,EAAwB,EAGhDE,EAAUH,EAAyBC,EAGnCG,EAAK,IAAI/L,GAAmB8L,GAElC,IAAIpM,EAAS,EACb,MAAMsM,EAAS,IAAIrI,MAAM6H,GACnBS,EAAS,IAAItI,MAAM6H,GACzB,IAAIU,EAAc,EAClB,MAAMjU,EAAS,IAAIgC,WAAWH,EAAU7B,QAGxC,IAAA,IAASqP,EAAI,EAAGA,EAAIkE,EAAelE,IAAK,CACtC,MAAM6E,EAAW7E,EAAIoE,EAAiBE,EAAwBC,EAG9DG,EAAO1E,GAAKrP,EAAO0H,MAAMD,EAAQA,EAASyM,GAG1CF,EAAO3E,GAAKyE,EAAG5L,OAAO6L,EAAO1E,IAE7B5H,GAAUyM,EACVD,EAAc5S,KAAK8S,IAAIF,EAAaC,EACxC,CAIE,MAAM3U,EAAO,IAAIyC,WAAWoR,GAC5B,IACI3R,EAAG2S,EADHjT,EAAQ,EAIZ,IAAKM,EAAI,EAAGA,EAAIwS,EAAaxS,IAC3B,IAAK2S,EAAI,EAAGA,EAAIb,EAAea,IACzB3S,EAAIsS,EAAOK,GAAGnU,SAChBV,EAAK4B,KAAW4S,EAAOK,GAAG3S,IAMhC,IAAKA,EAAI,EAAGA,EAAIoS,EAASpS,IACvB,IAAK2S,EAAI,EAAGA,EAAIb,EAAea,IAC7B7U,EAAK4B,KAAW6S,EAAOI,GAAG3S,GAI9B,OAAOlC,CACT,CAnFS8U,CAAgBrU,EAAQb,EAASmH,EAC1C,CA6FA,SAASgO,GAAc/U,EAAMJ,EAASmH,EAAsBrC,GAC1D,IAAI8G,EAEJ,GAAIW,MAAMC,QAAQpM,GAChBwL,EAAW8H,GAAS9B,UAAUxR,OAClC,IAA6B,iBAATA,EAchB,MAAM,IAAIH,MAAM,gBAdmB,CACnC,IAAImV,EAAmBpV,EAEvB,IAAKoV,EAAkB,CACrB,MAAMC,EAAc3B,GAASV,SAAS5S,GAGtCgV,EAAmB/B,GAAQjH,sBAAsBiJ,EAAalO,EACpE,CAIIyE,EAAW8H,GAAS9R,WAAWxB,EAAMgV,GAAoB,GAC7D,CAEA,CAGE,MAAME,EAAcjC,GAAQjH,sBAAsBR,EAAUzE,GAG5D,IAAKmO,EACH,MAAM,IAAIrV,MAAM,2DAIlB,GAAKD,GAIP,GAAaA,EAAUsV,EACnB,MAAM,IAAIrV,MAAM,wHAE0CqV,EAAc,YANxEtV,EAAUsV,EAUZ,MAAMC,EAAWxB,GAAW/T,EAASmH,EAAsByE,GAGrD4J,EAAcrK,GAAMpL,cAAcC,GAClCyV,EAAU,IAAI9S,GAAU6S,GAgC9B,OAzZF,SAA6B3B,EAAQ7T,GACnC,MAAM4C,EAAOiR,EAAOjR,KACdmB,EAAMmP,GAAcrP,aAAa7D,GAEvC,IAAA,IAASsC,EAAI,EAAGA,EAAIyB,EAAIjD,OAAQwB,IAAK,CACnC,MAAMU,EAAMe,EAAIzB,GAAG,GACbW,EAAMc,EAAIzB,GAAG,GAEnB,IAAA,IAAS2S,GAAI,EAAIA,GAAK,EAAGA,IACvB,KAAIjS,EAAMiS,IAAK,GAAMrS,GAAQI,EAAMiS,GAEnC,IAAA,IAASS,GAAI,EAAIA,GAAK,EAAGA,IACnBzS,EAAMyS,IAAK,GAAM9S,GAAQK,EAAMyS,IAE9BT,GAAK,GAAKA,GAAK,IAAY,IAANS,GAAiB,IAANA,IAClCA,GAAK,GAAKA,GAAK,IAAY,IAANT,GAAiB,IAANA,IAChCA,GAAK,GAAKA,GAAK,GAAKS,GAAK,GAAKA,GAAK,EACpC7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAM,GAEnC7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAO,GAI9C,CACA,CAoWEC,CAAmBF,EAASzV,GA3V9B,SAA6B6T,GAC3B,MAAMjR,EAAOiR,EAAOjR,KAEpB,IAAA,IAASqS,EAAI,EAAGA,EAAIrS,EAAO,EAAGqS,IAAK,CACjC,MAAMzT,EAAQyT,EAAI,GAAM,EACxBpB,EAAO9Q,IAAIkS,EAAG,EAAGzT,GAAO,GACxBqS,EAAO9Q,IAAI,EAAGkS,EAAGzT,GAAO,EAC5B,CACA,CAoVEoU,CAAmBH,GA1UrB,SAAgC5B,EAAQ7T,GACtC,MAAM+D,EAAMkP,GAAiBpP,aAAa7D,GAE1C,IAAA,IAASsC,EAAI,EAAGA,EAAIyB,EAAIjD,OAAQwB,IAAK,CACnC,MAAMU,EAAMe,EAAIzB,GAAG,GACbW,EAAMc,EAAIzB,GAAG,GAEnB,IAAA,IAAS2S,GAAI,EAAIA,GAAK,EAAGA,IACvB,IAAA,IAASS,GAAI,EAAIA,GAAK,EAAGA,KACb,IAANT,GAAkB,IAANA,IAAiB,IAANS,GAAkB,IAANA,GAC9B,IAANT,GAAiB,IAANS,EACZ7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAM,GAEnC7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAO,EAI9C,CACA,CAyTEG,CAAsBJ,EAASzV,GAM/B4T,GAAgB6B,EAAStO,EAAsB,GAE3CnH,GAAW,GAzTjB,SAA2B6T,EAAQ7T,GACjC,MAAM4C,EAAOiR,EAAOjR,KACdkR,EAAOT,GAAQxG,eAAe7M,GACpC,IAAIgD,EAAKC,EAAKiF,EAEd,IAAA,IAAS5F,EAAI,EAAGA,EAAI,GAAIA,IACtBU,EAAMd,KAAKC,MAAMG,EAAI,GACrBW,EAAMX,EAAI,EAAIM,EAAO,EAAI,EACzBsF,EAA4B,IAApB4L,GAAQxR,EAAK,GAErBuR,EAAO9Q,IAAIC,EAAKC,EAAKiF,GAAK,GAC1B2L,EAAO9Q,IAAIE,EAAKD,EAAKkF,GAAK,EAE9B,CA6SI4N,CAAiBL,EAASzV,GA/P9B,SAAoB6T,EAAQzT,GAC1B,MAAMwC,EAAOiR,EAAOjR,KACpB,IAAImT,GAAM,EACN/S,EAAMJ,EAAO,EACboT,EAAW,EACXC,EAAY,EAEhB,IAAA,IAAShT,EAAML,EAAO,EAAGK,EAAM,EAAGA,GAAO,EAGvC,IAFY,IAARA,GAAWA,MAEF,CACX,IAAA,IAASyS,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK7B,EAAOzQ,WAAWJ,EAAKC,EAAMyS,GAAI,CACpC,IAAIQ,GAAO,EAEPD,EAAY7V,EAAKU,SACnBoV,EAAiD,IAAvC9V,EAAK6V,KAAeD,EAAY,IAG5CnC,EAAO9Q,IAAIC,EAAKC,EAAMyS,EAAGQ,GACzBF,KAEiB,IAAbA,IACFC,IACAD,EAAW,EAEvB,CAKM,GAFAhT,GAAO+S,EAEH/S,EAAM,GAAKJ,GAAQI,EAAK,CAC1BA,GAAO+S,EACPA,GAAOA,EACP,KACR,CACA,CAEA,CA6NEI,CAAUV,EAASF,GAEfvQ,MAAMF,KAERA,EAAcqO,GAAY/M,YAAYqP,EACpC7B,GAAgBwC,KAAK,KAAMX,EAAStO,KAIxCgM,GAAYjN,UAAUpB,EAAa2Q,GAGnC7B,GAAgB6B,EAAStO,EAAsBrC,GAExC,CACL2Q,UACAzV,QAASA,EACTmH,qBAAsBA,EACtBrC,YAAaA,EACb8G,SAAUA,EAEd,CAWAyK,EAAAC,OAAiB,SAAiBlW,EAAMmW,GACtC,QAAoB,IAATnW,GAAiC,KAATA,EACjC,MAAM,IAAIH,MAAM,iBAGlB,IACID,EACA+E,EAFAoC,EAAuBL,GAAQ5F,EAenC,YAXuB,IAAZqV,IAETpP,EAAuBL,GAAQvF,KAAKgV,EAAQpP,qBAAsBL,GAAQ5F,GAC1ElB,EAAUqT,GAAQ9R,KAAKgV,EAAQvW,SAC/B+E,EAAOoO,GAAY5R,KAAKgV,EAAQzR,aAE5ByR,EAAQC,YACVrL,GAAM7K,kBAAkBiW,EAAQC,aAI7BrB,GAAa/U,EAAMJ,EAASmH,EAAsBpC,EAC3D,+BC9eA,SAAS0R,EAAUC,GAKjB,GAJmB,iBAARA,IACTA,EAAMA,EAAIxL,YAGO,iBAARwL,EACT,MAAM,IAAIzW,MAAM,yCAGlB,IAAI0W,EAAUD,EAAInO,QAAQgB,QAAQ,IAAK,IAAIqN,MAAM,IACjD,GAAID,EAAQ7V,OAAS,GAAwB,IAAnB6V,EAAQ7V,QAAgB6V,EAAQ7V,OAAS,EACjE,MAAM,IAAIb,MAAM,sBAAwByW,GAInB,IAAnBC,EAAQ7V,QAAmC,IAAnB6V,EAAQ7V,SAClC6V,EAAUpK,MAAMzK,UAAUqP,OAAO0F,MAAM,GAAIF,EAAQrF,IAAI,SAAUoE,GAC/D,MAAO,CAACA,EAAGA,EACjB,KAIyB,IAAnBiB,EAAQ7V,QAAc6V,EAAQlU,KAAK,IAAK,KAE5C,MAAMqU,EAAW7R,SAAS0R,EAAQrH,KAAK,IAAK,IAE5C,MAAO,CACL2F,EAAI6B,GAAY,GAAM,IACtBC,EAAID,GAAY,GAAM,IACtB5G,EAAI4G,GAAY,EAAK,IACrB7G,EAAc,IAAX6G,EACHJ,IAAK,IAAMC,EAAQpO,MAAM,EAAG,GAAG+G,KAAK,IAExC,CAEArO,EAAA+V,WAAqB,SAAqBT,GACnCA,IAASA,EAAU,CAAA,GACnBA,EAAQU,QAAOV,EAAQU,MAAQ,CAAA,GAEpC,MAAMC,OAAmC,IAAnBX,EAAQW,QACT,OAAnBX,EAAQW,QACRX,EAAQW,OAAS,EACf,EACAX,EAAQW,OAENC,EAAQZ,EAAQY,OAASZ,EAAQY,OAAS,GAAKZ,EAAQY,WAAQ,EAC/DC,EAAQb,EAAQa,OAAS,EAE/B,MAAO,CACLD,QACAC,MAAOD,EAAQ,EAAIC,EACnBF,SACAD,MAAO,CACLf,KAAMO,EAASF,EAAQU,MAAMf,MAAQ,aACrCmB,MAAOZ,EAASF,EAAQU,MAAMI,OAAS,cAEzCC,KAAMf,EAAQe,KACdC,aAAchB,EAAQgB,cAAgB,CAAA,EAE1C,EAEAtW,EAAAuW,SAAmB,SAAmBC,EAAQ/H,GAC5C,OAAOA,EAAKyH,OAASzH,EAAKyH,OAASM,EAAuB,EAAd/H,EAAKwH,OAC7CxH,EAAKyH,OAASM,EAAuB,EAAd/H,EAAKwH,QAC5BxH,EAAK0H,KACX,EAEAnW,EAAAyW,cAAwB,SAAwBD,EAAQ/H,GACtD,MAAM0H,EAAQnW,EAAQuW,SAASC,EAAQ/H,GACvC,OAAOxN,KAAKC,OAAOsV,EAAuB,EAAd/H,EAAKwH,QAAcE,EACjD,EAEAnW,EAAA0W,cAAwB,SAAwBC,EAASC,EAAInI,GAC3D,MAAM9M,EAAOiV,EAAGpC,QAAQ7S,KAClBxC,EAAOyX,EAAGpC,QAAQrV,KAClBgX,EAAQnW,EAAQuW,SAAS5U,EAAM8M,GAC/BoI,EAAa5V,KAAKC,OAAOS,EAAqB,EAAd8M,EAAKwH,QAAcE,GACnDW,EAAerI,EAAKwH,OAASE,EAC7BY,EAAU,CAACtI,EAAKuH,MAAMI,MAAO3H,EAAKuH,MAAMf,MAE9C,IAAA,IAAS5T,EAAI,EAAGA,EAAIwV,EAAYxV,IAC9B,IAAA,IAAS2B,EAAI,EAAGA,EAAI6T,EAAY7T,IAAK,CACnC,IAAIgU,EAAgC,GAAtB3V,EAAIwV,EAAa7T,GAC3BiU,EAAUxI,EAAKuH,MAAMI,MAEzB,GAAI/U,GAAKyV,GAAgB9T,GAAK8T,GAC5BzV,EAAIwV,EAAaC,GAAgB9T,EAAI6T,EAAaC,EAAc,CAGhEG,EAAUF,EAAQ5X,EAFL8B,KAAKC,OAAOG,EAAIyV,GAAgBX,GAEfxU,EADjBV,KAAKC,OAAO8B,EAAI8T,GAAgBX,IACA,EAAI,EACzD,CAEMQ,EAAQK,KAAYC,EAAQjD,EAC5B2C,EAAQK,KAAYC,EAAQnB,EAC5Ba,EAAQK,KAAYC,EAAQhI,EAC5B0H,EAAQK,GAAUC,EAAQjI,CAChC,CAEA,mBClGA,MAAM9E,EAAQ7H,GAoBdrC,EAAAkX,OAAiB,SAAiBC,EAAQC,EAAQ9B,GAChD,IAAI7G,EAAO6G,EACP+B,EAAWD,OAEK,IAAT3I,GAA0B2I,GAAWA,EAAOE,aACrD7I,EAAO2I,EACPA,OAAS,GAGNA,IACHC,EAlBJ,WACE,IACE,OAAOE,SAASC,cAAc,SAClC,OAAW5W,GACP,MAAM,IAAI5B,MAAM,uCACpB,CACA,CAYeyY,IAGbhJ,EAAOvE,EAAM6L,WAAWtH,GACxB,MAAM9M,EAAOuI,EAAMuM,cAAcU,EAAO3C,QAAQ7S,KAAM8M,GAEhDiJ,EAAML,EAASC,WAAW,MAC1BK,EAAQD,EAAIE,gBAAgBjW,EAAMA,GAMxC,OALAuI,EAAMwM,cAAciB,EAAMxY,KAAMgY,EAAQ1I,GApC1C,SAAsBiJ,EAAKN,EAAQzV,GACjC+V,EAAIG,UAAU,EAAG,EAAGT,EAAOlB,MAAOkB,EAAOU,QAEpCV,EAAOW,QAAOX,EAAOW,MAAQ,CAAA,GAClCX,EAAOU,OAASnW,EAChByV,EAAOlB,MAAQvU,EACfyV,EAAOW,MAAMD,OAASnW,EAAO,KAC7ByV,EAAOW,MAAM7B,MAAQvU,EAAO,IAC9B,CA8BEqW,CAAYN,EAAKL,EAAU1V,GAC3B+V,EAAIO,aAAaN,EAAO,EAAG,GAEpBN,CACT,EAEArX,EAAAkY,gBAA0B,SAA0Bf,EAAQC,EAAQ9B,GAClE,IAAI7G,EAAO6G,OAES,IAAT7G,GAA0B2I,GAAWA,EAAOE,aACrD7I,EAAO2I,EACPA,OAAS,GAGN3I,IAAMA,EAAO,CAAA,GAElB,MAAM4I,EAAWrX,EAAQkX,OAAOC,EAAQC,EAAQ3I,GAE1C4H,EAAO5H,EAAK4H,MAAQ,YACpBC,EAAe7H,EAAK6H,cAAgB,CAAA,EAE1C,OAAOe,EAASc,UAAU9B,EAAMC,EAAa8B,QAC/C,iBC9DA,MAAMlO,GAAQ7H,GAEd,SAASgW,GAAgBrC,EAAOsC,GAC9B,MAAMC,EAAQvC,EAAMhH,EAAI,IAClB7F,EAAMmP,EAAS,KAAOtC,EAAMP,IAAM,IAExC,OAAO8C,EAAQ,EACXpP,EAAM,IAAMmP,EAAS,aAAeC,EAAMC,QAAQ,GAAGlR,MAAM,GAAK,IAChE6B,CACN,CAEA,SAASsP,GAAQC,EAAKpS,EAAGM,GACvB,IAAIuC,EAAMuP,EAAMpS,EAGhB,YAFiB,IAANM,IAAmBuC,GAAO,IAAMvC,GAEpCuC,CACT,CAsCAwP,GAAAzB,OAAiB,SAAiBC,EAAQ7B,EAASsD,GACjD,MAAMnK,EAAOvE,GAAM6L,WAAWT,GACxB3T,EAAOwV,EAAO3C,QAAQ7S,KACtBxC,EAAOgY,EAAO3C,QAAQrV,KACtB0Z,EAAalX,EAAqB,EAAd8M,EAAKwH,OAEzB6C,EAAMrK,EAAKuH,MAAMI,MAAMpH,EAEzB,SAAWqJ,GAAe5J,EAAKuH,MAAMI,MAAO,QAC5C,YAAcyC,EAAa,IAAMA,EAAa,SAF9C,GAIEnH,EACJ,SAAW2G,GAAe5J,EAAKuH,MAAMf,KAAM,UAC3C,OAjDJ,SAAmB9V,EAAMwC,EAAMsU,GAC7B,IAAIvE,EAAO,GACPqH,EAAS,EACTC,GAAS,EACTC,EAAa,EAEjB,IAAA,IAAS5X,EAAI,EAAGA,EAAIlC,EAAKU,OAAQwB,IAAK,CACpC,MAAMW,EAAMf,KAAKC,MAAMG,EAAIM,GACrBI,EAAMd,KAAKC,MAAMG,EAAIM,GAEtBK,GAAQgX,IAAQA,GAAS,GAE1B7Z,EAAKkC,IACP4X,IAEM5X,EAAI,GAAKW,EAAM,GAAK7C,EAAKkC,EAAI,KACjCqQ,GAAQsH,EACJP,GAAO,IAAKzW,EAAMiU,EAAQ,GAAMlU,EAAMkU,GACtCwC,GAAO,IAAKM,EAAQ,GAExBA,EAAS,EACTC,GAAS,GAGLhX,EAAM,EAAIL,GAAQxC,EAAKkC,EAAI,KAC/BqQ,GAAQ+G,GAAO,IAAKQ,GACpBA,EAAa,IAGfF,GAEN,CAEE,OAAOrH,CACT,CAeawH,CAAS/Z,EAAMwC,EAAM8M,EAAKwH,QAAU,MAEzCkD,EAAU,gBAAuBN,EAAa,IAAMA,EAAa,IAIjEF,EAAS,4CAFAlK,EAAKyH,MAAa,UAAYzH,EAAKyH,MAAQ,aAAezH,EAAKyH,MAAQ,KAA1D,IAEwCiD,EAAU,iCAAmCL,EAAKpH,EAAO,WAM7H,MAJkB,mBAAPkH,GACTA,EAAG,KAAMD,GAGJA,CACT,EC/EA,MAAMS,GCGW,WACf,MAA0B,mBAAZC,SAA0BA,QAAQxY,WAAawY,QAAQxY,UAAUyY,IACjF,EDHMC,GAAS9P,EACT+P,GAAiBpP,GACjBqP,GAAcnP,GAEpB,SAASoP,GAAcC,EAAYvC,EAAQwC,EAAMnL,EAAMmK,GACrD,MAAMiB,EAAO,GAAGvS,MAAMwS,KAAKC,UAAW,GAChCC,EAAUH,EAAKha,OACfoa,EAA2C,mBAAtBJ,EAAKG,EAAU,GAE1C,IAAKC,IAAgBb,KACnB,MAAM,IAAIpa,MAAM,sCAGlB,IAAIib,EAoBG,CACL,GAAID,EAAU,EACZ,MAAM,IAAIhb,MAAM,8BAYlB,OATgB,IAAZgb,GACFJ,EAAOxC,EACPA,EAAS3I,OAAO,GACK,IAAZuL,GAAkB5C,EAAOE,aAClC7I,EAAOmL,EACPA,EAAOxC,EACPA,OAAS,GAGJ,IAAIiC,QAAQ,SAAUa,EAASC,GACpC,IACE,MAAMhb,EAAOoa,GAAOlE,OAAOuE,EAAMnL,GACjCyL,EAAQP,EAAWxa,EAAMiY,EAAQ3I,GACzC,OAAe7N,GACPuZ,EAAOvZ,EACf,CACA,EACA,CAzCI,GAAIoZ,EAAU,EACZ,MAAM,IAAIhb,MAAM,8BAGF,IAAZgb,GACFpB,EAAKgB,EACLA,EAAOxC,EACPA,EAAS3I,OAAO,GACK,IAAZuL,IACL5C,EAAOE,iBAA4B,IAAPsB,GAC9BA,EAAKnK,EACLA,OAAO,IAEPmK,EAAKnK,EACLA,EAAOmL,EACPA,EAAOxC,EACPA,OAAS,IA2Bf,IACE,MAAMjY,EAAOoa,GAAOlE,OAAOuE,EAAMnL,GACjCmK,EAAG,KAAMe,EAAWxa,EAAMiY,EAAQ3I,GACtC,OAAW7N,GACPgY,EAAGhY,EACP,CACA,CAEAwZ,EAAA/E,OAAiBkE,GAAOlE,OACxB+E,EAAAC,SAAmBX,GAAavE,KAAK,KAAMqE,GAAetC,QAC1DkD,EAAAjC,UAAoBuB,GAAavE,KAAK,KAAMqE,GAAetB,iBAG3DkC,EAAAnQ,SAAmByP,GAAavE,KAAK,KAAM,SAAUhW,EAAMmb,EAAG7L,GAC5D,OAAOgL,GAAYvC,OAAO/X,EAAMsP,EAClC,GEjEY,MAyBC8L,GAAoBC,MAAOZ,EAAMa,EAAkB,UAAWC,EAAkB,aAC3F,IAWE,aAVwBnB,EAAOtP,SAAS2P,EAAM,CAC5CvD,KAAM,MACNH,MAAO,IACPD,OAAQ,EACR/P,qBAAsB,IACtB8P,MAAO,CACLf,KAAMwF,EACNrE,MAAOsE,IAIb,OAASC,GAEP,OADAC,QAAQD,MAAM,gCAAiCA,GACxC,IACT,GAgFWE,GAAkB,CAACC,EAAKC,EAAYzU,EAAGM,EAAGoU,IAC9C,IAAI3B,QAASa,IAElB,MAAM9C,EAASG,SAASC,cAAc,UAChCE,EAAMN,EAAOE,WAAW,MAG9BF,EAAOlB,MAAQ4E,EAAI5E,MACnBkB,EAAOU,OAASgD,EAAIhD,OAGpBJ,EAAIuD,UAAUH,EAAK,EAAG,GAGtB,MAAMI,EAAYxD,EAAIyD,aAAa,EAAG,EAAG/D,EAAOlB,MAAOkB,EAAOU,QAGxD5L,EAAQ8O,EAAOI,gBAAgB,6BAA8B,KAE7DjF,EAAQ4E,EAAa9Z,KAAK8S,IAAI+G,EAAI5E,MAAO4E,EAAIhD,QACnD5L,EAAMmP,aAAa,YAAa,aAAa/U,EAAEkS,QAAQ,OAAO5R,EAAE4R,QAAQ,aAAarC,EAAMqC,QAAQ,OAGnG,MAAM8C,EAAara,KAAK8S,IAAI,EAAG9S,KAAKC,MAAMD,KAAKsa,IAAIT,EAAI5E,MAAO4E,EAAIhD,QAAU,KACtE3Y,EAAO+b,EAAU/b,KAEvB,IAAA,IAASyH,EAAI,EAAGA,EAAIkU,EAAIhD,OAAQlR,GAAK0U,EACnC,IAAA,IAAShV,EAAI,EAAGA,EAAIwU,EAAI5E,MAAO5P,GAAKgV,EAAY,CAC9C,MAAMva,EAA8B,GAArB6F,EAAIkU,EAAI5E,MAAQ5P,GACzB0N,EAAI7U,EAAK4B,GACT+U,EAAI3W,EAAK4B,EAAQ,GACjBkO,EAAI9P,EAAK4B,EAAQ,GAIvB,GAHU5B,EAAK4B,EAAQ,GAGf,MAAQiT,EAAI,GAAK8B,EAAI,GAAK7G,EAAI,GAAI,CACxC,MAAMuM,EAAOR,EAAOI,gBAAgB,6BAA8B,QAClEI,EAAKH,aAAa,IAAK/U,EAAEkS,QAAQ,IACjCgD,EAAKH,aAAa,IAAKzU,EAAE4R,QAAQ,IACjCgD,EAAKH,aAAa,QAASC,EAAW9C,QAAQ,IAC9CgD,EAAKH,aAAa,SAAUC,EAAW9C,QAAQ,IAC/CgD,EAAKH,aAAa,OAAQ,OAAOrH,MAAM8B,MAAM7G,MAC7C/C,EAAMuP,YAAYD,EACpB,CACF,CAGFtB,EAAQhO,KAWCwP,GAAgBlB,MAAOmB,EAAWC,EAAUC,EAAY,KAC5D,IAAIxC,QAASa,IAClB,MAAMY,EAAM,IAAIgB,MAEhBhB,EAAIiB,OAAS,KAEX,MACMf,GADS,IAAIgB,WACGC,gBAAgBN,EAAW,iBAC3CO,EAAalB,EAAOmB,gBAKpBC,EAAgCP,EAAY,IADnC,GAGTQ,EAAUD,EAAuBnG,EACjCqG,GAJS,GAIQD,GAAW,EAC5BE,GALS,GAKQF,GAAW,EAC5BG,EAASF,EAJA,EAKTG,EAASF,EALA,EAQTG,EAAW1B,EAAOI,gBAAgB,6BAA8B,QAWtE,GAVAsB,EAASrB,aAAa,IAAKiB,EAAK9D,QAAQ,IACxCkE,EAASrB,aAAa,IAAKkB,EAAK/D,QAAQ,IACxCkE,EAASrB,aAAa,QAASgB,EAAQ7D,QAAQ,IAC/CkE,EAASrB,aAAa,SAAUgB,EAAQ7D,QAAQ,IAChDkE,EAASrB,aAAa,OAAQ,WAG9Ba,EAAWT,YAAYiB,GAGnBd,EAASe,WAAW,sBAAuB,CAC7C/B,QAAQpU,IAAI,wBAEZ,MAAMoW,EAAe5B,EAAOI,gBAAgB,6BAA8B,SAC1EwB,EAAavB,aAAa,IAAKmB,EAAOhE,QAAQ,IAC9CoE,EAAavB,aAAa,IAAKoB,EAAOjE,QAAQ,IAC9CoE,EAAavB,aAAa,QAASe,EAAoB5D,QAAQ,IAC/DoE,EAAavB,aAAa,SAAUe,EAAoB5D,QAAQ,IAChEoE,EAAavB,aAAa,OAAQO,GAClCM,EAAWT,YAAYmB,GACvBhC,QAAQpU,IAAI,2BAGZ,MAAMqW,EAAa,IAAIC,cACvB5C,EAAQ2C,EAAWE,kBAAkBb,GACvC,MACEtB,QAAQpU,IAAI,2BAEZqU,GAAgBC,EAAKsB,EAAqBI,EAAQC,EAAQzB,GAAQ1B,KAAM0D,IACtEd,EAAWT,YAAYuB,GACvBpC,QAAQpU,IAAI,gCAGZ,MAAMqW,EAAa,IAAIC,cACvB5C,EAAQ2C,EAAWE,kBAAkBb,MACpCe,MAAOtC,IACRC,QAAQD,MAAM,wBAAyBA,GAEvC,MAAMkC,EAAa,IAAIC,cACvB5C,EAAQ2C,EAAWE,kBAAkBb,OAK3CpB,EAAIoC,QAAU,KACZtC,QAAQD,MAAM,+BACdT,EAAQyB,IAGVb,EAAIqC,IAAMvB,8BAxMkBpB,MAAO4C,EAAWxB,EAAUC,EAAY,KAC/D,IAAIxC,QAASa,IAClB,MAAM9C,EAASG,SAASC,cAAc,UAChCE,EAAMN,EAAOE,WAAW,MAG9BF,EAAOlB,MAAQ,IACfkB,EAAOU,OAAS,IAGhB,MAAMuF,EAAU,IAAIvB,MACdwB,EAAc,IAAIxB,MAExBuB,EAAQtB,OAAS,KAEfrE,EAAIuD,UAAUoC,EAAS,EAAG,EAAG,IAAK,KAElCC,EAAYvB,OAAS,KAEnB,MAAMK,EAA6BP,EAAY,IAAnB,IAItBQ,EAAUD,EAAuBnG,GACjCqG,GAAQ,IAAMD,GAAW,EACzBE,GAAQ,IAAMF,GAAW,EAG/B3E,EAAI6F,UAAY,UAChB7F,EAAI8F,SAASlB,EAAMC,EAAMF,EAASA,GAGlC,MAAMG,EAASF,EAVA,GAWTG,EAASF,EAXA,GAcf7E,EAAIuD,UAAUqC,EAAad,EAAQC,EAAQL,EAAqBA,GAGhElC,EAAQ9C,EAAOe,UAAU,eAI3BmF,EAAYJ,QAAU,KACpBtC,QAAQD,MAAM,8BACdT,EAAQkD,IAGVE,EAAYH,IAAMvB,GAIpByB,EAAQH,QAAU,KAChBtC,QAAQD,MAAM,yBACdT,EAAQkD,IAGVC,EAAQF,IAAMC,qCA+LS,CAACK,EAAYC,EAAW,gBACjD,IAAKD,EAEH,YADA7C,QAAQD,MAAM,8BAKhB,MAAMgD,EAAO,IAAIC,KAAK,CAACH,GAAa,CAAEpH,KAAM,kBACtCwH,EAAMC,IAAIC,gBAAgBJ,GAC1B3O,EAAIuI,SAASC,cAAc,KACjCxI,EAAEgP,KAAOH,EACT7O,EAAEiP,SAAWP,EACbnG,SAAS2G,KAAKzC,YAAYzM,GAC1BA,EAAEmP,QACF5G,SAAS2G,KAAKE,YAAYpP,GAC1B8O,IAAIO,gBAAgBR,oBAQQS,GACrB,IAAIjF,QAAQ,CAACa,EAASC,KAC3B,MAAMoE,EAAS,IAAIC,WACnBD,EAAOxC,OAAS,IAAM7B,EAAQqE,EAAOnX,QACrCmX,EAAOrB,QAAU/C,EACjBoE,EAAOE,cAAcH,iCA/DgB9D,MACvCZ,EACAgC,EAAW,KACXC,EAAY,GACZpB,EAAkB,UAClBC,EAAkB,aAElB,IAEE,MAAMiB,QAAkBpB,GAAkBX,EAAMa,EAAiBC,GAEjE,IAAKiB,EACH,OAAO,KAIT,GAAIC,EAAU,CACZhB,QAAQpU,IAAI,iCACZ,MAAMY,QAAesU,GAAcC,EAAWC,EAAUC,GAExD,OADAjB,QAAQpU,IAAI,4BACLY,CACT,CAEA,OAAOuU,CACT,OAAShB,GAEP,OADAC,QAAQD,MAAM,yCAA0CA,GACjD,IACT,oBAnS4BH,MAAOZ,EAAMa,EAAkB,UAAWC,EAAkB,aACxF,IAUE,aATsBnB,EAAOpB,UAAUyB,EAAM,CAC3C5D,MAAO,CACLf,KAAMwF,EACNrE,MAAOsE,GAETxE,MAAO,IACPD,OAAQ,EACR/P,qBAAsB,KAG1B,OAASyU,GAEP,OADAC,QAAQD,MAAM,4BAA6BA,GACpC,IACT,8CAkU+B,CAAC2D,EAAMI,EAAU,UAC3B,CAAC,aAAc,YAAa,YAAa,aAAc,iBAE1DC,SAASL,EAAKjI,MAO5BiI,EAAK3c,KAAO+c,EACP,CACLE,SAAS,EACTjE,MAAO,+BAA+B1Z,KAAK4d,MAAMH,EAAU,KAAO,WAI/D,CAAEE,SAAS,GAbT,CACLA,SAAS,EACTjE,MAAO","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]}
\ No newline at end of file
diff --git a/dist/qr-code-utils.umd.js b/dist/qr-code-utils.umd.js
new file mode 100644
index 0000000..373f9d0
--- /dev/null
+++ b/dist/qr-code-utils.umd.js
@@ -0,0 +1,2 @@
+!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self).QRCodeUtils={})}(this,function(t){"use strict";var e={},n={},r={};let o;const i=[0,26,44,70,100,134,172,196,242,292,346,404,466,532,581,655,733,815,901,991,1085,1156,1258,1364,1474,1588,1706,1828,1921,2051,2185,2323,2465,2611,2761,2876,3034,3196,3362,3532,3706];r.getSymbolSize=function(t){if(!t)throw new Error('"version" cannot be null or undefined');if(t<1||t>40)throw new Error('"version" should be in range from 1 to 40');return 4*t+17},r.getSymbolTotalCodewords=function(t){return i[t]},r.getBCHDigit=function(t){let e=0;for(;0!==t;)e++,t>>>=1;return e},r.setToSJISFunction=function(t){if("function"!=typeof t)throw new Error('"toSJISFunc" is not a valid function.');o=t},r.isKanjiModeEnabled=function(){return void 0!==o},r.toSJIS=function(t){return o(t)};var s,a={};function c(){this.buffer=[],this.length=0}(s=a).L={bit:1},s.M={bit:0},s.Q={bit:3},s.H={bit:2},s.isValid=function(t){return t&&void 0!==t.bit&&t.bit>=0&&t.bit<4},s.from=function(t,e){if(s.isValid(t))return t;try{return function(t){if("string"!=typeof t)throw new Error("Param is not a string");switch(t.toLowerCase()){case"l":case"low":return s.L;case"m":case"medium":return s.M;case"q":case"quartile":return s.Q;case"h":case"high":return s.H;default:throw new Error("Unknown EC Level: "+t)}}(t)}catch(n){return e}},c.prototype={get:function(t){const e=Math.floor(t/8);return 1==(this.buffer[e]>>>7-t%8&1)},put:function(t,e){for(let n=0;n>>e-n-1&1))},getLengthInBits:function(){return this.length},putBit:function(t){const e=Math.floor(this.length/8);this.buffer.length<=e&&this.buffer.push(0),t&&(this.buffer[e]|=128>>>this.length%8),this.length++}};var u=c;function l(t){if(!t||t<1)throw new Error("BitMatrix size must be defined and greater than 0");this.size=t,this.data=new Uint8Array(t*t),this.reservedBit=new Uint8Array(t*t)}l.prototype.set=function(t,e,n,r){const o=t*this.size+e;this.data[o]=n,r&&(this.reservedBit[o]=!0)},l.prototype.get=function(t,e){return this.data[t*this.size+e]},l.prototype.xor=function(t,e,n){this.data[t*this.size+e]^=n},l.prototype.isReserved=function(t,e){return this.reservedBit[t*this.size+e]};var d=l,g={};!function(t){const e=r.getSymbolSize;t.getRowColCoords=function(t){if(1===t)return[];const n=Math.floor(t/7)+2,r=e(t),o=145===r?26:2*Math.ceil((r-13)/(2*n-2)),i=[r-7];for(let e=1;e=0&&t<=7},t.from=function(e){return t.isValid(e)?parseInt(e,10):void 0},t.getPenaltyN1=function(t){const n=t.size;let r=0,o=0,i=0,s=null,a=null;for(let c=0;c=5&&(r+=e+(o-5)),s=n,o=1),n=t.get(u,c),n===a?i++:(i>=5&&(r+=e+(i-5)),a=n,i=1)}o>=5&&(r+=e+(o-5)),i>=5&&(r+=e+(i-5))}return r},t.getPenaltyN2=function(t){const e=t.size;let r=0;for(let n=0;n=10&&(1488===o||93===o)&&n++,i=i<<1&2047|t.get(s,r),s>=10&&(1488===i||93===i)&&n++}return n*r},t.getPenaltyN4=function(t){let e=0;const n=t.data.length;for(let r=0;r=0;){const t=r[0];for(let i=0;i0){const t=new Uint8Array(this.degree);return t.set(n,r),t}return n};var M=B,P={},T={},R={isValid:function(t){return!isNaN(t)&&t>=1&&t<=40}},N={};const F="[0-9]+";let x="(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";x=x.replace(/u/g,"\\u");const S="(?:(?![A-Z0-9 $%*+\\-./:]|"+x+")(?:.|[\r\n]))+";N.KANJI=new RegExp(x,"g"),N.BYTE_KANJI=new RegExp("[^A-Z0-9 $%*+\\-./:]+","g"),N.BYTE=new RegExp(S,"g"),N.NUMERIC=new RegExp(F,"g"),N.ALPHANUMERIC=new RegExp("[A-Z $%*+\\-./:]+","g");const L=new RegExp("^"+x+"$"),U=new RegExp("^"+F+"$"),z=new RegExp("^[A-Z0-9 $%*+\\-./:]+$");N.testKanji=function(t){return L.test(t)},N.testNumeric=function(t){return U.test(t)},N.testAlphanumeric=function(t){return z.test(t)},function(t){const e=R,n=N;t.NUMERIC={id:"Numeric",bit:1,ccBits:[10,12,14]},t.ALPHANUMERIC={id:"Alphanumeric",bit:2,ccBits:[9,11,13]},t.BYTE={id:"Byte",bit:4,ccBits:[8,16,16]},t.KANJI={id:"Kanji",bit:8,ccBits:[8,10,12]},t.MIXED={bit:-1},t.getCharCountIndicator=function(t,n){if(!t.ccBits)throw new Error("Invalid mode: "+t);if(!e.isValid(n))throw new Error("Invalid version: "+n);return n>=1&&n<10?t.ccBits[0]:n<27?t.ccBits[1]:t.ccBits[2]},t.getBestModeForData=function(e){return n.testNumeric(e)?t.NUMERIC:n.testAlphanumeric(e)?t.ALPHANUMERIC:n.testKanji(e)?t.KANJI:t.BYTE},t.toString=function(t){if(t&&t.id)return t.id;throw new Error("Invalid mode")},t.isValid=function(t){return t&&t.bit&&t.ccBits},t.from=function(e,n){if(t.isValid(e))return e;try{return function(e){if("string"!=typeof e)throw new Error("Param is not a string");switch(e.toLowerCase()){case"numeric":return t.NUMERIC;case"alphanumeric":return t.ALPHANUMERIC;case"kanji":return t.KANJI;case"byte":return t.BYTE;default:throw new Error("Unknown mode: "+e)}}(e)}catch(r){return n}}}(T),function(t){const e=r,n=m,o=a,i=T,s=R,c=e.getBCHDigit(7973);function u(t,e){return i.getCharCountIndicator(t,e)+4}function l(t,e){let n=0;return t.forEach(function(t){const r=u(t.mode,e);n+=r+t.getBitsLength()}),n}t.from=function(t,e){return s.isValid(t)?parseInt(t,10):e},t.getCapacity=function(t,r,o){if(!s.isValid(t))throw new Error("Invalid QR Code version");void 0===o&&(o=i.BYTE);const a=8*(e.getSymbolTotalCodewords(t)-n.getTotalCodewordsCount(t,r));if(o===i.MIXED)return a;const c=a-u(o,t);switch(o){case i.NUMERIC:return Math.floor(c/10*3);case i.ALPHANUMERIC:return Math.floor(c/11*2);case i.KANJI:return Math.floor(c/13);case i.BYTE:default:return Math.floor(c/8)}},t.getBestVersionForData=function(e,n){let r;const s=o.from(n,o.M);if(Array.isArray(e)){if(e.length>1)return function(e,n){for(let r=1;r<=40;r++)if(l(e,r)<=t.getCapacity(r,n,i.MIXED))return r}(e,s);if(0===e.length)return 1;r=e[0]}else r=e;return function(e,n,r){for(let o=1;o<=40;o++)if(n<=t.getCapacity(o,r,e))return o}(r.mode,r.getLength(),s)},t.getEncodedBits=function(t){if(!s.isValid(t)||t<7)throw new Error("Invalid QR Code version");let n=t<<12;for(;e.getBCHDigit(n)-c>=0;)n^=7973<=0;)r^=1335<0&&(n=this.data.substr(e),r=parseInt(n,10),t.put(r,3*o+1))};var Y=K;const _=T,Q=["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 j(t){this.mode=_.ALPHANUMERIC,this.data=t}j.getBitsLength=function(t){return 11*Math.floor(t/2)+t%2*6},j.prototype.getLength=function(){return this.data.length},j.prototype.getBitsLength=function(){return j.getBitsLength(this.data.length)},j.prototype.write=function(t){let e;for(e=0;e+2<=this.data.length;e+=2){let n=45*Q.indexOf(this.data[e]);n+=Q.indexOf(this.data[e+1]),t.put(n,11)}this.data.length%2&&t.put(Q.indexOf(this.data[e]),6)};var G=j;const O=T;function $(t){this.mode=O.BYTE,this.data="string"==typeof t?(new TextEncoder).encode(t):new Uint8Array(t)}$.getBitsLength=function(t){return 8*t},$.prototype.getLength=function(){return this.data.length},$.prototype.getBitsLength=function(){return $.getBitsLength(this.data.length)},$.prototype.write=function(t){for(let e=0,n=this.data.length;e=33088&&n<=40956)n-=33088;else{if(!(n>=57408&&n<=60351))throw new Error("Invalid SJIS character: "+this.data[e]+"\nMake sure your charset is UTF-8");n-=49472}n=192*(n>>>8&255)+(255&n),t.put(n,13)}};var tt,et=Z,nt={exports:{}};nt.exports=tt={single_source_shortest_paths:function(t,e,n){var r={},o={};o[e]=0;var i,s,a,c,u,l,d,g=tt.PriorityQueue.make();for(g.push(e,0);!g.empty();)for(a in s=(i=g.pop()).value,c=i.cost,u=t[s]||{})u.hasOwnProperty(a)&&(l=c+u[a],d=o[a],(void 0===o[a]||d>l)&&(o[a]=l,g.push(a,l),r[a]=s));if(void 0!==n&&void 0===o[n]){var h=["Could not find a path from ",e," to ",n,"."].join("");throw new Error(h)}return r},extract_shortest_path_from_predecessor_list:function(t,e){for(var n=[],r=e;r;)n.push(r),t[r],r=t[r];return n.reverse(),n},find_path:function(t,e,n){var r=tt.single_source_shortest_paths(t,e,n);return tt.extract_shortest_path_from_predecessor_list(r,n)},PriorityQueue:{make:function(t){var e,n=tt.PriorityQueue,r={};for(e in t=t||{},n)n.hasOwnProperty(e)&&(r[e]=n[e]);return r.queue=[],r.sorter=t.sorter||n.default_sorter,r},default_sorter:function(t,e){return t.cost-e.cost},push:function(t,e){var n={value:t,cost:e};this.queue.push(n),this.queue.sort(this.sorter)},pop:function(){return this.queue.shift()},empty:function(){return 0===this.queue.length}}};var rt=nt.exports;!function(t){const e=T,n=Y,o=G,i=q,s=et,a=N,c=r,u=rt;function l(t){return unescape(encodeURIComponent(t)).length}function d(t,e,n){const r=[];let o;for(;null!==(o=t.exec(n));)r.push({data:o[0],index:o.index,mode:e,length:o[0].length});return r}function g(t){const n=d(a.NUMERIC,e.NUMERIC,t),r=d(a.ALPHANUMERIC,e.ALPHANUMERIC,t);let o,i;c.isKanjiModeEnabled()?(o=d(a.BYTE,e.BYTE,t),i=d(a.KANJI,e.KANJI,t)):(o=d(a.BYTE_KANJI,e.BYTE,t),i=[]);return n.concat(r,o,i).sort(function(t,e){return t.index-e.index}).map(function(t){return{data:t.data,mode:t.mode,length:t.length}})}function h(t,r){switch(r){case e.NUMERIC:return n.getBitsLength(t);case e.ALPHANUMERIC:return o.getBitsLength(t);case e.KANJI:return s.getBitsLength(t);case e.BYTE:return i.getBitsLength(t)}}function f(t,r){let a;const u=e.getBestModeForData(t);if(a=e.from(r,u),a!==e.BYTE&&a.bit=0?t[t.length-1]:null;return n&&n.mode===e.mode?(t[t.length-1].data+=e.data,t):(t.push(e),t)},[])}(a))},t.rawSplit=function(e){return t.fromArray(g(e,c.isKanjiModeEnabled()))}}(H);const ot=r,it=a,st=u,at=d,ct=g,ut=h,lt=p,dt=m,gt=M,ht=P,ft=k,pt=T,mt=H;function wt(t,e,n){const r=t.size,o=ft.getEncodedBits(e,n);let i,s;for(i=0;i<15;i++)s=1==(o>>i&1),i<6?t.set(i,8,s,!0):i<8?t.set(i+1,8,s,!0):t.set(r-15+i,8,s,!0),i<8?t.set(8,r-i-1,s,!0):i<9?t.set(8,15-i-1+1,s,!0):t.set(8,15-i-1,s,!0);t.set(r-8,8,1,!0)}function yt(t,e,n){const r=new st;n.forEach(function(e){r.put(e.mode.bit,4),r.put(e.getLength(),pt.getCharCountIndicator(e.mode,t)),e.write(r)});const o=8*(ot.getSymbolTotalCodewords(t)-dt.getTotalCodewordsCount(t,e));for(r.getLengthInBits()+4<=o&&r.put(0,4);r.getLengthInBits()%8!=0;)r.putBit(0);const i=(o-r.getLengthInBits())/8;for(let s=0;s=0&&r<=6&&(0===o||6===o)||o>=0&&o<=6&&(0===r||6===r)||r>=2&&r<=4&&o>=2&&o<=4?t.set(e+r,i+o,!0,!0):t.set(e+r,i+o,!1,!0))}}(c,e),function(t){const e=t.size;for(let n=8;n=7&&function(t,e){const n=t.size,r=ht.getEncodedBits(e);let o,i,s;for(let a=0;a<18;a++)o=Math.floor(a/3),i=a%3+n-8-3,s=1==(r>>a&1),t.set(o,i,s,!0),t.set(i,o,s,!0)}(c,e),function(t,e){const n=t.size;let r=-1,o=n-1,i=7,s=0;for(let a=n-1;a>0;a-=2)for(6===a&&a--;;){for(let n=0;n<2;n++)if(!t.isReserved(o,a-n)){let r=!1;s>>i&1)),t.set(o,a-n,r),i--,-1===i&&(s++,i=7)}if(o+=r,o<0||n<=o){o-=r,r=-r;break}}}(c,s),isNaN(r)&&(r=lt.getBestMask(c,wt.bind(null,c,n))),lt.applyMask(r,c),wt(c,n,r),{modules:c,version:e,errorCorrectionLevel:n,maskPattern:r,segments:o}}n.create=function(t,e){if(void 0===t||""===t)throw new Error("No input text");let n,r,o=it.M;return void 0!==e&&(o=it.from(e.errorCorrectionLevel,it.M),n=ht.from(e.version),r=lt.from(e.maskPattern),e.toSJISFunc&&ot.setToSJISFunction(e.toSJISFunc)),Et(t,n,o,r)};var vt={},At={};!function(t){function e(t){if("number"==typeof t&&(t=t.toString()),"string"!=typeof t)throw new Error("Color should be defined as hex string");let e=t.slice().replace("#","").split("");if(e.length<3||5===e.length||e.length>8)throw new Error("Invalid hex color: "+t);3!==e.length&&4!==e.length||(e=Array.prototype.concat.apply([],e.map(function(t){return[t,t]}))),6===e.length&&e.push("F","F");const n=parseInt(e.join(""),16);return{r:n>>24&255,g:n>>16&255,b:n>>8&255,a:255&n,hex:"#"+e.slice(0,6).join("")}}t.getOptions=function(t){t||(t={}),t.color||(t.color={});const n=void 0===t.margin||null===t.margin||t.margin<0?4:t.margin,r=t.width&&t.width>=21?t.width:void 0,o=t.scale||4;return{width:r,scale:r?4:o,margin:n,color:{dark:e(t.color.dark||"#000000ff"),light:e(t.color.light||"#ffffffff")},type:t.type,rendererOpts:t.rendererOpts||{}}},t.getScale=function(t,e){return e.width&&e.width>=t+2*e.margin?e.width/(t+2*e.margin):e.scale},t.getImageWidth=function(e,n){const r=t.getScale(e,n);return Math.floor((e+2*n.margin)*r)},t.qrToImageData=function(e,n,r){const o=n.modules.size,i=n.modules.data,s=t.getScale(o,r),a=Math.floor((o+2*r.margin)*s),c=r.margin*s,u=[r.color.light,r.color.dark];for(let t=0;t=c&&n>=c&&t':"",c="0&&c>0&&t[a-1]||(r+=i?Bt("M",c+n,.5+u+n):Bt("m",o,0),o=0,i=!1),c+1',u='viewBox="0 0 '+s+" "+s+'"',l='\n";return"function"==typeof n&&n(null,l),l};const Mt=function(){return"function"==typeof Promise&&Promise.prototype&&Promise.prototype.then},Pt=n,Tt=vt,Rt=Ct;function Nt(t,e,n,r,o){const i=[].slice.call(arguments,1),s=i.length,a="function"==typeof i[s-1];if(!a&&!Mt())throw new Error("Callback required as last argument");if(!a){if(s<1)throw new Error("Too few arguments provided");return 1===s?(n=e,e=r=void 0):2!==s||e.getContext||(r=n,n=e,e=void 0),new Promise(function(o,i){try{const i=Pt.create(n,r);o(t(i,e,r))}catch(s){i(s)}})}if(s<2)throw new Error("Too few arguments provided");2===s?(o=n,n=e,e=r=void 0):3===s&&(e.getContext&&void 0===o?(o=r,r=void 0):(o=r,r=n,n=e,e=void 0));try{const i=Pt.create(n,r);o(null,t(i,e,r))}catch(c){o(c)}}e.create=Pt.create,e.toCanvas=Nt.bind(null,Tt.render),e.toDataURL=Nt.bind(null,Tt.renderToDataURL),e.toString=Nt.bind(null,function(t,e,n){return Rt.render(t,n)});const Ft=async(t,n="#000000",r="#FFFFFF")=>{try{return await e.toString(t,{type:"svg",width:512,margin:2,errorCorrectionLevel:"H",color:{dark:n,light:r}})}catch(o){return console.error("Error generating SVG QR code:",o),null}},xt=(t,e,n,r,o)=>new Promise(i=>{const s=document.createElement("canvas"),a=s.getContext("2d");s.width=t.width,s.height=t.height,a.drawImage(t,0,0);const c=a.getImageData(0,0,s.width,s.height),u=o.createElementNS("http://www.w3.org/2000/svg","g"),l=e/Math.max(t.width,t.height);u.setAttribute("transform",`translate(${n.toFixed(2)}, ${r.toFixed(2)}) scale(${l.toFixed(4)})`);const d=Math.max(1,Math.floor(Math.min(t.width,t.height)/32)),g=c.data;for(let e=0;e128&&(i>0||s>0||a>0)){const t=o.createElementNS("http://www.w3.org/2000/svg","rect");t.setAttribute("x",n.toFixed(2)),t.setAttribute("y",e.toFixed(2)),t.setAttribute("width",d.toFixed(2)),t.setAttribute("height",d.toFixed(2)),t.setAttribute("fill",`rgb(${i}, ${s}, ${a})`),u.appendChild(t)}}i(u)}),St=async(t,e,n=20)=>new Promise(r=>{const o=new Image;o.onload=()=>{const i=(new DOMParser).parseFromString(t,"image/svg+xml"),s=i.documentElement,a=n/100*33,c=a+4,u=(33-c)/2,l=(33-c)/2,d=u+2,g=l+2,h=i.createElementNS("http://www.w3.org/2000/svg","rect");if(h.setAttribute("x",u.toFixed(2)),h.setAttribute("y",l.toFixed(2)),h.setAttribute("width",c.toFixed(2)),h.setAttribute("height",c.toFixed(2)),h.setAttribute("fill","#FFFFFF"),s.appendChild(h),e.startsWith("data:image/svg+xml")){console.log("Processing SVG image");const t=i.createElementNS("http://www.w3.org/2000/svg","image");t.setAttribute("x",d.toFixed(2)),t.setAttribute("y",g.toFixed(2)),t.setAttribute("width",a.toFixed(2)),t.setAttribute("height",a.toFixed(2)),t.setAttribute("href",e),s.appendChild(t),console.log("SVG image element added");const n=new XMLSerializer;r(n.serializeToString(s))}else console.log("Processing bitmap image"),xt(o,a,d,g,i).then(t=>{s.appendChild(t),console.log("Vectorized image group added");const e=new XMLSerializer;r(e.serializeToString(s))}).catch(t=>{console.error("Vectorization failed:",t);const e=new XMLSerializer;r(e.serializeToString(s))})},o.onerror=()=>{console.error("Error loading image for SVG"),r(t)},o.src=e});t.addImageToQRCode=async(t,e,n=20)=>new Promise(r=>{const o=document.createElement("canvas"),i=o.getContext("2d");o.width=512,o.height=512;const s=new Image,a=new Image;s.onload=()=>{i.drawImage(s,0,0,512,512),a.onload=()=>{const t=n/100*512,e=t+32,s=(512-e)/2,c=(512-e)/2;i.fillStyle="#FFFFFF",i.fillRect(s,c,e,e);const u=s+16,l=c+16;i.drawImage(a,u,l,t,t),r(o.toDataURL("image/png"))},a.onerror=()=>{console.error("Error loading custom image"),r(t)},a.src=e},s.onerror=()=>{console.error("Error loading QR code"),r(t)},s.src=t}),t.addImageToSVG=St,t.downloadSVG=(t,e="qrcode.svg")=>{if(!t)return void console.error("No SVG content to download");const n=new Blob([t],{type:"image/svg+xml"}),r=URL.createObjectURL(n),o=document.createElement("a");o.href=r,o.download=e,document.body.appendChild(o),o.click(),document.body.removeChild(o),URL.revokeObjectURL(r)},t.fileToDataURL=t=>new Promise((e,n)=>{const r=new FileReader;r.onload=()=>e(r.result),r.onerror=n,r.readAsDataURL(t)}),t.generateCompleteSVGQRCode=async(t,e=null,n=20,r="#000000",o="#FFFFFF")=>{try{const i=await Ft(t,r,o);if(!i)return null;if(e){console.log("Adding custom image to SVG...");const t=await St(i,e,n);return console.log("SVG with image generated"),t}return i}catch(i){return console.error("Error generating complete SVG QR code:",i),null}},t.generateQRCode=async(t,n="#000000",r="#FFFFFF")=>{try{return await e.toDataURL(t,{color:{dark:n,light:r},width:512,margin:2,errorCorrectionLevel:"H"})}catch(o){return console.error("Error generating QR code:",o),null}},t.generateSVGQRCode=Ft,t.validateImageFile=(t,e=2097152)=>["image/jpeg","image/png","image/gif","image/webp","image/svg+xml"].includes(t.type)?t.size>e?{success:!1,error:`File size must be less than ${Math.round(e/1024/1024)}MB`}:{success:!0}:{success:!1,error:"Please select a valid image file (JPEG, PNG, GIF, WebP, or SVG)"},t.vectorizeBitmap=xt,Object.defineProperty(t,Symbol.toStringTag,{value:"Module"})});
+//# sourceMappingURL=qr-code-utils.umd.js.map
diff --git a/dist/qr-code-utils.umd.js.map b/dist/qr-code-utils.umd.js.map
new file mode 100644
index 0000000..d07faa0
--- /dev/null
+++ b/dist/qr-code-utils.umd.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"qr-code-utils.umd.js","sources":["../node_modules/qrcode/lib/core/utils.js","../node_modules/qrcode/lib/core/bit-buffer.js","../node_modules/qrcode/lib/core/error-correction-level.js","../node_modules/qrcode/lib/core/bit-matrix.js","../node_modules/qrcode/lib/core/alignment-pattern.js","../node_modules/qrcode/lib/core/finder-pattern.js","../node_modules/qrcode/lib/core/mask-pattern.js","../node_modules/qrcode/lib/core/error-correction-code.js","../node_modules/qrcode/lib/core/galois-field.js","../node_modules/qrcode/lib/core/polynomial.js","../node_modules/qrcode/lib/core/reed-solomon-encoder.js","../node_modules/qrcode/lib/core/version-check.js","../node_modules/qrcode/lib/core/regex.js","../node_modules/qrcode/lib/core/mode.js","../node_modules/qrcode/lib/core/version.js","../node_modules/qrcode/lib/core/format-info.js","../node_modules/qrcode/lib/core/numeric-data.js","../node_modules/qrcode/lib/core/alphanumeric-data.js","../node_modules/qrcode/lib/core/byte-data.js","../node_modules/qrcode/lib/core/kanji-data.js","../node_modules/dijkstrajs/dijkstra.js","../node_modules/qrcode/lib/core/segments.js","../node_modules/qrcode/lib/core/qrcode.js","../node_modules/qrcode/lib/renderer/utils.js","../node_modules/qrcode/lib/renderer/canvas.js","../node_modules/qrcode/lib/renderer/svg-tag.js","../node_modules/qrcode/lib/browser.js","../node_modules/qrcode/lib/can-promise.js","../src/utils/qrCodeUtils.js"],"sourcesContent":["let toSJISFunction\nconst CODEWORDS_COUNT = [\n 0, // Not used\n 26, 44, 70, 100, 134, 172, 196, 242, 292, 346,\n 404, 466, 532, 581, 655, 733, 815, 901, 991, 1085,\n 1156, 1258, 1364, 1474, 1588, 1706, 1828, 1921, 2051, 2185,\n 2323, 2465, 2611, 2761, 2876, 3034, 3196, 3362, 3532, 3706\n]\n\n/**\n * Returns the QR Code size for the specified version\n *\n * @param {Number} version QR Code version\n * @return {Number} size of QR code\n */\nexports.getSymbolSize = function getSymbolSize (version) {\n if (!version) throw new Error('\"version\" cannot be null or undefined')\n if (version < 1 || version > 40) throw new Error('\"version\" should be in range from 1 to 40')\n return version * 4 + 17\n}\n\n/**\n * Returns the total number of codewords used to store data and EC information.\n *\n * @param {Number} version QR Code version\n * @return {Number} Data length in bits\n */\nexports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {\n return CODEWORDS_COUNT[version]\n}\n\n/**\n * Encode data with Bose-Chaudhuri-Hocquenghem\n *\n * @param {Number} data Value to encode\n * @return {Number} Encoded value\n */\nexports.getBCHDigit = function (data) {\n let digit = 0\n\n while (data !== 0) {\n digit++\n data >>>= 1\n }\n\n return digit\n}\n\nexports.setToSJISFunction = function setToSJISFunction (f) {\n if (typeof f !== 'function') {\n throw new Error('\"toSJISFunc\" is not a valid function.')\n }\n\n toSJISFunction = f\n}\n\nexports.isKanjiModeEnabled = function () {\n return typeof toSJISFunction !== 'undefined'\n}\n\nexports.toSJIS = function toSJIS (kanji) {\n return toSJISFunction(kanji)\n}\n","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","exports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n const lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'l':\n case 'low':\n return exports.L\n\n case 'm':\n case 'medium':\n return exports.M\n\n case 'q':\n case 'quartile':\n return exports.Q\n\n case 'h':\n case 'high':\n return exports.H\n\n default:\n throw new Error('Unknown EC Level: ' + string)\n }\n}\n\nexports.isValid = function isValid (level) {\n return level && typeof level.bit !== 'undefined' &&\n level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n","/**\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","/**\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","const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n const size = getSymbolSize(version)\n\n return [\n // top-left\n [0, 0],\n // top-right\n [size - FINDER_PATTERN_SIZE, 0],\n // bottom-left\n [0, size - FINDER_PATTERN_SIZE]\n ]\n}\n","/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n PATTERN000: 0,\n PATTERN001: 1,\n PATTERN010: 2,\n PATTERN011: 3,\n PATTERN100: 4,\n PATTERN101: 5,\n PATTERN110: 6,\n PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n N1: 3,\n N2: 3,\n N3: 40,\n N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param {Number} mask Mask pattern\n * @return {Boolean} true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param {Number|String} value Mask pattern value\n * @return {Number} Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n const size = data.size\n let points = 0\n let sameCountCol = 0\n let sameCountRow = 0\n let lastCol = null\n let lastRow = null\n\n for (let row = 0; row < size; row++) {\n sameCountCol = sameCountRow = 0\n lastCol = lastRow = null\n\n for (let col = 0; col < size; col++) {\n let module = data.get(row, col)\n if (module === lastCol) {\n sameCountCol++\n } else {\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n lastCol = module\n sameCountCol = 1\n }\n\n module = data.get(col, row)\n if (module === lastRow) {\n sameCountRow++\n } else {\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n lastRow = module\n sameCountRow = 1\n }\n }\n\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n }\n\n return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n const size = data.size\n let points = 0\n\n for (let row = 0; row < size - 1; row++) {\n for (let col = 0; col < size - 1; col++) {\n const last = data.get(row, col) +\n data.get(row, col + 1) +\n data.get(row + 1, col) +\n data.get(row + 1, col + 1)\n\n if (last === 4 || last === 0) points++\n }\n }\n\n return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n const size = data.size\n let points = 0\n let bitsCol = 0\n let bitsRow = 0\n\n for (let row = 0; row < size; row++) {\n bitsCol = bitsRow = 0\n for (let col = 0; col < size; col++) {\n bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n }\n }\n\n return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n let darkCount = 0\n const modulesCount = data.data.length\n\n for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param {Number} maskPattern Pattern reference value\n * @param {Number} i Row\n * @param {Number} j Column\n * @return {Boolean} Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n switch (maskPattern) {\n case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n case exports.Patterns.PATTERN001: return i % 2 === 0\n case exports.Patterns.PATTERN010: return j % 3 === 0\n case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n default: throw new Error('bad maskPattern:' + maskPattern)\n }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param {Number} pattern Pattern reference number\n * @param {BitMatrix} data BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n const size = data.size\n\n for (let col = 0; col < size; col++) {\n for (let row = 0; row < size; row++) {\n if (data.isReserved(row, col)) continue\n data.xor(row, col, getMaskAt(pattern, row, col))\n }\n }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n const numPatterns = Object.keys(exports.Patterns).length\n let bestPattern = 0\n let lowerPenalty = Infinity\n\n for (let p = 0; p < numPatterns; p++) {\n setupFormatFunc(p)\n exports.applyMask(p, data)\n\n // Calculate penalty\n const penalty =\n exports.getPenaltyN1(data) +\n exports.getPenaltyN2(data) +\n exports.getPenaltyN3(data) +\n exports.getPenaltyN4(data)\n\n // Undo previously applied mask\n exports.applyMask(p, data)\n\n if (penalty < lowerPenalty) {\n lowerPenalty = penalty\n bestPattern = p\n }\n }\n\n return bestPattern\n}\n","const ECLevel = require('./error-correction-level')\r\n\r\nconst EC_BLOCKS_TABLE = [\r\n// L M Q H\r\n 1, 1, 1, 1,\r\n 1, 1, 1, 1,\r\n 1, 1, 2, 2,\r\n 1, 2, 2, 4,\r\n 1, 2, 4, 4,\r\n 2, 4, 4, 4,\r\n 2, 4, 6, 5,\r\n 2, 4, 6, 6,\r\n 2, 5, 8, 8,\r\n 4, 5, 8, 8,\r\n 4, 5, 8, 11,\r\n 4, 8, 10, 11,\r\n 4, 9, 12, 16,\r\n 4, 9, 16, 16,\r\n 6, 10, 12, 18,\r\n 6, 10, 17, 16,\r\n 6, 11, 16, 19,\r\n 6, 13, 18, 21,\r\n 7, 14, 21, 25,\r\n 8, 16, 20, 25,\r\n 8, 17, 23, 25,\r\n 9, 17, 23, 34,\r\n 9, 18, 25, 30,\r\n 10, 20, 27, 32,\r\n 12, 21, 29, 35,\r\n 12, 23, 34, 37,\r\n 12, 25, 34, 40,\r\n 13, 26, 35, 42,\r\n 14, 28, 38, 45,\r\n 15, 29, 40, 48,\r\n 16, 31, 43, 51,\r\n 17, 33, 45, 54,\r\n 18, 35, 48, 57,\r\n 19, 37, 51, 60,\r\n 19, 38, 53, 63,\r\n 20, 40, 56, 66,\r\n 21, 43, 59, 70,\r\n 22, 45, 62, 74,\r\n 24, 47, 65, 77,\r\n 25, 49, 68, 81\r\n]\r\n\r\nconst EC_CODEWORDS_TABLE = [\r\n// L M Q H\r\n 7, 10, 13, 17,\r\n 10, 16, 22, 28,\r\n 15, 26, 36, 44,\r\n 20, 36, 52, 64,\r\n 26, 48, 72, 88,\r\n 36, 64, 96, 112,\r\n 40, 72, 108, 130,\r\n 48, 88, 132, 156,\r\n 60, 110, 160, 192,\r\n 72, 130, 192, 224,\r\n 80, 150, 224, 264,\r\n 96, 176, 260, 308,\r\n 104, 198, 288, 352,\r\n 120, 216, 320, 384,\r\n 132, 240, 360, 432,\r\n 144, 280, 408, 480,\r\n 168, 308, 448, 532,\r\n 180, 338, 504, 588,\r\n 196, 364, 546, 650,\r\n 224, 416, 600, 700,\r\n 224, 442, 644, 750,\r\n 252, 476, 690, 816,\r\n 270, 504, 750, 900,\r\n 300, 560, 810, 960,\r\n 312, 588, 870, 1050,\r\n 336, 644, 952, 1110,\r\n 360, 700, 1020, 1200,\r\n 390, 728, 1050, 1260,\r\n 420, 784, 1140, 1350,\r\n 450, 812, 1200, 1440,\r\n 480, 868, 1290, 1530,\r\n 510, 924, 1350, 1620,\r\n 540, 980, 1440, 1710,\r\n 570, 1036, 1530, 1800,\r\n 570, 1064, 1590, 1890,\r\n 600, 1120, 1680, 1980,\r\n 630, 1204, 1770, 2100,\r\n 660, 1260, 1860, 2220,\r\n 720, 1316, 1950, 2310,\r\n 750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n","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","const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param {Uint8Array} p1 Polynomial\n * @param {Uint8Array} p2 Polynomial\n * @return {Uint8Array} Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n for (let i = 0; i < p1.length; i++) {\n for (let j = 0; j < p2.length; j++) {\n coeff[i + j] ^= GF.mul(p1[i], p2[j])\n }\n }\n\n return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param {Uint8Array} divident Polynomial\n * @param {Uint8Array} divisor Polynomial\n * @return {Uint8Array} Remainder\n */\nexports.mod = function mod (divident, divisor) {\n let result = new Uint8Array(divident)\n\n while ((result.length - divisor.length) >= 0) {\n const coeff = result[0]\n\n for (let i = 0; i < divisor.length; i++) {\n result[i] ^= GF.mul(divisor[i], coeff)\n }\n\n // remove all zeros from buffer head\n let offset = 0\n while (offset < result.length && result[offset] === 0) offset++\n result = result.slice(offset)\n }\n\n return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param {Number} degree Degree of the generator polynomial\n * @return {Uint8Array} Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n let poly = new Uint8Array([1])\n for (let i = 0; i < degree; i++) {\n poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n }\n\n return poly\n}\n","const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n this.genPoly = undefined\n this.degree = degree\n\n if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n // create an irreducible generator polynomial\n this.degree = degree\n this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param {Uint8Array} data Buffer containing input data\n * @return {Uint8Array} Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n if (!this.genPoly) {\n throw new Error('Encoder not initialized')\n }\n\n // Calculate EC for this data block\n // extends data size to data+genPoly size\n const paddedData = new Uint8Array(data.length + this.degree)\n paddedData.set(data)\n\n // The error correction codewords are the remainder after dividing the data codewords\n // by a generator polynomial\n const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n // return EC data blocks (last n byte, where n is the degree of genPoly)\n // If coefficients number in remainder are less than genPoly degree,\n // pad with 0s to the left to reach the needed number of coefficients\n const start = this.degree - remainder.length\n if (start > 0) {\n const buff = new Uint8Array(this.degree)\n buff.set(remainder, start)\n\n return buff\n }\n\n return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n","/**\n * Check if QR Code version is valid\n *\n * @param {Number} version QR Code version\n * @return {Boolean} true if valid version, false otherwise\n */\nexports.isValid = function isValid (version) {\n return !isNaN(version) && version >= 1 && version <= 40\n}\n","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","const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n id: 'Numeric',\n bit: 1 << 0,\n ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n * 26 alphabetic characters (A - Z),\n * and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n id: 'Alphanumeric',\n bit: 1 << 1,\n ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n id: 'Byte',\n bit: 1 << 2,\n ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n id: 'Kanji',\n bit: 1 << 3,\n ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param {Mode} mode Data mode\n * @param {Number} version QR Code version\n * @return {Number} Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n if (!VersionCheck.isValid(version)) {\n throw new Error('Invalid version: ' + version)\n }\n\n if (version >= 1 && version < 10) return mode.ccBits[0]\n else if (version < 27) return mode.ccBits[1]\n return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param {String} dataStr Input data string\n * @return {Mode} Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n else if (Regex.testKanji(dataStr)) return exports.KANJI\n else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String} Mode name\n */\nexports.toString = function toString (mode) {\n if (mode && mode.id) return mode.id\n throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param {Mode} mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param {String} string Mode name\n * @returns {Mode} Mode object\n */\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n const lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'numeric':\n return exports.NUMERIC\n case 'alphanumeric':\n return exports.ALPHANUMERIC\n case 'kanji':\n return exports.KANJI\n case 'byte':\n return exports.BYTE\n default:\n throw new Error('Unknown mode: ' + string)\n }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param {Mode|String} value Encoding mode\n * @param {Mode} defaultValue Fallback value\n * @return {Mode} Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n","const Utils = require('./utils')\nconst ECCode = require('./error-correction-code')\nconst ECLevel = require('./error-correction-level')\nconst Mode = require('./mode')\nconst VersionCheck = require('./version-check')\n\n// Generator polynomial used to encode version information\nconst G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0)\nconst G18_BCH = Utils.getBCHDigit(G18)\n\nfunction getBestVersionForDataLength (mode, length, errorCorrectionLevel) {\n for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\nfunction getReservedBitsCount (mode, version) {\n // Character count indicator + mode indicator bits\n return Mode.getCharCountIndicator(mode, version) + 4\n}\n\nfunction getTotalBitsFromDataArray (segments, version) {\n let totalBits = 0\n\n segments.forEach(function (data) {\n const reservedBits = getReservedBitsCount(data.mode, version)\n totalBits += reservedBits + data.getBitsLength()\n })\n\n return totalBits\n}\n\nfunction getBestVersionForMixedData (segments, errorCorrectionLevel) {\n for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n const length = getTotalBitsFromDataArray(segments, currentVersion)\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, Mode.MIXED)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\n/**\n * Returns version number from a value.\n * If value is not a valid version, returns defaultValue\n *\n * @param {Number|String} value QR Code version\n * @param {Number} defaultValue Fallback value\n * @return {Number} QR Code version number\n */\nexports.from = function from (value, defaultValue) {\n if (VersionCheck.isValid(value)) {\n return parseInt(value, 10)\n }\n\n return defaultValue\n}\n\n/**\n * Returns how much data can be stored with the specified QR code version\n * and error correction level\n *\n * @param {Number} version QR Code version (1-40)\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} Quantity of storable data\n */\nexports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode) {\n if (!VersionCheck.isValid(version)) {\n throw new Error('Invalid QR Code version')\n }\n\n // Use Byte mode as default\n if (typeof mode === 'undefined') mode = Mode.BYTE\n\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n if (mode === Mode.MIXED) return dataTotalCodewordsBits\n\n const usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode, version)\n\n // Return max number of storable codewords\n switch (mode) {\n case Mode.NUMERIC:\n return Math.floor((usableBits / 10) * 3)\n\n case Mode.ALPHANUMERIC:\n return Math.floor((usableBits / 11) * 2)\n\n case Mode.KANJI:\n return Math.floor(usableBits / 13)\n\n case Mode.BYTE:\n default:\n return Math.floor(usableBits / 8)\n }\n}\n\n/**\n * Returns the minimum version needed to contain the amount of data\n *\n * @param {Segment} data Segment of data\n * @param {Number} [errorCorrectionLevel=H] Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} QR Code version\n */\nexports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel) {\n let seg\n\n const ecl = ECLevel.from(errorCorrectionLevel, ECLevel.M)\n\n if (Array.isArray(data)) {\n if (data.length > 1) {\n return getBestVersionForMixedData(data, ecl)\n }\n\n if (data.length === 0) {\n return 1\n }\n\n seg = data[0]\n } else {\n seg = data\n }\n\n return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)\n}\n\n/**\n * Returns version information with relative error correction bits\n *\n * The version information is included in QR Code symbols of version 7 or larger.\n * It consists of an 18-bit sequence containing 6 data bits,\n * with 12 error correction bits calculated using the (18, 6) Golay code.\n *\n * @param {Number} version QR Code version\n * @return {Number} Encoded version info bits\n */\nexports.getEncodedBits = function getEncodedBits (version) {\n if (!VersionCheck.isValid(version) || version < 7) {\n throw new Error('Invalid QR Code version')\n }\n\n let d = version << 12\n\n while (Utils.getBCHDigit(d) - G18_BCH >= 0) {\n d ^= (G18 << (Utils.getBCHDigit(d) - G18_BCH))\n }\n\n return (version << 12) | d\n}\n","const Utils = require('./utils')\n\nconst G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nconst G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nconst G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Number} mask Mask pattern\n * @return {Number} Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n const data = ((errorCorrectionLevel.bit << 3) | mask)\n let d = data << 10\n\n while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n }\n\n // xor final data with mask pattern in order to ensure that\n // no combination of Error Correction Level and data mask pattern\n // will result in an all-zero data string\n return ((data << 10) | d) ^ G15_MASK\n}\n","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","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","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","const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n this.mode = Mode.KANJI\n this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n let i\n\n // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n // These byte values are shifted from the JIS X 0208 values.\n // JIS X 0208 gives details of the shift coded representation.\n for (i = 0; i < this.data.length; i++) {\n let value = Utils.toSJIS(this.data[i])\n\n // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n if (value >= 0x8140 && value <= 0x9FFC) {\n // Subtract 0x8140 from Shift JIS value\n value -= 0x8140\n\n // For characters with Shift JIS values from 0xE040 to 0xEBBF\n } else if (value >= 0xE040 && value <= 0xEBBF) {\n // Subtract 0xC140 from Shift JIS value\n value -= 0xC140\n } else {\n throw new Error(\n 'Invalid SJIS character: ' + this.data[i] + '\\n' +\n 'Make sure your charset is UTF-8')\n }\n\n // Multiply most significant byte of result by 0xC0\n // and add least significant byte to product\n value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n // Convert result to a 13-bit binary string\n bitBuffer.put(value, 13)\n }\n}\n\nmodule.exports = KanjiData\n","'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 \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","const Mode = require('./mode')\nconst NumericData = require('./numeric-data')\nconst AlphanumericData = require('./alphanumeric-data')\nconst ByteData = require('./byte-data')\nconst KanjiData = require('./kanji-data')\nconst Regex = require('./regex')\nconst Utils = require('./utils')\nconst dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param {String} str Input string\n * @return {Number} Number of byte\n */\nfunction getStringByteLength (str) {\n return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param {Mode} mode Segment mode\n * @param {String} str String to process\n * @return {Array} Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n const segments = []\n let result\n\n while ((result = regex.exec(str)) !== null) {\n segments.push({\n data: result[0],\n index: result.index,\n mode: mode,\n length: result[0].length\n })\n }\n\n return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param {String} dataStr Input string\n * @return {Array} Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n let byteSegs\n let kanjiSegs\n\n if (Utils.isKanjiModeEnabled()) {\n byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n } else {\n byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n kanjiSegs = []\n }\n\n const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n return segs\n .sort(function (s1, s2) {\n return s1.index - s2.index\n })\n .map(function (obj) {\n return {\n data: obj.data,\n mode: obj.mode,\n length: obj.length\n }\n })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param {Number} length String length\n * @param {Mode} mode Segment mode\n * @return {Number} Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n switch (mode) {\n case Mode.NUMERIC:\n return NumericData.getBitsLength(length)\n case Mode.ALPHANUMERIC:\n return AlphanumericData.getBitsLength(length)\n case Mode.KANJI:\n return KanjiData.getBitsLength(length)\n case Mode.BYTE:\n return ByteData.getBitsLength(length)\n }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction mergeSegments (segs) {\n return segs.reduce(function (acc, curr) {\n const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n if (prevSeg && prevSeg.mode === curr.mode) {\n acc[acc.length - 1].data += curr.data\n return acc\n }\n\n acc.push(curr)\n return acc\n }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction buildNodes (segs) {\n const nodes = []\n for (let i = 0; i < segs.length; i++) {\n const seg = segs[i]\n\n switch (seg.mode) {\n case Mode.NUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.ALPHANUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.KANJI:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n break\n case Mode.BYTE:\n nodes.push([\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n }\n }\n\n return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param {Array} nodes Array of object with segments data\n * @param {Number} version QR Code version\n * @return {Object} Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n const table = {}\n const graph = { start: {} }\n let prevNodeIds = ['start']\n\n for (let i = 0; i < nodes.length; i++) {\n const nodeGroup = nodes[i]\n const currentNodeIds = []\n\n for (let j = 0; j < nodeGroup.length; j++) {\n const node = nodeGroup[j]\n const key = '' + i + j\n\n currentNodeIds.push(key)\n table[key] = { node: node, lastCount: 0 }\n graph[key] = {}\n\n for (let n = 0; n < prevNodeIds.length; n++) {\n const prevNodeId = prevNodeIds[n]\n\n if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n graph[prevNodeId][key] =\n getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n table[prevNodeId].lastCount += node.length\n } else {\n if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n 4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n }\n }\n }\n\n prevNodeIds = currentNodeIds\n }\n\n for (let n = 0; n < prevNodeIds.length; n++) {\n graph[prevNodeIds[n]].end = 0\n }\n\n return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param {String} data Input data\n * @param {Mode | String} modesHint Data mode\n * @return {Segment} Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n let mode\n const bestMode = Mode.getBestModeForData(data)\n\n mode = Mode.from(modesHint, bestMode)\n\n // Make sure data can be encoded\n if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n throw new Error('\"' + data + '\"' +\n ' cannot be encoded with mode ' + Mode.toString(mode) +\n '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n }\n\n // Use Mode.BYTE if Kanji support is disabled\n if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n mode = Mode.BYTE\n }\n\n switch (mode) {\n case Mode.NUMERIC:\n return new NumericData(data)\n\n case Mode.ALPHANUMERIC:\n return new AlphanumericData(data)\n\n case Mode.KANJI:\n return new KanjiData(data)\n\n case Mode.BYTE:\n return new ByteData(data)\n }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param {Array} array Array of objects with segments data\n * @return {Array} Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n return array.reduce(function (acc, seg) {\n if (typeof seg === 'string') {\n acc.push(buildSingleSegment(seg, null))\n } else if (seg.data) {\n acc.push(buildSingleSegment(seg.data, seg.mode))\n }\n\n return acc\n }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @return {Array} Array of segments\n */\nexports.fromString = function fromString (data, version) {\n const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n const nodes = buildNodes(segs)\n const graph = buildGraph(nodes, version)\n const path = dijkstra.find_path(graph.map, 'start', 'end')\n\n const optimizedSegs = []\n for (let i = 1; i < path.length - 1; i++) {\n optimizedSegs.push(graph.table[path[i]].node)\n }\n\n return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param {string} data Input string\n * @return {Array} Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n return exports.fromArray(\n getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n )\n}\n","const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n * http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n// http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n// http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n const size = matrix.size\n const pos = FinderPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -1; r <= 7; r++) {\n if (row + r <= -1 || size <= row + r) continue\n\n for (let c = -1; c <= 7; c++) {\n if (col + c <= -1 || size <= col + c) continue\n\n if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n const size = matrix.size\n\n for (let r = 8; r < size - 8; r++) {\n const value = r % 2 === 0\n matrix.set(r, 6, value, true)\n matrix.set(6, r, value, true)\n }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n const pos = AlignmentPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -2; r <= 2; r++) {\n for (let c = -2; c <= 2; c++) {\n if (r === -2 || r === 2 || c === -2 || c === 2 ||\n (r === 0 && c === 0)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n const size = matrix.size\n const bits = Version.getEncodedBits(version)\n let row, col, mod\n\n for (let i = 0; i < 18; i++) {\n row = Math.floor(i / 3)\n col = i % 3 + size - 8 - 3\n mod = ((bits >> i) & 1) === 1\n\n matrix.set(row, col, mod, true)\n matrix.set(col, row, mod, true)\n }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {Number} maskPattern Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n const size = matrix.size\n const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n let i, mod\n\n for (i = 0; i < 15; i++) {\n mod = ((bits >> i) & 1) === 1\n\n // vertical\n if (i < 6) {\n matrix.set(i, 8, mod, true)\n } else if (i < 8) {\n matrix.set(i + 1, 8, mod, true)\n } else {\n matrix.set(size - 15 + i, 8, mod, true)\n }\n\n // horizontal\n if (i < 8) {\n matrix.set(8, size - i - 1, mod, true)\n } else if (i < 9) {\n matrix.set(8, 15 - i - 1 + 1, mod, true)\n } else {\n matrix.set(8, 15 - i - 1, mod, true)\n }\n }\n\n // fixed module\n matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Uint8Array} data Data codewords\n */\nfunction setupData (matrix, data) {\n const size = matrix.size\n let inc = -1\n let row = size - 1\n let bitIndex = 7\n let byteIndex = 0\n\n for (let col = size - 1; col > 0; col -= 2) {\n if (col === 6) col--\n\n while (true) {\n for (let c = 0; c < 2; c++) {\n if (!matrix.isReserved(row, col - c)) {\n let dark = false\n\n if (byteIndex < data.length) {\n dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n }\n\n matrix.set(row, col - c, dark)\n bitIndex--\n\n if (bitIndex === -1) {\n byteIndex++\n bitIndex = 7\n }\n }\n }\n\n row += inc\n\n if (row < 0 || size <= row) {\n row -= inc\n inc = -inc\n break\n }\n }\n }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {ByteData} data Data input\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n // Prepare data buffer\n const buffer = new BitBuffer()\n\n segments.forEach(function (data) {\n // prefix data with mode indicator (4 bits)\n buffer.put(data.mode.bit, 4)\n\n // Prefix data with character count indicator.\n // The character count indicator is a string of bits that represents the\n // number of characters that are being encoded.\n // The character count indicator must be placed after the mode indicator\n // and must be a certain number of bits long, depending on the QR version\n // and data mode\n // @see {@link Mode.getCharCountIndicator}.\n buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n // add binary data sequence to buffer\n data.write(buffer)\n })\n\n // Calculate required number of bits\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n // Add a terminator.\n // If the bit string is shorter than the total number of required bits,\n // a terminator of up to four 0s must be added to the right side of the string.\n // If the bit string is more than four bits shorter than the required number of bits,\n // add four 0s to the end.\n if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n buffer.put(0, 4)\n }\n\n // If the bit string is fewer than four bits shorter, add only the number of 0s that\n // are needed to reach the required number of bits.\n\n // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n // pad the string on the right with 0s to make the string's length a multiple of 8.\n while (buffer.getLengthInBits() % 8 !== 0) {\n buffer.putBit(0)\n }\n\n // Add pad bytes if the string is still shorter than the total number of required bits.\n // Extend the buffer to fill the data capacity of the symbol corresponding to\n // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n // and 00010001 (0x11) alternately.\n const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n for (let i = 0; i < remainingByte; i++) {\n buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n }\n\n return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param {BitBuffer} bitBuffer Data to encode\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n // Total number of blocks\n const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n // Calculate how many blocks each group should contain\n const blocksInGroup2 = totalCodewords % ecTotalBlocks\n const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n // Number of EC codewords is the same for both groups\n const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n const rs = new ReedSolomonEncoder(ecCount)\n\n let offset = 0\n const dcData = new Array(ecTotalBlocks)\n const ecData = new Array(ecTotalBlocks)\n let maxDataSize = 0\n const buffer = new Uint8Array(bitBuffer.buffer)\n\n // Divide the buffer into the required number of blocks\n for (let b = 0; b < ecTotalBlocks; b++) {\n const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n // extract a block of data from buffer\n dcData[b] = buffer.slice(offset, offset + dataSize)\n\n // Calculate EC codewords for this data block\n ecData[b] = rs.encode(dcData[b])\n\n offset += dataSize\n maxDataSize = Math.max(maxDataSize, dataSize)\n }\n\n // Create final data\n // Interleave the data and error correction codewords from each block\n const data = new Uint8Array(totalCodewords)\n let index = 0\n let i, r\n\n // Add data codewords\n for (i = 0; i < maxDataSize; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n if (i < dcData[r].length) {\n data[index++] = dcData[r][i]\n }\n }\n }\n\n // Apped EC codewords\n for (i = 0; i < ecCount; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n data[index++] = ecData[r][i]\n }\n }\n\n return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @param {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param {MaskPattern} maskPattern Mask pattern\n * @return {Object} Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n let segments\n\n if (Array.isArray(data)) {\n segments = Segments.fromArray(data)\n } else if (typeof data === 'string') {\n let estimatedVersion = version\n\n if (!estimatedVersion) {\n const rawSegments = Segments.rawSplit(data)\n\n // Estimate best version that can contain raw splitted segments\n estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n }\n\n // Build optimized segments\n // If estimated version is undefined, try with the highest version\n segments = Segments.fromString(data, estimatedVersion || 40)\n } else {\n throw new Error('Invalid data')\n }\n\n // Get the min version that can contain data\n const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n // If no version is found, data cannot be stored\n if (!bestVersion) {\n throw new Error('The amount of data is too big to be stored in a QR Code')\n }\n\n // If not specified, use min version as default\n if (!version) {\n version = bestVersion\n\n // Check if the specified version can contain the data\n } else if (version < bestVersion) {\n throw new Error('\\n' +\n 'The chosen QR Code version cannot contain this amount of data.\\n' +\n 'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n )\n }\n\n const dataBits = createData(version, errorCorrectionLevel, segments)\n\n // Allocate matrix buffer\n const moduleCount = Utils.getSymbolSize(version)\n const modules = new BitMatrix(moduleCount)\n\n // Add function modules\n setupFinderPattern(modules, version)\n setupTimingPattern(modules)\n setupAlignmentPattern(modules, version)\n\n // Add temporary dummy bits for format info just to set them as reserved.\n // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n // since the masking operation must be performed only on the encoding region.\n // These blocks will be replaced with correct values later in code.\n setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n if (version >= 7) {\n setupVersionInfo(modules, version)\n }\n\n // Add data codewords\n setupData(modules, dataBits)\n\n if (isNaN(maskPattern)) {\n // Find best mask pattern\n maskPattern = MaskPattern.getBestMask(modules,\n setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n }\n\n // Apply mask pattern\n MaskPattern.applyMask(maskPattern, modules)\n\n // Replace format info bits with correct values\n setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n return {\n modules: modules,\n version: version,\n errorCorrectionLevel: errorCorrectionLevel,\n maskPattern: maskPattern,\n segments: segments\n }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data Input data\n * @param {Object} options Optional configurations\n * @param {Number} options.version QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n if (typeof data === 'undefined' || data === '') {\n throw new Error('No input text')\n }\n\n let errorCorrectionLevel = ECLevel.M\n let version\n let mask\n\n if (typeof options !== 'undefined') {\n // Use higher error correction level as default\n errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n version = Version.from(options.version)\n mask = MaskPattern.from(options.maskPattern)\n\n if (options.toSJISFunc) {\n Utils.setToSJISFunction(options.toSJISFunc)\n }\n }\n\n return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n","function hex2rgba (hex) {\n if (typeof hex === 'number') {\n hex = hex.toString()\n }\n\n if (typeof hex !== 'string') {\n throw new Error('Color should be defined as hex string')\n }\n\n let hexCode = hex.slice().replace('#', '').split('')\n if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {\n throw new Error('Invalid hex color: ' + hex)\n }\n\n // Convert from short to long form (fff -> ffffff)\n if (hexCode.length === 3 || hexCode.length === 4) {\n hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {\n return [c, c]\n }))\n }\n\n // Add default alpha value\n if (hexCode.length === 6) hexCode.push('F', 'F')\n\n const hexValue = parseInt(hexCode.join(''), 16)\n\n return {\n r: (hexValue >> 24) & 255,\n g: (hexValue >> 16) & 255,\n b: (hexValue >> 8) & 255,\n a: hexValue & 255,\n hex: '#' + hexCode.slice(0, 6).join('')\n }\n}\n\nexports.getOptions = function getOptions (options) {\n if (!options) options = {}\n if (!options.color) options.color = {}\n\n const margin = typeof options.margin === 'undefined' ||\n options.margin === null ||\n options.margin < 0\n ? 4\n : options.margin\n\n const width = options.width && options.width >= 21 ? options.width : undefined\n const scale = options.scale || 4\n\n return {\n width: width,\n scale: width ? 4 : scale,\n margin: margin,\n color: {\n dark: hex2rgba(options.color.dark || '#000000ff'),\n light: hex2rgba(options.color.light || '#ffffffff')\n },\n type: options.type,\n rendererOpts: options.rendererOpts || {}\n }\n}\n\nexports.getScale = function getScale (qrSize, opts) {\n return opts.width && opts.width >= qrSize + opts.margin * 2\n ? opts.width / (qrSize + opts.margin * 2)\n : opts.scale\n}\n\nexports.getImageWidth = function getImageWidth (qrSize, opts) {\n const scale = exports.getScale(qrSize, opts)\n return Math.floor((qrSize + opts.margin * 2) * scale)\n}\n\nexports.qrToImageData = function qrToImageData (imgData, qr, opts) {\n const size = qr.modules.size\n const data = qr.modules.data\n const scale = exports.getScale(size, opts)\n const symbolSize = Math.floor((size + opts.margin * 2) * scale)\n const scaledMargin = opts.margin * scale\n const palette = [opts.color.light, opts.color.dark]\n\n for (let i = 0; i < symbolSize; i++) {\n for (let j = 0; j < symbolSize; j++) {\n let posDst = (i * symbolSize + j) * 4\n let pxColor = opts.color.light\n\n if (i >= scaledMargin && j >= scaledMargin &&\n i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {\n const iSrc = Math.floor((i - scaledMargin) / scale)\n const jSrc = Math.floor((j - scaledMargin) / scale)\n pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]\n }\n\n imgData[posDst++] = pxColor.r\n imgData[posDst++] = pxColor.g\n imgData[posDst++] = pxColor.b\n imgData[posDst] = pxColor.a\n }\n }\n}\n","const Utils = require('./utils')\n\nfunction clearCanvas (ctx, canvas, size) {\n ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n if (!canvas.style) canvas.style = {}\n canvas.height = size\n canvas.width = size\n canvas.style.height = size + 'px'\n canvas.style.width = size + 'px'\n}\n\nfunction getCanvasElement () {\n try {\n return document.createElement('canvas')\n } catch (e) {\n throw new Error('You need to specify a canvas element')\n }\n}\n\nexports.render = function render (qrData, canvas, options) {\n let opts = options\n let canvasEl = canvas\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!canvas) {\n canvasEl = getCanvasElement()\n }\n\n opts = Utils.getOptions(opts)\n const size = Utils.getImageWidth(qrData.modules.size, opts)\n\n const ctx = canvasEl.getContext('2d')\n const image = ctx.createImageData(size, size)\n Utils.qrToImageData(image.data, qrData, opts)\n\n clearCanvas(ctx, canvasEl, size)\n ctx.putImageData(image, 0, 0)\n\n return canvasEl\n}\n\nexports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {\n let opts = options\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!opts) opts = {}\n\n const canvasEl = exports.render(qrData, canvas, opts)\n\n const type = opts.type || 'image/png'\n const rendererOpts = opts.rendererOpts || {}\n\n return canvasEl.toDataURL(type, rendererOpts.quality)\n}\n","const Utils = require('./utils')\n\nfunction getColorAttrib (color, attrib) {\n const alpha = color.a / 255\n const str = attrib + '=\"' + color.hex + '\"'\n\n return alpha < 1\n ? str + ' ' + attrib + '-opacity=\"' + alpha.toFixed(2).slice(1) + '\"'\n : str\n}\n\nfunction svgCmd (cmd, x, y) {\n let str = cmd + x\n if (typeof y !== 'undefined') str += ' ' + y\n\n return str\n}\n\nfunction qrToPath (data, size, margin) {\n let path = ''\n let moveBy = 0\n let newRow = false\n let lineLength = 0\n\n for (let i = 0; i < data.length; i++) {\n const col = Math.floor(i % size)\n const row = Math.floor(i / size)\n\n if (!col && !newRow) newRow = true\n\n if (data[i]) {\n lineLength++\n\n if (!(i > 0 && col > 0 && data[i - 1])) {\n path += newRow\n ? svgCmd('M', col + margin, 0.5 + row + margin)\n : svgCmd('m', moveBy, 0)\n\n moveBy = 0\n newRow = false\n }\n\n if (!(col + 1 < size && data[i + 1])) {\n path += svgCmd('h', lineLength)\n lineLength = 0\n }\n } else {\n moveBy++\n }\n }\n\n return path\n}\n\nexports.render = function render (qrData, options, cb) {\n const opts = Utils.getOptions(options)\n const size = qrData.modules.size\n const data = qrData.modules.data\n const qrcodesize = size + opts.margin * 2\n\n const bg = !opts.color.light.a\n ? ''\n : ''\n\n const path =\n ''\n\n const viewBox = 'viewBox=\"' + '0 0 ' + qrcodesize + ' ' + qrcodesize + '\"'\n\n const width = !opts.width ? '' : 'width=\"' + opts.width + '\" height=\"' + opts.width + '\" '\n\n const svgTag = '\\n'\n\n if (typeof cb === 'function') {\n cb(null, svgTag)\n }\n\n return svgTag\n}\n","\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","// 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","import QRCode from 'qrcode'\nimport { imageTracer } from 'imagetracer'\n\n/**\n * Generate a QR code as a data URL (PNG)\n * @param {string} text - The text to encode in the QR code\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - Data URL of the generated QR code\n */\nexport const generateQRCode = async (text, foregroundColor = '#000000', backgroundColor = '#FFFFFF') => {\n try {\n const dataUrl = await QRCode.toDataURL(text, {\n color: {\n dark: foregroundColor,\n light: backgroundColor\n },\n width: 512,\n margin: 2,\n errorCorrectionLevel: 'H'\n })\n return dataUrl\n } catch (error) {\n console.error('Error generating QR code:', error)\n return null\n }\n}\n\n/**\n * Generate a QR code as SVG string\n * @param {string} text - The text to encode in the QR code\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - SVG string of the generated QR code\n */\nexport const generateSVGQRCode = async (text, foregroundColor = '#000000', backgroundColor = '#FFFFFF') => {\n try {\n const svgString = await QRCode.toString(text, {\n type: 'svg',\n width: 512,\n margin: 2,\n errorCorrectionLevel: 'H',\n color: {\n dark: foregroundColor,\n light: backgroundColor\n }\n })\n return svgString\n } catch (error) {\n console.error('Error generating SVG QR code:', error)\n return null\n }\n}\n\n/**\n * Add a custom image to a QR code data URL\n * @param {string} qrCodeUrl - The QR code data URL\n * @param {string} imageUrl - The custom image data URL\n * @param {number} imageSize - Image size as percentage (0-100)\n * @returns {Promise} - Data URL of QR code with embedded image\n */\nexport const addImageToQRCode = async (qrCodeUrl, imageUrl, imageSize = 20) => {\n return new Promise((resolve) => {\n const canvas = document.createElement('canvas')\n const ctx = canvas.getContext('2d')\n \n // Set canvas size\n canvas.width = 512\n canvas.height = 512\n \n // Create image objects\n const qrImage = new Image()\n const customImage = new Image()\n \n qrImage.onload = () => {\n // Draw QR code\n ctx.drawImage(qrImage, 0, 0, 512, 512)\n \n customImage.onload = () => {\n // Calculate image size based on user preference\n const calculatedImageSize = 512 * (imageSize / 100)\n \n // Calculate white box size with margin\n const margin = 16 // 8 pixel margin around the image\n const boxSize = calculatedImageSize + (margin * 2)\n const boxX = (512 - boxSize) / 2\n const boxY = (512 - boxSize) / 2\n \n // Draw white background box\n ctx.fillStyle = '#FFFFFF'\n ctx.fillRect(boxX, boxY, boxSize, boxSize)\n \n // Calculate image position within the white box\n const imageX = boxX + margin\n const imageY = boxY + margin\n \n // Draw custom image\n ctx.drawImage(customImage, imageX, imageY, calculatedImageSize, calculatedImageSize)\n \n // Convert canvas to data URL\n resolve(canvas.toDataURL('image/png'))\n }\n \n // Handle image loading errors\n customImage.onerror = () => {\n console.error('Error loading custom image')\n resolve(qrCodeUrl) // Return QR code without custom image\n }\n \n customImage.src = imageUrl\n }\n \n // Handle QR code loading errors\n qrImage.onerror = () => {\n console.error('Error loading QR code')\n resolve(qrCodeUrl) // Return original QR code if loading fails\n }\n \n qrImage.src = qrCodeUrl\n })\n}\n\n/**\n * Vectorize a bitmap image to SVG elements\n * @param {HTMLImageElement} img - The image element to vectorize\n * @param {number} targetSize - Target size in QR coordinate system\n * @param {number} x - X position in QR coordinate system\n * @param {number} y - Y position in QR coordinate system\n * @param {Document} svgDoc - The SVG document to add elements to\n * @returns {Promise} - SVG group element containing vectorized image\n */\nexport const vectorizeBitmap = (img, targetSize, x, y, svgDoc) => {\n return new Promise((resolve) => {\n // Create a canvas to get the image data\n const canvas = document.createElement('canvas')\n const ctx = canvas.getContext('2d')\n \n // Set canvas size to match the image\n canvas.width = img.width\n canvas.height = img.height\n \n // Draw the image to canvas\n ctx.drawImage(img, 0, 0)\n \n // Get image data for vectorization\n const imageData = ctx.getImageData(0, 0, canvas.width, canvas.height)\n \n // Create a group for the vectorized image\n const group = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'g')\n // Scale the image to fit within the target size in the QR coordinate system\n const scale = targetSize / Math.max(img.width, img.height)\n group.setAttribute('transform', `translate(${x.toFixed(2)}, ${y.toFixed(2)}) scale(${scale.toFixed(4)})`)\n \n // Sample pixels and create colored rectangles\n const sampleSize = Math.max(1, Math.floor(Math.min(img.width, img.height) / 32)) // Sample every N pixels\n const data = imageData.data\n \n for (let y = 0; y < img.height; y += sampleSize) {\n for (let x = 0; x < img.width; x += sampleSize) {\n const index = (y * img.width + x) * 4\n const r = data[index]\n const g = data[index + 1]\n const b = data[index + 2]\n const a = data[index + 3]\n \n // Only create rectangles for non-transparent pixels with sufficient opacity\n if (a > 128 && (r > 0 || g > 0 || b > 0)) {\n const rect = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'rect')\n rect.setAttribute('x', x.toFixed(2))\n rect.setAttribute('y', y.toFixed(2))\n rect.setAttribute('width', sampleSize.toFixed(2))\n rect.setAttribute('height', sampleSize.toFixed(2))\n rect.setAttribute('fill', `rgb(${r}, ${g}, ${b})`)\n group.appendChild(rect)\n }\n }\n }\n \n resolve(group)\n })\n}\n\n/**\n * Add a custom image to an SVG QR code\n * @param {string} svgString - The SVG QR code string\n * @param {string} imageUrl - The custom image data URL\n * @param {number} imageSize - Image size as percentage (0-100)\n * @returns {Promise} - SVG string with embedded image\n */\nexport const addImageToSVG = async (svgString, imageUrl, imageSize = 20) => {\n return new Promise((resolve) => {\n const img = new Image()\n \n img.onload = () => {\n // Parse the SVG string to add custom image\n const parser = new DOMParser()\n const svgDoc = parser.parseFromString(svgString, 'image/svg+xml')\n const svgElement = svgDoc.documentElement\n \n // Calculate image size and position with precise decimal coordinates\n // The QR code uses a 33x33 coordinate system, so we need to scale accordingly\n const qrSize = 33 // QR code coordinate system size\n const calculatedImageSize = qrSize * (imageSize / 100)\n const margin = 2 // Smaller margin for the 33x33 coordinate system\n const boxSize = calculatedImageSize + (margin * 2)\n const boxX = (qrSize - boxSize) / 2\n const boxY = (qrSize - boxSize) / 2\n const imageX = boxX + margin\n const imageY = boxY + margin\n \n // Create white background rectangle with precise positioning\n const whiteBox = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'rect')\n whiteBox.setAttribute('x', boxX.toFixed(2))\n whiteBox.setAttribute('y', boxY.toFixed(2))\n whiteBox.setAttribute('width', boxSize.toFixed(2))\n whiteBox.setAttribute('height', boxSize.toFixed(2))\n whiteBox.setAttribute('fill', '#FFFFFF')\n \n // Add elements to SVG\n svgElement.appendChild(whiteBox)\n \n // Handle different image types\n if (imageUrl.startsWith('data:image/svg+xml')) {\n console.log('Processing SVG image')\n // For SVG images, embed the SVG content directly with precise positioning\n const imageElement = svgDoc.createElementNS('http://www.w3.org/2000/svg', 'image')\n imageElement.setAttribute('x', imageX.toFixed(2))\n imageElement.setAttribute('y', imageY.toFixed(2))\n imageElement.setAttribute('width', calculatedImageSize.toFixed(2))\n imageElement.setAttribute('height', calculatedImageSize.toFixed(2))\n imageElement.setAttribute('href', imageUrl)\n svgElement.appendChild(imageElement)\n console.log('SVG image element added')\n \n // Convert back to string\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n } else {\n console.log('Processing bitmap image')\n // For bitmap images, convert to vector paths\n vectorizeBitmap(img, calculatedImageSize, imageX, imageY, svgDoc).then((vectorizedImage) => {\n svgElement.appendChild(vectorizedImage)\n console.log('Vectorized image group added')\n \n // Convert back to string\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n }).catch((error) => {\n console.error('Vectorization failed:', error)\n // Convert back to string without the image\n const serializer = new XMLSerializer()\n resolve(serializer.serializeToString(svgElement))\n })\n }\n }\n \n img.onerror = () => {\n console.error('Error loading image for SVG')\n resolve(svgString) // Return SVG without image if loading fails\n }\n \n img.src = imageUrl\n })\n}\n\n/**\n * Generate a complete SVG QR code with embedded image\n * @param {string} text - The text to encode in the QR code\n * @param {string} imageUrl - The custom image data URL (optional)\n * @param {number} imageSize - Image size as percentage (0-100, default: 20)\n * @param {string} foregroundColor - The foreground color (default: '#000000')\n * @param {string} backgroundColor - The background color (default: '#FFFFFF')\n * @returns {Promise} - Complete SVG string with embedded image\n */\nexport const generateCompleteSVGQRCode = async (\n text, \n imageUrl = null, \n imageSize = 20, \n foregroundColor = '#000000', \n backgroundColor = '#FFFFFF'\n) => {\n try {\n // Generate base SVG QR code\n const svgString = await generateSVGQRCode(text, foregroundColor, backgroundColor)\n \n if (!svgString) {\n return null\n }\n \n // Add custom image if provided\n if (imageUrl) {\n console.log('Adding custom image to SVG...')\n const result = await addImageToSVG(svgString, imageUrl, imageSize)\n console.log('SVG with image generated')\n return result\n }\n \n return svgString\n } catch (error) {\n console.error('Error generating complete SVG QR code:', error)\n return null\n }\n}\n\n/**\n * Download an SVG string as a file\n * @param {string} svgContent - The SVG content to download\n * @param {string} filename - The filename for the download (default: 'qrcode.svg')\n */\nexport const downloadSVG = (svgContent, filename = 'qrcode.svg') => {\n if (!svgContent) {\n console.error('No SVG content to download')\n return\n }\n \n // Create download link\n const blob = new Blob([svgContent], { type: 'image/svg+xml' })\n const url = URL.createObjectURL(blob)\n const a = document.createElement('a')\n a.href = url\n a.download = filename\n document.body.appendChild(a)\n a.click()\n document.body.removeChild(a)\n URL.revokeObjectURL(url)\n}\n\n/**\n * Convert a file to data URL\n * @param {File} file - The file to convert\n * @returns {Promise} - Data URL of the file\n */\nexport const fileToDataURL = (file) => {\n return new Promise((resolve, reject) => {\n const reader = new FileReader()\n reader.onload = () => resolve(reader.result)\n reader.onerror = reject\n reader.readAsDataURL(file)\n })\n}\n\n/**\n * Validate image file\n * @param {File} file - The file to validate\n * @param {number} maxSize - Maximum file size in bytes (default: 2MB)\n * @returns {Object} - Validation result with success boolean and error message\n */\nexport const validateImageFile = (file, maxSize = 2 * 1024 * 1024) => {\n const allowedTypes = ['image/jpeg', 'image/png', 'image/gif', 'image/webp', 'image/svg+xml']\n \n if (!allowedTypes.includes(file.type)) {\n return {\n success: false,\n error: 'Please select a valid image file (JPEG, PNG, GIF, WebP, or SVG)'\n }\n }\n \n if (file.size > maxSize) {\n return {\n success: false,\n error: `File size must be less than ${Math.round(maxSize / 1024 / 1024)}MB`\n }\n }\n \n return { success: true }\n} "],"names":["toSJISFunction","CODEWORDS_COUNT","utils","getSymbolSize","version","Error","getSymbolTotalCodewords","getBCHDigit","data","digit","setToSJISFunction","f","isKanjiModeEnabled","toSJIS","kanji","BitBuffer","this","buffer","length","L","bit","exports","M","Q","H","isValid","level","from","value","defaultValue","string","toLowerCase","fromString","e","prototype","get","index","bufIndex","Math","floor","put","num","i","putBit","getLengthInBits","push","bitBuffer","BitMatrix","size","Uint8Array","reservedBit","set","row","col","reserved","xor","isReserved","bitMatrix","require$$0","getRowColCoords","posCount","intervals","ceil","positions","reverse","getPositions","coords","pos","posLength","j","finderPattern","Patterns","PATTERN000","PATTERN001","PATTERN010","PATTERN011","PATTERN100","PATTERN101","PATTERN110","PATTERN111","PenaltyScores","getMaskAt","maskPattern","mask","isNaN","parseInt","getPenaltyN1","points","sameCountCol","sameCountRow","lastCol","lastRow","module","getPenaltyN2","last","getPenaltyN3","bitsCol","bitsRow","getPenaltyN4","darkCount","modulesCount","abs","applyMask","pattern","getBestMask","setupFormatFunc","numPatterns","Object","keys","bestPattern","lowerPenalty","Infinity","p","penalty","ECLevel","EC_BLOCKS_TABLE","EC_CODEWORDS_TABLE","errorCorrectionCode","getBlocksCount","errorCorrectionLevel","getTotalCodewordsCount","EXP_TABLE","LOG_TABLE","x","galoisField","log","n","exp","mul","y","GF","p1","p2","coeff","mod","divident","divisor","result","offset","slice","generateECPolynomial","degree","poly","Polynomial","ReedSolomonEncoder","genPoly","initialize","encode","paddedData","remainder","start","buff","reedSolomonEncoder","versionCheck","numeric","replace","byte","regex","KANJI","RegExp","BYTE_KANJI","BYTE","NUMERIC","ALPHANUMERIC","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","testKanji","str","test","testNumeric","testAlphanumeric","VersionCheck","Regex","require$$1","id","ccBits","MIXED","getCharCountIndicator","mode","getBestModeForData","dataStr","toString","Utils","ECCode","require$$2","Mode","require$$3","require$$4","G18_BCH","getReservedBitsCount","getTotalBitsFromDataArray","segments","totalBits","forEach","reservedBits","getBitsLength","getCapacity","dataTotalCodewordsBits","usableBits","getBestVersionForData","seg","ecl","Array","isArray","currentVersion","getBestVersionForMixedData","getBestVersionForDataLength","getLength","getEncodedBits","d","G15_BCH","formatInfo","NumericData","write","group","substr","remainingNum","numericData","ALPHA_NUM_CHARS","AlphanumericData","indexOf","alphanumericData","ByteData","TextEncoder","l","byteData","KanjiData","dijkstra","kanjiData","single_source_shortest_paths","graph","s","predecessors","costs","closest","u","v","cost_of_s_to_u","adjacent_nodes","cost_of_s_to_u_plus_cost_of_e","cost_of_s_to_v","open","PriorityQueue","make","empty","pop","cost","hasOwnProperty","msg","join","extract_shortest_path_from_predecessor_list","nodes","find_path","opts","key","T","t","queue","sorter","default_sorter","a","b","item","sort","shift","require$$5","require$$6","require$$7","getStringByteLength","unescape","encodeURIComponent","getSegments","exec","getSegmentsFromString","numSegs","alphaNumSegs","byteSegs","kanjiSegs","concat","s1","s2","map","obj","getSegmentBitsLength","buildSingleSegment","modesHint","bestMode","fromArray","array","reduce","acc","segs","buildNodes","table","prevNodeIds","nodeGroup","currentNodeIds","node","lastCount","prevNodeId","end","buildGraph","path","optimizedSegs","curr","prevSeg","mergeSegments","rawSplit","AlignmentPattern","FinderPattern","MaskPattern","require$$8","Version","require$$9","FormatInfo","require$$10","require$$11","Segments","require$$12","setupFormatInfo","matrix","bits","createData","remainingByte","totalCodewords","ecTotalCodewords","dataTotalCodewords","ecTotalBlocks","blocksInGroup2","blocksInGroup1","totalCodewordsInGroup1","dataCodewordsInGroup1","dataCodewordsInGroup2","ecCount","rs","dcData","ecData","maxDataSize","dataSize","max","r","createCodewords","createSymbol","estimatedVersion","rawSegments","bestVersion","dataBits","moduleCount","modules","c","setupFinderPattern","setupTimingPattern","setupAlignmentPattern","setupVersionInfo","inc","bitIndex","byteIndex","dark","setupData","bind","qrcode","create","options","toSJISFunc","hex2rgba","hex","hexCode","split","apply","hexValue","g","getOptions","color","margin","width","scale","light","type","rendererOpts","getScale","qrSize","getImageWidth","qrToImageData","imgData","qr","symbolSize","scaledMargin","palette","posDst","pxColor","render","qrData","canvas","canvasEl","getContext","document","createElement","getCanvasElement","ctx","image","createImageData","clearRect","height","style","clearCanvas","putImageData","renderToDataURL","toDataURL","quality","getColorAttrib","attrib","alpha","toFixed","svgCmd","cmd","svgTag","cb","qrcodesize","bg","moveBy","newRow","lineLength","qrToPath","viewBox","canPromise","Promise","then","QRCode","CanvasRenderer","SvgRenderer","renderCanvas","renderFunc","text","args","call","arguments","argsNum","isLastArgCb","resolve","reject","browser","toCanvas","_","generateSVGQRCode","async","foregroundColor","backgroundColor","error","console","vectorizeBitmap","img","targetSize","svgDoc","drawImage","imageData","getImageData","createElementNS","setAttribute","sampleSize","min","rect","appendChild","addImageToSVG","svgString","imageUrl","imageSize","Image","onload","DOMParser","parseFromString","svgElement","documentElement","calculatedImageSize","boxSize","boxX","boxY","imageX","imageY","whiteBox","startsWith","imageElement","serializer","XMLSerializer","serializeToString","vectorizedImage","catch","onerror","src","qrCodeUrl","qrImage","customImage","fillStyle","fillRect","svgContent","filename","blob","Blob","url","URL","createObjectURL","href","download","body","click","removeChild","revokeObjectURL","file","reader","FileReader","readAsDataURL","maxSize","includes","success","round"],"mappings":"qQAAA,IAAIA,EACJ,MAAMC,EAAkB,CACtB,EACA,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC1C,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAC7C,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KACtD,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MASxDC,EAAAC,cAAwB,SAAwBC,GAC9C,IAAKA,EAAS,MAAM,IAAIC,MAAM,yCAC9B,GAAID,EAAU,GAAKA,EAAU,GAAI,MAAM,IAAIC,MAAM,6CACjD,OAAiB,EAAVD,EAAc,EACvB,EAQAF,EAAAI,wBAAkC,SAAkCF,GAClE,OAAOH,EAAgBG,EACzB,EAQAF,EAAAK,YAAsB,SAAUC,GAC9B,IAAIC,EAAQ,EAEZ,KAAgB,IAATD,GACLC,IACAD,KAAU,EAGZ,OAAOC,CACT,EAEAP,EAAAQ,kBAA4B,SAA4BC,GACtD,GAAiB,mBAANA,EACT,MAAM,IAAIN,MAAM,yCAGlBL,EAAiBW,CACnB,EAEAT,EAAAU,mBAA6B,WAC3B,YAAiC,IAAnBZ,CAChB,EAEAE,EAAAW,OAAiB,SAAiBC,GAChC,OAAOd,EAAec,EACxB,aC9DA,SAASC,IACPC,KAAKC,OAAS,GACdD,KAAKE,OAAS,CAChB,OCHAC,EAAY,CAAEC,IAAK,GACnBC,EAAAC,EAAY,CAAEF,IAAK,GACnBC,EAAAE,EAAY,CAAEH,IAAK,GACnBC,EAAAG,EAAY,CAAEJ,IAAK,GA+BnBC,EAAAI,QAAkB,SAAkBC,GAClC,OAAOA,QAA8B,IAAdA,EAAMN,KAC3BM,EAAMN,KAAO,GAAKM,EAAMN,IAAM,CAClC,EAEAC,EAAAM,KAAe,SAAeC,EAAOC,GACnC,GAAIR,EAAQI,QAAQG,GAClB,OAAOA,EAGT,IACE,OAxCJ,SAAqBE,GACnB,GAAsB,iBAAXA,EACT,MAAM,IAAIzB,MAAM,yBAKlB,OAFcyB,EAAOC,eAGnB,IAAK,IACL,IAAK,MACH,OAAOV,EAAQF,EAEjB,IAAK,IACL,IAAK,SACH,OAAOE,EAAQC,EAEjB,IAAK,IACL,IAAK,WACH,OAAOD,EAAQE,EAEjB,IAAK,IACL,IAAK,OACH,OAAOF,EAAQG,EAEjB,QACE,MAAM,IAAInB,MAAM,qBAAuByB,GAE7C,CAaWE,CAAWJ,EACtB,OAAWK,GACP,OAAOJ,CACX,CACA,ED5CAd,EAAUmB,UAAY,CAEpBC,IAAK,SAAUC,GACb,MAAMC,EAAWC,KAAKC,MAAMH,EAAQ,GACpC,OAA6D,IAApDpB,KAAKC,OAAOoB,KAAe,EAAID,EAAQ,EAAM,EAC1D,EAEEI,IAAK,SAAUC,EAAKvB,GAClB,IAAA,IAASwB,EAAI,EAAGA,EAAIxB,EAAQwB,IAC1B1B,KAAK2B,OAA4C,IAAnCF,IAASvB,EAASwB,EAAI,EAAM,GAEhD,EAEEE,gBAAiB,WACf,OAAO5B,KAAKE,MAChB,EAEEyB,OAAQ,SAAUvB,GAChB,MAAMiB,EAAWC,KAAKC,MAAMvB,KAAKE,OAAS,GACtCF,KAAKC,OAAOC,QAAUmB,GACxBrB,KAAKC,OAAO4B,KAAK,GAGfzB,IACFJ,KAAKC,OAAOoB,IAAc,MAAUrB,KAAKE,OAAS,GAGpDF,KAAKE,QACT,GAGA,IAAA4B,EAAiB/B,EE/BjB,SAASgC,EAAWC,GAClB,IAAKA,GAAQA,EAAO,EAClB,MAAM,IAAI3C,MAAM,qDAGlBW,KAAKgC,KAAOA,EACZhC,KAAKR,KAAO,IAAIyC,WAAWD,EAAOA,GAClChC,KAAKkC,YAAc,IAAID,WAAWD,EAAOA,EAC3C,CAWAD,EAAUb,UAAUiB,IAAM,SAAUC,EAAKC,EAAKzB,EAAO0B,GACnD,MAAMlB,EAAQgB,EAAMpC,KAAKgC,KAAOK,EAChCrC,KAAKR,KAAK4B,GAASR,EACf0B,IAAUtC,KAAKkC,YAAYd,IAAS,EAC1C,EASAW,EAAUb,UAAUC,IAAM,SAAUiB,EAAKC,GACvC,OAAOrC,KAAKR,KAAK4C,EAAMpC,KAAKgC,KAAOK,EACrC,EAUAN,EAAUb,UAAUqB,IAAM,SAAUH,EAAKC,EAAKzB,GAC5CZ,KAAKR,KAAK4C,EAAMpC,KAAKgC,KAAOK,IAAQzB,CACtC,EASAmB,EAAUb,UAAUsB,WAAa,SAAUJ,EAAKC,GAC9C,OAAOrC,KAAKkC,YAAYE,EAAMpC,KAAKgC,KAAOK,EAC5C,EAEA,IAAAI,EAAiBV,oBCtDjB,MAAM5C,EAAgBuD,EAAmBvD,cAgBzCkB,EAAAsC,gBAA0B,SAA0BvD,GAClD,GAAgB,IAAZA,EAAe,MAAO,GAE1B,MAAMwD,EAAWtB,KAAKC,MAAMnC,EAAU,GAAK,EACrC4C,EAAO7C,EAAcC,GACrByD,EAAqB,MAATb,EAAe,GAAmD,EAA9CV,KAAKwB,MAAMd,EAAO,KAAO,EAAIY,EAAW,IACxEG,EAAY,CAACf,EAAO,GAE1B,IAAA,IAASN,EAAI,EAAGA,EAAIkB,EAAW,EAAGlB,IAChCqB,EAAUrB,GAAKqB,EAAUrB,EAAI,GAAKmB,EAKpC,OAFAE,EAAUlB,KAAK,GAERkB,EAAUC,SACnB,EAsBA3C,EAAA4C,aAAuB,SAAuB7D,GAC5C,MAAM8D,EAAS,GACTC,EAAM9C,EAAQsC,gBAAgBvD,GAC9BgE,EAAYD,EAAIjD,OAEtB,IAAA,IAASwB,EAAI,EAAGA,EAAI0B,EAAW1B,IAC7B,IAAA,IAAS2B,EAAI,EAAGA,EAAID,EAAWC,IAElB,IAAN3B,GAAiB,IAAN2B,GACL,IAAN3B,GAAW2B,IAAMD,EAAY,GAC7B1B,IAAM0B,EAAY,GAAW,IAANC,GAI5BH,EAAOrB,KAAK,CAACsB,EAAIzB,GAAIyB,EAAIE,KAI7B,OAAOH,CACT,eClFA,MAAM/D,EAAgBuD,EAAmBvD,cAUzCmE,EAAAL,aAAuB,SAAuB7D,GAC5C,MAAM4C,EAAO7C,EAAcC,GAE3B,MAAO,CAEL,CAAC,EAAG,GAEJ,CAAC4C,EAhBuB,EAgBK,GAE7B,CAAC,EAAGA,EAlBoB,GAoB5B,wBCjBA3B,EAAAkD,SAAmB,CACjBC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,EACZC,WAAY,GAOd,MAAMC,EACA,EADAA,EAEA,EAFAA,EAGA,GAHAA,EAIA,GAkJN,SAASC,EAAWC,EAAaxC,EAAG2B,GAClC,OAAQa,GACN,KAAK7D,EAAQkD,SAASC,WAAY,OAAQ9B,EAAI2B,GAAK,GAAM,EACzD,KAAKhD,EAAQkD,SAASE,WAAY,OAAO/B,EAAI,GAAM,EACnD,KAAKrB,EAAQkD,SAASG,WAAY,OAAOL,EAAI,GAAM,EACnD,KAAKhD,EAAQkD,SAASI,WAAY,OAAQjC,EAAI2B,GAAK,GAAM,EACzD,KAAKhD,EAAQkD,SAASK,WAAY,OAAQtC,KAAKC,MAAMG,EAAI,GAAKJ,KAAKC,MAAM8B,EAAI,IAAM,GAAM,EACzF,KAAKhD,EAAQkD,SAASM,WAAY,OAAQnC,EAAI2B,EAAK,EAAK3B,EAAI2B,EAAK,GAAM,EACvE,KAAKhD,EAAQkD,SAASO,WAAY,OAASpC,EAAI2B,EAAK,EAAK3B,EAAI2B,EAAK,GAAK,GAAM,EAC7E,KAAKhD,EAAQkD,SAASQ,WAAY,OAASrC,EAAI2B,EAAK,GAAK3B,EAAI2B,GAAK,GAAK,GAAM,EAE7E,QAAS,MAAM,IAAIhE,MAAM,mBAAqB6E,GAElD,CAtJA7D,EAAAI,QAAkB,SAAkB0D,GAClC,OAAe,MAARA,GAAyB,KAATA,IAAgBC,MAAMD,IAASA,GAAQ,GAAKA,GAAQ,CAC7E,EASA9D,EAAAM,KAAe,SAAeC,GAC5B,OAAOP,EAAQI,QAAQG,GAASyD,SAASzD,EAAO,SAAM,CACxD,EASAP,EAAAiE,aAAuB,SAAuB9E,GAC5C,MAAMwC,EAAOxC,EAAKwC,KAClB,IAAIuC,EAAS,EACTC,EAAe,EACfC,EAAe,EACfC,EAAU,KACVC,EAAU,KAEd,IAAA,IAASvC,EAAM,EAAGA,EAAMJ,EAAMI,IAAO,CACnCoC,EAAeC,EAAe,EAC9BC,EAAUC,EAAU,KAEpB,IAAA,IAAStC,EAAM,EAAGA,EAAML,EAAMK,IAAO,CACnC,IAAIuC,EAASpF,EAAK2B,IAAIiB,EAAKC,GACvBuC,IAAWF,EACbF,KAEIA,GAAgB,IAAGD,GAAUP,GAAoBQ,EAAe,IACpEE,EAAUE,EACVJ,EAAe,GAGjBI,EAASpF,EAAK2B,IAAIkB,EAAKD,GACnBwC,IAAWD,EACbF,KAEIA,GAAgB,IAAGF,GAAUP,GAAoBS,EAAe,IACpEE,EAAUC,EACVH,EAAe,EAEvB,CAEQD,GAAgB,IAAGD,GAAUP,GAAoBQ,EAAe,IAChEC,GAAgB,IAAGF,GAAUP,GAAoBS,EAAe,GACxE,CAEE,OAAOF,CACT,EAOAlE,EAAAwE,aAAuB,SAAuBrF,GAC5C,MAAMwC,EAAOxC,EAAKwC,KAClB,IAAIuC,EAAS,EAEb,IAAA,IAASnC,EAAM,EAAGA,EAAMJ,EAAO,EAAGI,IAChC,IAAA,IAASC,EAAM,EAAGA,EAAML,EAAO,EAAGK,IAAO,CACvC,MAAMyC,EAAOtF,EAAK2B,IAAIiB,EAAKC,GACzB7C,EAAK2B,IAAIiB,EAAKC,EAAM,GACpB7C,EAAK2B,IAAIiB,EAAM,EAAGC,GAClB7C,EAAK2B,IAAIiB,EAAM,EAAGC,EAAM,GAEb,IAATyC,GAAuB,IAATA,GAAYP,GACpC,CAGE,OAAOA,EAASP,CAClB,EAQA3D,EAAA0E,aAAuB,SAAuBvF,GAC5C,MAAMwC,EAAOxC,EAAKwC,KAClB,IAAIuC,EAAS,EACTS,EAAU,EACVC,EAAU,EAEd,IAAA,IAAS7C,EAAM,EAAGA,EAAMJ,EAAMI,IAAO,CACnC4C,EAAUC,EAAU,EACpB,IAAA,IAAS5C,EAAM,EAAGA,EAAML,EAAMK,IAC5B2C,EAAYA,GAAW,EAAK,KAASxF,EAAK2B,IAAIiB,EAAKC,GAC/CA,GAAO,KAAmB,OAAZ2C,GAAiC,KAAZA,IAAoBT,IAE3DU,EAAYA,GAAW,EAAK,KAASzF,EAAK2B,IAAIkB,EAAKD,GAC/CC,GAAO,KAAmB,OAAZ4C,GAAiC,KAAZA,IAAoBV,GAEjE,CAEE,OAAOA,EAASP,CAClB,EAUA3D,EAAA6E,aAAuB,SAAuB1F,GAC5C,IAAI2F,EAAY,EAChB,MAAMC,EAAe5F,EAAKA,KAAKU,OAE/B,IAAA,IAASwB,EAAI,EAAGA,EAAI0D,EAAc1D,IAAKyD,GAAa3F,EAAKA,KAAKkC,GAI9D,OAFUJ,KAAK+D,IAAI/D,KAAKwB,KAAkB,IAAZqC,EAAkBC,EAAgB,GAAK,IAE1DpB,CACb,EA+BA3D,EAAAiF,UAAoB,SAAoBC,EAAS/F,GAC/C,MAAMwC,EAAOxC,EAAKwC,KAElB,IAAA,IAASK,EAAM,EAAGA,EAAML,EAAMK,IAC5B,IAAA,IAASD,EAAM,EAAGA,EAAMJ,EAAMI,IACxB5C,EAAKgD,WAAWJ,EAAKC,IACzB7C,EAAK+C,IAAIH,EAAKC,EAAK4B,EAAUsB,EAASnD,EAAKC,GAGjD,EAQAhC,EAAAmF,YAAsB,SAAsBhG,EAAMiG,GAChD,MAAMC,EAAcC,OAAOC,KAAKvF,EAAQkD,UAAUrD,OAClD,IAAI2F,EAAc,EACdC,EAAeC,IAEnB,IAAA,IAASC,EAAI,EAAGA,EAAIN,EAAaM,IAAK,CACpCP,EAAgBO,GAChB3F,EAAQiF,UAAUU,EAAGxG,GAGrB,MAAMyG,EACJ5F,EAAQiE,aAAa9E,GACrBa,EAAQwE,aAAarF,GACrBa,EAAQ0E,aAAavF,GACrBa,EAAQ6E,aAAa1F,GAGvBa,EAAQiF,UAAUU,EAAGxG,GAEjByG,EAAUH,IACZA,EAAeG,EACfJ,EAAcG,EAEpB,CAEE,OAAOH,CACT,eCzOA,MAAMK,EAAUxD,EAEVyD,EAAkB,CAEtB,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,GACT,EAAG,EAAG,GAAI,GACV,EAAG,EAAG,GAAI,GACV,EAAG,EAAG,GAAI,GACV,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,EAAG,GAAI,GAAI,GACX,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,IAGRC,EAAqB,CAEzB,EAAG,GAAI,GAAI,GACX,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,GACZ,GAAI,GAAI,GAAI,IACZ,GAAI,GAAI,IAAK,IACb,GAAI,GAAI,IAAK,IACb,GAAI,IAAK,IAAK,IACd,GAAI,IAAK,IAAK,IACd,GAAI,IAAK,IAAK,IACd,GAAI,IAAK,IAAK,IACd,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,IACf,IAAK,IAAK,IAAK,KACf,IAAK,IAAK,IAAK,KACf,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,IAAK,KAAM,KAChB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,KACjB,IAAK,KAAM,KAAM,MAWnBC,EAAAC,eAAyB,SAAyBlH,EAASmH,GACzD,OAAQA,GACN,KAAKL,EAAQ/F,EACX,OAAOgG,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,KAAK8G,EAAQ5F,EACX,OAAO6F,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,KAAK8G,EAAQ3F,EACX,OAAO4F,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,KAAK8G,EAAQ1F,EACX,OAAO2F,EAAgC,GAAf/G,EAAU,GAAS,GAC7C,QACE,OAEN,EAUAiH,EAAAG,uBAAiC,SAAiCpH,EAASmH,GACzE,OAAQA,GACN,KAAKL,EAAQ/F,EACX,OAAOiG,EAAmC,GAAfhH,EAAU,GAAS,GAChD,KAAK8G,EAAQ5F,EACX,OAAO8F,EAAmC,GAAfhH,EAAU,GAAS,GAChD,KAAK8G,EAAQ3F,EACX,OAAO6F,EAAmC,GAAfhH,EAAU,GAAS,GAChD,KAAK8G,EAAQ1F,EACX,OAAO4F,EAAmC,GAAfhH,EAAU,GAAS,GAChD,QACE,OAEN,gBCtIA,MAAMqH,EAAY,IAAIxE,WAAW,KAC3ByE,EAAY,IAAIzE,WAAW,MAShC,WACC,IAAI0E,EAAI,EACR,IAAA,IAASjF,EAAI,EAAGA,EAAI,IAAKA,IACvB+E,EAAU/E,GAAKiF,EACfD,EAAUC,GAAKjF,EAEfiF,IAAM,EAIE,IAAJA,IACFA,GAAK,KAQT,IAAA,IAASjF,EAAI,IAAKA,EAAI,IAAKA,IACzB+E,EAAU/E,GAAK+E,EAAU/E,EAAI,IAEjC,CAtBC,GA8BDkF,EAAAC,IAAc,SAAcC,GAC1B,GAAIA,EAAI,EAAG,MAAM,IAAIzH,MAAM,OAASyH,EAAI,KACxC,OAAOJ,EAAUI,EACnB,EAQAF,EAAAG,IAAc,SAAcD,GAC1B,OAAOL,EAAUK,EACnB,EASAF,EAAAI,IAAc,SAAcL,EAAGM,GAC7B,OAAU,IAANN,GAAiB,IAANM,EAAgB,EAIxBR,EAAUC,EAAUC,GAAKD,EAAUO,GAC5C,cCpEA,MAAMC,EAAKxE,EASXrC,EAAA2G,IAAc,SAAcG,EAAIC,GAC9B,MAAMC,EAAQ,IAAIpF,WAAWkF,EAAGjH,OAASkH,EAAGlH,OAAS,GAErD,IAAA,IAASwB,EAAI,EAAGA,EAAIyF,EAAGjH,OAAQwB,IAC7B,IAAA,IAAS2B,EAAI,EAAGA,EAAI+D,EAAGlH,OAAQmD,IAC7BgE,EAAM3F,EAAI2B,IAAM6D,EAAGF,IAAIG,EAAGzF,GAAI0F,EAAG/D,IAIrC,OAAOgE,CACT,EASAhH,EAAAiH,IAAc,SAAcC,EAAUC,GACpC,IAAIC,EAAS,IAAIxF,WAAWsF,GAE5B,KAAQE,EAAOvH,OAASsH,EAAQtH,QAAW,GAAG,CAC5C,MAAMmH,EAAQI,EAAO,GAErB,IAAA,IAAS/F,EAAI,EAAGA,EAAI8F,EAAQtH,OAAQwB,IAClC+F,EAAO/F,IAAMwF,EAAGF,IAAIQ,EAAQ9F,GAAI2F,GAIlC,IAAIK,EAAS,EACb,KAAOA,EAASD,EAAOvH,QAA6B,IAAnBuH,EAAOC,IAAeA,IACvDD,EAASA,EAAOE,MAAMD,EAC1B,CAEE,OAAOD,CACT,EASApH,EAAAuH,qBAA+B,SAA+BC,GAC5D,IAAIC,EAAO,IAAI7F,WAAW,CAAC,IAC3B,IAAA,IAASP,EAAI,EAAGA,EAAImG,EAAQnG,IAC1BoG,EAAOzH,EAAQ2G,IAAIc,EAAM,IAAI7F,WAAW,CAAC,EAAGiF,EAAGH,IAAIrF,MAGrD,OAAOoG,CACT,MC7DA,MAAMC,EAAarF,EAEnB,SAASsF,EAAoBH,GAC3B7H,KAAKiI,aAAU,EACfjI,KAAK6H,OAASA,EAEV7H,KAAK6H,QAAQ7H,KAAKkI,WAAWlI,KAAK6H,OACxC,CAQAG,EAAmB9G,UAAUgH,WAAa,SAAqBL,GAE7D7H,KAAK6H,OAASA,EACd7H,KAAKiI,QAAUF,EAAWH,qBAAqB5H,KAAK6H,OACtD,EAQAG,EAAmB9G,UAAUiH,OAAS,SAAiB3I,GACrD,IAAKQ,KAAKiI,QACR,MAAM,IAAI5I,MAAM,2BAKlB,MAAM+I,EAAa,IAAInG,WAAWzC,EAAKU,OAASF,KAAK6H,QACrDO,EAAWjG,IAAI3C,GAIf,MAAM6I,EAAYN,EAAWT,IAAIc,EAAYpI,KAAKiI,SAK5CK,EAAQtI,KAAK6H,OAASQ,EAAUnI,OACtC,GAAIoI,EAAQ,EAAG,CACb,MAAMC,EAAO,IAAItG,WAAWjC,KAAK6H,QAGjC,OAFAU,EAAKpG,IAAIkG,EAAWC,GAEbC,CACX,CAEE,OAAOF,CACT,EAEA,IAAAG,EAAiBR,eCjDjBS,QAAkB,SAAkBrJ,GAClC,OAAQgF,MAAMhF,IAAYA,GAAW,GAAKA,GAAW,EACvD,QCRA,MAAMsJ,EAAU,SAEhB,IAAI5I,EAAQ,mNAIZA,EAAQA,EAAM6I,QAAQ,KAAM,OAE5B,MAAMC,EAAO,6BAA+B9I,EAAQ,kBAEpD+I,EAAAC,MAAgB,IAAIC,OAAOjJ,EAAO,KAClC+I,EAAAG,WAAqB,IAAID,OAAO,wBAAyB,KACzDF,EAAAI,KAAe,IAAIF,OAAOH,EAAM,KAChCC,EAAAK,QAAkB,IAAIH,OAAOL,EAAS,KACtCG,EAAAM,aAAuB,IAAIJ,OAbN,oBAa2B,KAEhD,MAAMK,EAAa,IAAIL,OAAO,IAAMjJ,EAAQ,KACtCuJ,EAAe,IAAIN,OAAO,IAAML,EAAU,KAC1CY,EAAoB,IAAIP,OAAO,0BAErCF,EAAAU,UAAoB,SAAoBC,GACtC,OAAOJ,EAAWK,KAAKD,EACzB,EAEAX,EAAAa,YAAsB,SAAsBF,GAC1C,OAAOH,EAAaI,KAAKD,EAC3B,EAEAX,EAAAc,iBAA2B,SAA2BH,GACpD,OAAOF,EAAkBG,KAAKD,EAChC,cC9BA,MAAMI,EAAelH,EACfmH,EAAQC,EASdzJ,EAAA6I,QAAkB,CAChBa,GAAI,UACJ3J,IAAK,EACL4J,OAAQ,CAAC,GAAI,GAAI,KAYnB3J,EAAA8I,aAAuB,CACrBY,GAAI,eACJ3J,IAAK,EACL4J,OAAQ,CAAC,EAAG,GAAI,KAQlB3J,EAAA4I,KAAe,CACbc,GAAI,OACJ3J,IAAK,EACL4J,OAAQ,CAAC,EAAG,GAAI,KAYlB3J,EAAAyI,MAAgB,CACdiB,GAAI,QACJ3J,IAAK,EACL4J,OAAQ,CAAC,EAAG,GAAI,KASlB3J,EAAA4J,MAAgB,CACd7J,KAAK,GAWPC,EAAA6J,sBAAgC,SAAgCC,EAAM/K,GACpE,IAAK+K,EAAKH,aAAc,IAAI3K,MAAM,iBAAmB8K,GAErD,IAAKP,EAAanJ,QAAQrB,GACxB,MAAM,IAAIC,MAAM,oBAAsBD,GAGxC,OAAIA,GAAW,GAAKA,EAAU,GAAW+K,EAAKH,OAAO,GAC5C5K,EAAU,GAAW+K,EAAKH,OAAO,GACnCG,EAAKH,OAAO,EACrB,EAQA3J,EAAA+J,mBAA6B,SAA6BC,GACxD,OAAIR,EAAMH,YAAYW,GAAiBhK,EAAQ6I,QACtCW,EAAMF,iBAAiBU,GAAiBhK,EAAQ8I,aAChDU,EAAMN,UAAUc,GAAiBhK,EAAQyI,MACtCzI,EAAQ4I,IACtB,EAQA5I,EAAAiK,SAAmB,SAAmBH,GACpC,GAAIA,GAAQA,EAAKJ,GAAI,OAAOI,EAAKJ,GACjC,MAAM,IAAI1K,MAAM,eAClB,EAQAgB,EAAAI,QAAkB,SAAkB0J,GAClC,OAAOA,GAAQA,EAAK/J,KAAO+J,EAAKH,MAClC,EAqCA3J,EAAAM,KAAe,SAAeC,EAAOC,GACnC,GAAIR,EAAQI,QAAQG,GAClB,OAAOA,EAGT,IACE,OAnCJ,SAAqBE,GACnB,GAAsB,iBAAXA,EACT,MAAM,IAAIzB,MAAM,yBAKlB,OAFcyB,EAAOC,eAGnB,IAAK,UACH,OAAOV,EAAQ6I,QACjB,IAAK,eACH,OAAO7I,EAAQ8I,aACjB,IAAK,QACH,OAAO9I,EAAQyI,MACjB,IAAK,OACH,OAAOzI,EAAQ4I,KACjB,QACE,MAAM,IAAI5J,MAAM,iBAAmByB,GAEzC,CAgBWE,CAAWJ,EACtB,OAAWK,GACP,OAAOJ,CACX,CACA,kBCtKA,MAAM0J,EAAQ7H,EACR8H,EAASV,EACT5D,EAAUuE,EACVC,EAAOC,EACPf,EAAegB,EAIfC,EAAUN,EAAMhL,YADT,MAab,SAASuL,EAAsBX,EAAM/K,GAEnC,OAAOsL,EAAKR,sBAAsBC,EAAM/K,GAAW,CACrD,CAEA,SAAS2L,EAA2BC,EAAU5L,GAC5C,IAAI6L,EAAY,EAOhB,OALAD,EAASE,QAAQ,SAAU1L,GACzB,MAAM2L,EAAeL,EAAqBtL,EAAK2K,KAAM/K,GACrD6L,GAAaE,EAAe3L,EAAK4L,eACrC,GAESH,CACT,CAqBA5K,EAAAM,KAAe,SAAeC,EAAOC,GACnC,OAAI+I,EAAanJ,QAAQG,GAChByD,SAASzD,EAAO,IAGlBC,CACT,EAWAR,EAAAgL,YAAsB,SAAsBjM,EAASmH,EAAsB4D,GACzE,IAAKP,EAAanJ,QAAQrB,GACxB,MAAM,IAAIC,MAAM,gCAIE,IAAT8K,IAAsBA,EAAOO,EAAKzB,MAG7C,MAMMqC,EAA+D,GAN9Cf,EAAMjL,wBAAwBF,GAG5BoL,EAAOhE,uBAAuBpH,EAASmH,IAKhE,GAAI4D,IAASO,EAAKT,MAAO,OAAOqB,EAEhC,MAAMC,EAAaD,EAAyBR,EAAqBX,EAAM/K,GAGvE,OAAQ+K,GACN,KAAKO,EAAKxB,QACR,OAAO5H,KAAKC,MAAOgK,EAAa,GAAM,GAExC,KAAKb,EAAKvB,aACR,OAAO7H,KAAKC,MAAOgK,EAAa,GAAM,GAExC,KAAKb,EAAK5B,MACR,OAAOxH,KAAKC,MAAMgK,EAAa,IAEjC,KAAKb,EAAKzB,KACV,QACE,OAAO3H,KAAKC,MAAMgK,EAAa,GAErC,EAUAlL,EAAAmL,sBAAgC,SAAgChM,EAAM+G,GACpE,IAAIkF,EAEJ,MAAMC,EAAMxF,EAAQvF,KAAK4F,EAAsBL,EAAQ5F,GAEvD,GAAIqL,MAAMC,QAAQpM,GAAO,CACvB,GAAIA,EAAKU,OAAS,EAChB,OAzFN,SAAqC8K,EAAUzE,GAC7C,IAAA,IAASsF,EAAiB,EAAGA,GAAkB,GAAIA,IAEjD,GADed,EAA0BC,EAAUa,IACrCxL,EAAQgL,YAAYQ,EAAgBtF,EAAsBmE,EAAKT,OAC3E,OAAO4B,CAKb,CAgFaC,CAA2BtM,EAAMkM,GAG1C,GAAoB,IAAhBlM,EAAKU,OACP,OAAO,EAGTuL,EAAMjM,EAAK,EACf,MACIiM,EAAMjM,EAGR,OA/HF,SAAsC2K,EAAMjK,EAAQqG,GAClD,IAAA,IAASsF,EAAiB,EAAGA,GAAkB,GAAIA,IACjD,GAAI3L,GAAUG,EAAQgL,YAAYQ,EAAgBtF,EAAsB4D,GACtE,OAAO0B,CAKb,CAuHSE,CAA4BN,EAAItB,KAAMsB,EAAIO,YAAaN,EAChE,EAYArL,EAAA4L,eAAyB,SAAyB7M,GAChD,IAAKwK,EAAanJ,QAAQrB,IAAYA,EAAU,EAC9C,MAAM,IAAIC,MAAM,2BAGlB,IAAI6M,EAAI9M,GAAW,GAEnB,KAAOmL,EAAMhL,YAAY2M,GAAKrB,GAAW,GACvCqB,GAvJS,MAuJK3B,EAAMhL,YAAY2M,GAAKrB,EAGvC,OAAQzL,GAAW,GAAM8M,CAC3B,eClKA,MAAM3B,EAAQ7H,EAIRyJ,EAAU5B,EAAMhL,YAFT,MAcb6M,EAAAH,eAAyB,SAAyB1F,EAAsBpC,GACtE,MAAM3E,EAAS+G,EAAqBnG,KAAO,EAAK+D,EAChD,IAAI+H,EAAI1M,GAAQ,GAEhB,KAAO+K,EAAMhL,YAAY2M,GAAKC,GAAW,GACvCD,GAnBS,MAmBK3B,EAAMhL,YAAY2M,GAAKC,EAMvC,OAxBgB,OAwBP3M,GAAQ,GAAM0M,EACzB,WC5BA,MAAMxB,EAAOhI,EAEb,SAAS2J,EAAa7M,GACpBQ,KAAKmK,KAAOO,EAAKxB,QACjBlJ,KAAKR,KAAOA,EAAK8K,UACnB,CAEA+B,EAAYjB,cAAgB,SAAwBlL,GAClD,OAAO,GAAKoB,KAAKC,MAAMrB,EAAS,IAAOA,EAAS,EAAOA,EAAS,EAAK,EAAI,EAAK,EAChF,EAEAmM,EAAYnL,UAAU8K,UAAY,WAChC,OAAOhM,KAAKR,KAAKU,MACnB,EAEAmM,EAAYnL,UAAUkK,cAAgB,WACpC,OAAOiB,EAAYjB,cAAcpL,KAAKR,KAAKU,OAC7C,EAEAmM,EAAYnL,UAAUoL,MAAQ,SAAgBxK,GAC5C,IAAIJ,EAAG6K,EAAO3L,EAId,IAAKc,EAAI,EAAGA,EAAI,GAAK1B,KAAKR,KAAKU,OAAQwB,GAAK,EAC1C6K,EAAQvM,KAAKR,KAAKgN,OAAO9K,EAAG,GAC5Bd,EAAQyD,SAASkI,EAAO,IAExBzK,EAAUN,IAAIZ,EAAO,IAKvB,MAAM6L,EAAezM,KAAKR,KAAKU,OAASwB,EACpC+K,EAAe,IACjBF,EAAQvM,KAAKR,KAAKgN,OAAO9K,GACzBd,EAAQyD,SAASkI,EAAO,IAExBzK,EAAUN,IAAIZ,EAAsB,EAAf6L,EAAmB,GAE5C,EAEA,IAAAC,EAAiBL,EC1CjB,MAAM3B,EAAOhI,EAWPiK,EAAkB,CACtB,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC7C,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC5D,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC5D,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAG1C,SAASC,EAAkBpN,GACzBQ,KAAKmK,KAAOO,EAAKvB,aACjBnJ,KAAKR,KAAOA,CACd,CAEAoN,EAAiBxB,cAAgB,SAAwBlL,GACvD,OAAO,GAAKoB,KAAKC,MAAMrB,EAAS,GAAUA,EAAS,EAAd,CACvC,EAEA0M,EAAiB1L,UAAU8K,UAAY,WACrC,OAAOhM,KAAKR,KAAKU,MACnB,EAEA0M,EAAiB1L,UAAUkK,cAAgB,WACzC,OAAOwB,EAAiBxB,cAAcpL,KAAKR,KAAKU,OAClD,EAEA0M,EAAiB1L,UAAUoL,MAAQ,SAAgBxK,GACjD,IAAIJ,EAIJ,IAAKA,EAAI,EAAGA,EAAI,GAAK1B,KAAKR,KAAKU,OAAQwB,GAAK,EAAG,CAE7C,IAAId,EAAgD,GAAxC+L,EAAgBE,QAAQ7M,KAAKR,KAAKkC,IAG9Cd,GAAS+L,EAAgBE,QAAQ7M,KAAKR,KAAKkC,EAAI,IAG/CI,EAAUN,IAAIZ,EAAO,GACzB,CAIMZ,KAAKR,KAAKU,OAAS,GACrB4B,EAAUN,IAAImL,EAAgBE,QAAQ7M,KAAKR,KAAKkC,IAAK,EAEzD,EAEA,IAAAoL,EAAiBF,EC1DjB,MAAMlC,EAAOhI,EAEb,SAASqK,EAAUvN,GACjBQ,KAAKmK,KAAOO,EAAKzB,KAEfjJ,KAAKR,KADe,iBAAVA,GACE,IAAIwN,aAAc7E,OAAO3I,GAEzB,IAAIyC,WAAWzC,EAE/B,CAEAuN,EAAS3B,cAAgB,SAAwBlL,GAC/C,OAAgB,EAATA,CACT,EAEA6M,EAAS7L,UAAU8K,UAAY,WAC7B,OAAOhM,KAAKR,KAAKU,MACnB,EAEA6M,EAAS7L,UAAUkK,cAAgB,WACjC,OAAO2B,EAAS3B,cAAcpL,KAAKR,KAAKU,OAC1C,EAEA6M,EAAS7L,UAAUoL,MAAQ,SAAUxK,GACnC,IAAA,IAASJ,EAAI,EAAGuL,EAAIjN,KAAKR,KAAKU,OAAQwB,EAAIuL,EAAGvL,IAC3CI,EAAUN,IAAIxB,KAAKR,KAAKkC,GAAI,EAEhC,EAEA,IAAAwL,EAAiBH,EC7BjB,MAAMrC,EAAOhI,EACP6H,EAAQT,EAEd,SAASqD,EAAW3N,GAClBQ,KAAKmK,KAAOO,EAAK5B,MACjB9I,KAAKR,KAAOA,CACd,CAEA2N,EAAU/B,cAAgB,SAAwBlL,GAChD,OAAgB,GAATA,CACT,EAEAiN,EAAUjM,UAAU8K,UAAY,WAC9B,OAAOhM,KAAKR,KAAKU,MACnB,EAEAiN,EAAUjM,UAAUkK,cAAgB,WAClC,OAAO+B,EAAU/B,cAAcpL,KAAKR,KAAKU,OAC3C,EAEAiN,EAAUjM,UAAUoL,MAAQ,SAAUxK,GACpC,IAAIJ,EAKJ,IAAKA,EAAI,EAAGA,EAAI1B,KAAKR,KAAKU,OAAQwB,IAAK,CACrC,IAAId,EAAQ2J,EAAM1K,OAAOG,KAAKR,KAAKkC,IAGnC,GAAId,GAAS,OAAUA,GAAS,MAE9BA,GAAS,UAGf,MAAeA,GAAS,OAAUA,GAAS,OAIrC,MAAM,IAAIvB,MACR,2BAA6BW,KAAKR,KAAKkC,GAAK,qCAH9Cd,GAAS,KAKf,CAIIA,EAAkC,KAAvBA,IAAU,EAAK,MAAyB,IAARA,GAG3CkB,EAAUN,IAAIZ,EAAO,GACzB,CACA,EAEA,IC9BIwM,GD8BJC,GAAiBF,qBC8Gf9M,QA5IE+M,GAAW,CACbE,6BAA8B,SAASC,EAAOC,EAAGtB,GAG/C,IAAIuB,EAAe,CAAA,EAIfC,EAAQ,CAAA,EACZA,EAAMF,GAAK,EAMX,IAGIG,EACAC,EAAGC,EACHC,EACAC,EAEAC,EACAC,EATAC,EAAOd,GAASe,cAAcC,OAWlC,IAVAF,EAAKrM,KAAK2L,EAAG,IAULU,EAAKG,SAaX,IAAKR,KATLD,GADAD,EAAUO,EAAKI,OACH1N,MACZkN,EAAiBH,EAAQY,KAGzBR,EAAiBR,EAAMK,IAAM,CAAA,EAMvBG,EAAeS,eAAeX,KAOhCG,EAAgCF,EALpBC,EAAeF,GAW3BI,EAAiBP,EAAMG,SACY,IAAbH,EAAMG,IACTI,EAAiBD,KAClCN,EAAMG,GAAKG,EACXE,EAAKrM,KAAKgM,EAAGG,GACbP,EAAaI,GAAKD,IAM1B,QAAiB,IAAN1B,QAAyC,IAAbwB,EAAMxB,GAAoB,CAC/D,IAAIuC,EAAM,CAAC,8BAA+BjB,EAAG,OAAQtB,EAAG,KAAKwC,KAAK,IAClE,MAAM,IAAIrP,MAAMoP,EACtB,CAEI,OAAOhB,CACX,EAEEkB,4CAA6C,SAASlB,EAAcvB,GAIlE,IAHA,IAAI0C,EAAQ,GACRhB,EAAI1B,EAED0B,GACLgB,EAAM/M,KAAK+L,GACGH,EAAaG,GAC3BA,EAAIH,EAAaG,GAGnB,OADAgB,EAAM5L,UACC4L,CACX,EAEEC,UAAW,SAAStB,EAAOC,EAAGtB,GAC5B,IAAIuB,EAAeL,GAASE,6BAA6BC,EAAOC,EAAGtB,GACnE,OAAOkB,GAASuB,4CACdlB,EAAcvB,EACpB,EAKEiC,cAAe,CACbC,KAAM,SAAUU,GACd,IAEIC,EAFAC,EAAI5B,GAASe,cACbc,EAAI,CAAA,EAGR,IAAKF,KADLD,EAAOA,GAAQ,CAAA,EACHE,EACNA,EAAER,eAAeO,KACnBE,EAAEF,GAAOC,EAAED,IAKf,OAFAE,EAAEC,MAAQ,GACVD,EAAEE,OAASL,EAAKK,QAAUH,EAAEI,eACrBH,CACb,EAEIG,eAAgB,SAAUC,EAAGC,GAC3B,OAAOD,EAAEd,KAAOe,EAAEf,IACxB,EAMI1M,KAAM,SAAUjB,EAAO2N,GACrB,IAAIgB,EAAO,CAAC3O,QAAc2N,QAC1BvO,KAAKkP,MAAMrN,KAAK0N,GAChBvP,KAAKkP,MAAMM,KAAKxP,KAAKmP,OAC3B,EAKIb,IAAK,WACH,OAAOtO,KAAKkP,MAAMO,OACxB,EAEIpB,MAAO,WACL,OAA6B,IAAtBrO,KAAKkP,MAAMhP,MACxB,mCC5JA,MAAMwK,EAAOhI,EACP2J,EAAcvC,EACd8C,EAAmBnC,EACnBsC,EAAWpC,EACXwC,EAAYvC,GACZf,EAAQ6F,EACRnF,EAAQoF,EACRvC,EAAWwC,GAQjB,SAASC,EAAqBrG,GAC5B,OAAOsG,SAASC,mBAAmBvG,IAAMtJ,MAC3C,CAUA,SAAS8P,EAAanH,EAAOsB,EAAMX,GACjC,MAAMwB,EAAW,GACjB,IAAIvD,EAEJ,KAAsC,QAA9BA,EAASoB,EAAMoH,KAAKzG,KAC1BwB,EAASnJ,KAAK,CACZrC,KAAMiI,EAAO,GACbrG,MAAOqG,EAAOrG,MACd+I,KAAMA,EACNjK,OAAQuH,EAAO,GAAGvH,SAItB,OAAO8K,CACT,CASA,SAASkF,EAAuB7F,GAC9B,MAAM8F,EAAUH,EAAYnG,EAAMX,QAASwB,EAAKxB,QAASmB,GACnD+F,EAAeJ,EAAYnG,EAAMV,aAAcuB,EAAKvB,aAAckB,GACxE,IAAIgG,EACAC,EAEA/F,EAAM3K,sBACRyQ,EAAWL,EAAYnG,EAAMZ,KAAMyB,EAAKzB,KAAMoB,GAC9CiG,EAAYN,EAAYnG,EAAMf,MAAO4B,EAAK5B,MAAOuB,KAEjDgG,EAAWL,EAAYnG,EAAMb,WAAY0B,EAAKzB,KAAMoB,GACpDiG,EAAY,IAKd,OAFaH,EAAQI,OAAOH,EAAcC,EAAUC,GAGjDd,KAAK,SAAUgB,EAAIC,GAClB,OAAOD,EAAGpP,MAAQqP,EAAGrP,KAC3B,GACKsP,IAAI,SAAUC,GACb,MAAO,CACLnR,KAAMmR,EAAInR,KACV2K,KAAMwG,EAAIxG,KACVjK,OAAQyQ,EAAIzQ,OAEpB,EACA,CAUA,SAAS0Q,EAAsB1Q,EAAQiK,GACrC,OAAQA,GACN,KAAKO,EAAKxB,QACR,OAAOmD,EAAYjB,cAAclL,GACnC,KAAKwK,EAAKvB,aACR,OAAOyD,EAAiBxB,cAAclL,GACxC,KAAKwK,EAAK5B,MACR,OAAOqE,EAAU/B,cAAclL,GACjC,KAAKwK,EAAKzB,KACR,OAAO8D,EAAS3B,cAAclL,GAEpC,CAsIA,SAAS2Q,EAAoBrR,EAAMsR,GACjC,IAAI3G,EACJ,MAAM4G,EAAWrG,EAAKN,mBAAmB5K,GAKzC,GAHA2K,EAAOO,EAAK/J,KAAKmQ,EAAWC,GAGxB5G,IAASO,EAAKzB,MAAQkB,EAAK/J,IAAM2Q,EAAS3Q,IAC5C,MAAM,IAAIf,MAAM,IAAMG,EAAO,iCACOkL,EAAKJ,SAASH,GAChD,0BAA4BO,EAAKJ,SAASyG,IAQ9C,OAJI5G,IAASO,EAAK5B,OAAUyB,EAAM3K,uBAChCuK,EAAOO,EAAKzB,MAGNkB,GACN,KAAKO,EAAKxB,QACR,OAAO,IAAImD,EAAY7M,GAEzB,KAAKkL,EAAKvB,aACR,OAAO,IAAIyD,EAAiBpN,GAE9B,KAAKkL,EAAK5B,MACR,OAAO,IAAIqE,EAAU3N,GAEvB,KAAKkL,EAAKzB,KACR,OAAO,IAAI8D,EAASvN,GAE1B,CAiBAa,EAAA2Q,UAAoB,SAAoBC,GACtC,OAAOA,EAAMC,OAAO,SAAUC,EAAK1F,GAOjC,MANmB,iBAARA,EACT0F,EAAItP,KAAKgP,EAAmBpF,EAAK,OACxBA,EAAIjM,MACb2R,EAAItP,KAAKgP,EAAmBpF,EAAIjM,KAAMiM,EAAItB,OAGrCgH,CACX,EAAK,GACL,EAUA9Q,EAAAW,WAAqB,SAAqBxB,EAAMJ,GAC9C,MAEMwP,EAxKR,SAAqBwC,GACnB,MAAMxC,EAAQ,GACd,IAAA,IAASlN,EAAI,EAAGA,EAAI0P,EAAKlR,OAAQwB,IAAK,CACpC,MAAM+J,EAAM2F,EAAK1P,GAEjB,OAAQ+J,EAAItB,MACV,KAAKO,EAAKxB,QACR0F,EAAM/M,KAAK,CAAC4J,EACV,CAAEjM,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKvB,aAAcjJ,OAAQuL,EAAIvL,QACvD,CAAEV,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQuL,EAAIvL,UAEjD,MACF,KAAKwK,EAAKvB,aACRyF,EAAM/M,KAAK,CAAC4J,EACV,CAAEjM,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQuL,EAAIvL,UAEjD,MACF,KAAKwK,EAAK5B,MACR8F,EAAM/M,KAAK,CAAC4J,EACV,CAAEjM,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQ2P,EAAoBpE,EAAIjM,SAErE,MACF,KAAKkL,EAAKzB,KACR2F,EAAM/M,KAAK,CACT,CAAErC,KAAMiM,EAAIjM,KAAM2K,KAAMO,EAAKzB,KAAM/I,OAAQ2P,EAAoBpE,EAAIjM,SAG7E,CAEE,OAAOoP,CACT,CA0IgByC,CAFDnB,EAAsB1Q,EAAM+K,EAAM3K,uBAGzC2N,EA7HR,SAAqBqB,EAAOxP,GAC1B,MAAMkS,EAAQ,CAAA,EACR/D,EAAQ,CAAEjF,MAAO,CAAA,GACvB,IAAIiJ,EAAc,CAAC,SAEnB,IAAA,IAAS7P,EAAI,EAAGA,EAAIkN,EAAM1O,OAAQwB,IAAK,CACrC,MAAM8P,EAAY5C,EAAMlN,GAClB+P,EAAiB,GAEvB,IAAA,IAASpO,EAAI,EAAGA,EAAImO,EAAUtR,OAAQmD,IAAK,CACzC,MAAMqO,EAAOF,EAAUnO,GACjB0L,EAAM,GAAKrN,EAAI2B,EAErBoO,EAAe5P,KAAKkN,GACpBuC,EAAMvC,GAAO,CAAE2C,OAAYC,UAAW,GACtCpE,EAAMwB,GAAO,CAAA,EAEb,IAAA,IAASjI,EAAI,EAAGA,EAAIyK,EAAYrR,OAAQ4G,IAAK,CAC3C,MAAM8K,EAAaL,EAAYzK,GAE3BwK,EAAMM,IAAeN,EAAMM,GAAYF,KAAKvH,OAASuH,EAAKvH,MAC5DoD,EAAMqE,GAAY7C,GAChB6B,EAAqBU,EAAMM,GAAYD,UAAYD,EAAKxR,OAAQwR,EAAKvH,MACrEyG,EAAqBU,EAAMM,GAAYD,UAAWD,EAAKvH,MAEzDmH,EAAMM,GAAYD,WAAaD,EAAKxR,SAEhCoR,EAAMM,OAAmBA,GAAYD,UAAYD,EAAKxR,QAE1DqN,EAAMqE,GAAY7C,GAAO6B,EAAqBc,EAAKxR,OAAQwR,EAAKvH,MAC9D,EAAIO,EAAKR,sBAAsBwH,EAAKvH,KAAM/K,GAEtD,CACA,CAEImS,EAAcE,CAClB,CAEE,IAAA,IAAS3K,EAAI,EAAGA,EAAIyK,EAAYrR,OAAQ4G,IACtCyG,EAAMgE,EAAYzK,IAAI+K,IAAM,EAG9B,MAAO,CAAEnB,IAAKnD,EAAO+D,QACvB,CAkFgBQ,CAAWlD,EAAOxP,GAC1B2S,EAAO3E,EAASyB,UAAUtB,EAAMmD,IAAK,QAAS,OAE9CsB,EAAgB,GACtB,IAAA,IAAStQ,EAAI,EAAGA,EAAIqQ,EAAK7R,OAAS,EAAGwB,IACnCsQ,EAAcnQ,KAAK0L,EAAM+D,MAAMS,EAAKrQ,IAAIgQ,MAG1C,OAAOrR,EAAQ2Q,UA9MjB,SAAwBI,GACtB,OAAOA,EAAKF,OAAO,SAAUC,EAAKc,GAChC,MAAMC,EAAUf,EAAIjR,OAAS,GAAK,EAAIiR,EAAIA,EAAIjR,OAAS,GAAK,KAC5D,OAAIgS,GAAWA,EAAQ/H,OAAS8H,EAAK9H,MACnCgH,EAAIA,EAAIjR,OAAS,GAAGV,MAAQyS,EAAKzS,KAC1B2R,IAGTA,EAAItP,KAAKoQ,GACFd,EACX,EAAK,GACL,CAmM2BgB,CAAcH,GACzC,EAYA3R,EAAA+R,SAAmB,SAAmB5S,GACpC,OAAOa,EAAQ2Q,UACbd,EAAsB1Q,EAAM+K,EAAM3K,sBAEtC,MCzUA,MAAM2K,GAAQ7H,EACRwD,GAAU4D,EACV/J,GAAY0K,EACZ1I,GAAY4I,EACZ0H,GAAmBzH,EACnB0H,GAAgB5C,EAChB6C,GAAc5C,EACdnF,GAASoF,EACT5H,GAAqBwK,EACrBC,GAAUC,EACVC,GAAaC,EACblI,GAAOmI,EACPC,GAAWC,EAqIjB,SAASC,GAAiBC,EAAQ1M,EAAsBrC,GACtD,MAAMlC,EAAOiR,EAAOjR,KACdkR,EAAOP,GAAW1G,eAAe1F,EAAsBrC,GAC7D,IAAIxC,EAAG4F,EAEP,IAAK5F,EAAI,EAAGA,EAAI,GAAIA,IAClB4F,EAA4B,IAApB4L,GAAQxR,EAAK,GAGjBA,EAAI,EACNuR,EAAO9Q,IAAIT,EAAG,EAAG4F,GAAK,GACb5F,EAAI,EACbuR,EAAO9Q,IAAIT,EAAI,EAAG,EAAG4F,GAAK,GAE1B2L,EAAO9Q,IAAIH,EAAO,GAAKN,EAAG,EAAG4F,GAAK,GAIhC5F,EAAI,EACNuR,EAAO9Q,IAAI,EAAGH,EAAON,EAAI,EAAG4F,GAAK,GACxB5F,EAAI,EACbuR,EAAO9Q,IAAI,EAAG,GAAKT,EAAI,EAAI,EAAG4F,GAAK,GAEnC2L,EAAO9Q,IAAI,EAAG,GAAKT,EAAI,EAAG4F,GAAK,GAKnC2L,EAAO9Q,IAAIH,EAAO,EAAG,EAAG,GAAG,EAC7B,CAwDA,SAASmR,GAAY/T,EAASmH,EAAsByE,GAElD,MAAM/K,EAAS,IAAIF,GAEnBiL,EAASE,QAAQ,SAAU1L,GAEzBS,EAAOuB,IAAIhC,EAAK2K,KAAK/J,IAAK,GAS1BH,EAAOuB,IAAIhC,EAAKwM,YAAatB,GAAKR,sBAAsB1K,EAAK2K,KAAM/K,IAGnEI,EAAK8M,MAAMrM,EACf,GAGE,MAEMqL,EAA+D,GAF9Cf,GAAMjL,wBAAwBF,GAC5BoL,GAAOhE,uBAAuBpH,EAASmH,IAiBhE,IATItG,EAAO2B,kBAAoB,GAAK0J,GAClCrL,EAAOuB,IAAI,EAAG,GAQTvB,EAAO2B,kBAAoB,GAAM,GACtC3B,EAAO0B,OAAO,GAOhB,MAAMyR,GAAiB9H,EAAyBrL,EAAO2B,mBAAqB,EAC5E,IAAA,IAASF,EAAI,EAAGA,EAAI0R,EAAe1R,IACjCzB,EAAOuB,IAAIE,EAAI,EAAI,GAAO,IAAM,GAGlC,OAYF,SAA0BI,EAAW1C,EAASmH,GAE5C,MAAM8M,EAAiB9I,GAAMjL,wBAAwBF,GAG/CkU,EAAmB9I,GAAOhE,uBAAuBpH,EAASmH,GAG1DgN,EAAqBF,EAAiBC,EAGtCE,EAAgBhJ,GAAOlE,eAAelH,EAASmH,GAG/CkN,EAAiBJ,EAAiBG,EAClCE,EAAiBF,EAAgBC,EAEjCE,EAAyBrS,KAAKC,MAAM8R,EAAiBG,GAErDI,EAAwBtS,KAAKC,MAAMgS,EAAqBC,GACxDK,EAAwBD,EAAwB,EAGhDE,EAAUH,EAAyBC,EAGnCG,EAAK,IAAI/L,GAAmB8L,GAElC,IAAIpM,EAAS,EACb,MAAMsM,EAAS,IAAIrI,MAAM6H,GACnBS,EAAS,IAAItI,MAAM6H,GACzB,IAAIU,EAAc,EAClB,MAAMjU,EAAS,IAAIgC,WAAWH,EAAU7B,QAGxC,IAAA,IAASqP,EAAI,EAAGA,EAAIkE,EAAelE,IAAK,CACtC,MAAM6E,EAAW7E,EAAIoE,EAAiBE,EAAwBC,EAG9DG,EAAO1E,GAAKrP,EAAO0H,MAAMD,EAAQA,EAASyM,GAG1CF,EAAO3E,GAAKyE,EAAG5L,OAAO6L,EAAO1E,IAE7B5H,GAAUyM,EACVD,EAAc5S,KAAK8S,IAAIF,EAAaC,EACxC,CAIE,MAAM3U,EAAO,IAAIyC,WAAWoR,GAC5B,IACI3R,EAAG2S,EADHjT,EAAQ,EAIZ,IAAKM,EAAI,EAAGA,EAAIwS,EAAaxS,IAC3B,IAAK2S,EAAI,EAAGA,EAAIb,EAAea,IACzB3S,EAAIsS,EAAOK,GAAGnU,SAChBV,EAAK4B,KAAW4S,EAAOK,GAAG3S,IAMhC,IAAKA,EAAI,EAAGA,EAAIoS,EAASpS,IACvB,IAAK2S,EAAI,EAAGA,EAAIb,EAAea,IAC7B7U,EAAK4B,KAAW6S,EAAOI,GAAG3S,GAI9B,OAAOlC,CACT,CAnFS8U,CAAgBrU,EAAQb,EAASmH,EAC1C,CA6FA,SAASgO,GAAc/U,EAAMJ,EAASmH,EAAsBrC,GAC1D,IAAI8G,EAEJ,GAAIW,MAAMC,QAAQpM,GAChBwL,EAAW8H,GAAS9B,UAAUxR,OAClC,IAA6B,iBAATA,EAchB,MAAM,IAAIH,MAAM,gBAdmB,CACnC,IAAImV,EAAmBpV,EAEvB,IAAKoV,EAAkB,CACrB,MAAMC,EAAc3B,GAASV,SAAS5S,GAGtCgV,EAAmB/B,GAAQjH,sBAAsBiJ,EAAalO,EACpE,CAIIyE,EAAW8H,GAAS9R,WAAWxB,EAAMgV,GAAoB,GAC7D,CAEA,CAGE,MAAME,EAAcjC,GAAQjH,sBAAsBR,EAAUzE,GAG5D,IAAKmO,EACH,MAAM,IAAIrV,MAAM,2DAIlB,GAAKD,GAIP,GAAaA,EAAUsV,EACnB,MAAM,IAAIrV,MAAM,wHAE0CqV,EAAc,YANxEtV,EAAUsV,EAUZ,MAAMC,EAAWxB,GAAW/T,EAASmH,EAAsByE,GAGrD4J,EAAcrK,GAAMpL,cAAcC,GAClCyV,EAAU,IAAI9S,GAAU6S,GAgC9B,OAzZF,SAA6B3B,EAAQ7T,GACnC,MAAM4C,EAAOiR,EAAOjR,KACdmB,EAAMmP,GAAcrP,aAAa7D,GAEvC,IAAA,IAASsC,EAAI,EAAGA,EAAIyB,EAAIjD,OAAQwB,IAAK,CACnC,MAAMU,EAAMe,EAAIzB,GAAG,GACbW,EAAMc,EAAIzB,GAAG,GAEnB,IAAA,IAAS2S,GAAI,EAAIA,GAAK,EAAGA,IACvB,KAAIjS,EAAMiS,IAAK,GAAMrS,GAAQI,EAAMiS,GAEnC,IAAA,IAASS,GAAI,EAAIA,GAAK,EAAGA,IACnBzS,EAAMyS,IAAK,GAAM9S,GAAQK,EAAMyS,IAE9BT,GAAK,GAAKA,GAAK,IAAY,IAANS,GAAiB,IAANA,IAClCA,GAAK,GAAKA,GAAK,IAAY,IAANT,GAAiB,IAANA,IAChCA,GAAK,GAAKA,GAAK,GAAKS,GAAK,GAAKA,GAAK,EACpC7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAM,GAEnC7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAO,GAI9C,CACA,CAoWEC,CAAmBF,EAASzV,GA3V9B,SAA6B6T,GAC3B,MAAMjR,EAAOiR,EAAOjR,KAEpB,IAAA,IAASqS,EAAI,EAAGA,EAAIrS,EAAO,EAAGqS,IAAK,CACjC,MAAMzT,EAAQyT,EAAI,GAAM,EACxBpB,EAAO9Q,IAAIkS,EAAG,EAAGzT,GAAO,GACxBqS,EAAO9Q,IAAI,EAAGkS,EAAGzT,GAAO,EAC5B,CACA,CAoVEoU,CAAmBH,GA1UrB,SAAgC5B,EAAQ7T,GACtC,MAAM+D,EAAMkP,GAAiBpP,aAAa7D,GAE1C,IAAA,IAASsC,EAAI,EAAGA,EAAIyB,EAAIjD,OAAQwB,IAAK,CACnC,MAAMU,EAAMe,EAAIzB,GAAG,GACbW,EAAMc,EAAIzB,GAAG,GAEnB,IAAA,IAAS2S,GAAI,EAAIA,GAAK,EAAGA,IACvB,IAAA,IAASS,GAAI,EAAIA,GAAK,EAAGA,KACb,IAANT,GAAkB,IAANA,IAAiB,IAANS,GAAkB,IAANA,GAC9B,IAANT,GAAiB,IAANS,EACZ7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAM,GAEnC7B,EAAO9Q,IAAIC,EAAMiS,EAAGhS,EAAMyS,GAAG,GAAO,EAI9C,CACA,CAyTEG,CAAsBJ,EAASzV,GAM/B4T,GAAgB6B,EAAStO,EAAsB,GAE3CnH,GAAW,GAzTjB,SAA2B6T,EAAQ7T,GACjC,MAAM4C,EAAOiR,EAAOjR,KACdkR,EAAOT,GAAQxG,eAAe7M,GACpC,IAAIgD,EAAKC,EAAKiF,EAEd,IAAA,IAAS5F,EAAI,EAAGA,EAAI,GAAIA,IACtBU,EAAMd,KAAKC,MAAMG,EAAI,GACrBW,EAAMX,EAAI,EAAIM,EAAO,EAAI,EACzBsF,EAA4B,IAApB4L,GAAQxR,EAAK,GAErBuR,EAAO9Q,IAAIC,EAAKC,EAAKiF,GAAK,GAC1B2L,EAAO9Q,IAAIE,EAAKD,EAAKkF,GAAK,EAE9B,CA6SI4N,CAAiBL,EAASzV,GA/P9B,SAAoB6T,EAAQzT,GAC1B,MAAMwC,EAAOiR,EAAOjR,KACpB,IAAImT,GAAM,EACN/S,EAAMJ,EAAO,EACboT,EAAW,EACXC,EAAY,EAEhB,IAAA,IAAShT,EAAML,EAAO,EAAGK,EAAM,EAAGA,GAAO,EAGvC,IAFY,IAARA,GAAWA,MAEF,CACX,IAAA,IAASyS,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK7B,EAAOzQ,WAAWJ,EAAKC,EAAMyS,GAAI,CACpC,IAAIQ,GAAO,EAEPD,EAAY7V,EAAKU,SACnBoV,EAAiD,IAAvC9V,EAAK6V,KAAeD,EAAY,IAG5CnC,EAAO9Q,IAAIC,EAAKC,EAAMyS,EAAGQ,GACzBF,KAEiB,IAAbA,IACFC,IACAD,EAAW,EAEvB,CAKM,GAFAhT,GAAO+S,EAEH/S,EAAM,GAAKJ,GAAQI,EAAK,CAC1BA,GAAO+S,EACPA,GAAOA,EACP,KACR,CACA,CAEA,CA6NEI,CAAUV,EAASF,GAEfvQ,MAAMF,KAERA,EAAcqO,GAAY/M,YAAYqP,EACpC7B,GAAgBwC,KAAK,KAAMX,EAAStO,KAIxCgM,GAAYjN,UAAUpB,EAAa2Q,GAGnC7B,GAAgB6B,EAAStO,EAAsBrC,GAExC,CACL2Q,UACAzV,QAASA,EACTmH,qBAAsBA,EACtBrC,YAAaA,EACb8G,SAAUA,EAEd,CAWAyK,EAAAC,OAAiB,SAAiBlW,EAAMmW,GACtC,QAAoB,IAATnW,GAAiC,KAATA,EACjC,MAAM,IAAIH,MAAM,iBAGlB,IACID,EACA+E,EAFAoC,EAAuBL,GAAQ5F,EAenC,YAXuB,IAAZqV,IAETpP,EAAuBL,GAAQvF,KAAKgV,EAAQpP,qBAAsBL,GAAQ5F,GAC1ElB,EAAUqT,GAAQ9R,KAAKgV,EAAQvW,SAC/B+E,EAAOoO,GAAY5R,KAAKgV,EAAQzR,aAE5ByR,EAAQC,YACVrL,GAAM7K,kBAAkBiW,EAAQC,aAI7BrB,GAAa/U,EAAMJ,EAASmH,EAAsBpC,EAC3D,+BC9eA,SAAS0R,EAAUC,GAKjB,GAJmB,iBAARA,IACTA,EAAMA,EAAIxL,YAGO,iBAARwL,EACT,MAAM,IAAIzW,MAAM,yCAGlB,IAAI0W,EAAUD,EAAInO,QAAQgB,QAAQ,IAAK,IAAIqN,MAAM,IACjD,GAAID,EAAQ7V,OAAS,GAAwB,IAAnB6V,EAAQ7V,QAAgB6V,EAAQ7V,OAAS,EACjE,MAAM,IAAIb,MAAM,sBAAwByW,GAInB,IAAnBC,EAAQ7V,QAAmC,IAAnB6V,EAAQ7V,SAClC6V,EAAUpK,MAAMzK,UAAUqP,OAAO0F,MAAM,GAAIF,EAAQrF,IAAI,SAAUoE,GAC/D,MAAO,CAACA,EAAGA,EACjB,KAIyB,IAAnBiB,EAAQ7V,QAAc6V,EAAQlU,KAAK,IAAK,KAE5C,MAAMqU,EAAW7R,SAAS0R,EAAQrH,KAAK,IAAK,IAE5C,MAAO,CACL2F,EAAI6B,GAAY,GAAM,IACtBC,EAAID,GAAY,GAAM,IACtB5G,EAAI4G,GAAY,EAAK,IACrB7G,EAAc,IAAX6G,EACHJ,IAAK,IAAMC,EAAQpO,MAAM,EAAG,GAAG+G,KAAK,IAExC,CAEArO,EAAA+V,WAAqB,SAAqBT,GACnCA,IAASA,EAAU,CAAA,GACnBA,EAAQU,QAAOV,EAAQU,MAAQ,CAAA,GAEpC,MAAMC,OAAmC,IAAnBX,EAAQW,QACT,OAAnBX,EAAQW,QACRX,EAAQW,OAAS,EACf,EACAX,EAAQW,OAENC,EAAQZ,EAAQY,OAASZ,EAAQY,OAAS,GAAKZ,EAAQY,WAAQ,EAC/DC,EAAQb,EAAQa,OAAS,EAE/B,MAAO,CACLD,QACAC,MAAOD,EAAQ,EAAIC,EACnBF,SACAD,MAAO,CACLf,KAAMO,EAASF,EAAQU,MAAMf,MAAQ,aACrCmB,MAAOZ,EAASF,EAAQU,MAAMI,OAAS,cAEzCC,KAAMf,EAAQe,KACdC,aAAchB,EAAQgB,cAAgB,CAAA,EAE1C,EAEAtW,EAAAuW,SAAmB,SAAmBC,EAAQ/H,GAC5C,OAAOA,EAAKyH,OAASzH,EAAKyH,OAASM,EAAuB,EAAd/H,EAAKwH,OAC7CxH,EAAKyH,OAASM,EAAuB,EAAd/H,EAAKwH,QAC5BxH,EAAK0H,KACX,EAEAnW,EAAAyW,cAAwB,SAAwBD,EAAQ/H,GACtD,MAAM0H,EAAQnW,EAAQuW,SAASC,EAAQ/H,GACvC,OAAOxN,KAAKC,OAAOsV,EAAuB,EAAd/H,EAAKwH,QAAcE,EACjD,EAEAnW,EAAA0W,cAAwB,SAAwBC,EAASC,EAAInI,GAC3D,MAAM9M,EAAOiV,EAAGpC,QAAQ7S,KAClBxC,EAAOyX,EAAGpC,QAAQrV,KAClBgX,EAAQnW,EAAQuW,SAAS5U,EAAM8M,GAC/BoI,EAAa5V,KAAKC,OAAOS,EAAqB,EAAd8M,EAAKwH,QAAcE,GACnDW,EAAerI,EAAKwH,OAASE,EAC7BY,EAAU,CAACtI,EAAKuH,MAAMI,MAAO3H,EAAKuH,MAAMf,MAE9C,IAAA,IAAS5T,EAAI,EAAGA,EAAIwV,EAAYxV,IAC9B,IAAA,IAAS2B,EAAI,EAAGA,EAAI6T,EAAY7T,IAAK,CACnC,IAAIgU,EAAgC,GAAtB3V,EAAIwV,EAAa7T,GAC3BiU,EAAUxI,EAAKuH,MAAMI,MAEzB,GAAI/U,GAAKyV,GAAgB9T,GAAK8T,GAC5BzV,EAAIwV,EAAaC,GAAgB9T,EAAI6T,EAAaC,EAAc,CAGhEG,EAAUF,EAAQ5X,EAFL8B,KAAKC,OAAOG,EAAIyV,GAAgBX,GAEfxU,EADjBV,KAAKC,OAAO8B,EAAI8T,GAAgBX,IACA,EAAI,EACzD,CAEMQ,EAAQK,KAAYC,EAAQjD,EAC5B2C,EAAQK,KAAYC,EAAQnB,EAC5Ba,EAAQK,KAAYC,EAAQhI,EAC5B0H,EAAQK,GAAUC,EAAQjI,CAChC,CAEA,mBClGA,MAAM9E,EAAQ7H,GAoBdrC,EAAAkX,OAAiB,SAAiBC,EAAQC,EAAQ9B,GAChD,IAAI7G,EAAO6G,EACP+B,EAAWD,OAEK,IAAT3I,GAA0B2I,GAAWA,EAAOE,aACrD7I,EAAO2I,EACPA,OAAS,GAGNA,IACHC,EAlBJ,WACE,IACE,OAAOE,SAASC,cAAc,SAClC,OAAW5W,GACP,MAAM,IAAI5B,MAAM,uCACpB,CACA,CAYeyY,IAGbhJ,EAAOvE,EAAM6L,WAAWtH,GACxB,MAAM9M,EAAOuI,EAAMuM,cAAcU,EAAO3C,QAAQ7S,KAAM8M,GAEhDiJ,EAAML,EAASC,WAAW,MAC1BK,EAAQD,EAAIE,gBAAgBjW,EAAMA,GAMxC,OALAuI,EAAMwM,cAAciB,EAAMxY,KAAMgY,EAAQ1I,GApC1C,SAAsBiJ,EAAKN,EAAQzV,GACjC+V,EAAIG,UAAU,EAAG,EAAGT,EAAOlB,MAAOkB,EAAOU,QAEpCV,EAAOW,QAAOX,EAAOW,MAAQ,CAAA,GAClCX,EAAOU,OAASnW,EAChByV,EAAOlB,MAAQvU,EACfyV,EAAOW,MAAMD,OAASnW,EAAO,KAC7ByV,EAAOW,MAAM7B,MAAQvU,EAAO,IAC9B,CA8BEqW,CAAYN,EAAKL,EAAU1V,GAC3B+V,EAAIO,aAAaN,EAAO,EAAG,GAEpBN,CACT,EAEArX,EAAAkY,gBAA0B,SAA0Bf,EAAQC,EAAQ9B,GAClE,IAAI7G,EAAO6G,OAES,IAAT7G,GAA0B2I,GAAWA,EAAOE,aACrD7I,EAAO2I,EACPA,OAAS,GAGN3I,IAAMA,EAAO,CAAA,GAElB,MAAM4I,EAAWrX,EAAQkX,OAAOC,EAAQC,EAAQ3I,GAE1C4H,EAAO5H,EAAK4H,MAAQ,YACpBC,EAAe7H,EAAK6H,cAAgB,CAAA,EAE1C,OAAOe,EAASc,UAAU9B,EAAMC,EAAa8B,QAC/C,iBC9DA,MAAMlO,GAAQ7H,GAEd,SAASgW,GAAgBrC,EAAOsC,GAC9B,MAAMC,EAAQvC,EAAMhH,EAAI,IAClB7F,EAAMmP,EAAS,KAAOtC,EAAMP,IAAM,IAExC,OAAO8C,EAAQ,EACXpP,EAAM,IAAMmP,EAAS,aAAeC,EAAMC,QAAQ,GAAGlR,MAAM,GAAK,IAChE6B,CACN,CAEA,SAASsP,GAAQC,EAAKpS,EAAGM,GACvB,IAAIuC,EAAMuP,EAAMpS,EAGhB,YAFiB,IAANM,IAAmBuC,GAAO,IAAMvC,GAEpCuC,CACT,CAsCAwP,GAAAzB,OAAiB,SAAiBC,EAAQ7B,EAASsD,GACjD,MAAMnK,EAAOvE,GAAM6L,WAAWT,GACxB3T,EAAOwV,EAAO3C,QAAQ7S,KACtBxC,EAAOgY,EAAO3C,QAAQrV,KACtB0Z,EAAalX,EAAqB,EAAd8M,EAAKwH,OAEzB6C,EAAMrK,EAAKuH,MAAMI,MAAMpH,EAEzB,SAAWqJ,GAAe5J,EAAKuH,MAAMI,MAAO,QAC5C,YAAcyC,EAAa,IAAMA,EAAa,SAF9C,GAIEnH,EACJ,SAAW2G,GAAe5J,EAAKuH,MAAMf,KAAM,UAC3C,OAjDJ,SAAmB9V,EAAMwC,EAAMsU,GAC7B,IAAIvE,EAAO,GACPqH,EAAS,EACTC,GAAS,EACTC,EAAa,EAEjB,IAAA,IAAS5X,EAAI,EAAGA,EAAIlC,EAAKU,OAAQwB,IAAK,CACpC,MAAMW,EAAMf,KAAKC,MAAMG,EAAIM,GACrBI,EAAMd,KAAKC,MAAMG,EAAIM,GAEtBK,GAAQgX,IAAQA,GAAS,GAE1B7Z,EAAKkC,IACP4X,IAEM5X,EAAI,GAAKW,EAAM,GAAK7C,EAAKkC,EAAI,KACjCqQ,GAAQsH,EACJP,GAAO,IAAKzW,EAAMiU,EAAQ,GAAMlU,EAAMkU,GACtCwC,GAAO,IAAKM,EAAQ,GAExBA,EAAS,EACTC,GAAS,GAGLhX,EAAM,EAAIL,GAAQxC,EAAKkC,EAAI,KAC/BqQ,GAAQ+G,GAAO,IAAKQ,GACpBA,EAAa,IAGfF,GAEN,CAEE,OAAOrH,CACT,CAeawH,CAAS/Z,EAAMwC,EAAM8M,EAAKwH,QAAU,MAEzCkD,EAAU,gBAAuBN,EAAa,IAAMA,EAAa,IAIjEF,EAAS,4CAFAlK,EAAKyH,MAAa,UAAYzH,EAAKyH,MAAQ,aAAezH,EAAKyH,MAAQ,KAA1D,IAEwCiD,EAAU,iCAAmCL,EAAKpH,EAAO,WAM7H,MAJkB,mBAAPkH,GACTA,EAAG,KAAMD,GAGJA,CACT,EC/EA,MAAMS,GCGW,WACf,MAA0B,mBAAZC,SAA0BA,QAAQxY,WAAawY,QAAQxY,UAAUyY,IACjF,EDHMC,GAAS9P,EACT+P,GAAiBpP,GACjBqP,GAAcnP,GAEpB,SAASoP,GAAcC,EAAYvC,EAAQwC,EAAMnL,EAAMmK,GACrD,MAAMiB,EAAO,GAAGvS,MAAMwS,KAAKC,UAAW,GAChCC,EAAUH,EAAKha,OACfoa,EAA2C,mBAAtBJ,EAAKG,EAAU,GAE1C,IAAKC,IAAgBb,KACnB,MAAM,IAAIpa,MAAM,sCAGlB,IAAIib,EAoBG,CACL,GAAID,EAAU,EACZ,MAAM,IAAIhb,MAAM,8BAYlB,OATgB,IAAZgb,GACFJ,EAAOxC,EACPA,EAAS3I,OAAO,GACK,IAAZuL,GAAkB5C,EAAOE,aAClC7I,EAAOmL,EACPA,EAAOxC,EACPA,OAAS,GAGJ,IAAIiC,QAAQ,SAAUa,EAASC,GACpC,IACE,MAAMhb,EAAOoa,GAAOlE,OAAOuE,EAAMnL,GACjCyL,EAAQP,EAAWxa,EAAMiY,EAAQ3I,GACzC,OAAe7N,GACPuZ,EAAOvZ,EACf,CACA,EACA,CAzCI,GAAIoZ,EAAU,EACZ,MAAM,IAAIhb,MAAM,8BAGF,IAAZgb,GACFpB,EAAKgB,EACLA,EAAOxC,EACPA,EAAS3I,OAAO,GACK,IAAZuL,IACL5C,EAAOE,iBAA4B,IAAPsB,GAC9BA,EAAKnK,EACLA,OAAO,IAEPmK,EAAKnK,EACLA,EAAOmL,EACPA,EAAOxC,EACPA,OAAS,IA2Bf,IACE,MAAMjY,EAAOoa,GAAOlE,OAAOuE,EAAMnL,GACjCmK,EAAG,KAAMe,EAAWxa,EAAMiY,EAAQ3I,GACtC,OAAW7N,GACPgY,EAAGhY,EACP,CACA,CAEAwZ,EAAA/E,OAAiBkE,GAAOlE,OACxB+E,EAAAC,SAAmBX,GAAavE,KAAK,KAAMqE,GAAetC,QAC1DkD,EAAAjC,UAAoBuB,GAAavE,KAAK,KAAMqE,GAAetB,iBAG3DkC,EAAAnQ,SAAmByP,GAAavE,KAAK,KAAM,SAAUhW,EAAMmb,EAAG7L,GAC5D,OAAOgL,GAAYvC,OAAO/X,EAAMsP,EAClC,GEjEY,MAyBC8L,GAAoBC,MAAOZ,EAAMa,EAAkB,UAAWC,EAAkB,aAC3F,IAWE,aAVwBnB,EAAOtP,SAAS2P,EAAM,CAC5CvD,KAAM,MACNH,MAAO,IACPD,OAAQ,EACR/P,qBAAsB,IACtB8P,MAAO,CACLf,KAAMwF,EACNrE,MAAOsE,IAIb,OAASC,GAEP,OADAC,QAAQD,MAAM,gCAAiCA,GACxC,IACT,GAgFWE,GAAkB,CAACC,EAAKC,EAAYzU,EAAGM,EAAGoU,IAC9C,IAAI3B,QAASa,IAElB,MAAM9C,EAASG,SAASC,cAAc,UAChCE,EAAMN,EAAOE,WAAW,MAG9BF,EAAOlB,MAAQ4E,EAAI5E,MACnBkB,EAAOU,OAASgD,EAAIhD,OAGpBJ,EAAIuD,UAAUH,EAAK,EAAG,GAGtB,MAAMI,EAAYxD,EAAIyD,aAAa,EAAG,EAAG/D,EAAOlB,MAAOkB,EAAOU,QAGxD5L,EAAQ8O,EAAOI,gBAAgB,6BAA8B,KAE7DjF,EAAQ4E,EAAa9Z,KAAK8S,IAAI+G,EAAI5E,MAAO4E,EAAIhD,QACnD5L,EAAMmP,aAAa,YAAa,aAAa/U,EAAEkS,QAAQ,OAAO5R,EAAE4R,QAAQ,aAAarC,EAAMqC,QAAQ,OAGnG,MAAM8C,EAAara,KAAK8S,IAAI,EAAG9S,KAAKC,MAAMD,KAAKsa,IAAIT,EAAI5E,MAAO4E,EAAIhD,QAAU,KACtE3Y,EAAO+b,EAAU/b,KAEvB,IAAA,IAASyH,EAAI,EAAGA,EAAIkU,EAAIhD,OAAQlR,GAAK0U,EACnC,IAAA,IAAShV,EAAI,EAAGA,EAAIwU,EAAI5E,MAAO5P,GAAKgV,EAAY,CAC9C,MAAMva,EAA8B,GAArB6F,EAAIkU,EAAI5E,MAAQ5P,GACzB0N,EAAI7U,EAAK4B,GACT+U,EAAI3W,EAAK4B,EAAQ,GACjBkO,EAAI9P,EAAK4B,EAAQ,GAIvB,GAHU5B,EAAK4B,EAAQ,GAGf,MAAQiT,EAAI,GAAK8B,EAAI,GAAK7G,EAAI,GAAI,CACxC,MAAMuM,EAAOR,EAAOI,gBAAgB,6BAA8B,QAClEI,EAAKH,aAAa,IAAK/U,EAAEkS,QAAQ,IACjCgD,EAAKH,aAAa,IAAKzU,EAAE4R,QAAQ,IACjCgD,EAAKH,aAAa,QAASC,EAAW9C,QAAQ,IAC9CgD,EAAKH,aAAa,SAAUC,EAAW9C,QAAQ,IAC/CgD,EAAKH,aAAa,OAAQ,OAAOrH,MAAM8B,MAAM7G,MAC7C/C,EAAMuP,YAAYD,EACpB,CACF,CAGFtB,EAAQhO,KAWCwP,GAAgBlB,MAAOmB,EAAWC,EAAUC,EAAY,KAC5D,IAAIxC,QAASa,IAClB,MAAMY,EAAM,IAAIgB,MAEhBhB,EAAIiB,OAAS,KAEX,MACMf,GADS,IAAIgB,WACGC,gBAAgBN,EAAW,iBAC3CO,EAAalB,EAAOmB,gBAKpBC,EAAgCP,EAAY,IADnC,GAGTQ,EAAUD,EAAuBnG,EACjCqG,GAJS,GAIQD,GAAW,EAC5BE,GALS,GAKQF,GAAW,EAC5BG,EAASF,EAJA,EAKTG,EAASF,EALA,EAQTG,EAAW1B,EAAOI,gBAAgB,6BAA8B,QAWtE,GAVAsB,EAASrB,aAAa,IAAKiB,EAAK9D,QAAQ,IACxCkE,EAASrB,aAAa,IAAKkB,EAAK/D,QAAQ,IACxCkE,EAASrB,aAAa,QAASgB,EAAQ7D,QAAQ,IAC/CkE,EAASrB,aAAa,SAAUgB,EAAQ7D,QAAQ,IAChDkE,EAASrB,aAAa,OAAQ,WAG9Ba,EAAWT,YAAYiB,GAGnBd,EAASe,WAAW,sBAAuB,CAC7C/B,QAAQpU,IAAI,wBAEZ,MAAMoW,EAAe5B,EAAOI,gBAAgB,6BAA8B,SAC1EwB,EAAavB,aAAa,IAAKmB,EAAOhE,QAAQ,IAC9CoE,EAAavB,aAAa,IAAKoB,EAAOjE,QAAQ,IAC9CoE,EAAavB,aAAa,QAASe,EAAoB5D,QAAQ,IAC/DoE,EAAavB,aAAa,SAAUe,EAAoB5D,QAAQ,IAChEoE,EAAavB,aAAa,OAAQO,GAClCM,EAAWT,YAAYmB,GACvBhC,QAAQpU,IAAI,2BAGZ,MAAMqW,EAAa,IAAIC,cACvB5C,EAAQ2C,EAAWE,kBAAkBb,GACvC,MACEtB,QAAQpU,IAAI,2BAEZqU,GAAgBC,EAAKsB,EAAqBI,EAAQC,EAAQzB,GAAQ1B,KAAM0D,IACtEd,EAAWT,YAAYuB,GACvBpC,QAAQpU,IAAI,gCAGZ,MAAMqW,EAAa,IAAIC,cACvB5C,EAAQ2C,EAAWE,kBAAkBb,MACpCe,MAAOtC,IACRC,QAAQD,MAAM,wBAAyBA,GAEvC,MAAMkC,EAAa,IAAIC,cACvB5C,EAAQ2C,EAAWE,kBAAkBb,OAK3CpB,EAAIoC,QAAU,KACZtC,QAAQD,MAAM,+BACdT,EAAQyB,IAGVb,EAAIqC,IAAMvB,uBAxMkBpB,MAAO4C,EAAWxB,EAAUC,EAAY,KAC/D,IAAIxC,QAASa,IAClB,MAAM9C,EAASG,SAASC,cAAc,UAChCE,EAAMN,EAAOE,WAAW,MAG9BF,EAAOlB,MAAQ,IACfkB,EAAOU,OAAS,IAGhB,MAAMuF,EAAU,IAAIvB,MACdwB,EAAc,IAAIxB,MAExBuB,EAAQtB,OAAS,KAEfrE,EAAIuD,UAAUoC,EAAS,EAAG,EAAG,IAAK,KAElCC,EAAYvB,OAAS,KAEnB,MAAMK,EAA6BP,EAAY,IAAnB,IAItBQ,EAAUD,EAAuBnG,GACjCqG,GAAQ,IAAMD,GAAW,EACzBE,GAAQ,IAAMF,GAAW,EAG/B3E,EAAI6F,UAAY,UAChB7F,EAAI8F,SAASlB,EAAMC,EAAMF,EAASA,GAGlC,MAAMG,EAASF,EAVA,GAWTG,EAASF,EAXA,GAcf7E,EAAIuD,UAAUqC,EAAad,EAAQC,EAAQL,EAAqBA,GAGhElC,EAAQ9C,EAAOe,UAAU,eAI3BmF,EAAYJ,QAAU,KACpBtC,QAAQD,MAAM,8BACdT,EAAQkD,IAGVE,EAAYH,IAAMvB,GAIpByB,EAAQH,QAAU,KAChBtC,QAAQD,MAAM,yBACdT,EAAQkD,IAGVC,EAAQF,IAAMC,qCA+LS,CAACK,EAAYC,EAAW,gBACjD,IAAKD,EAEH,YADA7C,QAAQD,MAAM,8BAKhB,MAAMgD,EAAO,IAAIC,KAAK,CAACH,GAAa,CAAEpH,KAAM,kBACtCwH,EAAMC,IAAIC,gBAAgBJ,GAC1B3O,EAAIuI,SAASC,cAAc,KACjCxI,EAAEgP,KAAOH,EACT7O,EAAEiP,SAAWP,EACbnG,SAAS2G,KAAKzC,YAAYzM,GAC1BA,EAAEmP,QACF5G,SAAS2G,KAAKE,YAAYpP,GAC1B8O,IAAIO,gBAAgBR,oBAQQS,GACrB,IAAIjF,QAAQ,CAACa,EAASC,KAC3B,MAAMoE,EAAS,IAAIC,WACnBD,EAAOxC,OAAS,IAAM7B,EAAQqE,EAAOnX,QACrCmX,EAAOrB,QAAU/C,EACjBoE,EAAOE,cAAcH,iCA/DgB9D,MACvCZ,EACAgC,EAAW,KACXC,EAAY,GACZpB,EAAkB,UAClBC,EAAkB,aAElB,IAEE,MAAMiB,QAAkBpB,GAAkBX,EAAMa,EAAiBC,GAEjE,IAAKiB,EACH,OAAO,KAIT,GAAIC,EAAU,CACZhB,QAAQpU,IAAI,iCACZ,MAAMY,QAAesU,GAAcC,EAAWC,EAAUC,GAExD,OADAjB,QAAQpU,IAAI,4BACLY,CACT,CAEA,OAAOuU,CACT,OAAShB,GAEP,OADAC,QAAQD,MAAM,yCAA0CA,GACjD,IACT,oBAnS4BH,MAAOZ,EAAMa,EAAkB,UAAWC,EAAkB,aACxF,IAUE,aATsBnB,EAAOpB,UAAUyB,EAAM,CAC3C5D,MAAO,CACLf,KAAMwF,EACNrE,MAAOsE,GAETxE,MAAO,IACPD,OAAQ,EACR/P,qBAAsB,KAG1B,OAASyU,GAEP,OADAC,QAAQD,MAAM,4BAA6BA,GACpC,IACT,8CAkU+B,CAAC2D,EAAMI,EAAU,UAC3B,CAAC,aAAc,YAAa,YAAa,aAAc,iBAE1DC,SAASL,EAAKjI,MAO5BiI,EAAK3c,KAAO+c,EACP,CACLE,SAAS,EACTjE,MAAO,+BAA+B1Z,KAAK4d,MAAMH,EAAU,KAAO,WAI/D,CAAEE,SAAS,GAbT,CACLA,SAAS,EACTjE,MAAO","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]}
\ No newline at end of file
diff --git a/examples/standalone-bundle-example.html b/examples/standalone-bundle-example.html
new file mode 100644
index 0000000..9fa5126
--- /dev/null
+++ b/examples/standalone-bundle-example.html
@@ -0,0 +1,259 @@
+
+
+
+
+
+ QR Code Generator - Standalone Bundle Example
+
+
+
+