OSDN -- Develop and Download Open Source Software
  • R/O
  • HTTP
  • SSH
  • HTTPS
Fork

Commit

Tags
No Tags

Frequently used words (click to add to your profile)

javac++androidlinuxc#windowsobjective-ccocoa誰得qtpythonphprubygameguibathyscaphec計画中(planning stage)翻訳omegatframeworktwitterdomtestvb.netdirectxゲームエンジンbtronarduinopreviewer

varius official platform source code.


Commit MetaInfo

Revision9068c1c30c9b389af92c776a788c2fab99f0671f (tree)
Time2023-04-01 23:06:32
AuthorNknightA <n.knight.pc0627@gmai...>
CommiterNknightA

Log Message

fix....2

Change Summary

Incremental Difference

--- a/server/README.md
+++ b/server/README.md
@@ -0,0 +1,15 @@
1+# 🚀 Welcome to your new awesome project!
2+
3+This project has been created using **webpack-cli**, you can now run
4+
5+```
6+npm run build
7+```
8+
9+or
10+
11+```
12+yarn build
13+```
14+
15+to bundle your application
--- /dev/null
+++ b/server/dist/components/background.js
@@ -0,0 +1,9 @@
1+"use strict";
2+Object.defineProperty(exports, "__esModule", { value: true });
3+var background_module_sass_1 = require("./background.module.sass");
4+function Background() {
5+ return (<div className={background_module_sass_1.default.Main}>
6+ <h1>Awesome METAVERSE...</h1>
7+ </div>);
8+}
9+exports.default = Background;
--- /dev/null
+++ b/server/dist/components/box.js
@@ -0,0 +1,21 @@
1+"use strict";
2+Object.defineProperty(exports, "__esModule", { value: true });
3+exports.Box = void 0;
4+var Box = function (_a) {
5+ var children = _a.children, w = _a.w, display = _a.display, bgColor = _a.bgColor, h = _a.h, m = _a.m, p = _a.p, jc = _a.jc, ai = _a.ai, textSize = _a.textSize;
6+ return (<div style={{
7+ backgroundColor: bgColor,
8+ color: '#000',
9+ height: h,
10+ width: w,
11+ display: display,
12+ justifyContent: jc,
13+ alignItems: ai,
14+ padding: p,
15+ margin: m,
16+ fontSize: textSize
17+ }}>
18+ {children}
19+ </div>);
20+};
21+exports.Box = Box;
--- /dev/null
+++ b/server/dist/index.js
@@ -0,0 +1 @@
1+console.log("Hello World!");
--- /dev/null
+++ b/server/dist/pages/_app.js
@@ -0,0 +1,8 @@
1+"use strict";
2+Object.defineProperty(exports, "__esModule", { value: true });
3+require("@/styles/globals.css");
4+function App(_a) {
5+ var Component = _a.Component, pageProps = _a.pageProps;
6+ return <Component {...pageProps}/>;
7+}
8+exports.default = App;
--- /dev/null
+++ b/server/dist/pages/_document.js
@@ -0,0 +1,21 @@
1+"use strict";
2+Object.defineProperty(exports, "__esModule", { value: true });
3+var document_1 = require("next/document");
4+function Document() {
5+ return (<document_1.Html lang="en">
6+ <document_1.Head>
7+ <title>a</title>
8+ <meta name="description" content="Generated by create next app"/>
9+ <meta name="viewport" content="width=device-width, initial-scale=1"/>
10+ <link rel="icon" href="/favicon.ico"/>
11+ </document_1.Head>
12+ <body>
13+ <header>
14+ <h1>V</h1>
15+ </header>
16+ <document_1.Main />
17+ <document_1.NextScript />
18+ </body>
19+ </document_1.Html>);
20+}
21+exports.default = Document;
--- /dev/null
+++ b/server/dist/pages/account.js
@@ -0,0 +1,78 @@
1+"use strict";
2+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
3+ function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
4+ return new (P || (P = Promise))(function (resolve, reject) {
5+ function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
6+ function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
7+ function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
8+ step((generator = generator.apply(thisArg, _arguments || [])).next());
9+ });
10+};
11+var __generator = (this && this.__generator) || function (thisArg, body) {
12+ var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
13+ return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
14+ function verb(n) { return function (v) { return step([n, v]); }; }
15+ function step(op) {
16+ if (f) throw new TypeError("Generator is already executing.");
17+ while (g && (g = 0, op[0] && (_ = 0)), _) try {
18+ if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
19+ if (y = 0, t) op = [op[0] & 2, t.value];
20+ switch (op[0]) {
21+ case 0: case 1: t = op; break;
22+ case 4: _.label++; return { value: op[1], done: false };
23+ case 5: _.label++; y = op[1]; op = [0]; continue;
24+ case 7: op = _.ops.pop(); _.trys.pop(); continue;
25+ default:
26+ if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
27+ if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
28+ if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
29+ if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
30+ if (t[2]) _.ops.pop();
31+ _.trys.pop(); continue;
32+ }
33+ op = body.call(thisArg, _);
34+ } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
35+ if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
36+ }
37+};
38+Object.defineProperty(exports, "__esModule", { value: true });
39+var react_1 = require("react");
40+function CreateAccount() {
41+ var _this = this;
42+ var _a = (0, react_1.useState)(""), email = _a[0], setEmail = _a[1];
43+ var _b = (0, react_1.useState)(""), password = _b[0], setPassword = _b[1];
44+ var handleSubmit = function () { return __awaiter(_this, void 0, void 0, function () {
45+ var response, data;
46+ return __generator(this, function (_a) {
47+ switch (_a.label) {
48+ case 0: return [4 /*yield*/, fetch("/api/account", {
49+ method: "POST",
50+ headers: {
51+ "Content-Type": "application/json",
52+ },
53+ body: JSON.stringify({ email: email, password: password }),
54+ })];
55+ case 1:
56+ response = _a.sent();
57+ return [4 /*yield*/, response.json()];
58+ case 2:
59+ data = _a.sent();
60+ console.log(data);
61+ return [2 /*return*/];
62+ }
63+ });
64+ }); };
65+ return (<div>
66+ <h1>Create Account</h1>,
67+ <label htmlFor="email">Email
68+ <form onSubmit={handleSubmit}>
69+ <input type="email" value={email} onChange={function (e) { return setEmail(e.target.value); }}/>
70+ </form>
71+ <form onSubmit={handleSubmit}>
72+ <input type="password" value={password} onChange={function (e) { return setPassword(e.target.value); }}/>
73+ </form>
74+ <button type="submit">Create Account</button>
75+ </label>
76+ </div>);
77+}
78+exports.default = CreateAccount;
--- /dev/null
+++ b/server/dist/pages/index.js
@@ -0,0 +1,31 @@
1+"use strict";
2+Object.defineProperty(exports, "__esModule", { value: true });
3+var head_1 = require("next/head");
4+var image_1 = require("next/image");
5+var Home_module_css_1 = require("@/styles/Home.module.css");
6+var home_module_sass_1 = require("../styles/home.module.sass");
7+//import Returnstatus from "@/status/store";
8+var account_1 = require("@/pages/account");
9+function Home() {
10+ var Devmode = function () {
11+ if (process.env.NODE_ENV === "development") {
12+ return (<p> development mode </p>);
13+ }
14+ else {
15+ return (<p> development mode </p>);
16+ }
17+ };
18+ return (<div className={home_module_sass_1.default.container}>
19+ <head_1.default>
20+ <title>V</title>
21+ </head_1.default>
22+ <main className={Home_module_css_1.default.main}>
23+ <image_1.default src="/image_4.png" alt="Logo" className={Home_module_css_1.default.vercelLogo} width={896} height={345} priority/>
24+ <p>insert code is : {' {process.env.NODE_ENV}'}.</p>
25+ <p>How to insert code is edit index.tsx</p>
26+ <account_1.default />
27+ <Devmode />
28+ </main>
29+ </div>);
30+}
31+exports.default = Home;
--- a/server/dist/server/server.js
+++ b/server/dist/server/server.js
@@ -35,6 +35,7 @@ var __generator = (this && this.__generator) || function (thisArg, body) {
3535 if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
3636 }
3737 };
38+<<<<<<< HEAD
3839 var __importDefault = (this && this.__importDefault) || function (mod) {
3940 return (mod && mod.__esModule) ? mod : { "default": mod };
4041 };
@@ -42,6 +43,12 @@ Object.defineProperty(exports, "__esModule", { value: true });
4243 var express_1 = __importDefault(require("express"));
4344 var next_1 = __importDefault(require("next"));
4445 var cgi_express_1 = __importDefault(require("cgi-express"));
46+=======
47+Object.defineProperty(exports, "__esModule", { value: true });
48+var express_1 = require("express");
49+var next_1 = require("next");
50+var cgi_express_1 = require("cgi-express");
51+>>>>>>> 3d6934ece3c932a823d57c986a6177820c87317c
4552 var dev = process.env.NODE_ENV === "production";
4653 var port = "https://variussoftware.com";
4754 var app = (0, next_1.default)({ dev: dev });
--- /dev/null
+++ b/server/dist/status/store.js
@@ -0,0 +1,22 @@
1+"use strict";
2+Object.defineProperty(exports, "__esModule", { value: true });
3+var toolkit_1 = require("@reduxjs/toolkit");
4+var react_1 = require("react");
5+function countterReducer(_a) {
6+ var _b = _a.state, state = _b === void 0 ? { value: 1 } : _b, action = _a.action;
7+ switch (action.type) {
8+ case "increment":
9+ return state + 1;
10+ case "decrement":
11+ return state - 1;
12+ default:
13+ return state;
14+ }
15+}
16+var storePal = (0, toolkit_1.createStore)(countterReducer);
17+function Returnstatus() {
18+ return (<>
19+ {storePal}
20+ </>);
21+}
22+exports.default = Returnstatus;
--- /dev/null
+++ b/server/index.html
@@ -0,0 +1,12 @@
1+<!DOCTYPE html>
2+<html>
3+ <head>
4+ <meta charset="utf-8" />
5+ <title>Webpack App</title>
6+ </head>
7+ <body>
8+ <h1>Hello world!</h1>
9+ <h2>Tip: Check your console</h2>
10+ </body>
11+
12+</html>
--- a/server/package.json
+++ b/server/package.json
@@ -1,11 +1,18 @@
11 {
2- "name": "v2",
3- "version": "0.4.43",
2+ "name": "v",
3+ "version": "0.4.47",
44 "private": true,
55 "scripts": {
66 "dev": "tsc -p tsconfig.server.json && cross-env NODE_ENV=development node ./dist/server/server.js",
77 "pre-build": "tsc -p tsconfig.server.json",
8+<<<<<<< HEAD
89 "build": "webpack"
10+=======
11+ "build": "webpack --mode=production --node-env=production",
12+ "build:dev": "webpack --mode=development",
13+ "build:prod": "webpack --mode=production --node-env=production",
14+ "watch": "webpack --watch"
15+>>>>>>> 3d6934ece3c932a823d57c986a6177820c87317c
916 },
1017 "dependencies": {
1118 "@reduxjs/toolkit": "^1.9.3",
@@ -20,22 +27,29 @@
2027 "next": "^13.2.4",
2128 "pg": "^8.10.0",
2229 "react": "^18.2.0",
23- "react-dom": "^18.2.0",
24- "sass": "^1.60.0",
25- "typescript": "^5.0.2"
30+ "react-dom": "^18.2.0"
2631 },
2732 "devDependencies": {
33+ "@webpack-cli/generators": "^3.0.1",
2834 "cross-env": "^7.0.3",
35+ "css-loader": "^6.7.3",
2936 "express": "^4.18.2",
3037 "html-loader": "^4.2.0",
3138 "html-webpack-plugin": "^5.5.0",
39+ "mini-css-extract-plugin": "^2.7.5",
3240 "nodemon": "^2.0.21",
33- "webpack": "^5.76.3",
41+ "prettier": "^2.8.6",
42+ "sass": "^1.60.0",
43+ "sass-loader": "^13.2.2",
44+ "style-loader": "^3.3.2",
45+ "ts-loader": "^9.4.2",
46+ "typescript": "^5.0.2",
47+ "webpack": "^5.77.0",
3448 "webpack-cli": "^5.0.1",
3549 "webpack-node-externals": "^3.0.0"
3650 },
3751 "main": "next.config.js",
3852 "author": "",
39- "license": "ISC",
53+ "license": "MIT",
4054 "description": ""
4155 }
--- /dev/null
+++ b/server/pud/index.html
@@ -0,0 +1,12 @@
1+<!DOCTYPE html>
2+<html>
3+ <head>
4+ <meta charset="utf-8" />
5+ <title>Webpack App</title>
6+ <script defer src="main.js"></script><link href="main.css" rel="stylesheet"></head>
7+ <body>
8+ <h1>Hello world!</h1>
9+ <h2>Tip: Check your console</h2>
10+ </body>
11+
12+</html>
--- /dev/null
+++ b/server/pud/main.css
@@ -0,0 +1,10 @@
1+/*!**********************************************************************************************!*\
2+ !*** css ../node_modules/css-loader/dist/cjs.js!../node_modules/next/font/google/target.css ***!
3+ \**********************************************************************************************/
4+/* target file for webpack loader */
5+
6+/*!*********************************************************************************************!*\
7+ !*** css ../node_modules/css-loader/dist/cjs.js!../node_modules/next/font/local/target.css ***!
8+ \*********************************************************************************************/
9+/* target file for webpack loader */
10+
--- /dev/null
+++ b/server/pud/main.js
@@ -0,0 +1,27444 @@
1+/*
2+ * ATTENTION: The "eval" devtool has been used (maybe by default in mode: "development").
3+ * This devtool is neither made for production nor for readable output files.
4+ * It uses "eval()" calls to create a separate source file in the browser devtools.
5+ * If you are trying to read the output file, select a different devtool (https://webpack.js.org/configuration/devtool/)
6+ * or disable the default devtool with "devtool: false".
7+ * If you are looking for production-ready output files, see mode: "production" (https://webpack.js.org/configuration/mode/).
8+ */
9+/******/ (() => { // webpackBootstrap
10+/******/ var __webpack_modules__ = ({
11+
12+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/array-set.js":
13+/*!***********************************************************************************!*\
14+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/array-set.js ***!
15+ \***********************************************************************************/
16+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
17+
18+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = __webpack_require__(/*! ./util */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js\");\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n this._array = [];\n this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n var set = new ArraySet();\n for (var i = 0, len = aArray.length; i < len; i++) {\n set.add(aArray[i], aAllowDuplicates);\n }\n return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n var idx = this._array.length;\n if (!isDuplicate || aAllowDuplicates) {\n this._array.push(aStr);\n }\n if (!isDuplicate) {\n if (hasNativeMap) {\n this._set.set(aStr, idx);\n } else {\n this._set[sStr] = idx;\n }\n }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n if (hasNativeMap) {\n return this._set.has(aStr);\n } else {\n var sStr = util.toSetString(aStr);\n return has.call(this._set, sStr);\n }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n if (hasNativeMap) {\n var idx = this._set.get(aStr);\n if (idx >= 0) {\n return idx;\n }\n } else {\n var sStr = util.toSetString(aStr);\n if (has.call(this._set, sStr)) {\n return this._set[sStr];\n }\n }\n\n throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n if (aIdx >= 0 && aIdx < this._array.length) {\n return this._array[aIdx];\n }\n throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/array-set.js?");
19+
20+/***/ }),
21+
22+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/base64-vlq.js":
23+/*!************************************************************************************!*\
24+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/base64-vlq.js ***!
25+ \************************************************************************************/
26+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
27+
28+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and/or other materials provided\n * with the distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = __webpack_require__(/*! ./base64 */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/base64.js\");\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n// Continuation\n// | Sign\n// | |\n// V V\n// 101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n * 2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n return aValue < 0\n ? ((-aValue) << 1) + 1\n : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n * 4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n var isNegative = (aValue & 1) === 1;\n var shifted = aValue >> 1;\n return isNegative\n ? -shifted\n : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n var encoded = \"\";\n var digit;\n\n var vlq = toVLQSigned(aValue);\n\n do {\n digit = vlq & VLQ_BASE_MASK;\n vlq >>>= VLQ_BASE_SHIFT;\n if (vlq > 0) {\n // There are still more digits in this value, so we must make sure the\n // continuation bit is marked.\n digit |= VLQ_CONTINUATION_BIT;\n }\n encoded += base64.encode(digit);\n } while (vlq > 0);\n\n return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n var strLen = aStr.length;\n var result = 0;\n var shift = 0;\n var continuation, digit;\n\n do {\n if (aIndex >= strLen) {\n throw new Error(\"Expected more digits in base 64 VLQ value.\");\n }\n\n digit = base64.decode(aStr.charCodeAt(aIndex++));\n if (digit === -1) {\n throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n }\n\n continuation = !!(digit & VLQ_CONTINUATION_BIT);\n digit &= VLQ_BASE_MASK;\n result = result + (digit << shift);\n shift += VLQ_BASE_SHIFT;\n } while (continuation);\n\n aOutParam.value = fromVLQSigned(result);\n aOutParam.rest = aIndex;\n};\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/base64-vlq.js?");
29+
30+/***/ }),
31+
32+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/base64.js":
33+/*!********************************************************************************!*\
34+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/base64.js ***!
35+ \********************************************************************************/
36+/***/ ((__unused_webpack_module, exports) => {
37+
38+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n if (0 <= number && number < intToCharMap.length) {\n return intToCharMap[number];\n }\n throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n var bigA = 65; // 'A'\n var bigZ = 90; // 'Z'\n\n var littleA = 97; // 'a'\n var littleZ = 122; // 'z'\n\n var zero = 48; // '0'\n var nine = 57; // '9'\n\n var plus = 43; // '+'\n var slash = 47; // '/'\n\n var littleOffset = 26;\n var numberOffset = 52;\n\n // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n if (bigA <= charCode && charCode <= bigZ) {\n return (charCode - bigA);\n }\n\n // 26 - 51: abcdefghijklmnopqrstuvwxyz\n if (littleA <= charCode && charCode <= littleZ) {\n return (charCode - littleA + littleOffset);\n }\n\n // 52 - 61: 0123456789\n if (zero <= charCode && charCode <= nine) {\n return (charCode - zero + numberOffset);\n }\n\n // 62: +\n if (charCode == plus) {\n return 62;\n }\n\n // 63: /\n if (charCode == slash) {\n return 63;\n }\n\n // Invalid base64 digit.\n return -1;\n};\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/base64.js?");
39+
40+/***/ }),
41+
42+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/binary-search.js":
43+/*!***************************************************************************************!*\
44+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/binary-search.js ***!
45+ \***************************************************************************************/
46+/***/ ((__unused_webpack_module, exports) => {
47+
48+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n // This function terminates when one of the following is true:\n //\n // 1. We find the exact element we are looking for.\n //\n // 2. We did not find the exact element, but we can return the index of\n // the next-closest element.\n //\n // 3. We did not find the exact element, and there is no next-closest\n // element than the one we are searching for, so we return -1.\n var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n var cmp = aCompare(aNeedle, aHaystack[mid], true);\n if (cmp === 0) {\n // Found the element we are looking for.\n return mid;\n }\n else if (cmp > 0) {\n // Our needle is greater than aHaystack[mid].\n if (aHigh - mid > 1) {\n // The element is in the upper half.\n return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // The exact needle element was not found in this haystack. Determine if\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return aHigh < aHaystack.length ? aHigh : -1;\n } else {\n return mid;\n }\n }\n else {\n // Our needle is less than aHaystack[mid].\n if (mid - aLow > 1) {\n // The element is in the lower half.\n return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return mid;\n } else {\n return aLow < 0 ? -1 : aLow;\n }\n }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n * array and returns -1, 0, or 1 depending on whether the needle is less\n * than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n if (aHaystack.length === 0) {\n return -1;\n }\n\n var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n if (index < 0) {\n return -1;\n }\n\n // We have found either the exact element, or the next-closest element than\n // the one we are searching for. However, there may be more than one such\n // element. Make sure we always return the smallest of these.\n while (index - 1 >= 0) {\n if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n break;\n }\n --index;\n }\n\n return index;\n};\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/binary-search.js?");
49+
50+/***/ }),
51+
52+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/mapping-list.js":
53+/*!**************************************************************************************!*\
54+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/mapping-list.js ***!
55+ \**************************************************************************************/
56+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
57+
58+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = __webpack_require__(/*! ./util */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js\");\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n // Optimized for most common case\n var lineA = mappingA.generatedLine;\n var lineB = mappingB.generatedLine;\n var columnA = mappingA.generatedColumn;\n var columnB = mappingB.generatedColumn;\n return lineB > lineA || lineB == lineA && columnB >= columnA ||\n util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n this._array = [];\n this._sorted = true;\n // Serves as infimum\n this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n function MappingList_forEach(aCallback, aThisArg) {\n this._array.forEach(aCallback, aThisArg);\n };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n if (generatedPositionAfter(this._last, aMapping)) {\n this._last = aMapping;\n this._array.push(aMapping);\n } else {\n this._sorted = false;\n this._array.push(aMapping);\n }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n if (!this._sorted) {\n this._array.sort(util.compareByGeneratedPositionsInflated);\n this._sorted = true;\n }\n return this._array;\n};\n\nexports.MappingList = MappingList;\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/mapping-list.js?");
59+
60+/***/ }),
61+
62+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/quick-sort.js":
63+/*!************************************************************************************!*\
64+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/quick-sort.js ***!
65+ \************************************************************************************/
66+/***/ ((__unused_webpack_module, exports) => {
67+
68+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n * The array.\n * @param {Number} x\n * The index of the first item.\n * @param {Number} y\n * The index of the second item.\n */\nfunction swap(ary, x, y) {\n var temp = ary[x];\n ary[x] = ary[y];\n ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n * The lower bound on the range.\n * @param {Number} high\n * The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n * @param {Number} p\n * Start index of the array\n * @param {Number} r\n * End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n // If our lower bound is less than our upper bound, we (1) partition the\n // array into two pieces and (2) recurse on each half. If it is not, this is\n // the empty array and our base case.\n\n if (p < r) {\n // (1) Partitioning.\n //\n // The partitioning chooses a pivot between `p` and `r` and moves all\n // elements that are less than or equal to the pivot to the before it, and\n // all the elements that are greater than it after it. The effect is that\n // once partition is done, the pivot is in the exact place it will be when\n // the array is put in sorted order, and it will not need to be moved\n // again. This runs in O(n) time.\n\n // Always choose a random pivot so that an input array which is reverse\n // sorted does not cause O(n^2) running time.\n var pivotIndex = randomIntInRange(p, r);\n var i = p - 1;\n\n swap(ary, pivotIndex, r);\n var pivot = ary[r];\n\n // Immediately after `j` is incremented in this loop, the following hold\n // true:\n //\n // * Every element in `ary[p .. i]` is less than or equal to the pivot.\n //\n // * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n for (var j = p; j < r; j++) {\n if (comparator(ary[j], pivot) <= 0) {\n i += 1;\n swap(ary, i, j);\n }\n }\n\n swap(ary, i + 1, j);\n var q = i + 1;\n\n // (2) Recurse on each half.\n\n doQuickSort(ary, comparator, p, q - 1);\n doQuickSort(ary, comparator, q + 1, r);\n }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/quick-sort.js?");
69+
70+/***/ }),
71+
72+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-consumer.js":
73+/*!*********************************************************************************************!*\
74+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-consumer.js ***!
75+ \*********************************************************************************************/
76+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
77+
78+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = __webpack_require__(/*! ./util */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js\");\nvar binarySearch = __webpack_require__(/*! ./binary-search */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/binary-search.js\");\nvar ArraySet = (__webpack_require__(/*! ./array-set */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/array-set.js\").ArraySet);\nvar base64VLQ = __webpack_require__(/*! ./base64-vlq */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/base64-vlq.js\");\nvar quickSort = (__webpack_require__(/*! ./quick-sort */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/quick-sort.js\").quickSort);\n\nfunction SourceMapConsumer(aSourceMap) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = JSON.parse(aSourceMap.replace(/^\\)\\]\\}'/, ''));\n }\n\n return sourceMap.sections != null\n ? new IndexedSourceMapConsumer(sourceMap)\n : new BasicSourceMapConsumer(sourceMap);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap) {\n return BasicSourceMapConsumer.fromSourceMap(aSourceMap);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n// {\n// generatedLine: The line number in the generated code,\n// generatedColumn: The column number in the generated code,\n// source: The path to the original source file that generated this\n// chunk of code,\n// originalLine: The line number in the original source that\n// corresponds to this chunk of generated code,\n// originalColumn: The column number in the original source that\n// corresponds to this chunk of generated code,\n// name: The name of the original symbol which generated this chunk of\n// code.\n// }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n get: function () {\n if (!this.__generatedMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__generatedMappings;\n }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n get: function () {\n if (!this.__originalMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__originalMappings;\n }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n var c = aStr.charAt(index);\n return c === \";\" || c === \",\";\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n throw new Error(\"Subclasses must implement _parseMappings\");\n };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n * The function that is called with each mapping.\n * @param Object aContext\n * Optional. If specified, this object will be the value of `this` every\n * time that `aCallback` is called.\n * @param aOrder\n * Either `SourceMapConsumer.GENERATED_ORDER` or\n * `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n * iterate over the mappings sorted by the generated file's line/column\n * order or the original's source/line/column order, respectively. Defaults to\n * `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n var context = aContext || null;\n var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n var mappings;\n switch (order) {\n case SourceMapConsumer.GENERATED_ORDER:\n mappings = this._generatedMappings;\n break;\n case SourceMapConsumer.ORIGINAL_ORDER:\n mappings = this._originalMappings;\n break;\n default:\n throw new Error(\"Unknown order of iteration.\");\n }\n\n var sourceRoot = this.sourceRoot;\n mappings.map(function (mapping) {\n var source = mapping.source === null ? null : this._sources.at(mapping.source);\n if (source != null && sourceRoot != null) {\n source = util.join(sourceRoot, source);\n }\n return {\n source: source,\n generatedLine: mapping.generatedLine,\n generatedColumn: mapping.generatedColumn,\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: mapping.name === null ? null : this._names.at(mapping.name)\n };\n }, this).forEach(aCallback, context);\n };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source.\n * - column: Optional. the column number in the original source.\n *\n * and an array of objects is returned, each with the following properties:\n *\n * - line: The line number in the generated source, or null.\n * - column: The column number in the generated source, or null.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n var line = util.getArg(aArgs, 'line');\n\n // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n // returns the index of the closest mapping less than the needle. By\n // setting needle.originalColumn to 0, we thus find the last mapping for\n // the given line, provided such a mapping exists.\n var needle = {\n source: util.getArg(aArgs, 'source'),\n originalLine: line,\n originalColumn: util.getArg(aArgs, 'column', 0)\n };\n\n if (this.sourceRoot != null) {\n needle.source = util.relative(this.sourceRoot, needle.source);\n }\n if (!this._sources.has(needle.source)) {\n return [];\n }\n needle.source = this._sources.indexOf(needle.source);\n\n var mappings = [];\n\n var index = this._findMapping(needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n binarySearch.LEAST_UPPER_BOUND);\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (aArgs.column === undefined) {\n var originalLine = mapping.originalLine;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we found. Since\n // mappings are sorted, this is guaranteed to find all mappings for\n // the line we found.\n while (mapping && mapping.originalLine === originalLine) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n } else {\n var originalColumn = mapping.originalColumn;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we were searching for.\n // Since mappings are sorted, this is guaranteed to find all mappings for\n // the line we are searching for.\n while (mapping &&\n mapping.originalLine === line &&\n mapping.originalColumn == originalColumn) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n }\n }\n\n return mappings;\n };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The only parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - sources: An array of URLs to the original source files.\n * - names: An array of identifiers which can be referrenced by individual mappings.\n * - sourceRoot: Optional. The URL root from which all sources are relative.\n * - sourcesContent: Optional. An array of contents of the original source files.\n * - mappings: A string of base64 VLQs which contain the actual mappings.\n * - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n * {\n * version : 3,\n * file: \"out.js\",\n * sourceRoot : \"\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AA,AB;;ABCDE;\"\n * }\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = JSON.parse(aSourceMap.replace(/^\\)\\]\\}'/, ''));\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sources = util.getArg(sourceMap, 'sources');\n // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n // requires the array) to play nice here.\n var names = util.getArg(sourceMap, 'names', []);\n var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n var mappings = util.getArg(sourceMap, 'mappings');\n var file = util.getArg(sourceMap, 'file', null);\n\n // Once again, Sass deviates from the spec and supplies the version as a\n // string rather than a number, so we use loose equality checking here.\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n sources = sources\n .map(String)\n // Some source maps produce relative source paths like \"./foo.js\" instead of\n // \"foo.js\". Normalize these first so that future comparisons will succeed.\n // See bugzil.la/1090768.\n .map(util.normalize)\n // Always ensure that absolute sources are internally stored relative to\n // the source root, if the source root is absolute. Not doing this would\n // be particularly problematic when the source root is a prefix of the\n // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n .map(function (source) {\n return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n ? util.relative(sourceRoot, source)\n : source;\n });\n\n // Pass `true` below to allow duplicate names and sources. While source maps\n // are intended to be compressed and deduplicated, the TypeScript compiler\n // sometimes generates source maps with duplicates in them. See Github issue\n // #72 and bugzil.la/889492.\n this._names = ArraySet.fromArray(names.map(String), true);\n this._sources = ArraySet.fromArray(sources, true);\n\n this.sourceRoot = sourceRoot;\n this.sourcesContent = sourcesContent;\n this._mappings = mappings;\n this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n * The source map that will be consumed.\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n function SourceMapConsumer_fromSourceMap(aSourceMap) {\n var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n smc.sourceRoot = aSourceMap._sourceRoot;\n smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n smc.sourceRoot);\n smc.file = aSourceMap._file;\n\n // Because we are modifying the entries (by converting string sources and\n // names to indices into the sources and names ArraySets), we have to make\n // a copy of the entry or else bad things happen. Shared mutable state\n // strikes again! See github issue #191.\n\n var generatedMappings = aSourceMap._mappings.toArray().slice();\n var destGeneratedMappings = smc.__generatedMappings = [];\n var destOriginalMappings = smc.__originalMappings = [];\n\n for (var i = 0, length = generatedMappings.length; i < length; i++) {\n var srcMapping = generatedMappings[i];\n var destMapping = new Mapping;\n destMapping.generatedLine = srcMapping.generatedLine;\n destMapping.generatedColumn = srcMapping.generatedColumn;\n\n if (srcMapping.source) {\n destMapping.source = sources.indexOf(srcMapping.source);\n destMapping.originalLine = srcMapping.originalLine;\n destMapping.originalColumn = srcMapping.originalColumn;\n\n if (srcMapping.name) {\n destMapping.name = names.indexOf(srcMapping.name);\n }\n\n destOriginalMappings.push(destMapping);\n }\n\n destGeneratedMappings.push(destMapping);\n }\n\n quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n return smc;\n };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n get: function () {\n return this._sources.toArray().map(function (s) {\n return this.sourceRoot != null ? util.join(this.sourceRoot, s) : s;\n }, this);\n }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n this.generatedLine = 0;\n this.generatedColumn = 0;\n this.source = null;\n this.originalLine = null;\n this.originalColumn = null;\n this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n var generatedLine = 1;\n var previousGeneratedColumn = 0;\n var previousOriginalLine = 0;\n var previousOriginalColumn = 0;\n var previousSource = 0;\n var previousName = 0;\n var length = aStr.length;\n var index = 0;\n var cachedSegments = {};\n var temp = {};\n var originalMappings = [];\n var generatedMappings = [];\n var mapping, str, segment, end, value;\n\n while (index < length) {\n if (aStr.charAt(index) === ';') {\n generatedLine++;\n index++;\n previousGeneratedColumn = 0;\n }\n else if (aStr.charAt(index) === ',') {\n index++;\n }\n else {\n mapping = new Mapping();\n mapping.generatedLine = generatedLine;\n\n // Because each offset is encoded relative to the previous one,\n // many segments often have the same encoding. We can exploit this\n // fact by caching the parsed variable length fields of each segment,\n // allowing us to avoid a second parse if we encounter the same\n // segment again.\n for (end = index; end < length; end++) {\n if (this._charIsMappingSeparator(aStr, end)) {\n break;\n }\n }\n str = aStr.slice(index, end);\n\n segment = cachedSegments[str];\n if (segment) {\n index += str.length;\n } else {\n segment = [];\n while (index < end) {\n base64VLQ.decode(aStr, index, temp);\n value = temp.value;\n index = temp.rest;\n segment.push(value);\n }\n\n if (segment.length === 2) {\n throw new Error('Found a source, but no line and column');\n }\n\n if (segment.length === 3) {\n throw new Error('Found a source and line, but no column');\n }\n\n cachedSegments[str] = segment;\n }\n\n // Generated column.\n mapping.generatedColumn = previousGeneratedColumn + segment[0];\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (segment.length > 1) {\n // Original source.\n mapping.source = previousSource + segment[1];\n previousSource += segment[1];\n\n // Original line.\n mapping.originalLine = previousOriginalLine + segment[2];\n previousOriginalLine = mapping.originalLine;\n // Lines are stored 0-based\n mapping.originalLine += 1;\n\n // Original column.\n mapping.originalColumn = previousOriginalColumn + segment[3];\n previousOriginalColumn = mapping.originalColumn;\n\n if (segment.length > 4) {\n // Original name.\n mapping.name = previousName + segment[4];\n previousName += segment[4];\n }\n }\n\n generatedMappings.push(mapping);\n if (typeof mapping.originalLine === 'number') {\n originalMappings.push(mapping);\n }\n }\n }\n\n quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n this.__generatedMappings = generatedMappings;\n\n quickSort(originalMappings, util.compareByOriginalPositions);\n this.__originalMappings = originalMappings;\n };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n aColumnName, aComparator, aBias) {\n // To return the position we are searching for, we must first find the\n // mapping for the given position and then return the opposite position it\n // points to. Because the mappings are sorted, we can use binary search to\n // find the best mapping.\n\n if (aNeedle[aLineName] <= 0) {\n throw new TypeError('Line must be greater than or equal to 1, got '\n + aNeedle[aLineName]);\n }\n if (aNeedle[aColumnName] < 0) {\n throw new TypeError('Column must be greater than or equal to 0, got '\n + aNeedle[aColumnName]);\n }\n\n return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n function SourceMapConsumer_computeColumnSpans() {\n for (var index = 0; index < this._generatedMappings.length; ++index) {\n var mapping = this._generatedMappings[index];\n\n // Mappings do not contain a field for the last generated columnt. We\n // can come up with an optimistic estimate, however, by assuming that\n // mappings are contiguous (i.e. given two consecutive mappings, the\n // first mapping ends where the second one starts).\n if (index + 1 < this._generatedMappings.length) {\n var nextMapping = this._generatedMappings[index + 1];\n\n if (mapping.generatedLine === nextMapping.generatedLine) {\n mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n continue;\n }\n }\n\n // The last mapping for each line spans the entire line.\n mapping.lastGeneratedColumn = Infinity;\n }\n };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source.\n * - column: The column number in the generated source.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null.\n * - column: The column number in the original source, or null.\n * - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n function SourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._generatedMappings,\n \"generatedLine\",\n \"generatedColumn\",\n util.compareByGeneratedPositionsDeflated,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._generatedMappings[index];\n\n if (mapping.generatedLine === needle.generatedLine) {\n var source = util.getArg(mapping, 'source', null);\n if (source !== null) {\n source = this._sources.at(source);\n if (this.sourceRoot != null) {\n source = util.join(this.sourceRoot, source);\n }\n }\n var name = util.getArg(mapping, 'name', null);\n if (name !== null) {\n name = this._names.at(name);\n }\n return {\n source: source,\n line: util.getArg(mapping, 'originalLine', null),\n column: util.getArg(mapping, 'originalColumn', null),\n name: name\n };\n }\n }\n\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n function BasicSourceMapConsumer_hasContentsOfAllSources() {\n if (!this.sourcesContent) {\n return false;\n }\n return this.sourcesContent.length >= this._sources.size() &&\n !this.sourcesContent.some(function (sc) { return sc == null; });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n if (!this.sourcesContent) {\n return null;\n }\n\n if (this.sourceRoot != null) {\n aSource = util.relative(this.sourceRoot, aSource);\n }\n\n if (this._sources.has(aSource)) {\n return this.sourcesContent[this._sources.indexOf(aSource)];\n }\n\n var url;\n if (this.sourceRoot != null\n && (url = util.urlParse(this.sourceRoot))) {\n // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n // many users. We can help them out when they expect file:// URIs to\n // behave like it would if they were running a local HTTP server. See\n // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n var fileUriAbsPath = aSource.replace(/^file:\\/\\//, \"\");\n if (url.scheme == \"file\"\n && this._sources.has(fileUriAbsPath)) {\n return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n }\n\n if ((!url.path || url.path == \"/\")\n && this._sources.has(\"/\" + aSource)) {\n return this.sourcesContent[this._sources.indexOf(\"/\" + aSource)];\n }\n }\n\n // This function is used recursively from\n // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n // don't want to throw if we can't find the source - we just want to\n // return null, so we provide a flag to exit gracefully.\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source.\n * - column: The column number in the original source.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null.\n * - column: The column number in the generated source, or null.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n function SourceMapConsumer_generatedPositionFor(aArgs) {\n var source = util.getArg(aArgs, 'source');\n if (this.sourceRoot != null) {\n source = util.relative(this.sourceRoot, source);\n }\n if (!this._sources.has(source)) {\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n }\n source = this._sources.indexOf(source);\n\n var needle = {\n source: source,\n originalLine: util.getArg(aArgs, 'line'),\n originalColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (mapping.source === needle.source) {\n return {\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n };\n }\n }\n\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The only parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - file: Optional. The generated file this source map is associated with.\n * - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n * - offset: The offset into the original specified at which this section\n * begins to apply, defined as an object with a \"line\" and \"column\"\n * field.\n * - map: A source map definition. This source map could also be indexed,\n * but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n * {\n * version : 3,\n * file: \"app.js\",\n * sections: [{\n * offset: {line:100, column:10},\n * map: {\n * version : 3,\n * file: \"section.js\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AAAA,E;;ABCDE;\"\n * }\n * }],\n * }\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = JSON.parse(aSourceMap.replace(/^\\)\\]\\}'/, ''));\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sections = util.getArg(sourceMap, 'sections');\n\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n this._sources = new ArraySet();\n this._names = new ArraySet();\n\n var lastOffset = {\n line: -1,\n column: 0\n };\n this._sections = sections.map(function (s) {\n if (s.url) {\n // The url field will require support for asynchronicity.\n // See https://github.com/mozilla/source-map/issues/16\n throw new Error('Support for url field in sections not implemented.');\n }\n var offset = util.getArg(s, 'offset');\n var offsetLine = util.getArg(offset, 'line');\n var offsetColumn = util.getArg(offset, 'column');\n\n if (offsetLine < lastOffset.line ||\n (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n throw new Error('Section offsets must be ordered and non-overlapping.');\n }\n lastOffset = offset;\n\n return {\n generatedOffset: {\n // The offset fields are 0-based, but we use 1-based indices when\n // encoding/decoding from VLQ.\n generatedLine: offsetLine + 1,\n generatedColumn: offsetColumn + 1\n },\n consumer: new SourceMapConsumer(util.getArg(s, 'map'))\n }\n });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n get: function () {\n var sources = [];\n for (var i = 0; i < this._sections.length; i++) {\n for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n sources.push(this._sections[i].consumer.sources[j]);\n }\n }\n return sources;\n }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source.\n * - column: The column number in the generated source.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null.\n * - column: The column number in the original source, or null.\n * - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n // Find the section containing the generated position we're trying to map\n // to an original position.\n var sectionIndex = binarySearch.search(needle, this._sections,\n function(needle, section) {\n var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n if (cmp) {\n return cmp;\n }\n\n return (needle.generatedColumn -\n section.generatedOffset.generatedColumn);\n });\n var section = this._sections[sectionIndex];\n\n if (!section) {\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n }\n\n return section.consumer.originalPositionFor({\n line: needle.generatedLine -\n (section.generatedOffset.generatedLine - 1),\n column: needle.generatedColumn -\n (section.generatedOffset.generatedLine === needle.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n bias: aArgs.bias\n });\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n return this._sections.every(function (s) {\n return s.consumer.hasContentsOfAllSources();\n });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n var content = section.consumer.sourceContentFor(aSource, true);\n if (content) {\n return content;\n }\n }\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source.\n * - column: The column number in the original source.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null.\n * - column: The column number in the generated source, or null.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n // Only consider this section if the requested source is in the list of\n // sources of the consumer.\n if (section.consumer.sources.indexOf(util.getArg(aArgs, 'source')) === -1) {\n continue;\n }\n var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n if (generatedPosition) {\n var ret = {\n line: generatedPosition.line +\n (section.generatedOffset.generatedLine - 1),\n column: generatedPosition.column +\n (section.generatedOffset.generatedLine === generatedPosition.line\n ? section.generatedOffset.generatedColumn - 1\n : 0)\n };\n return ret;\n }\n }\n\n return {\n line: null,\n column: null\n };\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n this.__generatedMappings = [];\n this.__originalMappings = [];\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n var sectionMappings = section.consumer._generatedMappings;\n for (var j = 0; j < sectionMappings.length; j++) {\n var mapping = sectionMappings[j];\n\n var source = section.consumer._sources.at(mapping.source);\n if (section.consumer.sourceRoot !== null) {\n source = util.join(section.consumer.sourceRoot, source);\n }\n this._sources.add(source);\n source = this._sources.indexOf(source);\n\n var name = section.consumer._names.at(mapping.name);\n this._names.add(name);\n name = this._names.indexOf(name);\n\n // The mappings coming from the consumer for the section have\n // generated positions relative to the start of the section, so we\n // need to offset them to be relative to the start of the concatenated\n // generated file.\n var adjustedMapping = {\n source: source,\n generatedLine: mapping.generatedLine +\n (section.generatedOffset.generatedLine - 1),\n generatedColumn: mapping.generatedColumn +\n (section.generatedOffset.generatedLine === mapping.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: name\n };\n\n this.__generatedMappings.push(adjustedMapping);\n if (typeof adjustedMapping.originalLine === 'number') {\n this.__originalMappings.push(adjustedMapping);\n }\n }\n }\n\n quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n quickSort(this.__originalMappings, util.compareByOriginalPositions);\n };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-consumer.js?");
79+
80+/***/ }),
81+
82+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-generator.js":
83+/*!**********************************************************************************************!*\
84+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-generator.js ***!
85+ \**********************************************************************************************/
86+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
87+
88+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = __webpack_require__(/*! ./base64-vlq */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/base64-vlq.js\");\nvar util = __webpack_require__(/*! ./util */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js\");\nvar ArraySet = (__webpack_require__(/*! ./array-set */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/array-set.js\").ArraySet);\nvar MappingList = (__webpack_require__(/*! ./mapping-list */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/mapping-list.js\").MappingList);\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n * - file: The filename of the generated source.\n * - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n if (!aArgs) {\n aArgs = {};\n }\n this._file = util.getArg(aArgs, 'file', null);\n this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n this._sources = new ArraySet();\n this._names = new ArraySet();\n this._mappings = new MappingList();\n this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n var sourceRoot = aSourceMapConsumer.sourceRoot;\n var generator = new SourceMapGenerator({\n file: aSourceMapConsumer.file,\n sourceRoot: sourceRoot\n });\n aSourceMapConsumer.eachMapping(function (mapping) {\n var newMapping = {\n generated: {\n line: mapping.generatedLine,\n column: mapping.generatedColumn\n }\n };\n\n if (mapping.source != null) {\n newMapping.source = mapping.source;\n if (sourceRoot != null) {\n newMapping.source = util.relative(sourceRoot, newMapping.source);\n }\n\n newMapping.original = {\n line: mapping.originalLine,\n column: mapping.originalColumn\n };\n\n if (mapping.name != null) {\n newMapping.name = mapping.name;\n }\n }\n\n generator.addMapping(newMapping);\n });\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n generator.setSourceContent(sourceFile, content);\n }\n });\n return generator;\n };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n * - generated: An object with the generated line and column positions.\n * - original: An object with the original line and column positions.\n * - source: The original source file (relative to the sourceRoot).\n * - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n function SourceMapGenerator_addMapping(aArgs) {\n var generated = util.getArg(aArgs, 'generated');\n var original = util.getArg(aArgs, 'original', null);\n var source = util.getArg(aArgs, 'source', null);\n var name = util.getArg(aArgs, 'name', null);\n\n if (!this._skipValidation) {\n this._validateMapping(generated, original, source, name);\n }\n\n if (source != null) {\n source = String(source);\n if (!this._sources.has(source)) {\n this._sources.add(source);\n }\n }\n\n if (name != null) {\n name = String(name);\n if (!this._names.has(name)) {\n this._names.add(name);\n }\n }\n\n this._mappings.add({\n generatedLine: generated.line,\n generatedColumn: generated.column,\n originalLine: original != null && original.line,\n originalColumn: original != null && original.column,\n source: source,\n name: name\n });\n };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n var source = aSourceFile;\n if (this._sourceRoot != null) {\n source = util.relative(this._sourceRoot, source);\n }\n\n if (aSourceContent != null) {\n // Add the source content to the _sourcesContents map.\n // Create a new _sourcesContents map if the property is null.\n if (!this._sourcesContents) {\n this._sourcesContents = Object.create(null);\n }\n this._sourcesContents[util.toSetString(source)] = aSourceContent;\n } else if (this._sourcesContents) {\n // Remove the source file from the _sourcesContents map.\n // If the _sourcesContents map is empty, set the property to null.\n delete this._sourcesContents[util.toSetString(source)];\n if (Object.keys(this._sourcesContents).length === 0) {\n this._sourcesContents = null;\n }\n }\n };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n * If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n * to be applied. If relative, it is relative to the SourceMapConsumer.\n * This parameter is needed when the two source maps aren't in the same\n * directory, and the source map to be applied contains relative source\n * paths. If so, those relative source paths need to be rewritten\n * relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n var sourceFile = aSourceFile;\n // If aSourceFile is omitted, we will use the file property of the SourceMap\n if (aSourceFile == null) {\n if (aSourceMapConsumer.file == null) {\n throw new Error(\n 'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n 'or the source map\\'s \"file\" property. Both were omitted.'\n );\n }\n sourceFile = aSourceMapConsumer.file;\n }\n var sourceRoot = this._sourceRoot;\n // Make \"sourceFile\" relative if an absolute Url is passed.\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n // Applying the SourceMap can add and remove items from the sources and\n // the names array.\n var newSources = new ArraySet();\n var newNames = new ArraySet();\n\n // Find mappings for the \"sourceFile\"\n this._mappings.unsortedForEach(function (mapping) {\n if (mapping.source === sourceFile && mapping.originalLine != null) {\n // Check if it can be mapped by the source map, then update the mapping.\n var original = aSourceMapConsumer.originalPositionFor({\n line: mapping.originalLine,\n column: mapping.originalColumn\n });\n if (original.source != null) {\n // Copy mapping\n mapping.source = original.source;\n if (aSourceMapPath != null) {\n mapping.source = util.join(aSourceMapPath, mapping.source)\n }\n if (sourceRoot != null) {\n mapping.source = util.relative(sourceRoot, mapping.source);\n }\n mapping.originalLine = original.line;\n mapping.originalColumn = original.column;\n if (original.name != null) {\n mapping.name = original.name;\n }\n }\n }\n\n var source = mapping.source;\n if (source != null && !newSources.has(source)) {\n newSources.add(source);\n }\n\n var name = mapping.name;\n if (name != null && !newNames.has(name)) {\n newNames.add(name);\n }\n\n }, this);\n this._sources = newSources;\n this._names = newNames;\n\n // Copy sourcesContents of applied map.\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aSourceMapPath != null) {\n sourceFile = util.join(aSourceMapPath, sourceFile);\n }\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n this.setSourceContent(sourceFile, content);\n }\n }, this);\n };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n * 1. Just the generated position.\n * 2. The Generated position, original position, and original source.\n * 3. Generated and original position, original source, as well as a name\n * token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n aName) {\n // When aOriginal is truthy but has empty values for .line and .column,\n // it is most likely a programmer error. In this case we throw a very\n // specific error message to try to guide them the right way.\n // For example: https://github.com/Polymer/polymer-bundler/pull/519\n if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n throw new Error(\n 'original.line and original.column are not numbers -- you probably meant to omit ' +\n 'the original mapping entirely and only map the generated position. If so, pass ' +\n 'null for the original mapping instead of an object with empty or null values.'\n );\n }\n\n if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aGenerated.line > 0 && aGenerated.column >= 0\n && !aOriginal && !aSource && !aName) {\n // Case 1.\n return;\n }\n else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n && aGenerated.line > 0 && aGenerated.column >= 0\n && aOriginal.line > 0 && aOriginal.column >= 0\n && aSource) {\n // Cases 2 and 3.\n return;\n }\n else {\n throw new Error('Invalid mapping: ' + JSON.stringify({\n generated: aGenerated,\n source: aSource,\n original: aOriginal,\n name: aName\n }));\n }\n };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n function SourceMapGenerator_serializeMappings() {\n var previousGeneratedColumn = 0;\n var previousGeneratedLine = 1;\n var previousOriginalColumn = 0;\n var previousOriginalLine = 0;\n var previousName = 0;\n var previousSource = 0;\n var result = '';\n var next;\n var mapping;\n var nameIdx;\n var sourceIdx;\n\n var mappings = this._mappings.toArray();\n for (var i = 0, len = mappings.length; i < len; i++) {\n mapping = mappings[i];\n next = ''\n\n if (mapping.generatedLine !== previousGeneratedLine) {\n previousGeneratedColumn = 0;\n while (mapping.generatedLine !== previousGeneratedLine) {\n next += ';';\n previousGeneratedLine++;\n }\n }\n else {\n if (i > 0) {\n if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n continue;\n }\n next += ',';\n }\n }\n\n next += base64VLQ.encode(mapping.generatedColumn\n - previousGeneratedColumn);\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (mapping.source != null) {\n sourceIdx = this._sources.indexOf(mapping.source);\n next += base64VLQ.encode(sourceIdx - previousSource);\n previousSource = sourceIdx;\n\n // lines are stored 0-based in SourceMap spec version 3\n next += base64VLQ.encode(mapping.originalLine - 1\n - previousOriginalLine);\n previousOriginalLine = mapping.originalLine - 1;\n\n next += base64VLQ.encode(mapping.originalColumn\n - previousOriginalColumn);\n previousOriginalColumn = mapping.originalColumn;\n\n if (mapping.name != null) {\n nameIdx = this._names.indexOf(mapping.name);\n next += base64VLQ.encode(nameIdx - previousName);\n previousName = nameIdx;\n }\n }\n\n result += next;\n }\n\n return result;\n };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n return aSources.map(function (source) {\n if (!this._sourcesContents) {\n return null;\n }\n if (aSourceRoot != null) {\n source = util.relative(aSourceRoot, source);\n }\n var key = util.toSetString(source);\n return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n ? this._sourcesContents[key]\n : null;\n }, this);\n };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n function SourceMapGenerator_toJSON() {\n var map = {\n version: this._version,\n sources: this._sources.toArray(),\n names: this._names.toArray(),\n mappings: this._serializeMappings()\n };\n if (this._file != null) {\n map.file = this._file;\n }\n if (this._sourceRoot != null) {\n map.sourceRoot = this._sourceRoot;\n }\n if (this._sourcesContents) {\n map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n }\n\n return map;\n };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n function SourceMapGenerator_toString() {\n return JSON.stringify(this.toJSON());\n };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-generator.js?");
89+
90+/***/ }),
91+
92+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/source-node.js":
93+/*!*************************************************************************************!*\
94+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/source-node.js ***!
95+ \*************************************************************************************/
96+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
97+
98+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = (__webpack_require__(/*! ./source-map-generator */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-generator.js\").SourceMapGenerator);\nvar util = __webpack_require__(/*! ./util */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js\");\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n * generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n this.children = [];\n this.sourceContents = {};\n this.line = aLine == null ? null : aLine;\n this.column = aColumn == null ? null : aColumn;\n this.source = aSource == null ? null : aSource;\n this.name = aName == null ? null : aName;\n this[isSourceNode] = true;\n if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n * SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n // The SourceNode we want to fill with the generated code\n // and the SourceMap\n var node = new SourceNode();\n\n // All even indices of this array are one line of the generated code,\n // while all odd indices are the newlines between two adjacent lines\n // (since `REGEX_NEWLINE` captures its match).\n // Processed fragments are accessed by calling `shiftNextLine`.\n var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n var remainingLinesIndex = 0;\n var shiftNextLine = function() {\n var lineContents = getNextLine();\n // The last line of a file might not have a newline.\n var newLine = getNextLine() || \"\";\n return lineContents + newLine;\n\n function getNextLine() {\n return remainingLinesIndex < remainingLines.length ?\n remainingLines[remainingLinesIndex++] : undefined;\n }\n };\n\n // We need to remember the position of \"remainingLines\"\n var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n // The generate SourceNodes we need a code range.\n // To extract it current and last mapping is used.\n // Here we store the last mapping.\n var lastMapping = null;\n\n aSourceMapConsumer.eachMapping(function (mapping) {\n if (lastMapping !== null) {\n // We add the code from \"lastMapping\" to \"mapping\":\n // First check if there is a new line in between.\n if (lastGeneratedLine < mapping.generatedLine) {\n // Associate first line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n lastGeneratedLine++;\n lastGeneratedColumn = 0;\n // The remaining code is added without mapping\n } else {\n // There is no new line in between.\n // Associate the code between \"lastGeneratedColumn\" and\n // \"mapping.generatedColumn\" with \"lastMapping\"\n var nextLine = remainingLines[remainingLinesIndex];\n var code = nextLine.substr(0, mapping.generatedColumn -\n lastGeneratedColumn);\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n lastGeneratedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n addMappingWithCode(lastMapping, code);\n // No more remaining code, continue\n lastMapping = mapping;\n return;\n }\n }\n // We add the generated code until the first mapping\n // to the SourceNode without any mapping.\n // Each line is added as separate string.\n while (lastGeneratedLine < mapping.generatedLine) {\n node.add(shiftNextLine());\n lastGeneratedLine++;\n }\n if (lastGeneratedColumn < mapping.generatedColumn) {\n var nextLine = remainingLines[remainingLinesIndex];\n node.add(nextLine.substr(0, mapping.generatedColumn));\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n }\n lastMapping = mapping;\n }, this);\n // We have processed all mappings.\n if (remainingLinesIndex < remainingLines.length) {\n if (lastMapping) {\n // Associate the remaining code in the current line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n }\n // and add the remaining lines without any mapping\n node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n }\n\n // Copy sourcesContent into SourceNode\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aRelativePath != null) {\n sourceFile = util.join(aRelativePath, sourceFile);\n }\n node.setSourceContent(sourceFile, content);\n }\n });\n\n return node;\n\n function addMappingWithCode(mapping, code) {\n if (mapping === null || mapping.source === undefined) {\n node.add(code);\n } else {\n var source = aRelativePath\n ? util.join(aRelativePath, mapping.source)\n : mapping.source;\n node.add(new SourceNode(mapping.originalLine,\n mapping.originalColumn,\n source,\n code,\n mapping.name));\n }\n }\n };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n if (Array.isArray(aChunk)) {\n aChunk.forEach(function (chunk) {\n this.add(chunk);\n }, this);\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n if (aChunk) {\n this.children.push(aChunk);\n }\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n if (Array.isArray(aChunk)) {\n for (var i = aChunk.length-1; i >= 0; i--) {\n this.prepend(aChunk[i]);\n }\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n this.children.unshift(aChunk);\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n var chunk;\n for (var i = 0, len = this.children.length; i < len; i++) {\n chunk = this.children[i];\n if (chunk[isSourceNode]) {\n chunk.walk(aFn);\n }\n else {\n if (chunk !== '') {\n aFn(chunk, { source: this.source,\n line: this.line,\n column: this.column,\n name: this.name });\n }\n }\n }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n var newChildren;\n var i;\n var len = this.children.length;\n if (len > 0) {\n newChildren = [];\n for (i = 0; i < len-1; i++) {\n newChildren.push(this.children[i]);\n newChildren.push(aSep);\n }\n newChildren.push(this.children[i]);\n this.children = newChildren;\n }\n return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n var lastChild = this.children[this.children.length - 1];\n if (lastChild[isSourceNode]) {\n lastChild.replaceRight(aPattern, aReplacement);\n }\n else if (typeof lastChild === 'string') {\n this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n }\n else {\n this.children.push(''.replace(aPattern, aReplacement));\n }\n return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n function SourceNode_walkSourceContents(aFn) {\n for (var i = 0, len = this.children.length; i < len; i++) {\n if (this.children[i][isSourceNode]) {\n this.children[i].walkSourceContents(aFn);\n }\n }\n\n var sources = Object.keys(this.sourceContents);\n for (var i = 0, len = sources.length; i < len; i++) {\n aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n }\n };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n var str = \"\";\n this.walk(function (chunk) {\n str += chunk;\n });\n return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n var generated = {\n code: \"\",\n line: 1,\n column: 0\n };\n var map = new SourceMapGenerator(aArgs);\n var sourceMappingActive = false;\n var lastOriginalSource = null;\n var lastOriginalLine = null;\n var lastOriginalColumn = null;\n var lastOriginalName = null;\n this.walk(function (chunk, original) {\n generated.code += chunk;\n if (original.source !== null\n && original.line !== null\n && original.column !== null) {\n if(lastOriginalSource !== original.source\n || lastOriginalLine !== original.line\n || lastOriginalColumn !== original.column\n || lastOriginalName !== original.name) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n lastOriginalSource = original.source;\n lastOriginalLine = original.line;\n lastOriginalColumn = original.column;\n lastOriginalName = original.name;\n sourceMappingActive = true;\n } else if (sourceMappingActive) {\n map.addMapping({\n generated: {\n line: generated.line,\n column: generated.column\n }\n });\n lastOriginalSource = null;\n sourceMappingActive = false;\n }\n for (var idx = 0, length = chunk.length; idx < length; idx++) {\n if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n generated.line++;\n generated.column = 0;\n // Mappings end at eol\n if (idx + 1 === length) {\n lastOriginalSource = null;\n sourceMappingActive = false;\n } else if (sourceMappingActive) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n } else {\n generated.column++;\n }\n }\n });\n this.walkSourceContents(function (sourceFile, sourceContent) {\n map.setSourceContent(sourceFile, sourceContent);\n });\n\n return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/source-node.js?");
99+
100+/***/ }),
101+
102+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js":
103+/*!******************************************************************************!*\
104+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js ***!
105+ \******************************************************************************/
106+/***/ ((__unused_webpack_module, exports) => {
107+
108+eval("/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n if (aName in aArgs) {\n return aArgs[aName];\n } else if (arguments.length === 3) {\n return aDefaultValue;\n } else {\n throw new Error('\"' + aName + '\" is a required argument.');\n }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.]*)(?::(\\d+))?(\\S*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n var match = aUrl.match(urlRegexp);\n if (!match) {\n return null;\n }\n return {\n scheme: match[1],\n auth: match[2],\n host: match[3],\n port: match[4],\n path: match[5]\n };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n var url = '';\n if (aParsedUrl.scheme) {\n url += aParsedUrl.scheme + ':';\n }\n url += '//';\n if (aParsedUrl.auth) {\n url += aParsedUrl.auth + '@';\n }\n if (aParsedUrl.host) {\n url += aParsedUrl.host;\n }\n if (aParsedUrl.port) {\n url += \":\" + aParsedUrl.port\n }\n if (aParsedUrl.path) {\n url += aParsedUrl.path;\n }\n return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n var path = aPath;\n var url = urlParse(aPath);\n if (url) {\n if (!url.path) {\n return aPath;\n }\n path = url.path;\n }\n var isAbsolute = exports.isAbsolute(path);\n\n var parts = path.split(/\\/+/);\n for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n part = parts[i];\n if (part === '.') {\n parts.splice(i, 1);\n } else if (part === '..') {\n up++;\n } else if (up > 0) {\n if (part === '') {\n // The first part is blank if the path is absolute. Trying to go\n // above the root is a no-op. Therefore we can remove all '..' parts\n // directly after the root.\n parts.splice(i + 1, up);\n up = 0;\n } else {\n parts.splice(i, 2);\n up--;\n }\n }\n }\n path = parts.join('/');\n\n if (path === '') {\n path = isAbsolute ? '/' : '.';\n }\n\n if (url) {\n url.path = path;\n return urlGenerate(url);\n }\n return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n * scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n * first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n * is updated with the result and aRoot is returned. Otherwise the result\n * is returned.\n * - If aPath is absolute, the result is aPath.\n * - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n if (aPath === \"\") {\n aPath = \".\";\n }\n var aPathUrl = urlParse(aPath);\n var aRootUrl = urlParse(aRoot);\n if (aRootUrl) {\n aRoot = aRootUrl.path || '/';\n }\n\n // `join(foo, '//www.example.org')`\n if (aPathUrl && !aPathUrl.scheme) {\n if (aRootUrl) {\n aPathUrl.scheme = aRootUrl.scheme;\n }\n return urlGenerate(aPathUrl);\n }\n\n if (aPathUrl || aPath.match(dataUrlRegexp)) {\n return aPath;\n }\n\n // `join('http://', 'www.example.com')`\n if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n aRootUrl.host = aPath;\n return urlGenerate(aRootUrl);\n }\n\n var joined = aPath.charAt(0) === '/'\n ? aPath\n : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n if (aRootUrl) {\n aRootUrl.path = joined;\n return urlGenerate(aRootUrl);\n }\n return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n return aPath.charAt(0) === '/' || !!aPath.match(urlRegexp);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n\n aRoot = aRoot.replace(/\\/$/, '');\n\n // It is possible for the path to be above the root. In this case, simply\n // checking whether the root is a prefix of the path won't work. Instead, we\n // need to remove components from the root one by one, until either we find\n // a prefix that fits, or we run out of components to remove.\n var level = 0;\n while (aPath.indexOf(aRoot + '/') !== 0) {\n var index = aRoot.lastIndexOf(\"/\");\n if (index < 0) {\n return aPath;\n }\n\n // If the only part of the root that is left is the scheme (i.e. http://,\n // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n // have exhausted all components, so the path is not relative to the root.\n aRoot = aRoot.slice(0, index);\n if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n return aPath;\n }\n\n ++level;\n }\n\n // Make sure we add a \"../\" for each component we removed from the root.\n return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n var obj = Object.create(null);\n return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n if (isProtoString(aStr)) {\n return '$' + aStr;\n }\n\n return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n if (isProtoString(aStr)) {\n return aStr.slice(1);\n }\n\n return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n if (!s) {\n return false;\n }\n\n var length = s.length;\n\n if (length < 9 /* \"__proto__\".length */) {\n return false;\n }\n\n if (s.charCodeAt(length - 1) !== 95 /* '_' */ ||\n s.charCodeAt(length - 2) !== 95 /* '_' */ ||\n s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n s.charCodeAt(length - 8) !== 95 /* '_' */ ||\n s.charCodeAt(length - 9) !== 95 /* '_' */) {\n return false;\n }\n\n for (var i = length - 10; i >= 0; i--) {\n if (s.charCodeAt(i) !== 36 /* '$' */) {\n return false;\n }\n }\n\n return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n var cmp = mappingA.source - mappingB.source;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0 || onlyCompareOriginal) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n return mappingA.name - mappingB.name;\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0 || onlyCompareGenerated) {\n return cmp;\n }\n\n cmp = mappingA.source - mappingB.source;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return mappingA.name - mappingB.name;\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n if (aStr1 === aStr2) {\n return 0;\n }\n\n if (aStr1 > aStr2) {\n return 1;\n }\n\n return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/lib/util.js?");
109+
110+/***/ }),
111+
112+/***/ "../../../../node_modules/uglify-js/node_modules/source-map/source-map.js":
113+/*!********************************************************************************!*\
114+ !*** ../../../../node_modules/uglify-js/node_modules/source-map/source-map.js ***!
115+ \********************************************************************************/
116+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
117+
118+eval("/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = __webpack_require__(/*! ./lib/source-map-generator */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-generator.js\").SourceMapGenerator;\nexports.SourceMapConsumer = __webpack_require__(/*! ./lib/source-map-consumer */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/source-map-consumer.js\").SourceMapConsumer;\nexports.SourceNode = __webpack_require__(/*! ./lib/source-node */ \"../../../../node_modules/uglify-js/node_modules/source-map/lib/source-node.js\").SourceNode;\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/node_modules/source-map/source-map.js?");
119+
120+/***/ }),
121+
122+/***/ "../../../../node_modules/uglify-js/tools/node.js":
123+/*!********************************************************!*\
124+ !*** ../../../../node_modules/uglify-js/tools/node.js ***!
125+ \********************************************************/
126+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
127+
128+eval("// workaround for tty output truncation upon process.exit()\n[process.stdout, process.stderr].forEach(function(stream){\n if (stream._handle && stream._handle.setBlocking)\n stream._handle.setBlocking(true);\n});\n\nvar path = __webpack_require__(Object(function webpackMissingModule() { var e = new Error(\"Cannot find module 'path'\"); e.code = 'MODULE_NOT_FOUND'; throw e; }()));\nvar fs = __webpack_require__(Object(function webpackMissingModule() { var e = new Error(\"Cannot find module 'fs'\"); e.code = 'MODULE_NOT_FOUND'; throw e; }()));\n\nvar UglifyJS = exports;\nvar FILES = UglifyJS.FILES = [\n \"../lib/utils.js\",\n \"../lib/ast.js\",\n \"../lib/parse.js\",\n \"../lib/transform.js\",\n \"../lib/scope.js\",\n \"../lib/output.js\",\n \"../lib/compress.js\",\n \"../lib/sourcemap.js\",\n \"../lib/mozilla-ast.js\",\n \"../lib/propmangle.js\",\n \"./exports.js\",\n].map(function(file){\n return /*require.resolve*/(__webpack_require__(\"../../../../node_modules/uglify-js/tools sync recursive\").resolve(file));\n});\n\nnew Function(\"MOZ_SourceMap\", \"exports\", FILES.map(function(file){\n return fs.readFileSync(file, \"utf8\");\n}).join(\"\\n\\n\"))(\n __webpack_require__(/*! source-map */ \"../../../../node_modules/uglify-js/node_modules/source-map/source-map.js\"),\n UglifyJS\n);\n\nUglifyJS.AST_Node.warn_function = function(txt) {\n console.error(\"WARN: %s\", txt);\n};\n\nfunction read_source_map(code) {\n var match = /\\n\\/\\/# sourceMappingURL=data:application\\/json(;.*?)?;base64,(.*)/.exec(code);\n if (!match) {\n UglifyJS.AST_Node.warn(\"inline source map not found\");\n return null;\n }\n return JSON.parse(new Buffer(match[2], \"base64\"));\n}\n\nUglifyJS.minify = function(files, options) {\n options = UglifyJS.defaults(options, {\n compress : {},\n fromString : false,\n inSourceMap : null,\n mangle : {},\n mangleProperties : false,\n nameCache : null,\n outFileName : null,\n output : null,\n outSourceMap : null,\n parse : {},\n sourceMapInline : false,\n sourceMapUrl : null,\n sourceRoot : null,\n spidermonkey : false,\n warnings : false,\n });\n UglifyJS.base54.reset();\n\n var inMap = options.inSourceMap;\n if (typeof inMap == \"string\" && inMap != \"inline\") {\n inMap = JSON.parse(fs.readFileSync(inMap, \"utf8\"));\n }\n\n // 1. parse\n var toplevel = null,\n sourcesContent = {};\n\n if (options.spidermonkey) {\n if (inMap == \"inline\") {\n throw new Error(\"inline source map only works with built-in parser\");\n }\n toplevel = UglifyJS.AST_Node.from_mozilla_ast(files);\n } else {\n function addFile(file, fileUrl) {\n var code = options.fromString\n ? file\n : fs.readFileSync(file, \"utf8\");\n if (inMap == \"inline\") {\n inMap = read_source_map(code);\n }\n sourcesContent[fileUrl] = code;\n toplevel = UglifyJS.parse(code, {\n filename: fileUrl,\n toplevel: toplevel,\n bare_returns: options.parse ? options.parse.bare_returns : undefined\n });\n }\n if (!options.fromString) {\n files = UglifyJS.simple_glob(files);\n if (inMap == \"inline\" && files.length > 1) {\n throw new Error(\"inline source map only works with singular input\");\n }\n }\n [].concat(files).forEach(function (files, i) {\n if (typeof files === 'string') {\n addFile(files, options.fromString ? i : files);\n } else {\n for (var fileUrl in files) {\n addFile(files[fileUrl], fileUrl);\n }\n }\n });\n }\n if (options.wrap) {\n toplevel = toplevel.wrap_commonjs(options.wrap, options.exportAll);\n }\n\n // 2. compress\n if (options.compress) {\n var compress = { warnings: options.warnings };\n UglifyJS.merge(compress, options.compress);\n toplevel.figure_out_scope(options.mangle);\n var sq = UglifyJS.Compressor(compress);\n toplevel = sq.compress(toplevel);\n }\n\n // 3. mangle properties\n if (options.mangleProperties || options.nameCache) {\n options.mangleProperties.cache = UglifyJS.readNameCache(options.nameCache, \"props\");\n toplevel = UglifyJS.mangle_properties(toplevel, options.mangleProperties);\n UglifyJS.writeNameCache(options.nameCache, \"props\", options.mangleProperties.cache);\n }\n\n // 4. mangle\n if (options.mangle) {\n toplevel.figure_out_scope(options.mangle);\n toplevel.compute_char_frequency(options.mangle);\n toplevel.mangle_names(options.mangle);\n }\n\n // 5. output\n var output = { max_line_len: 32000 };\n if (options.outSourceMap || options.sourceMapInline) {\n output.source_map = UglifyJS.SourceMap({\n // prefer outFileName, otherwise use outSourceMap without .map suffix\n file: options.outFileName || (typeof options.outSourceMap === 'string' ? options.outSourceMap.replace(/\\.map$/i, '') : null),\n orig: inMap,\n root: options.sourceRoot\n });\n if (options.sourceMapIncludeSources) {\n for (var file in sourcesContent) {\n if (sourcesContent.hasOwnProperty(file)) {\n output.source_map.get().setSourceContent(file, sourcesContent[file]);\n }\n }\n }\n\n }\n if (options.output) {\n UglifyJS.merge(output, options.output);\n }\n var stream = UglifyJS.OutputStream(output);\n toplevel.print(stream);\n\n\n var source_map = output.source_map;\n if (source_map) {\n source_map = source_map + \"\";\n }\n\n var mappingUrlPrefix = \"\\n//# sourceMappingURL=\";\n if (options.sourceMapInline) {\n stream += mappingUrlPrefix + \"data:application/json;charset=utf-8;base64,\" + new Buffer(source_map).toString(\"base64\");\n } else if (options.outSourceMap && typeof options.outSourceMap === \"string\" && options.sourceMapUrl !== false) {\n stream += mappingUrlPrefix + (typeof options.sourceMapUrl === \"string\" ? options.sourceMapUrl : options.outSourceMap);\n }\n\n return {\n code : stream + \"\",\n map : source_map\n };\n};\n\n// UglifyJS.describe_ast = function() {\n// function doitem(ctor) {\n// var sub = {};\n// ctor.SUBCLASSES.forEach(function(ctor){\n// sub[ctor.TYPE] = doitem(ctor);\n// });\n// var ret = {};\n// if (ctor.SELF_PROPS.length > 0) ret.props = ctor.SELF_PROPS;\n// if (ctor.SUBCLASSES.length > 0) ret.sub = sub;\n// return ret;\n// }\n// return doitem(UglifyJS.AST_Node).sub;\n// }\n\nUglifyJS.describe_ast = function() {\n var out = UglifyJS.OutputStream({ beautify: true });\n function doitem(ctor) {\n out.print(\"AST_\" + ctor.TYPE);\n var props = ctor.SELF_PROPS.filter(function(prop){\n return !/^\\$/.test(prop);\n });\n if (props.length > 0) {\n out.space();\n out.with_parens(function(){\n props.forEach(function(prop, i){\n if (i) out.space();\n out.print(prop);\n });\n });\n }\n if (ctor.documentation) {\n out.space();\n out.print_string(ctor.documentation);\n }\n if (ctor.SUBCLASSES.length > 0) {\n out.space();\n out.with_block(function(){\n ctor.SUBCLASSES.forEach(function(ctor, i){\n out.indent();\n doitem(ctor);\n out.newline();\n });\n });\n }\n };\n doitem(UglifyJS.AST_Node);\n return out + \"\";\n};\n\nfunction readReservedFile(filename, reserved) {\n if (!reserved) {\n reserved = { vars: [], props: [] };\n }\n var data = fs.readFileSync(filename, \"utf8\");\n data = JSON.parse(data);\n if (data.vars) {\n data.vars.forEach(function(name){\n UglifyJS.push_uniq(reserved.vars, name);\n });\n }\n if (data.props) {\n data.props.forEach(function(name){\n UglifyJS.push_uniq(reserved.props, name);\n });\n }\n return reserved;\n}\n\nUglifyJS.readReservedFile = readReservedFile;\n\nUglifyJS.readDefaultReservedFile = function(reserved) {\n return readReservedFile(/*require.resolve*/(/*! ./domprops.json */ \"../../../../node_modules/uglify-js/tools/domprops.json\"), reserved);\n};\n\nUglifyJS.readNameCache = function(filename, key) {\n var cache = null;\n if (filename) {\n try {\n var cache = fs.readFileSync(filename, \"utf8\");\n cache = JSON.parse(cache)[key];\n if (!cache) throw \"init\";\n cache.props = UglifyJS.Dictionary.fromObject(cache.props);\n } catch(ex) {\n cache = {\n cname: -1,\n props: new UglifyJS.Dictionary()\n };\n }\n }\n return cache;\n};\n\nUglifyJS.writeNameCache = function(filename, key, cache) {\n if (filename) {\n var data;\n try {\n data = fs.readFileSync(filename, \"utf8\");\n data = JSON.parse(data);\n } catch(ex) {\n data = {};\n }\n data[key] = {\n cname: cache.cname,\n props: cache.props.toObject()\n };\n fs.writeFileSync(filename, JSON.stringify(data, null, 2), \"utf8\");\n }\n};\n\n// A file glob function that only supports \"*\" and \"?\" wildcards in the basename.\n// Example: \"foo/bar/*baz??.*.js\"\n// Argument `glob` may be a string or an array of strings.\n// Returns an array of strings. Garbage in, garbage out.\nUglifyJS.simple_glob = function simple_glob(glob) {\n if (Array.isArray(glob)) {\n return [].concat.apply([], glob.map(simple_glob));\n }\n if (glob.match(/\\*|\\?/)) {\n var dir = path.dirname(glob);\n try {\n var entries = fs.readdirSync(dir);\n } catch (ex) {}\n if (entries) {\n var pattern = \"^\" + path.basename(glob)\n .replace(/[.+^$[\\]\\\\(){}]/g, \"\\\\$&\")\n .replace(/\\*/g, \"[^/\\\\\\\\]*\")\n .replace(/\\?/g, \"[^/\\\\\\\\]\") + \"$\";\n var mod = process.platform === \"win32\" ? \"i\" : \"\";\n var rx = new RegExp(pattern, mod);\n var results = entries.filter(function(name) {\n return rx.test(name);\n }).map(function(name) {\n return path.join(dir, name);\n });\n if (results.length) return results;\n }\n }\n return [ glob ];\n};\n\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/tools/node.js?");
129+
130+/***/ }),
131+
132+/***/ "../../../../node_modules/uglify-js/tools sync recursive":
133+/*!******************************************************!*\
134+ !*** ../../../../node_modules/uglify-js/tools/ sync ***!
135+ \******************************************************/
136+/***/ ((module) => {
137+
138+eval("function webpackEmptyContext(req) {\n\tvar e = new Error(\"Cannot find module '\" + req + \"'\");\n\te.code = 'MODULE_NOT_FOUND';\n\tthrow e;\n}\nwebpackEmptyContext.keys = () => ([]);\nwebpackEmptyContext.resolve = webpackEmptyContext;\nwebpackEmptyContext.id = \"../../../../node_modules/uglify-js/tools sync recursive\";\nmodule.exports = webpackEmptyContext;\n\n//# sourceURL=webpack://my-webpack-project/../../../../node_modules/uglify-js/tools/_sync?");
139+
140+/***/ }),
141+
142+/***/ "../node_modules/@jridgewell/resolve-uri/dist/resolve-uri.umd.js":
143+/*!***********************************************************************!*\
144+ !*** ../node_modules/@jridgewell/resolve-uri/dist/resolve-uri.umd.js ***!
145+ \***********************************************************************/
146+/***/ (function(module) {
147+
148+eval("(function (global, factory) {\n true ? module.exports = factory() :\n 0;\n})(this, (function () { 'use strict';\n\n // Matches the scheme of a URL, eg \"http://\"\n const schemeRegex = /^[\\w+.-]+:\\/\\//;\n /**\n * Matches the parts of a URL:\n * 1. Scheme, including \":\", guaranteed.\n * 2. User/password, including \"@\", optional.\n * 3. Host, guaranteed.\n * 4. Port, including \":\", optional.\n * 5. Path, including \"/\", optional.\n * 6. Query, including \"?\", optional.\n * 7. Hash, including \"#\", optional.\n */\n const urlRegex = /^([\\w+.-]+:)\\/\\/([^@/#?]*@)?([^:/#?]*)(:\\d+)?(\\/[^#?]*)?(\\?[^#]*)?(#.*)?/;\n /**\n * File URLs are weird. They dont' need the regular `//` in the scheme, they may or may not start\n * with a leading `/`, they can have a domain (but only if they don't start with a Windows drive).\n *\n * 1. Host, optional.\n * 2. Path, which may include \"/\", guaranteed.\n * 3. Query, including \"?\", optional.\n * 4. Hash, including \"#\", optional.\n */\n const fileRegex = /^file:(?:\\/\\/((?![a-z]:)[^/#?]*)?)?(\\/?[^#?]*)(\\?[^#]*)?(#.*)?/i;\n var UrlType;\n (function (UrlType) {\n UrlType[UrlType[\"Empty\"] = 1] = \"Empty\";\n UrlType[UrlType[\"Hash\"] = 2] = \"Hash\";\n UrlType[UrlType[\"Query\"] = 3] = \"Query\";\n UrlType[UrlType[\"RelativePath\"] = 4] = \"RelativePath\";\n UrlType[UrlType[\"AbsolutePath\"] = 5] = \"AbsolutePath\";\n UrlType[UrlType[\"SchemeRelative\"] = 6] = \"SchemeRelative\";\n UrlType[UrlType[\"Absolute\"] = 7] = \"Absolute\";\n })(UrlType || (UrlType = {}));\n function isAbsoluteUrl(input) {\n return schemeRegex.test(input);\n }\n function isSchemeRelativeUrl(input) {\n return input.startsWith('//');\n }\n function isAbsolutePath(input) {\n return input.startsWith('/');\n }\n function isFileUrl(input) {\n return input.startsWith('file:');\n }\n function isRelative(input) {\n return /^[.?#]/.test(input);\n }\n function parseAbsoluteUrl(input) {\n const match = urlRegex.exec(input);\n return makeUrl(match[1], match[2] || '', match[3], match[4] || '', match[5] || '/', match[6] || '', match[7] || '');\n }\n function parseFileUrl(input) {\n const match = fileRegex.exec(input);\n const path = match[2];\n return makeUrl('file:', '', match[1] || '', '', isAbsolutePath(path) ? path : '/' + path, match[3] || '', match[4] || '');\n }\n function makeUrl(scheme, user, host, port, path, query, hash) {\n return {\n scheme,\n user,\n host,\n port,\n path,\n query,\n hash,\n type: UrlType.Absolute,\n };\n }\n function parseUrl(input) {\n if (isSchemeRelativeUrl(input)) {\n const url = parseAbsoluteUrl('http:' + input);\n url.scheme = '';\n url.type = UrlType.SchemeRelative;\n return url;\n }\n if (isAbsolutePath(input)) {\n const url = parseAbsoluteUrl('http://foo.com' + input);\n url.scheme = '';\n url.host = '';\n url.type = UrlType.AbsolutePath;\n return url;\n }\n if (isFileUrl(input))\n return parseFileUrl(input);\n if (isAbsoluteUrl(input))\n return parseAbsoluteUrl(input);\n const url = parseAbsoluteUrl('http://foo.com/' + input);\n url.scheme = '';\n url.host = '';\n url.type = input\n ? input.startsWith('?')\n ? UrlType.Query\n : input.startsWith('#')\n ? UrlType.Hash\n : UrlType.RelativePath\n : UrlType.Empty;\n return url;\n }\n function stripPathFilename(path) {\n // If a path ends with a parent directory \"..\", then it's a relative path with excess parent\n // paths. It's not a file, so we can't strip it.\n if (path.endsWith('/..'))\n return path;\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n }\n function mergePaths(url, base) {\n normalizePath(base, base.type);\n // If the path is just a \"/\", then it was an empty path to begin with (remember, we're a relative\n // path).\n if (url.path === '/') {\n url.path = base.path;\n }\n else {\n // Resolution happens relative to the base path's directory, not the file.\n url.path = stripPathFilename(base.path) + url.path;\n }\n }\n /**\n * The path can have empty directories \"//\", unneeded parents \"foo/..\", or current directory\n * \"foo/.\". We need to normalize to a standard representation.\n */\n function normalizePath(url, type) {\n const rel = type <= UrlType.RelativePath;\n const pieces = url.path.split('/');\n // We need to preserve the first piece always, so that we output a leading slash. The item at\n // pieces[0] is an empty string.\n let pointer = 1;\n // Positive is the number of real directories we've output, used for popping a parent directory.\n // Eg, \"foo/bar/..\" will have a positive 2, and we can decrement to be left with just \"foo\".\n let positive = 0;\n // We need to keep a trailing slash if we encounter an empty directory (eg, splitting \"foo/\" will\n // generate `[\"foo\", \"\"]` pieces). And, if we pop a parent directory. But once we encounter a\n // real directory, we won't need to append, unless the other conditions happen again.\n let addTrailingSlash = false;\n for (let i = 1; i < pieces.length; i++) {\n const piece = pieces[i];\n // An empty directory, could be a trailing slash, or just a double \"//\" in the path.\n if (!piece) {\n addTrailingSlash = true;\n continue;\n }\n // If we encounter a real directory, then we don't need to append anymore.\n addTrailingSlash = false;\n // A current directory, which we can always drop.\n if (piece === '.')\n continue;\n // A parent directory, we need to see if there are any real directories we can pop. Else, we\n // have an excess of parents, and we'll need to keep the \"..\".\n if (piece === '..') {\n if (positive) {\n addTrailingSlash = true;\n positive--;\n pointer--;\n }\n else if (rel) {\n // If we're in a relativePath, then we need to keep the excess parents. Else, in an absolute\n // URL, protocol relative URL, or an absolute path, we don't need to keep excess.\n pieces[pointer++] = piece;\n }\n continue;\n }\n // We've encountered a real directory. Move it to the next insertion pointer, which accounts for\n // any popped or dropped directories.\n pieces[pointer++] = piece;\n positive++;\n }\n let path = '';\n for (let i = 1; i < pointer; i++) {\n path += '/' + pieces[i];\n }\n if (!path || (addTrailingSlash && !path.endsWith('/..'))) {\n path += '/';\n }\n url.path = path;\n }\n /**\n * Attempts to resolve `input` URL/path relative to `base`.\n */\n function resolve(input, base) {\n if (!input && !base)\n return '';\n const url = parseUrl(input);\n let inputType = url.type;\n if (base && inputType !== UrlType.Absolute) {\n const baseUrl = parseUrl(base);\n const baseType = baseUrl.type;\n switch (inputType) {\n case UrlType.Empty:\n url.hash = baseUrl.hash;\n // fall through\n case UrlType.Hash:\n url.query = baseUrl.query;\n // fall through\n case UrlType.Query:\n case UrlType.RelativePath:\n mergePaths(url, baseUrl);\n // fall through\n case UrlType.AbsolutePath:\n // The host, user, and port are joined, you can't copy one without the others.\n url.user = baseUrl.user;\n url.host = baseUrl.host;\n url.port = baseUrl.port;\n // fall through\n case UrlType.SchemeRelative:\n // The input doesn't have a schema at least, so we need to copy at least that over.\n url.scheme = baseUrl.scheme;\n }\n if (baseType > inputType)\n inputType = baseType;\n }\n normalizePath(url, inputType);\n const queryHash = url.query + url.hash;\n switch (inputType) {\n // This is impossible, because of the empty checks at the start of the function.\n // case UrlType.Empty:\n case UrlType.Hash:\n case UrlType.Query:\n return queryHash;\n case UrlType.RelativePath: {\n // The first char is always a \"/\", and we need it to be relative.\n const path = url.path.slice(1);\n if (!path)\n return queryHash || '.';\n if (isRelative(base || input) && !isRelative(path)) {\n // If base started with a leading \".\", or there is no base and input started with a \".\",\n // then we need to ensure that the relative path starts with a \".\". We don't know if\n // relative starts with a \"..\", though, so check before prepending.\n return './' + path + queryHash;\n }\n return path + queryHash;\n }\n case UrlType.AbsolutePath:\n return url.path + queryHash;\n default:\n return url.scheme + '//' + url.user + url.host + url.port + url.path + queryHash;\n }\n }\n\n return resolve;\n\n}));\n//# sourceMappingURL=resolve-uri.umd.js.map\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@jridgewell/resolve-uri/dist/resolve-uri.umd.js?");
149+
150+/***/ }),
151+
152+/***/ "../node_modules/@jridgewell/source-map/dist/source-map.umd.js":
153+/*!*********************************************************************!*\
154+ !*** ../node_modules/@jridgewell/source-map/dist/source-map.umd.js ***!
155+ \*********************************************************************/
156+/***/ (function(__unused_webpack_module, exports) {
157+
158+eval("(function (global, factory) {\n true ? factory(exports) :\n 0;\n})(this, (function (exports) { 'use strict';\n\n const comma = ','.charCodeAt(0);\n const semicolon = ';'.charCodeAt(0);\n const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n const intToChar = new Uint8Array(64); // 64 possible chars.\n const charToInteger = new Uint8Array(128); // z is 122 in ASCII\n for (let i = 0; i < chars.length; i++) {\n const c = chars.charCodeAt(i);\n charToInteger[c] = i;\n intToChar[i] = c;\n }\n // Provide a fallback for older environments.\n const td = typeof TextDecoder !== 'undefined'\n ? new TextDecoder()\n : typeof Buffer !== 'undefined'\n ? {\n decode(buf) {\n const out = Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength);\n return out.toString();\n },\n }\n : {\n decode(buf) {\n let out = '';\n for (let i = 0; i < buf.length; i++) {\n out += String.fromCharCode(buf[i]);\n }\n return out;\n },\n };\n function decode(mappings) {\n const state = new Int32Array(5);\n const decoded = [];\n let line = [];\n let sorted = true;\n let lastCol = 0;\n for (let i = 0; i < mappings.length;) {\n const c = mappings.charCodeAt(i);\n if (c === comma) {\n i++;\n }\n else if (c === semicolon) {\n state[0] = lastCol = 0;\n if (!sorted)\n sort(line);\n sorted = true;\n decoded.push(line);\n line = [];\n i++;\n }\n else {\n i = decodeInteger(mappings, i, state, 0); // generatedCodeColumn\n const col = state[0];\n if (col < lastCol)\n sorted = false;\n lastCol = col;\n if (!hasMoreSegments(mappings, i)) {\n line.push([col]);\n continue;\n }\n i = decodeInteger(mappings, i, state, 1); // sourceFileIndex\n i = decodeInteger(mappings, i, state, 2); // sourceCodeLine\n i = decodeInteger(mappings, i, state, 3); // sourceCodeColumn\n if (!hasMoreSegments(mappings, i)) {\n line.push([col, state[1], state[2], state[3]]);\n continue;\n }\n i = decodeInteger(mappings, i, state, 4); // nameIndex\n line.push([col, state[1], state[2], state[3], state[4]]);\n }\n }\n if (!sorted)\n sort(line);\n decoded.push(line);\n return decoded;\n }\n function decodeInteger(mappings, pos, state, j) {\n let value = 0;\n let shift = 0;\n let integer = 0;\n do {\n const c = mappings.charCodeAt(pos++);\n integer = charToInteger[c];\n value |= (integer & 31) << shift;\n shift += 5;\n } while (integer & 32);\n const shouldNegate = value & 1;\n value >>>= 1;\n if (shouldNegate) {\n value = -0x80000000 | -value;\n }\n state[j] += value;\n return pos;\n }\n function hasMoreSegments(mappings, i) {\n if (i >= mappings.length)\n return false;\n const c = mappings.charCodeAt(i);\n if (c === comma || c === semicolon)\n return false;\n return true;\n }\n function sort(line) {\n line.sort(sortComparator$1);\n }\n function sortComparator$1(a, b) {\n return a[0] - b[0];\n }\n function encode(decoded) {\n const state = new Int32Array(5);\n let buf = new Uint8Array(1024);\n let pos = 0;\n for (let i = 0; i < decoded.length; i++) {\n const line = decoded[i];\n if (i > 0) {\n buf = reserve(buf, pos, 1);\n buf[pos++] = semicolon;\n }\n if (line.length === 0)\n continue;\n state[0] = 0;\n for (let j = 0; j < line.length; j++) {\n const segment = line[j];\n // We can push up to 5 ints, each int can take at most 7 chars, and we\n // may push a comma.\n buf = reserve(buf, pos, 36);\n if (j > 0)\n buf[pos++] = comma;\n pos = encodeInteger(buf, pos, state, segment, 0); // generatedCodeColumn\n if (segment.length === 1)\n continue;\n pos = encodeInteger(buf, pos, state, segment, 1); // sourceFileIndex\n pos = encodeInteger(buf, pos, state, segment, 2); // sourceCodeLine\n pos = encodeInteger(buf, pos, state, segment, 3); // sourceCodeColumn\n if (segment.length === 4)\n continue;\n pos = encodeInteger(buf, pos, state, segment, 4); // nameIndex\n }\n }\n return td.decode(buf.subarray(0, pos));\n }\n function reserve(buf, pos, count) {\n if (buf.length > pos + count)\n return buf;\n const swap = new Uint8Array(buf.length * 2);\n swap.set(buf);\n return swap;\n }\n function encodeInteger(buf, pos, state, segment, j) {\n const next = segment[j];\n let num = next - state[j];\n state[j] = next;\n num = num < 0 ? (-num << 1) | 1 : num << 1;\n do {\n let clamped = num & 0b011111;\n num >>>= 5;\n if (num > 0)\n clamped |= 0b100000;\n buf[pos++] = intToChar[clamped];\n } while (num > 0);\n return pos;\n }\n\n // Matches the scheme of a URL, eg \"http://\"\n const schemeRegex = /^[\\w+.-]+:\\/\\//;\n /**\n * Matches the parts of a URL:\n * 1. Scheme, including \":\", guaranteed.\n * 2. User/password, including \"@\", optional.\n * 3. Host, guaranteed.\n * 4. Port, including \":\", optional.\n * 5. Path, including \"/\", optional.\n */\n const urlRegex = /^([\\w+.-]+:)\\/\\/([^@/#?]*@)?([^:/#?]*)(:\\d+)?(\\/[^#?]*)?/;\n /**\n * File URLs are weird. They dont' need the regular `//` in the scheme, they may or may not start\n * with a leading `/`, they can have a domain (but only if they don't start with a Windows drive).\n *\n * 1. Host, optional.\n * 2. Path, which may inclue \"/\", guaranteed.\n */\n const fileRegex = /^file:(?:\\/\\/((?![a-z]:)[^/]*)?)?(\\/?.*)/i;\n function isAbsoluteUrl(input) {\n return schemeRegex.test(input);\n }\n function isSchemeRelativeUrl(input) {\n return input.startsWith('//');\n }\n function isAbsolutePath(input) {\n return input.startsWith('/');\n }\n function isFileUrl(input) {\n return input.startsWith('file:');\n }\n function parseAbsoluteUrl(input) {\n const match = urlRegex.exec(input);\n return makeUrl(match[1], match[2] || '', match[3], match[4] || '', match[5] || '/');\n }\n function parseFileUrl(input) {\n const match = fileRegex.exec(input);\n const path = match[2];\n return makeUrl('file:', '', match[1] || '', '', isAbsolutePath(path) ? path : '/' + path);\n }\n function makeUrl(scheme, user, host, port, path) {\n return {\n scheme,\n user,\n host,\n port,\n path,\n relativePath: false,\n };\n }\n function parseUrl(input) {\n if (isSchemeRelativeUrl(input)) {\n const url = parseAbsoluteUrl('http:' + input);\n url.scheme = '';\n return url;\n }\n if (isAbsolutePath(input)) {\n const url = parseAbsoluteUrl('http://foo.com' + input);\n url.scheme = '';\n url.host = '';\n return url;\n }\n if (isFileUrl(input))\n return parseFileUrl(input);\n if (isAbsoluteUrl(input))\n return parseAbsoluteUrl(input);\n const url = parseAbsoluteUrl('http://foo.com/' + input);\n url.scheme = '';\n url.host = '';\n url.relativePath = true;\n return url;\n }\n function stripPathFilename(path) {\n // If a path ends with a parent directory \"..\", then it's a relative path with excess parent\n // paths. It's not a file, so we can't strip it.\n if (path.endsWith('/..'))\n return path;\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n }\n function mergePaths(url, base) {\n // If we're not a relative path, then we're an absolute path, and it doesn't matter what base is.\n if (!url.relativePath)\n return;\n normalizePath(base);\n // If the path is just a \"/\", then it was an empty path to begin with (remember, we're a relative\n // path).\n if (url.path === '/') {\n url.path = base.path;\n }\n else {\n // Resolution happens relative to the base path's directory, not the file.\n url.path = stripPathFilename(base.path) + url.path;\n }\n // If the base path is absolute, then our path is now absolute too.\n url.relativePath = base.relativePath;\n }\n /**\n * The path can have empty directories \"//\", unneeded parents \"foo/..\", or current directory\n * \"foo/.\". We need to normalize to a standard representation.\n */\n function normalizePath(url) {\n const { relativePath } = url;\n const pieces = url.path.split('/');\n // We need to preserve the first piece always, so that we output a leading slash. The item at\n // pieces[0] is an empty string.\n let pointer = 1;\n // Positive is the number of real directories we've output, used for popping a parent directory.\n // Eg, \"foo/bar/..\" will have a positive 2, and we can decrement to be left with just \"foo\".\n let positive = 0;\n // We need to keep a trailing slash if we encounter an empty directory (eg, splitting \"foo/\" will\n // generate `[\"foo\", \"\"]` pieces). And, if we pop a parent directory. But once we encounter a\n // real directory, we won't need to append, unless the other conditions happen again.\n let addTrailingSlash = false;\n for (let i = 1; i < pieces.length; i++) {\n const piece = pieces[i];\n // An empty directory, could be a trailing slash, or just a double \"//\" in the path.\n if (!piece) {\n addTrailingSlash = true;\n continue;\n }\n // If we encounter a real directory, then we don't need to append anymore.\n addTrailingSlash = false;\n // A current directory, which we can always drop.\n if (piece === '.')\n continue;\n // A parent directory, we need to see if there are any real directories we can pop. Else, we\n // have an excess of parents, and we'll need to keep the \"..\".\n if (piece === '..') {\n if (positive) {\n addTrailingSlash = true;\n positive--;\n pointer--;\n }\n else if (relativePath) {\n // If we're in a relativePath, then we need to keep the excess parents. Else, in an absolute\n // URL, protocol relative URL, or an absolute path, we don't need to keep excess.\n pieces[pointer++] = piece;\n }\n continue;\n }\n // We've encountered a real directory. Move it to the next insertion pointer, which accounts for\n // any popped or dropped directories.\n pieces[pointer++] = piece;\n positive++;\n }\n let path = '';\n for (let i = 1; i < pointer; i++) {\n path += '/' + pieces[i];\n }\n if (!path || (addTrailingSlash && !path.endsWith('/..'))) {\n path += '/';\n }\n url.path = path;\n }\n /**\n * Attempts to resolve `input` URL/path relative to `base`.\n */\n function resolve$1(input, base) {\n if (!input && !base)\n return '';\n const url = parseUrl(input);\n // If we have a base, and the input isn't already an absolute URL, then we need to merge.\n if (base && !url.scheme) {\n const baseUrl = parseUrl(base);\n url.scheme = baseUrl.scheme;\n // If there's no host, then we were just a path.\n if (!url.host) {\n // The host, user, and port are joined, you can't copy one without the others.\n url.user = baseUrl.user;\n url.host = baseUrl.host;\n url.port = baseUrl.port;\n }\n mergePaths(url, baseUrl);\n }\n normalizePath(url);\n // If the input (and base, if there was one) are both relative, then we need to output a relative.\n if (url.relativePath) {\n // The first char is always a \"/\".\n const path = url.path.slice(1);\n if (!path)\n return '.';\n // If base started with a leading \".\", or there is no base and input started with a \".\", then we\n // need to ensure that the relative path starts with a \".\". We don't know if relative starts\n // with a \"..\", though, so check before prepending.\n const keepRelative = (base || input).startsWith('.');\n return !keepRelative || path.startsWith('.') ? path : './' + path;\n }\n // If there's no host (and no scheme/user/port), then we need to output an absolute path.\n if (!url.scheme && !url.host)\n return url.path;\n // We're outputting either an absolute URL, or a protocol relative one.\n return `${url.scheme}//${url.user}${url.host}${url.port}${url.path}`;\n }\n\n function resolve(input, base) {\n // The base is always treated as a directory, if it's not empty.\n // https://github.com/mozilla/source-map/blob/8cb3ee57/lib/util.js#L327\n // https://github.com/chromium/chromium/blob/da4adbb3/third_party/blink/renderer/devtools/front_end/sdk/SourceMap.js#L400-L401\n if (base && !base.endsWith('/'))\n base += '/';\n return resolve$1(input, base);\n }\n\n /**\n * Removes everything after the last \"/\", but leaves the slash.\n */\n function stripFilename(path) {\n if (!path)\n return '';\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n }\n\n const COLUMN$1 = 0;\n const SOURCES_INDEX$1 = 1;\n const SOURCE_LINE$1 = 2;\n const SOURCE_COLUMN$1 = 3;\n const NAMES_INDEX$1 = 4;\n\n function maybeSort(mappings, owned) {\n const unsortedIndex = nextUnsortedSegmentLine(mappings, 0);\n if (unsortedIndex === mappings.length)\n return mappings;\n // If we own the array (meaning we parsed it from JSON), then we're free to directly mutate it. If\n // not, we do not want to modify the consumer's input array.\n if (!owned)\n mappings = mappings.slice();\n for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) {\n mappings[i] = sortSegments(mappings[i], owned);\n }\n return mappings;\n }\n function nextUnsortedSegmentLine(mappings, start) {\n for (let i = start; i < mappings.length; i++) {\n if (!isSorted(mappings[i]))\n return i;\n }\n return mappings.length;\n }\n function isSorted(line) {\n for (let j = 1; j < line.length; j++) {\n if (line[j][COLUMN$1] < line[j - 1][COLUMN$1]) {\n return false;\n }\n }\n return true;\n }\n function sortSegments(line, owned) {\n if (!owned)\n line = line.slice();\n return line.sort(sortComparator);\n }\n function sortComparator(a, b) {\n return a[COLUMN$1] - b[COLUMN$1];\n }\n\n let found = false;\n /**\n * A binary search implementation that returns the index if a match is found.\n * If no match is found, then the left-index (the index associated with the item that comes just\n * before the desired index) is returned. To maintain proper sort order, a splice would happen at\n * the next index:\n *\n * ```js\n * const array = [1, 3];\n * const needle = 2;\n * const index = binarySearch(array, needle, (item, needle) => item - needle);\n *\n * assert.equal(index, 0);\n * array.splice(index + 1, 0, needle);\n * assert.deepEqual(array, [1, 2, 3]);\n * ```\n */\n function binarySearch(haystack, needle, low, high) {\n while (low <= high) {\n const mid = low + ((high - low) >> 1);\n const cmp = haystack[mid][COLUMN$1] - needle;\n if (cmp === 0) {\n found = true;\n return mid;\n }\n if (cmp < 0) {\n low = mid + 1;\n }\n else {\n high = mid - 1;\n }\n }\n found = false;\n return low - 1;\n }\n function upperBound(haystack, needle, index) {\n for (let i = index + 1; i < haystack.length; i++, index++) {\n if (haystack[i][COLUMN$1] !== needle)\n break;\n }\n return index;\n }\n function lowerBound(haystack, needle, index) {\n for (let i = index - 1; i >= 0; i--, index--) {\n if (haystack[i][COLUMN$1] !== needle)\n break;\n }\n return index;\n }\n function memoizedState() {\n return {\n lastKey: -1,\n lastNeedle: -1,\n lastIndex: -1,\n };\n }\n /**\n * This overly complicated beast is just to record the last tested line/column and the resulting\n * index, allowing us to skip a few tests if mappings are monotonically increasing.\n */\n function memoizedBinarySearch(haystack, needle, state, key) {\n const { lastKey, lastNeedle, lastIndex } = state;\n let low = 0;\n let high = haystack.length - 1;\n if (key === lastKey) {\n if (needle === lastNeedle) {\n found = lastIndex !== -1 && haystack[lastIndex][COLUMN$1] === needle;\n return lastIndex;\n }\n if (needle >= lastNeedle) {\n // lastIndex may be -1 if the previous needle was not found.\n low = lastIndex === -1 ? 0 : lastIndex;\n }\n else {\n high = lastIndex;\n }\n }\n state.lastKey = key;\n state.lastNeedle = needle;\n return (state.lastIndex = binarySearch(haystack, needle, low, high));\n }\n\n const AnyMap = function (map, mapUrl) {\n const parsed = typeof map === 'string' ? JSON.parse(map) : map;\n if (!('sections' in parsed))\n return new TraceMap(parsed, mapUrl);\n const mappings = [];\n const sources = [];\n const sourcesContent = [];\n const names = [];\n const { sections } = parsed;\n let i = 0;\n for (; i < sections.length - 1; i++) {\n const no = sections[i + 1].offset;\n addSection(sections[i], mapUrl, mappings, sources, sourcesContent, names, no.line, no.column);\n }\n if (sections.length > 0) {\n addSection(sections[i], mapUrl, mappings, sources, sourcesContent, names, Infinity, Infinity);\n }\n const joined = {\n version: 3,\n file: parsed.file,\n names,\n sources,\n sourcesContent,\n mappings,\n };\n return presortedDecodedMap(joined);\n };\n function addSection(section, mapUrl, mappings, sources, sourcesContent, names, stopLine, stopColumn) {\n const map = AnyMap(section.map, mapUrl);\n const { line: lineOffset, column: columnOffset } = section.offset;\n const sourcesOffset = sources.length;\n const namesOffset = names.length;\n const decoded = decodedMappings(map);\n const { resolvedSources } = map;\n append(sources, resolvedSources);\n append(sourcesContent, map.sourcesContent || fillSourcesContent(resolvedSources.length));\n append(names, map.names);\n // If this section jumps forwards several lines, we need to add lines to the output mappings catch up.\n for (let i = mappings.length; i <= lineOffset; i++)\n mappings.push([]);\n // We can only add so many lines before we step into the range that the next section's map\n // controls. When we get to the last line, then we'll start checking the segments to see if\n // they've crossed into the column range.\n const stopI = stopLine - lineOffset;\n const len = Math.min(decoded.length, stopI + 1);\n for (let i = 0; i < len; i++) {\n const line = decoded[i];\n // On the 0th loop, the line will already exist due to a previous section, or the line catch up\n // loop above.\n const out = i === 0 ? mappings[lineOffset] : (mappings[lineOffset + i] = []);\n // On the 0th loop, the section's column offset shifts us forward. On all other lines (since the\n // map can be multiple lines), it doesn't.\n const cOffset = i === 0 ? columnOffset : 0;\n for (let j = 0; j < line.length; j++) {\n const seg = line[j];\n const column = cOffset + seg[COLUMN$1];\n // If this segment steps into the column range that the next section's map controls, we need\n // to stop early.\n if (i === stopI && column >= stopColumn)\n break;\n if (seg.length === 1) {\n out.push([column]);\n continue;\n }\n const sourcesIndex = sourcesOffset + seg[SOURCES_INDEX$1];\n const sourceLine = seg[SOURCE_LINE$1];\n const sourceColumn = seg[SOURCE_COLUMN$1];\n if (seg.length === 4) {\n out.push([column, sourcesIndex, sourceLine, sourceColumn]);\n continue;\n }\n out.push([column, sourcesIndex, sourceLine, sourceColumn, namesOffset + seg[NAMES_INDEX$1]]);\n }\n }\n }\n function append(arr, other) {\n for (let i = 0; i < other.length; i++)\n arr.push(other[i]);\n }\n // Sourcemaps don't need to have sourcesContent, and if they don't, we need to create an array of\n // equal length to the sources. This is because the sources and sourcesContent are paired arrays,\n // where `sourcesContent[i]` is the content of the `sources[i]` file. If we didn't, then joined\n // sourcemap would desynchronize the sources/contents.\n function fillSourcesContent(len) {\n const sourcesContent = [];\n for (let i = 0; i < len; i++)\n sourcesContent[i] = null;\n return sourcesContent;\n }\n\n const INVALID_ORIGINAL_MAPPING = Object.freeze({\n source: null,\n line: null,\n column: null,\n name: null,\n });\n Object.freeze({\n line: null,\n column: null,\n });\n const LINE_GTR_ZERO = '`line` must be greater than 0 (lines start at line 1)';\n const COL_GTR_EQ_ZERO = '`column` must be greater than or equal to 0 (columns start at column 0)';\n const LEAST_UPPER_BOUND = -1;\n const GREATEST_LOWER_BOUND = 1;\n /**\n * Returns the decoded (array of lines of segments) form of the SourceMap's mappings field.\n */\n let decodedMappings;\n /**\n * A higher-level API to find the source/line/column associated with a generated line/column\n * (think, from a stack trace). Line is 1-based, but column is 0-based, due to legacy behavior in\n * `source-map` library.\n */\n let originalPositionFor;\n /**\n * A helper that skips sorting of the input map's mappings array, which can be expensive for larger\n * maps.\n */\n let presortedDecodedMap;\n class TraceMap {\n constructor(map, mapUrl) {\n this._decodedMemo = memoizedState();\n this._bySources = undefined;\n this._bySourceMemos = undefined;\n const isString = typeof map === 'string';\n if (!isString && map.constructor === TraceMap)\n return map;\n const parsed = (isString ? JSON.parse(map) : map);\n const { version, file, names, sourceRoot, sources, sourcesContent } = parsed;\n this.version = version;\n this.file = file;\n this.names = names;\n this.sourceRoot = sourceRoot;\n this.sources = sources;\n this.sourcesContent = sourcesContent;\n if (sourceRoot || mapUrl) {\n const from = resolve(sourceRoot || '', stripFilename(mapUrl));\n this.resolvedSources = sources.map((s) => resolve(s || '', from));\n }\n else {\n this.resolvedSources = sources.map((s) => s || '');\n }\n const { mappings } = parsed;\n if (typeof mappings === 'string') {\n this._encoded = mappings;\n this._decoded = undefined;\n }\n else {\n this._encoded = undefined;\n this._decoded = maybeSort(mappings, isString);\n }\n }\n }\n (() => {\n decodedMappings = (map) => {\n return (map._decoded || (map._decoded = decode(map._encoded)));\n };\n originalPositionFor = (map, { line, column, bias }) => {\n line--;\n if (line < 0)\n throw new Error(LINE_GTR_ZERO);\n if (column < 0)\n throw new Error(COL_GTR_EQ_ZERO);\n const decoded = decodedMappings(map);\n // It's common for parent source maps to have pointers to lines that have no\n // mapping (like a \"//# sourceMappingURL=\") at the end of the child file.\n if (line >= decoded.length)\n return INVALID_ORIGINAL_MAPPING;\n const segment = traceSegmentInternal(decoded[line], map._decodedMemo, line, column, bias || GREATEST_LOWER_BOUND);\n if (segment == null)\n return INVALID_ORIGINAL_MAPPING;\n if (segment.length == 1)\n return INVALID_ORIGINAL_MAPPING;\n const { names, resolvedSources } = map;\n return {\n source: resolvedSources[segment[SOURCES_INDEX$1]],\n line: segment[SOURCE_LINE$1] + 1,\n column: segment[SOURCE_COLUMN$1],\n name: segment.length === 5 ? names[segment[NAMES_INDEX$1]] : null,\n };\n };\n presortedDecodedMap = (map, mapUrl) => {\n const clone = Object.assign({}, map);\n clone.mappings = [];\n const tracer = new TraceMap(clone, mapUrl);\n tracer._decoded = map.mappings;\n return tracer;\n };\n })();\n function traceSegmentInternal(segments, memo, line, column, bias) {\n let index = memoizedBinarySearch(segments, column, memo, line);\n if (found) {\n index = (bias === LEAST_UPPER_BOUND ? upperBound : lowerBound)(segments, column, index);\n }\n else if (bias === LEAST_UPPER_BOUND)\n index++;\n if (index === -1 || index === segments.length)\n return null;\n return segments[index];\n }\n\n /**\n * Gets the index associated with `key` in the backing array, if it is already present.\n */\n let get;\n /**\n * Puts `key` into the backing array, if it is not already present. Returns\n * the index of the `key` in the backing array.\n */\n let put;\n /**\n * SetArray acts like a `Set` (allowing only one occurrence of a string `key`), but provides the\n * index of the `key` in the backing array.\n *\n * This is designed to allow synchronizing a second array with the contents of the backing array,\n * like how in a sourcemap `sourcesContent[i]` is the source content associated with `source[i]`,\n * and there are never duplicates.\n */\n class SetArray {\n constructor() {\n this._indexes = { __proto__: null };\n this.array = [];\n }\n }\n (() => {\n get = (strarr, key) => strarr._indexes[key];\n put = (strarr, key) => {\n // The key may or may not be present. If it is present, it's a number.\n const index = get(strarr, key);\n if (index !== undefined)\n return index;\n const { array, _indexes: indexes } = strarr;\n return (indexes[key] = array.push(key) - 1);\n };\n })();\n\n const COLUMN = 0;\n const SOURCES_INDEX = 1;\n const SOURCE_LINE = 2;\n const SOURCE_COLUMN = 3;\n const NAMES_INDEX = 4;\n\n const NO_NAME = -1;\n /**\n * Same as `addMapping`, but will only add the mapping if it generates useful information in the\n * resulting map. This only works correctly if mappings are added **in order**, meaning you should\n * not add a mapping with a lower generated line/column than one that came before.\n */\n let maybeAddMapping;\n /**\n * Adds/removes the content of the source file to the source map.\n */\n let setSourceContent;\n /**\n * Returns a sourcemap object (with decoded mappings) suitable for passing to a library that expects\n * a sourcemap, or to JSON.stringify.\n */\n let toDecodedMap;\n /**\n * Returns a sourcemap object (with encoded mappings) suitable for passing to a library that expects\n * a sourcemap, or to JSON.stringify.\n */\n let toEncodedMap;\n // This split declaration is only so that terser can elminiate the static initialization block.\n let addSegmentInternal;\n /**\n * Provides the state to generate a sourcemap.\n */\n class GenMapping {\n constructor({ file, sourceRoot } = {}) {\n this._names = new SetArray();\n this._sources = new SetArray();\n this._sourcesContent = [];\n this._mappings = [];\n this.file = file;\n this.sourceRoot = sourceRoot;\n }\n }\n (() => {\n maybeAddMapping = (map, mapping) => {\n return addMappingInternal(true, map, mapping);\n };\n setSourceContent = (map, source, content) => {\n const { _sources: sources, _sourcesContent: sourcesContent } = map;\n sourcesContent[put(sources, source)] = content;\n };\n toDecodedMap = (map) => {\n const { file, sourceRoot, _mappings: mappings, _sources: sources, _sourcesContent: sourcesContent, _names: names, } = map;\n removeEmptyFinalLines(mappings);\n return {\n version: 3,\n file: file || undefined,\n names: names.array,\n sourceRoot: sourceRoot || undefined,\n sources: sources.array,\n sourcesContent,\n mappings,\n };\n };\n toEncodedMap = (map) => {\n const decoded = toDecodedMap(map);\n return Object.assign(Object.assign({}, decoded), { mappings: encode(decoded.mappings) });\n };\n // Internal helpers\n addSegmentInternal = (skipable, map, genLine, genColumn, source, sourceLine, sourceColumn, name) => {\n const { _mappings: mappings, _sources: sources, _sourcesContent: sourcesContent, _names: names, } = map;\n const line = getLine(mappings, genLine);\n const index = getColumnIndex(line, genColumn);\n if (!source) {\n if (skipable && skipSourceless(line, index))\n return;\n return insert(line, index, [genColumn]);\n }\n const sourcesIndex = put(sources, source);\n const namesIndex = name ? put(names, name) : NO_NAME;\n if (sourcesIndex === sourcesContent.length)\n sourcesContent[sourcesIndex] = null;\n if (skipable && skipSource(line, index, sourcesIndex, sourceLine, sourceColumn, namesIndex)) {\n return;\n }\n return insert(line, index, name\n ? [genColumn, sourcesIndex, sourceLine, sourceColumn, namesIndex]\n : [genColumn, sourcesIndex, sourceLine, sourceColumn]);\n };\n })();\n function getLine(mappings, index) {\n for (let i = mappings.length; i <= index; i++) {\n mappings[i] = [];\n }\n return mappings[index];\n }\n function getColumnIndex(line, genColumn) {\n let index = line.length;\n for (let i = index - 1; i >= 0; index = i--) {\n const current = line[i];\n if (genColumn >= current[COLUMN])\n break;\n }\n return index;\n }\n function insert(array, index, value) {\n for (let i = array.length; i > index; i--) {\n array[i] = array[i - 1];\n }\n array[index] = value;\n }\n function removeEmptyFinalLines(mappings) {\n const { length } = mappings;\n let len = length;\n for (let i = len - 1; i >= 0; len = i, i--) {\n if (mappings[i].length > 0)\n break;\n }\n if (len < length)\n mappings.length = len;\n }\n function skipSourceless(line, index) {\n // The start of a line is already sourceless, so adding a sourceless segment to the beginning\n // doesn't generate any useful information.\n if (index === 0)\n return true;\n const prev = line[index - 1];\n // If the previous segment is also sourceless, then adding another sourceless segment doesn't\n // genrate any new information. Else, this segment will end the source/named segment and point to\n // a sourceless position, which is useful.\n return prev.length === 1;\n }\n function skipSource(line, index, sourcesIndex, sourceLine, sourceColumn, namesIndex) {\n // A source/named segment at the start of a line gives position at that genColumn\n if (index === 0)\n return false;\n const prev = line[index - 1];\n // If the previous segment is sourceless, then we're transitioning to a source.\n if (prev.length === 1)\n return false;\n // If the previous segment maps to the exact same source position, then this segment doesn't\n // provide any new position information.\n return (sourcesIndex === prev[SOURCES_INDEX] &&\n sourceLine === prev[SOURCE_LINE] &&\n sourceColumn === prev[SOURCE_COLUMN] &&\n namesIndex === (prev.length === 5 ? prev[NAMES_INDEX] : NO_NAME));\n }\n function addMappingInternal(skipable, map, mapping) {\n const { generated, source, original, name } = mapping;\n if (!source) {\n return addSegmentInternal(skipable, map, generated.line - 1, generated.column, null, null, null, null);\n }\n const s = source;\n return addSegmentInternal(skipable, map, generated.line - 1, generated.column, s, original.line - 1, original.column, name);\n }\n\n class SourceMapConsumer {\n constructor(map, mapUrl) {\n const trace = (this._map = new AnyMap(map, mapUrl));\n this.file = trace.file;\n this.names = trace.names;\n this.sourceRoot = trace.sourceRoot;\n this.sources = trace.resolvedSources;\n this.sourcesContent = trace.sourcesContent;\n }\n originalPositionFor(needle) {\n return originalPositionFor(this._map, needle);\n }\n destroy() {\n // noop.\n }\n }\n class SourceMapGenerator {\n constructor(opts) {\n this._map = new GenMapping(opts);\n }\n addMapping(mapping) {\n maybeAddMapping(this._map, mapping);\n }\n setSourceContent(source, content) {\n setSourceContent(this._map, source, content);\n }\n toJSON() {\n return toEncodedMap(this._map);\n }\n toDecodedMap() {\n return toDecodedMap(this._map);\n }\n }\n\n exports.SourceMapConsumer = SourceMapConsumer;\n exports.SourceMapGenerator = SourceMapGenerator;\n\n Object.defineProperty(exports, '__esModule', { value: true });\n\n}));\n//# sourceMappingURL=source-map.umd.js.map\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@jridgewell/source-map/dist/source-map.umd.js?");
159+
160+/***/ }),
161+
162+/***/ "../node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.umd.js":
163+/*!*******************************************************************************!*\
164+ !*** ../node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.umd.js ***!
165+ \*******************************************************************************/
166+/***/ (function(__unused_webpack_module, exports) {
167+
168+eval("(function (global, factory) {\n true ? factory(exports) :\n 0;\n})(this, (function (exports) { 'use strict';\n\n const comma = ','.charCodeAt(0);\n const semicolon = ';'.charCodeAt(0);\n const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n const intToChar = new Uint8Array(64); // 64 possible chars.\n const charToInt = new Uint8Array(128); // z is 122 in ASCII\n for (let i = 0; i < chars.length; i++) {\n const c = chars.charCodeAt(i);\n intToChar[i] = c;\n charToInt[c] = i;\n }\n // Provide a fallback for older environments.\n const td = typeof TextDecoder !== 'undefined'\n ? /* #__PURE__ */ new TextDecoder()\n : typeof Buffer !== 'undefined'\n ? {\n decode(buf) {\n const out = Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength);\n return out.toString();\n },\n }\n : {\n decode(buf) {\n let out = '';\n for (let i = 0; i < buf.length; i++) {\n out += String.fromCharCode(buf[i]);\n }\n return out;\n },\n };\n function decode(mappings) {\n const state = new Int32Array(5);\n const decoded = [];\n let index = 0;\n do {\n const semi = indexOf(mappings, index);\n const line = [];\n let sorted = true;\n let lastCol = 0;\n state[0] = 0;\n for (let i = index; i < semi; i++) {\n let seg;\n i = decodeInteger(mappings, i, state, 0); // genColumn\n const col = state[0];\n if (col < lastCol)\n sorted = false;\n lastCol = col;\n if (hasMoreVlq(mappings, i, semi)) {\n i = decodeInteger(mappings, i, state, 1); // sourcesIndex\n i = decodeInteger(mappings, i, state, 2); // sourceLine\n i = decodeInteger(mappings, i, state, 3); // sourceColumn\n if (hasMoreVlq(mappings, i, semi)) {\n i = decodeInteger(mappings, i, state, 4); // namesIndex\n seg = [col, state[1], state[2], state[3], state[4]];\n }\n else {\n seg = [col, state[1], state[2], state[3]];\n }\n }\n else {\n seg = [col];\n }\n line.push(seg);\n }\n if (!sorted)\n sort(line);\n decoded.push(line);\n index = semi + 1;\n } while (index <= mappings.length);\n return decoded;\n }\n function indexOf(mappings, index) {\n const idx = mappings.indexOf(';', index);\n return idx === -1 ? mappings.length : idx;\n }\n function decodeInteger(mappings, pos, state, j) {\n let value = 0;\n let shift = 0;\n let integer = 0;\n do {\n const c = mappings.charCodeAt(pos++);\n integer = charToInt[c];\n value |= (integer & 31) << shift;\n shift += 5;\n } while (integer & 32);\n const shouldNegate = value & 1;\n value >>>= 1;\n if (shouldNegate) {\n value = -0x80000000 | -value;\n }\n state[j] += value;\n return pos;\n }\n function hasMoreVlq(mappings, i, length) {\n if (i >= length)\n return false;\n return mappings.charCodeAt(i) !== comma;\n }\n function sort(line) {\n line.sort(sortComparator);\n }\n function sortComparator(a, b) {\n return a[0] - b[0];\n }\n function encode(decoded) {\n const state = new Int32Array(5);\n const bufLength = 1024 * 16;\n const subLength = bufLength - 36;\n const buf = new Uint8Array(bufLength);\n const sub = buf.subarray(0, subLength);\n let pos = 0;\n let out = '';\n for (let i = 0; i < decoded.length; i++) {\n const line = decoded[i];\n if (i > 0) {\n if (pos === bufLength) {\n out += td.decode(buf);\n pos = 0;\n }\n buf[pos++] = semicolon;\n }\n if (line.length === 0)\n continue;\n state[0] = 0;\n for (let j = 0; j < line.length; j++) {\n const segment = line[j];\n // We can push up to 5 ints, each int can take at most 7 chars, and we\n // may push a comma.\n if (pos > subLength) {\n out += td.decode(sub);\n buf.copyWithin(0, subLength, pos);\n pos -= subLength;\n }\n if (j > 0)\n buf[pos++] = comma;\n pos = encodeInteger(buf, pos, state, segment, 0); // genColumn\n if (segment.length === 1)\n continue;\n pos = encodeInteger(buf, pos, state, segment, 1); // sourcesIndex\n pos = encodeInteger(buf, pos, state, segment, 2); // sourceLine\n pos = encodeInteger(buf, pos, state, segment, 3); // sourceColumn\n if (segment.length === 4)\n continue;\n pos = encodeInteger(buf, pos, state, segment, 4); // namesIndex\n }\n }\n return out + td.decode(buf.subarray(0, pos));\n }\n function encodeInteger(buf, pos, state, segment, j) {\n const next = segment[j];\n let num = next - state[j];\n state[j] = next;\n num = num < 0 ? (-num << 1) | 1 : num << 1;\n do {\n let clamped = num & 0b011111;\n num >>>= 5;\n if (num > 0)\n clamped |= 0b100000;\n buf[pos++] = intToChar[clamped];\n } while (num > 0);\n return pos;\n }\n\n exports.decode = decode;\n exports.encode = encode;\n\n Object.defineProperty(exports, '__esModule', { value: true });\n\n}));\n//# sourceMappingURL=sourcemap-codec.umd.js.map\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.umd.js?");
169+
170+/***/ }),
171+
172+/***/ "../node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js":
173+/*!***************************************************************************!*\
174+ !*** ../node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js ***!
175+ \***************************************************************************/
176+/***/ (function(__unused_webpack_module, exports, __webpack_require__) {
177+
178+eval("(function (global, factory) {\n true ? factory(exports, __webpack_require__(/*! @jridgewell/sourcemap-codec */ \"../node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.umd.js\"), __webpack_require__(/*! @jridgewell/resolve-uri */ \"../node_modules/@jridgewell/resolve-uri/dist/resolve-uri.umd.js\")) :\n 0;\n})(this, (function (exports, sourcemapCodec, resolveUri) { 'use strict';\n\n function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }\n\n var resolveUri__default = /*#__PURE__*/_interopDefaultLegacy(resolveUri);\n\n function resolve(input, base) {\n // The base is always treated as a directory, if it's not empty.\n // https://github.com/mozilla/source-map/blob/8cb3ee57/lib/util.js#L327\n // https://github.com/chromium/chromium/blob/da4adbb3/third_party/blink/renderer/devtools/front_end/sdk/SourceMap.js#L400-L401\n if (base && !base.endsWith('/'))\n base += '/';\n return resolveUri__default[\"default\"](input, base);\n }\n\n /**\n * Removes everything after the last \"/\", but leaves the slash.\n */\n function stripFilename(path) {\n if (!path)\n return '';\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n }\n\n const COLUMN = 0;\n const SOURCES_INDEX = 1;\n const SOURCE_LINE = 2;\n const SOURCE_COLUMN = 3;\n const NAMES_INDEX = 4;\n const REV_GENERATED_LINE = 1;\n const REV_GENERATED_COLUMN = 2;\n\n function maybeSort(mappings, owned) {\n const unsortedIndex = nextUnsortedSegmentLine(mappings, 0);\n if (unsortedIndex === mappings.length)\n return mappings;\n // If we own the array (meaning we parsed it from JSON), then we're free to directly mutate it. If\n // not, we do not want to modify the consumer's input array.\n if (!owned)\n mappings = mappings.slice();\n for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) {\n mappings[i] = sortSegments(mappings[i], owned);\n }\n return mappings;\n }\n function nextUnsortedSegmentLine(mappings, start) {\n for (let i = start; i < mappings.length; i++) {\n if (!isSorted(mappings[i]))\n return i;\n }\n return mappings.length;\n }\n function isSorted(line) {\n for (let j = 1; j < line.length; j++) {\n if (line[j][COLUMN] < line[j - 1][COLUMN]) {\n return false;\n }\n }\n return true;\n }\n function sortSegments(line, owned) {\n if (!owned)\n line = line.slice();\n return line.sort(sortComparator);\n }\n function sortComparator(a, b) {\n return a[COLUMN] - b[COLUMN];\n }\n\n let found = false;\n /**\n * A binary search implementation that returns the index if a match is found.\n * If no match is found, then the left-index (the index associated with the item that comes just\n * before the desired index) is returned. To maintain proper sort order, a splice would happen at\n * the next index:\n *\n * ```js\n * const array = [1, 3];\n * const needle = 2;\n * const index = binarySearch(array, needle, (item, needle) => item - needle);\n *\n * assert.equal(index, 0);\n * array.splice(index + 1, 0, needle);\n * assert.deepEqual(array, [1, 2, 3]);\n * ```\n */\n function binarySearch(haystack, needle, low, high) {\n while (low <= high) {\n const mid = low + ((high - low) >> 1);\n const cmp = haystack[mid][COLUMN] - needle;\n if (cmp === 0) {\n found = true;\n return mid;\n }\n if (cmp < 0) {\n low = mid + 1;\n }\n else {\n high = mid - 1;\n }\n }\n found = false;\n return low - 1;\n }\n function upperBound(haystack, needle, index) {\n for (let i = index + 1; i < haystack.length; index = i++) {\n if (haystack[i][COLUMN] !== needle)\n break;\n }\n return index;\n }\n function lowerBound(haystack, needle, index) {\n for (let i = index - 1; i >= 0; index = i--) {\n if (haystack[i][COLUMN] !== needle)\n break;\n }\n return index;\n }\n function memoizedState() {\n return {\n lastKey: -1,\n lastNeedle: -1,\n lastIndex: -1,\n };\n }\n /**\n * This overly complicated beast is just to record the last tested line/column and the resulting\n * index, allowing us to skip a few tests if mappings are monotonically increasing.\n */\n function memoizedBinarySearch(haystack, needle, state, key) {\n const { lastKey, lastNeedle, lastIndex } = state;\n let low = 0;\n let high = haystack.length - 1;\n if (key === lastKey) {\n if (needle === lastNeedle) {\n found = lastIndex !== -1 && haystack[lastIndex][COLUMN] === needle;\n return lastIndex;\n }\n if (needle >= lastNeedle) {\n // lastIndex may be -1 if the previous needle was not found.\n low = lastIndex === -1 ? 0 : lastIndex;\n }\n else {\n high = lastIndex;\n }\n }\n state.lastKey = key;\n state.lastNeedle = needle;\n return (state.lastIndex = binarySearch(haystack, needle, low, high));\n }\n\n // Rebuilds the original source files, with mappings that are ordered by source line/column instead\n // of generated line/column.\n function buildBySources(decoded, memos) {\n const sources = memos.map(buildNullArray);\n for (let i = 0; i < decoded.length; i++) {\n const line = decoded[i];\n for (let j = 0; j < line.length; j++) {\n const seg = line[j];\n if (seg.length === 1)\n continue;\n const sourceIndex = seg[SOURCES_INDEX];\n const sourceLine = seg[SOURCE_LINE];\n const sourceColumn = seg[SOURCE_COLUMN];\n const originalSource = sources[sourceIndex];\n const originalLine = (originalSource[sourceLine] || (originalSource[sourceLine] = []));\n const memo = memos[sourceIndex];\n // The binary search either found a match, or it found the left-index just before where the\n // segment should go. Either way, we want to insert after that. And there may be multiple\n // generated segments associated with an original location, so there may need to move several\n // indexes before we find where we need to insert.\n const index = upperBound(originalLine, sourceColumn, memoizedBinarySearch(originalLine, sourceColumn, memo, sourceLine));\n insert(originalLine, (memo.lastIndex = index + 1), [sourceColumn, i, seg[COLUMN]]);\n }\n }\n return sources;\n }\n function insert(array, index, value) {\n for (let i = array.length; i > index; i--) {\n array[i] = array[i - 1];\n }\n array[index] = value;\n }\n // Null arrays allow us to use ordered index keys without actually allocating contiguous memory like\n // a real array. We use a null-prototype object to avoid prototype pollution and deoptimizations.\n // Numeric properties on objects are magically sorted in ascending order by the engine regardless of\n // the insertion order. So, by setting any numeric keys, even out of order, we'll get ascending\n // order when iterating with for-in.\n function buildNullArray() {\n return { __proto__: null };\n }\n\n const AnyMap = function (map, mapUrl) {\n const parsed = typeof map === 'string' ? JSON.parse(map) : map;\n if (!('sections' in parsed))\n return new TraceMap(parsed, mapUrl);\n const mappings = [];\n const sources = [];\n const sourcesContent = [];\n const names = [];\n recurse(parsed, mapUrl, mappings, sources, sourcesContent, names, 0, 0, Infinity, Infinity);\n const joined = {\n version: 3,\n file: parsed.file,\n names,\n sources,\n sourcesContent,\n mappings,\n };\n return exports.presortedDecodedMap(joined);\n };\n function recurse(input, mapUrl, mappings, sources, sourcesContent, names, lineOffset, columnOffset, stopLine, stopColumn) {\n const { sections } = input;\n for (let i = 0; i < sections.length; i++) {\n const { map, offset } = sections[i];\n let sl = stopLine;\n let sc = stopColumn;\n if (i + 1 < sections.length) {\n const nextOffset = sections[i + 1].offset;\n sl = Math.min(stopLine, lineOffset + nextOffset.line);\n if (sl === stopLine) {\n sc = Math.min(stopColumn, columnOffset + nextOffset.column);\n }\n else if (sl < stopLine) {\n sc = columnOffset + nextOffset.column;\n }\n }\n addSection(map, mapUrl, mappings, sources, sourcesContent, names, lineOffset + offset.line, columnOffset + offset.column, sl, sc);\n }\n }\n function addSection(input, mapUrl, mappings, sources, sourcesContent, names, lineOffset, columnOffset, stopLine, stopColumn) {\n if ('sections' in input)\n return recurse(...arguments);\n const map = new TraceMap(input, mapUrl);\n const sourcesOffset = sources.length;\n const namesOffset = names.length;\n const decoded = exports.decodedMappings(map);\n const { resolvedSources, sourcesContent: contents } = map;\n append(sources, resolvedSources);\n append(names, map.names);\n if (contents)\n append(sourcesContent, contents);\n else\n for (let i = 0; i < resolvedSources.length; i++)\n sourcesContent.push(null);\n for (let i = 0; i < decoded.length; i++) {\n const lineI = lineOffset + i;\n // We can only add so many lines before we step into the range that the next section's map\n // controls. When we get to the last line, then we'll start checking the segments to see if\n // they've crossed into the column range. But it may not have any columns that overstep, so we\n // still need to check that we don't overstep lines, too.\n if (lineI > stopLine)\n return;\n // The out line may already exist in mappings (if we're continuing the line started by a\n // previous section). Or, we may have jumped ahead several lines to start this section.\n const out = getLine(mappings, lineI);\n // On the 0th loop, the section's column offset shifts us forward. On all other lines (since the\n // map can be multiple lines), it doesn't.\n const cOffset = i === 0 ? columnOffset : 0;\n const line = decoded[i];\n for (let j = 0; j < line.length; j++) {\n const seg = line[j];\n const column = cOffset + seg[COLUMN];\n // If this segment steps into the column range that the next section's map controls, we need\n // to stop early.\n if (lineI === stopLine && column >= stopColumn)\n return;\n if (seg.length === 1) {\n out.push([column]);\n continue;\n }\n const sourcesIndex = sourcesOffset + seg[SOURCES_INDEX];\n const sourceLine = seg[SOURCE_LINE];\n const sourceColumn = seg[SOURCE_COLUMN];\n out.push(seg.length === 4\n ? [column, sourcesIndex, sourceLine, sourceColumn]\n : [column, sourcesIndex, sourceLine, sourceColumn, namesOffset + seg[NAMES_INDEX]]);\n }\n }\n }\n function append(arr, other) {\n for (let i = 0; i < other.length; i++)\n arr.push(other[i]);\n }\n function getLine(arr, index) {\n for (let i = arr.length; i <= index; i++)\n arr[i] = [];\n return arr[index];\n }\n\n const LINE_GTR_ZERO = '`line` must be greater than 0 (lines start at line 1)';\n const COL_GTR_EQ_ZERO = '`column` must be greater than or equal to 0 (columns start at column 0)';\n const LEAST_UPPER_BOUND = -1;\n const GREATEST_LOWER_BOUND = 1;\n /**\n * Returns the encoded (VLQ string) form of the SourceMap's mappings field.\n */\n exports.encodedMappings = void 0;\n /**\n * Returns the decoded (array of lines of segments) form of the SourceMap's mappings field.\n */\n exports.decodedMappings = void 0;\n /**\n * A low-level API to find the segment associated with a generated line/column (think, from a\n * stack trace). Line and column here are 0-based, unlike `originalPositionFor`.\n */\n exports.traceSegment = void 0;\n /**\n * A higher-level API to find the source/line/column associated with a generated line/column\n * (think, from a stack trace). Line is 1-based, but column is 0-based, due to legacy behavior in\n * `source-map` library.\n */\n exports.originalPositionFor = void 0;\n /**\n * Finds the generated line/column position of the provided source/line/column source position.\n */\n exports.generatedPositionFor = void 0;\n /**\n * Finds all generated line/column positions of the provided source/line/column source position.\n */\n exports.allGeneratedPositionsFor = void 0;\n /**\n * Iterates each mapping in generated position order.\n */\n exports.eachMapping = void 0;\n /**\n * Retrieves the source content for a particular source, if its found. Returns null if not.\n */\n exports.sourceContentFor = void 0;\n /**\n * A helper that skips sorting of the input map's mappings array, which can be expensive for larger\n * maps.\n */\n exports.presortedDecodedMap = void 0;\n /**\n * Returns a sourcemap object (with decoded mappings) suitable for passing to a library that expects\n * a sourcemap, or to JSON.stringify.\n */\n exports.decodedMap = void 0;\n /**\n * Returns a sourcemap object (with encoded mappings) suitable for passing to a library that expects\n * a sourcemap, or to JSON.stringify.\n */\n exports.encodedMap = void 0;\n class TraceMap {\n constructor(map, mapUrl) {\n const isString = typeof map === 'string';\n if (!isString && map._decodedMemo)\n return map;\n const parsed = (isString ? JSON.parse(map) : map);\n const { version, file, names, sourceRoot, sources, sourcesContent } = parsed;\n this.version = version;\n this.file = file;\n this.names = names;\n this.sourceRoot = sourceRoot;\n this.sources = sources;\n this.sourcesContent = sourcesContent;\n const from = resolve(sourceRoot || '', stripFilename(mapUrl));\n this.resolvedSources = sources.map((s) => resolve(s || '', from));\n const { mappings } = parsed;\n if (typeof mappings === 'string') {\n this._encoded = mappings;\n this._decoded = undefined;\n }\n else {\n this._encoded = undefined;\n this._decoded = maybeSort(mappings, isString);\n }\n this._decodedMemo = memoizedState();\n this._bySources = undefined;\n this._bySourceMemos = undefined;\n }\n }\n (() => {\n exports.encodedMappings = (map) => {\n var _a;\n return ((_a = map._encoded) !== null && _a !== void 0 ? _a : (map._encoded = sourcemapCodec.encode(map._decoded)));\n };\n exports.decodedMappings = (map) => {\n return (map._decoded || (map._decoded = sourcemapCodec.decode(map._encoded)));\n };\n exports.traceSegment = (map, line, column) => {\n const decoded = exports.decodedMappings(map);\n // It's common for parent source maps to have pointers to lines that have no\n // mapping (like a \"//# sourceMappingURL=\") at the end of the child file.\n if (line >= decoded.length)\n return null;\n const segments = decoded[line];\n const index = traceSegmentInternal(segments, map._decodedMemo, line, column, GREATEST_LOWER_BOUND);\n return index === -1 ? null : segments[index];\n };\n exports.originalPositionFor = (map, { line, column, bias }) => {\n line--;\n if (line < 0)\n throw new Error(LINE_GTR_ZERO);\n if (column < 0)\n throw new Error(COL_GTR_EQ_ZERO);\n const decoded = exports.decodedMappings(map);\n // It's common for parent source maps to have pointers to lines that have no\n // mapping (like a \"//# sourceMappingURL=\") at the end of the child file.\n if (line >= decoded.length)\n return OMapping(null, null, null, null);\n const segments = decoded[line];\n const index = traceSegmentInternal(segments, map._decodedMemo, line, column, bias || GREATEST_LOWER_BOUND);\n if (index === -1)\n return OMapping(null, null, null, null);\n const segment = segments[index];\n if (segment.length === 1)\n return OMapping(null, null, null, null);\n const { names, resolvedSources } = map;\n return OMapping(resolvedSources[segment[SOURCES_INDEX]], segment[SOURCE_LINE] + 1, segment[SOURCE_COLUMN], segment.length === 5 ? names[segment[NAMES_INDEX]] : null);\n };\n exports.allGeneratedPositionsFor = (map, { source, line, column, bias }) => {\n // SourceMapConsumer uses LEAST_UPPER_BOUND for some reason, so we follow suit.\n return generatedPosition(map, source, line, column, bias || LEAST_UPPER_BOUND, true);\n };\n exports.generatedPositionFor = (map, { source, line, column, bias }) => {\n return generatedPosition(map, source, line, column, bias || GREATEST_LOWER_BOUND, false);\n };\n exports.eachMapping = (map, cb) => {\n const decoded = exports.decodedMappings(map);\n const { names, resolvedSources } = map;\n for (let i = 0; i < decoded.length; i++) {\n const line = decoded[i];\n for (let j = 0; j < line.length; j++) {\n const seg = line[j];\n const generatedLine = i + 1;\n const generatedColumn = seg[0];\n let source = null;\n let originalLine = null;\n let originalColumn = null;\n let name = null;\n if (seg.length !== 1) {\n source = resolvedSources[seg[1]];\n originalLine = seg[2] + 1;\n originalColumn = seg[3];\n }\n if (seg.length === 5)\n name = names[seg[4]];\n cb({\n generatedLine,\n generatedColumn,\n source,\n originalLine,\n originalColumn,\n name,\n });\n }\n }\n };\n exports.sourceContentFor = (map, source) => {\n const { sources, resolvedSources, sourcesContent } = map;\n if (sourcesContent == null)\n return null;\n let index = sources.indexOf(source);\n if (index === -1)\n index = resolvedSources.indexOf(source);\n return index === -1 ? null : sourcesContent[index];\n };\n exports.presortedDecodedMap = (map, mapUrl) => {\n const tracer = new TraceMap(clone(map, []), mapUrl);\n tracer._decoded = map.mappings;\n return tracer;\n };\n exports.decodedMap = (map) => {\n return clone(map, exports.decodedMappings(map));\n };\n exports.encodedMap = (map) => {\n return clone(map, exports.encodedMappings(map));\n };\n function generatedPosition(map, source, line, column, bias, all) {\n line--;\n if (line < 0)\n throw new Error(LINE_GTR_ZERO);\n if (column < 0)\n throw new Error(COL_GTR_EQ_ZERO);\n const { sources, resolvedSources } = map;\n let sourceIndex = sources.indexOf(source);\n if (sourceIndex === -1)\n sourceIndex = resolvedSources.indexOf(source);\n if (sourceIndex === -1)\n return all ? [] : GMapping(null, null);\n const generated = (map._bySources || (map._bySources = buildBySources(exports.decodedMappings(map), (map._bySourceMemos = sources.map(memoizedState)))));\n const segments = generated[sourceIndex][line];\n if (segments == null)\n return all ? [] : GMapping(null, null);\n const memo = map._bySourceMemos[sourceIndex];\n if (all)\n return sliceGeneratedPositions(segments, memo, line, column, bias);\n const index = traceSegmentInternal(segments, memo, line, column, bias);\n if (index === -1)\n return GMapping(null, null);\n const segment = segments[index];\n return GMapping(segment[REV_GENERATED_LINE] + 1, segment[REV_GENERATED_COLUMN]);\n }\n })();\n function clone(map, mappings) {\n return {\n version: map.version,\n file: map.file,\n names: map.names,\n sourceRoot: map.sourceRoot,\n sources: map.sources,\n sourcesContent: map.sourcesContent,\n mappings,\n };\n }\n function OMapping(source, line, column, name) {\n return { source, line, column, name };\n }\n function GMapping(line, column) {\n return { line, column };\n }\n function traceSegmentInternal(segments, memo, line, column, bias) {\n let index = memoizedBinarySearch(segments, column, memo, line);\n if (found) {\n index = (bias === LEAST_UPPER_BOUND ? upperBound : lowerBound)(segments, column, index);\n }\n else if (bias === LEAST_UPPER_BOUND)\n index++;\n if (index === -1 || index === segments.length)\n return -1;\n return index;\n }\n function sliceGeneratedPositions(segments, memo, line, column, bias) {\n let min = traceSegmentInternal(segments, memo, line, column, GREATEST_LOWER_BOUND);\n // We ignored the bias when tracing the segment so that we're guarnateed to find the first (in\n // insertion order) segment that matched. Even if we did respect the bias when tracing, we would\n // still need to call `lowerBound()` to find the first segment, which is slower than just looking\n // for the GREATEST_LOWER_BOUND to begin with. The only difference that matters for us is when the\n // binary search didn't match, in which case GREATEST_LOWER_BOUND just needs to increment to\n // match LEAST_UPPER_BOUND.\n if (!found && bias === LEAST_UPPER_BOUND)\n min++;\n if (min === -1 || min === segments.length)\n return [];\n // We may have found the segment that started at an earlier column. If this is the case, then we\n // need to slice all generated segments that match _that_ column, because all such segments span\n // to our desired column.\n const matchedColumn = found ? column : segments[min][COLUMN];\n // The binary search is not guaranteed to find the lower bound when a match wasn't found.\n if (!found)\n min = lowerBound(segments, matchedColumn, min);\n const max = upperBound(segments, matchedColumn, min);\n const result = [];\n for (; min <= max; min++) {\n const segment = segments[min];\n result.push(GMapping(segment[REV_GENERATED_LINE] + 1, segment[REV_GENERATED_COLUMN]));\n }\n return result;\n }\n\n exports.AnyMap = AnyMap;\n exports.GREATEST_LOWER_BOUND = GREATEST_LOWER_BOUND;\n exports.LEAST_UPPER_BOUND = LEAST_UPPER_BOUND;\n exports.TraceMap = TraceMap;\n\n Object.defineProperty(exports, '__esModule', { value: true });\n\n}));\n//# sourceMappingURL=trace-mapping.umd.js.map\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js?");
179+
180+/***/ }),
181+
182+/***/ "../node_modules/@next/env/dist/index.js":
183+/*!***********************************************!*\
184+ !*** ../node_modules/@next/env/dist/index.js ***!
185+ \***********************************************/
186+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
187+
188+eval("var __dirname = \"/\";\n(()=>{var e={840:e=>{\"use strict\";function _interpolate(e,r,n){const t=e.match(/(.?\\${*[\\w]*(?::-)?[\\w]*}*)/g)||[];return t.reduce((function(e,o,s){const c=/(.?)\\${*([\\w]*(?::-)?[\\w]*)?}*/g.exec(o);if(!c||c.length===0){return e}const i=c[1];let a,_;if(i===\"\\\\\"){_=c[0];a=_.replace(\"\\\\$\",\"$\")}else{const o=c[2].split(\":-\");const p=o[0];_=c[0].substring(i.length);a=Object.prototype.hasOwnProperty.call(r,p)?r[p]:n.parsed[p]||o[1]||\"\";if(o.length>1&&a){const r=t[s+1];t[s+1]=\"\";e=e.replace(r,\"\")}a=_interpolate(a,r,n)}return e.replace(_,a)}),e)}function expand(e){const r=e.ignoreProcessEnv?{}:process.env;for(const n in e.parsed){const t=Object.prototype.hasOwnProperty.call(r,n)?r[n]:e.parsed[n];e.parsed[n]=_interpolate(t,r,e)}for(const n in e.parsed){r[n]=e.parsed[n]}return e}e.exports.j=expand},358:(e,r,n)=>{var t;const o=n(147);const s=n(17);const c=n(37);function log(e){console.log(`[dotenv][DEBUG] ${e}`)}const i=\"\\n\";const a=/^\\s*([\\w.-]+)\\s*=\\s*(.*)?\\s*$/;const _=/\\\\n/g;const p=/\\r\\n|\\n|\\r/;function parse(e,r){const n=Boolean(r&&r.debug);const t={};e.toString().split(p).forEach((function(e,r){const o=e.match(a);if(o!=null){const e=o[1];let r=o[2]||\"\";const n=r.length-1;const s=r[0]==='\"'&&r[n]==='\"';const c=r[0]===\"'\"&&r[n]===\"'\";if(c||s){r=r.substring(1,n);if(s){r=r.replace(_,i)}}else{r=r.trim()}t[e]=r}else if(n){log(`did not match key and value when parsing line ${r+1}: ${e}`)}}));return t}function resolveHome(e){return e[0]===\"~\"?s.join(c.homedir(),e.slice(1)):e}function config(e){let r=s.resolve(process.cwd(),\".env\");let n=\"utf8\";let t=false;if(e){if(e.path!=null){r=resolveHome(e.path)}if(e.encoding!=null){n=e.encoding}if(e.debug!=null){t=true}}try{const e=parse(o.readFileSync(r,{encoding:n}),{debug:t});Object.keys(e).forEach((function(r){if(!Object.prototype.hasOwnProperty.call(process.env,r)){process.env[r]=e[r]}else if(t){log(`\"${r}\" is already defined in \\`process.env\\` and will not be overwritten`)}}));return{parsed:e}}catch(e){return{error:e}}}t=config;e.exports.Q=parse},147:e=>{\"use strict\";e.exports=__webpack_require__(Object(function webpackMissingModule() { var e = new Error(\"Cannot find module 'fs'\"); e.code = 'MODULE_NOT_FOUND'; throw e; }()))},37:e=>{\"use strict\";e.exports=__webpack_require__(Object(function webpackMissingModule() { var e = new Error(\"Cannot find module 'os'\"); e.code = 'MODULE_NOT_FOUND'; throw e; }()))},17:e=>{\"use strict\";e.exports=__webpack_require__(Object(function webpackMissingModule() { var e = new Error(\"Cannot find module 'path'\"); e.code = 'MODULE_NOT_FOUND'; throw e; }()))}};var r={};function __nccwpck_require__(n){var t=r[n];if(t!==undefined){return t.exports}var o=r[n]={exports:{}};var s=true;try{e[n](o,o.exports,__nccwpck_require__);s=false}finally{if(s)delete r[n]}return o.exports}(()=>{__nccwpck_require__.n=e=>{var r=e&&e.__esModule?()=>e[\"default\"]:()=>e;__nccwpck_require__.d(r,{a:r});return r}})();(()=>{__nccwpck_require__.d=(e,r)=>{for(var n in r){if(__nccwpck_require__.o(r,n)&&!__nccwpck_require__.o(e,n)){Object.defineProperty(e,n,{enumerable:true,get:r[n]})}}}})();(()=>{__nccwpck_require__.o=(e,r)=>Object.prototype.hasOwnProperty.call(e,r)})();(()=>{__nccwpck_require__.r=e=>{if(typeof Symbol!==\"undefined\"&&Symbol.toStringTag){Object.defineProperty(e,Symbol.toStringTag,{value:\"Module\"})}Object.defineProperty(e,\"__esModule\",{value:true})}})();if(typeof __nccwpck_require__!==\"undefined\")__nccwpck_require__.ab=__dirname+\"/\";var n={};(()=>{\"use strict\";__nccwpck_require__.r(n);__nccwpck_require__.d(n,{processEnv:()=>processEnv,loadEnvConfig:()=>loadEnvConfig});var e=__nccwpck_require__(147);var r=__nccwpck_require__.n(e);var t=__nccwpck_require__(17);var o=__nccwpck_require__.n(t);var s=__nccwpck_require__(358);var c=__nccwpck_require__(840);let i=undefined;let a=undefined;let _=[];let p=[];function replaceProcessEnv(e){Object.keys(process.env).forEach((r=>{if(e[r]===undefined||e[r]===\"\"){delete process.env[r]}}));Object.entries(e).forEach((([e,r])=>{process.env[e]=r}))}function processEnv(e,r,n=console,o=false){var a;if(!i){i=Object.assign({},process.env)}if(!o&&(process.env.__NEXT_PROCESSED_ENV||e.length===0)){return process.env}process.env.__NEXT_PROCESSED_ENV=\"true\";const _=Object.assign({},i);const l={};for(const o of e){try{let e={};e.parsed=s.Q(o.contents);e=(0,c.j)(e);if(e.parsed&&!p.some((e=>e.contents===o.contents&&e.path===o.path))){n.info(`Loaded env from ${t.join(r||\"\",o.path)}`)}for(const r of Object.keys(e.parsed||{})){if(typeof l[r]===\"undefined\"&&typeof _[r]===\"undefined\"){l[r]=(a=e.parsed)===null||a===void 0?void 0:a[r]}}}catch(e){n.error(`Failed to load env from ${t.join(r||\"\",o.path)}`,e)}}return Object.assign(process.env,l)}function loadEnvConfig(r,n,o=console,s=false){if(!i){i=Object.assign({},process.env)}if(a&&!s){return{combinedEnv:a,loadedEnvFiles:_}}replaceProcessEnv(i);p=_;_=[];const c=\"development\"===\"test\";const l=c?\"test\":n?\"development\":\"production\";const u=[`.env.${l}.local`,l!==\"test\"&&`.env.local`,`.env.${l}`,\".env\"].filter(Boolean);for(const n of u){const s=t.join(r,n);try{const r=e.statSync(s);if(!r.isFile()){continue}const t=e.readFileSync(s,\"utf8\");_.push({path:n,contents:t})}catch(e){if(e.code!==\"ENOENT\"){o.error(`Failed to load env from ${n}`,e)}}}a=processEnv(_,r,o,s);return{combinedEnv:a,loadedEnvFiles:_}}})();module.exports=n})();\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@next/env/dist/index.js?");
189+
190+/***/ }),
191+
192+/***/ "../node_modules/@swc/helpers/lib/_async_to_generator.js":
193+/*!***************************************************************!*\
194+ !*** ../node_modules/@swc/helpers/lib/_async_to_generator.js ***!
195+ \***************************************************************/
196+/***/ ((__unused_webpack_module, exports) => {
197+
198+"use strict";
199+eval("\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nObject.defineProperty(exports, \"default\", ({\n enumerable: true,\n get: function() {\n return _asyncToGenerator;\n }\n}));\nfunction asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n try {\n var info = gen[key](arg);\n var value = info.value;\n } catch (error) {\n reject(error);\n return;\n }\n if (info.done) {\n resolve(value);\n } else {\n Promise.resolve(value).then(_next, _throw);\n }\n}\nfunction _asyncToGenerator(fn) {\n return function() {\n var self = this, args = arguments;\n return new Promise(function(resolve, reject) {\n var gen = fn.apply(self, args);\n function _next(value) {\n asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n }\n function _throw(err) {\n asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n }\n _next(undefined);\n });\n };\n}\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@swc/helpers/lib/_async_to_generator.js?");
200+
201+/***/ }),
202+
203+/***/ "../node_modules/@swc/helpers/lib/_extends.js":
204+/*!****************************************************!*\
205+ !*** ../node_modules/@swc/helpers/lib/_extends.js ***!
206+ \****************************************************/
207+/***/ ((__unused_webpack_module, exports) => {
208+
209+"use strict";
210+eval("\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nObject.defineProperty(exports, \"default\", ({\n enumerable: true,\n get: function() {\n return _extends;\n }\n}));\nfunction extends_() {\n extends_ = Object.assign || function(target) {\n for(var i = 1; i < arguments.length; i++){\n var source = arguments[i];\n for(var key in source){\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n return target;\n };\n return extends_.apply(this, arguments);\n}\nfunction _extends() {\n return extends_.apply(this, arguments);\n}\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@swc/helpers/lib/_extends.js?");
211+
212+/***/ }),
213+
214+/***/ "../node_modules/@swc/helpers/lib/_interop_require_default.js":
215+/*!********************************************************************!*\
216+ !*** ../node_modules/@swc/helpers/lib/_interop_require_default.js ***!
217+ \********************************************************************/
218+/***/ ((__unused_webpack_module, exports) => {
219+
220+"use strict";
221+eval("\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nObject.defineProperty(exports, \"default\", ({\n enumerable: true,\n get: function() {\n return _interopRequireDefault;\n }\n}));\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {\n default: obj\n };\n}\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@swc/helpers/lib/_interop_require_default.js?");
222+
223+/***/ }),
224+
225+/***/ "../node_modules/@swc/helpers/lib/_interop_require_wildcard.js":
226+/*!*********************************************************************!*\
227+ !*** ../node_modules/@swc/helpers/lib/_interop_require_wildcard.js ***!
228+ \*********************************************************************/
229+/***/ ((__unused_webpack_module, exports) => {
230+
231+"use strict";
232+eval("\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nObject.defineProperty(exports, \"default\", ({\n enumerable: true,\n get: function() {\n return _interopRequireWildcard;\n }\n}));\nfunction _getRequireWildcardCache(nodeInterop) {\n if (typeof WeakMap !== \"function\") return null;\n var cacheBabelInterop = new WeakMap();\n var cacheNodeInterop = new WeakMap();\n return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) {\n return nodeInterop ? cacheNodeInterop : cacheBabelInterop;\n })(nodeInterop);\n}\nfunction _interopRequireWildcard(obj, nodeInterop) {\n if (!nodeInterop && obj && obj.__esModule) {\n return obj;\n }\n if (obj === null || typeof obj !== \"object\" && typeof obj !== \"function\") {\n return {\n default: obj\n };\n }\n var cache = _getRequireWildcardCache(nodeInterop);\n if (cache && cache.has(obj)) {\n return cache.get(obj);\n }\n var newObj = {};\n var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor;\n for(var key in obj){\n if (key !== \"default\" && Object.prototype.hasOwnProperty.call(obj, key)) {\n var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null;\n if (desc && (desc.get || desc.set)) {\n Object.defineProperty(newObj, key, desc);\n } else {\n newObj[key] = obj[key];\n }\n }\n }\n newObj.default = obj;\n if (cache) {\n cache.set(obj, newObj);\n }\n return newObj;\n}\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@swc/helpers/lib/_interop_require_wildcard.js?");
233+
234+/***/ }),
235+
236+/***/ "../node_modules/@swc/helpers/lib/_object_without_properties_loose.js":
237+/*!****************************************************************************!*\
238+ !*** ../node_modules/@swc/helpers/lib/_object_without_properties_loose.js ***!
239+ \****************************************************************************/
240+/***/ ((__unused_webpack_module, exports) => {
241+
242+"use strict";
243+eval("\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nObject.defineProperty(exports, \"default\", ({\n enumerable: true,\n get: function() {\n return _objectWithoutPropertiesLoose;\n }\n}));\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n if (source == null) return {};\n var target = {};\n var sourceKeys = Object.keys(source);\n var key, i;\n for(i = 0; i < sourceKeys.length; i++){\n key = sourceKeys[i];\n if (excluded.indexOf(key) >= 0) continue;\n target[key] = source[key];\n }\n return target;\n}\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@swc/helpers/lib/_object_without_properties_loose.js?");
244+
245+/***/ }),
246+
247+/***/ "../node_modules/@webassemblyjs/ast/esm/clone.js":
248+/*!*******************************************************!*\
249+ !*** ../node_modules/@webassemblyjs/ast/esm/clone.js ***!
250+ \*******************************************************/
251+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
252+
253+"use strict";
254+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"cloneNode\": () => (/* binding */ cloneNode)\n/* harmony export */ });\nfunction cloneNode(n) {\n return Object.assign({}, n);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/clone.js?");
255+
256+/***/ }),
257+
258+/***/ "../node_modules/@webassemblyjs/ast/esm/index.js":
259+/*!*******************************************************!*\
260+ !*** ../node_modules/@webassemblyjs/ast/esm/index.js ***!
261+ \*******************************************************/
262+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
263+
264+"use strict";
265+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"assertBinaryModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertBinaryModule),\n/* harmony export */ \"assertBlockComment\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertBlockComment),\n/* harmony export */ \"assertBlockInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertBlockInstruction),\n/* harmony export */ \"assertByteArray\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertByteArray),\n/* harmony export */ \"assertCallIndirectInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertCallIndirectInstruction),\n/* harmony export */ \"assertCallInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertCallInstruction),\n/* harmony export */ \"assertData\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertData),\n/* harmony export */ \"assertElem\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertElem),\n/* harmony export */ \"assertFloatLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertFloatLiteral),\n/* harmony export */ \"assertFunc\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertFunc),\n/* harmony export */ \"assertFuncImportDescr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertFuncImportDescr),\n/* harmony export */ \"assertFunctionNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertFunctionNameMetadata),\n/* harmony export */ \"assertGlobal\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertGlobal),\n/* harmony export */ \"assertGlobalType\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertGlobalType),\n/* harmony export */ \"assertHasLoc\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.assertHasLoc),\n/* harmony export */ \"assertIdentifier\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertIdentifier),\n/* harmony export */ \"assertIfInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertIfInstruction),\n/* harmony export */ \"assertIndexInFuncSection\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertIndexInFuncSection),\n/* harmony export */ \"assertInstr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertInstr),\n/* harmony export */ \"assertInternalBrUnless\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertInternalBrUnless),\n/* harmony export */ \"assertInternalCallExtern\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertInternalCallExtern),\n/* harmony export */ \"assertInternalEndAndReturn\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertInternalEndAndReturn),\n/* harmony export */ \"assertInternalGoto\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertInternalGoto),\n/* harmony export */ \"assertLeadingComment\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertLeadingComment),\n/* harmony export */ \"assertLimit\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertLimit),\n/* harmony export */ \"assertLocalNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertLocalNameMetadata),\n/* harmony export */ \"assertLongNumberLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertLongNumberLiteral),\n/* harmony export */ \"assertLoopInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertLoopInstruction),\n/* harmony export */ \"assertMemory\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertMemory),\n/* harmony export */ \"assertModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertModule),\n/* harmony export */ \"assertModuleExport\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertModuleExport),\n/* harmony export */ \"assertModuleExportDescr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertModuleExportDescr),\n/* harmony export */ \"assertModuleImport\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertModuleImport),\n/* harmony export */ \"assertModuleMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertModuleMetadata),\n/* harmony export */ \"assertModuleNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertModuleNameMetadata),\n/* harmony export */ \"assertNumberLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertNumberLiteral),\n/* harmony export */ \"assertProducerMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertProducerMetadata),\n/* harmony export */ \"assertProducerMetadataVersionedName\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertProducerMetadataVersionedName),\n/* harmony export */ \"assertProducersSectionMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertProducersSectionMetadata),\n/* harmony export */ \"assertProgram\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertProgram),\n/* harmony export */ \"assertQuoteModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertQuoteModule),\n/* harmony export */ \"assertSectionMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertSectionMetadata),\n/* harmony export */ \"assertSignature\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertSignature),\n/* harmony export */ \"assertStart\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertStart),\n/* harmony export */ \"assertStringLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertStringLiteral),\n/* harmony export */ \"assertTable\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertTable),\n/* harmony export */ \"assertTypeInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertTypeInstruction),\n/* harmony export */ \"assertValtypeLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.assertValtypeLiteral),\n/* harmony export */ \"binaryModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.binaryModule),\n/* harmony export */ \"blockComment\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.blockComment),\n/* harmony export */ \"blockInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.blockInstruction),\n/* harmony export */ \"byteArray\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.byteArray),\n/* harmony export */ \"callIndirectInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.callIndirectInstruction),\n/* harmony export */ \"callInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.callInstruction),\n/* harmony export */ \"cloneNode\": () => (/* reexport safe */ _clone__WEBPACK_IMPORTED_MODULE_5__.cloneNode),\n/* harmony export */ \"data\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.data),\n/* harmony export */ \"elem\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.elem),\n/* harmony export */ \"floatLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.floatLiteral),\n/* harmony export */ \"func\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.func),\n/* harmony export */ \"funcImportDescr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.funcImportDescr),\n/* harmony export */ \"funcParam\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.funcParam),\n/* harmony export */ \"functionNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.functionNameMetadata),\n/* harmony export */ \"getEndBlockByteOffset\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getEndBlockByteOffset),\n/* harmony export */ \"getEndByteOffset\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getEndByteOffset),\n/* harmony export */ \"getEndOfSection\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getEndOfSection),\n/* harmony export */ \"getFunctionBeginingByteOffset\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getFunctionBeginingByteOffset),\n/* harmony export */ \"getSectionMetadata\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getSectionMetadata),\n/* harmony export */ \"getSectionMetadatas\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getSectionMetadatas),\n/* harmony export */ \"getStartBlockByteOffset\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getStartBlockByteOffset),\n/* harmony export */ \"getStartByteOffset\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getStartByteOffset),\n/* harmony export */ \"getUniqueNameGenerator\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.getUniqueNameGenerator),\n/* harmony export */ \"global\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.global),\n/* harmony export */ \"globalType\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.globalType),\n/* harmony export */ \"identifier\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.identifier),\n/* harmony export */ \"ifInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.ifInstruction),\n/* harmony export */ \"indexInFuncSection\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.indexInFuncSection),\n/* harmony export */ \"indexLiteral\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.indexLiteral),\n/* harmony export */ \"instr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.instr),\n/* harmony export */ \"instruction\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.instruction),\n/* harmony export */ \"internalBrUnless\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.internalBrUnless),\n/* harmony export */ \"internalCallExtern\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.internalCallExtern),\n/* harmony export */ \"internalEndAndReturn\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.internalEndAndReturn),\n/* harmony export */ \"internalGoto\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.internalGoto),\n/* harmony export */ \"isAnonymous\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.isAnonymous),\n/* harmony export */ \"isBinaryModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isBinaryModule),\n/* harmony export */ \"isBlock\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isBlock),\n/* harmony export */ \"isBlockComment\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isBlockComment),\n/* harmony export */ \"isBlockInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isBlockInstruction),\n/* harmony export */ \"isByteArray\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isByteArray),\n/* harmony export */ \"isCallIndirectInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isCallIndirectInstruction),\n/* harmony export */ \"isCallInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isCallInstruction),\n/* harmony export */ \"isData\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isData),\n/* harmony export */ \"isElem\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isElem),\n/* harmony export */ \"isExpression\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isExpression),\n/* harmony export */ \"isFloatLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isFloatLiteral),\n/* harmony export */ \"isFunc\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isFunc),\n/* harmony export */ \"isFuncImportDescr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isFuncImportDescr),\n/* harmony export */ \"isFunctionNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isFunctionNameMetadata),\n/* harmony export */ \"isGlobal\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isGlobal),\n/* harmony export */ \"isGlobalType\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isGlobalType),\n/* harmony export */ \"isIdentifier\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isIdentifier),\n/* harmony export */ \"isIfInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isIfInstruction),\n/* harmony export */ \"isImportDescr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isImportDescr),\n/* harmony export */ \"isIndexInFuncSection\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isIndexInFuncSection),\n/* harmony export */ \"isInstr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isInstr),\n/* harmony export */ \"isInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isInstruction),\n/* harmony export */ \"isInternalBrUnless\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isInternalBrUnless),\n/* harmony export */ \"isInternalCallExtern\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isInternalCallExtern),\n/* harmony export */ \"isInternalEndAndReturn\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isInternalEndAndReturn),\n/* harmony export */ \"isInternalGoto\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isInternalGoto),\n/* harmony export */ \"isIntrinsic\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isIntrinsic),\n/* harmony export */ \"isLeadingComment\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isLeadingComment),\n/* harmony export */ \"isLimit\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isLimit),\n/* harmony export */ \"isLocalNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isLocalNameMetadata),\n/* harmony export */ \"isLongNumberLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isLongNumberLiteral),\n/* harmony export */ \"isLoopInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isLoopInstruction),\n/* harmony export */ \"isMemory\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isMemory),\n/* harmony export */ \"isModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isModule),\n/* harmony export */ \"isModuleExport\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isModuleExport),\n/* harmony export */ \"isModuleExportDescr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isModuleExportDescr),\n/* harmony export */ \"isModuleImport\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isModuleImport),\n/* harmony export */ \"isModuleMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isModuleMetadata),\n/* harmony export */ \"isModuleNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isModuleNameMetadata),\n/* harmony export */ \"isNode\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isNode),\n/* harmony export */ \"isNumberLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isNumberLiteral),\n/* harmony export */ \"isNumericLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isNumericLiteral),\n/* harmony export */ \"isProducerMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isProducerMetadata),\n/* harmony export */ \"isProducerMetadataVersionedName\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isProducerMetadataVersionedName),\n/* harmony export */ \"isProducersSectionMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isProducersSectionMetadata),\n/* harmony export */ \"isProgram\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isProgram),\n/* harmony export */ \"isQuoteModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isQuoteModule),\n/* harmony export */ \"isSectionMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isSectionMetadata),\n/* harmony export */ \"isSignature\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isSignature),\n/* harmony export */ \"isStart\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isStart),\n/* harmony export */ \"isStringLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isStringLiteral),\n/* harmony export */ \"isTable\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isTable),\n/* harmony export */ \"isTypeInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isTypeInstruction),\n/* harmony export */ \"isValtypeLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.isValtypeLiteral),\n/* harmony export */ \"leadingComment\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.leadingComment),\n/* harmony export */ \"limit\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.limit),\n/* harmony export */ \"localNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.localNameMetadata),\n/* harmony export */ \"longNumberLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.longNumberLiteral),\n/* harmony export */ \"loopInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.loopInstruction),\n/* harmony export */ \"memIndexLiteral\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.memIndexLiteral),\n/* harmony export */ \"memory\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.memory),\n/* harmony export */ \"module\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.module),\n/* harmony export */ \"moduleContextFromModuleAST\": () => (/* reexport safe */ _transform_ast_module_to_module_context__WEBPACK_IMPORTED_MODULE_6__.moduleContextFromModuleAST),\n/* harmony export */ \"moduleExport\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.moduleExport),\n/* harmony export */ \"moduleExportDescr\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.moduleExportDescr),\n/* harmony export */ \"moduleImport\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.moduleImport),\n/* harmony export */ \"moduleMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.moduleMetadata),\n/* harmony export */ \"moduleNameMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.moduleNameMetadata),\n/* harmony export */ \"nodeAndUnionTypes\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.nodeAndUnionTypes),\n/* harmony export */ \"numberLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.numberLiteral),\n/* harmony export */ \"numberLiteralFromRaw\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.numberLiteralFromRaw),\n/* harmony export */ \"objectInstruction\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.objectInstruction),\n/* harmony export */ \"orderedInsertNode\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.orderedInsertNode),\n/* harmony export */ \"producerMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.producerMetadata),\n/* harmony export */ \"producerMetadataVersionedName\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.producerMetadataVersionedName),\n/* harmony export */ \"producersSectionMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.producersSectionMetadata),\n/* harmony export */ \"program\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.program),\n/* harmony export */ \"quoteModule\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.quoteModule),\n/* harmony export */ \"sectionMetadata\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.sectionMetadata),\n/* harmony export */ \"shiftLoc\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.shiftLoc),\n/* harmony export */ \"shiftSection\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.shiftSection),\n/* harmony export */ \"signature\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.signature),\n/* harmony export */ \"signatureForOpcode\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.signatureForOpcode),\n/* harmony export */ \"signatures\": () => (/* reexport safe */ _signatures__WEBPACK_IMPORTED_MODULE_3__.signatures),\n/* harmony export */ \"sortSectionMetadata\": () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_4__.sortSectionMetadata),\n/* harmony export */ \"start\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.start),\n/* harmony export */ \"stringLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.stringLiteral),\n/* harmony export */ \"table\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.table),\n/* harmony export */ \"traverse\": () => (/* reexport safe */ _traverse__WEBPACK_IMPORTED_MODULE_2__.traverse),\n/* harmony export */ \"typeInstruction\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.typeInstruction),\n/* harmony export */ \"unionTypesMap\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.unionTypesMap),\n/* harmony export */ \"valtypeLiteral\": () => (/* reexport safe */ _nodes__WEBPACK_IMPORTED_MODULE_0__.valtypeLiteral),\n/* harmony export */ \"withLoc\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.withLoc),\n/* harmony export */ \"withRaw\": () => (/* reexport safe */ _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__.withRaw)\n/* harmony export */ });\n/* harmony import */ var _nodes__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./nodes */ \"../node_modules/@webassemblyjs/ast/esm/nodes.js\");\n/* harmony import */ var _node_helpers_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./node-helpers.js */ \"../node_modules/@webassemblyjs/ast/esm/node-helpers.js\");\n/* harmony import */ var _traverse__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./traverse */ \"../node_modules/@webassemblyjs/ast/esm/traverse.js\");\n/* harmony import */ var _signatures__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./signatures */ \"../node_modules/@webassemblyjs/ast/esm/signatures.js\");\n/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./utils */ \"../node_modules/@webassemblyjs/ast/esm/utils.js\");\n/* harmony import */ var _clone__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./clone */ \"../node_modules/@webassemblyjs/ast/esm/clone.js\");\n/* harmony import */ var _transform_ast_module_to_module_context__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./transform/ast-module-to-module-context */ \"../node_modules/@webassemblyjs/ast/esm/transform/ast-module-to-module-context/index.js\");\n\n\n\n\n\n\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/index.js?");
266+
267+/***/ }),
268+
269+/***/ "../node_modules/@webassemblyjs/ast/esm/node-helpers.js":
270+/*!**************************************************************!*\
271+ !*** ../node_modules/@webassemblyjs/ast/esm/node-helpers.js ***!
272+ \**************************************************************/
273+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
274+
275+"use strict";
276+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"funcParam\": () => (/* binding */ funcParam),\n/* harmony export */ \"indexLiteral\": () => (/* binding */ indexLiteral),\n/* harmony export */ \"instruction\": () => (/* binding */ instruction),\n/* harmony export */ \"memIndexLiteral\": () => (/* binding */ memIndexLiteral),\n/* harmony export */ \"numberLiteralFromRaw\": () => (/* binding */ numberLiteralFromRaw),\n/* harmony export */ \"objectInstruction\": () => (/* binding */ objectInstruction),\n/* harmony export */ \"withLoc\": () => (/* binding */ withLoc),\n/* harmony export */ \"withRaw\": () => (/* binding */ withRaw)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/helper-numbers */ \"../node_modules/@webassemblyjs/helper-numbers/esm/index.js\");\n/* harmony import */ var _nodes__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./nodes */ \"../node_modules/@webassemblyjs/ast/esm/nodes.js\");\n\n\nfunction numberLiteralFromRaw(rawValue) {\n var instructionType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : \"i32\";\n var original = rawValue; // Remove numeric separators _\n\n if (typeof rawValue === \"string\") {\n rawValue = rawValue.replace(/_/g, \"\");\n }\n\n if (typeof rawValue === \"number\") {\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.numberLiteral)(rawValue, String(original));\n } else {\n switch (instructionType) {\n case \"i32\":\n {\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.numberLiteral)((0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.parse32I)(rawValue), String(original));\n }\n\n case \"u32\":\n {\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.numberLiteral)((0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.parseU32)(rawValue), String(original));\n }\n\n case \"i64\":\n {\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.longNumberLiteral)((0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.parse64I)(rawValue), String(original));\n }\n\n case \"f32\":\n {\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.floatLiteral)((0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.parse32F)(rawValue), (0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.isNanLiteral)(rawValue), (0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.isInfLiteral)(rawValue), String(original));\n }\n // f64\n\n default:\n {\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.floatLiteral)((0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.parse64F)(rawValue), (0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.isNanLiteral)(rawValue), (0,_webassemblyjs_helper_numbers__WEBPACK_IMPORTED_MODULE_0__.isInfLiteral)(rawValue), String(original));\n }\n }\n }\n}\nfunction instruction(id) {\n var args = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n var namedArgs = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.instr)(id, undefined, args, namedArgs);\n}\nfunction objectInstruction(id, object) {\n var args = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];\n var namedArgs = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n return (0,_nodes__WEBPACK_IMPORTED_MODULE_1__.instr)(id, object, args, namedArgs);\n}\n/**\n * Decorators\n */\n\nfunction withLoc(n, end, start) {\n var loc = {\n start: start,\n end: end\n };\n n.loc = loc;\n return n;\n}\nfunction withRaw(n, raw) {\n n.raw = raw;\n return n;\n}\nfunction funcParam(valtype, id) {\n return {\n id: id,\n valtype: valtype\n };\n}\nfunction indexLiteral(value) {\n // $FlowIgnore\n var x = numberLiteralFromRaw(value, \"u32\");\n return x;\n}\nfunction memIndexLiteral(value) {\n // $FlowIgnore\n var x = numberLiteralFromRaw(value, \"u32\");\n return x;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/node-helpers.js?");
277+
278+/***/ }),
279+
280+/***/ "../node_modules/@webassemblyjs/ast/esm/node-path.js":
281+/*!***********************************************************!*\
282+ !*** ../node_modules/@webassemblyjs/ast/esm/node-path.js ***!
283+ \***********************************************************/
284+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
285+
286+"use strict";
287+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"createPath\": () => (/* binding */ createPath)\n/* harmony export */ });\nfunction _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction findParent(_ref, cb) {\n var parentPath = _ref.parentPath;\n\n if (parentPath == null) {\n throw new Error(\"node is root\");\n }\n\n var currentPath = parentPath;\n\n while (cb(currentPath) !== false) {\n // Hit the root node, stop\n // $FlowIgnore\n if (currentPath.parentPath == null) {\n return null;\n } // $FlowIgnore\n\n\n currentPath = currentPath.parentPath;\n }\n\n return currentPath.node;\n}\n\nfunction insertBefore(context, newNode) {\n return insert(context, newNode);\n}\n\nfunction insertAfter(context, newNode) {\n return insert(context, newNode, 1);\n}\n\nfunction insert(_ref2, newNode) {\n var node = _ref2.node,\n inList = _ref2.inList,\n parentPath = _ref2.parentPath,\n parentKey = _ref2.parentKey;\n var indexOffset = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n\n if (!inList) {\n throw new Error('inList' + \" error: \" + (\"insert can only be used for nodes that are within lists\" || 0));\n }\n\n if (!(parentPath != null)) {\n throw new Error('parentPath != null' + \" error: \" + (\"Can not remove root node\" || 0));\n }\n\n // $FlowIgnore\n var parentList = parentPath.node[parentKey];\n var indexInList = parentList.findIndex(function (n) {\n return n === node;\n });\n parentList.splice(indexInList + indexOffset, 0, newNode);\n}\n\nfunction remove(_ref3) {\n var node = _ref3.node,\n parentKey = _ref3.parentKey,\n parentPath = _ref3.parentPath;\n\n if (!(parentPath != null)) {\n throw new Error('parentPath != null' + \" error: \" + (\"Can not remove root node\" || 0));\n }\n\n // $FlowIgnore\n var parentNode = parentPath.node; // $FlowIgnore\n\n var parentProperty = parentNode[parentKey];\n\n if (Array.isArray(parentProperty)) {\n // $FlowIgnore\n parentNode[parentKey] = parentProperty.filter(function (n) {\n return n !== node;\n });\n } else {\n // $FlowIgnore\n delete parentNode[parentKey];\n }\n\n node._deleted = true;\n}\n\nfunction stop(context) {\n context.shouldStop = true;\n}\n\nfunction replaceWith(context, newNode) {\n // $FlowIgnore\n var parentNode = context.parentPath.node; // $FlowIgnore\n\n var parentProperty = parentNode[context.parentKey];\n\n if (Array.isArray(parentProperty)) {\n var indexInList = parentProperty.findIndex(function (n) {\n return n === context.node;\n });\n parentProperty.splice(indexInList, 1, newNode);\n } else {\n // $FlowIgnore\n parentNode[context.parentKey] = newNode;\n }\n\n context.node._deleted = true;\n context.node = newNode;\n} // bind the context to the first argument of node operations\n\n\nfunction bindNodeOperations(operations, context) {\n var keys = Object.keys(operations);\n var boundOperations = {};\n keys.forEach(function (key) {\n boundOperations[key] = operations[key].bind(null, context);\n });\n return boundOperations;\n}\n\nfunction createPathOperations(context) {\n // $FlowIgnore\n return bindNodeOperations({\n findParent: findParent,\n replaceWith: replaceWith,\n remove: remove,\n insertBefore: insertBefore,\n insertAfter: insertAfter,\n stop: stop\n }, context);\n}\n\nfunction createPath(context) {\n var path = _extends({}, context); // $FlowIgnore\n\n\n Object.assign(path, createPathOperations(path)); // $FlowIgnore\n\n return path;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/node-path.js?");
288+
289+/***/ }),
290+
291+/***/ "../node_modules/@webassemblyjs/ast/esm/nodes.js":
292+/*!*******************************************************!*\
293+ !*** ../node_modules/@webassemblyjs/ast/esm/nodes.js ***!
294+ \*******************************************************/
295+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
296+
297+"use strict";
298+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"assertBinaryModule\": () => (/* binding */ assertBinaryModule),\n/* harmony export */ \"assertBlockComment\": () => (/* binding */ assertBlockComment),\n/* harmony export */ \"assertBlockInstruction\": () => (/* binding */ assertBlockInstruction),\n/* harmony export */ \"assertByteArray\": () => (/* binding */ assertByteArray),\n/* harmony export */ \"assertCallIndirectInstruction\": () => (/* binding */ assertCallIndirectInstruction),\n/* harmony export */ \"assertCallInstruction\": () => (/* binding */ assertCallInstruction),\n/* harmony export */ \"assertData\": () => (/* binding */ assertData),\n/* harmony export */ \"assertElem\": () => (/* binding */ assertElem),\n/* harmony export */ \"assertFloatLiteral\": () => (/* binding */ assertFloatLiteral),\n/* harmony export */ \"assertFunc\": () => (/* binding */ assertFunc),\n/* harmony export */ \"assertFuncImportDescr\": () => (/* binding */ assertFuncImportDescr),\n/* harmony export */ \"assertFunctionNameMetadata\": () => (/* binding */ assertFunctionNameMetadata),\n/* harmony export */ \"assertGlobal\": () => (/* binding */ assertGlobal),\n/* harmony export */ \"assertGlobalType\": () => (/* binding */ assertGlobalType),\n/* harmony export */ \"assertIdentifier\": () => (/* binding */ assertIdentifier),\n/* harmony export */ \"assertIfInstruction\": () => (/* binding */ assertIfInstruction),\n/* harmony export */ \"assertIndexInFuncSection\": () => (/* binding */ assertIndexInFuncSection),\n/* harmony export */ \"assertInstr\": () => (/* binding */ assertInstr),\n/* harmony export */ \"assertInternalBrUnless\": () => (/* binding */ assertInternalBrUnless),\n/* harmony export */ \"assertInternalCallExtern\": () => (/* binding */ assertInternalCallExtern),\n/* harmony export */ \"assertInternalEndAndReturn\": () => (/* binding */ assertInternalEndAndReturn),\n/* harmony export */ \"assertInternalGoto\": () => (/* binding */ assertInternalGoto),\n/* harmony export */ \"assertLeadingComment\": () => (/* binding */ assertLeadingComment),\n/* harmony export */ \"assertLimit\": () => (/* binding */ assertLimit),\n/* harmony export */ \"assertLocalNameMetadata\": () => (/* binding */ assertLocalNameMetadata),\n/* harmony export */ \"assertLongNumberLiteral\": () => (/* binding */ assertLongNumberLiteral),\n/* harmony export */ \"assertLoopInstruction\": () => (/* binding */ assertLoopInstruction),\n/* harmony export */ \"assertMemory\": () => (/* binding */ assertMemory),\n/* harmony export */ \"assertModule\": () => (/* binding */ assertModule),\n/* harmony export */ \"assertModuleExport\": () => (/* binding */ assertModuleExport),\n/* harmony export */ \"assertModuleExportDescr\": () => (/* binding */ assertModuleExportDescr),\n/* harmony export */ \"assertModuleImport\": () => (/* binding */ assertModuleImport),\n/* harmony export */ \"assertModuleMetadata\": () => (/* binding */ assertModuleMetadata),\n/* harmony export */ \"assertModuleNameMetadata\": () => (/* binding */ assertModuleNameMetadata),\n/* harmony export */ \"assertNumberLiteral\": () => (/* binding */ assertNumberLiteral),\n/* harmony export */ \"assertProducerMetadata\": () => (/* binding */ assertProducerMetadata),\n/* harmony export */ \"assertProducerMetadataVersionedName\": () => (/* binding */ assertProducerMetadataVersionedName),\n/* harmony export */ \"assertProducersSectionMetadata\": () => (/* binding */ assertProducersSectionMetadata),\n/* harmony export */ \"assertProgram\": () => (/* binding */ assertProgram),\n/* harmony export */ \"assertQuoteModule\": () => (/* binding */ assertQuoteModule),\n/* harmony export */ \"assertSectionMetadata\": () => (/* binding */ assertSectionMetadata),\n/* harmony export */ \"assertSignature\": () => (/* binding */ assertSignature),\n/* harmony export */ \"assertStart\": () => (/* binding */ assertStart),\n/* harmony export */ \"assertStringLiteral\": () => (/* binding */ assertStringLiteral),\n/* harmony export */ \"assertTable\": () => (/* binding */ assertTable),\n/* harmony export */ \"assertTypeInstruction\": () => (/* binding */ assertTypeInstruction),\n/* harmony export */ \"assertValtypeLiteral\": () => (/* binding */ assertValtypeLiteral),\n/* harmony export */ \"binaryModule\": () => (/* binding */ binaryModule),\n/* harmony export */ \"blockComment\": () => (/* binding */ blockComment),\n/* harmony export */ \"blockInstruction\": () => (/* binding */ blockInstruction),\n/* harmony export */ \"byteArray\": () => (/* binding */ byteArray),\n/* harmony export */ \"callIndirectInstruction\": () => (/* binding */ callIndirectInstruction),\n/* harmony export */ \"callInstruction\": () => (/* binding */ callInstruction),\n/* harmony export */ \"data\": () => (/* binding */ data),\n/* harmony export */ \"elem\": () => (/* binding */ elem),\n/* harmony export */ \"floatLiteral\": () => (/* binding */ floatLiteral),\n/* harmony export */ \"func\": () => (/* binding */ func),\n/* harmony export */ \"funcImportDescr\": () => (/* binding */ funcImportDescr),\n/* harmony export */ \"functionNameMetadata\": () => (/* binding */ functionNameMetadata),\n/* harmony export */ \"global\": () => (/* binding */ global),\n/* harmony export */ \"globalType\": () => (/* binding */ globalType),\n/* harmony export */ \"identifier\": () => (/* binding */ identifier),\n/* harmony export */ \"ifInstruction\": () => (/* binding */ ifInstruction),\n/* harmony export */ \"indexInFuncSection\": () => (/* binding */ indexInFuncSection),\n/* harmony export */ \"instr\": () => (/* binding */ instr),\n/* harmony export */ \"internalBrUnless\": () => (/* binding */ internalBrUnless),\n/* harmony export */ \"internalCallExtern\": () => (/* binding */ internalCallExtern),\n/* harmony export */ \"internalEndAndReturn\": () => (/* binding */ internalEndAndReturn),\n/* harmony export */ \"internalGoto\": () => (/* binding */ internalGoto),\n/* harmony export */ \"isBinaryModule\": () => (/* binding */ isBinaryModule),\n/* harmony export */ \"isBlock\": () => (/* binding */ isBlock),\n/* harmony export */ \"isBlockComment\": () => (/* binding */ isBlockComment),\n/* harmony export */ \"isBlockInstruction\": () => (/* binding */ isBlockInstruction),\n/* harmony export */ \"isByteArray\": () => (/* binding */ isByteArray),\n/* harmony export */ \"isCallIndirectInstruction\": () => (/* binding */ isCallIndirectInstruction),\n/* harmony export */ \"isCallInstruction\": () => (/* binding */ isCallInstruction),\n/* harmony export */ \"isData\": () => (/* binding */ isData),\n/* harmony export */ \"isElem\": () => (/* binding */ isElem),\n/* harmony export */ \"isExpression\": () => (/* binding */ isExpression),\n/* harmony export */ \"isFloatLiteral\": () => (/* binding */ isFloatLiteral),\n/* harmony export */ \"isFunc\": () => (/* binding */ isFunc),\n/* harmony export */ \"isFuncImportDescr\": () => (/* binding */ isFuncImportDescr),\n/* harmony export */ \"isFunctionNameMetadata\": () => (/* binding */ isFunctionNameMetadata),\n/* harmony export */ \"isGlobal\": () => (/* binding */ isGlobal),\n/* harmony export */ \"isGlobalType\": () => (/* binding */ isGlobalType),\n/* harmony export */ \"isIdentifier\": () => (/* binding */ isIdentifier),\n/* harmony export */ \"isIfInstruction\": () => (/* binding */ isIfInstruction),\n/* harmony export */ \"isImportDescr\": () => (/* binding */ isImportDescr),\n/* harmony export */ \"isIndexInFuncSection\": () => (/* binding */ isIndexInFuncSection),\n/* harmony export */ \"isInstr\": () => (/* binding */ isInstr),\n/* harmony export */ \"isInstruction\": () => (/* binding */ isInstruction),\n/* harmony export */ \"isInternalBrUnless\": () => (/* binding */ isInternalBrUnless),\n/* harmony export */ \"isInternalCallExtern\": () => (/* binding */ isInternalCallExtern),\n/* harmony export */ \"isInternalEndAndReturn\": () => (/* binding */ isInternalEndAndReturn),\n/* harmony export */ \"isInternalGoto\": () => (/* binding */ isInternalGoto),\n/* harmony export */ \"isIntrinsic\": () => (/* binding */ isIntrinsic),\n/* harmony export */ \"isLeadingComment\": () => (/* binding */ isLeadingComment),\n/* harmony export */ \"isLimit\": () => (/* binding */ isLimit),\n/* harmony export */ \"isLocalNameMetadata\": () => (/* binding */ isLocalNameMetadata),\n/* harmony export */ \"isLongNumberLiteral\": () => (/* binding */ isLongNumberLiteral),\n/* harmony export */ \"isLoopInstruction\": () => (/* binding */ isLoopInstruction),\n/* harmony export */ \"isMemory\": () => (/* binding */ isMemory),\n/* harmony export */ \"isModule\": () => (/* binding */ isModule),\n/* harmony export */ \"isModuleExport\": () => (/* binding */ isModuleExport),\n/* harmony export */ \"isModuleExportDescr\": () => (/* binding */ isModuleExportDescr),\n/* harmony export */ \"isModuleImport\": () => (/* binding */ isModuleImport),\n/* harmony export */ \"isModuleMetadata\": () => (/* binding */ isModuleMetadata),\n/* harmony export */ \"isModuleNameMetadata\": () => (/* binding */ isModuleNameMetadata),\n/* harmony export */ \"isNode\": () => (/* binding */ isNode),\n/* harmony export */ \"isNumberLiteral\": () => (/* binding */ isNumberLiteral),\n/* harmony export */ \"isNumericLiteral\": () => (/* binding */ isNumericLiteral),\n/* harmony export */ \"isProducerMetadata\": () => (/* binding */ isProducerMetadata),\n/* harmony export */ \"isProducerMetadataVersionedName\": () => (/* binding */ isProducerMetadataVersionedName),\n/* harmony export */ \"isProducersSectionMetadata\": () => (/* binding */ isProducersSectionMetadata),\n/* harmony export */ \"isProgram\": () => (/* binding */ isProgram),\n/* harmony export */ \"isQuoteModule\": () => (/* binding */ isQuoteModule),\n/* harmony export */ \"isSectionMetadata\": () => (/* binding */ isSectionMetadata),\n/* harmony export */ \"isSignature\": () => (/* binding */ isSignature),\n/* harmony export */ \"isStart\": () => (/* binding */ isStart),\n/* harmony export */ \"isStringLiteral\": () => (/* binding */ isStringLiteral),\n/* harmony export */ \"isTable\": () => (/* binding */ isTable),\n/* harmony export */ \"isTypeInstruction\": () => (/* binding */ isTypeInstruction),\n/* harmony export */ \"isValtypeLiteral\": () => (/* binding */ isValtypeLiteral),\n/* harmony export */ \"leadingComment\": () => (/* binding */ leadingComment),\n/* harmony export */ \"limit\": () => (/* binding */ limit),\n/* harmony export */ \"localNameMetadata\": () => (/* binding */ localNameMetadata),\n/* harmony export */ \"longNumberLiteral\": () => (/* binding */ longNumberLiteral),\n/* harmony export */ \"loopInstruction\": () => (/* binding */ loopInstruction),\n/* harmony export */ \"memory\": () => (/* binding */ memory),\n/* harmony export */ \"module\": () => (/* binding */ module),\n/* harmony export */ \"moduleExport\": () => (/* binding */ moduleExport),\n/* harmony export */ \"moduleExportDescr\": () => (/* binding */ moduleExportDescr),\n/* harmony export */ \"moduleImport\": () => (/* binding */ moduleImport),\n/* harmony export */ \"moduleMetadata\": () => (/* binding */ moduleMetadata),\n/* harmony export */ \"moduleNameMetadata\": () => (/* binding */ moduleNameMetadata),\n/* harmony export */ \"nodeAndUnionTypes\": () => (/* binding */ nodeAndUnionTypes),\n/* harmony export */ \"numberLiteral\": () => (/* binding */ numberLiteral),\n/* harmony export */ \"producerMetadata\": () => (/* binding */ producerMetadata),\n/* harmony export */ \"producerMetadataVersionedName\": () => (/* binding */ producerMetadataVersionedName),\n/* harmony export */ \"producersSectionMetadata\": () => (/* binding */ producersSectionMetadata),\n/* harmony export */ \"program\": () => (/* binding */ program),\n/* harmony export */ \"quoteModule\": () => (/* binding */ quoteModule),\n/* harmony export */ \"sectionMetadata\": () => (/* binding */ sectionMetadata),\n/* harmony export */ \"signature\": () => (/* binding */ signature),\n/* harmony export */ \"start\": () => (/* binding */ start),\n/* harmony export */ \"stringLiteral\": () => (/* binding */ stringLiteral),\n/* harmony export */ \"table\": () => (/* binding */ table),\n/* harmony export */ \"typeInstruction\": () => (/* binding */ typeInstruction),\n/* harmony export */ \"unionTypesMap\": () => (/* binding */ unionTypesMap),\n/* harmony export */ \"valtypeLiteral\": () => (/* binding */ valtypeLiteral)\n/* harmony export */ });\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n// THIS FILE IS AUTOGENERATED\n// see scripts/generateNodeUtils.js\nfunction isTypeOf(t) {\n return function (n) {\n return n.type === t;\n };\n}\n\nfunction assertTypeOf(t) {\n return function (n) {\n return function () {\n if (!(n.type === t)) {\n throw new Error('n.type === t' + \" error: \" + ( false || \"unknown\"));\n }\n }();\n };\n}\n\nfunction module(id, fields, metadata) {\n if (id !== null && id !== undefined) {\n if (!(typeof id === \"string\")) {\n throw new Error('typeof id === \"string\"' + \" error: \" + (\"Argument id must be of type string, given: \" + _typeof(id) || 0));\n }\n }\n\n if (!(_typeof(fields) === \"object\" && typeof fields.length !== \"undefined\")) {\n throw new Error('typeof fields === \"object\" && typeof fields.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"Module\",\n id: id,\n fields: fields\n };\n\n if (typeof metadata !== \"undefined\") {\n node.metadata = metadata;\n }\n\n return node;\n}\nfunction moduleMetadata(sections, functionNames, localNames, producers) {\n if (!(_typeof(sections) === \"object\" && typeof sections.length !== \"undefined\")) {\n throw new Error('typeof sections === \"object\" && typeof sections.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (functionNames !== null && functionNames !== undefined) {\n if (!(_typeof(functionNames) === \"object\" && typeof functionNames.length !== \"undefined\")) {\n throw new Error('typeof functionNames === \"object\" && typeof functionNames.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n }\n\n if (localNames !== null && localNames !== undefined) {\n if (!(_typeof(localNames) === \"object\" && typeof localNames.length !== \"undefined\")) {\n throw new Error('typeof localNames === \"object\" && typeof localNames.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n }\n\n if (producers !== null && producers !== undefined) {\n if (!(_typeof(producers) === \"object\" && typeof producers.length !== \"undefined\")) {\n throw new Error('typeof producers === \"object\" && typeof producers.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n }\n\n var node = {\n type: \"ModuleMetadata\",\n sections: sections\n };\n\n if (typeof functionNames !== \"undefined\" && functionNames.length > 0) {\n node.functionNames = functionNames;\n }\n\n if (typeof localNames !== \"undefined\" && localNames.length > 0) {\n node.localNames = localNames;\n }\n\n if (typeof producers !== \"undefined\" && producers.length > 0) {\n node.producers = producers;\n }\n\n return node;\n}\nfunction moduleNameMetadata(value) {\n if (!(typeof value === \"string\")) {\n throw new Error('typeof value === \"string\"' + \" error: \" + (\"Argument value must be of type string, given: \" + _typeof(value) || 0));\n }\n\n var node = {\n type: \"ModuleNameMetadata\",\n value: value\n };\n return node;\n}\nfunction functionNameMetadata(value, index) {\n if (!(typeof value === \"string\")) {\n throw new Error('typeof value === \"string\"' + \" error: \" + (\"Argument value must be of type string, given: \" + _typeof(value) || 0));\n }\n\n if (!(typeof index === \"number\")) {\n throw new Error('typeof index === \"number\"' + \" error: \" + (\"Argument index must be of type number, given: \" + _typeof(index) || 0));\n }\n\n var node = {\n type: \"FunctionNameMetadata\",\n value: value,\n index: index\n };\n return node;\n}\nfunction localNameMetadata(value, localIndex, functionIndex) {\n if (!(typeof value === \"string\")) {\n throw new Error('typeof value === \"string\"' + \" error: \" + (\"Argument value must be of type string, given: \" + _typeof(value) || 0));\n }\n\n if (!(typeof localIndex === \"number\")) {\n throw new Error('typeof localIndex === \"number\"' + \" error: \" + (\"Argument localIndex must be of type number, given: \" + _typeof(localIndex) || 0));\n }\n\n if (!(typeof functionIndex === \"number\")) {\n throw new Error('typeof functionIndex === \"number\"' + \" error: \" + (\"Argument functionIndex must be of type number, given: \" + _typeof(functionIndex) || 0));\n }\n\n var node = {\n type: \"LocalNameMetadata\",\n value: value,\n localIndex: localIndex,\n functionIndex: functionIndex\n };\n return node;\n}\nfunction binaryModule(id, blob) {\n if (id !== null && id !== undefined) {\n if (!(typeof id === \"string\")) {\n throw new Error('typeof id === \"string\"' + \" error: \" + (\"Argument id must be of type string, given: \" + _typeof(id) || 0));\n }\n }\n\n if (!(_typeof(blob) === \"object\" && typeof blob.length !== \"undefined\")) {\n throw new Error('typeof blob === \"object\" && typeof blob.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"BinaryModule\",\n id: id,\n blob: blob\n };\n return node;\n}\nfunction quoteModule(id, string) {\n if (id !== null && id !== undefined) {\n if (!(typeof id === \"string\")) {\n throw new Error('typeof id === \"string\"' + \" error: \" + (\"Argument id must be of type string, given: \" + _typeof(id) || 0));\n }\n }\n\n if (!(_typeof(string) === \"object\" && typeof string.length !== \"undefined\")) {\n throw new Error('typeof string === \"object\" && typeof string.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"QuoteModule\",\n id: id,\n string: string\n };\n return node;\n}\nfunction sectionMetadata(section, startOffset, size, vectorOfSize) {\n if (!(typeof startOffset === \"number\")) {\n throw new Error('typeof startOffset === \"number\"' + \" error: \" + (\"Argument startOffset must be of type number, given: \" + _typeof(startOffset) || 0));\n }\n\n var node = {\n type: \"SectionMetadata\",\n section: section,\n startOffset: startOffset,\n size: size,\n vectorOfSize: vectorOfSize\n };\n return node;\n}\nfunction producersSectionMetadata(producers) {\n if (!(_typeof(producers) === \"object\" && typeof producers.length !== \"undefined\")) {\n throw new Error('typeof producers === \"object\" && typeof producers.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"ProducersSectionMetadata\",\n producers: producers\n };\n return node;\n}\nfunction producerMetadata(language, processedBy, sdk) {\n if (!(_typeof(language) === \"object\" && typeof language.length !== \"undefined\")) {\n throw new Error('typeof language === \"object\" && typeof language.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (!(_typeof(processedBy) === \"object\" && typeof processedBy.length !== \"undefined\")) {\n throw new Error('typeof processedBy === \"object\" && typeof processedBy.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (!(_typeof(sdk) === \"object\" && typeof sdk.length !== \"undefined\")) {\n throw new Error('typeof sdk === \"object\" && typeof sdk.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"ProducerMetadata\",\n language: language,\n processedBy: processedBy,\n sdk: sdk\n };\n return node;\n}\nfunction producerMetadataVersionedName(name, version) {\n if (!(typeof name === \"string\")) {\n throw new Error('typeof name === \"string\"' + \" error: \" + (\"Argument name must be of type string, given: \" + _typeof(name) || 0));\n }\n\n if (!(typeof version === \"string\")) {\n throw new Error('typeof version === \"string\"' + \" error: \" + (\"Argument version must be of type string, given: \" + _typeof(version) || 0));\n }\n\n var node = {\n type: \"ProducerMetadataVersionedName\",\n name: name,\n version: version\n };\n return node;\n}\nfunction loopInstruction(label, resulttype, instr) {\n if (!(_typeof(instr) === \"object\" && typeof instr.length !== \"undefined\")) {\n throw new Error('typeof instr === \"object\" && typeof instr.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"LoopInstruction\",\n id: \"loop\",\n label: label,\n resulttype: resulttype,\n instr: instr\n };\n return node;\n}\nfunction instr(id, object, args, namedArgs) {\n if (!(typeof id === \"string\")) {\n throw new Error('typeof id === \"string\"' + \" error: \" + (\"Argument id must be of type string, given: \" + _typeof(id) || 0));\n }\n\n if (!(_typeof(args) === \"object\" && typeof args.length !== \"undefined\")) {\n throw new Error('typeof args === \"object\" && typeof args.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"Instr\",\n id: id,\n args: args\n };\n\n if (typeof object !== \"undefined\") {\n node.object = object;\n }\n\n if (typeof namedArgs !== \"undefined\" && Object.keys(namedArgs).length !== 0) {\n node.namedArgs = namedArgs;\n }\n\n return node;\n}\nfunction ifInstruction(testLabel, test, result, consequent, alternate) {\n if (!(_typeof(test) === \"object\" && typeof test.length !== \"undefined\")) {\n throw new Error('typeof test === \"object\" && typeof test.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (!(_typeof(consequent) === \"object\" && typeof consequent.length !== \"undefined\")) {\n throw new Error('typeof consequent === \"object\" && typeof consequent.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (!(_typeof(alternate) === \"object\" && typeof alternate.length !== \"undefined\")) {\n throw new Error('typeof alternate === \"object\" && typeof alternate.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"IfInstruction\",\n id: \"if\",\n testLabel: testLabel,\n test: test,\n result: result,\n consequent: consequent,\n alternate: alternate\n };\n return node;\n}\nfunction stringLiteral(value) {\n if (!(typeof value === \"string\")) {\n throw new Error('typeof value === \"string\"' + \" error: \" + (\"Argument value must be of type string, given: \" + _typeof(value) || 0));\n }\n\n var node = {\n type: \"StringLiteral\",\n value: value\n };\n return node;\n}\nfunction numberLiteral(value, raw) {\n if (!(typeof value === \"number\")) {\n throw new Error('typeof value === \"number\"' + \" error: \" + (\"Argument value must be of type number, given: \" + _typeof(value) || 0));\n }\n\n if (!(typeof raw === \"string\")) {\n throw new Error('typeof raw === \"string\"' + \" error: \" + (\"Argument raw must be of type string, given: \" + _typeof(raw) || 0));\n }\n\n var node = {\n type: \"NumberLiteral\",\n value: value,\n raw: raw\n };\n return node;\n}\nfunction longNumberLiteral(value, raw) {\n if (!(typeof raw === \"string\")) {\n throw new Error('typeof raw === \"string\"' + \" error: \" + (\"Argument raw must be of type string, given: \" + _typeof(raw) || 0));\n }\n\n var node = {\n type: \"LongNumberLiteral\",\n value: value,\n raw: raw\n };\n return node;\n}\nfunction floatLiteral(value, nan, inf, raw) {\n if (!(typeof value === \"number\")) {\n throw new Error('typeof value === \"number\"' + \" error: \" + (\"Argument value must be of type number, given: \" + _typeof(value) || 0));\n }\n\n if (nan !== null && nan !== undefined) {\n if (!(typeof nan === \"boolean\")) {\n throw new Error('typeof nan === \"boolean\"' + \" error: \" + (\"Argument nan must be of type boolean, given: \" + _typeof(nan) || 0));\n }\n }\n\n if (inf !== null && inf !== undefined) {\n if (!(typeof inf === \"boolean\")) {\n throw new Error('typeof inf === \"boolean\"' + \" error: \" + (\"Argument inf must be of type boolean, given: \" + _typeof(inf) || 0));\n }\n }\n\n if (!(typeof raw === \"string\")) {\n throw new Error('typeof raw === \"string\"' + \" error: \" + (\"Argument raw must be of type string, given: \" + _typeof(raw) || 0));\n }\n\n var node = {\n type: \"FloatLiteral\",\n value: value,\n raw: raw\n };\n\n if (nan === true) {\n node.nan = true;\n }\n\n if (inf === true) {\n node.inf = true;\n }\n\n return node;\n}\nfunction elem(table, offset, funcs) {\n if (!(_typeof(offset) === \"object\" && typeof offset.length !== \"undefined\")) {\n throw new Error('typeof offset === \"object\" && typeof offset.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (!(_typeof(funcs) === \"object\" && typeof funcs.length !== \"undefined\")) {\n throw new Error('typeof funcs === \"object\" && typeof funcs.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"Elem\",\n table: table,\n offset: offset,\n funcs: funcs\n };\n return node;\n}\nfunction indexInFuncSection(index) {\n var node = {\n type: \"IndexInFuncSection\",\n index: index\n };\n return node;\n}\nfunction valtypeLiteral(name) {\n var node = {\n type: \"ValtypeLiteral\",\n name: name\n };\n return node;\n}\nfunction typeInstruction(id, functype) {\n var node = {\n type: \"TypeInstruction\",\n id: id,\n functype: functype\n };\n return node;\n}\nfunction start(index) {\n var node = {\n type: \"Start\",\n index: index\n };\n return node;\n}\nfunction globalType(valtype, mutability) {\n var node = {\n type: \"GlobalType\",\n valtype: valtype,\n mutability: mutability\n };\n return node;\n}\nfunction leadingComment(value) {\n if (!(typeof value === \"string\")) {\n throw new Error('typeof value === \"string\"' + \" error: \" + (\"Argument value must be of type string, given: \" + _typeof(value) || 0));\n }\n\n var node = {\n type: \"LeadingComment\",\n value: value\n };\n return node;\n}\nfunction blockComment(value) {\n if (!(typeof value === \"string\")) {\n throw new Error('typeof value === \"string\"' + \" error: \" + (\"Argument value must be of type string, given: \" + _typeof(value) || 0));\n }\n\n var node = {\n type: \"BlockComment\",\n value: value\n };\n return node;\n}\nfunction data(memoryIndex, offset, init) {\n var node = {\n type: \"Data\",\n memoryIndex: memoryIndex,\n offset: offset,\n init: init\n };\n return node;\n}\nfunction global(globalType, init, name) {\n if (!(_typeof(init) === \"object\" && typeof init.length !== \"undefined\")) {\n throw new Error('typeof init === \"object\" && typeof init.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"Global\",\n globalType: globalType,\n init: init,\n name: name\n };\n return node;\n}\nfunction table(elementType, limits, name, elements) {\n if (!(limits.type === \"Limit\")) {\n throw new Error('limits.type === \"Limit\"' + \" error: \" + (\"Argument limits must be of type Limit, given: \" + limits.type || 0));\n }\n\n if (elements !== null && elements !== undefined) {\n if (!(_typeof(elements) === \"object\" && typeof elements.length !== \"undefined\")) {\n throw new Error('typeof elements === \"object\" && typeof elements.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n }\n\n var node = {\n type: \"Table\",\n elementType: elementType,\n limits: limits,\n name: name\n };\n\n if (typeof elements !== \"undefined\" && elements.length > 0) {\n node.elements = elements;\n }\n\n return node;\n}\nfunction memory(limits, id) {\n var node = {\n type: \"Memory\",\n limits: limits,\n id: id\n };\n return node;\n}\nfunction funcImportDescr(id, signature) {\n var node = {\n type: \"FuncImportDescr\",\n id: id,\n signature: signature\n };\n return node;\n}\nfunction moduleImport(module, name, descr) {\n if (!(typeof module === \"string\")) {\n throw new Error('typeof module === \"string\"' + \" error: \" + (\"Argument module must be of type string, given: \" + _typeof(module) || 0));\n }\n\n if (!(typeof name === \"string\")) {\n throw new Error('typeof name === \"string\"' + \" error: \" + (\"Argument name must be of type string, given: \" + _typeof(name) || 0));\n }\n\n var node = {\n type: \"ModuleImport\",\n module: module,\n name: name,\n descr: descr\n };\n return node;\n}\nfunction moduleExportDescr(exportType, id) {\n var node = {\n type: \"ModuleExportDescr\",\n exportType: exportType,\n id: id\n };\n return node;\n}\nfunction moduleExport(name, descr) {\n if (!(typeof name === \"string\")) {\n throw new Error('typeof name === \"string\"' + \" error: \" + (\"Argument name must be of type string, given: \" + _typeof(name) || 0));\n }\n\n var node = {\n type: \"ModuleExport\",\n name: name,\n descr: descr\n };\n return node;\n}\nfunction limit(min, max, shared) {\n if (!(typeof min === \"number\")) {\n throw new Error('typeof min === \"number\"' + \" error: \" + (\"Argument min must be of type number, given: \" + _typeof(min) || 0));\n }\n\n if (max !== null && max !== undefined) {\n if (!(typeof max === \"number\")) {\n throw new Error('typeof max === \"number\"' + \" error: \" + (\"Argument max must be of type number, given: \" + _typeof(max) || 0));\n }\n }\n\n if (shared !== null && shared !== undefined) {\n if (!(typeof shared === \"boolean\")) {\n throw new Error('typeof shared === \"boolean\"' + \" error: \" + (\"Argument shared must be of type boolean, given: \" + _typeof(shared) || 0));\n }\n }\n\n var node = {\n type: \"Limit\",\n min: min\n };\n\n if (typeof max !== \"undefined\") {\n node.max = max;\n }\n\n if (shared === true) {\n node.shared = true;\n }\n\n return node;\n}\nfunction signature(params, results) {\n if (!(_typeof(params) === \"object\" && typeof params.length !== \"undefined\")) {\n throw new Error('typeof params === \"object\" && typeof params.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (!(_typeof(results) === \"object\" && typeof results.length !== \"undefined\")) {\n throw new Error('typeof results === \"object\" && typeof results.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"Signature\",\n params: params,\n results: results\n };\n return node;\n}\nfunction program(body) {\n if (!(_typeof(body) === \"object\" && typeof body.length !== \"undefined\")) {\n throw new Error('typeof body === \"object\" && typeof body.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"Program\",\n body: body\n };\n return node;\n}\nfunction identifier(value, raw) {\n if (!(typeof value === \"string\")) {\n throw new Error('typeof value === \"string\"' + \" error: \" + (\"Argument value must be of type string, given: \" + _typeof(value) || 0));\n }\n\n if (raw !== null && raw !== undefined) {\n if (!(typeof raw === \"string\")) {\n throw new Error('typeof raw === \"string\"' + \" error: \" + (\"Argument raw must be of type string, given: \" + _typeof(raw) || 0));\n }\n }\n\n var node = {\n type: \"Identifier\",\n value: value\n };\n\n if (typeof raw !== \"undefined\") {\n node.raw = raw;\n }\n\n return node;\n}\nfunction blockInstruction(label, instr, result) {\n if (!(_typeof(instr) === \"object\" && typeof instr.length !== \"undefined\")) {\n throw new Error('typeof instr === \"object\" && typeof instr.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"BlockInstruction\",\n id: \"block\",\n label: label,\n instr: instr,\n result: result\n };\n return node;\n}\nfunction callInstruction(index, instrArgs, numeric) {\n if (instrArgs !== null && instrArgs !== undefined) {\n if (!(_typeof(instrArgs) === \"object\" && typeof instrArgs.length !== \"undefined\")) {\n throw new Error('typeof instrArgs === \"object\" && typeof instrArgs.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n }\n\n var node = {\n type: \"CallInstruction\",\n id: \"call\",\n index: index\n };\n\n if (typeof instrArgs !== \"undefined\" && instrArgs.length > 0) {\n node.instrArgs = instrArgs;\n }\n\n if (typeof numeric !== \"undefined\") {\n node.numeric = numeric;\n }\n\n return node;\n}\nfunction callIndirectInstruction(signature, intrs) {\n if (intrs !== null && intrs !== undefined) {\n if (!(_typeof(intrs) === \"object\" && typeof intrs.length !== \"undefined\")) {\n throw new Error('typeof intrs === \"object\" && typeof intrs.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n }\n\n var node = {\n type: \"CallIndirectInstruction\",\n id: \"call_indirect\",\n signature: signature\n };\n\n if (typeof intrs !== \"undefined\" && intrs.length > 0) {\n node.intrs = intrs;\n }\n\n return node;\n}\nfunction byteArray(values) {\n if (!(_typeof(values) === \"object\" && typeof values.length !== \"undefined\")) {\n throw new Error('typeof values === \"object\" && typeof values.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n var node = {\n type: \"ByteArray\",\n values: values\n };\n return node;\n}\nfunction func(name, signature, body, isExternal, metadata) {\n if (!(_typeof(body) === \"object\" && typeof body.length !== \"undefined\")) {\n throw new Error('typeof body === \"object\" && typeof body.length !== \"undefined\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n if (isExternal !== null && isExternal !== undefined) {\n if (!(typeof isExternal === \"boolean\")) {\n throw new Error('typeof isExternal === \"boolean\"' + \" error: \" + (\"Argument isExternal must be of type boolean, given: \" + _typeof(isExternal) || 0));\n }\n }\n\n var node = {\n type: \"Func\",\n name: name,\n signature: signature,\n body: body\n };\n\n if (isExternal === true) {\n node.isExternal = true;\n }\n\n if (typeof metadata !== \"undefined\") {\n node.metadata = metadata;\n }\n\n return node;\n}\nfunction internalBrUnless(target) {\n if (!(typeof target === \"number\")) {\n throw new Error('typeof target === \"number\"' + \" error: \" + (\"Argument target must be of type number, given: \" + _typeof(target) || 0));\n }\n\n var node = {\n type: \"InternalBrUnless\",\n target: target\n };\n return node;\n}\nfunction internalGoto(target) {\n if (!(typeof target === \"number\")) {\n throw new Error('typeof target === \"number\"' + \" error: \" + (\"Argument target must be of type number, given: \" + _typeof(target) || 0));\n }\n\n var node = {\n type: \"InternalGoto\",\n target: target\n };\n return node;\n}\nfunction internalCallExtern(target) {\n if (!(typeof target === \"number\")) {\n throw new Error('typeof target === \"number\"' + \" error: \" + (\"Argument target must be of type number, given: \" + _typeof(target) || 0));\n }\n\n var node = {\n type: \"InternalCallExtern\",\n target: target\n };\n return node;\n}\nfunction internalEndAndReturn() {\n var node = {\n type: \"InternalEndAndReturn\"\n };\n return node;\n}\nvar isModule = isTypeOf(\"Module\");\nvar isModuleMetadata = isTypeOf(\"ModuleMetadata\");\nvar isModuleNameMetadata = isTypeOf(\"ModuleNameMetadata\");\nvar isFunctionNameMetadata = isTypeOf(\"FunctionNameMetadata\");\nvar isLocalNameMetadata = isTypeOf(\"LocalNameMetadata\");\nvar isBinaryModule = isTypeOf(\"BinaryModule\");\nvar isQuoteModule = isTypeOf(\"QuoteModule\");\nvar isSectionMetadata = isTypeOf(\"SectionMetadata\");\nvar isProducersSectionMetadata = isTypeOf(\"ProducersSectionMetadata\");\nvar isProducerMetadata = isTypeOf(\"ProducerMetadata\");\nvar isProducerMetadataVersionedName = isTypeOf(\"ProducerMetadataVersionedName\");\nvar isLoopInstruction = isTypeOf(\"LoopInstruction\");\nvar isInstr = isTypeOf(\"Instr\");\nvar isIfInstruction = isTypeOf(\"IfInstruction\");\nvar isStringLiteral = isTypeOf(\"StringLiteral\");\nvar isNumberLiteral = isTypeOf(\"NumberLiteral\");\nvar isLongNumberLiteral = isTypeOf(\"LongNumberLiteral\");\nvar isFloatLiteral = isTypeOf(\"FloatLiteral\");\nvar isElem = isTypeOf(\"Elem\");\nvar isIndexInFuncSection = isTypeOf(\"IndexInFuncSection\");\nvar isValtypeLiteral = isTypeOf(\"ValtypeLiteral\");\nvar isTypeInstruction = isTypeOf(\"TypeInstruction\");\nvar isStart = isTypeOf(\"Start\");\nvar isGlobalType = isTypeOf(\"GlobalType\");\nvar isLeadingComment = isTypeOf(\"LeadingComment\");\nvar isBlockComment = isTypeOf(\"BlockComment\");\nvar isData = isTypeOf(\"Data\");\nvar isGlobal = isTypeOf(\"Global\");\nvar isTable = isTypeOf(\"Table\");\nvar isMemory = isTypeOf(\"Memory\");\nvar isFuncImportDescr = isTypeOf(\"FuncImportDescr\");\nvar isModuleImport = isTypeOf(\"ModuleImport\");\nvar isModuleExportDescr = isTypeOf(\"ModuleExportDescr\");\nvar isModuleExport = isTypeOf(\"ModuleExport\");\nvar isLimit = isTypeOf(\"Limit\");\nvar isSignature = isTypeOf(\"Signature\");\nvar isProgram = isTypeOf(\"Program\");\nvar isIdentifier = isTypeOf(\"Identifier\");\nvar isBlockInstruction = isTypeOf(\"BlockInstruction\");\nvar isCallInstruction = isTypeOf(\"CallInstruction\");\nvar isCallIndirectInstruction = isTypeOf(\"CallIndirectInstruction\");\nvar isByteArray = isTypeOf(\"ByteArray\");\nvar isFunc = isTypeOf(\"Func\");\nvar isInternalBrUnless = isTypeOf(\"InternalBrUnless\");\nvar isInternalGoto = isTypeOf(\"InternalGoto\");\nvar isInternalCallExtern = isTypeOf(\"InternalCallExtern\");\nvar isInternalEndAndReturn = isTypeOf(\"InternalEndAndReturn\");\nvar isNode = function isNode(node) {\n return isModule(node) || isModuleMetadata(node) || isModuleNameMetadata(node) || isFunctionNameMetadata(node) || isLocalNameMetadata(node) || isBinaryModule(node) || isQuoteModule(node) || isSectionMetadata(node) || isProducersSectionMetadata(node) || isProducerMetadata(node) || isProducerMetadataVersionedName(node) || isLoopInstruction(node) || isInstr(node) || isIfInstruction(node) || isStringLiteral(node) || isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node) || isElem(node) || isIndexInFuncSection(node) || isValtypeLiteral(node) || isTypeInstruction(node) || isStart(node) || isGlobalType(node) || isLeadingComment(node) || isBlockComment(node) || isData(node) || isGlobal(node) || isTable(node) || isMemory(node) || isFuncImportDescr(node) || isModuleImport(node) || isModuleExportDescr(node) || isModuleExport(node) || isLimit(node) || isSignature(node) || isProgram(node) || isIdentifier(node) || isBlockInstruction(node) || isCallInstruction(node) || isCallIndirectInstruction(node) || isByteArray(node) || isFunc(node) || isInternalBrUnless(node) || isInternalGoto(node) || isInternalCallExtern(node) || isInternalEndAndReturn(node);\n};\nvar isBlock = function isBlock(node) {\n return isLoopInstruction(node) || isBlockInstruction(node) || isFunc(node);\n};\nvar isInstruction = function isInstruction(node) {\n return isLoopInstruction(node) || isInstr(node) || isIfInstruction(node) || isTypeInstruction(node) || isBlockInstruction(node) || isCallInstruction(node) || isCallIndirectInstruction(node);\n};\nvar isExpression = function isExpression(node) {\n return isInstr(node) || isStringLiteral(node) || isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node) || isValtypeLiteral(node) || isIdentifier(node);\n};\nvar isNumericLiteral = function isNumericLiteral(node) {\n return isNumberLiteral(node) || isLongNumberLiteral(node) || isFloatLiteral(node);\n};\nvar isImportDescr = function isImportDescr(node) {\n return isGlobalType(node) || isTable(node) || isMemory(node) || isFuncImportDescr(node);\n};\nvar isIntrinsic = function isIntrinsic(node) {\n return isInternalBrUnless(node) || isInternalGoto(node) || isInternalCallExtern(node) || isInternalEndAndReturn(node);\n};\nvar assertModule = assertTypeOf(\"Module\");\nvar assertModuleMetadata = assertTypeOf(\"ModuleMetadata\");\nvar assertModuleNameMetadata = assertTypeOf(\"ModuleNameMetadata\");\nvar assertFunctionNameMetadata = assertTypeOf(\"FunctionNameMetadata\");\nvar assertLocalNameMetadata = assertTypeOf(\"LocalNameMetadata\");\nvar assertBinaryModule = assertTypeOf(\"BinaryModule\");\nvar assertQuoteModule = assertTypeOf(\"QuoteModule\");\nvar assertSectionMetadata = assertTypeOf(\"SectionMetadata\");\nvar assertProducersSectionMetadata = assertTypeOf(\"ProducersSectionMetadata\");\nvar assertProducerMetadata = assertTypeOf(\"ProducerMetadata\");\nvar assertProducerMetadataVersionedName = assertTypeOf(\"ProducerMetadataVersionedName\");\nvar assertLoopInstruction = assertTypeOf(\"LoopInstruction\");\nvar assertInstr = assertTypeOf(\"Instr\");\nvar assertIfInstruction = assertTypeOf(\"IfInstruction\");\nvar assertStringLiteral = assertTypeOf(\"StringLiteral\");\nvar assertNumberLiteral = assertTypeOf(\"NumberLiteral\");\nvar assertLongNumberLiteral = assertTypeOf(\"LongNumberLiteral\");\nvar assertFloatLiteral = assertTypeOf(\"FloatLiteral\");\nvar assertElem = assertTypeOf(\"Elem\");\nvar assertIndexInFuncSection = assertTypeOf(\"IndexInFuncSection\");\nvar assertValtypeLiteral = assertTypeOf(\"ValtypeLiteral\");\nvar assertTypeInstruction = assertTypeOf(\"TypeInstruction\");\nvar assertStart = assertTypeOf(\"Start\");\nvar assertGlobalType = assertTypeOf(\"GlobalType\");\nvar assertLeadingComment = assertTypeOf(\"LeadingComment\");\nvar assertBlockComment = assertTypeOf(\"BlockComment\");\nvar assertData = assertTypeOf(\"Data\");\nvar assertGlobal = assertTypeOf(\"Global\");\nvar assertTable = assertTypeOf(\"Table\");\nvar assertMemory = assertTypeOf(\"Memory\");\nvar assertFuncImportDescr = assertTypeOf(\"FuncImportDescr\");\nvar assertModuleImport = assertTypeOf(\"ModuleImport\");\nvar assertModuleExportDescr = assertTypeOf(\"ModuleExportDescr\");\nvar assertModuleExport = assertTypeOf(\"ModuleExport\");\nvar assertLimit = assertTypeOf(\"Limit\");\nvar assertSignature = assertTypeOf(\"Signature\");\nvar assertProgram = assertTypeOf(\"Program\");\nvar assertIdentifier = assertTypeOf(\"Identifier\");\nvar assertBlockInstruction = assertTypeOf(\"BlockInstruction\");\nvar assertCallInstruction = assertTypeOf(\"CallInstruction\");\nvar assertCallIndirectInstruction = assertTypeOf(\"CallIndirectInstruction\");\nvar assertByteArray = assertTypeOf(\"ByteArray\");\nvar assertFunc = assertTypeOf(\"Func\");\nvar assertInternalBrUnless = assertTypeOf(\"InternalBrUnless\");\nvar assertInternalGoto = assertTypeOf(\"InternalGoto\");\nvar assertInternalCallExtern = assertTypeOf(\"InternalCallExtern\");\nvar assertInternalEndAndReturn = assertTypeOf(\"InternalEndAndReturn\");\nvar unionTypesMap = {\n Module: [\"Node\"],\n ModuleMetadata: [\"Node\"],\n ModuleNameMetadata: [\"Node\"],\n FunctionNameMetadata: [\"Node\"],\n LocalNameMetadata: [\"Node\"],\n BinaryModule: [\"Node\"],\n QuoteModule: [\"Node\"],\n SectionMetadata: [\"Node\"],\n ProducersSectionMetadata: [\"Node\"],\n ProducerMetadata: [\"Node\"],\n ProducerMetadataVersionedName: [\"Node\"],\n LoopInstruction: [\"Node\", \"Block\", \"Instruction\"],\n Instr: [\"Node\", \"Expression\", \"Instruction\"],\n IfInstruction: [\"Node\", \"Instruction\"],\n StringLiteral: [\"Node\", \"Expression\"],\n NumberLiteral: [\"Node\", \"NumericLiteral\", \"Expression\"],\n LongNumberLiteral: [\"Node\", \"NumericLiteral\", \"Expression\"],\n FloatLiteral: [\"Node\", \"NumericLiteral\", \"Expression\"],\n Elem: [\"Node\"],\n IndexInFuncSection: [\"Node\"],\n ValtypeLiteral: [\"Node\", \"Expression\"],\n TypeInstruction: [\"Node\", \"Instruction\"],\n Start: [\"Node\"],\n GlobalType: [\"Node\", \"ImportDescr\"],\n LeadingComment: [\"Node\"],\n BlockComment: [\"Node\"],\n Data: [\"Node\"],\n Global: [\"Node\"],\n Table: [\"Node\", \"ImportDescr\"],\n Memory: [\"Node\", \"ImportDescr\"],\n FuncImportDescr: [\"Node\", \"ImportDescr\"],\n ModuleImport: [\"Node\"],\n ModuleExportDescr: [\"Node\"],\n ModuleExport: [\"Node\"],\n Limit: [\"Node\"],\n Signature: [\"Node\"],\n Program: [\"Node\"],\n Identifier: [\"Node\", \"Expression\"],\n BlockInstruction: [\"Node\", \"Block\", \"Instruction\"],\n CallInstruction: [\"Node\", \"Instruction\"],\n CallIndirectInstruction: [\"Node\", \"Instruction\"],\n ByteArray: [\"Node\"],\n Func: [\"Node\", \"Block\"],\n InternalBrUnless: [\"Node\", \"Intrinsic\"],\n InternalGoto: [\"Node\", \"Intrinsic\"],\n InternalCallExtern: [\"Node\", \"Intrinsic\"],\n InternalEndAndReturn: [\"Node\", \"Intrinsic\"]\n};\nvar nodeAndUnionTypes = [\"Module\", \"ModuleMetadata\", \"ModuleNameMetadata\", \"FunctionNameMetadata\", \"LocalNameMetadata\", \"BinaryModule\", \"QuoteModule\", \"SectionMetadata\", \"ProducersSectionMetadata\", \"ProducerMetadata\", \"ProducerMetadataVersionedName\", \"LoopInstruction\", \"Instr\", \"IfInstruction\", \"StringLiteral\", \"NumberLiteral\", \"LongNumberLiteral\", \"FloatLiteral\", \"Elem\", \"IndexInFuncSection\", \"ValtypeLiteral\", \"TypeInstruction\", \"Start\", \"GlobalType\", \"LeadingComment\", \"BlockComment\", \"Data\", \"Global\", \"Table\", \"Memory\", \"FuncImportDescr\", \"ModuleImport\", \"ModuleExportDescr\", \"ModuleExport\", \"Limit\", \"Signature\", \"Program\", \"Identifier\", \"BlockInstruction\", \"CallInstruction\", \"CallIndirectInstruction\", \"ByteArray\", \"Func\", \"InternalBrUnless\", \"InternalGoto\", \"InternalCallExtern\", \"InternalEndAndReturn\", \"Node\", \"Block\", \"Instruction\", \"Expression\", \"NumericLiteral\", \"ImportDescr\", \"Intrinsic\"];\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/nodes.js?");
299+
300+/***/ }),
301+
302+/***/ "../node_modules/@webassemblyjs/ast/esm/signatures.js":
303+/*!************************************************************!*\
304+ !*** ../node_modules/@webassemblyjs/ast/esm/signatures.js ***!
305+ \************************************************************/
306+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
307+
308+"use strict";
309+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"signatures\": () => (/* binding */ signatures)\n/* harmony export */ });\nfunction sign(input, output) {\n return [input, output];\n}\n\nvar u32 = \"u32\";\nvar i32 = \"i32\";\nvar i64 = \"i64\";\nvar f32 = \"f32\";\nvar f64 = \"f64\";\n\nvar vector = function vector(t) {\n var vecType = [t]; // $FlowIgnore\n\n vecType.vector = true;\n return vecType;\n};\n\nvar controlInstructions = {\n unreachable: sign([], []),\n nop: sign([], []),\n // block ?\n // loop ?\n // if ?\n // if else ?\n br: sign([u32], []),\n br_if: sign([u32], []),\n br_table: sign(vector(u32), []),\n return: sign([], []),\n call: sign([u32], []),\n call_indirect: sign([u32], [])\n};\nvar parametricInstructions = {\n drop: sign([], []),\n select: sign([], [])\n};\nvar variableInstructions = {\n get_local: sign([u32], []),\n set_local: sign([u32], []),\n tee_local: sign([u32], []),\n get_global: sign([u32], []),\n set_global: sign([u32], [])\n};\nvar memoryInstructions = {\n \"i32.load\": sign([u32, u32], [i32]),\n \"i64.load\": sign([u32, u32], []),\n \"f32.load\": sign([u32, u32], []),\n \"f64.load\": sign([u32, u32], []),\n \"i32.load8_s\": sign([u32, u32], [i32]),\n \"i32.load8_u\": sign([u32, u32], [i32]),\n \"i32.load16_s\": sign([u32, u32], [i32]),\n \"i32.load16_u\": sign([u32, u32], [i32]),\n \"i64.load8_s\": sign([u32, u32], [i64]),\n \"i64.load8_u\": sign([u32, u32], [i64]),\n \"i64.load16_s\": sign([u32, u32], [i64]),\n \"i64.load16_u\": sign([u32, u32], [i64]),\n \"i64.load32_s\": sign([u32, u32], [i64]),\n \"i64.load32_u\": sign([u32, u32], [i64]),\n \"i32.store\": sign([u32, u32], []),\n \"i64.store\": sign([u32, u32], []),\n \"f32.store\": sign([u32, u32], []),\n \"f64.store\": sign([u32, u32], []),\n \"i32.store8\": sign([u32, u32], []),\n \"i32.store16\": sign([u32, u32], []),\n \"i64.store8\": sign([u32, u32], []),\n \"i64.store16\": sign([u32, u32], []),\n \"i64.store32\": sign([u32, u32], []),\n current_memory: sign([], []),\n grow_memory: sign([], [])\n};\nvar numericInstructions = {\n \"i32.const\": sign([i32], [i32]),\n \"i64.const\": sign([i64], [i64]),\n \"f32.const\": sign([f32], [f32]),\n \"f64.const\": sign([f64], [f64]),\n \"i32.eqz\": sign([i32], [i32]),\n \"i32.eq\": sign([i32, i32], [i32]),\n \"i32.ne\": sign([i32, i32], [i32]),\n \"i32.lt_s\": sign([i32, i32], [i32]),\n \"i32.lt_u\": sign([i32, i32], [i32]),\n \"i32.gt_s\": sign([i32, i32], [i32]),\n \"i32.gt_u\": sign([i32, i32], [i32]),\n \"i32.le_s\": sign([i32, i32], [i32]),\n \"i32.le_u\": sign([i32, i32], [i32]),\n \"i32.ge_s\": sign([i32, i32], [i32]),\n \"i32.ge_u\": sign([i32, i32], [i32]),\n \"i64.eqz\": sign([i64], [i64]),\n \"i64.eq\": sign([i64, i64], [i32]),\n \"i64.ne\": sign([i64, i64], [i32]),\n \"i64.lt_s\": sign([i64, i64], [i32]),\n \"i64.lt_u\": sign([i64, i64], [i32]),\n \"i64.gt_s\": sign([i64, i64], [i32]),\n \"i64.gt_u\": sign([i64, i64], [i32]),\n \"i64.le_s\": sign([i64, i64], [i32]),\n \"i64.le_u\": sign([i64, i64], [i32]),\n \"i64.ge_s\": sign([i64, i64], [i32]),\n \"i64.ge_u\": sign([i64, i64], [i32]),\n \"f32.eq\": sign([f32, f32], [i32]),\n \"f32.ne\": sign([f32, f32], [i32]),\n \"f32.lt\": sign([f32, f32], [i32]),\n \"f32.gt\": sign([f32, f32], [i32]),\n \"f32.le\": sign([f32, f32], [i32]),\n \"f32.ge\": sign([f32, f32], [i32]),\n \"f64.eq\": sign([f64, f64], [i32]),\n \"f64.ne\": sign([f64, f64], [i32]),\n \"f64.lt\": sign([f64, f64], [i32]),\n \"f64.gt\": sign([f64, f64], [i32]),\n \"f64.le\": sign([f64, f64], [i32]),\n \"f64.ge\": sign([f64, f64], [i32]),\n \"i32.clz\": sign([i32], [i32]),\n \"i32.ctz\": sign([i32], [i32]),\n \"i32.popcnt\": sign([i32], [i32]),\n \"i32.add\": sign([i32, i32], [i32]),\n \"i32.sub\": sign([i32, i32], [i32]),\n \"i32.mul\": sign([i32, i32], [i32]),\n \"i32.div_s\": sign([i32, i32], [i32]),\n \"i32.div_u\": sign([i32, i32], [i32]),\n \"i32.rem_s\": sign([i32, i32], [i32]),\n \"i32.rem_u\": sign([i32, i32], [i32]),\n \"i32.and\": sign([i32, i32], [i32]),\n \"i32.or\": sign([i32, i32], [i32]),\n \"i32.xor\": sign([i32, i32], [i32]),\n \"i32.shl\": sign([i32, i32], [i32]),\n \"i32.shr_s\": sign([i32, i32], [i32]),\n \"i32.shr_u\": sign([i32, i32], [i32]),\n \"i32.rotl\": sign([i32, i32], [i32]),\n \"i32.rotr\": sign([i32, i32], [i32]),\n \"i64.clz\": sign([i64], [i64]),\n \"i64.ctz\": sign([i64], [i64]),\n \"i64.popcnt\": sign([i64], [i64]),\n \"i64.add\": sign([i64, i64], [i64]),\n \"i64.sub\": sign([i64, i64], [i64]),\n \"i64.mul\": sign([i64, i64], [i64]),\n \"i64.div_s\": sign([i64, i64], [i64]),\n \"i64.div_u\": sign([i64, i64], [i64]),\n \"i64.rem_s\": sign([i64, i64], [i64]),\n \"i64.rem_u\": sign([i64, i64], [i64]),\n \"i64.and\": sign([i64, i64], [i64]),\n \"i64.or\": sign([i64, i64], [i64]),\n \"i64.xor\": sign([i64, i64], [i64]),\n \"i64.shl\": sign([i64, i64], [i64]),\n \"i64.shr_s\": sign([i64, i64], [i64]),\n \"i64.shr_u\": sign([i64, i64], [i64]),\n \"i64.rotl\": sign([i64, i64], [i64]),\n \"i64.rotr\": sign([i64, i64], [i64]),\n \"f32.abs\": sign([f32], [f32]),\n \"f32.neg\": sign([f32], [f32]),\n \"f32.ceil\": sign([f32], [f32]),\n \"f32.floor\": sign([f32], [f32]),\n \"f32.trunc\": sign([f32], [f32]),\n \"f32.nearest\": sign([f32], [f32]),\n \"f32.sqrt\": sign([f32], [f32]),\n \"f32.add\": sign([f32, f32], [f32]),\n \"f32.sub\": sign([f32, f32], [f32]),\n \"f32.mul\": sign([f32, f32], [f32]),\n \"f32.div\": sign([f32, f32], [f32]),\n \"f32.min\": sign([f32, f32], [f32]),\n \"f32.max\": sign([f32, f32], [f32]),\n \"f32.copysign\": sign([f32, f32], [f32]),\n \"f64.abs\": sign([f64], [f64]),\n \"f64.neg\": sign([f64], [f64]),\n \"f64.ceil\": sign([f64], [f64]),\n \"f64.floor\": sign([f64], [f64]),\n \"f64.trunc\": sign([f64], [f64]),\n \"f64.nearest\": sign([f64], [f64]),\n \"f64.sqrt\": sign([f64], [f64]),\n \"f64.add\": sign([f64, f64], [f64]),\n \"f64.sub\": sign([f64, f64], [f64]),\n \"f64.mul\": sign([f64, f64], [f64]),\n \"f64.div\": sign([f64, f64], [f64]),\n \"f64.min\": sign([f64, f64], [f64]),\n \"f64.max\": sign([f64, f64], [f64]),\n \"f64.copysign\": sign([f64, f64], [f64]),\n \"i32.wrap/i64\": sign([i64], [i32]),\n \"i32.trunc_s/f32\": sign([f32], [i32]),\n \"i32.trunc_u/f32\": sign([f32], [i32]),\n \"i32.trunc_s/f64\": sign([f32], [i32]),\n \"i32.trunc_u/f64\": sign([f64], [i32]),\n \"i64.extend_s/i32\": sign([i32], [i64]),\n \"i64.extend_u/i32\": sign([i32], [i64]),\n \"i64.trunc_s/f32\": sign([f32], [i64]),\n \"i64.trunc_u/f32\": sign([f32], [i64]),\n \"i64.trunc_s/f64\": sign([f64], [i64]),\n \"i64.trunc_u/f64\": sign([f64], [i64]),\n \"f32.convert_s/i32\": sign([i32], [f32]),\n \"f32.convert_u/i32\": sign([i32], [f32]),\n \"f32.convert_s/i64\": sign([i64], [f32]),\n \"f32.convert_u/i64\": sign([i64], [f32]),\n \"f32.demote/f64\": sign([f64], [f32]),\n \"f64.convert_s/i32\": sign([i32], [f64]),\n \"f64.convert_u/i32\": sign([i32], [f64]),\n \"f64.convert_s/i64\": sign([i64], [f64]),\n \"f64.convert_u/i64\": sign([i64], [f64]),\n \"f64.promote/f32\": sign([f32], [f64]),\n \"i32.reinterpret/f32\": sign([f32], [i32]),\n \"i64.reinterpret/f64\": sign([f64], [i64]),\n \"f32.reinterpret/i32\": sign([i32], [f32]),\n \"f64.reinterpret/i64\": sign([i64], [f64])\n};\nvar signatures = Object.assign({}, controlInstructions, parametricInstructions, variableInstructions, memoryInstructions, numericInstructions);\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/signatures.js?");
310+
311+/***/ }),
312+
313+/***/ "../node_modules/@webassemblyjs/ast/esm/transform/ast-module-to-module-context/index.js":
314+/*!**********************************************************************************************!*\
315+ !*** ../node_modules/@webassemblyjs/ast/esm/transform/ast-module-to-module-context/index.js ***!
316+ \**********************************************************************************************/
317+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
318+
319+"use strict";
320+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"ModuleContext\": () => (/* binding */ ModuleContext),\n/* harmony export */ \"moduleContextFromModuleAST\": () => (/* binding */ moduleContextFromModuleAST)\n/* harmony export */ });\n/* harmony import */ var _nodes_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../nodes.js */ \"../node_modules/@webassemblyjs/ast/esm/nodes.js\");\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\n// TODO(sven): add flow in here\n\nfunction moduleContextFromModuleAST(m) {\n var moduleContext = new ModuleContext();\n\n if (!(m.type === \"Module\")) {\n throw new Error('m.type === \"Module\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n m.fields.forEach(function (field) {\n switch (field.type) {\n case \"Start\":\n {\n moduleContext.setStart(field.index);\n break;\n }\n\n case \"TypeInstruction\":\n {\n moduleContext.addType(field);\n break;\n }\n\n case \"Func\":\n {\n moduleContext.addFunction(field);\n break;\n }\n\n case \"Global\":\n {\n moduleContext.defineGlobal(field);\n break;\n }\n\n case \"ModuleImport\":\n {\n switch (field.descr.type) {\n case \"GlobalType\":\n {\n moduleContext.importGlobal(field.descr.valtype, field.descr.mutability);\n break;\n }\n\n case \"Memory\":\n {\n moduleContext.addMemory(field.descr.limits.min, field.descr.limits.max);\n break;\n }\n\n case \"FuncImportDescr\":\n {\n moduleContext.importFunction(field.descr);\n break;\n }\n\n case \"Table\":\n {\n // FIXME(sven): not implemented yet\n break;\n }\n\n default:\n throw new Error(\"Unsupported ModuleImport of type \" + JSON.stringify(field.descr.type));\n }\n\n break;\n }\n\n case \"Memory\":\n {\n moduleContext.addMemory(field.limits.min, field.limits.max);\n break;\n }\n }\n });\n return moduleContext;\n}\n/**\n * Module context for type checking\n */\n\nvar ModuleContext =\n/*#__PURE__*/\nfunction () {\n function ModuleContext() {\n _classCallCheck(this, ModuleContext);\n\n this.funcs = [];\n this.funcsOffsetByIdentifier = [];\n this.types = [];\n this.globals = [];\n this.globalsOffsetByIdentifier = [];\n this.mems = []; // Current stack frame\n\n this.locals = [];\n this.labels = [];\n this.return = [];\n this.debugName = \"unknown\";\n this.start = null;\n }\n /**\n * Set start segment\n */\n\n\n _createClass(ModuleContext, [{\n key: \"setStart\",\n value: function setStart(index) {\n this.start = index.value;\n }\n /**\n * Get start function\n */\n\n }, {\n key: \"getStart\",\n value: function getStart() {\n return this.start;\n }\n /**\n * Reset the active stack frame\n */\n\n }, {\n key: \"newContext\",\n value: function newContext(debugName, expectedResult) {\n this.locals = [];\n this.labels = [expectedResult];\n this.return = expectedResult;\n this.debugName = debugName;\n }\n /**\n * Functions\n */\n\n }, {\n key: \"addFunction\",\n value: function addFunction(func\n /*: Func*/\n ) {\n // eslint-disable-next-line prefer-const\n var _ref = func.signature || {},\n _ref$params = _ref.params,\n args = _ref$params === void 0 ? [] : _ref$params,\n _ref$results = _ref.results,\n result = _ref$results === void 0 ? [] : _ref$results;\n\n args = args.map(function (arg) {\n return arg.valtype;\n });\n this.funcs.push({\n args: args,\n result: result\n });\n\n if (typeof func.name !== \"undefined\") {\n this.funcsOffsetByIdentifier[func.name.value] = this.funcs.length - 1;\n }\n }\n }, {\n key: \"importFunction\",\n value: function importFunction(funcimport) {\n if ((0,_nodes_js__WEBPACK_IMPORTED_MODULE_0__.isSignature)(funcimport.signature)) {\n // eslint-disable-next-line prefer-const\n var _funcimport$signature = funcimport.signature,\n args = _funcimport$signature.params,\n result = _funcimport$signature.results;\n args = args.map(function (arg) {\n return arg.valtype;\n });\n this.funcs.push({\n args: args,\n result: result\n });\n } else {\n if (!(0,_nodes_js__WEBPACK_IMPORTED_MODULE_0__.isNumberLiteral)(funcimport.signature)) {\n throw new Error('isNumberLiteral(funcimport.signature)' + \" error: \" + ( false || \"unknown\"));\n }\n\n var typeId = funcimport.signature.value;\n\n if (!this.hasType(typeId)) {\n throw new Error('this.hasType(typeId)' + \" error: \" + ( false || \"unknown\"));\n }\n\n var signature = this.getType(typeId);\n this.funcs.push({\n args: signature.params.map(function (arg) {\n return arg.valtype;\n }),\n result: signature.results\n });\n }\n\n if (typeof funcimport.id !== \"undefined\") {\n // imports are first, we can assume their index in the array\n this.funcsOffsetByIdentifier[funcimport.id.value] = this.funcs.length - 1;\n }\n }\n }, {\n key: \"hasFunction\",\n value: function hasFunction(index) {\n return typeof this.getFunction(index) !== \"undefined\";\n }\n }, {\n key: \"getFunction\",\n value: function getFunction(index) {\n if (typeof index !== \"number\") {\n throw new Error(\"getFunction only supported for number index\");\n }\n\n return this.funcs[index];\n }\n }, {\n key: \"getFunctionOffsetByIdentifier\",\n value: function getFunctionOffsetByIdentifier(name) {\n if (!(typeof name === \"string\")) {\n throw new Error('typeof name === \"string\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n return this.funcsOffsetByIdentifier[name];\n }\n /**\n * Labels\n */\n\n }, {\n key: \"addLabel\",\n value: function addLabel(result) {\n this.labels.unshift(result);\n }\n }, {\n key: \"hasLabel\",\n value: function hasLabel(index) {\n return this.labels.length > index && index >= 0;\n }\n }, {\n key: \"getLabel\",\n value: function getLabel(index) {\n return this.labels[index];\n }\n }, {\n key: \"popLabel\",\n value: function popLabel() {\n this.labels.shift();\n }\n /**\n * Locals\n */\n\n }, {\n key: \"hasLocal\",\n value: function hasLocal(index) {\n return typeof this.getLocal(index) !== \"undefined\";\n }\n }, {\n key: \"getLocal\",\n value: function getLocal(index) {\n return this.locals[index];\n }\n }, {\n key: \"addLocal\",\n value: function addLocal(type) {\n this.locals.push(type);\n }\n /**\n * Types\n */\n\n }, {\n key: \"addType\",\n value: function addType(type) {\n if (!(type.functype.type === \"Signature\")) {\n throw new Error('type.functype.type === \"Signature\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n this.types.push(type.functype);\n }\n }, {\n key: \"hasType\",\n value: function hasType(index) {\n return this.types[index] !== undefined;\n }\n }, {\n key: \"getType\",\n value: function getType(index) {\n return this.types[index];\n }\n /**\n * Globals\n */\n\n }, {\n key: \"hasGlobal\",\n value: function hasGlobal(index) {\n return this.globals.length > index && index >= 0;\n }\n }, {\n key: \"getGlobal\",\n value: function getGlobal(index) {\n return this.globals[index].type;\n }\n }, {\n key: \"getGlobalOffsetByIdentifier\",\n value: function getGlobalOffsetByIdentifier(name) {\n if (!(typeof name === \"string\")) {\n throw new Error('typeof name === \"string\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n return this.globalsOffsetByIdentifier[name];\n }\n }, {\n key: \"defineGlobal\",\n value: function defineGlobal(global\n /*: Global*/\n ) {\n var type = global.globalType.valtype;\n var mutability = global.globalType.mutability;\n this.globals.push({\n type: type,\n mutability: mutability\n });\n\n if (typeof global.name !== \"undefined\") {\n this.globalsOffsetByIdentifier[global.name.value] = this.globals.length - 1;\n }\n }\n }, {\n key: \"importGlobal\",\n value: function importGlobal(type, mutability) {\n this.globals.push({\n type: type,\n mutability: mutability\n });\n }\n }, {\n key: \"isMutableGlobal\",\n value: function isMutableGlobal(index) {\n return this.globals[index].mutability === \"var\";\n }\n }, {\n key: \"isImmutableGlobal\",\n value: function isImmutableGlobal(index) {\n return this.globals[index].mutability === \"const\";\n }\n /**\n * Memories\n */\n\n }, {\n key: \"hasMemory\",\n value: function hasMemory(index) {\n return this.mems.length > index && index >= 0;\n }\n }, {\n key: \"addMemory\",\n value: function addMemory(min, max) {\n this.mems.push({\n min: min,\n max: max\n });\n }\n }, {\n key: \"getMemory\",\n value: function getMemory(index) {\n return this.mems[index];\n }\n }]);\n\n return ModuleContext;\n}();\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/transform/ast-module-to-module-context/index.js?");
321+
322+/***/ }),
323+
324+/***/ "../node_modules/@webassemblyjs/ast/esm/traverse.js":
325+/*!**********************************************************!*\
326+ !*** ../node_modules/@webassemblyjs/ast/esm/traverse.js ***!
327+ \**********************************************************/
328+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
329+
330+"use strict";
331+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"traverse\": () => (/* binding */ traverse)\n/* harmony export */ });\n/* harmony import */ var _node_path__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./node-path */ \"../node_modules/@webassemblyjs/ast/esm/node-path.js\");\n/* harmony import */ var _nodes__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./nodes */ \"../node_modules/@webassemblyjs/ast/esm/nodes.js\");\n\n // recursively walks the AST starting at the given node. The callback is invoked for\n// and object that has a 'type' property.\n\nfunction walk(context, callback) {\n var stop = false;\n\n function innerWalk(context, callback) {\n if (stop) {\n return;\n }\n\n var node = context.node;\n\n if (node === undefined) {\n console.warn(\"traversing with an empty context\");\n return;\n }\n\n if (node._deleted === true) {\n return;\n }\n\n var path = (0,_node_path__WEBPACK_IMPORTED_MODULE_0__.createPath)(context);\n callback(node.type, path);\n\n if (path.shouldStop) {\n stop = true;\n return;\n }\n\n Object.keys(node).forEach(function (prop) {\n var value = node[prop];\n\n if (value === null || value === undefined) {\n return;\n }\n\n var valueAsArray = Array.isArray(value) ? value : [value];\n valueAsArray.forEach(function (childNode) {\n if (typeof childNode.type === \"string\") {\n var childContext = {\n node: childNode,\n parentKey: prop,\n parentPath: path,\n shouldStop: false,\n inList: Array.isArray(value)\n };\n innerWalk(childContext, callback);\n }\n });\n });\n }\n\n innerWalk(context, callback);\n}\n\nvar noop = function noop() {};\n\nfunction traverse(node, visitors) {\n var before = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : noop;\n var after = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : noop;\n Object.keys(visitors).forEach(function (visitor) {\n if (!_nodes__WEBPACK_IMPORTED_MODULE_1__.nodeAndUnionTypes.includes(visitor)) {\n throw new Error(\"Unexpected visitor \".concat(visitor));\n }\n });\n var context = {\n node: node,\n inList: false,\n shouldStop: false,\n parentPath: null,\n parentKey: null\n };\n walk(context, function (type, path) {\n if (typeof visitors[type] === \"function\") {\n before(type, path);\n visitors[type](path);\n after(type, path);\n }\n\n var unionTypes = _nodes__WEBPACK_IMPORTED_MODULE_1__.unionTypesMap[type];\n\n if (!unionTypes) {\n throw new Error(\"Unexpected node type \".concat(type));\n }\n\n unionTypes.forEach(function (unionType) {\n if (typeof visitors[unionType] === \"function\") {\n before(unionType, path);\n visitors[unionType](path);\n after(unionType, path);\n }\n });\n });\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/traverse.js?");
332+
333+/***/ }),
334+
335+/***/ "../node_modules/@webassemblyjs/ast/esm/utils.js":
336+/*!*******************************************************!*\
337+ !*** ../node_modules/@webassemblyjs/ast/esm/utils.js ***!
338+ \*******************************************************/
339+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
340+
341+"use strict";
342+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"assertHasLoc\": () => (/* binding */ assertHasLoc),\n/* harmony export */ \"getEndBlockByteOffset\": () => (/* binding */ getEndBlockByteOffset),\n/* harmony export */ \"getEndByteOffset\": () => (/* binding */ getEndByteOffset),\n/* harmony export */ \"getEndOfSection\": () => (/* binding */ getEndOfSection),\n/* harmony export */ \"getFunctionBeginingByteOffset\": () => (/* binding */ getFunctionBeginingByteOffset),\n/* harmony export */ \"getSectionMetadata\": () => (/* binding */ getSectionMetadata),\n/* harmony export */ \"getSectionMetadatas\": () => (/* binding */ getSectionMetadatas),\n/* harmony export */ \"getStartBlockByteOffset\": () => (/* binding */ getStartBlockByteOffset),\n/* harmony export */ \"getStartByteOffset\": () => (/* binding */ getStartByteOffset),\n/* harmony export */ \"getUniqueNameGenerator\": () => (/* binding */ getUniqueNameGenerator),\n/* harmony export */ \"isAnonymous\": () => (/* binding */ isAnonymous),\n/* harmony export */ \"orderedInsertNode\": () => (/* binding */ orderedInsertNode),\n/* harmony export */ \"shiftLoc\": () => (/* binding */ shiftLoc),\n/* harmony export */ \"shiftSection\": () => (/* binding */ shiftSection),\n/* harmony export */ \"signatureForOpcode\": () => (/* binding */ signatureForOpcode),\n/* harmony export */ \"sortSectionMetadata\": () => (/* binding */ sortSectionMetadata)\n/* harmony export */ });\n/* harmony import */ var _signatures__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./signatures */ \"../node_modules/@webassemblyjs/ast/esm/signatures.js\");\n/* harmony import */ var _traverse__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./traverse */ \"../node_modules/@webassemblyjs/ast/esm/traverse.js\");\n/* harmony import */ var _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/helper-wasm-bytecode */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js\");\nfunction _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); } }\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n\n\n\n\nfunction isAnonymous(ident) {\n return ident.raw === \"\";\n}\nfunction getSectionMetadata(ast, name) {\n var section;\n (0,_traverse__WEBPACK_IMPORTED_MODULE_1__.traverse)(ast, {\n SectionMetadata: function (_SectionMetadata) {\n function SectionMetadata(_x) {\n return _SectionMetadata.apply(this, arguments);\n }\n\n SectionMetadata.toString = function () {\n return _SectionMetadata.toString();\n };\n\n return SectionMetadata;\n }(function (_ref) {\n var node = _ref.node;\n\n if (node.section === name) {\n section = node;\n }\n })\n });\n return section;\n}\nfunction getSectionMetadatas(ast, name) {\n var sections = [];\n (0,_traverse__WEBPACK_IMPORTED_MODULE_1__.traverse)(ast, {\n SectionMetadata: function (_SectionMetadata2) {\n function SectionMetadata(_x2) {\n return _SectionMetadata2.apply(this, arguments);\n }\n\n SectionMetadata.toString = function () {\n return _SectionMetadata2.toString();\n };\n\n return SectionMetadata;\n }(function (_ref2) {\n var node = _ref2.node;\n\n if (node.section === name) {\n sections.push(node);\n }\n })\n });\n return sections;\n}\nfunction sortSectionMetadata(m) {\n if (m.metadata == null) {\n console.warn(\"sortSectionMetadata: no metadata to sort\");\n return;\n } // $FlowIgnore\n\n\n m.metadata.sections.sort(function (a, b) {\n var aId = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_2__[\"default\"].sections[a.section];\n var bId = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_2__[\"default\"].sections[b.section];\n\n if (typeof aId !== \"number\" || typeof bId !== \"number\") {\n throw new Error(\"Section id not found\");\n }\n\n return aId - bId;\n });\n}\nfunction orderedInsertNode(m, n) {\n assertHasLoc(n);\n var didInsert = false;\n\n if (n.type === \"ModuleExport\") {\n m.fields.push(n);\n return;\n }\n\n m.fields = m.fields.reduce(function (acc, field) {\n var fieldEndCol = Infinity;\n\n if (field.loc != null) {\n // $FlowIgnore\n fieldEndCol = field.loc.end.column;\n } // $FlowIgnore: assertHasLoc ensures that\n\n\n if (didInsert === false && n.loc.start.column < fieldEndCol) {\n didInsert = true;\n acc.push(n);\n }\n\n acc.push(field);\n return acc;\n }, []); // Handles empty modules or n is the last element\n\n if (didInsert === false) {\n m.fields.push(n);\n }\n}\nfunction assertHasLoc(n) {\n if (n.loc == null || n.loc.start == null || n.loc.end == null) {\n throw new Error(\"Internal failure: node (\".concat(JSON.stringify(n.type), \") has no location information\"));\n }\n}\nfunction getEndOfSection(s) {\n assertHasLoc(s.size);\n return s.startOffset + s.size.value + ( // $FlowIgnore\n s.size.loc.end.column - s.size.loc.start.column);\n}\nfunction shiftLoc(node, delta) {\n // $FlowIgnore\n node.loc.start.column += delta; // $FlowIgnore\n\n node.loc.end.column += delta;\n}\nfunction shiftSection(ast, node, delta) {\n if (node.type !== \"SectionMetadata\") {\n throw new Error(\"Can not shift node \" + JSON.stringify(node.type));\n }\n\n node.startOffset += delta;\n\n if (_typeof(node.size.loc) === \"object\") {\n shiftLoc(node.size, delta);\n } // Custom sections doesn't have vectorOfSize\n\n\n if (_typeof(node.vectorOfSize) === \"object\" && _typeof(node.vectorOfSize.loc) === \"object\") {\n shiftLoc(node.vectorOfSize, delta);\n }\n\n var sectionName = node.section; // shift node locations within that section\n\n (0,_traverse__WEBPACK_IMPORTED_MODULE_1__.traverse)(ast, {\n Node: function Node(_ref3) {\n var node = _ref3.node;\n var section = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_2__.getSectionForNode)(node);\n\n if (section === sectionName && _typeof(node.loc) === \"object\") {\n shiftLoc(node, delta);\n }\n }\n });\n}\nfunction signatureForOpcode(object, name) {\n var opcodeName = name;\n\n if (object !== undefined && object !== \"\") {\n opcodeName = object + \".\" + name;\n }\n\n var sign = _signatures__WEBPACK_IMPORTED_MODULE_0__.signatures[opcodeName];\n\n if (sign == undefined) {\n // TODO: Uncomment this when br_table and others has been done\n //throw new Error(\"Invalid opcode: \"+opcodeName);\n return [object, object];\n }\n\n return sign[0];\n}\nfunction getUniqueNameGenerator() {\n var inc = {};\n return function () {\n var prefix = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : \"temp\";\n\n if (!(prefix in inc)) {\n inc[prefix] = 0;\n } else {\n inc[prefix] = inc[prefix] + 1;\n }\n\n return prefix + \"_\" + inc[prefix];\n };\n}\nfunction getStartByteOffset(n) {\n // $FlowIgnore\n if (typeof n.loc === \"undefined\" || typeof n.loc.start === \"undefined\") {\n throw new Error( // $FlowIgnore\n \"Can not get byte offset without loc informations, node: \" + String(n.id));\n }\n\n return n.loc.start.column;\n}\nfunction getEndByteOffset(n) {\n // $FlowIgnore\n if (typeof n.loc === \"undefined\" || typeof n.loc.end === \"undefined\") {\n throw new Error(\"Can not get byte offset without loc informations, node: \" + n.type);\n }\n\n return n.loc.end.column;\n}\nfunction getFunctionBeginingByteOffset(n) {\n if (!(n.body.length > 0)) {\n throw new Error('n.body.length > 0' + \" error: \" + ( false || \"unknown\"));\n }\n\n var _n$body = _slicedToArray(n.body, 1),\n firstInstruction = _n$body[0];\n\n return getStartByteOffset(firstInstruction);\n}\nfunction getEndBlockByteOffset(n) {\n // $FlowIgnore\n if (!(n.instr.length > 0 || n.body.length > 0)) {\n throw new Error('n.instr.length > 0 || n.body.length > 0' + \" error: \" + ( false || \"unknown\"));\n }\n\n var lastInstruction;\n\n if (n.instr) {\n // $FlowIgnore\n lastInstruction = n.instr[n.instr.length - 1];\n }\n\n if (n.body) {\n // $FlowIgnore\n lastInstruction = n.body[n.body.length - 1];\n }\n\n if (!(_typeof(lastInstruction) === \"object\")) {\n throw new Error('typeof lastInstruction === \"object\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n // $FlowIgnore\n return getStartByteOffset(lastInstruction);\n}\nfunction getStartBlockByteOffset(n) {\n // $FlowIgnore\n if (!(n.instr.length > 0 || n.body.length > 0)) {\n throw new Error('n.instr.length > 0 || n.body.length > 0' + \" error: \" + ( false || \"unknown\"));\n }\n\n var fistInstruction;\n\n if (n.instr) {\n // $FlowIgnore\n var _n$instr = _slicedToArray(n.instr, 1);\n\n fistInstruction = _n$instr[0];\n }\n\n if (n.body) {\n // $FlowIgnore\n var _n$body2 = _slicedToArray(n.body, 1);\n\n fistInstruction = _n$body2[0];\n }\n\n if (!(_typeof(fistInstruction) === \"object\")) {\n throw new Error('typeof fistInstruction === \"object\"' + \" error: \" + ( false || \"unknown\"));\n }\n\n // $FlowIgnore\n return getStartByteOffset(fistInstruction);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/esm/utils.js?");
343+
344+/***/ }),
345+
346+/***/ "../node_modules/@webassemblyjs/ast/lib/clone.js":
347+/*!*******************************************************!*\
348+ !*** ../node_modules/@webassemblyjs/ast/lib/clone.js ***!
349+ \*******************************************************/
350+/***/ ((__unused_webpack_module, exports) => {
351+
352+"use strict";
353+eval("\n\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nexports.cloneNode = cloneNode;\n\nfunction cloneNode(n) {\n return Object.assign({}, n);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ast/lib/clone.js?");
354+
355+/***/ }),
356+
357+/***/ "../node_modules/@webassemblyjs/floating-point-hex-parser/esm/index.js":
358+/*!*****************************************************************************!*\
359+ !*** ../node_modules/@webassemblyjs/floating-point-hex-parser/esm/index.js ***!
360+ \*****************************************************************************/
361+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
362+
363+"use strict";
364+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"default\": () => (/* binding */ parse)\n/* harmony export */ });\nfunction parse(input) {\n input = input.toUpperCase();\n var splitIndex = input.indexOf(\"P\");\n var mantissa, exponent;\n\n if (splitIndex !== -1) {\n mantissa = input.substring(0, splitIndex);\n exponent = parseInt(input.substring(splitIndex + 1));\n } else {\n mantissa = input;\n exponent = 0;\n }\n\n var dotIndex = mantissa.indexOf(\".\");\n\n if (dotIndex !== -1) {\n var integerPart = parseInt(mantissa.substring(0, dotIndex), 16);\n var sign = Math.sign(integerPart);\n integerPart = sign * integerPart;\n var fractionLength = mantissa.length - dotIndex - 1;\n var fractionalPart = parseInt(mantissa.substring(dotIndex + 1), 16);\n var fraction = fractionLength > 0 ? fractionalPart / Math.pow(16, fractionLength) : 0;\n\n if (sign === 0) {\n if (fraction === 0) {\n mantissa = sign;\n } else {\n if (Object.is(sign, -0)) {\n mantissa = -fraction;\n } else {\n mantissa = fraction;\n }\n }\n } else {\n mantissa = sign * (integerPart + fraction);\n }\n } else {\n mantissa = parseInt(mantissa, 16);\n }\n\n return mantissa * (splitIndex !== -1 ? Math.pow(2, exponent) : 1);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/floating-point-hex-parser/esm/index.js?");
365+
366+/***/ }),
367+
368+/***/ "../node_modules/@webassemblyjs/helper-api-error/esm/index.js":
369+/*!********************************************************************!*\
370+ !*** ../node_modules/@webassemblyjs/helper-api-error/esm/index.js ***!
371+ \********************************************************************/
372+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
373+
374+"use strict";
375+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"CompileError\": () => (/* binding */ CompileError),\n/* harmony export */ \"LinkError\": () => (/* binding */ LinkError),\n/* harmony export */ \"RuntimeError\": () => (/* binding */ RuntimeError)\n/* harmony export */ });\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar RuntimeError =\n/*#__PURE__*/\nfunction (_Error) {\n _inherits(RuntimeError, _Error);\n\n function RuntimeError() {\n _classCallCheck(this, RuntimeError);\n\n return _possibleConstructorReturn(this, (RuntimeError.__proto__ || Object.getPrototypeOf(RuntimeError)).apply(this, arguments));\n }\n\n return RuntimeError;\n}(Error);\nvar CompileError =\n/*#__PURE__*/\nfunction (_Error2) {\n _inherits(CompileError, _Error2);\n\n function CompileError() {\n _classCallCheck(this, CompileError);\n\n return _possibleConstructorReturn(this, (CompileError.__proto__ || Object.getPrototypeOf(CompileError)).apply(this, arguments));\n }\n\n return CompileError;\n}(Error);\nvar LinkError =\n/*#__PURE__*/\nfunction (_Error3) {\n _inherits(LinkError, _Error3);\n\n function LinkError() {\n _classCallCheck(this, LinkError);\n\n return _possibleConstructorReturn(this, (LinkError.__proto__ || Object.getPrototypeOf(LinkError)).apply(this, arguments));\n }\n\n return LinkError;\n}(Error);\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-api-error/esm/index.js?");
376+
377+/***/ }),
378+
379+/***/ "../node_modules/@webassemblyjs/helper-buffer/esm/index.js":
380+/*!*****************************************************************!*\
381+ !*** ../node_modules/@webassemblyjs/helper-buffer/esm/index.js ***!
382+ \*****************************************************************/
383+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
384+
385+"use strict";
386+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"fromHexdump\": () => (/* binding */ fromHexdump),\n/* harmony export */ \"makeBuffer\": () => (/* binding */ makeBuffer),\n/* harmony export */ \"overrideBytesInBuffer\": () => (/* binding */ overrideBytesInBuffer)\n/* harmony export */ });\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nfunction concatUint8Arrays() {\n for (var _len = arguments.length, arrays = new Array(_len), _key = 0; _key < _len; _key++) {\n arrays[_key] = arguments[_key];\n }\n\n var totalLength = arrays.reduce(function (a, b) {\n return a + b.length;\n }, 0);\n var result = new Uint8Array(totalLength);\n var offset = 0;\n\n for (var _i = 0; _i < arrays.length; _i++) {\n var arr = arrays[_i];\n\n if (arr instanceof Uint8Array === false) {\n throw new Error(\"arr must be of type Uint8Array\");\n }\n\n result.set(arr, offset);\n offset += arr.length;\n }\n\n return result;\n}\n\nfunction overrideBytesInBuffer(buffer, startLoc, endLoc, newBytes) {\n var beforeBytes = buffer.slice(0, startLoc);\n var afterBytes = buffer.slice(endLoc, buffer.length); // replacement is empty, we can omit it\n\n if (newBytes.length === 0) {\n return concatUint8Arrays(beforeBytes, afterBytes);\n }\n\n var replacement = Uint8Array.from(newBytes);\n return concatUint8Arrays(beforeBytes, replacement, afterBytes);\n}\nfunction makeBuffer() {\n for (var _len2 = arguments.length, splitedBytes = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n splitedBytes[_key2] = arguments[_key2];\n }\n\n var bytes = [].concat.apply([], splitedBytes);\n return new Uint8Array(bytes).buffer;\n}\nfunction fromHexdump(str) {\n var lines = str.split(\"\\n\"); // remove any leading left whitespace\n\n lines = lines.map(function (line) {\n return line.trim();\n });\n var bytes = lines.reduce(function (acc, line) {\n var cols = line.split(\" \"); // remove the offset, left column\n\n cols.shift();\n cols = cols.filter(function (x) {\n return x !== \"\";\n });\n var bytes = cols.map(function (x) {\n return parseInt(x, 16);\n });\n acc.push.apply(acc, _toConsumableArray(bytes));\n return acc;\n }, []);\n return Buffer.from(bytes);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-buffer/esm/index.js?");
387+
388+/***/ }),
389+
390+/***/ "../node_modules/@webassemblyjs/helper-numbers/esm/index.js":
391+/*!******************************************************************!*\
392+ !*** ../node_modules/@webassemblyjs/helper-numbers/esm/index.js ***!
393+ \******************************************************************/
394+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
395+
396+"use strict";
397+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"isInfLiteral\": () => (/* binding */ isInfLiteral),\n/* harmony export */ \"isNanLiteral\": () => (/* binding */ isNanLiteral),\n/* harmony export */ \"parse32F\": () => (/* binding */ parse32F),\n/* harmony export */ \"parse32I\": () => (/* binding */ parse32I),\n/* harmony export */ \"parse64F\": () => (/* binding */ parse64F),\n/* harmony export */ \"parse64I\": () => (/* binding */ parse64I),\n/* harmony export */ \"parseU32\": () => (/* binding */ parseU32)\n/* harmony export */ });\n/* harmony import */ var _xtuc_long__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @xtuc/long */ \"../node_modules/@xtuc/long/src/long.js\");\n/* harmony import */ var _xtuc_long__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_xtuc_long__WEBPACK_IMPORTED_MODULE_0__);\n/* harmony import */ var _webassemblyjs_floating_point_hex_parser__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/floating-point-hex-parser */ \"../node_modules/@webassemblyjs/floating-point-hex-parser/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/helper-api-error */ \"../node_modules/@webassemblyjs/helper-api-error/esm/index.js\");\n\n\n\nfunction parse32F(sourceString) {\n if (isHexLiteral(sourceString)) {\n return (0,_webassemblyjs_floating_point_hex_parser__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(sourceString);\n }\n\n if (isInfLiteral(sourceString)) {\n return sourceString[0] === \"-\" ? -1 : 1;\n }\n\n if (isNanLiteral(sourceString)) {\n return (sourceString[0] === \"-\" ? -1 : 1) * (sourceString.includes(\":\") ? parseInt(sourceString.substring(sourceString.indexOf(\":\") + 1), 16) : 0x400000);\n }\n\n return parseFloat(sourceString);\n}\nfunction parse64F(sourceString) {\n if (isHexLiteral(sourceString)) {\n return (0,_webassemblyjs_floating_point_hex_parser__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(sourceString);\n }\n\n if (isInfLiteral(sourceString)) {\n return sourceString[0] === \"-\" ? -1 : 1;\n }\n\n if (isNanLiteral(sourceString)) {\n return (sourceString[0] === \"-\" ? -1 : 1) * (sourceString.includes(\":\") ? parseInt(sourceString.substring(sourceString.indexOf(\":\") + 1), 16) : 0x8000000000000);\n }\n\n if (isHexLiteral(sourceString)) {\n return (0,_webassemblyjs_floating_point_hex_parser__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(sourceString);\n }\n\n return parseFloat(sourceString);\n}\nfunction parse32I(sourceString) {\n var value = 0;\n\n if (isHexLiteral(sourceString)) {\n value = ~~parseInt(sourceString, 16);\n } else if (isDecimalExponentLiteral(sourceString)) {\n throw new Error(\"This number literal format is yet to be implemented.\");\n } else {\n value = parseInt(sourceString, 10);\n }\n\n return value;\n}\nfunction parseU32(sourceString) {\n var value = parse32I(sourceString);\n\n if (value < 0) {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_2__.CompileError(\"Illegal value for u32: \" + sourceString);\n }\n\n return value;\n}\nfunction parse64I(sourceString) {\n var long;\n\n if (isHexLiteral(sourceString)) {\n long = _xtuc_long__WEBPACK_IMPORTED_MODULE_0___default().fromString(sourceString, false, 16);\n } else if (isDecimalExponentLiteral(sourceString)) {\n throw new Error(\"This number literal format is yet to be implemented.\");\n } else {\n long = _xtuc_long__WEBPACK_IMPORTED_MODULE_0___default().fromString(sourceString);\n }\n\n return {\n high: long.high,\n low: long.low\n };\n}\nvar NAN_WORD = /^\\+?-?nan/;\nvar INF_WORD = /^\\+?-?inf/;\nfunction isInfLiteral(sourceString) {\n return INF_WORD.test(sourceString.toLowerCase());\n}\nfunction isNanLiteral(sourceString) {\n return NAN_WORD.test(sourceString.toLowerCase());\n}\n\nfunction isDecimalExponentLiteral(sourceString) {\n return !isHexLiteral(sourceString) && sourceString.toUpperCase().includes(\"E\");\n}\n\nfunction isHexLiteral(sourceString) {\n return sourceString.substring(0, 2).toUpperCase() === \"0X\" || sourceString.substring(0, 3).toUpperCase() === \"-0X\";\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-numbers/esm/index.js?");
398+
399+/***/ }),
400+
401+/***/ "../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js":
402+/*!************************************************************************!*\
403+ !*** ../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js ***!
404+ \************************************************************************/
405+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
406+
407+"use strict";
408+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"default\": () => (__WEBPACK_DEFAULT_EXPORT__),\n/* harmony export */ \"getSectionForNode\": () => (/* reexport safe */ _section__WEBPACK_IMPORTED_MODULE_0__.getSectionForNode)\n/* harmony export */ });\n/* harmony import */ var _section__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./section */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/section.js\");\nvar illegalop = \"illegal\";\nvar magicModuleHeader = [0x00, 0x61, 0x73, 0x6d];\nvar moduleVersion = [0x01, 0x00, 0x00, 0x00];\n\nfunction invertMap(obj) {\n var keyModifierFn = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : function (k) {\n return k;\n };\n var result = {};\n var keys = Object.keys(obj);\n\n for (var i = 0, length = keys.length; i < length; i++) {\n result[keyModifierFn(obj[keys[i]])] = keys[i];\n }\n\n return result;\n}\n\nfunction createSymbolObject(name\n/*: string */\n, object\n/*: string */\n)\n/*: Symbol*/\n{\n var numberOfArgs\n /*: number*/\n = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n return {\n name: name,\n object: object,\n numberOfArgs: numberOfArgs\n };\n}\n\nfunction createSymbol(name\n/*: string */\n)\n/*: Symbol*/\n{\n var numberOfArgs\n /*: number*/\n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n return {\n name: name,\n numberOfArgs: numberOfArgs\n };\n}\n\nvar types = {\n func: 0x60,\n result: 0x40\n};\nvar exportTypes = {\n 0x00: \"Func\",\n 0x01: \"Table\",\n 0x02: \"Mem\",\n 0x03: \"Global\"\n};\nvar exportTypesByName = invertMap(exportTypes);\nvar valtypes = {\n 0x7f: \"i32\",\n 0x7e: \"i64\",\n 0x7d: \"f32\",\n 0x7c: \"f64\",\n 0x7b: \"v128\"\n};\nvar valtypesByString = invertMap(valtypes);\nvar tableTypes = {\n 0x70: \"anyfunc\"\n};\nvar blockTypes = Object.assign({}, valtypes, {\n // https://webassembly.github.io/spec/core/binary/types.html#binary-blocktype\n 0x40: null,\n // https://webassembly.github.io/spec/core/binary/types.html#binary-valtype\n 0x7f: \"i32\",\n 0x7e: \"i64\",\n 0x7d: \"f32\",\n 0x7c: \"f64\"\n});\nvar globalTypes = {\n 0x00: \"const\",\n 0x01: \"var\"\n};\nvar globalTypesByString = invertMap(globalTypes);\nvar importTypes = {\n 0x00: \"func\",\n 0x01: \"table\",\n 0x02: \"mem\",\n 0x03: \"global\"\n};\nvar sections = {\n custom: 0,\n type: 1,\n import: 2,\n func: 3,\n table: 4,\n memory: 5,\n global: 6,\n export: 7,\n start: 8,\n element: 9,\n code: 10,\n data: 11\n};\nvar symbolsByByte = {\n 0x00: createSymbol(\"unreachable\"),\n 0x01: createSymbol(\"nop\"),\n 0x02: createSymbol(\"block\"),\n 0x03: createSymbol(\"loop\"),\n 0x04: createSymbol(\"if\"),\n 0x05: createSymbol(\"else\"),\n 0x06: illegalop,\n 0x07: illegalop,\n 0x08: illegalop,\n 0x09: illegalop,\n 0x0a: illegalop,\n 0x0b: createSymbol(\"end\"),\n 0x0c: createSymbol(\"br\", 1),\n 0x0d: createSymbol(\"br_if\", 1),\n 0x0e: createSymbol(\"br_table\"),\n 0x0f: createSymbol(\"return\"),\n 0x10: createSymbol(\"call\", 1),\n 0x11: createSymbol(\"call_indirect\", 2),\n 0x12: illegalop,\n 0x13: illegalop,\n 0x14: illegalop,\n 0x15: illegalop,\n 0x16: illegalop,\n 0x17: illegalop,\n 0x18: illegalop,\n 0x19: illegalop,\n 0x1a: createSymbol(\"drop\"),\n 0x1b: createSymbol(\"select\"),\n 0x1c: illegalop,\n 0x1d: illegalop,\n 0x1e: illegalop,\n 0x1f: illegalop,\n 0x20: createSymbol(\"get_local\", 1),\n 0x21: createSymbol(\"set_local\", 1),\n 0x22: createSymbol(\"tee_local\", 1),\n 0x23: createSymbol(\"get_global\", 1),\n 0x24: createSymbol(\"set_global\", 1),\n 0x25: illegalop,\n 0x26: illegalop,\n 0x27: illegalop,\n 0x28: createSymbolObject(\"load\", \"u32\", 1),\n 0x29: createSymbolObject(\"load\", \"u64\", 1),\n 0x2a: createSymbolObject(\"load\", \"f32\", 1),\n 0x2b: createSymbolObject(\"load\", \"f64\", 1),\n 0x2c: createSymbolObject(\"load8_s\", \"u32\", 1),\n 0x2d: createSymbolObject(\"load8_u\", \"u32\", 1),\n 0x2e: createSymbolObject(\"load16_s\", \"u32\", 1),\n 0x2f: createSymbolObject(\"load16_u\", \"u32\", 1),\n 0x30: createSymbolObject(\"load8_s\", \"u64\", 1),\n 0x31: createSymbolObject(\"load8_u\", \"u64\", 1),\n 0x32: createSymbolObject(\"load16_s\", \"u64\", 1),\n 0x33: createSymbolObject(\"load16_u\", \"u64\", 1),\n 0x34: createSymbolObject(\"load32_s\", \"u64\", 1),\n 0x35: createSymbolObject(\"load32_u\", \"u64\", 1),\n 0x36: createSymbolObject(\"store\", \"u32\", 1),\n 0x37: createSymbolObject(\"store\", \"u64\", 1),\n 0x38: createSymbolObject(\"store\", \"f32\", 1),\n 0x39: createSymbolObject(\"store\", \"f64\", 1),\n 0x3a: createSymbolObject(\"store8\", \"u32\", 1),\n 0x3b: createSymbolObject(\"store16\", \"u32\", 1),\n 0x3c: createSymbolObject(\"store8\", \"u64\", 1),\n 0x3d: createSymbolObject(\"store16\", \"u64\", 1),\n 0x3e: createSymbolObject(\"store32\", \"u64\", 1),\n 0x3f: createSymbolObject(\"current_memory\"),\n 0x40: createSymbolObject(\"grow_memory\"),\n 0x41: createSymbolObject(\"const\", \"i32\", 1),\n 0x42: createSymbolObject(\"const\", \"i64\", 1),\n 0x43: createSymbolObject(\"const\", \"f32\", 1),\n 0x44: createSymbolObject(\"const\", \"f64\", 1),\n 0x45: createSymbolObject(\"eqz\", \"i32\"),\n 0x46: createSymbolObject(\"eq\", \"i32\"),\n 0x47: createSymbolObject(\"ne\", \"i32\"),\n 0x48: createSymbolObject(\"lt_s\", \"i32\"),\n 0x49: createSymbolObject(\"lt_u\", \"i32\"),\n 0x4a: createSymbolObject(\"gt_s\", \"i32\"),\n 0x4b: createSymbolObject(\"gt_u\", \"i32\"),\n 0x4c: createSymbolObject(\"le_s\", \"i32\"),\n 0x4d: createSymbolObject(\"le_u\", \"i32\"),\n 0x4e: createSymbolObject(\"ge_s\", \"i32\"),\n 0x4f: createSymbolObject(\"ge_u\", \"i32\"),\n 0x50: createSymbolObject(\"eqz\", \"i64\"),\n 0x51: createSymbolObject(\"eq\", \"i64\"),\n 0x52: createSymbolObject(\"ne\", \"i64\"),\n 0x53: createSymbolObject(\"lt_s\", \"i64\"),\n 0x54: createSymbolObject(\"lt_u\", \"i64\"),\n 0x55: createSymbolObject(\"gt_s\", \"i64\"),\n 0x56: createSymbolObject(\"gt_u\", \"i64\"),\n 0x57: createSymbolObject(\"le_s\", \"i64\"),\n 0x58: createSymbolObject(\"le_u\", \"i64\"),\n 0x59: createSymbolObject(\"ge_s\", \"i64\"),\n 0x5a: createSymbolObject(\"ge_u\", \"i64\"),\n 0x5b: createSymbolObject(\"eq\", \"f32\"),\n 0x5c: createSymbolObject(\"ne\", \"f32\"),\n 0x5d: createSymbolObject(\"lt\", \"f32\"),\n 0x5e: createSymbolObject(\"gt\", \"f32\"),\n 0x5f: createSymbolObject(\"le\", \"f32\"),\n 0x60: createSymbolObject(\"ge\", \"f32\"),\n 0x61: createSymbolObject(\"eq\", \"f64\"),\n 0x62: createSymbolObject(\"ne\", \"f64\"),\n 0x63: createSymbolObject(\"lt\", \"f64\"),\n 0x64: createSymbolObject(\"gt\", \"f64\"),\n 0x65: createSymbolObject(\"le\", \"f64\"),\n 0x66: createSymbolObject(\"ge\", \"f64\"),\n 0x67: createSymbolObject(\"clz\", \"i32\"),\n 0x68: createSymbolObject(\"ctz\", \"i32\"),\n 0x69: createSymbolObject(\"popcnt\", \"i32\"),\n 0x6a: createSymbolObject(\"add\", \"i32\"),\n 0x6b: createSymbolObject(\"sub\", \"i32\"),\n 0x6c: createSymbolObject(\"mul\", \"i32\"),\n 0x6d: createSymbolObject(\"div_s\", \"i32\"),\n 0x6e: createSymbolObject(\"div_u\", \"i32\"),\n 0x6f: createSymbolObject(\"rem_s\", \"i32\"),\n 0x70: createSymbolObject(\"rem_u\", \"i32\"),\n 0x71: createSymbolObject(\"and\", \"i32\"),\n 0x72: createSymbolObject(\"or\", \"i32\"),\n 0x73: createSymbolObject(\"xor\", \"i32\"),\n 0x74: createSymbolObject(\"shl\", \"i32\"),\n 0x75: createSymbolObject(\"shr_s\", \"i32\"),\n 0x76: createSymbolObject(\"shr_u\", \"i32\"),\n 0x77: createSymbolObject(\"rotl\", \"i32\"),\n 0x78: createSymbolObject(\"rotr\", \"i32\"),\n 0x79: createSymbolObject(\"clz\", \"i64\"),\n 0x7a: createSymbolObject(\"ctz\", \"i64\"),\n 0x7b: createSymbolObject(\"popcnt\", \"i64\"),\n 0x7c: createSymbolObject(\"add\", \"i64\"),\n 0x7d: createSymbolObject(\"sub\", \"i64\"),\n 0x7e: createSymbolObject(\"mul\", \"i64\"),\n 0x7f: createSymbolObject(\"div_s\", \"i64\"),\n 0x80: createSymbolObject(\"div_u\", \"i64\"),\n 0x81: createSymbolObject(\"rem_s\", \"i64\"),\n 0x82: createSymbolObject(\"rem_u\", \"i64\"),\n 0x83: createSymbolObject(\"and\", \"i64\"),\n 0x84: createSymbolObject(\"or\", \"i64\"),\n 0x85: createSymbolObject(\"xor\", \"i64\"),\n 0x86: createSymbolObject(\"shl\", \"i64\"),\n 0x87: createSymbolObject(\"shr_s\", \"i64\"),\n 0x88: createSymbolObject(\"shr_u\", \"i64\"),\n 0x89: createSymbolObject(\"rotl\", \"i64\"),\n 0x8a: createSymbolObject(\"rotr\", \"i64\"),\n 0x8b: createSymbolObject(\"abs\", \"f32\"),\n 0x8c: createSymbolObject(\"neg\", \"f32\"),\n 0x8d: createSymbolObject(\"ceil\", \"f32\"),\n 0x8e: createSymbolObject(\"floor\", \"f32\"),\n 0x8f: createSymbolObject(\"trunc\", \"f32\"),\n 0x90: createSymbolObject(\"nearest\", \"f32\"),\n 0x91: createSymbolObject(\"sqrt\", \"f32\"),\n 0x92: createSymbolObject(\"add\", \"f32\"),\n 0x93: createSymbolObject(\"sub\", \"f32\"),\n 0x94: createSymbolObject(\"mul\", \"f32\"),\n 0x95: createSymbolObject(\"div\", \"f32\"),\n 0x96: createSymbolObject(\"min\", \"f32\"),\n 0x97: createSymbolObject(\"max\", \"f32\"),\n 0x98: createSymbolObject(\"copysign\", \"f32\"),\n 0x99: createSymbolObject(\"abs\", \"f64\"),\n 0x9a: createSymbolObject(\"neg\", \"f64\"),\n 0x9b: createSymbolObject(\"ceil\", \"f64\"),\n 0x9c: createSymbolObject(\"floor\", \"f64\"),\n 0x9d: createSymbolObject(\"trunc\", \"f64\"),\n 0x9e: createSymbolObject(\"nearest\", \"f64\"),\n 0x9f: createSymbolObject(\"sqrt\", \"f64\"),\n 0xa0: createSymbolObject(\"add\", \"f64\"),\n 0xa1: createSymbolObject(\"sub\", \"f64\"),\n 0xa2: createSymbolObject(\"mul\", \"f64\"),\n 0xa3: createSymbolObject(\"div\", \"f64\"),\n 0xa4: createSymbolObject(\"min\", \"f64\"),\n 0xa5: createSymbolObject(\"max\", \"f64\"),\n 0xa6: createSymbolObject(\"copysign\", \"f64\"),\n 0xa7: createSymbolObject(\"wrap/i64\", \"i32\"),\n 0xa8: createSymbolObject(\"trunc_s/f32\", \"i32\"),\n 0xa9: createSymbolObject(\"trunc_u/f32\", \"i32\"),\n 0xaa: createSymbolObject(\"trunc_s/f64\", \"i32\"),\n 0xab: createSymbolObject(\"trunc_u/f64\", \"i32\"),\n 0xac: createSymbolObject(\"extend_s/i32\", \"i64\"),\n 0xad: createSymbolObject(\"extend_u/i32\", \"i64\"),\n 0xae: createSymbolObject(\"trunc_s/f32\", \"i64\"),\n 0xaf: createSymbolObject(\"trunc_u/f32\", \"i64\"),\n 0xb0: createSymbolObject(\"trunc_s/f64\", \"i64\"),\n 0xb1: createSymbolObject(\"trunc_u/f64\", \"i64\"),\n 0xb2: createSymbolObject(\"convert_s/i32\", \"f32\"),\n 0xb3: createSymbolObject(\"convert_u/i32\", \"f32\"),\n 0xb4: createSymbolObject(\"convert_s/i64\", \"f32\"),\n 0xb5: createSymbolObject(\"convert_u/i64\", \"f32\"),\n 0xb6: createSymbolObject(\"demote/f64\", \"f32\"),\n 0xb7: createSymbolObject(\"convert_s/i32\", \"f64\"),\n 0xb8: createSymbolObject(\"convert_u/i32\", \"f64\"),\n 0xb9: createSymbolObject(\"convert_s/i64\", \"f64\"),\n 0xba: createSymbolObject(\"convert_u/i64\", \"f64\"),\n 0xbb: createSymbolObject(\"promote/f32\", \"f64\"),\n 0xbc: createSymbolObject(\"reinterpret/f32\", \"i32\"),\n 0xbd: createSymbolObject(\"reinterpret/f64\", \"i64\"),\n 0xbe: createSymbolObject(\"reinterpret/i32\", \"f32\"),\n 0xbf: createSymbolObject(\"reinterpret/i64\", \"f64\"),\n // Atomic Memory Instructions\n 0xfe00: createSymbol(\"memory.atomic.notify\", 1),\n 0xfe01: createSymbol(\"memory.atomic.wait32\", 1),\n 0xfe02: createSymbol(\"memory.atomic.wait64\", 1),\n 0xfe10: createSymbolObject(\"atomic.load\", \"i32\", 1),\n 0xfe11: createSymbolObject(\"atomic.load\", \"i64\", 1),\n 0xfe12: createSymbolObject(\"atomic.load8_u\", \"i32\", 1),\n 0xfe13: createSymbolObject(\"atomic.load16_u\", \"i32\", 1),\n 0xfe14: createSymbolObject(\"atomic.load8_u\", \"i64\", 1),\n 0xfe15: createSymbolObject(\"atomic.load16_u\", \"i64\", 1),\n 0xfe16: createSymbolObject(\"atomic.load32_u\", \"i64\", 1),\n 0xfe17: createSymbolObject(\"atomic.store\", \"i32\", 1),\n 0xfe18: createSymbolObject(\"atomic.store\", \"i64\", 1),\n 0xfe19: createSymbolObject(\"atomic.store8_u\", \"i32\", 1),\n 0xfe1a: createSymbolObject(\"atomic.store16_u\", \"i32\", 1),\n 0xfe1b: createSymbolObject(\"atomic.store8_u\", \"i64\", 1),\n 0xfe1c: createSymbolObject(\"atomic.store16_u\", \"i64\", 1),\n 0xfe1d: createSymbolObject(\"atomic.store32_u\", \"i64\", 1),\n 0xfe1e: createSymbolObject(\"atomic.rmw.add\", \"i32\", 1),\n 0xfe1f: createSymbolObject(\"atomic.rmw.add\", \"i64\", 1),\n 0xfe20: createSymbolObject(\"atomic.rmw8_u.add_u\", \"i32\", 1),\n 0xfe21: createSymbolObject(\"atomic.rmw16_u.add_u\", \"i32\", 1),\n 0xfe22: createSymbolObject(\"atomic.rmw8_u.add_u\", \"i64\", 1),\n 0xfe23: createSymbolObject(\"atomic.rmw16_u.add_u\", \"i64\", 1),\n 0xfe24: createSymbolObject(\"atomic.rmw32_u.add_u\", \"i64\", 1),\n 0xfe25: createSymbolObject(\"atomic.rmw.sub\", \"i32\", 1),\n 0xfe26: createSymbolObject(\"atomic.rmw.sub\", \"i64\", 1),\n 0xfe27: createSymbolObject(\"atomic.rmw8_u.sub_u\", \"i32\", 1),\n 0xfe28: createSymbolObject(\"atomic.rmw16_u.sub_u\", \"i32\", 1),\n 0xfe29: createSymbolObject(\"atomic.rmw8_u.sub_u\", \"i64\", 1),\n 0xfe2a: createSymbolObject(\"atomic.rmw16_u.sub_u\", \"i64\", 1),\n 0xfe2b: createSymbolObject(\"atomic.rmw32_u.sub_u\", \"i64\", 1),\n 0xfe2c: createSymbolObject(\"atomic.rmw.and\", \"i32\", 1),\n 0xfe2d: createSymbolObject(\"atomic.rmw.and\", \"i64\", 1),\n 0xfe2e: createSymbolObject(\"atomic.rmw8_u.and_u\", \"i32\", 1),\n 0xfe2f: createSymbolObject(\"atomic.rmw16_u.and_u\", \"i32\", 1),\n 0xfe30: createSymbolObject(\"atomic.rmw8_u.and_u\", \"i64\", 1),\n 0xfe31: createSymbolObject(\"atomic.rmw16_u.and_u\", \"i64\", 1),\n 0xfe32: createSymbolObject(\"atomic.rmw32_u.and_u\", \"i64\", 1),\n 0xfe33: createSymbolObject(\"atomic.rmw.or\", \"i32\", 1),\n 0xfe34: createSymbolObject(\"atomic.rmw.or\", \"i64\", 1),\n 0xfe35: createSymbolObject(\"atomic.rmw8_u.or_u\", \"i32\", 1),\n 0xfe36: createSymbolObject(\"atomic.rmw16_u.or_u\", \"i32\", 1),\n 0xfe37: createSymbolObject(\"atomic.rmw8_u.or_u\", \"i64\", 1),\n 0xfe38: createSymbolObject(\"atomic.rmw16_u.or_u\", \"i64\", 1),\n 0xfe39: createSymbolObject(\"atomic.rmw32_u.or_u\", \"i64\", 1),\n 0xfe3a: createSymbolObject(\"atomic.rmw.xor\", \"i32\", 1),\n 0xfe3b: createSymbolObject(\"atomic.rmw.xor\", \"i64\", 1),\n 0xfe3c: createSymbolObject(\"atomic.rmw8_u.xor_u\", \"i32\", 1),\n 0xfe3d: createSymbolObject(\"atomic.rmw16_u.xor_u\", \"i32\", 1),\n 0xfe3e: createSymbolObject(\"atomic.rmw8_u.xor_u\", \"i64\", 1),\n 0xfe3f: createSymbolObject(\"atomic.rmw16_u.xor_u\", \"i64\", 1),\n 0xfe40: createSymbolObject(\"atomic.rmw32_u.xor_u\", \"i64\", 1),\n 0xfe41: createSymbolObject(\"atomic.rmw.xchg\", \"i32\", 1),\n 0xfe42: createSymbolObject(\"atomic.rmw.xchg\", \"i64\", 1),\n 0xfe43: createSymbolObject(\"atomic.rmw8_u.xchg_u\", \"i32\", 1),\n 0xfe44: createSymbolObject(\"atomic.rmw16_u.xchg_u\", \"i32\", 1),\n 0xfe45: createSymbolObject(\"atomic.rmw8_u.xchg_u\", \"i64\", 1),\n 0xfe46: createSymbolObject(\"atomic.rmw16_u.xchg_u\", \"i64\", 1),\n 0xfe47: createSymbolObject(\"atomic.rmw32_u.xchg_u\", \"i64\", 1),\n 0xfe48: createSymbolObject(\"atomic.rmw.cmpxchg\", \"i32\", 1),\n 0xfe49: createSymbolObject(\"atomic.rmw.cmpxchg\", \"i64\", 1),\n 0xfe4a: createSymbolObject(\"atomic.rmw8_u.cmpxchg_u\", \"i32\", 1),\n 0xfe4b: createSymbolObject(\"atomic.rmw16_u.cmpxchg_u\", \"i32\", 1),\n 0xfe4c: createSymbolObject(\"atomic.rmw8_u.cmpxchg_u\", \"i64\", 1),\n 0xfe4d: createSymbolObject(\"atomic.rmw16_u.cmpxchg_u\", \"i64\", 1),\n 0xfe4e: createSymbolObject(\"atomic.rmw32_u.cmpxchg_u\", \"i64\", 1)\n};\nvar symbolsByName = invertMap(symbolsByByte, function (obj) {\n if (typeof obj.object === \"string\") {\n return \"\".concat(obj.object, \".\").concat(obj.name);\n }\n\n return obj.name;\n});\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = ({\n symbolsByByte: symbolsByByte,\n sections: sections,\n magicModuleHeader: magicModuleHeader,\n moduleVersion: moduleVersion,\n types: types,\n valtypes: valtypes,\n exportTypes: exportTypes,\n blockTypes: blockTypes,\n tableTypes: tableTypes,\n globalTypes: globalTypes,\n importTypes: importTypes,\n valtypesByString: valtypesByString,\n globalTypesByString: globalTypesByString,\n exportTypesByName: exportTypesByName,\n symbolsByName: symbolsByName\n});\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js?");
409+
410+/***/ }),
411+
412+/***/ "../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/section.js":
413+/*!**************************************************************************!*\
414+ !*** ../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/section.js ***!
415+ \**************************************************************************/
416+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
417+
418+"use strict";
419+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"getSectionForNode\": () => (/* binding */ getSectionForNode)\n/* harmony export */ });\nfunction getSectionForNode(n) {\n switch (n.type) {\n case \"ModuleImport\":\n return \"import\";\n\n case \"CallInstruction\":\n case \"CallIndirectInstruction\":\n case \"Func\":\n case \"Instr\":\n return \"code\";\n\n case \"ModuleExport\":\n return \"export\";\n\n case \"Start\":\n return \"start\";\n\n case \"TypeInstruction\":\n return \"type\";\n\n case \"IndexInFuncSection\":\n return \"func\";\n\n case \"Global\":\n return \"global\";\n // No section\n\n default:\n return;\n }\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/section.js?");
420+
421+/***/ }),
422+
423+/***/ "../node_modules/@webassemblyjs/helper-wasm-section/esm/create.js":
424+/*!************************************************************************!*\
425+ !*** ../node_modules/@webassemblyjs/helper-wasm-section/esm/create.js ***!
426+ \************************************************************************/
427+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
428+
429+"use strict";
430+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"createEmptySection\": () => (/* binding */ createEmptySection)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/wasm-gen */ \"../node_modules/@webassemblyjs/wasm-gen/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/helper-buffer */ \"../node_modules/@webassemblyjs/helper-buffer/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/helper-wasm-bytecode */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js\");\n/* harmony import */ var _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @webassemblyjs/ast */ \"../node_modules/@webassemblyjs/ast/esm/index.js\");\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n\n\n\n\n\nfunction findLastSection(ast, forSection) {\n var targetSectionId = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_2__[\"default\"].sections[forSection]; // $FlowIgnore: metadata can not be empty\n\n var moduleSections = ast.body[0].metadata.sections;\n var lastSection;\n var lastId = 0;\n\n for (var i = 0, len = moduleSections.length; i < len; i++) {\n var section = moduleSections[i]; // Ignore custom section since they can actually occur everywhere\n\n if (section.section === \"custom\") {\n continue;\n }\n\n var sectionId = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_2__[\"default\"].sections[section.section];\n\n if (targetSectionId > lastId && targetSectionId < sectionId) {\n return lastSection;\n }\n\n lastId = sectionId;\n lastSection = section;\n }\n\n return lastSection;\n}\n\nfunction createEmptySection(ast, uint8Buffer, section) {\n // previous section after which we are going to insert our section\n var lastSection = findLastSection(ast, section);\n var start, end;\n /**\n * It's the first section\n */\n\n if (lastSection == null || lastSection.section === \"custom\") {\n start = 8\n /* wasm header size */\n ;\n end = start;\n } else {\n start = lastSection.startOffset + lastSection.size.value + 1;\n end = start;\n } // section id\n\n\n start += 1;\n var sizeStartLoc = {\n line: -1,\n column: start\n };\n var sizeEndLoc = {\n line: -1,\n column: start + 1\n }; // 1 byte for the empty vector\n\n var size = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(1), sizeEndLoc, sizeStartLoc);\n var vectorOfSizeStartLoc = {\n line: -1,\n column: sizeEndLoc.column\n };\n var vectorOfSizeEndLoc = {\n line: -1,\n column: sizeEndLoc.column + 1\n };\n var vectorOfSize = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(0), vectorOfSizeEndLoc, vectorOfSizeStartLoc);\n var sectionMetadata = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.sectionMetadata(section, start, size, vectorOfSize);\n var sectionBytes = (0,_webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__.encodeNode)(sectionMetadata);\n uint8Buffer = (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_1__.overrideBytesInBuffer)(uint8Buffer, start - 1, end, sectionBytes); // Add section into the AST for later lookups\n\n if (_typeof(ast.body[0].metadata) === \"object\") {\n // $FlowIgnore: metadata can not be empty\n ast.body[0].metadata.sections.push(sectionMetadata);\n _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.sortSectionMetadata(ast.body[0]);\n }\n /**\n * Update AST\n */\n // Once we hit our section every that is after needs to be shifted by the delta\n\n\n var deltaBytes = +sectionBytes.length;\n var encounteredSection = false;\n _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.traverse(ast, {\n SectionMetadata: function SectionMetadata(path) {\n if (path.node.section === section) {\n encounteredSection = true;\n return;\n }\n\n if (encounteredSection === true) {\n _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.shiftSection(ast, path.node, deltaBytes);\n }\n }\n });\n return {\n uint8Buffer: uint8Buffer,\n sectionMetadata: sectionMetadata\n };\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-wasm-section/esm/create.js?");
431+
432+/***/ }),
433+
434+/***/ "../node_modules/@webassemblyjs/helper-wasm-section/esm/index.js":
435+/*!***********************************************************************!*\
436+ !*** ../node_modules/@webassemblyjs/helper-wasm-section/esm/index.js ***!
437+ \***********************************************************************/
438+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
439+
440+"use strict";
441+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"createEmptySection\": () => (/* reexport safe */ _create__WEBPACK_IMPORTED_MODULE_1__.createEmptySection),\n/* harmony export */ \"removeSections\": () => (/* reexport safe */ _remove__WEBPACK_IMPORTED_MODULE_2__.removeSections),\n/* harmony export */ \"resizeSectionByteSize\": () => (/* reexport safe */ _resize__WEBPACK_IMPORTED_MODULE_0__.resizeSectionByteSize),\n/* harmony export */ \"resizeSectionVecSize\": () => (/* reexport safe */ _resize__WEBPACK_IMPORTED_MODULE_0__.resizeSectionVecSize)\n/* harmony export */ });\n/* harmony import */ var _resize__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./resize */ \"../node_modules/@webassemblyjs/helper-wasm-section/esm/resize.js\");\n/* harmony import */ var _create__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./create */ \"../node_modules/@webassemblyjs/helper-wasm-section/esm/create.js\");\n/* harmony import */ var _remove__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./remove */ \"../node_modules/@webassemblyjs/helper-wasm-section/esm/remove.js\");\n\n\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-wasm-section/esm/index.js?");
442+
443+/***/ }),
444+
445+/***/ "../node_modules/@webassemblyjs/helper-wasm-section/esm/remove.js":
446+/*!************************************************************************!*\
447+ !*** ../node_modules/@webassemblyjs/helper-wasm-section/esm/remove.js ***!
448+ \************************************************************************/
449+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
450+
451+"use strict";
452+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"removeSections\": () => (/* binding */ removeSections)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/ast */ \"../node_modules/@webassemblyjs/ast/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/helper-buffer */ \"../node_modules/@webassemblyjs/helper-buffer/esm/index.js\");\n\n\nfunction removeSections(ast, uint8Buffer, section) {\n var sectionMetadatas = (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__.getSectionMetadatas)(ast, section);\n\n if (sectionMetadatas.length === 0) {\n throw new Error(\"Section metadata not found\");\n }\n\n return sectionMetadatas.reverse().reduce(function (uint8Buffer, sectionMetadata) {\n var startsIncludingId = sectionMetadata.startOffset - 1;\n var ends = section === \"start\" ? sectionMetadata.size.loc.end.column + 1 : sectionMetadata.startOffset + sectionMetadata.size.value + 1;\n var delta = -(ends - startsIncludingId);\n /**\n * update AST\n */\n // Once we hit our section every that is after needs to be shifted by the delta\n\n var encounteredSection = false;\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__.traverse)(ast, {\n SectionMetadata: function SectionMetadata(path) {\n if (path.node.section === section) {\n encounteredSection = true;\n return path.remove();\n }\n\n if (encounteredSection === true) {\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__.shiftSection)(ast, path.node, delta);\n }\n }\n }); // replacement is nothing\n\n var replacement = [];\n return (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_1__.overrideBytesInBuffer)(uint8Buffer, startsIncludingId, ends, replacement);\n }, uint8Buffer);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-wasm-section/esm/remove.js?");
453+
454+/***/ }),
455+
456+/***/ "../node_modules/@webassemblyjs/helper-wasm-section/esm/resize.js":
457+/*!************************************************************************!*\
458+ !*** ../node_modules/@webassemblyjs/helper-wasm-section/esm/resize.js ***!
459+ \************************************************************************/
460+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
461+
462+"use strict";
463+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"resizeSectionByteSize\": () => (/* binding */ resizeSectionByteSize),\n/* harmony export */ \"resizeSectionVecSize\": () => (/* binding */ resizeSectionVecSize)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/wasm-gen */ \"../node_modules/@webassemblyjs/wasm-gen/esm/index.js\");\n/* harmony import */ var _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/ast */ \"../node_modules/@webassemblyjs/ast/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/helper-buffer */ \"../node_modules/@webassemblyjs/helper-buffer/esm/index.js\");\n\n\n\nfunction resizeSectionByteSize(ast, uint8Buffer, section, deltaBytes) {\n var sectionMetadata = (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_1__.getSectionMetadata)(ast, section);\n\n if (typeof sectionMetadata === \"undefined\") {\n throw new Error(\"Section metadata not found\");\n }\n\n if (typeof sectionMetadata.size.loc === \"undefined\") {\n throw new Error(\"SectionMetadata \" + section + \" has no loc\");\n } // keep old node location to be overriden\n\n\n var start = sectionMetadata.size.loc.start.column;\n var end = sectionMetadata.size.loc.end.column;\n var newSectionSize = sectionMetadata.size.value + deltaBytes;\n var newBytes = (0,_webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__.encodeU32)(newSectionSize);\n /**\n * update AST\n */\n\n sectionMetadata.size.value = newSectionSize;\n var oldu32EncodedLen = end - start;\n var newu32EncodedLen = newBytes.length; // the new u32 has a different encoded length\n\n if (newu32EncodedLen !== oldu32EncodedLen) {\n var deltaInSizeEncoding = newu32EncodedLen - oldu32EncodedLen;\n sectionMetadata.size.loc.end.column = start + newu32EncodedLen;\n deltaBytes += deltaInSizeEncoding; // move the vec size pointer size the section size is now smaller\n\n sectionMetadata.vectorOfSize.loc.start.column += deltaInSizeEncoding;\n sectionMetadata.vectorOfSize.loc.end.column += deltaInSizeEncoding;\n } // Once we hit our section every that is after needs to be shifted by the delta\n\n\n var encounteredSection = false;\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_1__.traverse)(ast, {\n SectionMetadata: function SectionMetadata(path) {\n if (path.node.section === section) {\n encounteredSection = true;\n return;\n }\n\n if (encounteredSection === true) {\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_1__.shiftSection)(ast, path.node, deltaBytes);\n }\n }\n });\n return (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_2__.overrideBytesInBuffer)(uint8Buffer, start, end, newBytes);\n}\nfunction resizeSectionVecSize(ast, uint8Buffer, section, deltaElements) {\n var sectionMetadata = (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_1__.getSectionMetadata)(ast, section);\n\n if (typeof sectionMetadata === \"undefined\") {\n throw new Error(\"Section metadata not found\");\n }\n\n if (typeof sectionMetadata.vectorOfSize.loc === \"undefined\") {\n throw new Error(\"SectionMetadata \" + section + \" has no loc\");\n } // Section has no vector\n\n\n if (sectionMetadata.vectorOfSize.value === -1) {\n return uint8Buffer;\n } // keep old node location to be overriden\n\n\n var start = sectionMetadata.vectorOfSize.loc.start.column;\n var end = sectionMetadata.vectorOfSize.loc.end.column;\n var newValue = sectionMetadata.vectorOfSize.value + deltaElements;\n var newBytes = (0,_webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__.encodeU32)(newValue); // Update AST\n\n sectionMetadata.vectorOfSize.value = newValue;\n sectionMetadata.vectorOfSize.loc.end.column = start + newBytes.length;\n return (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_2__.overrideBytesInBuffer)(uint8Buffer, start, end, newBytes);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/helper-wasm-section/esm/resize.js?");
464+
465+/***/ }),
466+
467+/***/ "../node_modules/@webassemblyjs/ieee754/esm/index.js":
468+/*!***********************************************************!*\
469+ !*** ../node_modules/@webassemblyjs/ieee754/esm/index.js ***!
470+ \***********************************************************/
471+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
472+
473+"use strict";
474+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"DOUBLE_PRECISION_MANTISSA\": () => (/* binding */ DOUBLE_PRECISION_MANTISSA),\n/* harmony export */ \"NUMBER_OF_BYTE_F32\": () => (/* binding */ NUMBER_OF_BYTE_F32),\n/* harmony export */ \"NUMBER_OF_BYTE_F64\": () => (/* binding */ NUMBER_OF_BYTE_F64),\n/* harmony export */ \"SINGLE_PRECISION_MANTISSA\": () => (/* binding */ SINGLE_PRECISION_MANTISSA),\n/* harmony export */ \"decodeF32\": () => (/* binding */ decodeF32),\n/* harmony export */ \"decodeF64\": () => (/* binding */ decodeF64),\n/* harmony export */ \"encodeF32\": () => (/* binding */ encodeF32),\n/* harmony export */ \"encodeF64\": () => (/* binding */ encodeF64)\n/* harmony export */ });\n/* harmony import */ var _xtuc_ieee754__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @xtuc/ieee754 */ \"../node_modules/@xtuc/ieee754/index.js\");\n\n/**\n * According to https://webassembly.github.io/spec/binary/values.html#binary-float\n * n = 32/8\n */\n\nvar NUMBER_OF_BYTE_F32 = 4;\n/**\n * According to https://webassembly.github.io/spec/binary/values.html#binary-float\n * n = 64/8\n */\n\nvar NUMBER_OF_BYTE_F64 = 8;\nvar SINGLE_PRECISION_MANTISSA = 23;\nvar DOUBLE_PRECISION_MANTISSA = 52;\nfunction encodeF32(v) {\n var buffer = [];\n (0,_xtuc_ieee754__WEBPACK_IMPORTED_MODULE_0__.write)(buffer, v, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);\n return buffer;\n}\nfunction encodeF64(v) {\n var buffer = [];\n (0,_xtuc_ieee754__WEBPACK_IMPORTED_MODULE_0__.write)(buffer, v, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);\n return buffer;\n}\nfunction decodeF32(bytes) {\n var buffer = Buffer.from(bytes);\n return (0,_xtuc_ieee754__WEBPACK_IMPORTED_MODULE_0__.read)(buffer, 0, true, SINGLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F32);\n}\nfunction decodeF64(bytes) {\n var buffer = Buffer.from(bytes);\n return (0,_xtuc_ieee754__WEBPACK_IMPORTED_MODULE_0__.read)(buffer, 0, true, DOUBLE_PRECISION_MANTISSA, NUMBER_OF_BYTE_F64);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/ieee754/esm/index.js?");
475+
476+/***/ }),
477+
478+/***/ "../node_modules/@webassemblyjs/leb128/esm/bits.js":
479+/*!*********************************************************!*\
480+ !*** ../node_modules/@webassemblyjs/leb128/esm/bits.js ***!
481+ \*********************************************************/
482+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
483+
484+"use strict";
485+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"extract\": () => (/* binding */ extract),\n/* harmony export */ \"getSign\": () => (/* binding */ getSign),\n/* harmony export */ \"highOrder\": () => (/* binding */ highOrder),\n/* harmony export */ \"inject\": () => (/* binding */ inject)\n/* harmony export */ });\n// Copyright 2012 The Obvious Corporation.\n\n/*\n * bits: Bitwise buffer utilities. The utilities here treat a buffer\n * as a little-endian bigint, so the lowest-order bit is bit #0 of\n * `buffer[0]`, and the highest-order bit is bit #7 of\n * `buffer[buffer.length - 1]`.\n */\n\n/*\n * Modules used\n */\n\n/*\n * Exported bindings\n */\n\n/**\n * Extracts the given number of bits from the buffer at the indicated\n * index, returning a simple number as the result. If bits are requested\n * that aren't covered by the buffer, the `defaultBit` is used as their\n * value.\n *\n * The `bitLength` must be no more than 32. The `defaultBit` if not\n * specified is taken to be `0`.\n */\n\nfunction extract(buffer, bitIndex, bitLength, defaultBit) {\n if (bitLength < 0 || bitLength > 32) {\n throw new Error(\"Bad value for bitLength.\");\n }\n\n if (defaultBit === undefined) {\n defaultBit = 0;\n } else if (defaultBit !== 0 && defaultBit !== 1) {\n throw new Error(\"Bad value for defaultBit.\");\n }\n\n var defaultByte = defaultBit * 0xff;\n var result = 0; // All starts are inclusive. The {endByte, endBit} pair is exclusive, but\n // if endBit !== 0, then endByte is inclusive.\n\n var lastBit = bitIndex + bitLength;\n var startByte = Math.floor(bitIndex / 8);\n var startBit = bitIndex % 8;\n var endByte = Math.floor(lastBit / 8);\n var endBit = lastBit % 8;\n\n if (endBit !== 0) {\n // `(1 << endBit) - 1` is the mask of all bits up to but not including\n // the endBit.\n result = get(endByte) & (1 << endBit) - 1;\n }\n\n while (endByte > startByte) {\n endByte--;\n result = result << 8 | get(endByte);\n }\n\n result >>>= startBit;\n return result;\n\n function get(index) {\n var result = buffer[index];\n return result === undefined ? defaultByte : result;\n }\n}\n/**\n * Injects the given bits into the given buffer at the given index. Any\n * bits in the value beyond the length to set are ignored.\n */\n\nfunction inject(buffer, bitIndex, bitLength, value) {\n if (bitLength < 0 || bitLength > 32) {\n throw new Error(\"Bad value for bitLength.\");\n }\n\n var lastByte = Math.floor((bitIndex + bitLength - 1) / 8);\n\n if (bitIndex < 0 || lastByte >= buffer.length) {\n throw new Error(\"Index out of range.\");\n } // Just keeping it simple, until / unless profiling shows that this\n // is a problem.\n\n\n var atByte = Math.floor(bitIndex / 8);\n var atBit = bitIndex % 8;\n\n while (bitLength > 0) {\n if (value & 1) {\n buffer[atByte] |= 1 << atBit;\n } else {\n buffer[atByte] &= ~(1 << atBit);\n }\n\n value >>= 1;\n bitLength--;\n atBit = (atBit + 1) % 8;\n\n if (atBit === 0) {\n atByte++;\n }\n }\n}\n/**\n * Gets the sign bit of the given buffer.\n */\n\nfunction getSign(buffer) {\n return buffer[buffer.length - 1] >>> 7;\n}\n/**\n * Gets the zero-based bit number of the highest-order bit with the\n * given value in the given buffer.\n *\n * If the buffer consists entirely of the other bit value, then this returns\n * `-1`.\n */\n\nfunction highOrder(bit, buffer) {\n var length = buffer.length;\n var fullyWrongByte = (bit ^ 1) * 0xff; // the other-bit extended to a full byte\n\n while (length > 0 && buffer[length - 1] === fullyWrongByte) {\n length--;\n }\n\n if (length === 0) {\n // Degenerate case. The buffer consists entirely of ~bit.\n return -1;\n }\n\n var byteToCheck = buffer[length - 1];\n var result = length * 8 - 1;\n\n for (var i = 7; i > 0; i--) {\n if ((byteToCheck >> i & 1) === bit) {\n break;\n }\n\n result--;\n }\n\n return result;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/leb128/esm/bits.js?");
486+
487+/***/ }),
488+
489+/***/ "../node_modules/@webassemblyjs/leb128/esm/bufs.js":
490+/*!*********************************************************!*\
491+ !*** ../node_modules/@webassemblyjs/leb128/esm/bufs.js ***!
492+ \*********************************************************/
493+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
494+
495+"use strict";
496+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"alloc\": () => (/* binding */ alloc),\n/* harmony export */ \"free\": () => (/* binding */ free),\n/* harmony export */ \"readInt\": () => (/* binding */ readInt),\n/* harmony export */ \"readUInt\": () => (/* binding */ readUInt),\n/* harmony export */ \"resize\": () => (/* binding */ resize),\n/* harmony export */ \"writeInt64\": () => (/* binding */ writeInt64),\n/* harmony export */ \"writeUInt64\": () => (/* binding */ writeUInt64)\n/* harmony export */ });\n// Copyright 2012 The Obvious Corporation.\n\n/*\n * bufs: Buffer utilities.\n */\n\n/*\n * Module variables\n */\n\n/** Pool of buffers, where `bufPool[x].length === x`. */\nvar bufPool = [];\n/** Maximum length of kept temporary buffers. */\n\nvar TEMP_BUF_MAXIMUM_LENGTH = 20;\n/** Minimum exactly-representable 64-bit int. */\n\nvar MIN_EXACT_INT64 = -0x8000000000000000;\n/** Maximum exactly-representable 64-bit int. */\n\nvar MAX_EXACT_INT64 = 0x7ffffffffffffc00;\n/** Maximum exactly-representable 64-bit uint. */\n\nvar MAX_EXACT_UINT64 = 0xfffffffffffff800;\n/**\n * The int value consisting just of a 1 in bit #32 (that is, one more\n * than the maximum 32-bit unsigned value).\n */\n\nvar BIT_32 = 0x100000000;\n/**\n * The int value consisting just of a 1 in bit #64 (that is, one more\n * than the maximum 64-bit unsigned value).\n */\n\nvar BIT_64 = 0x10000000000000000;\n/*\n * Helper functions\n */\n\n/**\n * Masks off all but the lowest bit set of the given number.\n */\n\nfunction lowestBit(num) {\n return num & -num;\n}\n/**\n * Gets whether trying to add the second number to the first is lossy\n * (inexact). The first number is meant to be an accumulated result.\n */\n\n\nfunction isLossyToAdd(accum, num) {\n if (num === 0) {\n return false;\n }\n\n var lowBit = lowestBit(num);\n var added = accum + lowBit;\n\n if (added === accum) {\n return true;\n }\n\n if (added - lowBit !== accum) {\n return true;\n }\n\n return false;\n}\n/*\n * Exported functions\n */\n\n/**\n * Allocates a buffer of the given length, which is initialized\n * with all zeroes. This returns a buffer from the pool if it is\n * available, or a freshly-allocated buffer if not.\n */\n\n\nfunction alloc(length) {\n var result = bufPool[length];\n\n if (result) {\n bufPool[length] = undefined;\n } else {\n result = new Buffer(length);\n }\n\n result.fill(0);\n return result;\n}\n/**\n * Releases a buffer back to the pool.\n */\n\nfunction free(buffer) {\n var length = buffer.length;\n\n if (length < TEMP_BUF_MAXIMUM_LENGTH) {\n bufPool[length] = buffer;\n }\n}\n/**\n * Resizes a buffer, returning a new buffer. Returns the argument if\n * the length wouldn't actually change. This function is only safe to\n * use if the given buffer was allocated within this module (since\n * otherwise the buffer might possibly be shared externally).\n */\n\nfunction resize(buffer, length) {\n if (length === buffer.length) {\n return buffer;\n }\n\n var newBuf = alloc(length);\n buffer.copy(newBuf);\n free(buffer);\n return newBuf;\n}\n/**\n * Reads an arbitrary signed int from a buffer.\n */\n\nfunction readInt(buffer) {\n var length = buffer.length;\n var positive = buffer[length - 1] < 0x80;\n var result = positive ? 0 : -1;\n var lossy = false; // Note: We can't use bit manipulation here, since that stops\n // working if the result won't fit in a 32-bit int.\n\n if (length < 7) {\n // Common case which can't possibly be lossy (because the result has\n // no more than 48 bits, and loss only happens with 54 or more).\n for (var i = length - 1; i >= 0; i--) {\n result = result * 0x100 + buffer[i];\n }\n } else {\n for (var _i = length - 1; _i >= 0; _i--) {\n var one = buffer[_i];\n result *= 0x100;\n\n if (isLossyToAdd(result, one)) {\n lossy = true;\n }\n\n result += one;\n }\n }\n\n return {\n value: result,\n lossy: lossy\n };\n}\n/**\n * Reads an arbitrary unsigned int from a buffer.\n */\n\nfunction readUInt(buffer) {\n var length = buffer.length;\n var result = 0;\n var lossy = false; // Note: See above in re bit manipulation.\n\n if (length < 7) {\n // Common case which can't possibly be lossy (see above).\n for (var i = length - 1; i >= 0; i--) {\n result = result * 0x100 + buffer[i];\n }\n } else {\n for (var _i2 = length - 1; _i2 >= 0; _i2--) {\n var one = buffer[_i2];\n result *= 0x100;\n\n if (isLossyToAdd(result, one)) {\n lossy = true;\n }\n\n result += one;\n }\n }\n\n return {\n value: result,\n lossy: lossy\n };\n}\n/**\n * Writes a little-endian 64-bit signed int into a buffer.\n */\n\nfunction writeInt64(value, buffer) {\n if (value < MIN_EXACT_INT64 || value > MAX_EXACT_INT64) {\n throw new Error(\"Value out of range.\");\n }\n\n if (value < 0) {\n value += BIT_64;\n }\n\n writeUInt64(value, buffer);\n}\n/**\n * Writes a little-endian 64-bit unsigned int into a buffer.\n */\n\nfunction writeUInt64(value, buffer) {\n if (value < 0 || value > MAX_EXACT_UINT64) {\n throw new Error(\"Value out of range.\");\n }\n\n var lowWord = value % BIT_32;\n var highWord = Math.floor(value / BIT_32);\n buffer.writeUInt32LE(lowWord, 0);\n buffer.writeUInt32LE(highWord, 4);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/leb128/esm/bufs.js?");
497+
498+/***/ }),
499+
500+/***/ "../node_modules/@webassemblyjs/leb128/esm/index.js":
501+/*!**********************************************************!*\
502+ !*** ../node_modules/@webassemblyjs/leb128/esm/index.js ***!
503+ \**********************************************************/
504+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
505+
506+"use strict";
507+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"MAX_NUMBER_OF_BYTE_U32\": () => (/* binding */ MAX_NUMBER_OF_BYTE_U32),\n/* harmony export */ \"MAX_NUMBER_OF_BYTE_U64\": () => (/* binding */ MAX_NUMBER_OF_BYTE_U64),\n/* harmony export */ \"decodeInt32\": () => (/* binding */ decodeInt32),\n/* harmony export */ \"decodeInt64\": () => (/* binding */ decodeInt64),\n/* harmony export */ \"decodeUInt32\": () => (/* binding */ decodeUInt32),\n/* harmony export */ \"decodeUInt64\": () => (/* binding */ decodeUInt64),\n/* harmony export */ \"encodeI32\": () => (/* binding */ encodeI32),\n/* harmony export */ \"encodeI64\": () => (/* binding */ encodeI64),\n/* harmony export */ \"encodeU32\": () => (/* binding */ encodeU32)\n/* harmony export */ });\n/* harmony import */ var _leb__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./leb */ \"../node_modules/@webassemblyjs/leb128/esm/leb.js\");\n\n/**\n * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int\n * max = ceil(32/7)\n */\n\nvar MAX_NUMBER_OF_BYTE_U32 = 5;\n/**\n * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int\n * max = ceil(64/7)\n */\n\nvar MAX_NUMBER_OF_BYTE_U64 = 10;\nfunction decodeInt64(encodedBuffer, index) {\n return _leb__WEBPACK_IMPORTED_MODULE_0__[\"default\"].decodeInt64(encodedBuffer, index);\n}\nfunction decodeUInt64(encodedBuffer, index) {\n return _leb__WEBPACK_IMPORTED_MODULE_0__[\"default\"].decodeUInt64(encodedBuffer, index);\n}\nfunction decodeInt32(encodedBuffer, index) {\n return _leb__WEBPACK_IMPORTED_MODULE_0__[\"default\"].decodeInt32(encodedBuffer, index);\n}\nfunction decodeUInt32(encodedBuffer, index) {\n return _leb__WEBPACK_IMPORTED_MODULE_0__[\"default\"].decodeUInt32(encodedBuffer, index);\n}\nfunction encodeU32(v) {\n return _leb__WEBPACK_IMPORTED_MODULE_0__[\"default\"].encodeUInt32(v);\n}\nfunction encodeI32(v) {\n return _leb__WEBPACK_IMPORTED_MODULE_0__[\"default\"].encodeInt32(v);\n}\nfunction encodeI64(v) {\n return _leb__WEBPACK_IMPORTED_MODULE_0__[\"default\"].encodeInt64(v);\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/leb128/esm/index.js?");
508+
509+/***/ }),
510+
511+/***/ "../node_modules/@webassemblyjs/leb128/esm/leb.js":
512+/*!********************************************************!*\
513+ !*** ../node_modules/@webassemblyjs/leb128/esm/leb.js ***!
514+ \********************************************************/
515+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
516+
517+"use strict";
518+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _xtuc_long__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @xtuc/long */ \"../node_modules/@xtuc/long/src/long.js\");\n/* harmony import */ var _xtuc_long__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_xtuc_long__WEBPACK_IMPORTED_MODULE_0__);\n/* harmony import */ var _bits__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./bits */ \"../node_modules/@webassemblyjs/leb128/esm/bits.js\");\n/* harmony import */ var _bufs__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./bufs */ \"../node_modules/@webassemblyjs/leb128/esm/bufs.js\");\n// Copyright 2012 The Obvious Corporation.\n\n/*\n * leb: LEB128 utilities.\n */\n\n/*\n * Modules used\n */\n\n\n\n\n\n/*\n * Module variables\n */\n\n/** The minimum possible 32-bit signed int. */\n\nvar MIN_INT32 = -0x80000000;\n/** The maximum possible 32-bit signed int. */\n\nvar MAX_INT32 = 0x7fffffff;\n/** The maximum possible 32-bit unsigned int. */\n\nvar MAX_UINT32 = 0xffffffff;\n/** The minimum possible 64-bit signed int. */\n// const MIN_INT64 = -0x8000000000000000;\n\n/**\n * The maximum possible 64-bit signed int that is representable as a\n * JavaScript number.\n */\n// const MAX_INT64 = 0x7ffffffffffffc00;\n\n/**\n * The maximum possible 64-bit unsigned int that is representable as a\n * JavaScript number.\n */\n// const MAX_UINT64 = 0xfffffffffffff800;\n\n/*\n * Helper functions\n */\n\n/**\n * Determines the number of bits required to encode the number\n * represented in the given buffer as a signed value. The buffer is\n * taken to represent a signed number in little-endian form.\n *\n * The number of bits to encode is the (zero-based) bit number of the\n * highest-order non-sign-matching bit, plus two. For example:\n *\n * 11111011 01110101\n * high low\n *\n * The sign bit here is 1 (that is, it's a negative number). The highest\n * bit number that doesn't match the sign is bit #10 (where the lowest-order\n * bit is bit #0). So, we have to encode at least 12 bits total.\n *\n * As a special degenerate case, the numbers 0 and -1 each require just one bit.\n */\n\nfunction signedBitCount(buffer) {\n return _bits__WEBPACK_IMPORTED_MODULE_1__.highOrder(_bits__WEBPACK_IMPORTED_MODULE_1__.getSign(buffer) ^ 1, buffer) + 2;\n}\n/**\n * Determines the number of bits required to encode the number\n * represented in the given buffer as an unsigned value. The buffer is\n * taken to represent an unsigned number in little-endian form.\n *\n * The number of bits to encode is the (zero-based) bit number of the\n * highest-order 1 bit, plus one. For example:\n *\n * 00011000 01010011\n * high low\n *\n * The highest-order 1 bit here is bit #12 (where the lowest-order bit\n * is bit #0). So, we have to encode at least 13 bits total.\n *\n * As a special degenerate case, the number 0 requires 1 bit.\n */\n\n\nfunction unsignedBitCount(buffer) {\n var result = _bits__WEBPACK_IMPORTED_MODULE_1__.highOrder(1, buffer) + 1;\n return result ? result : 1;\n}\n/**\n * Common encoder for both signed and unsigned ints. This takes a\n * bigint-ish buffer, returning an LEB128-encoded buffer.\n */\n\n\nfunction encodeBufferCommon(buffer, signed) {\n var signBit;\n var bitCount;\n\n if (signed) {\n signBit = _bits__WEBPACK_IMPORTED_MODULE_1__.getSign(buffer);\n bitCount = signedBitCount(buffer);\n } else {\n signBit = 0;\n bitCount = unsignedBitCount(buffer);\n }\n\n var byteCount = Math.ceil(bitCount / 7);\n var result = _bufs__WEBPACK_IMPORTED_MODULE_2__.alloc(byteCount);\n\n for (var i = 0; i < byteCount; i++) {\n var payload = _bits__WEBPACK_IMPORTED_MODULE_1__.extract(buffer, i * 7, 7, signBit);\n result[i] = payload | 0x80;\n } // Mask off the top bit of the last byte, to indicate the end of the\n // encoding.\n\n\n result[byteCount - 1] &= 0x7f;\n return result;\n}\n/**\n * Gets the byte-length of the value encoded in the given buffer at\n * the given index.\n */\n\n\nfunction encodedLength(encodedBuffer, index) {\n var result = 0;\n\n while (encodedBuffer[index + result] >= 0x80) {\n result++;\n }\n\n result++; // to account for the last byte\n\n if (index + result > encodedBuffer.length) {// FIXME(sven): seems to cause false positives\n // throw new Error(\"integer representation too long\");\n }\n\n return result;\n}\n/**\n * Common decoder for both signed and unsigned ints. This takes an\n * LEB128-encoded buffer, returning a bigint-ish buffer.\n */\n\n\nfunction decodeBufferCommon(encodedBuffer, index, signed) {\n index = index === undefined ? 0 : index;\n var length = encodedLength(encodedBuffer, index);\n var bitLength = length * 7;\n var byteLength = Math.ceil(bitLength / 8);\n var result = _bufs__WEBPACK_IMPORTED_MODULE_2__.alloc(byteLength);\n var outIndex = 0;\n\n while (length > 0) {\n _bits__WEBPACK_IMPORTED_MODULE_1__.inject(result, outIndex, 7, encodedBuffer[index]);\n outIndex += 7;\n index++;\n length--;\n }\n\n var signBit;\n var signByte;\n\n if (signed) {\n // Sign-extend the last byte.\n var lastByte = result[byteLength - 1];\n var endBit = outIndex % 8;\n\n if (endBit !== 0) {\n var shift = 32 - endBit; // 32 because JS bit ops work on 32-bit ints.\n\n lastByte = result[byteLength - 1] = lastByte << shift >> shift & 0xff;\n }\n\n signBit = lastByte >> 7;\n signByte = signBit * 0xff;\n } else {\n signBit = 0;\n signByte = 0;\n } // Slice off any superfluous bytes, that is, ones that add no meaningful\n // bits (because the value would be the same if they were removed).\n\n\n while (byteLength > 1 && result[byteLength - 1] === signByte && (!signed || result[byteLength - 2] >> 7 === signBit)) {\n byteLength--;\n }\n\n result = _bufs__WEBPACK_IMPORTED_MODULE_2__.resize(result, byteLength);\n return {\n value: result,\n nextIndex: index\n };\n}\n/*\n * Exported bindings\n */\n\n\nfunction encodeIntBuffer(buffer) {\n return encodeBufferCommon(buffer, true);\n}\n\nfunction decodeIntBuffer(encodedBuffer, index) {\n return decodeBufferCommon(encodedBuffer, index, true);\n}\n\nfunction encodeInt32(num) {\n var buf = _bufs__WEBPACK_IMPORTED_MODULE_2__.alloc(4);\n buf.writeInt32LE(num, 0);\n var result = encodeIntBuffer(buf);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(buf);\n return result;\n}\n\nfunction decodeInt32(encodedBuffer, index) {\n var result = decodeIntBuffer(encodedBuffer, index);\n var parsed = _bufs__WEBPACK_IMPORTED_MODULE_2__.readInt(result.value);\n var value = parsed.value;\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(result.value);\n\n if (value < MIN_INT32 || value > MAX_INT32) {\n throw new Error(\"integer too large\");\n }\n\n return {\n value: value,\n nextIndex: result.nextIndex\n };\n}\n\nfunction encodeInt64(num) {\n var buf = _bufs__WEBPACK_IMPORTED_MODULE_2__.alloc(8);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.writeInt64(num, buf);\n var result = encodeIntBuffer(buf);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(buf);\n return result;\n}\n\nfunction decodeInt64(encodedBuffer, index) {\n var result = decodeIntBuffer(encodedBuffer, index);\n var value = _xtuc_long__WEBPACK_IMPORTED_MODULE_0___default().fromBytesLE(result.value, false);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(result.value);\n return {\n value: value,\n nextIndex: result.nextIndex,\n lossy: false\n };\n}\n\nfunction encodeUIntBuffer(buffer) {\n return encodeBufferCommon(buffer, false);\n}\n\nfunction decodeUIntBuffer(encodedBuffer, index) {\n return decodeBufferCommon(encodedBuffer, index, false);\n}\n\nfunction encodeUInt32(num) {\n var buf = _bufs__WEBPACK_IMPORTED_MODULE_2__.alloc(4);\n buf.writeUInt32LE(num, 0);\n var result = encodeUIntBuffer(buf);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(buf);\n return result;\n}\n\nfunction decodeUInt32(encodedBuffer, index) {\n var result = decodeUIntBuffer(encodedBuffer, index);\n var parsed = _bufs__WEBPACK_IMPORTED_MODULE_2__.readUInt(result.value);\n var value = parsed.value;\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(result.value);\n\n if (value > MAX_UINT32) {\n throw new Error(\"integer too large\");\n }\n\n return {\n value: value,\n nextIndex: result.nextIndex\n };\n}\n\nfunction encodeUInt64(num) {\n var buf = _bufs__WEBPACK_IMPORTED_MODULE_2__.alloc(8);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.writeUInt64(num, buf);\n var result = encodeUIntBuffer(buf);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(buf);\n return result;\n}\n\nfunction decodeUInt64(encodedBuffer, index) {\n var result = decodeUIntBuffer(encodedBuffer, index);\n var value = _xtuc_long__WEBPACK_IMPORTED_MODULE_0___default().fromBytesLE(result.value, true);\n _bufs__WEBPACK_IMPORTED_MODULE_2__.free(result.value);\n return {\n value: value,\n nextIndex: result.nextIndex,\n lossy: false\n };\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = ({\n decodeInt32: decodeInt32,\n decodeInt64: decodeInt64,\n decodeIntBuffer: decodeIntBuffer,\n decodeUInt32: decodeUInt32,\n decodeUInt64: decodeUInt64,\n decodeUIntBuffer: decodeUIntBuffer,\n encodeInt32: encodeInt32,\n encodeInt64: encodeInt64,\n encodeIntBuffer: encodeIntBuffer,\n encodeUInt32: encodeUInt32,\n encodeUInt64: encodeUInt64,\n encodeUIntBuffer: encodeUIntBuffer\n});\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/leb128/esm/leb.js?");
519+
520+/***/ }),
521+
522+/***/ "../node_modules/@webassemblyjs/utf8/esm/decoder.js":
523+/*!**********************************************************!*\
524+ !*** ../node_modules/@webassemblyjs/utf8/esm/decoder.js ***!
525+ \**********************************************************/
526+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
527+
528+"use strict";
529+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"decode\": () => (/* binding */ decode)\n/* harmony export */ });\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nfunction _toArray(arr) { return Array.isArray(arr) ? arr : Array.from(arr); }\n\nfunction con(b) {\n if ((b & 0xc0) === 0x80) {\n return b & 0x3f;\n } else {\n throw new Error(\"invalid UTF-8 encoding\");\n }\n}\n\nfunction code(min, n) {\n if (n < min || 0xd800 <= n && n < 0xe000 || n >= 0x10000) {\n throw new Error(\"invalid UTF-8 encoding\");\n } else {\n return n;\n }\n}\n\nfunction decode(bytes) {\n return _decode(bytes).map(function (x) {\n return String.fromCharCode(x);\n }).join(\"\");\n}\n\nfunction _decode(bytes) {\n if (bytes.length === 0) {\n return [];\n }\n /**\n * 1 byte\n */\n\n\n {\n var _bytes = _toArray(bytes),\n b1 = _bytes[0],\n bs = _bytes.slice(1);\n\n if (b1 < 0x80) {\n return [code(0x0, b1)].concat(_toConsumableArray(_decode(bs)));\n }\n\n if (b1 < 0xc0) {\n throw new Error(\"invalid UTF-8 encoding\");\n }\n }\n /**\n * 2 bytes\n */\n\n {\n var _bytes2 = _toArray(bytes),\n _b = _bytes2[0],\n b2 = _bytes2[1],\n _bs = _bytes2.slice(2);\n\n if (_b < 0xe0) {\n return [code(0x80, ((_b & 0x1f) << 6) + con(b2))].concat(_toConsumableArray(_decode(_bs)));\n }\n }\n /**\n * 3 bytes\n */\n\n {\n var _bytes3 = _toArray(bytes),\n _b2 = _bytes3[0],\n _b3 = _bytes3[1],\n b3 = _bytes3[2],\n _bs2 = _bytes3.slice(3);\n\n if (_b2 < 0xf0) {\n return [code(0x800, ((_b2 & 0x0f) << 12) + (con(_b3) << 6) + con(b3))].concat(_toConsumableArray(_decode(_bs2)));\n }\n }\n /**\n * 4 bytes\n */\n\n {\n var _bytes4 = _toArray(bytes),\n _b4 = _bytes4[0],\n _b5 = _bytes4[1],\n _b6 = _bytes4[2],\n b4 = _bytes4[3],\n _bs3 = _bytes4.slice(4);\n\n if (_b4 < 0xf8) {\n return [code(0x10000, (((_b4 & 0x07) << 18) + con(_b5) << 12) + (con(_b6) << 6) + con(b4))].concat(_toConsumableArray(_decode(_bs3)));\n }\n }\n throw new Error(\"invalid UTF-8 encoding\");\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/utf8/esm/decoder.js?");
530+
531+/***/ }),
532+
533+/***/ "../node_modules/@webassemblyjs/utf8/esm/encoder.js":
534+/*!**********************************************************!*\
535+ !*** ../node_modules/@webassemblyjs/utf8/esm/encoder.js ***!
536+ \**********************************************************/
537+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
538+
539+"use strict";
540+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"encode\": () => (/* binding */ encode)\n/* harmony export */ });\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nfunction _toArray(arr) { return Array.isArray(arr) ? arr : Array.from(arr); }\n\nfunction con(n) {\n return 0x80 | n & 0x3f;\n}\n\nfunction encode(str) {\n var arr = str.split(\"\").map(function (x) {\n return x.charCodeAt(0);\n });\n return _encode(arr);\n}\n\nfunction _encode(arr) {\n if (arr.length === 0) {\n return [];\n }\n\n var _arr = _toArray(arr),\n n = _arr[0],\n ns = _arr.slice(1);\n\n if (n < 0) {\n throw new Error(\"utf8\");\n }\n\n if (n < 0x80) {\n return [n].concat(_toConsumableArray(_encode(ns)));\n }\n\n if (n < 0x800) {\n return [0xc0 | n >>> 6, con(n)].concat(_toConsumableArray(_encode(ns)));\n }\n\n if (n < 0x10000) {\n return [0xe0 | n >>> 12, con(n >>> 6), con(n)].concat(_toConsumableArray(_encode(ns)));\n }\n\n if (n < 0x110000) {\n return [0xf0 | n >>> 18, con(n >>> 12), con(n >>> 6), con(n)].concat(_toConsumableArray(_encode(ns)));\n }\n\n throw new Error(\"utf8\");\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/utf8/esm/encoder.js?");
541+
542+/***/ }),
543+
544+/***/ "../node_modules/@webassemblyjs/utf8/esm/index.js":
545+/*!********************************************************!*\
546+ !*** ../node_modules/@webassemblyjs/utf8/esm/index.js ***!
547+ \********************************************************/
548+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
549+
550+"use strict";
551+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"decode\": () => (/* reexport safe */ _decoder__WEBPACK_IMPORTED_MODULE_0__.decode),\n/* harmony export */ \"encode\": () => (/* reexport safe */ _encoder__WEBPACK_IMPORTED_MODULE_1__.encode)\n/* harmony export */ });\n/* harmony import */ var _decoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./decoder */ \"../node_modules/@webassemblyjs/utf8/esm/decoder.js\");\n/* harmony import */ var _encoder__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./encoder */ \"../node_modules/@webassemblyjs/utf8/esm/encoder.js\");\n\n\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/utf8/esm/index.js?");
552+
553+/***/ }),
554+
555+/***/ "../node_modules/@webassemblyjs/wasm-edit/esm/apply.js":
556+/*!*************************************************************!*\
557+ !*** ../node_modules/@webassemblyjs/wasm-edit/esm/apply.js ***!
558+ \*************************************************************/
559+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
560+
561+"use strict";
562+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"applyOperations\": () => (/* binding */ applyOperations)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/wasm-gen */ \"../node_modules/@webassemblyjs/wasm-gen/esm/index.js\");\n/* harmony import */ var _webassemblyjs_wasm_gen_lib_encoder__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/wasm-gen/lib/encoder */ \"../node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js\");\n/* harmony import */ var _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/ast */ \"../node_modules/@webassemblyjs/ast/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_wasm_section__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @webassemblyjs/helper-wasm-section */ \"../node_modules/@webassemblyjs/helper-wasm-section/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @webassemblyjs/helper-buffer */ \"../node_modules/@webassemblyjs/helper-buffer/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @webassemblyjs/helper-wasm-bytecode */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js\");\nfunction _sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _slicedToArray(arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return _sliceIterator(arr, i); } else { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); } }\n\n\n\n\n\n\n\n\nfunction shiftLocNodeByDelta(node, delta) {\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.assertHasLoc)(node); // $FlowIgnore: assertHasLoc ensures that\n\n node.loc.start.column += delta; // $FlowIgnore: assertHasLoc ensures that\n\n node.loc.end.column += delta;\n}\n\nfunction applyUpdate(ast, uint8Buffer, _ref) {\n var _ref2 = _slicedToArray(_ref, 2),\n oldNode = _ref2[0],\n newNode = _ref2[1];\n\n var deltaElements = 0;\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.assertHasLoc)(oldNode);\n var sectionName = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__.getSectionForNode)(newNode);\n var replacementByteArray = (0,_webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__.encodeNode)(newNode);\n /**\n * Replace new node as bytes\n */\n\n uint8Buffer = (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_4__.overrideBytesInBuffer)(uint8Buffer, // $FlowIgnore: assertHasLoc ensures that\n oldNode.loc.start.column, // $FlowIgnore: assertHasLoc ensures that\n oldNode.loc.end.column, replacementByteArray);\n /**\n * Update function body size if needed\n */\n\n if (sectionName === \"code\") {\n // Find the parent func\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.traverse)(ast, {\n Func: function Func(_ref3) {\n var node = _ref3.node;\n var funcHasThisIntr = node.body.find(function (n) {\n return n === newNode;\n }) !== undefined; // Update func's body size if needed\n\n if (funcHasThisIntr === true) {\n // These are the old functions locations informations\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.assertHasLoc)(node);\n var oldNodeSize = (0,_webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__.encodeNode)(oldNode).length;\n var bodySizeDeltaBytes = replacementByteArray.length - oldNodeSize;\n\n if (bodySizeDeltaBytes !== 0) {\n var newValue = node.metadata.bodySize + bodySizeDeltaBytes;\n var newByteArray = (0,_webassemblyjs_wasm_gen_lib_encoder__WEBPACK_IMPORTED_MODULE_1__.encodeU32)(newValue); // function body size byte\n // FIXME(sven): only handles one byte u32\n\n var start = node.loc.start.column;\n var end = start + 1;\n uint8Buffer = (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_4__.overrideBytesInBuffer)(uint8Buffer, start, end, newByteArray);\n }\n }\n }\n });\n }\n /**\n * Update section size\n */\n\n\n var deltaBytes = replacementByteArray.length - ( // $FlowIgnore: assertHasLoc ensures that\n oldNode.loc.end.column - oldNode.loc.start.column); // Init location informations\n\n newNode.loc = {\n start: {\n line: -1,\n column: -1\n },\n end: {\n line: -1,\n column: -1\n }\n }; // Update new node end position\n // $FlowIgnore: assertHasLoc ensures that\n\n newNode.loc.start.column = oldNode.loc.start.column; // $FlowIgnore: assertHasLoc ensures that\n\n newNode.loc.end.column = // $FlowIgnore: assertHasLoc ensures that\n oldNode.loc.start.column + replacementByteArray.length;\n return {\n uint8Buffer: uint8Buffer,\n deltaBytes: deltaBytes,\n deltaElements: deltaElements\n };\n}\n\nfunction applyDelete(ast, uint8Buffer, node) {\n var deltaElements = -1; // since we removed an element\n\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.assertHasLoc)(node);\n var sectionName = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__.getSectionForNode)(node);\n\n if (sectionName === \"start\") {\n var sectionMetadata = (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.getSectionMetadata)(ast, \"start\");\n /**\n * The start section only contains one element,\n * we need to remove the whole section\n */\n\n uint8Buffer = (0,_webassemblyjs_helper_wasm_section__WEBPACK_IMPORTED_MODULE_3__.removeSections)(ast, uint8Buffer, \"start\");\n\n var _deltaBytes = -(sectionMetadata.size.value + 1);\n /* section id */\n\n\n return {\n uint8Buffer: uint8Buffer,\n deltaBytes: _deltaBytes,\n deltaElements: deltaElements\n };\n } // replacement is nothing\n\n\n var replacement = [];\n uint8Buffer = (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_4__.overrideBytesInBuffer)(uint8Buffer, // $FlowIgnore: assertHasLoc ensures that\n node.loc.start.column, // $FlowIgnore: assertHasLoc ensures that\n node.loc.end.column, replacement);\n /**\n * Update section\n */\n // $FlowIgnore: assertHasLoc ensures that\n\n var deltaBytes = -(node.loc.end.column - node.loc.start.column);\n return {\n uint8Buffer: uint8Buffer,\n deltaBytes: deltaBytes,\n deltaElements: deltaElements\n };\n}\n\nfunction applyAdd(ast, uint8Buffer, node) {\n var deltaElements = +1; // since we added an element\n\n var sectionName = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__.getSectionForNode)(node);\n var sectionMetadata = (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.getSectionMetadata)(ast, sectionName); // Section doesn't exists, we create an empty one\n\n if (typeof sectionMetadata === \"undefined\") {\n var res = (0,_webassemblyjs_helper_wasm_section__WEBPACK_IMPORTED_MODULE_3__.createEmptySection)(ast, uint8Buffer, sectionName);\n uint8Buffer = res.uint8Buffer;\n sectionMetadata = res.sectionMetadata;\n }\n /**\n * check that the expressions were ended\n */\n\n\n if ((0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.isFunc)(node)) {\n // $FlowIgnore\n var body = node.body;\n\n if (body.length === 0 || body[body.length - 1].id !== \"end\") {\n throw new Error(\"expressions must be ended\");\n }\n }\n\n if ((0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.isGlobal)(node)) {\n // $FlowIgnore\n var body = node.init;\n\n if (body.length === 0 || body[body.length - 1].id !== \"end\") {\n throw new Error(\"expressions must be ended\");\n }\n }\n /**\n * Add nodes\n */\n\n\n var newByteArray = (0,_webassemblyjs_wasm_gen__WEBPACK_IMPORTED_MODULE_0__.encodeNode)(node); // The size of the section doesn't include the storage of the size itself\n // we need to manually add it here\n\n var start = (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.getEndOfSection)(sectionMetadata);\n var end = start;\n /**\n * Update section\n */\n\n var deltaBytes = newByteArray.length;\n uint8Buffer = (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_4__.overrideBytesInBuffer)(uint8Buffer, start, end, newByteArray);\n node.loc = {\n start: {\n line: -1,\n column: start\n },\n end: {\n line: -1,\n column: start + deltaBytes\n }\n }; // for func add the additional metadata in the AST\n\n if (node.type === \"Func\") {\n // the size is the first byte\n // FIXME(sven): handle LEB128 correctly here\n var bodySize = newByteArray[0];\n node.metadata = {\n bodySize: bodySize\n };\n }\n\n if (node.type !== \"IndexInFuncSection\") {\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_2__.orderedInsertNode)(ast.body[0], node);\n }\n\n return {\n uint8Buffer: uint8Buffer,\n deltaBytes: deltaBytes,\n deltaElements: deltaElements\n };\n}\n\nfunction applyOperations(ast, uint8Buffer, ops) {\n ops.forEach(function (op) {\n var state;\n var sectionName;\n\n switch (op.kind) {\n case \"update\":\n state = applyUpdate(ast, uint8Buffer, [op.oldNode, op.node]);\n sectionName = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__.getSectionForNode)(op.node);\n break;\n\n case \"delete\":\n state = applyDelete(ast, uint8Buffer, op.node);\n sectionName = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__.getSectionForNode)(op.node);\n break;\n\n case \"add\":\n state = applyAdd(ast, uint8Buffer, op.node);\n sectionName = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__.getSectionForNode)(op.node);\n break;\n\n default:\n throw new Error(\"Unknown operation\");\n }\n /**\n * Resize section vec size.\n * If the length of the LEB-encoded size changes, this can change\n * the byte length of the section and the offset for nodes in the\n * section. So we do this first before resizing section byte size\n * or shifting following operations' nodes.\n */\n\n\n if (state.deltaElements !== 0 && sectionName !== \"start\") {\n var oldBufferLength = state.uint8Buffer.length;\n state.uint8Buffer = (0,_webassemblyjs_helper_wasm_section__WEBPACK_IMPORTED_MODULE_3__.resizeSectionVecSize)(ast, state.uint8Buffer, sectionName, state.deltaElements); // Infer bytes added/removed by comparing buffer lengths\n\n state.deltaBytes += state.uint8Buffer.length - oldBufferLength;\n }\n /**\n * Resize section byte size.\n * If the length of the LEB-encoded size changes, this can change\n * the offset for nodes in the section. So we do this before\n * shifting following operations' nodes.\n */\n\n\n if (state.deltaBytes !== 0 && sectionName !== \"start\") {\n var _oldBufferLength = state.uint8Buffer.length;\n state.uint8Buffer = (0,_webassemblyjs_helper_wasm_section__WEBPACK_IMPORTED_MODULE_3__.resizeSectionByteSize)(ast, state.uint8Buffer, sectionName, state.deltaBytes); // Infer bytes added/removed by comparing buffer lengths\n\n state.deltaBytes += state.uint8Buffer.length - _oldBufferLength;\n }\n /**\n * Shift following operation's nodes\n */\n\n\n if (state.deltaBytes !== 0) {\n ops.forEach(function (op) {\n // We don't need to handle add ops, they are positioning independent\n switch (op.kind) {\n case \"update\":\n shiftLocNodeByDelta(op.oldNode, state.deltaBytes);\n break;\n\n case \"delete\":\n shiftLocNodeByDelta(op.node, state.deltaBytes);\n break;\n }\n });\n }\n\n uint8Buffer = state.uint8Buffer;\n });\n return uint8Buffer;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-edit/esm/apply.js?");
563+
564+/***/ }),
565+
566+/***/ "../node_modules/@webassemblyjs/wasm-edit/esm/index.js":
567+/*!*************************************************************!*\
568+ !*** ../node_modules/@webassemblyjs/wasm-edit/esm/index.js ***!
569+ \*************************************************************/
570+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
571+
572+"use strict";
573+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"add\": () => (/* binding */ add),\n/* harmony export */ \"addWithAST\": () => (/* binding */ addWithAST),\n/* harmony export */ \"edit\": () => (/* binding */ edit),\n/* harmony export */ \"editWithAST\": () => (/* binding */ editWithAST)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_wasm_parser__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/wasm-parser */ \"../node_modules/@webassemblyjs/wasm-parser/esm/index.js\");\n/* harmony import */ var _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/ast */ \"../node_modules/@webassemblyjs/ast/esm/index.js\");\n/* harmony import */ var _webassemblyjs_ast_lib_clone__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/ast/lib/clone */ \"../node_modules/@webassemblyjs/ast/lib/clone.js\");\n/* harmony import */ var _webassemblyjs_wasm_opt__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @webassemblyjs/wasm-opt */ \"../node_modules/@webassemblyjs/wasm-opt/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @webassemblyjs/helper-wasm-bytecode */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js\");\n/* harmony import */ var _apply__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./apply */ \"../node_modules/@webassemblyjs/wasm-edit/esm/apply.js\");\n\n\n\n\n\n\n\n\nfunction hashNode(node) {\n return JSON.stringify(node);\n}\n\nfunction preprocess(ab) {\n var optBin = (0,_webassemblyjs_wasm_opt__WEBPACK_IMPORTED_MODULE_3__.shrinkPaddedLEB128)(new Uint8Array(ab));\n return optBin.buffer;\n}\n\nfunction sortBySectionOrder(nodes) {\n var originalOrder = new Map();\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = nodes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var _node = _step.value;\n originalOrder.set(_node, originalOrder.size);\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n nodes.sort(function (a, b) {\n var sectionA = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_4__.getSectionForNode)(a);\n var sectionB = (0,_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_4__.getSectionForNode)(b);\n var aId = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_4__[\"default\"].sections[sectionA];\n var bId = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_4__[\"default\"].sections[sectionB];\n\n if (typeof aId !== \"number\" || typeof bId !== \"number\") {\n throw new Error(\"Section id not found\");\n }\n\n if (aId === bId) {\n // $FlowIgnore originalOrder is filled for all nodes\n return originalOrder.get(a) - originalOrder.get(b);\n }\n\n return aId - bId;\n });\n}\n\nfunction edit(ab, visitors) {\n ab = preprocess(ab);\n var ast = (0,_webassemblyjs_wasm_parser__WEBPACK_IMPORTED_MODULE_0__.decode)(ab);\n return editWithAST(ast, ab, visitors);\n}\nfunction editWithAST(ast, ab, visitors) {\n var operations = [];\n var uint8Buffer = new Uint8Array(ab);\n var nodeBefore;\n\n function before(type, path) {\n nodeBefore = (0,_webassemblyjs_ast_lib_clone__WEBPACK_IMPORTED_MODULE_2__.cloneNode)(path.node);\n }\n\n function after(type, path) {\n if (path.node._deleted === true) {\n operations.push({\n kind: \"delete\",\n node: path.node\n }); // $FlowIgnore\n } else if (hashNode(nodeBefore) !== hashNode(path.node)) {\n operations.push({\n kind: \"update\",\n oldNode: nodeBefore,\n node: path.node\n });\n }\n }\n\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_1__.traverse)(ast, visitors, before, after);\n uint8Buffer = (0,_apply__WEBPACK_IMPORTED_MODULE_5__.applyOperations)(ast, uint8Buffer, operations);\n return uint8Buffer.buffer;\n}\nfunction add(ab, newNodes) {\n ab = preprocess(ab);\n var ast = (0,_webassemblyjs_wasm_parser__WEBPACK_IMPORTED_MODULE_0__.decode)(ab);\n return addWithAST(ast, ab, newNodes);\n}\nfunction addWithAST(ast, ab, newNodes) {\n // Sort nodes by insertion order\n sortBySectionOrder(newNodes);\n var uint8Buffer = new Uint8Array(ab); // Map node into operations\n\n var operations = newNodes.map(function (n) {\n return {\n kind: \"add\",\n node: n\n };\n });\n uint8Buffer = (0,_apply__WEBPACK_IMPORTED_MODULE_5__.applyOperations)(ast, uint8Buffer, operations);\n return uint8Buffer.buffer;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-edit/esm/index.js?");
574+
575+/***/ }),
576+
577+/***/ "../node_modules/@webassemblyjs/wasm-gen/esm/encoder/index.js":
578+/*!********************************************************************!*\
579+ !*** ../node_modules/@webassemblyjs/wasm-gen/esm/encoder/index.js ***!
580+ \********************************************************************/
581+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
582+
583+"use strict";
584+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"encodeCallIndirectInstruction\": () => (/* binding */ encodeCallIndirectInstruction),\n/* harmony export */ \"encodeCallInstruction\": () => (/* binding */ encodeCallInstruction),\n/* harmony export */ \"encodeElem\": () => (/* binding */ encodeElem),\n/* harmony export */ \"encodeFuncBody\": () => (/* binding */ encodeFuncBody),\n/* harmony export */ \"encodeGlobal\": () => (/* binding */ encodeGlobal),\n/* harmony export */ \"encodeHeader\": () => (/* binding */ encodeHeader),\n/* harmony export */ \"encodeI32\": () => (/* binding */ encodeI32),\n/* harmony export */ \"encodeI64\": () => (/* binding */ encodeI64),\n/* harmony export */ \"encodeIndexInFuncSection\": () => (/* binding */ encodeIndexInFuncSection),\n/* harmony export */ \"encodeInstr\": () => (/* binding */ encodeInstr),\n/* harmony export */ \"encodeLimits\": () => (/* binding */ encodeLimits),\n/* harmony export */ \"encodeModuleExport\": () => (/* binding */ encodeModuleExport),\n/* harmony export */ \"encodeModuleImport\": () => (/* binding */ encodeModuleImport),\n/* harmony export */ \"encodeMutability\": () => (/* binding */ encodeMutability),\n/* harmony export */ \"encodeSectionMetadata\": () => (/* binding */ encodeSectionMetadata),\n/* harmony export */ \"encodeStringLiteral\": () => (/* binding */ encodeStringLiteral),\n/* harmony export */ \"encodeTypeInstruction\": () => (/* binding */ encodeTypeInstruction),\n/* harmony export */ \"encodeU32\": () => (/* binding */ encodeU32),\n/* harmony export */ \"encodeUTF8Vec\": () => (/* binding */ encodeUTF8Vec),\n/* harmony export */ \"encodeValtype\": () => (/* binding */ encodeValtype),\n/* harmony export */ \"encodeVec\": () => (/* binding */ encodeVec),\n/* harmony export */ \"encodeVersion\": () => (/* binding */ encodeVersion)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/leb128 */ \"../node_modules/@webassemblyjs/leb128/esm/index.js\");\n/* harmony import */ var _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/ieee754 */ \"../node_modules/@webassemblyjs/ieee754/esm/index.js\");\n/* harmony import */ var _webassemblyjs_utf8__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/utf8 */ \"../node_modules/@webassemblyjs/utf8/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @webassemblyjs/helper-wasm-bytecode */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js\");\n/* harmony import */ var _index__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../index */ \"../node_modules/@webassemblyjs/wasm-gen/esm/index.js\");\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\n\n\n\n\n\n\nfunction assertNotIdentifierNode(n) {\n if (n.type === \"Identifier\") {\n throw new Error(\"Unsupported node Identifier\");\n }\n}\n\nfunction encodeVersion(v) {\n var bytes = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__[\"default\"].moduleVersion;\n bytes[0] = v;\n return bytes;\n}\nfunction encodeHeader() {\n return _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__[\"default\"].magicModuleHeader;\n}\nfunction encodeU32(v) {\n var uint8view = new Uint8Array(_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_0__.encodeU32(v));\n\n var array = _toConsumableArray(uint8view);\n\n return array;\n}\nfunction encodeI32(v) {\n var uint8view = new Uint8Array(_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_0__.encodeI32(v));\n\n var array = _toConsumableArray(uint8view);\n\n return array;\n}\nfunction encodeI64(v) {\n var uint8view = new Uint8Array(_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_0__.encodeI64(v));\n\n var array = _toConsumableArray(uint8view);\n\n return array;\n}\nfunction encodeVec(elements) {\n var size = encodeU32(elements.length);\n return _toConsumableArray(size).concat(_toConsumableArray(elements));\n}\nfunction encodeValtype(v) {\n var byte = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__[\"default\"].valtypesByString[v];\n\n if (typeof byte === \"undefined\") {\n throw new Error(\"Unknown valtype: \" + v);\n }\n\n return parseInt(byte, 10);\n}\nfunction encodeMutability(v) {\n var byte = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__[\"default\"].globalTypesByString[v];\n\n if (typeof byte === \"undefined\") {\n throw new Error(\"Unknown mutability: \" + v);\n }\n\n return parseInt(byte, 10);\n}\nfunction encodeUTF8Vec(str) {\n return encodeVec(_webassemblyjs_utf8__WEBPACK_IMPORTED_MODULE_2__.encode(str));\n}\nfunction encodeLimits(n) {\n var out = [];\n\n if (typeof n.max === \"number\") {\n out.push(0x01);\n out.push.apply(out, _toConsumableArray(encodeU32(n.min))); // $FlowIgnore: ensured by the typeof\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.max)));\n } else {\n out.push(0x00);\n out.push.apply(out, _toConsumableArray(encodeU32(n.min)));\n }\n\n return out;\n}\nfunction encodeModuleImport(n) {\n var out = [];\n out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.module)));\n out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));\n\n switch (n.descr.type) {\n case \"GlobalType\":\n {\n out.push(0x03); // $FlowIgnore: GlobalType ensure that these props exists\n\n out.push(encodeValtype(n.descr.valtype)); // $FlowIgnore: GlobalType ensure that these props exists\n\n out.push(encodeMutability(n.descr.mutability));\n break;\n }\n\n case \"Memory\":\n {\n out.push(0x02); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));\n break;\n }\n\n case \"Table\":\n {\n out.push(0x01);\n out.push(0x70); // element type\n // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));\n break;\n }\n\n case \"FuncImportDescr\":\n {\n out.push(0x00); // $FlowIgnore\n\n assertNotIdentifierNode(n.descr.id); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));\n break;\n }\n\n default:\n throw new Error(\"Unsupport operation: encode module import of type: \" + n.descr.type);\n }\n\n return out;\n}\nfunction encodeSectionMetadata(n) {\n var out = [];\n var sectionId = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__[\"default\"].sections[n.section];\n\n if (typeof sectionId === \"undefined\") {\n throw new Error(\"Unknown section: \" + n.section);\n }\n\n if (n.section === \"start\") {\n /**\n * This is not implemented yet because it's a special case which\n * doesn't have a vector in its section.\n */\n throw new Error(\"Unsupported section encoding of type start\");\n }\n\n out.push(sectionId);\n out.push.apply(out, _toConsumableArray(encodeU32(n.size.value)));\n out.push.apply(out, _toConsumableArray(encodeU32(n.vectorOfSize.value)));\n return out;\n}\nfunction encodeCallInstruction(n) {\n var out = [];\n assertNotIdentifierNode(n.index);\n out.push(0x10); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.index.value)));\n return out;\n}\nfunction encodeCallIndirectInstruction(n) {\n var out = []; // $FlowIgnore\n\n assertNotIdentifierNode(n.index);\n out.push(0x11); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.index.value))); // add a reserved byte\n\n out.push(0x00);\n return out;\n}\nfunction encodeModuleExport(n) {\n var out = [];\n assertNotIdentifierNode(n.descr.id);\n var exportTypeByteString = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__[\"default\"].exportTypesByName[n.descr.exportType];\n\n if (typeof exportTypeByteString === \"undefined\") {\n throw new Error(\"Unknown export of type: \" + n.descr.exportType);\n }\n\n var exportTypeByte = parseInt(exportTypeByteString, 10);\n out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));\n out.push(exportTypeByte); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));\n return out;\n}\nfunction encodeTypeInstruction(n) {\n var out = [0x60];\n var params = n.functype.params.map(function (x) {\n return x.valtype;\n }).map(encodeValtype);\n var results = n.functype.results.map(encodeValtype);\n out.push.apply(out, _toConsumableArray(encodeVec(params)));\n out.push.apply(out, _toConsumableArray(encodeVec(results)));\n return out;\n}\nfunction encodeInstr(n) {\n var out = [];\n var instructionName = n.id;\n\n if (typeof n.object === \"string\") {\n instructionName = \"\".concat(n.object, \".\").concat(String(n.id));\n }\n\n var byteString = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_3__[\"default\"].symbolsByName[instructionName];\n\n if (typeof byteString === \"undefined\") {\n throw new Error(\"encodeInstr: unknown instruction \" + JSON.stringify(instructionName));\n }\n\n var byte = parseInt(byteString, 10);\n out.push(byte);\n\n if (n.args) {\n n.args.forEach(function (arg) {\n var encoder = encodeU32; // find correct encoder\n\n if (n.object === \"i32\") {\n encoder = encodeI32;\n }\n\n if (n.object === \"i64\") {\n encoder = encodeI64;\n }\n\n if (n.object === \"f32\") {\n encoder = _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.encodeF32;\n }\n\n if (n.object === \"f64\") {\n encoder = _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.encodeF64;\n }\n\n if (arg.type === \"NumberLiteral\" || arg.type === \"FloatLiteral\" || arg.type === \"LongNumberLiteral\") {\n // $FlowIgnore\n out.push.apply(out, _toConsumableArray(encoder(arg.value)));\n } else {\n throw new Error(\"Unsupported instruction argument encoding \" + JSON.stringify(arg.type));\n }\n });\n }\n\n return out;\n}\n\nfunction encodeExpr(instrs) {\n var out = [];\n instrs.forEach(function (instr) {\n // $FlowIgnore\n var n = (0,_index__WEBPACK_IMPORTED_MODULE_4__.encodeNode)(instr);\n out.push.apply(out, _toConsumableArray(n));\n });\n return out;\n}\n\nfunction encodeStringLiteral(n) {\n return encodeUTF8Vec(n.value);\n}\nfunction encodeGlobal(n) {\n var out = [];\n var _n$globalType = n.globalType,\n valtype = _n$globalType.valtype,\n mutability = _n$globalType.mutability;\n out.push(encodeValtype(valtype));\n out.push(encodeMutability(mutability));\n out.push.apply(out, _toConsumableArray(encodeExpr(n.init)));\n return out;\n}\nfunction encodeFuncBody(n) {\n var out = [];\n out.push(-1); // temporary function body size\n // FIXME(sven): get the func locals?\n\n var localBytes = encodeVec([]);\n out.push.apply(out, _toConsumableArray(localBytes));\n var funcBodyBytes = encodeExpr(n.body);\n out[0] = funcBodyBytes.length + localBytes.length;\n out.push.apply(out, _toConsumableArray(funcBodyBytes));\n return out;\n}\nfunction encodeIndexInFuncSection(n) {\n assertNotIdentifierNode(n.index); // $FlowIgnore\n\n return encodeU32(n.index.value);\n}\nfunction encodeElem(n) {\n var out = [];\n assertNotIdentifierNode(n.table); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.table.value)));\n out.push.apply(out, _toConsumableArray(encodeExpr(n.offset))); // $FlowIgnore\n\n var funcs = n.funcs.reduce(function (acc, x) {\n return _toConsumableArray(acc).concat(_toConsumableArray(encodeU32(x.value)));\n }, []);\n out.push.apply(out, _toConsumableArray(encodeVec(funcs)));\n return out;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-gen/esm/encoder/index.js?");
585+
586+/***/ }),
587+
588+/***/ "../node_modules/@webassemblyjs/wasm-gen/esm/index.js":
589+/*!************************************************************!*\
590+ !*** ../node_modules/@webassemblyjs/wasm-gen/esm/index.js ***!
591+ \************************************************************/
592+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
593+
594+"use strict";
595+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"encodeNode\": () => (/* binding */ encodeNode),\n/* harmony export */ \"encodeU32\": () => (/* binding */ encodeU32)\n/* harmony export */ });\n/* harmony import */ var _encoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./encoder */ \"../node_modules/@webassemblyjs/wasm-gen/esm/encoder/index.js\");\n\nfunction encodeNode(n) {\n switch (n.type) {\n case \"ModuleImport\":\n // $FlowIgnore: ModuleImport ensure that the node is well formated\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeModuleImport(n);\n\n case \"SectionMetadata\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeSectionMetadata(n);\n\n case \"CallInstruction\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeCallInstruction(n);\n\n case \"CallIndirectInstruction\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeCallIndirectInstruction(n);\n\n case \"TypeInstruction\":\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeTypeInstruction(n);\n\n case \"Instr\":\n // $FlowIgnore\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeInstr(n);\n\n case \"ModuleExport\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeModuleExport(n);\n\n case \"Global\":\n // $FlowIgnore\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeGlobal(n);\n\n case \"Func\":\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeFuncBody(n);\n\n case \"IndexInFuncSection\":\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeIndexInFuncSection(n);\n\n case \"StringLiteral\":\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeStringLiteral(n);\n\n case \"Elem\":\n return _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeElem(n);\n\n default:\n throw new Error(\"Unsupported encoding for node of type: \" + JSON.stringify(n.type));\n }\n}\nvar encodeU32 = _encoder__WEBPACK_IMPORTED_MODULE_0__.encodeU32;\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-gen/esm/index.js?");
596+
597+/***/ }),
598+
599+/***/ "../node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js":
600+/*!********************************************************************!*\
601+ !*** ../node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js ***!
602+ \********************************************************************/
603+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
604+
605+"use strict";
606+eval("\n\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nexports.encodeVersion = encodeVersion;\nexports.encodeHeader = encodeHeader;\nexports.encodeU32 = encodeU32;\nexports.encodeI32 = encodeI32;\nexports.encodeI64 = encodeI64;\nexports.encodeVec = encodeVec;\nexports.encodeValtype = encodeValtype;\nexports.encodeMutability = encodeMutability;\nexports.encodeUTF8Vec = encodeUTF8Vec;\nexports.encodeLimits = encodeLimits;\nexports.encodeModuleImport = encodeModuleImport;\nexports.encodeSectionMetadata = encodeSectionMetadata;\nexports.encodeCallInstruction = encodeCallInstruction;\nexports.encodeCallIndirectInstruction = encodeCallIndirectInstruction;\nexports.encodeModuleExport = encodeModuleExport;\nexports.encodeTypeInstruction = encodeTypeInstruction;\nexports.encodeInstr = encodeInstr;\nexports.encodeStringLiteral = encodeStringLiteral;\nexports.encodeGlobal = encodeGlobal;\nexports.encodeFuncBody = encodeFuncBody;\nexports.encodeIndexInFuncSection = encodeIndexInFuncSection;\nexports.encodeElem = encodeElem;\n\nvar leb = _interopRequireWildcard(__webpack_require__(/*! @webassemblyjs/leb128 */ \"../node_modules/@webassemblyjs/leb128/esm/index.js\"));\n\nvar ieee754 = _interopRequireWildcard(__webpack_require__(/*! @webassemblyjs/ieee754 */ \"../node_modules/@webassemblyjs/ieee754/esm/index.js\"));\n\nvar utf8 = _interopRequireWildcard(__webpack_require__(/*! @webassemblyjs/utf8 */ \"../node_modules/@webassemblyjs/utf8/esm/index.js\"));\n\nvar _helperWasmBytecode = _interopRequireDefault(__webpack_require__(/*! @webassemblyjs/helper-wasm-bytecode */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js\"));\n\nvar _index = __webpack_require__(/*! ../index */ \"../node_modules/@webassemblyjs/wasm-gen/lib/index.js\");\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }\n\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nfunction assertNotIdentifierNode(n) {\n if (n.type === \"Identifier\") {\n throw new Error(\"Unsupported node Identifier\");\n }\n}\n\nfunction encodeVersion(v) {\n var bytes = _helperWasmBytecode.default.moduleVersion;\n bytes[0] = v;\n return bytes;\n}\n\nfunction encodeHeader() {\n return _helperWasmBytecode.default.magicModuleHeader;\n}\n\nfunction encodeU32(v) {\n var uint8view = new Uint8Array(leb.encodeU32(v));\n\n var array = _toConsumableArray(uint8view);\n\n return array;\n}\n\nfunction encodeI32(v) {\n var uint8view = new Uint8Array(leb.encodeI32(v));\n\n var array = _toConsumableArray(uint8view);\n\n return array;\n}\n\nfunction encodeI64(v) {\n var uint8view = new Uint8Array(leb.encodeI64(v));\n\n var array = _toConsumableArray(uint8view);\n\n return array;\n}\n\nfunction encodeVec(elements) {\n var size = encodeU32(elements.length);\n return _toConsumableArray(size).concat(_toConsumableArray(elements));\n}\n\nfunction encodeValtype(v) {\n var byte = _helperWasmBytecode.default.valtypesByString[v];\n\n if (typeof byte === \"undefined\") {\n throw new Error(\"Unknown valtype: \" + v);\n }\n\n return parseInt(byte, 10);\n}\n\nfunction encodeMutability(v) {\n var byte = _helperWasmBytecode.default.globalTypesByString[v];\n\n if (typeof byte === \"undefined\") {\n throw new Error(\"Unknown mutability: \" + v);\n }\n\n return parseInt(byte, 10);\n}\n\nfunction encodeUTF8Vec(str) {\n return encodeVec(utf8.encode(str));\n}\n\nfunction encodeLimits(n) {\n var out = [];\n\n if (typeof n.max === \"number\") {\n out.push(0x01);\n out.push.apply(out, _toConsumableArray(encodeU32(n.min))); // $FlowIgnore: ensured by the typeof\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.max)));\n } else {\n out.push(0x00);\n out.push.apply(out, _toConsumableArray(encodeU32(n.min)));\n }\n\n return out;\n}\n\nfunction encodeModuleImport(n) {\n var out = [];\n out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.module)));\n out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));\n\n switch (n.descr.type) {\n case \"GlobalType\":\n {\n out.push(0x03); // $FlowIgnore: GlobalType ensure that these props exists\n\n out.push(encodeValtype(n.descr.valtype)); // $FlowIgnore: GlobalType ensure that these props exists\n\n out.push(encodeMutability(n.descr.mutability));\n break;\n }\n\n case \"Memory\":\n {\n out.push(0x02); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));\n break;\n }\n\n case \"Table\":\n {\n out.push(0x01);\n out.push(0x70); // element type\n // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeLimits(n.descr.limits)));\n break;\n }\n\n case \"FuncImportDescr\":\n {\n out.push(0x00); // $FlowIgnore\n\n assertNotIdentifierNode(n.descr.id); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));\n break;\n }\n\n default:\n throw new Error(\"Unsupport operation: encode module import of type: \" + n.descr.type);\n }\n\n return out;\n}\n\nfunction encodeSectionMetadata(n) {\n var out = [];\n var sectionId = _helperWasmBytecode.default.sections[n.section];\n\n if (typeof sectionId === \"undefined\") {\n throw new Error(\"Unknown section: \" + n.section);\n }\n\n if (n.section === \"start\") {\n /**\n * This is not implemented yet because it's a special case which\n * doesn't have a vector in its section.\n */\n throw new Error(\"Unsupported section encoding of type start\");\n }\n\n out.push(sectionId);\n out.push.apply(out, _toConsumableArray(encodeU32(n.size.value)));\n out.push.apply(out, _toConsumableArray(encodeU32(n.vectorOfSize.value)));\n return out;\n}\n\nfunction encodeCallInstruction(n) {\n var out = [];\n assertNotIdentifierNode(n.index);\n out.push(0x10); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.index.value)));\n return out;\n}\n\nfunction encodeCallIndirectInstruction(n) {\n var out = []; // $FlowIgnore\n\n assertNotIdentifierNode(n.index);\n out.push(0x11); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.index.value))); // add a reserved byte\n\n out.push(0x00);\n return out;\n}\n\nfunction encodeModuleExport(n) {\n var out = [];\n assertNotIdentifierNode(n.descr.id);\n var exportTypeByteString = _helperWasmBytecode.default.exportTypesByName[n.descr.exportType];\n\n if (typeof exportTypeByteString === \"undefined\") {\n throw new Error(\"Unknown export of type: \" + n.descr.exportType);\n }\n\n var exportTypeByte = parseInt(exportTypeByteString, 10);\n out.push.apply(out, _toConsumableArray(encodeUTF8Vec(n.name)));\n out.push(exportTypeByte); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.descr.id.value)));\n return out;\n}\n\nfunction encodeTypeInstruction(n) {\n var out = [0x60];\n var params = n.functype.params.map(function (x) {\n return x.valtype;\n }).map(encodeValtype);\n var results = n.functype.results.map(encodeValtype);\n out.push.apply(out, _toConsumableArray(encodeVec(params)));\n out.push.apply(out, _toConsumableArray(encodeVec(results)));\n return out;\n}\n\nfunction encodeInstr(n) {\n var out = [];\n var instructionName = n.id;\n\n if (typeof n.object === \"string\") {\n instructionName = \"\".concat(n.object, \".\").concat(String(n.id));\n }\n\n var byteString = _helperWasmBytecode.default.symbolsByName[instructionName];\n\n if (typeof byteString === \"undefined\") {\n throw new Error(\"encodeInstr: unknown instruction \" + JSON.stringify(instructionName));\n }\n\n var byte = parseInt(byteString, 10);\n out.push(byte);\n\n if (n.args) {\n n.args.forEach(function (arg) {\n var encoder = encodeU32; // find correct encoder\n\n if (n.object === \"i32\") {\n encoder = encodeI32;\n }\n\n if (n.object === \"i64\") {\n encoder = encodeI64;\n }\n\n if (n.object === \"f32\") {\n encoder = ieee754.encodeF32;\n }\n\n if (n.object === \"f64\") {\n encoder = ieee754.encodeF64;\n }\n\n if (arg.type === \"NumberLiteral\" || arg.type === \"FloatLiteral\" || arg.type === \"LongNumberLiteral\") {\n // $FlowIgnore\n out.push.apply(out, _toConsumableArray(encoder(arg.value)));\n } else {\n throw new Error(\"Unsupported instruction argument encoding \" + JSON.stringify(arg.type));\n }\n });\n }\n\n return out;\n}\n\nfunction encodeExpr(instrs) {\n var out = [];\n instrs.forEach(function (instr) {\n // $FlowIgnore\n var n = (0, _index.encodeNode)(instr);\n out.push.apply(out, _toConsumableArray(n));\n });\n return out;\n}\n\nfunction encodeStringLiteral(n) {\n return encodeUTF8Vec(n.value);\n}\n\nfunction encodeGlobal(n) {\n var out = [];\n var _n$globalType = n.globalType,\n valtype = _n$globalType.valtype,\n mutability = _n$globalType.mutability;\n out.push(encodeValtype(valtype));\n out.push(encodeMutability(mutability));\n out.push.apply(out, _toConsumableArray(encodeExpr(n.init)));\n return out;\n}\n\nfunction encodeFuncBody(n) {\n var out = [];\n out.push(-1); // temporary function body size\n // FIXME(sven): get the func locals?\n\n var localBytes = encodeVec([]);\n out.push.apply(out, _toConsumableArray(localBytes));\n var funcBodyBytes = encodeExpr(n.body);\n out[0] = funcBodyBytes.length + localBytes.length;\n out.push.apply(out, _toConsumableArray(funcBodyBytes));\n return out;\n}\n\nfunction encodeIndexInFuncSection(n) {\n assertNotIdentifierNode(n.index); // $FlowIgnore\n\n return encodeU32(n.index.value);\n}\n\nfunction encodeElem(n) {\n var out = [];\n assertNotIdentifierNode(n.table); // $FlowIgnore\n\n out.push.apply(out, _toConsumableArray(encodeU32(n.table.value)));\n out.push.apply(out, _toConsumableArray(encodeExpr(n.offset))); // $FlowIgnore\n\n var funcs = n.funcs.reduce(function (acc, x) {\n return _toConsumableArray(acc).concat(_toConsumableArray(encodeU32(x.value)));\n }, []);\n out.push.apply(out, _toConsumableArray(encodeVec(funcs)));\n return out;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js?");
607+
608+/***/ }),
609+
610+/***/ "../node_modules/@webassemblyjs/wasm-gen/lib/index.js":
611+/*!************************************************************!*\
612+ !*** ../node_modules/@webassemblyjs/wasm-gen/lib/index.js ***!
613+ \************************************************************/
614+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
615+
616+"use strict";
617+eval("\n\nObject.defineProperty(exports, \"__esModule\", ({\n value: true\n}));\nexports.encodeNode = encodeNode;\nexports.encodeU32 = void 0;\n\nvar encoder = _interopRequireWildcard(__webpack_require__(/*! ./encoder */ \"../node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js\"));\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }\n\nfunction encodeNode(n) {\n switch (n.type) {\n case \"ModuleImport\":\n // $FlowIgnore: ModuleImport ensure that the node is well formated\n return encoder.encodeModuleImport(n);\n\n case \"SectionMetadata\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return encoder.encodeSectionMetadata(n);\n\n case \"CallInstruction\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return encoder.encodeCallInstruction(n);\n\n case \"CallIndirectInstruction\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return encoder.encodeCallIndirectInstruction(n);\n\n case \"TypeInstruction\":\n return encoder.encodeTypeInstruction(n);\n\n case \"Instr\":\n // $FlowIgnore\n return encoder.encodeInstr(n);\n\n case \"ModuleExport\":\n // $FlowIgnore: SectionMetadata ensure that the node is well formated\n return encoder.encodeModuleExport(n);\n\n case \"Global\":\n // $FlowIgnore\n return encoder.encodeGlobal(n);\n\n case \"Func\":\n return encoder.encodeFuncBody(n);\n\n case \"IndexInFuncSection\":\n return encoder.encodeIndexInFuncSection(n);\n\n case \"StringLiteral\":\n return encoder.encodeStringLiteral(n);\n\n case \"Elem\":\n return encoder.encodeElem(n);\n\n default:\n throw new Error(\"Unsupported encoding for node of type: \" + JSON.stringify(n.type));\n }\n}\n\nvar encodeU32 = encoder.encodeU32;\nexports.encodeU32 = encodeU32;\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-gen/lib/index.js?");
618+
619+/***/ }),
620+
621+/***/ "../node_modules/@webassemblyjs/wasm-opt/esm/index.js":
622+/*!************************************************************!*\
623+ !*** ../node_modules/@webassemblyjs/wasm-opt/esm/index.js ***!
624+ \************************************************************/
625+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
626+
627+"use strict";
628+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"shrinkPaddedLEB128\": () => (/* binding */ shrinkPaddedLEB128)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_wasm_parser__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/wasm-parser */ \"../node_modules/@webassemblyjs/wasm-parser/esm/index.js\");\n/* harmony import */ var _leb128_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./leb128.js */ \"../node_modules/@webassemblyjs/wasm-opt/esm/leb128.js\");\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar OptimizerError =\n/*#__PURE__*/\nfunction (_Error) {\n _inherits(OptimizerError, _Error);\n\n function OptimizerError(name, initalError) {\n var _this;\n\n _classCallCheck(this, OptimizerError);\n\n _this = _possibleConstructorReturn(this, (OptimizerError.__proto__ || Object.getPrototypeOf(OptimizerError)).call(this, \"Error while optimizing: \" + name + \": \" + initalError.message));\n _this.stack = initalError.stack;\n return _this;\n }\n\n return OptimizerError;\n}(Error);\n\nvar decoderOpts = {\n ignoreCodeSection: true,\n ignoreDataSection: true\n};\nfunction shrinkPaddedLEB128(uint8Buffer) {\n try {\n var ast = (0,_webassemblyjs_wasm_parser__WEBPACK_IMPORTED_MODULE_0__.decode)(uint8Buffer.buffer, decoderOpts);\n return (0,_leb128_js__WEBPACK_IMPORTED_MODULE_1__.shrinkPaddedLEB128)(ast, uint8Buffer);\n } catch (e) {\n throw new OptimizerError(\"shrinkPaddedLEB128\", e);\n }\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-opt/esm/index.js?");
629+
630+/***/ }),
631+
632+/***/ "../node_modules/@webassemblyjs/wasm-opt/esm/leb128.js":
633+/*!*************************************************************!*\
634+ !*** ../node_modules/@webassemblyjs/wasm-opt/esm/leb128.js ***!
635+ \*************************************************************/
636+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
637+
638+"use strict";
639+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"shrinkPaddedLEB128\": () => (/* binding */ shrinkPaddedLEB128)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/ast */ \"../node_modules/@webassemblyjs/ast/esm/index.js\");\n/* harmony import */ var _webassemblyjs_wasm_gen_lib_encoder__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/wasm-gen/lib/encoder */ \"../node_modules/@webassemblyjs/wasm-gen/lib/encoder/index.js\");\n/* harmony import */ var _webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/helper-buffer */ \"../node_modules/@webassemblyjs/helper-buffer/esm/index.js\");\n\n\n\n\nfunction shiftFollowingSections(ast, _ref, deltaInSizeEncoding) {\n var section = _ref.section;\n // Once we hit our section every that is after needs to be shifted by the delta\n var encounteredSection = false;\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__.traverse)(ast, {\n SectionMetadata: function SectionMetadata(path) {\n if (path.node.section === section) {\n encounteredSection = true;\n return;\n }\n\n if (encounteredSection === true) {\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__.shiftSection)(ast, path.node, deltaInSizeEncoding);\n }\n }\n });\n}\n\nfunction shrinkPaddedLEB128(ast, uint8Buffer) {\n (0,_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_0__.traverse)(ast, {\n SectionMetadata: function SectionMetadata(_ref2) {\n var node = _ref2.node;\n\n /**\n * Section size\n */\n {\n var newu32Encoded = (0,_webassemblyjs_wasm_gen_lib_encoder__WEBPACK_IMPORTED_MODULE_1__.encodeU32)(node.size.value);\n var newu32EncodedLen = newu32Encoded.length;\n var start = node.size.loc.start.column;\n var end = node.size.loc.end.column;\n var oldu32EncodedLen = end - start;\n\n if (newu32EncodedLen !== oldu32EncodedLen) {\n var deltaInSizeEncoding = oldu32EncodedLen - newu32EncodedLen;\n uint8Buffer = (0,_webassemblyjs_helper_buffer__WEBPACK_IMPORTED_MODULE_2__.overrideBytesInBuffer)(uint8Buffer, start, end, newu32Encoded);\n shiftFollowingSections(ast, node, -deltaInSizeEncoding);\n }\n }\n }\n });\n return uint8Buffer;\n}\n\n//# sourceURL=webpack://my-webpack-project/../node_modules/@webassemblyjs/wasm-opt/esm/leb128.js?");
640+
641+/***/ }),
642+
643+/***/ "../node_modules/@webassemblyjs/wasm-parser/esm/decoder.js":
644+/*!*****************************************************************!*\
645+ !*** ../node_modules/@webassemblyjs/wasm-parser/esm/decoder.js ***!
646+ \*****************************************************************/
647+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
648+
649+"use strict";
650+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */ \"decode\": () => (/* binding */ decode)\n/* harmony export */ });\n/* harmony import */ var _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @webassemblyjs/helper-api-error */ \"../node_modules/@webassemblyjs/helper-api-error/esm/index.js\");\n/* harmony import */ var _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @webassemblyjs/ieee754 */ \"../node_modules/@webassemblyjs/ieee754/esm/index.js\");\n/* harmony import */ var _webassemblyjs_utf8__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @webassemblyjs/utf8 */ \"../node_modules/@webassemblyjs/utf8/esm/index.js\");\n/* harmony import */ var _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @webassemblyjs/ast */ \"../node_modules/@webassemblyjs/ast/esm/index.js\");\n/* harmony import */ var _webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @webassemblyjs/leb128 */ \"../node_modules/@webassemblyjs/leb128/esm/index.js\");\n/* harmony import */ var _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @webassemblyjs/helper-wasm-bytecode */ \"../node_modules/@webassemblyjs/helper-wasm-bytecode/esm/index.js\");\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\n\n\n\n\n\n\n\nfunction toHex(n) {\n return \"0x\" + Number(n).toString(16);\n}\n\nfunction byteArrayEq(l, r) {\n if (l.length !== r.length) {\n return false;\n }\n\n for (var i = 0; i < l.length; i++) {\n if (l[i] !== r[i]) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction decode(ab, opts) {\n var buf = new Uint8Array(ab);\n var getUniqueName = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.getUniqueNameGenerator();\n var offset = 0;\n\n function getPosition() {\n return {\n line: -1,\n column: offset\n };\n }\n\n function dump(b, msg) {\n if (opts.dump === false) return;\n var pad = \"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\";\n var str = \"\";\n\n if (b.length < 5) {\n str = b.map(toHex).join(\" \");\n } else {\n str = \"...\";\n }\n\n console.log(toHex(offset) + \":\\t\", str, pad, \";\", msg);\n }\n\n function dumpSep(msg) {\n if (opts.dump === false) return;\n console.log(\";\", msg);\n }\n /**\n * TODO(sven): we can atually use a same structure\n * we are adding incrementally new features\n */\n\n\n var state = {\n elementsInFuncSection: [],\n elementsInExportSection: [],\n elementsInCodeSection: [],\n\n /**\n * Decode memory from:\n * - Memory section\n */\n memoriesInModule: [],\n\n /**\n * Decoded types from:\n * - Type section\n */\n typesInModule: [],\n\n /**\n * Decoded functions from:\n * - Function section\n * - Import section\n */\n functionsInModule: [],\n\n /**\n * Decoded tables from:\n * - Table section\n */\n tablesInModule: [],\n\n /**\n * Decoded globals from:\n * - Global section\n */\n globalsInModule: []\n };\n\n function isEOF() {\n return offset >= buf.length;\n }\n\n function eatBytes(n) {\n offset = offset + n;\n }\n\n function readBytesAtOffset(_offset, numberOfBytes) {\n var arr = [];\n\n for (var i = 0; i < numberOfBytes; i++) {\n arr.push(buf[_offset + i]);\n }\n\n return arr;\n }\n\n function readBytes(numberOfBytes) {\n return readBytesAtOffset(offset, numberOfBytes);\n }\n\n function readF64() {\n var bytes = readBytes(_webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F64);\n var value = _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.decodeF64(bytes);\n\n if (Math.sign(value) * value === Infinity) {\n return {\n value: Math.sign(value),\n inf: true,\n nextIndex: _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F64\n };\n }\n\n if (isNaN(value)) {\n var sign = bytes[bytes.length - 1] >> 7 ? -1 : 1;\n var mantissa = 0;\n\n for (var i = 0; i < bytes.length - 2; ++i) {\n mantissa += bytes[i] * Math.pow(256, i);\n }\n\n mantissa += bytes[bytes.length - 2] % 16 * Math.pow(256, bytes.length - 2);\n return {\n value: sign * mantissa,\n nan: true,\n nextIndex: _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F64\n };\n }\n\n return {\n value: value,\n nextIndex: _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F64\n };\n }\n\n function readF32() {\n var bytes = readBytes(_webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F32);\n var value = _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.decodeF32(bytes);\n\n if (Math.sign(value) * value === Infinity) {\n return {\n value: Math.sign(value),\n inf: true,\n nextIndex: _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F32\n };\n }\n\n if (isNaN(value)) {\n var sign = bytes[bytes.length - 1] >> 7 ? -1 : 1;\n var mantissa = 0;\n\n for (var i = 0; i < bytes.length - 2; ++i) {\n mantissa += bytes[i] * Math.pow(256, i);\n }\n\n mantissa += bytes[bytes.length - 2] % 128 * Math.pow(256, bytes.length - 2);\n return {\n value: sign * mantissa,\n nan: true,\n nextIndex: _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F32\n };\n }\n\n return {\n value: value,\n nextIndex: _webassemblyjs_ieee754__WEBPACK_IMPORTED_MODULE_1__.NUMBER_OF_BYTE_F32\n };\n }\n\n function readUTF8String() {\n var lenu32 = readU32(); // Don't eat any bytes. Instead, peek ahead of the current offset using\n // readBytesAtOffset below. This keeps readUTF8String neutral with respect\n // to the current offset, just like the other readX functions.\n\n var strlen = lenu32.value;\n dump([strlen], \"string length\");\n var bytes = readBytesAtOffset(offset + lenu32.nextIndex, strlen);\n var value = _webassemblyjs_utf8__WEBPACK_IMPORTED_MODULE_2__.decode(bytes);\n return {\n value: value,\n nextIndex: strlen + lenu32.nextIndex\n };\n }\n /**\n * Decode an unsigned 32bits integer\n *\n * The length will be handled by the leb librairy, we pass the max number of\n * byte.\n */\n\n\n function readU32() {\n var bytes = readBytes(_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.MAX_NUMBER_OF_BYTE_U32);\n var buffer = Buffer.from(bytes);\n return (0,_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.decodeUInt32)(buffer);\n }\n\n function readVaruint32() {\n // where 32 bits = max 4 bytes\n var bytes = readBytes(4);\n var buffer = Buffer.from(bytes);\n return (0,_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.decodeUInt32)(buffer);\n }\n\n function readVaruint7() {\n // where 7 bits = max 1 bytes\n var bytes = readBytes(1);\n var buffer = Buffer.from(bytes);\n return (0,_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.decodeUInt32)(buffer);\n }\n /**\n * Decode a signed 32bits interger\n */\n\n\n function read32() {\n var bytes = readBytes(_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.MAX_NUMBER_OF_BYTE_U32);\n var buffer = Buffer.from(bytes);\n return (0,_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.decodeInt32)(buffer);\n }\n /**\n * Decode a signed 64bits integer\n */\n\n\n function read64() {\n var bytes = readBytes(_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.MAX_NUMBER_OF_BYTE_U64);\n var buffer = Buffer.from(bytes);\n return (0,_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.decodeInt64)(buffer);\n }\n\n function readU64() {\n var bytes = readBytes(_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.MAX_NUMBER_OF_BYTE_U64);\n var buffer = Buffer.from(bytes);\n return (0,_webassemblyjs_leb128__WEBPACK_IMPORTED_MODULE_4__.decodeUInt64)(buffer);\n }\n\n function readByte() {\n return readBytes(1)[0];\n }\n\n function parseModuleHeader() {\n if (isEOF() === true || offset + 4 > buf.length) {\n throw new Error(\"unexpected end\");\n }\n\n var header = readBytes(4);\n\n if (byteArrayEq(_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].magicModuleHeader, header) === false) {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"magic header not detected\");\n }\n\n dump(header, \"wasm magic header\");\n eatBytes(4);\n }\n\n function parseVersion() {\n if (isEOF() === true || offset + 4 > buf.length) {\n throw new Error(\"unexpected end\");\n }\n\n var version = readBytes(4);\n\n if (byteArrayEq(_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].moduleVersion, version) === false) {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"unknown binary version\");\n }\n\n dump(version, \"wasm version\");\n eatBytes(4);\n }\n\n function parseVec(cast) {\n var u32 = readU32();\n var length = u32.value;\n eatBytes(u32.nextIndex);\n dump([length], \"number\");\n\n if (length === 0) {\n return [];\n }\n\n var elements = [];\n\n for (var i = 0; i < length; i++) {\n var byte = readByte();\n eatBytes(1);\n var value = cast(byte);\n dump([byte], value);\n\n if (typeof value === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Internal failure: parseVec could not cast the value\");\n }\n\n elements.push(value);\n }\n\n return elements;\n } // Type section\n // https://webassembly.github.io/spec/binary/modules.html#binary-typesec\n\n\n function parseTypeSection(numberOfTypes) {\n var typeInstructionNodes = [];\n dump([numberOfTypes], \"num types\");\n\n for (var i = 0; i < numberOfTypes; i++) {\n var _startLoc = getPosition();\n\n dumpSep(\"type \" + i);\n var type = readByte();\n eatBytes(1);\n\n if (type == _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].types.func) {\n dump([type], \"func\");\n var paramValtypes = parseVec(function (b) {\n return _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].valtypes[b];\n });\n var params = paramValtypes.map(function (v) {\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.funcParam(\n /*valtype*/\n v);\n });\n var result = parseVec(function (b) {\n return _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].valtypes[b];\n });\n typeInstructionNodes.push(function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.typeInstruction(undefined, _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.signature(params, result)), endLoc, _startLoc);\n }());\n state.typesInModule.push({\n params: params,\n result: result\n });\n } else {\n throw new Error(\"Unsupported type: \" + toHex(type));\n }\n }\n\n return typeInstructionNodes;\n } // Import section\n // https://webassembly.github.io/spec/binary/modules.html#binary-importsec\n\n\n function parseImportSection(numberOfImports) {\n var imports = [];\n\n for (var i = 0; i < numberOfImports; i++) {\n dumpSep(\"import header \" + i);\n\n var _startLoc2 = getPosition();\n /**\n * Module name\n */\n\n\n var moduleName = readUTF8String();\n eatBytes(moduleName.nextIndex);\n dump([], \"module name (\".concat(moduleName.value, \")\"));\n /**\n * Name\n */\n\n var name = readUTF8String();\n eatBytes(name.nextIndex);\n dump([], \"name (\".concat(name.value, \")\"));\n /**\n * Import descr\n */\n\n var descrTypeByte = readByte();\n eatBytes(1);\n var descrType = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].importTypes[descrTypeByte];\n dump([descrTypeByte], \"import kind\");\n\n if (typeof descrType === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unknown import description type: \" + toHex(descrTypeByte));\n }\n\n var importDescr = void 0;\n\n if (descrType === \"func\") {\n var indexU32 = readU32();\n var typeindex = indexU32.value;\n eatBytes(indexU32.nextIndex);\n dump([typeindex], \"type index\");\n var signature = state.typesInModule[typeindex];\n\n if (typeof signature === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"function signature not found (\".concat(typeindex, \")\"));\n }\n\n var id = getUniqueName(\"func\");\n importDescr = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.funcImportDescr(id, _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.signature(signature.params, signature.result));\n state.functionsInModule.push({\n id: _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.identifier(name.value),\n signature: signature,\n isExternal: true\n });\n } else if (descrType === \"global\") {\n importDescr = parseGlobalType();\n var globalNode = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.global(importDescr, []);\n state.globalsInModule.push(globalNode);\n } else if (descrType === \"table\") {\n importDescr = parseTableType(i);\n } else if (descrType === \"mem\") {\n var memoryNode = parseMemoryType(0);\n state.memoriesInModule.push(memoryNode);\n importDescr = memoryNode;\n } else {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unsupported import of type: \" + descrType);\n }\n\n imports.push(function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.moduleImport(moduleName.value, name.value, importDescr), endLoc, _startLoc2);\n }());\n }\n\n return imports;\n } // Function section\n // https://webassembly.github.io/spec/binary/modules.html#function-section\n\n\n function parseFuncSection(numberOfFunctions) {\n dump([numberOfFunctions], \"num funcs\");\n\n for (var i = 0; i < numberOfFunctions; i++) {\n var indexU32 = readU32();\n var typeindex = indexU32.value;\n eatBytes(indexU32.nextIndex);\n dump([typeindex], \"type index\");\n var signature = state.typesInModule[typeindex];\n\n if (typeof signature === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"function signature not found (\".concat(typeindex, \")\"));\n } // preserve anonymous, a name might be resolved later\n\n\n var id = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withRaw(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.identifier(getUniqueName(\"func\")), \"\");\n state.functionsInModule.push({\n id: id,\n signature: signature,\n isExternal: false\n });\n }\n } // Export section\n // https://webassembly.github.io/spec/binary/modules.html#export-section\n\n\n function parseExportSection(numberOfExport) {\n dump([numberOfExport], \"num exports\"); // Parse vector of exports\n\n for (var i = 0; i < numberOfExport; i++) {\n var _startLoc3 = getPosition();\n /**\n * Name\n */\n\n\n var name = readUTF8String();\n eatBytes(name.nextIndex);\n dump([], \"export name (\".concat(name.value, \")\"));\n /**\n * exportdescr\n */\n\n var typeIndex = readByte();\n eatBytes(1);\n dump([typeIndex], \"export kind\");\n var indexu32 = readU32();\n var index = indexu32.value;\n eatBytes(indexu32.nextIndex);\n dump([index], \"export index\");\n var id = void 0,\n signature = void 0;\n\n if (_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].exportTypes[typeIndex] === \"Func\") {\n var func = state.functionsInModule[index];\n\n if (typeof func === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"unknown function (\".concat(index, \")\"));\n }\n\n id = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(index, String(index));\n signature = func.signature;\n } else if (_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].exportTypes[typeIndex] === \"Table\") {\n var table = state.tablesInModule[index];\n\n if (typeof table === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"unknown table \".concat(index));\n }\n\n id = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(index, String(index));\n signature = null;\n } else if (_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].exportTypes[typeIndex] === \"Mem\") {\n var memNode = state.memoriesInModule[index];\n\n if (typeof memNode === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"unknown memory \".concat(index));\n }\n\n id = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(index, String(index));\n signature = null;\n } else if (_webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].exportTypes[typeIndex] === \"Global\") {\n var global = state.globalsInModule[index];\n\n if (typeof global === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"unknown global \".concat(index));\n }\n\n id = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(index, String(index));\n signature = null;\n } else {\n console.warn(\"Unsupported export type: \" + toHex(typeIndex));\n return;\n }\n\n var endLoc = getPosition();\n state.elementsInExportSection.push({\n name: name.value,\n type: _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].exportTypes[typeIndex],\n signature: signature,\n id: id,\n index: index,\n endLoc: endLoc,\n startLoc: _startLoc3\n });\n }\n } // Code section\n // https://webassembly.github.io/spec/binary/modules.html#code-section\n\n\n function parseCodeSection(numberOfFuncs) {\n dump([numberOfFuncs], \"number functions\"); // Parse vector of function\n\n for (var i = 0; i < numberOfFuncs; i++) {\n var _startLoc4 = getPosition();\n\n dumpSep(\"function body \" + i); // the u32 size of the function code in bytes\n // Ignore it for now\n\n var bodySizeU32 = readU32();\n eatBytes(bodySizeU32.nextIndex);\n dump([bodySizeU32.value], \"function body size\");\n var code = [];\n /**\n * Parse locals\n */\n\n var funcLocalNumU32 = readU32();\n var funcLocalNum = funcLocalNumU32.value;\n eatBytes(funcLocalNumU32.nextIndex);\n dump([funcLocalNum], \"num locals\");\n var locals = [];\n\n for (var _i = 0; _i < funcLocalNum; _i++) {\n var _startLoc5 = getPosition();\n\n var localCountU32 = readU32();\n var localCount = localCountU32.value;\n eatBytes(localCountU32.nextIndex);\n dump([localCount], \"num local\");\n var valtypeByte = readByte();\n eatBytes(1);\n var type = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].valtypes[valtypeByte];\n var args = [];\n\n for (var _i2 = 0; _i2 < localCount; _i2++) {\n args.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.valtypeLiteral(type));\n }\n\n var localNode = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.instruction(\"local\", args), endLoc, _startLoc5);\n }();\n\n locals.push(localNode);\n dump([valtypeByte], type);\n\n if (typeof type === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unexpected valtype: \" + toHex(valtypeByte));\n }\n }\n\n code.push.apply(code, locals); // Decode instructions until the end\n\n parseInstructionBlock(code);\n var endLoc = getPosition();\n state.elementsInCodeSection.push({\n code: code,\n locals: locals,\n endLoc: endLoc,\n startLoc: _startLoc4,\n bodySize: bodySizeU32.value\n });\n }\n }\n\n function parseInstructionBlock(code) {\n while (true) {\n var _startLoc6 = getPosition();\n\n var instructionAlreadyCreated = false;\n var instructionByte = readByte();\n eatBytes(1);\n\n if (instructionByte === 0xfe) {\n instructionByte = 0xfe00 + readByte();\n eatBytes(1);\n }\n\n var instruction = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].symbolsByByte[instructionByte];\n\n if (typeof instruction === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unexpected instruction: \" + toHex(instructionByte));\n }\n\n if (typeof instruction.object === \"string\") {\n dump([instructionByte], \"\".concat(instruction.object, \".\").concat(instruction.name));\n } else {\n dump([instructionByte], instruction.name);\n }\n /**\n * End of the function\n */\n\n\n if (instruction.name === \"end\") {\n var node = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.instruction(instruction.name), endLoc, _startLoc6);\n }();\n\n code.push(node);\n break;\n }\n\n var args = [];\n\n if (instruction.name === \"loop\") {\n var _startLoc7 = getPosition();\n\n var blocktypeByte = readByte();\n eatBytes(1);\n var blocktype = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].blockTypes[blocktypeByte];\n dump([blocktypeByte], \"blocktype\");\n\n if (typeof blocktype === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unexpected blocktype: \" + toHex(blocktypeByte));\n }\n\n var instr = [];\n parseInstructionBlock(instr); // preserve anonymous\n\n var label = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withRaw(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.identifier(getUniqueName(\"loop\")), \"\");\n\n var loopNode = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.loopInstruction(label, blocktype, instr), endLoc, _startLoc7);\n }();\n\n code.push(loopNode);\n instructionAlreadyCreated = true;\n } else if (instruction.name === \"if\") {\n var _startLoc8 = getPosition();\n\n var _blocktypeByte = readByte();\n\n eatBytes(1);\n var _blocktype = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].blockTypes[_blocktypeByte];\n dump([_blocktypeByte], \"blocktype\");\n\n if (typeof _blocktype === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unexpected blocktype: \" + toHex(_blocktypeByte));\n }\n\n var testIndex = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withRaw(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.identifier(getUniqueName(\"if\")), \"\");\n var ifBody = [];\n parseInstructionBlock(ifBody); // Defaults to no alternate\n\n var elseIndex = 0;\n\n for (elseIndex = 0; elseIndex < ifBody.length; ++elseIndex) {\n var _instr = ifBody[elseIndex];\n\n if (_instr.type === \"Instr\" && _instr.id === \"else\") {\n break;\n }\n }\n\n var consequentInstr = ifBody.slice(0, elseIndex);\n var alternate = ifBody.slice(elseIndex + 1); // wast sugar\n\n var testInstrs = [];\n\n var ifNode = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.ifInstruction(testIndex, testInstrs, _blocktype, consequentInstr, alternate), endLoc, _startLoc8);\n }();\n\n code.push(ifNode);\n instructionAlreadyCreated = true;\n } else if (instruction.name === \"block\") {\n var _startLoc9 = getPosition();\n\n var _blocktypeByte2 = readByte();\n\n eatBytes(1);\n var _blocktype2 = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].blockTypes[_blocktypeByte2];\n dump([_blocktypeByte2], \"blocktype\");\n\n if (typeof _blocktype2 === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unexpected blocktype: \" + toHex(_blocktypeByte2));\n }\n\n var _instr2 = [];\n parseInstructionBlock(_instr2); // preserve anonymous\n\n var _label = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withRaw(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.identifier(getUniqueName(\"block\")), \"\");\n\n var blockNode = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.blockInstruction(_label, _instr2, _blocktype2), endLoc, _startLoc9);\n }();\n\n code.push(blockNode);\n instructionAlreadyCreated = true;\n } else if (instruction.name === \"call\") {\n var indexu32 = readU32();\n var index = indexu32.value;\n eatBytes(indexu32.nextIndex);\n dump([index], \"index\");\n\n var callNode = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.callInstruction(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.indexLiteral(index)), endLoc, _startLoc6);\n }();\n\n code.push(callNode);\n instructionAlreadyCreated = true;\n } else if (instruction.name === \"call_indirect\") {\n var _startLoc10 = getPosition();\n\n var indexU32 = readU32();\n var typeindex = indexU32.value;\n eatBytes(indexU32.nextIndex);\n dump([typeindex], \"type index\");\n var signature = state.typesInModule[typeindex];\n\n if (typeof signature === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"call_indirect signature not found (\".concat(typeindex, \")\"));\n }\n\n var _callNode = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.callIndirectInstruction(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.signature(signature.params, signature.result), []);\n\n var flagU32 = readU32();\n var flag = flagU32.value; // 0x00 - reserved byte\n\n eatBytes(flagU32.nextIndex);\n\n if (flag !== 0) {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"zero flag expected\");\n }\n\n code.push(function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_callNode, endLoc, _startLoc10);\n }());\n instructionAlreadyCreated = true;\n } else if (instruction.name === \"br_table\") {\n var indicesu32 = readU32();\n var indices = indicesu32.value;\n eatBytes(indicesu32.nextIndex);\n dump([indices], \"num indices\");\n\n for (var i = 0; i <= indices; i++) {\n var _indexu = readU32();\n\n var _index = _indexu.value;\n eatBytes(_indexu.nextIndex);\n dump([_index], \"index\");\n args.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(_indexu.value.toString(), \"u32\"));\n }\n } else if (instructionByte >= 0x28 && instructionByte <= 0x40) {\n /**\n * Memory instructions\n */\n if (instruction.name === \"grow_memory\" || instruction.name === \"current_memory\") {\n var _indexU = readU32();\n\n var _index2 = _indexU.value;\n eatBytes(_indexU.nextIndex);\n\n if (_index2 !== 0) {\n throw new Error(\"zero flag expected\");\n }\n\n dump([_index2], \"index\");\n } else {\n var aligun32 = readU32();\n var align = aligun32.value;\n eatBytes(aligun32.nextIndex);\n dump([align], \"align\");\n var offsetu32 = readU32();\n var _offset2 = offsetu32.value;\n eatBytes(offsetu32.nextIndex);\n dump([_offset2], \"offset\");\n }\n } else if (instructionByte >= 0x41 && instructionByte <= 0x44) {\n /**\n * Numeric instructions\n */\n if (instruction.object === \"i32\") {\n var value32 = read32();\n var value = value32.value;\n eatBytes(value32.nextIndex);\n dump([value], \"i32 value\");\n args.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(value));\n }\n\n if (instruction.object === \"u32\") {\n var valueu32 = readU32();\n var _value = valueu32.value;\n eatBytes(valueu32.nextIndex);\n dump([_value], \"u32 value\");\n args.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(_value));\n }\n\n if (instruction.object === \"i64\") {\n var value64 = read64();\n var _value2 = value64.value;\n eatBytes(value64.nextIndex);\n dump([Number(_value2.toString())], \"i64 value\");\n var high = _value2.high,\n low = _value2.low;\n var _node = {\n type: \"LongNumberLiteral\",\n value: {\n high: high,\n low: low\n }\n };\n args.push(_node);\n }\n\n if (instruction.object === \"u64\") {\n var valueu64 = readU64();\n var _value3 = valueu64.value;\n eatBytes(valueu64.nextIndex);\n dump([Number(_value3.toString())], \"u64 value\");\n var _high = _value3.high,\n _low = _value3.low;\n var _node2 = {\n type: \"LongNumberLiteral\",\n value: {\n high: _high,\n low: _low\n }\n };\n args.push(_node2);\n }\n\n if (instruction.object === \"f32\") {\n var valuef32 = readF32();\n var _value4 = valuef32.value;\n eatBytes(valuef32.nextIndex);\n dump([_value4], \"f32 value\");\n args.push( // $FlowIgnore\n _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.floatLiteral(_value4, valuef32.nan, valuef32.inf, String(_value4)));\n }\n\n if (instruction.object === \"f64\") {\n var valuef64 = readF64();\n var _value5 = valuef64.value;\n eatBytes(valuef64.nextIndex);\n dump([_value5], \"f64 value\");\n args.push( // $FlowIgnore\n _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.floatLiteral(_value5, valuef64.nan, valuef64.inf, String(_value5)));\n }\n } else if (instructionByte >= 0xfe00 && instructionByte <= 0xfeff) {\n /**\n * Atomic memory instructions\n */\n var align32 = readU32();\n var _align = align32.value;\n eatBytes(align32.nextIndex);\n dump([_align], \"align\");\n\n var _offsetu = readU32();\n\n var _offset3 = _offsetu.value;\n eatBytes(_offsetu.nextIndex);\n dump([_offset3], \"offset\");\n } else {\n for (var _i3 = 0; _i3 < instruction.numberOfArgs; _i3++) {\n var u32 = readU32();\n eatBytes(u32.nextIndex);\n dump([u32.value], \"argument \" + _i3);\n args.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.numberLiteralFromRaw(u32.value));\n }\n }\n\n if (instructionAlreadyCreated === false) {\n if (typeof instruction.object === \"string\") {\n var _node3 = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.objectInstruction(instruction.name, instruction.object, args), endLoc, _startLoc6);\n }();\n\n code.push(_node3);\n } else {\n var _node4 = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.instruction(instruction.name, args), endLoc, _startLoc6);\n }();\n\n code.push(_node4);\n }\n }\n }\n } // https://webassembly.github.io/spec/core/binary/types.html#limits\n\n\n function parseLimits() {\n var limitType = readByte();\n eatBytes(1);\n var shared = limitType === 0x03;\n dump([limitType], \"limit type\" + (shared ? \" (shared)\" : \"\"));\n var min, max;\n\n if (limitType === 0x01 || limitType === 0x03 // shared limits\n ) {\n var u32min = readU32();\n min = parseInt(u32min.value);\n eatBytes(u32min.nextIndex);\n dump([min], \"min\");\n var u32max = readU32();\n max = parseInt(u32max.value);\n eatBytes(u32max.nextIndex);\n dump([max], \"max\");\n }\n\n if (limitType === 0x00) {\n var _u32min = readU32();\n\n min = parseInt(_u32min.value);\n eatBytes(_u32min.nextIndex);\n dump([min], \"min\");\n }\n\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.limit(min, max, shared);\n } // https://webassembly.github.io/spec/core/binary/types.html#binary-tabletype\n\n\n function parseTableType(index) {\n var name = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withRaw(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.identifier(getUniqueName(\"table\")), String(index));\n var elementTypeByte = readByte();\n eatBytes(1);\n dump([elementTypeByte], \"element type\");\n var elementType = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].tableTypes[elementTypeByte];\n\n if (typeof elementType === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unknown element type in table: \" + toHex(elementType));\n }\n\n var limits = parseLimits();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.table(elementType, limits, name);\n } // https://webassembly.github.io/spec/binary/types.html#global-types\n\n\n function parseGlobalType() {\n var valtypeByte = readByte();\n eatBytes(1);\n var type = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].valtypes[valtypeByte];\n dump([valtypeByte], type);\n\n if (typeof type === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unknown valtype: \" + toHex(valtypeByte));\n }\n\n var globalTypeByte = readByte();\n eatBytes(1);\n var globalType = _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].globalTypes[globalTypeByte];\n dump([globalTypeByte], \"global type (\".concat(globalType, \")\"));\n\n if (typeof globalType === \"undefined\") {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Invalid mutability: \" + toHex(globalTypeByte));\n }\n\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.globalType(type, globalType);\n } // function parseNameModule() {\n // const lenu32 = readVaruint32();\n // eatBytes(lenu32.nextIndex);\n // console.log(\"len\", lenu32);\n // const strlen = lenu32.value;\n // dump([strlen], \"string length\");\n // const bytes = readBytes(strlen);\n // eatBytes(strlen);\n // const value = utf8.decode(bytes);\n // return [t.moduleNameMetadata(value)];\n // }\n // this section contains an array of function names and indices\n\n\n function parseNameSectionFunctions() {\n var functionNames = [];\n var numberOfFunctionsu32 = readU32();\n var numbeOfFunctions = numberOfFunctionsu32.value;\n eatBytes(numberOfFunctionsu32.nextIndex);\n\n for (var i = 0; i < numbeOfFunctions; i++) {\n var indexu32 = readU32();\n var index = indexu32.value;\n eatBytes(indexu32.nextIndex);\n var name = readUTF8String();\n eatBytes(name.nextIndex);\n functionNames.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.functionNameMetadata(name.value, index));\n }\n\n return functionNames;\n }\n\n function parseNameSectionLocals() {\n var localNames = [];\n var numbeOfFunctionsu32 = readU32();\n var numbeOfFunctions = numbeOfFunctionsu32.value;\n eatBytes(numbeOfFunctionsu32.nextIndex);\n\n for (var i = 0; i < numbeOfFunctions; i++) {\n var functionIndexu32 = readU32();\n var functionIndex = functionIndexu32.value;\n eatBytes(functionIndexu32.nextIndex);\n var numLocalsu32 = readU32();\n var numLocals = numLocalsu32.value;\n eatBytes(numLocalsu32.nextIndex);\n\n for (var _i4 = 0; _i4 < numLocals; _i4++) {\n var localIndexu32 = readU32();\n var localIndex = localIndexu32.value;\n eatBytes(localIndexu32.nextIndex);\n var name = readUTF8String();\n eatBytes(name.nextIndex);\n localNames.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.localNameMetadata(name.value, localIndex, functionIndex));\n }\n }\n\n return localNames;\n } // this is a custom section used for name resolution\n // https://github.com/WebAssembly/design/blob/master/BinaryEncoding.md#name-section\n\n\n function parseNameSection(remainingBytes) {\n var nameMetadata = [];\n var initialOffset = offset;\n\n while (offset - initialOffset < remainingBytes) {\n // name_type\n var sectionTypeByte = readVaruint7();\n eatBytes(sectionTypeByte.nextIndex); // name_payload_len\n\n var subSectionSizeInBytesu32 = readVaruint32();\n eatBytes(subSectionSizeInBytesu32.nextIndex);\n\n switch (sectionTypeByte.value) {\n // case 0: {\n // TODO(sven): re-enable that\n // Current status: it seems that when we decode the module's name\n // no name_payload_len is used.\n //\n // See https://github.com/WebAssembly/design/blob/master/BinaryEncoding.md#name-section\n //\n // nameMetadata.push(...parseNameModule());\n // break;\n // }\n case 1:\n {\n nameMetadata.push.apply(nameMetadata, _toConsumableArray(parseNameSectionFunctions()));\n break;\n }\n\n case 2:\n {\n nameMetadata.push.apply(nameMetadata, _toConsumableArray(parseNameSectionLocals()));\n break;\n }\n\n default:\n {\n // skip unknown subsection\n eatBytes(subSectionSizeInBytesu32.value);\n }\n }\n }\n\n return nameMetadata;\n } // this is a custom section used for information about the producers\n // https://github.com/WebAssembly/tool-conventions/blob/master/ProducersSection.md\n\n\n function parseProducersSection() {\n var metadata = _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.producersSectionMetadata([]); // field_count\n\n var sectionTypeByte = readVaruint32();\n eatBytes(sectionTypeByte.nextIndex);\n dump([sectionTypeByte.value], \"num of producers\");\n var fields = {\n language: [],\n \"processed-by\": [],\n sdk: []\n }; // fields\n\n for (var fieldI = 0; fieldI < sectionTypeByte.value; fieldI++) {\n // field_name\n var fieldName = readUTF8String();\n eatBytes(fieldName.nextIndex); // field_value_count\n\n var valueCount = readVaruint32();\n eatBytes(valueCount.nextIndex); // field_values\n\n for (var producerI = 0; producerI < valueCount.value; producerI++) {\n var producerName = readUTF8String();\n eatBytes(producerName.nextIndex);\n var producerVersion = readUTF8String();\n eatBytes(producerVersion.nextIndex);\n fields[fieldName.value].push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.producerMetadataVersionedName(producerName.value, producerVersion.value));\n }\n\n metadata.producers.push(fields[fieldName.value]);\n }\n\n return metadata;\n }\n\n function parseGlobalSection(numberOfGlobals) {\n var globals = [];\n dump([numberOfGlobals], \"num globals\");\n\n for (var i = 0; i < numberOfGlobals; i++) {\n var _startLoc11 = getPosition();\n\n var globalType = parseGlobalType();\n /**\n * Global expressions\n */\n\n var init = [];\n parseInstructionBlock(init);\n\n var node = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.global(globalType, init), endLoc, _startLoc11);\n }();\n\n globals.push(node);\n state.globalsInModule.push(node);\n }\n\n return globals;\n }\n\n function parseElemSection(numberOfElements) {\n var elems = [];\n dump([numberOfElements], \"num elements\");\n\n for (var i = 0; i < numberOfElements; i++) {\n var _startLoc12 = getPosition();\n\n var tableindexu32 = readU32();\n var tableindex = tableindexu32.value;\n eatBytes(tableindexu32.nextIndex);\n dump([tableindex], \"table index\");\n /**\n * Parse instructions\n */\n\n var instr = [];\n parseInstructionBlock(instr);\n /**\n * Parse ( vector function index ) *\n */\n\n var indicesu32 = readU32();\n var indices = indicesu32.value;\n eatBytes(indicesu32.nextIndex);\n dump([indices], \"num indices\");\n var indexValues = [];\n\n for (var _i5 = 0; _i5 < indices; _i5++) {\n var indexu32 = readU32();\n var index = indexu32.value;\n eatBytes(indexu32.nextIndex);\n dump([index], \"index\");\n indexValues.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.indexLiteral(index));\n }\n\n var elemNode = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.elem(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.indexLiteral(tableindex), instr, indexValues), endLoc, _startLoc12);\n }();\n\n elems.push(elemNode);\n }\n\n return elems;\n } // https://webassembly.github.io/spec/core/binary/types.html#memory-types\n\n\n function parseMemoryType(i) {\n var limits = parseLimits();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.memory(limits, _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.indexLiteral(i));\n } // https://webassembly.github.io/spec/binary/modules.html#table-section\n\n\n function parseTableSection(numberOfElements) {\n var tables = [];\n dump([numberOfElements], \"num elements\");\n\n for (var i = 0; i < numberOfElements; i++) {\n var tablesNode = parseTableType(i);\n state.tablesInModule.push(tablesNode);\n tables.push(tablesNode);\n }\n\n return tables;\n } // https://webassembly.github.io/spec/binary/modules.html#memory-section\n\n\n function parseMemorySection(numberOfElements) {\n var memories = [];\n dump([numberOfElements], \"num elements\");\n\n for (var i = 0; i < numberOfElements; i++) {\n var memoryNode = parseMemoryType(i);\n state.memoriesInModule.push(memoryNode);\n memories.push(memoryNode);\n }\n\n return memories;\n } // https://webassembly.github.io/spec/binary/modules.html#binary-startsec\n\n\n function parseStartSection() {\n var startLoc = getPosition();\n var u32 = readU32();\n var startFuncIndex = u32.value;\n eatBytes(u32.nextIndex);\n dump([startFuncIndex], \"index\");\n return function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.withLoc(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.start(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.indexLiteral(startFuncIndex)), endLoc, startLoc);\n }();\n } // https://webassembly.github.io/spec/binary/modules.html#data-section\n\n\n function parseDataSection(numberOfElements) {\n var dataEntries = [];\n dump([numberOfElements], \"num elements\");\n\n for (var i = 0; i < numberOfElements; i++) {\n var memoryIndexu32 = readU32();\n var memoryIndex = memoryIndexu32.value;\n eatBytes(memoryIndexu32.nextIndex);\n dump([memoryIndex], \"memory index\");\n var instrs = [];\n parseInstructionBlock(instrs);\n var hasExtraInstrs = instrs.filter(function (i) {\n return i.id !== \"end\";\n }).length !== 1;\n\n if (hasExtraInstrs) {\n throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"data section offset must be a single instruction\");\n }\n\n var bytes = parseVec(function (b) {\n return b;\n });\n dump([], \"init\");\n dataEntries.push(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.data(_webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.memIndexLiteral(memoryIndex), instrs[0], _webassemblyjs_ast__WEBPACK_IMPORTED_MODULE_3__.byteArray(bytes)));\n }\n\n return dataEntries;\n } // https://webassembly.github.io/spec/binary/modules.html#binary-section\n\n\n function parseSection(sectionIndex) {\n var sectionId = readByte();\n eatBytes(1);\n\n if (sectionId >= sectionIndex || sectionIndex === _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].sections.custom) {\n sectionIndex = sectionId + 1;\n } else {\n if (sectionId !== _webassemblyjs_helper_wasm_bytecode__WEBPACK_IMPORTED_MODULE_5__[\"default\"].sections.custom) throw new _webassemblyjs_helper_api_error__WEBPACK_IMPORTED_MODULE_0__.CompileError(\"Unexpected section: \" + toHex(sectionId));\n }\n\n var nextSectionIndex = sectionIndex;\n var startOffset = offset;\n var startLoc = getPosition();\n var u32 = readU32();\n var sectionSizeInBytes = u32.value;\n eatBytes(u32.nextIndex);\n\n var sectionSizeInBytesNode = function () {\n var endLoc = getPosition();\n return _webassemblyjs_ast__W

Part of diff was cut off due to size limit. Use your local client to view the full diff.