rm node_modules

10 files changed, 0 insertions, 1735 deletions

diff --git a/node_modules/@webassemblyjs/leb128/LICENSE.txt b/node_modules/@webassemblyjs/leb128/LICENSE.txt
deleted file mode 100644
index 55e332a..0000000
--- a/node_modules/@webassemblyjs/leb128/LICENSE.txt
+++ /dev/null
@@ -1,194 +0,0 @@
-Copyright 2012 The Obvious Corporation.
-http://obvious.com/
-
-Licensed under the Apache License, Version 2.0 (the "License");
-you may not use this file except in compliance with the License.
-You may obtain a copy of the License at
-
-http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software
-distributed under the License is distributed on an "AS IS" BASIS,
-WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-See the License for the specific language governing permissions and
-limitations under the License.
-
-
--------------------------------------------------------------------------
-                              Apache License
-                        Version 2.0, January 2004
-                     http://www.apache.org/licenses/
-
-
-TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-1. Definitions.
-
-   "License" shall mean the terms and conditions for use, reproduction,
-   and distribution as defined by Sections 1 through 9 of this document.
-
-   "Licensor" shall mean the copyright owner or entity authorized by
-   the copyright owner that is granting the License.
-
-   "Legal Entity" shall mean the union of the acting entity and all
-   other entities that control, are controlled by, or are under common
-   control with that entity. For the purposes of this definition,
-   "control" means (i) the power, direct or indirect, to cause the
-   direction or management of such entity, whether by contract or
-   otherwise, or (ii) ownership of fifty percent (50%) or more of the
-   outstanding shares, or (iii) beneficial ownership of such entity.
-
-   "You" (or "Your") shall mean an individual or Legal Entity
-   exercising permissions granted by this License.
-
-   "Source" form shall mean the preferred form for making modifications,
-   including but not limited to software source code, documentation
-   source, and configuration files.
-
-   "Object" form shall mean any form resulting from mechanical
-   transformation or translation of a Source form, including but
-   not limited to compiled object code, generated documentation,
-   and conversions to other media types.
-
-   "Work" shall mean the work of authorship, whether in Source or
-   Object form, made available under the License, as indicated by a
-   copyright notice that is included in or attached to the work
-   (an example is provided in the Appendix below).
-
-   "Derivative Works" shall mean any work, whether in Source or Object
-   form, that is based on (or derived from) the Work and for which the
-   editorial revisions, annotations, elaborations, or other modifications
-   represent, as a whole, an original work of authorship. For the purposes
-   of this License, Derivative Works shall not include works that remain
-   separable from, or merely link (or bind by name) to the interfaces of,
-   the Work and Derivative Works thereof.
-
-   "Contribution" shall mean any work of authorship, including
-   the original version of the Work and any modifications or additions
-   to that Work or Derivative Works thereof, that is intentionally
-   submitted to Licensor for inclusion in the Work by the copyright owner
-   or by an individual or Legal Entity authorized to submit on behalf of
-   the copyright owner. For the purposes of this definition, "submitted"
-   means any form of electronic, verbal, or written communication sent
-   to the Licensor or its representatives, including but not limited to
-   communication on electronic mailing lists, source code control systems,
-   and issue tracking systems that are managed by, or on behalf of, the
-   Licensor for the purpose of discussing and improving the Work, but
-   excluding communication that is conspicuously marked or otherwise
-   designated in writing by the copyright owner as "Not a Contribution."
-
-   "Contributor" shall mean Licensor and any individual or Legal Entity
-   on behalf of whom a Contribution has been received by Licensor and
-   subsequently incorporated within the Work.
-
-2. Grant of Copyright License. Subject to the terms and conditions of
-   this License, each Contributor hereby grants to You a perpetual,
-   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-   copyright license to reproduce, prepare Derivative Works of,
-   publicly display, publicly perform, sublicense, and distribute the
-   Work and such Derivative Works in Source or Object form.
-
-3. Grant of Patent License. Subject to the terms and conditions of
-   this License, each Contributor hereby grants to You a perpetual,
-   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-   (except as stated in this section) patent license to make, have made,
-   use, offer to sell, sell, import, and otherwise transfer the Work,
-   where such license applies only to those patent claims licensable
-   by such Contributor that are necessarily infringed by their
-   Contribution(s) alone or by combination of their Contribution(s)
-   with the Work to which such Contribution(s) was submitted. If You
-   institute patent litigation against any entity (including a
-   cross-claim or counterclaim in a lawsuit) alleging that the Work
-   or a Contribution incorporated within the Work constitutes direct
-   or contributory patent infringement, then any patent licenses
-   granted to You under this License for that Work shall terminate
-   as of the date such litigation is filed.
-
-4. Redistribution. You may reproduce and distribute copies of the
-   Work or Derivative Works thereof in any medium, with or without
-   modifications, and in Source or Object form, provided that You
-   meet the following conditions:
-
-   (a) You must give any other recipients of the Work or
-       Derivative Works a copy of this License; and
-
-   (b) You must cause any modified files to carry prominent notices
-       stating that You changed the files; and
-
-   (c) You must retain, in the Source form of any Derivative Works
-       that You distribute, all copyright, patent, trademark, and
-       attribution notices from the Source form of the Work,
-       excluding those notices that do not pertain to any part of
-       the Derivative Works; and
-
-   (d) If the Work includes a "NOTICE" text file as part of its
-       distribution, then any Derivative Works that You distribute must
-       include a readable copy of the attribution notices contained
-       within such NOTICE file, excluding those notices that do not
-       pertain to any part of the Derivative Works, in at least one
-       of the following places: within a NOTICE text file distributed
-       as part of the Derivative Works; within the Source form or
-       documentation, if provided along with the Derivative Works; or,
-       within a display generated by the Derivative Works, if and
-       wherever such third-party notices normally appear. The contents
-       of the NOTICE file are for informational purposes only and
-       do not modify the License. You may add Your own attribution
-       notices within Derivative Works that You distribute, alongside
-       or as an addendum to the NOTICE text from the Work, provided
-       that such additional attribution notices cannot be construed
-       as modifying the License.
-
-   You may add Your own copyright statement to Your modifications and
-   may provide additional or different license terms and conditions
-   for use, reproduction, or distribution of Your modifications, or
-   for any such Derivative Works as a whole, provided Your use,
-   reproduction, and distribution of the Work otherwise complies with
-   the conditions stated in this License.
-
-5. Submission of Contributions. Unless You explicitly state otherwise,
-   any Contribution intentionally submitted for inclusion in the Work
-   by You to the Licensor shall be under the terms and conditions of
-   this License, without any additional terms or conditions.
-   Notwithstanding the above, nothing herein shall supersede or modify
-   the terms of any separate license agreement you may have executed
-   with Licensor regarding such Contributions.
-
-6. Trademarks. This License does not grant permission to use the trade
-   names, trademarks, service marks, or product names of the Licensor,
-   except as required for reasonable and customary use in describing the
-   origin of the Work and reproducing the content of the NOTICE file.
-
-7. Disclaimer of Warranty. Unless required by applicable law or
-   agreed to in writing, Licensor provides the Work (and each
-   Contributor provides its Contributions) on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-   implied, including, without limitation, any warranties or conditions
-   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-   PARTICULAR PURPOSE. You are solely responsible for determining the
-   appropriateness of using or redistributing the Work and assume any
-   risks associated with Your exercise of permissions under this License.
-
-8. Limitation of Liability. In no event and under no legal theory,
-   whether in tort (including negligence), contract, or otherwise,
-   unless required by applicable law (such as deliberate and grossly
-   negligent acts) or agreed to in writing, shall any Contributor be
-   liable to You for damages, including any direct, indirect, special,
-   incidental, or consequential damages of any character arising as a
-   result of this License or out of the use or inability to use the
-   Work (including but not limited to damages for loss of goodwill,
-   work stoppage, computer failure or malfunction, or any and all
-   other commercial damages or losses), even if such Contributor
-   has been advised of the possibility of such damages.
-
-9. Accepting Warranty or Additional Liability. While redistributing
-   the Work or Derivative Works thereof, You may choose to offer,
-   and charge a fee for, acceptance of support, warranty, indemnity,
-   or other liability obligations and/or rights consistent with this
-   License. However, in accepting such obligations, You may act only
-   on Your own behalf and on Your sole responsibility, not on behalf
-   of any other Contributor, and only if You agree to indemnify,
-   defend, and hold each Contributor harmless for any liability
-   incurred by, or claims asserted against, such Contributor by reason
-   of your accepting any such warranty or additional liability.
-
-END OF TERMS AND CONDITIONS
diff --git a/node_modules/@webassemblyjs/leb128/esm/bits.js b/node_modules/@webassemblyjs/leb128/esm/bits.js
deleted file mode 100644
index 4c763cd..0000000
--- a/node_modules/@webassemblyjs/leb128/esm/bits.js
+++ /dev/null
@@ -1,145 +0,0 @@
-// Copyright 2012 The Obvious Corporation.
-
-/*
- * bits: Bitwise buffer utilities. The utilities here treat a buffer
- * as a little-endian bigint, so the lowest-order bit is bit #0 of
- * `buffer[0]`, and the highest-order bit is bit #7 of
- * `buffer[buffer.length - 1]`.
- */
-
-/*
- * Modules used
- */
-"use strict";
-/*
- * Exported bindings
- */
-
-/**
- * Extracts the given number of bits from the buffer at the indicated
- * index, returning a simple number as the result. If bits are requested
- * that aren't covered by the buffer, the `defaultBit` is used as their
- * value.
- *
- * The `bitLength` must be no more than 32. The `defaultBit` if not
- * specified is taken to be `0`.
- */
-
-export function extract(buffer, bitIndex, bitLength, defaultBit) {
-  if (bitLength < 0 || bitLength > 32) {
-    throw new Error("Bad value for bitLength.");
-  }
-
-  if (defaultBit === undefined) {
-    defaultBit = 0;
-  } else if (defaultBit !== 0 && defaultBit !== 1) {
-    throw new Error("Bad value for defaultBit.");
-  }
-
-  var defaultByte = defaultBit * 0xff;
-  var result = 0; // All starts are inclusive. The {endByte, endBit} pair is exclusive, but
-  // if endBit !== 0, then endByte is inclusive.
-
-  var lastBit = bitIndex + bitLength;
-  var startByte = Math.floor(bitIndex / 8);
-  var startBit = bitIndex % 8;
-  var endByte = Math.floor(lastBit / 8);
-  var endBit = lastBit % 8;
-
-  if (endBit !== 0) {
-    // `(1 << endBit) - 1` is the mask of all bits up to but not including
-    // the endBit.
-    result = get(endByte) & (1 << endBit) - 1;
-  }
-
-  while (endByte > startByte) {
-    endByte--;
-    result = result << 8 | get(endByte);
-  }
-
-  result >>>= startBit;
-  return result;
-
-  function get(index) {
-    var result = buffer[index];
-    return result === undefined ? defaultByte : result;
-  }
-}
-/**
- * Injects the given bits into the given buffer at the given index. Any
- * bits in the value beyond the length to set are ignored.
- */
-
-export function inject(buffer, bitIndex, bitLength, value) {
-  if (bitLength < 0 || bitLength > 32) {
-    throw new Error("Bad value for bitLength.");
-  }
-
-  var lastByte = Math.floor((bitIndex + bitLength - 1) / 8);
-
-  if (bitIndex < 0 || lastByte >= buffer.length) {
-    throw new Error("Index out of range.");
-  } // Just keeping it simple, until / unless profiling shows that this
-  // is a problem.
-
-
-  var atByte = Math.floor(bitIndex / 8);
-  var atBit = bitIndex % 8;
-
-  while (bitLength > 0) {
-    if (value & 1) {
-      buffer[atByte] |= 1 << atBit;
-    } else {
-      buffer[atByte] &= ~(1 << atBit);
-    }
-
-    value >>= 1;
-    bitLength--;
-    atBit = (atBit + 1) % 8;
-
-    if (atBit === 0) {
-      atByte++;
-    }
-  }
-}
-/**
- * Gets the sign bit of the given buffer.
- */
-
-export function getSign(buffer) {
-  return buffer[buffer.length - 1] >>> 7;
-}
-/**
- * Gets the zero-based bit number of the highest-order bit with the
- * given value in the given buffer.
- *
- * If the buffer consists entirely of the other bit value, then this returns
- * `-1`.
- */
-
-export function highOrder(bit, buffer) {
-  var length = buffer.length;
-  var fullyWrongByte = (bit ^ 1) * 0xff; // the other-bit extended to a full byte
-
-  while (length > 0 && buffer[length - 1] === fullyWrongByte) {
-    length--;
-  }
-
-  if (length === 0) {
-    // Degenerate case. The buffer consists entirely of ~bit.
-    return -1;
-  }
-
-  var byteToCheck = buffer[length - 1];
-  var result = length * 8 - 1;
-
-  for (var i = 7; i > 0; i--) {
-    if ((byteToCheck >> i & 1) === bit) {
-      break;
-    }
-
-    result--;
-  }
-
-  return result;
-}
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/esm/bufs.js b/node_modules/@webassemblyjs/leb128/esm/bufs.js
deleted file mode 100644
index 7e2a2bf..0000000
--- a/node_modules/@webassemblyjs/leb128/esm/bufs.js
+++ /dev/null
@@ -1,218 +0,0 @@
-// Copyright 2012 The Obvious Corporation.
-
-/*
- * bufs: Buffer utilities.
- */
-
-/*
- * Module variables
- */
-
-/** Pool of buffers, where `bufPool[x].length === x`. */
-var bufPool = [];
-/** Maximum length of kept temporary buffers. */
-
-var TEMP_BUF_MAXIMUM_LENGTH = 20;
-/** Minimum exactly-representable 64-bit int. */
-
-var MIN_EXACT_INT64 = -0x8000000000000000;
-/** Maximum exactly-representable 64-bit int. */
-
-var MAX_EXACT_INT64 = 0x7ffffffffffffc00;
-/** Maximum exactly-representable 64-bit uint. */
-
-var MAX_EXACT_UINT64 = 0xfffffffffffff800;
-/**
- * The int value consisting just of a 1 in bit #32 (that is, one more
- * than the maximum 32-bit unsigned value).
- */
-
-var BIT_32 = 0x100000000;
-/**
- * The int value consisting just of a 1 in bit #64 (that is, one more
- * than the maximum 64-bit unsigned value).
- */
-
-var BIT_64 = 0x10000000000000000;
-/*
- * Helper functions
- */
-
-/**
- * Masks off all but the lowest bit set of the given number.
- */
-
-function lowestBit(num) {
-  return num & -num;
-}
-/**
- * Gets whether trying to add the second number to the first is lossy
- * (inexact). The first number is meant to be an accumulated result.
- */
-
-
-function isLossyToAdd(accum, num) {
-  if (num === 0) {
-    return false;
-  }
-
-  var lowBit = lowestBit(num);
-  var added = accum + lowBit;
-
-  if (added === accum) {
-    return true;
-  }
-
-  if (added - lowBit !== accum) {
-    return true;
-  }
-
-  return false;
-}
-/*
- * Exported functions
- */
-
-/**
- * Allocates a buffer of the given length, which is initialized
- * with all zeroes. This returns a buffer from the pool if it is
- * available, or a freshly-allocated buffer if not.
- */
-
-
-export function alloc(length) {
-  var result = bufPool[length];
-
-  if (result) {
-    bufPool[length] = undefined;
-  } else {
-    result = new Buffer(length);
-  }
-
-  result.fill(0);
-  return result;
-}
-/**
- * Releases a buffer back to the pool.
- */
-
-export function free(buffer) {
-  var length = buffer.length;
-
-  if (length < TEMP_BUF_MAXIMUM_LENGTH) {
-    bufPool[length] = buffer;
-  }
-}
-/**
- * Resizes a buffer, returning a new buffer. Returns the argument if
- * the length wouldn't actually change. This function is only safe to
- * use if the given buffer was allocated within this module (since
- * otherwise the buffer might possibly be shared externally).
- */
-
-export function resize(buffer, length) {
-  if (length === buffer.length) {
-    return buffer;
-  }
-
-  var newBuf = alloc(length);
-  buffer.copy(newBuf);
-  free(buffer);
-  return newBuf;
-}
-/**
- * Reads an arbitrary signed int from a buffer.
- */
-
-export function readInt(buffer) {
-  var length = buffer.length;
-  var positive = buffer[length - 1] < 0x80;
-  var result = positive ? 0 : -1;
-  var lossy = false; // Note: We can't use bit manipulation here, since that stops
-  // working if the result won't fit in a 32-bit int.
-
-  if (length < 7) {
-    // Common case which can't possibly be lossy (because the result has
-    // no more than 48 bits, and loss only happens with 54 or more).
-    for (var i = length - 1; i >= 0; i--) {
-      result = result * 0x100 + buffer[i];
-    }
-  } else {
-    for (var _i = length - 1; _i >= 0; _i--) {
-      var one = buffer[_i];
-      result *= 0x100;
-
-      if (isLossyToAdd(result, one)) {
-        lossy = true;
-      }
-
-      result += one;
-    }
-  }
-
-  return {
-    value: result,
-    lossy: lossy
-  };
-}
-/**
- * Reads an arbitrary unsigned int from a buffer.
- */
-
-export function readUInt(buffer) {
-  var length = buffer.length;
-  var result = 0;
-  var lossy = false; // Note: See above in re bit manipulation.
-
-  if (length < 7) {
-    // Common case which can't possibly be lossy (see above).
-    for (var i = length - 1; i >= 0; i--) {
-      result = result * 0x100 + buffer[i];
-    }
-  } else {
-    for (var _i2 = length - 1; _i2 >= 0; _i2--) {
-      var one = buffer[_i2];
-      result *= 0x100;
-
-      if (isLossyToAdd(result, one)) {
-        lossy = true;
-      }
-
-      result += one;
-    }
-  }
-
-  return {
-    value: result,
-    lossy: lossy
-  };
-}
-/**
- * Writes a little-endian 64-bit signed int into a buffer.
- */
-
-export function writeInt64(value, buffer) {
-  if (value < MIN_EXACT_INT64 || value > MAX_EXACT_INT64) {
-    throw new Error("Value out of range.");
-  }
-
-  if (value < 0) {
-    value += BIT_64;
-  }
-
-  writeUInt64(value, buffer);
-}
-/**
- * Writes a little-endian 64-bit unsigned int into a buffer.
- */
-
-export function writeUInt64(value, buffer) {
-  if (value < 0 || value > MAX_EXACT_UINT64) {
-    throw new Error("Value out of range.");
-  }
-
-  var lowWord = value % BIT_32;
-  var highWord = Math.floor(value / BIT_32);
-  buffer.writeUInt32LE(lowWord, 0);
-  buffer.writeUInt32LE(highWord, 4);
-}
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/esm/index.js b/node_modules/@webassemblyjs/leb128/esm/index.js
deleted file mode 100644
index 7ee23fa..0000000
--- a/node_modules/@webassemblyjs/leb128/esm/index.js
+++ /dev/null
@@ -1,34 +0,0 @@
-import leb from "./leb";
-/**
- * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
- * max = ceil(32/7)
- */
-
-export var MAX_NUMBER_OF_BYTE_U32 = 5;
-/**
- * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
- * max = ceil(64/7)
- */
-
-export var MAX_NUMBER_OF_BYTE_U64 = 10;
-export function decodeInt64(encodedBuffer, index) {
-  return leb.decodeInt64(encodedBuffer, index);
-}
-export function decodeUInt64(encodedBuffer, index) {
-  return leb.decodeUInt64(encodedBuffer, index);
-}
-export function decodeInt32(encodedBuffer, index) {
-  return leb.decodeInt32(encodedBuffer, index);
-}
-export function decodeUInt32(encodedBuffer, index) {
-  return leb.decodeUInt32(encodedBuffer, index);
-}
-export function encodeU32(v) {
-  return leb.encodeUInt32(v);
-}
-export function encodeI32(v) {
-  return leb.encodeInt32(v);
-}
-export function encodeI64(v) {
-  return leb.encodeInt64(v);
-}
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/esm/leb.js b/node_modules/@webassemblyjs/leb128/esm/leb.js
deleted file mode 100644
index 1b6ee09..0000000
--- a/node_modules/@webassemblyjs/leb128/esm/leb.js
+++ /dev/null
@@ -1,316 +0,0 @@
-// Copyright 2012 The Obvious Corporation.
-
-/*
- * leb: LEB128 utilities.
- */
-
-/*
- * Modules used
- */
-"use strict";
-
-import Long from "@xtuc/long";
-import * as bits from "./bits";
-import * as bufs from "./bufs";
-/*
- * Module variables
- */
-
-/** The minimum possible 32-bit signed int. */
-
-var MIN_INT32 = -0x80000000;
-/** The maximum possible 32-bit signed int. */
-
-var MAX_INT32 = 0x7fffffff;
-/** The maximum possible 32-bit unsigned int. */
-
-var MAX_UINT32 = 0xffffffff;
-/** The minimum possible 64-bit signed int. */
-// const MIN_INT64 = -0x8000000000000000;
-
-/**
- * The maximum possible 64-bit signed int that is representable as a
- * JavaScript number.
- */
-// const MAX_INT64 = 0x7ffffffffffffc00;
-
-/**
- * The maximum possible 64-bit unsigned int that is representable as a
- * JavaScript number.
- */
-// const MAX_UINT64 = 0xfffffffffffff800;
-
-/*
- * Helper functions
- */
-
-/**
- * Determines the number of bits required to encode the number
- * represented in the given buffer as a signed value. The buffer is
- * taken to represent a signed number in little-endian form.
- *
- * The number of bits to encode is the (zero-based) bit number of the
- * highest-order non-sign-matching bit, plus two. For example:
- *
- *   11111011 01110101
- *   high          low
- *
- * The sign bit here is 1 (that is, it's a negative number). The highest
- * bit number that doesn't match the sign is bit #10 (where the lowest-order
- * bit is bit #0). So, we have to encode at least 12 bits total.
- *
- * As a special degenerate case, the numbers 0 and -1 each require just one bit.
- */
-
-function signedBitCount(buffer) {
-  return bits.highOrder(bits.getSign(buffer) ^ 1, buffer) + 2;
-}
-/**
- * Determines the number of bits required to encode the number
- * represented in the given buffer as an unsigned value. The buffer is
- * taken to represent an unsigned number in little-endian form.
- *
- * The number of bits to encode is the (zero-based) bit number of the
- * highest-order 1 bit, plus one. For example:
- *
- *   00011000 01010011
- *   high          low
- *
- * The highest-order 1 bit here is bit #12 (where the lowest-order bit
- * is bit #0). So, we have to encode at least 13 bits total.
- *
- * As a special degenerate case, the number 0 requires 1 bit.
- */
-
-
-function unsignedBitCount(buffer) {
-  var result = bits.highOrder(1, buffer) + 1;
-  return result ? result : 1;
-}
-/**
- * Common encoder for both signed and unsigned ints. This takes a
- * bigint-ish buffer, returning an LEB128-encoded buffer.
- */
-
-
-function encodeBufferCommon(buffer, signed) {
-  var signBit;
-  var bitCount;
-
-  if (signed) {
-    signBit = bits.getSign(buffer);
-    bitCount = signedBitCount(buffer);
-  } else {
-    signBit = 0;
-    bitCount = unsignedBitCount(buffer);
-  }
-
-  var byteCount = Math.ceil(bitCount / 7);
-  var result = bufs.alloc(byteCount);
-
-  for (var i = 0; i < byteCount; i++) {
-    var payload = bits.extract(buffer, i * 7, 7, signBit);
-    result[i] = payload | 0x80;
-  } // Mask off the top bit of the last byte, to indicate the end of the
-  // encoding.
-
-
-  result[byteCount - 1] &= 0x7f;
-  return result;
-}
-/**
- * Gets the byte-length of the value encoded in the given buffer at
- * the given index.
- */
-
-
-function encodedLength(encodedBuffer, index) {
-  var result = 0;
-
-  while (encodedBuffer[index + result] >= 0x80) {
-    result++;
-  }
-
-  result++; // to account for the last byte
-
-  if (index + result > encodedBuffer.length) {// FIXME(sven): seems to cause false positives
-    // throw new Error("integer representation too long");
-  }
-
-  return result;
-}
-/**
- * Common decoder for both signed and unsigned ints. This takes an
- * LEB128-encoded buffer, returning a bigint-ish buffer.
- */
-
-
-function decodeBufferCommon(encodedBuffer, index, signed) {
-  index = index === undefined ? 0 : index;
-  var length = encodedLength(encodedBuffer, index);
-  var bitLength = length * 7;
-  var byteLength = Math.ceil(bitLength / 8);
-  var result = bufs.alloc(byteLength);
-  var outIndex = 0;
-
-  while (length > 0) {
-    bits.inject(result, outIndex, 7, encodedBuffer[index]);
-    outIndex += 7;
-    index++;
-    length--;
-  }
-
-  var signBit;
-  var signByte;
-
-  if (signed) {
-    // Sign-extend the last byte.
-    var lastByte = result[byteLength - 1];
-    var endBit = outIndex % 8;
-
-    if (endBit !== 0) {
-      var shift = 32 - endBit; // 32 because JS bit ops work on 32-bit ints.
-
-      lastByte = result[byteLength - 1] = lastByte << shift >> shift & 0xff;
-    }
-
-    signBit = lastByte >> 7;
-    signByte = signBit * 0xff;
-  } else {
-    signBit = 0;
-    signByte = 0;
-  } // Slice off any superfluous bytes, that is, ones that add no meaningful
-  // bits (because the value would be the same if they were removed).
-
-
-  while (byteLength > 1 && result[byteLength - 1] === signByte && (!signed || result[byteLength - 2] >> 7 === signBit)) {
-    byteLength--;
-  }
-
-  result = bufs.resize(result, byteLength);
-  return {
-    value: result,
-    nextIndex: index
-  };
-}
-/*
- * Exported bindings
- */
-
-
-function encodeIntBuffer(buffer) {
-  return encodeBufferCommon(buffer, true);
-}
-
-function decodeIntBuffer(encodedBuffer, index) {
-  return decodeBufferCommon(encodedBuffer, index, true);
-}
-
-function encodeInt32(num) {
-  var buf = bufs.alloc(4);
-  buf.writeInt32LE(num, 0);
-  var result = encodeIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeInt32(encodedBuffer, index) {
-  var result = decodeIntBuffer(encodedBuffer, index);
-  var parsed = bufs.readInt(result.value);
-  var value = parsed.value;
-  bufs.free(result.value);
-
-  if (value < MIN_INT32 || value > MAX_INT32) {
-    throw new Error("integer too large");
-  }
-
-  return {
-    value: value,
-    nextIndex: result.nextIndex
-  };
-}
-
-function encodeInt64(num) {
-  var buf = bufs.alloc(8);
-  bufs.writeInt64(num, buf);
-  var result = encodeIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeInt64(encodedBuffer, index) {
-  var result = decodeIntBuffer(encodedBuffer, index);
-  var value = Long.fromBytesLE(result.value, false);
-  bufs.free(result.value);
-  return {
-    value: value,
-    nextIndex: result.nextIndex,
-    lossy: false
-  };
-}
-
-function encodeUIntBuffer(buffer) {
-  return encodeBufferCommon(buffer, false);
-}
-
-function decodeUIntBuffer(encodedBuffer, index) {
-  return decodeBufferCommon(encodedBuffer, index, false);
-}
-
-function encodeUInt32(num) {
-  var buf = bufs.alloc(4);
-  buf.writeUInt32LE(num, 0);
-  var result = encodeUIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeUInt32(encodedBuffer, index) {
-  var result = decodeUIntBuffer(encodedBuffer, index);
-  var parsed = bufs.readUInt(result.value);
-  var value = parsed.value;
-  bufs.free(result.value);
-
-  if (value > MAX_UINT32) {
-    throw new Error("integer too large");
-  }
-
-  return {
-    value: value,
-    nextIndex: result.nextIndex
-  };
-}
-
-function encodeUInt64(num) {
-  var buf = bufs.alloc(8);
-  bufs.writeUInt64(num, buf);
-  var result = encodeUIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeUInt64(encodedBuffer, index) {
-  var result = decodeUIntBuffer(encodedBuffer, index);
-  var value = Long.fromBytesLE(result.value, true);
-  bufs.free(result.value);
-  return {
-    value: value,
-    nextIndex: result.nextIndex,
-    lossy: false
-  };
-}
-
-export default {
-  decodeInt32: decodeInt32,
-  decodeInt64: decodeInt64,
-  decodeIntBuffer: decodeIntBuffer,
-  decodeUInt32: decodeUInt32,
-  decodeUInt64: decodeUInt64,
-  decodeUIntBuffer: decodeUIntBuffer,
-  encodeInt32: encodeInt32,
-  encodeInt64: encodeInt64,
-  encodeIntBuffer: encodeIntBuffer,
-  encodeUInt32: encodeUInt32,
-  encodeUInt64: encodeUInt64,
-  encodeUIntBuffer: encodeUIntBuffer
-};
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/lib/bits.js b/node_modules/@webassemblyjs/leb128/lib/bits.js
deleted file mode 100644
index 5acf246..0000000
--- a/node_modules/@webassemblyjs/leb128/lib/bits.js
+++ /dev/null
@@ -1,156 +0,0 @@
-// Copyright 2012 The Obvious Corporation.
-
-/*
- * bits: Bitwise buffer utilities. The utilities here treat a buffer
- * as a little-endian bigint, so the lowest-order bit is bit #0 of
- * `buffer[0]`, and the highest-order bit is bit #7 of
- * `buffer[buffer.length - 1]`.
- */
-
-/*
- * Modules used
- */
-"use strict";
-/*
- * Exported bindings
- */
-
-/**
- * Extracts the given number of bits from the buffer at the indicated
- * index, returning a simple number as the result. If bits are requested
- * that aren't covered by the buffer, the `defaultBit` is used as their
- * value.
- *
- * The `bitLength` must be no more than 32. The `defaultBit` if not
- * specified is taken to be `0`.
- */
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.extract = extract;
-exports.inject = inject;
-exports.getSign = getSign;
-exports.highOrder = highOrder;
-
-function extract(buffer, bitIndex, bitLength, defaultBit) {
-  if (bitLength < 0 || bitLength > 32) {
-    throw new Error("Bad value for bitLength.");
-  }
-
-  if (defaultBit === undefined) {
-    defaultBit = 0;
-  } else if (defaultBit !== 0 && defaultBit !== 1) {
-    throw new Error("Bad value for defaultBit.");
-  }
-
-  var defaultByte = defaultBit * 0xff;
-  var result = 0; // All starts are inclusive. The {endByte, endBit} pair is exclusive, but
-  // if endBit !== 0, then endByte is inclusive.
-
-  var lastBit = bitIndex + bitLength;
-  var startByte = Math.floor(bitIndex / 8);
-  var startBit = bitIndex % 8;
-  var endByte = Math.floor(lastBit / 8);
-  var endBit = lastBit % 8;
-
-  if (endBit !== 0) {
-    // `(1 << endBit) - 1` is the mask of all bits up to but not including
-    // the endBit.
-    result = get(endByte) & (1 << endBit) - 1;
-  }
-
-  while (endByte > startByte) {
-    endByte--;
-    result = result << 8 | get(endByte);
-  }
-
-  result >>>= startBit;
-  return result;
-
-  function get(index) {
-    var result = buffer[index];
-    return result === undefined ? defaultByte : result;
-  }
-}
-/**
- * Injects the given bits into the given buffer at the given index. Any
- * bits in the value beyond the length to set are ignored.
- */
-
-
-function inject(buffer, bitIndex, bitLength, value) {
-  if (bitLength < 0 || bitLength > 32) {
-    throw new Error("Bad value for bitLength.");
-  }
-
-  var lastByte = Math.floor((bitIndex + bitLength - 1) / 8);
-
-  if (bitIndex < 0 || lastByte >= buffer.length) {
-    throw new Error("Index out of range.");
-  } // Just keeping it simple, until / unless profiling shows that this
-  // is a problem.
-
-
-  var atByte = Math.floor(bitIndex / 8);
-  var atBit = bitIndex % 8;
-
-  while (bitLength > 0) {
-    if (value & 1) {
-      buffer[atByte] |= 1 << atBit;
-    } else {
-      buffer[atByte] &= ~(1 << atBit);
-    }
-
-    value >>= 1;
-    bitLength--;
-    atBit = (atBit + 1) % 8;
-
-    if (atBit === 0) {
-      atByte++;
-    }
-  }
-}
-/**
- * Gets the sign bit of the given buffer.
- */
-
-
-function getSign(buffer) {
-  return buffer[buffer.length - 1] >>> 7;
-}
-/**
- * Gets the zero-based bit number of the highest-order bit with the
- * given value in the given buffer.
- *
- * If the buffer consists entirely of the other bit value, then this returns
- * `-1`.
- */
-
-
-function highOrder(bit, buffer) {
-  var length = buffer.length;
-  var fullyWrongByte = (bit ^ 1) * 0xff; // the other-bit extended to a full byte
-
-  while (length > 0 && buffer[length - 1] === fullyWrongByte) {
-    length--;
-  }
-
-  if (length === 0) {
-    // Degenerate case. The buffer consists entirely of ~bit.
-    return -1;
-  }
-
-  var byteToCheck = buffer[length - 1];
-  var result = length * 8 - 1;
-
-  for (var i = 7; i > 0; i--) {
-    if ((byteToCheck >> i & 1) === bit) {
-      break;
-    }
-
-    result--;
-  }
-
-  return result;
-}
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/lib/bufs.js b/node_modules/@webassemblyjs/leb128/lib/bufs.js
deleted file mode 100644
index f9a176e..0000000
--- a/node_modules/@webassemblyjs/leb128/lib/bufs.js
+++ /dev/null
@@ -1,236 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.alloc = alloc;
-exports.free = free;
-exports.resize = resize;
-exports.readInt = readInt;
-exports.readUInt = readUInt;
-exports.writeInt64 = writeInt64;
-exports.writeUInt64 = writeUInt64;
-// Copyright 2012 The Obvious Corporation.
-
-/*
- * bufs: Buffer utilities.
- */
-
-/*
- * Module variables
- */
-
-/** Pool of buffers, where `bufPool[x].length === x`. */
-var bufPool = [];
-/** Maximum length of kept temporary buffers. */
-
-var TEMP_BUF_MAXIMUM_LENGTH = 20;
-/** Minimum exactly-representable 64-bit int. */
-
-var MIN_EXACT_INT64 = -0x8000000000000000;
-/** Maximum exactly-representable 64-bit int. */
-
-var MAX_EXACT_INT64 = 0x7ffffffffffffc00;
-/** Maximum exactly-representable 64-bit uint. */
-
-var MAX_EXACT_UINT64 = 0xfffffffffffff800;
-/**
- * The int value consisting just of a 1 in bit #32 (that is, one more
- * than the maximum 32-bit unsigned value).
- */
-
-var BIT_32 = 0x100000000;
-/**
- * The int value consisting just of a 1 in bit #64 (that is, one more
- * than the maximum 64-bit unsigned value).
- */
-
-var BIT_64 = 0x10000000000000000;
-/*
- * Helper functions
- */
-
-/**
- * Masks off all but the lowest bit set of the given number.
- */
-
-function lowestBit(num) {
-  return num & -num;
-}
-/**
- * Gets whether trying to add the second number to the first is lossy
- * (inexact). The first number is meant to be an accumulated result.
- */
-
-
-function isLossyToAdd(accum, num) {
-  if (num === 0) {
-    return false;
-  }
-
-  var lowBit = lowestBit(num);
-  var added = accum + lowBit;
-
-  if (added === accum) {
-    return true;
-  }
-
-  if (added - lowBit !== accum) {
-    return true;
-  }
-
-  return false;
-}
-/*
- * Exported functions
- */
-
-/**
- * Allocates a buffer of the given length, which is initialized
- * with all zeroes. This returns a buffer from the pool if it is
- * available, or a freshly-allocated buffer if not.
- */
-
-
-function alloc(length) {
-  var result = bufPool[length];
-
-  if (result) {
-    bufPool[length] = undefined;
-  } else {
-    result = new Buffer(length);
-  }
-
-  result.fill(0);
-  return result;
-}
-/**
- * Releases a buffer back to the pool.
- */
-
-
-function free(buffer) {
-  var length = buffer.length;
-
-  if (length < TEMP_BUF_MAXIMUM_LENGTH) {
-    bufPool[length] = buffer;
-  }
-}
-/**
- * Resizes a buffer, returning a new buffer. Returns the argument if
- * the length wouldn't actually change. This function is only safe to
- * use if the given buffer was allocated within this module (since
- * otherwise the buffer might possibly be shared externally).
- */
-
-
-function resize(buffer, length) {
-  if (length === buffer.length) {
-    return buffer;
-  }
-
-  var newBuf = alloc(length);
-  buffer.copy(newBuf);
-  free(buffer);
-  return newBuf;
-}
-/**
- * Reads an arbitrary signed int from a buffer.
- */
-
-
-function readInt(buffer) {
-  var length = buffer.length;
-  var positive = buffer[length - 1] < 0x80;
-  var result = positive ? 0 : -1;
-  var lossy = false; // Note: We can't use bit manipulation here, since that stops
-  // working if the result won't fit in a 32-bit int.
-
-  if (length < 7) {
-    // Common case which can't possibly be lossy (because the result has
-    // no more than 48 bits, and loss only happens with 54 or more).
-    for (var i = length - 1; i >= 0; i--) {
-      result = result * 0x100 + buffer[i];
-    }
-  } else {
-    for (var _i = length - 1; _i >= 0; _i--) {
-      var one = buffer[_i];
-      result *= 0x100;
-
-      if (isLossyToAdd(result, one)) {
-        lossy = true;
-      }
-
-      result += one;
-    }
-  }
-
-  return {
-    value: result,
-    lossy: lossy
-  };
-}
-/**
- * Reads an arbitrary unsigned int from a buffer.
- */
-
-
-function readUInt(buffer) {
-  var length = buffer.length;
-  var result = 0;
-  var lossy = false; // Note: See above in re bit manipulation.
-
-  if (length < 7) {
-    // Common case which can't possibly be lossy (see above).
-    for (var i = length - 1; i >= 0; i--) {
-      result = result * 0x100 + buffer[i];
-    }
-  } else {
-    for (var _i2 = length - 1; _i2 >= 0; _i2--) {
-      var one = buffer[_i2];
-      result *= 0x100;
-
-      if (isLossyToAdd(result, one)) {
-        lossy = true;
-      }
-
-      result += one;
-    }
-  }
-
-  return {
-    value: result,
-    lossy: lossy
-  };
-}
-/**
- * Writes a little-endian 64-bit signed int into a buffer.
- */
-
-
-function writeInt64(value, buffer) {
-  if (value < MIN_EXACT_INT64 || value > MAX_EXACT_INT64) {
-    throw new Error("Value out of range.");
-  }
-
-  if (value < 0) {
-    value += BIT_64;
-  }
-
-  writeUInt64(value, buffer);
-}
-/**
- * Writes a little-endian 64-bit unsigned int into a buffer.
- */
-
-
-function writeUInt64(value, buffer) {
-  if (value < 0 || value > MAX_EXACT_UINT64) {
-    throw new Error("Value out of range.");
-  }
-
-  var lowWord = value % BIT_32;
-  var highWord = Math.floor(value / BIT_32);
-  buffer.writeUInt32LE(lowWord, 0);
-  buffer.writeUInt32LE(highWord, 4);
-}
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/lib/index.js b/node_modules/@webassemblyjs/leb128/lib/index.js
deleted file mode 100644
index 6687537..0000000
--- a/node_modules/@webassemblyjs/leb128/lib/index.js
+++ /dev/null
@@ -1,59 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.decodeInt64 = decodeInt64;
-exports.decodeUInt64 = decodeUInt64;
-exports.decodeInt32 = decodeInt32;
-exports.decodeUInt32 = decodeUInt32;
-exports.encodeU32 = encodeU32;
-exports.encodeI32 = encodeI32;
-exports.encodeI64 = encodeI64;
-exports.MAX_NUMBER_OF_BYTE_U64 = exports.MAX_NUMBER_OF_BYTE_U32 = void 0;
-
-var _leb = _interopRequireDefault(require("./leb"));
-
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
-/**
- * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
- * max = ceil(32/7)
- */
-var MAX_NUMBER_OF_BYTE_U32 = 5;
-/**
- * According to https://webassembly.github.io/spec/core/binary/values.html#binary-int
- * max = ceil(64/7)
- */
-
-exports.MAX_NUMBER_OF_BYTE_U32 = MAX_NUMBER_OF_BYTE_U32;
-var MAX_NUMBER_OF_BYTE_U64 = 10;
-exports.MAX_NUMBER_OF_BYTE_U64 = MAX_NUMBER_OF_BYTE_U64;
-
-function decodeInt64(encodedBuffer, index) {
-  return _leb.default.decodeInt64(encodedBuffer, index);
-}
-
-function decodeUInt64(encodedBuffer, index) {
-  return _leb.default.decodeUInt64(encodedBuffer, index);
-}
-
-function decodeInt32(encodedBuffer, index) {
-  return _leb.default.decodeInt32(encodedBuffer, index);
-}
-
-function decodeUInt32(encodedBuffer, index) {
-  return _leb.default.decodeUInt32(encodedBuffer, index);
-}
-
-function encodeU32(v) {
-  return _leb.default.encodeUInt32(v);
-}
-
-function encodeI32(v) {
-  return _leb.default.encodeInt32(v);
-}
-
-function encodeI64(v) {
-  return _leb.default.encodeInt64(v);
-}
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/lib/leb.js b/node_modules/@webassemblyjs/leb128/lib/leb.js
deleted file mode 100644
index 3c1d4aa..0000000
--- a/node_modules/@webassemblyjs/leb128/lib/leb.js
+++ /dev/null
@@ -1,332 +0,0 @@
-// Copyright 2012 The Obvious Corporation.
-
-/*
- * leb: LEB128 utilities.
- */
-
-/*
- * Modules used
- */
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-
-var _long = _interopRequireDefault(require("@xtuc/long"));
-
-var bits = _interopRequireWildcard(require("./bits"));
-
-var bufs = _interopRequireWildcard(require("./bufs"));
-
-function _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; } }
-
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
-/*
- * Module variables
- */
-
-/** The minimum possible 32-bit signed int. */
-var MIN_INT32 = -0x80000000;
-/** The maximum possible 32-bit signed int. */
-
-var MAX_INT32 = 0x7fffffff;
-/** The maximum possible 32-bit unsigned int. */
-
-var MAX_UINT32 = 0xffffffff;
-/** The minimum possible 64-bit signed int. */
-// const MIN_INT64 = -0x8000000000000000;
-
-/**
- * The maximum possible 64-bit signed int that is representable as a
- * JavaScript number.
- */
-// const MAX_INT64 = 0x7ffffffffffffc00;
-
-/**
- * The maximum possible 64-bit unsigned int that is representable as a
- * JavaScript number.
- */
-// const MAX_UINT64 = 0xfffffffffffff800;
-
-/*
- * Helper functions
- */
-
-/**
- * Determines the number of bits required to encode the number
- * represented in the given buffer as a signed value. The buffer is
- * taken to represent a signed number in little-endian form.
- *
- * The number of bits to encode is the (zero-based) bit number of the
- * highest-order non-sign-matching bit, plus two. For example:
- *
- *   11111011 01110101
- *   high          low
- *
- * The sign bit here is 1 (that is, it's a negative number). The highest
- * bit number that doesn't match the sign is bit #10 (where the lowest-order
- * bit is bit #0). So, we have to encode at least 12 bits total.
- *
- * As a special degenerate case, the numbers 0 and -1 each require just one bit.
- */
-
-function signedBitCount(buffer) {
-  return bits.highOrder(bits.getSign(buffer) ^ 1, buffer) + 2;
-}
-/**
- * Determines the number of bits required to encode the number
- * represented in the given buffer as an unsigned value. The buffer is
- * taken to represent an unsigned number in little-endian form.
- *
- * The number of bits to encode is the (zero-based) bit number of the
- * highest-order 1 bit, plus one. For example:
- *
- *   00011000 01010011
- *   high          low
- *
- * The highest-order 1 bit here is bit #12 (where the lowest-order bit
- * is bit #0). So, we have to encode at least 13 bits total.
- *
- * As a special degenerate case, the number 0 requires 1 bit.
- */
-
-
-function unsignedBitCount(buffer) {
-  var result = bits.highOrder(1, buffer) + 1;
-  return result ? result : 1;
-}
-/**
- * Common encoder for both signed and unsigned ints. This takes a
- * bigint-ish buffer, returning an LEB128-encoded buffer.
- */
-
-
-function encodeBufferCommon(buffer, signed) {
-  var signBit;
-  var bitCount;
-
-  if (signed) {
-    signBit = bits.getSign(buffer);
-    bitCount = signedBitCount(buffer);
-  } else {
-    signBit = 0;
-    bitCount = unsignedBitCount(buffer);
-  }
-
-  var byteCount = Math.ceil(bitCount / 7);
-  var result = bufs.alloc(byteCount);
-
-  for (var i = 0; i < byteCount; i++) {
-    var payload = bits.extract(buffer, i * 7, 7, signBit);
-    result[i] = payload | 0x80;
-  } // Mask off the top bit of the last byte, to indicate the end of the
-  // encoding.
-
-
-  result[byteCount - 1] &= 0x7f;
-  return result;
-}
-/**
- * Gets the byte-length of the value encoded in the given buffer at
- * the given index.
- */
-
-
-function encodedLength(encodedBuffer, index) {
-  var result = 0;
-
-  while (encodedBuffer[index + result] >= 0x80) {
-    result++;
-  }
-
-  result++; // to account for the last byte
-
-  if (index + result > encodedBuffer.length) {// FIXME(sven): seems to cause false positives
-    // throw new Error("integer representation too long");
-  }
-
-  return result;
-}
-/**
- * Common decoder for both signed and unsigned ints. This takes an
- * LEB128-encoded buffer, returning a bigint-ish buffer.
- */
-
-
-function decodeBufferCommon(encodedBuffer, index, signed) {
-  index = index === undefined ? 0 : index;
-  var length = encodedLength(encodedBuffer, index);
-  var bitLength = length * 7;
-  var byteLength = Math.ceil(bitLength / 8);
-  var result = bufs.alloc(byteLength);
-  var outIndex = 0;
-
-  while (length > 0) {
-    bits.inject(result, outIndex, 7, encodedBuffer[index]);
-    outIndex += 7;
-    index++;
-    length--;
-  }
-
-  var signBit;
-  var signByte;
-
-  if (signed) {
-    // Sign-extend the last byte.
-    var lastByte = result[byteLength - 1];
-    var endBit = outIndex % 8;
-
-    if (endBit !== 0) {
-      var shift = 32 - endBit; // 32 because JS bit ops work on 32-bit ints.
-
-      lastByte = result[byteLength - 1] = lastByte << shift >> shift & 0xff;
-    }
-
-    signBit = lastByte >> 7;
-    signByte = signBit * 0xff;
-  } else {
-    signBit = 0;
-    signByte = 0;
-  } // Slice off any superfluous bytes, that is, ones that add no meaningful
-  // bits (because the value would be the same if they were removed).
-
-
-  while (byteLength > 1 && result[byteLength - 1] === signByte && (!signed || result[byteLength - 2] >> 7 === signBit)) {
-    byteLength--;
-  }
-
-  result = bufs.resize(result, byteLength);
-  return {
-    value: result,
-    nextIndex: index
-  };
-}
-/*
- * Exported bindings
- */
-
-
-function encodeIntBuffer(buffer) {
-  return encodeBufferCommon(buffer, true);
-}
-
-function decodeIntBuffer(encodedBuffer, index) {
-  return decodeBufferCommon(encodedBuffer, index, true);
-}
-
-function encodeInt32(num) {
-  var buf = bufs.alloc(4);
-  buf.writeInt32LE(num, 0);
-  var result = encodeIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeInt32(encodedBuffer, index) {
-  var result = decodeIntBuffer(encodedBuffer, index);
-  var parsed = bufs.readInt(result.value);
-  var value = parsed.value;
-  bufs.free(result.value);
-
-  if (value < MIN_INT32 || value > MAX_INT32) {
-    throw new Error("integer too large");
-  }
-
-  return {
-    value: value,
-    nextIndex: result.nextIndex
-  };
-}
-
-function encodeInt64(num) {
-  var buf = bufs.alloc(8);
-  bufs.writeInt64(num, buf);
-  var result = encodeIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeInt64(encodedBuffer, index) {
-  var result = decodeIntBuffer(encodedBuffer, index);
-
-  var value = _long.default.fromBytesLE(result.value, false);
-
-  bufs.free(result.value);
-  return {
-    value: value,
-    nextIndex: result.nextIndex,
-    lossy: false
-  };
-}
-
-function encodeUIntBuffer(buffer) {
-  return encodeBufferCommon(buffer, false);
-}
-
-function decodeUIntBuffer(encodedBuffer, index) {
-  return decodeBufferCommon(encodedBuffer, index, false);
-}
-
-function encodeUInt32(num) {
-  var buf = bufs.alloc(4);
-  buf.writeUInt32LE(num, 0);
-  var result = encodeUIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeUInt32(encodedBuffer, index) {
-  var result = decodeUIntBuffer(encodedBuffer, index);
-  var parsed = bufs.readUInt(result.value);
-  var value = parsed.value;
-  bufs.free(result.value);
-
-  if (value > MAX_UINT32) {
-    throw new Error("integer too large");
-  }
-
-  return {
-    value: value,
-    nextIndex: result.nextIndex
-  };
-}
-
-function encodeUInt64(num) {
-  var buf = bufs.alloc(8);
-  bufs.writeUInt64(num, buf);
-  var result = encodeUIntBuffer(buf);
-  bufs.free(buf);
-  return result;
-}
-
-function decodeUInt64(encodedBuffer, index) {
-  var result = decodeUIntBuffer(encodedBuffer, index);
-
-  var value = _long.default.fromBytesLE(result.value, true);
-
-  bufs.free(result.value);
-  return {
-    value: value,
-    nextIndex: result.nextIndex,
-    lossy: false
-  };
-}
-
-var _default = {
-  decodeInt32: decodeInt32,
-  decodeInt64: decodeInt64,
-  decodeIntBuffer: decodeIntBuffer,
-  decodeUInt32: decodeUInt32,
-  decodeUInt64: decodeUInt64,
-  decodeUIntBuffer: decodeUIntBuffer,
-  encodeInt32: encodeInt32,
-  encodeInt64: encodeInt64,
-  encodeIntBuffer: encodeIntBuffer,
-  encodeUInt32: encodeUInt32,
-  encodeUInt64: encodeUInt64,
-  encodeUIntBuffer: encodeUIntBuffer
-};
-exports.default = _default;
\ No newline at end of file
diff --git a/node_modules/@webassemblyjs/leb128/package.json b/node_modules/@webassemblyjs/leb128/package.json
deleted file mode 100644
index 5a5c2e3..0000000
--- a/node_modules/@webassemblyjs/leb128/package.json
+++ /dev/null
@@ -1,45 +0,0 @@
-{
-  "_from": "@webassemblyjs/leb128@1.9.0",
-  "_id": "@webassemblyjs/leb128@1.9.0",
-  "_inBundle": false,
-  "_integrity": "sha512-ENVzM5VwV1ojs9jam6vPys97B/S65YQtv/aanqnU7D8aSoHFX8GyhGg0CMfyKNIHBuAVjy3tlzd5QMMINa7wpw==",
-  "_location": "/@webassemblyjs/leb128",
-  "_phantomChildren": {},
-  "_requested": {
-    "type": "version",
-    "registry": true,
-    "raw": "@webassemblyjs/leb128@1.9.0",
-    "name": "@webassemblyjs/leb128",
-    "escapedName": "@webassemblyjs%2fleb128",
-    "scope": "@webassemblyjs",
-    "rawSpec": "1.9.0",
-    "saveSpec": null,
-    "fetchSpec": "1.9.0"
-  },
-  "_requiredBy": [
-    "/@webassemblyjs/wasm-gen",
-    "/@webassemblyjs/wasm-parser"
-  ],
-  "_resolved": "https://registry.npmjs.org/@webassemblyjs/leb128/-/leb128-1.9.0.tgz",
-  "_shasum": "f19ca0b76a6dc55623a09cffa769e838fa1e1c95",
-  "_spec": "@webassemblyjs/leb128@1.9.0",
-  "_where": "/home/pruss/Dev/3-minute-website/node_modules/@webassemblyjs/wasm-gen",
-  "bundleDependencies": false,
-  "dependencies": {
-    "@xtuc/long": "4.2.2"
-  },
-  "deprecated": false,
-  "description": "LEB128 decoder and encoder",
-  "gitHead": "0440b420888c1f7701eb9762ec657775506b87d8",
-  "license": "MIT",
-  "main": "lib/index.js",
-  "module": "esm/index.js",
-  "name": "@webassemblyjs/leb128",
-  "publishConfig": {
-    "access": "public"
-  },
-  "scripts": {
-    "test": "echo \"Error: no test specified\" && exit 1"
-  },
-  "version": "1.9.0"
-}